Switching lemma

In computational complexity theory, Håstad's switching lemma is a key tool for proving lower bounds on the size of constant-depth Boolean circuits. It was first introduced by Johan Håstad to prove that AC⁰ Boolean circuits of depth k require size $\exp(\Omega (n^{1/(k-1)}))$ to compute the parity function on $n$ bits. He was later awarded the Gödel Prize for this work in 1994.

The switching lemma describes the behavior of a depth-2 circuit under random restriction, i.e. when randomly fixing most of the coordinates to 0 or 1. Specifically, from the lemma, it follows that a formula in conjunctive normal form (that is, an AND of ORs) becomes a formula in disjunctive normal form (an OR of ANDs) under random restriction, and vice versa. This "switching" gives the lemma its name.

Statement

Consider a width-$w$ formula in disjunctive normal form $F=C_{1}\vee C_{2}\vee \cdots \vee C_{m}$, the OR of clauses $C_{\ell }$ which are the AND of w literals ($x_{i}$ or its negation $\neg x_{i}$). For example, $(\neg x_{1}\wedge x_{2})\vee (x_{2}\wedge x_{3})\vee (x_{2}\wedge x_{3})$ is an example of a formula in this form with width 2.

Let $F|R_{p}$ denote the formula under a random restriction: each $x_{i}$ is set independently to 0 or 1 with probability $(1-p)/2$. Then, for a sufficiently large constant C, the switching lemma states that

$\Pr[\operatorname {DT} (F\mid R_{p})\geq t]<C(pw)^{t},$

where $\operatorname {DT} (f)$ denotes decision tree complexity, the number of bits of $x$ needed to compute the function $f$.

Proof

Intuitively, the switching lemma holds because DNF formulas shrink significantly under random restriction: when a literal in a clause is set to 0, the whole AND clause evaluates to zero, and therefore can be discarded.

The original proof of the switching lemma (Håstad 1987) involves an argument with conditional probabilities. Arguably simpler proofs have been subsequently given by Razborov (1993) and Beame (1994). For an introduction, see Chapter 14 in Arora & Barak (2009).

Bounds on AC⁰ circuits

The switching lemma is a key tool used for understanding the circuit complexity class AC⁰, which consists of constant-depth circuits consisting of AND, OR, and NOT. Håstad's initial application of this lemma was to establish tight exponential lower bounds for such circuits computing PARITY, improving on the prior super-polynomial lower bounds of Merrick Furst, James Saxe and Michael Sipser and independently Miklós Ajtai. This is done by applying the switching lemma $d-1$ times, where $d$ is the depth of the circuit: each application removes a layer of the circuit until one is left with a very simple circuit, whereas PARITY is still PARITY under random restriction, and so remains complex. So, a circuit that computes PARITY must have high depth.

The switching lemma is the basis for bounds on the Fourier spectrum of AC⁰ circuits and algorithms for learning such circuits.

See also

• AC⁰
• Boolean circuit
• Circuit satisfiability
• Circuit value problem
• Parity function

References

• Arora, Sanjeev; Barak, Boaz (2009), Computational Complexity: A Modern Approach, Cambridge, ISBN 978-0-521-42426-4, Zbl 1193.68112
• Beame, Paul (1994), "A Switching Lemma Primer", Manuscript
• Håstad, Johan (1987), Computational limitations of small depth circuits (PDF), Ph.D. thesis, Massachusetts Institute of Technology.
• Razborov, Alexander A. (1993), "An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic", Arithmetic, Proof Theory and Computational Complexity, 23: 247–277, doi:10.1093/oso/9780198536901.003.0012, ISBN 978-0-19-853690-1