Analysis of Boolean Functions in Lean

9.1. Low-degree polynomials are reasonable🔗

Theorem9.1.1
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.2
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 0XL∃∀N

The Hypercontractivity Theorem. Let f:\{-1,1\}^n\to\mathbb R and 1\le p\le q\le\infty. If 0\le\rho\le\sqrt{\frac{p-1}{q-1}}, then \|T_\rho f\|_q\le\|f\|_p. The book defers the proof to Chapter 10; this node supplies no assumption.

Theorem9.1.2
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 3
Statement dependency previews
Preview
Definition 9.1.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Theorem 9.1.12
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Bonami Lemma. If f:\{-1,1\}^n\to\mathbb R has degree at most k, then \|f\|_4\le(\sqrt3)^k\|f\|_2, \qquad \mathbb E[f^4]\le9^k\mathbb E[f^2]^2.

Lean code for Theorem9.1.21 theorem
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.bonamiLemma_fourthMoment {n k : } (f : FABL.SignCube n  )
      (hdegree : FABL.fourierDegree f  k) :
      (Finset.univ.expect fun x => f x ^ 4) 
        9 ^ k * (Finset.univ.expect fun x => f x ^ 2) ^ 2
    theorem FABL.bonamiLemma_fourthMoment {n k : }
      (f : FABL.SignCube n  )
      (hdegree : FABL.fourierDegree f  k) :
      (Finset.univ.expect fun x => f x ^ 4) 
        9 ^ k *
          (Finset.univ.expect fun x =>
              f x ^ 2) ^
            2
    The Bonami Lemma in fourth-moment form. 
Theorem9.1.3
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 2
Statement dependency previews
Preview
Theorem 9.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 7
Reverse dependency previews
Preview
Theorem 9.5.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

$(2,q)$-Hypercontractivity Theorem. For 2\le q\le\infty, \left\|T_{1/\sqrt{q-1}}f\right\|_q\le\|f\|_2. Consequently, if \deg(f)\le k, then \|f\|_q\le(\sqrt{q-1})^k\|f\|_2.

Lean code for Theorem9.1.32 theorems
  • theoremdefined in FABL/Chapter09/ProductHypercontractivity.lean
    complete
    theorem FABL.twoQHypercontractivity_of_two_lt {n : } (q : ) (hq : 2 < q)
      (f : FABL.SignCube n  ) :
      FABL.uniformLpNorm q ((FABL.noiseOperator (1 / (q - 1))) f) 
        FABL.uniformLpNorm 2 f
    theorem FABL.twoQHypercontractivity_of_two_lt
      {n : } (q : ) (hq : 2 < q)
      (f : FABL.SignCube n  ) :
      FABL.uniformLpNorm q
          ((FABL.noiseOperator (1 / (q - 1)))
            f) 
        FABL.uniformLpNorm 2 f
    The dual `(2,q)` theorem for `q > 2`. 
  • theoremdefined in FABL/Chapter09/ProductHypercontractivity.lean
    complete
    theorem FABL.twoQHypercontractivity {n : } (q : ) (hq : 2  q)
      (f : FABL.SignCube n  ) :
      FABL.uniformLpNorm q ((FABL.noiseOperator (1 / (q - 1))) f) 
        FABL.uniformLpNorm 2 f
    theorem FABL.twoQHypercontractivity {n : }
      (q : ) (hq : 2  q)
      (f : FABL.SignCube n  ) :
      FABL.uniformLpNorm q
          ((FABL.noiseOperator (1 / (q - 1)))
            f) 
        FABL.uniformLpNorm 2 f
    The full finite-exponent `n`-bit `(2,q)`-Hypercontractivity Theorem. 
Theorem9.1.4
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 2
Statement dependency previews
Preview
Theorem 9.3.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 6
Reverse dependency previews
Preview
Lemma 9.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

$(p,2)$-Hypercontractivity Theorem. For 1\le p\le2, \|T_{\sqrt{p-1}}f\|_2\le\|f\|_p. Equivalently, for 0\le\rho\le1, \operatorname{Stab}_\rho[f]\le\|f\|_{1+\rho}^2.

Lean code for Theorem9.1.42 theorems
  • theoremdefined in FABL/Chapter09/ProductHypercontractivity.lean
    complete
    theorem FABL.pTwoHypercontractivity {n : } (p : ) (hp1 : 1  p) (hp2 : p  2)
      (f : FABL.SignCube n  ) :
      FABL.uniformLpNorm 2 ((FABL.noiseOperator (p - 1)) f) 
        FABL.uniformLpNorm p f
    theorem FABL.pTwoHypercontractivity {n : }
      (p : ) (hp1 : 1  p) (hp2 : p  2)
      (f : FABL.SignCube n  ) :
      FABL.uniformLpNorm 2
          ((FABL.noiseOperator (p - 1)) f) 
        FABL.uniformLpNorm p f
    The full `n`-bit `(p,2)`-Hypercontractivity Theorem with the sharp correlation. 
  • theoremdefined in FABL/Chapter09/ProductHypercontractivity.lean
    complete
    theorem FABL.noiseStability_pSubOne_le_uniformLpNorm_sq (n : ) (p : )
      (hp1 : 1  p) (hp2 : p  2) (f : FABL.SignCube n  ) :
      FABL.uniformInner f ((FABL.noiseOperator (p - 1)) f) 
        FABL.uniformLpNorm p f ^ 2
    theorem FABL.noiseStability_pSubOne_le_uniformLpNorm_sq
      (n : ) (p : ) (hp1 : 1  p)
      (hp2 : p  2)
      (f : FABL.SignCube n  ) :
      FABL.uniformInner f
          ((FABL.noiseOperator (p - 1)) f) 
        FABL.uniformLpNorm p f ^ 2
    Stability form of the full `n`-bit `(p,2)` theorem. 
Definition9.1.5
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 8
Reverse dependency previews
Preview
Theorem 9.1.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Definition 9.1. For B\ge1, a real random variable X is B-reasonable when \mathbb E[X^4]\le B\mathbb E[X^2]^2. Equivalently, \|X\|_4\le B^{1/4}\|X\|_2.

Lean code for Definition9.1.52 declarations
  • defdefined in FABL/Chapter09/Reasonableness.lean
    complete
    def FABL.IsReasonable.{u_1} {Ω : Type u_1} [Fintype Ω] (p : PMF Ω) (B : )
      (X : Ω  ) : Prop
    def FABL.IsReasonable.{u_1} {Ω : Type u_1}
      [Fintype Ω] (p : PMF Ω) (B : )
      (X : Ω  ) : Prop
    O'Donnell, Definition 9.1: a finite real random variable is `B`-reasonable when
    `B ≥ 1` and its fourth moment is at most `B` times the square of its second moment. 
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.isReasonable_const_mul_iff.{u_1} {Ω : Type u_1} [Fintype Ω]
      (p : PMF Ω) (B c : ) (hc : c  0) (X : Ω  ) :
      (FABL.IsReasonable p B fun x => c * X x)  FABL.IsReasonable p B X
    theorem FABL.isReasonable_const_mul_iff.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω)
      (B c : ) (hc : c  0) (X : Ω  ) :
      (FABL.IsReasonable p B fun x =>
          c * X x) 
        FABL.IsReasonable p B X
    Scaling by a nonzero constant preserves reasonableness. 
Lemma9.1.6
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 0L∃∀N

Example 9.2. A uniform sign is 1-reasonable, a standard Gaussian is 3-reasonable, and the uniform law on [-1,1] is 9/5-reasonable. If Y=1 with probability 2^{-n} and Y=0 otherwise, then Y is not B-reasonable unless B\ge2^n.

Lean code for Lemma9.1.614 declarations
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.uniformSign_isReasonable :
      FABL.IsReasonable (FABL.uniformPMF FABL.Sign) 1 FABL.signValue
    theorem FABL.uniformSign_isReasonable :
      FABL.IsReasonable
        (FABL.uniformPMF FABL.Sign) 1
        FABL.signValue
    O'Donnell, Example 9.2: a uniformly random sign is `1`-reasonable. 
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.sparseBernoulli_isReasonable (n : ) :
      let q := 1 / 2 ^ n;
      have hq := ;
      FABL.IsReasonable (FABL.pBiasedBitPMF q hq) (2 ^ n) FABL.zeroOneValue
    theorem FABL.sparseBernoulli_isReasonable
      (n : ) :
      let q := 1 / 2 ^ n;
      have hq := ;
      FABL.IsReasonable
        (FABL.pBiasedBitPMF q hq) (2 ^ n)
        FABL.zeroOneValue
    O'Donnell, Example 9.2: the Bernoulli variable of success probability `2⁻ⁿ` is
    `2ⁿ`-reasonable. 
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.sparseBernoulli_not_reasonable_of_lt (n : ) {B : }
      (hB : B < 2 ^ n) :
      let q := 1 / 2 ^ n;
      have hq := ;
      ¬FABL.IsReasonable (FABL.pBiasedBitPMF q hq) B FABL.zeroOneValue
    theorem FABL.sparseBernoulli_not_reasonable_of_lt
      (n : ) {B : } (hB : B < 2 ^ n) :
      let q := 1 / 2 ^ n;
      have hq := ;
      ¬FABL.IsReasonable
          (FABL.pBiasedBitPMF q hq) B
          FABL.zeroOneValue
    The same sparse Bernoulli example cannot be `B`-reasonable with `B < 2ⁿ`. 
  • defdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    def FABL.IsReasonableMeasure.{u_1} {Ω : Type u_1} [MeasurableSpace Ω]
      (μ : MeasureTheory.Measure Ω) (B : ) (X : Ω  ) : Prop
    def FABL.IsReasonableMeasure.{u_1}
      {Ω : Type u_1} [MeasurableSpace Ω]
      (μ : MeasureTheory.Measure Ω) (B : )
      (X : Ω  ) : Prop
    Measure-theoretic extension of Definition 9.1 for the continuous examples in the book. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.standardGaussian_secondMoment :
       (x : ), x ^ 2 ProbabilityTheory.gaussianReal 0 1 = 1
    theorem FABL.standardGaussian_secondMoment :
       (x : ),
          x ^
            2 ProbabilityTheory.gaussianReal
            0 1 =
        1
    The standard Gaussian has second moment one. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.standardGaussian_fourthMoment :
       (x : ), x ^ 4 ProbabilityTheory.gaussianReal 0 1 = 3
    theorem FABL.standardGaussian_fourthMoment :
       (x : ),
          x ^
            4 ProbabilityTheory.gaussianReal
            0 1 =
        3
    The standard Gaussian has fourth moment three. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.standardGaussian_isThreeReasonable :
      FABL.IsReasonableMeasure (ProbabilityTheory.gaussianReal 0 1) 3
        fun x => x
    theorem FABL.standardGaussian_isThreeReasonable :
      FABL.IsReasonableMeasure
        (ProbabilityTheory.gaussianReal 0 1) 3
        fun x => x
    Example 9.2: a standard Gaussian is `3`-reasonable. 
  • defdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    def FABL.uniformIntervalMoment (m : ) : 
    def FABL.uniformIntervalMoment (m : ) : 
    The normalized `m`-th moment of the uniform law on `[-1,1]`. 
  • defdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    def FABL.uniformIntervalMeasure : MeasureTheory.Measure 
    def FABL.uniformIntervalMeasure :
      MeasureTheory.Measure 
    The uniform probability measure on the interval `[-1,1]`. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.integral_pow_uniformIntervalMeasure (m : ) :
       (x : ), x ^ m FABL.uniformIntervalMeasure =
        FABL.uniformIntervalMoment m
    theorem FABL.integral_pow_uniformIntervalMeasure
      (m : ) :
       (x : ),
          x ^ m FABL.uniformIntervalMeasure =
        FABL.uniformIntervalMoment m
    Integration against the uniform interval measure is normalized interval integration. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.uniformIntervalMoment_two : FABL.uniformIntervalMoment 2 = 1 / 3
    theorem FABL.uniformIntervalMoment_two :
      FABL.uniformIntervalMoment 2 = 1 / 3
    The uniform law on `[-1,1]` has second moment `1/3`. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.uniformIntervalMoment_four : FABL.uniformIntervalMoment 4 = 1 / 5
    theorem FABL.uniformIntervalMoment_four :
      FABL.uniformIntervalMoment 4 = 1 / 5
    The uniform law on `[-1,1]` has fourth moment `1/5`. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.uniformInterval_isNineFifthsReasonable :
      FABL.uniformIntervalMoment 4 
        9 / 5 * FABL.uniformIntervalMoment 2 ^ 2
    theorem FABL.uniformInterval_isNineFifthsReasonable :
      FABL.uniformIntervalMoment 4 
        9 / 5 *
          FABL.uniformIntervalMoment 2 ^ 2
    The normalized interval moments satisfy the sharp `9/5` reasonableness identity. 
  • theoremdefined in FABL/Chapter09/ContinuousReasonableness.lean
    complete
    theorem FABL.uniformIntervalMeasure_isNineFifthsReasonable :
      FABL.IsReasonableMeasure FABL.uniformIntervalMeasure (9 / 5) fun x =>
        x
    theorem FABL.uniformIntervalMeasure_isNineFifthsReasonable :
      FABL.IsReasonableMeasure
        FABL.uniformIntervalMeasure (9 / 5)
        fun x => x
    Example 9.2: the uniform probability law on `[-1,1]` is `9/5`-reasonable. 
Theorem9.1.7
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1L∃∀N

Proposition 9.3. If X\not\equiv0 is B-reasonable, then for every t>0, \Pr[|X|\ge t\|X\|_2]\le\frac{B}{t^4}.

Lean code for Theorem9.1.71 theorem
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.reasonable_tail_le.{u_1} {Ω : Type u_1} [Fintype Ω] (p : PMF Ω)
      (B : ) (X : Ω  ) (hX : FABL.IsReasonable p B X)
      (hne : FABL.NonzeroUnder p X) (t : ) (ht : 0 < t) :
      (FABL.pmfEventProbability p fun x =>
          t * (FABL.pmfExpectation p fun y => X y ^ 2)  |X x|) 
        B / t ^ 4
    theorem FABL.reasonable_tail_le.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω)
      (B : ) (X : Ω  )
      (hX : FABL.IsReasonable p B X)
      (hne : FABL.NonzeroUnder p X) (t : )
      (ht : 0 < t) :
      (FABL.pmfEventProbability p fun x =>
          t *
              (FABL.pmfExpectation p fun y =>
                  X y ^ 2) 
            |X x|) 
        B / t ^ 4
    O'Donnell, Proposition 9.3: a reasonable random variable has a fourth-moment tail bound. 
Theorem9.1.8
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1
Used by 3
Reverse dependency previews
Preview
Theorem 9.1.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Proposition 9.4. If X\not\equiv0 is B-reasonable, then for every t\in[0,1], \Pr[|X|>t\|X\|_2] \ge\frac{(1-t^2)^2}{B}.

Lean code for Theorem9.1.82 theorems
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.pmfPaleyZygmund.{u_1} {Ω : Type u_1} [Fintype Ω] (p : PMF Ω)
      (Y : Ω  ) (hY :  (x : Ω), 0  Y x) (θ : ) (hθ₀ : 0  θ)
      (hθ₁ : θ < 1) :
      (1 - θ) ^ 2 * FABL.pmfExpectation p Y ^ 2 
        (FABL.pmfEventProbability p fun x =>
            θ * FABL.pmfExpectation p Y < Y x) *
          FABL.pmfExpectation p fun x => Y x ^ 2
    theorem FABL.pmfPaleyZygmund.{u_1} {Ω : Type u_1}
      [Fintype Ω] (p : PMF Ω) (Y : Ω  )
      (hY :  (x : Ω), 0  Y x) (θ : )
      (hθ₀ : 0  θ) (hθ₁ : θ < 1) :
      (1 - θ) ^ 2 *
          FABL.pmfExpectation p Y ^ 2 
        (FABL.pmfEventProbability p fun x =>
            θ * FABL.pmfExpectation p Y <
              Y x) *
          FABL.pmfExpectation p fun x =>
            Y x ^ 2
    Finite-PMF Paley--Zygmund inequality, with the strict event used in Proposition 9.4. 
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.reasonable_anticoncentration.{u_1} {Ω : Type u_1} [Fintype Ω]
      (p : PMF Ω) (B : ) (X : Ω  ) (hX : FABL.IsReasonable p B X)
      (hne : FABL.NonzeroUnder p X) (t : ) (ht : t  Set.Icc 0 1) :
      (1 - t ^ 2) ^ 2 / B 
        FABL.pmfEventProbability p fun x =>
          t * (FABL.pmfExpectation p fun y => X y ^ 2) < |X x|
    theorem FABL.reasonable_anticoncentration.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω)
      (B : ) (X : Ω  )
      (hX : FABL.IsReasonable p B X)
      (hne : FABL.NonzeroUnder p X) (t : )
      (ht : t  Set.Icc 0 1) :
      (1 - t ^ 2) ^ 2 / B 
        FABL.pmfEventProbability p fun x =>
          t *
              (FABL.pmfExpectation p fun y =>
                  X y ^ 2) <
            |X x|
    O'Donnell, Proposition 9.4: a reasonable random variable has strict-event
    anticoncentration. 
Theorem9.1.9
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 0L∃∀N

Proposition 9.5. Let X be a discrete random variable with finite range and probability mass function \pi. If \lambda=\min_{x\in\operatorname{range}(X)}\Pr[X=x], then X is 1/\lambda-reasonable.

Lean code for Theorem9.1.94 declarations
  • defdefined in FABL/Chapter09/Reasonableness.lean
    complete
    def FABL.pmfPositiveSupport.{u_1} {Ω : Type u_1} [Fintype Ω] (p : PMF Ω) :
      Finset Ω
    def FABL.pmfPositiveSupport.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω) :
      Finset Ω
    The finite support of a PMF, excluding ambient values of mass zero. 
  • defdefined in FABL/Chapter09/Reasonableness.lean
    complete
    def FABL.minimumPositiveAtom.{u_1} {Ω : Type u_1} [Fintype Ω] (p : PMF Ω) :
      
    def FABL.minimumPositiveAtom.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω) :
      
    The smallest positive atom of a PMF on a finite ambient type. 
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.minimumPositiveAtom_pos.{u_1} {Ω : Type u_1} [Fintype Ω]
      (p : PMF Ω) : 0 < FABL.minimumPositiveAtom p
    theorem FABL.minimumPositiveAtom_pos.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω) :
      0 < FABL.minimumPositiveAtom p
    On a finite space, the minimum positive atom is strictly positive. 
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.reasonable_of_minimumPositiveAtom.{u_1} {Ω : Type u_1} [Fintype Ω]
      (p : PMF Ω) (X : Ω  ) :
      FABL.IsReasonable p (1 / FABL.minimumPositiveAtom p) X
    theorem FABL.reasonable_of_minimumPositiveAtom.{u_1}
      {Ω : Type u_1} [Fintype Ω] (p : PMF Ω)
      (X : Ω  ) :
      FABL.IsReasonable p
        (1 / FABL.minimumPositiveAtom p) X
    O'Donnell, Proposition 9.5: a finite discrete random variable is
    `1 / minimumPositiveAtom`-reasonable. 
Lemma9.1.10
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1
Used by 3
Reverse dependency previews
Preview
Theorem 9.1.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

For the decomposition f=x_nd+e, where d=D_nf and e=E_nf do not depend on x_n, independence and the sign moments give \mathbb E[f^4] =\mathbb E[d^4]+6\mathbb E[d^2e^2]+\mathbb E[e^4]. \tag{9.1}

Lean code for Lemma9.1.101 theorem
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.equation9_1_expect_fourth {n : } (d e : FABL.SignCube n  )
      (f : FABL.SignCube (n + 1)  )
      (hf :
         (b : FABL.Sign) (x : Fin n  FABL.Sign),
          f (Fin.cons b x) = FABL.signValue b * d x + e x) :
      (Finset.univ.expect fun x => f x ^ 4) =
        ((Finset.univ.expect fun x => d x ^ 4) +
            6 * Finset.univ.expect fun x => d x ^ 2 * e x ^ 2) +
          Finset.univ.expect fun x => e x ^ 4
    theorem FABL.equation9_1_expect_fourth {n : }
      (d e : FABL.SignCube n  )
      (f : FABL.SignCube (n + 1)  )
      (hf :
         (b : FABL.Sign)
          (x : Fin n  FABL.Sign),
          f (Fin.cons b x) =
            FABL.signValue b * d x + e x) :
      (Finset.univ.expect fun x => f x ^ 4) =
        ((Finset.univ.expect fun x =>
              d x ^ 4) +
            6 *
              Finset.univ.expect fun x =>
                d x ^ 2 * e x ^ 2) +
          Finset.univ.expect fun x => e x ^ 4
    Equation (9.1), delegated to the canonical odd/even fourth-moment identity from the FKN
    development. 
Lemma9.1.11
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1
Used by 3
Reverse dependency previews
Preview
Theorem 9.1.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

In the same decomposition, \mathbb E[f^2]=\mathbb E[d^2]+\mathbb E[e^2]. \tag{9.2}

Lean code for Lemma9.1.111 theorem
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.equation9_2_expect_sq {n : } (d e : FABL.SignCube n  )
      (f : FABL.SignCube (n + 1)  )
      (hf :
         (b : FABL.Sign) (x : Fin n  FABL.Sign),
          f (Fin.cons b x) = FABL.signValue b * d x + e x) :
      (Finset.univ.expect fun x => f x ^ 2) =
        (Finset.univ.expect fun x => d x ^ 2) +
          Finset.univ.expect fun x => e x ^ 2
    theorem FABL.equation9_2_expect_sq {n : }
      (d e : FABL.SignCube n  )
      (f : FABL.SignCube (n + 1)  )
      (hf :
         (b : FABL.Sign)
          (x : Fin n  FABL.Sign),
          f (Fin.cons b x) =
            FABL.signValue b * d x + e x) :
      (Finset.univ.expect fun x => f x ^ 2) =
        (Finset.univ.expect fun x =>
            d x ^ 2) +
          Finset.univ.expect fun x => e x ^ 2
    Equation (9.2), delegated to the canonical odd/even slicing identity from the FKN
    development. 
Theorem9.1.12
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1L∃∀N

Corollary 9.6. Let X_1,ldots,X_n be independent random variables satisfying \mathbb E[X_i]=\mathbb E[X_i^3]=0 and suppose every X_i is B-reasonable. If F is a multilinear polynomial of degree at most k, then F(X_1,ldots,X_n) is \max(B,9)^k-reasonable.

Lean code for Theorem9.1.126 declarations
  • defdefined in FABL/Chapter09/ReasonableProductPolynomials.lean
    complete
    def FABL.multilinearEvenCoefficients {n : }
      (a : Finset (Fin (n + 1))  ) : Finset (Fin n)  
    def FABL.multilinearEvenCoefficients {n : }
      (a : Finset (Fin (n + 1))  ) :
      Finset (Fin n)  
    Coefficients of terms not containing the first variable. 
  • defdefined in FABL/Chapter09/ReasonableProductPolynomials.lean
    complete
    def FABL.multilinearOddCoefficients {n : } (a : Finset (Fin (n + 1))  ) :
      Finset (Fin n)  
    def FABL.multilinearOddCoefficients {n : }
      (a : Finset (Fin (n + 1))  ) :
      Finset (Fin n)  
    Coefficients of terms containing the first variable, after removing that variable. 
  • defdefined in FABL/Chapter09/ReasonableProductPolynomials.lean
    complete
    def FABL.productMultilinearPolynomial {n : } :
      (Finset (Fin n)  )  (Fin n  )  
    def FABL.productMultilinearPolynomial
      {n : } :
      (Finset (Fin n)  )  (Fin n  )  
    Evaluation of a multilinear polynomial from its square-free monomial coefficients.
    
    At arity `n + 1`, the definition is the canonical decomposition `x₀ * D + E`. 
  • defdefined in FABL/Chapter09/ReasonableProductPolynomials.lean
    complete
    def FABL.MultilinearDegreeAtMost {n : } (a : Finset (Fin n)  ) (k : ) :
      Prop
    def FABL.MultilinearDegreeAtMost {n : }
      (a : Finset (Fin n)  ) (k : ) : Prop
    The coefficient-support formulation of degree at most `k`. 
  • defdefined in FABL/Chapter09/ReasonableProductPolynomials.lean
    complete
    def FABL.productMultilinearRandomVariable.{u_1} {n : }
      {Ω : Fin n  Type u_1} (a : Finset (Fin n)  )
      (X : (i : Fin n)  Ω i  ) (ω : (i : Fin n)  Ω i) : 
    def FABL.productMultilinearRandomVariable.{u_1}
      {n : } {Ω : Fin n  Type u_1}
      (a : Finset (Fin n)  )
      (X : (i : Fin n)  Ω i  )
      (ω : (i : Fin n)  Ω i) : 
    Evaluate a coefficient-form multilinear polynomial on coordinate random variables. 
  • theoremdefined in FABL/Chapter09/ReasonableProductPolynomials.lean
    complete
    theorem FABL.reasonableProductPolynomial_isReasonable.{u_1} {n : }
      {Ω : Fin n  Type u_1} [(i : Fin n)  Fintype (Ω i)]
      (p : (i : Fin n)  PMF (Ω i)) (X : (i : Fin n)  Ω i  ) (B : )
      (a : Finset (Fin n)  ) (k : )
      (hmean :  (i : Fin n), FABL.pmfExpectation (p i) (X i) = 0)
      (hthird :
         (i : Fin n), (FABL.pmfExpectation (p i) fun z => X i z ^ 3) = 0)
      (hreasonable :  (i : Fin n), FABL.IsReasonable (p i) B (X i))
      (hdegree : FABL.MultilinearDegreeAtMost a k) :
      FABL.IsReasonable (FABL.independentProductPMF p) (max B 9 ^ k)
        (FABL.productMultilinearRandomVariable a X)
    theorem FABL.reasonableProductPolynomial_isReasonable.{u_1}
      {n : } {Ω : Fin n  Type u_1}
      [(i : Fin n)  Fintype (Ω i)]
      (p : (i : Fin n)  PMF (Ω i))
      (X : (i : Fin n)  Ω i  ) (B : )
      (a : Finset (Fin n)  ) (k : )
      (hmean :
         (i : Fin n),
          FABL.pmfExpectation (p i) (X i) = 0)
      (hthird :
         (i : Fin n),
          (FABL.pmfExpectation (p i) fun z =>
              X i z ^ 3) =
            0)
      (hreasonable :
         (i : Fin n),
          FABL.IsReasonable (p i) B (X i))
      (hdegree :
        FABL.MultilinearDegreeAtMost a k) :
      FABL.IsReasonable
        (FABL.independentProductPMF p)
        (max B 9 ^ k)
        (FABL.productMultilinearRandomVariable
          a X)
    Corollary 9.6: a degree-at-most-`k` multilinear polynomial in independent centered,
    zero-third-moment, `B`-reasonable finite random variables is `max(B,9)^k`-reasonable. 
Theorem9.1.13
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 2
Statement dependency previews
Preview
Theorem 9.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Theorem 9.1.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Theorem 9.7. Let f:\{-1,1\}^n\to\mathbb R be nonconstant of degree at most k, write \mu=\mathbb E[f], and let \sigma^2=\operatorname{Var}[f]. Then \Pr\left[|f(x)-\mu|>\frac12\sigma\right] \ge\frac1{16}\,9^{-k}.

Lean code for Theorem9.1.131 theorem
  • theoremdefined in FABL/Chapter09/Reasonableness.lean
    complete
    theorem FABL.lowDegree_anticoncentration {n : } (f : FABL.SignCube n  )
      (k : ) (hdegree : FABL.fourierDegree f  k)
      (hf : ¬ c,  (x : FABL.SignCube n), f x = c) :
      9 / 16 / 9 ^ k 
        FABL.uniformProbability fun x =>
          1 / 2 * (FABL.variance f) < |f x - FABL.mean f|
    theorem FABL.lowDegree_anticoncentration {n : }
      (f : FABL.SignCube n  ) (k : )
      (hdegree : FABL.fourierDegree f  k)
      (hf :
        ¬ c,
             (x : FABL.SignCube n),
              f x = c) :
      9 / 16 / 9 ^ k 
        FABL.uniformProbability fun x =>
          1 / 2 * (FABL.variance f) <
            |f x - FABL.mean f|
    O'Donnell, Theorem 9.7: a nonconstant degree-`k` function differs from its mean by more
    than half a standard deviation with probability at least `(9/16) / 9^k`.  This is the book's
    `(1/16) * 9^(1-k)` constant, written without a negative natural exponent. 
Theorem9.1.14
Group: Chapter 9: Basics of hypercontractivity (100)
Group member previews
Preview
Theorem 9.1.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 3
Statement dependency previews
Preview
Theorem 2.5.13
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1L∃∀N

FKN Theorem, proof in Section 9.1. If f:\{-1,1\}^n\to\{-1,1\} satisfies W^1[f]=1-\delta, then f is O(\delta)-close to \pm\chi_i for some coordinate i. This proof reuses the canonical Chapter 2 declaration rather than creating a second public theorem.

Lean code for Theorem9.1.142 theorems
  • theoremdefined in FABL/Chapter02/FKN.lean
    complete
    theorem FABL.expect_centeredSingletonSquare_sq_le {n : }
      (f : FABL.BooleanFunction n) (δ : ) (hδ₀ : 0  δ) ( : δ  1 / 1600)
      (hweight : FABL.fourierWeightAtLevel 1 f.toReal = 1 - δ) :
      (Finset.univ.expect fun x =>
          FABL.centeredLinearSquare
              (fun i => FABL.fourierCoeff f.toReal {i}) x ^
            2) 
        6400 * δ
    theorem FABL.expect_centeredSingletonSquare_sq_le
      {n : } (f : FABL.BooleanFunction n)
      (δ : ) (hδ₀ : 0  δ)
      ( : δ  1 / 1600)
      (hweight :
        FABL.fourierWeightAtLevel 1 f.toReal =
          1 - δ) :
      (Finset.univ.expect fun x =>
          FABL.centeredLinearSquare
              (fun i =>
                FABL.fourierCoeff f.toReal
                  {i})
              x ^
            2) 
        6400 * δ
    The main analytic estimate in the proof of FKN: the square of the level-one part has
    variance at most `6400 * δ`. 
  • theoremdefined in FABL/Chapter02/FKN.lean
    complete
    theorem FABL.fkn_small {n : } (f : FABL.BooleanFunction n) (hn : 0 < n) (δ : )
      (hδ₀ : 0  δ) ( : δ  1 / 1600)
      (hweight : FABL.fourierWeightAtLevel 1 f.toReal = 1 - δ) :
       i,
        FABL.relativeHammingDist f (FABL.dictator i)  1601 * δ 
          FABL.relativeHammingDist f (-FABL.dictator i)  1601 * δ
    theorem FABL.fkn_small {n : }
      (f : FABL.BooleanFunction n)
      (hn : 0 < n) (δ : ) (hδ₀ : 0  δ)
      ( : δ  1 / 1600)
      (hweight :
        FABL.fourierWeightAtLevel 1 f.toReal =
          1 - δ) :
       i,
        FABL.relativeHammingDist f
              (FABL.dictator i) 
            1601 * δ 
          FABL.relativeHammingDist f
              (-FABL.dictator i) 
            1601 * δ
    The explicit small-error FKN theorem.