Analysis of Boolean Functions in Lean

2.4. Noise stability🔗

Definition2.4.1
uses 1
Used by 2
Reverse dependency previews
Preview
Definition 2.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Definition 2.40. Let \rho\in[0,1] and fix x\in\{-1,1\}^n. The notation \boldsymbol y\sim N_\rho(x) means that the coordinates of \boldsymbol y are drawn independently, with \boldsymbol y_i= \begin{cases} x_i & \text{with probability }\rho,\\ \text{a uniformly random bit} & \text{with probability }1-\rho. \end{cases} Equivalently, and extending the notation to every \rho\in[-1,1], \boldsymbol y_i= \begin{cases} x_i & \text{with probability }\frac12+\frac12\rho,\\ -x_i & \text{with probability }\frac12-\frac12\rho. \end{cases} We say that \boldsymbol y is \rho-correlated to x.

Lean code for Definition2.4.18 declarations
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.correlationKeepProbability (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      NNReal
    def FABL.correlationKeepProbability (ρ : )
      ( : ρ  Set.Icc (-1) 1) : NNReal
    O'Donnell, Definition 2.40: the probability of retaining a coordinate in the equivalent
    second formulation. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.coordinateNoisePMF (ρ : ) ( : ρ  Set.Icc (-1) 1)
      (x : FABL.Sign) : PMF FABL.Sign
    def FABL.coordinateNoisePMF (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (x : FABL.Sign) : PMF FABL.Sign
    O'Donnell, Definition 2.40: the one-coordinate noise distribution which retains `x`
    with probability `(1 + ρ) / 2` and reverses it with probability `(1 - ρ) / 2`. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.nonnegativeCorrelationProbability (ρ : ) ( : ρ  Set.Icc 0 1) :
      NNReal
    def FABL.nonnegativeCorrelationProbability
      (ρ : ) ( : ρ  Set.Icc 0 1) : NNReal
    O'Donnell, Definition 2.40: for nonnegative correlation, the probability with which the
    first construction retains the original coordinate. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.coordinateResamplingNoisePMF (ρ : ) ( : ρ  Set.Icc 0 1)
      (x : FABL.Sign) : PMF FABL.Sign
    def FABL.coordinateResamplingNoisePMF (ρ : )
      ( : ρ  Set.Icc 0 1) (x : FABL.Sign) :
      PMF FABL.Sign
    O'Donnell, Definition 2.40, first construction: retain a coordinate with probability `ρ`;
    otherwise replace it by an independent uniform sign. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    theorem FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF (ρ : )
      ( : ρ  Set.Icc 0 1) (x : FABL.Sign) :
      FABL.coordinateResamplingNoisePMF ρ  x =
        FABL.coordinateNoisePMF ρ  x
    theorem FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF
      (ρ : ) ( : ρ  Set.Icc 0 1)
      (x : FABL.Sign) :
      FABL.coordinateResamplingNoisePMF ρ 
          x =
        FABL.coordinateNoisePMF ρ  x
    O'Donnell, Definition 2.40: on `ρ ∈ [0,1]`, retaining with probability `ρ` and otherwise
    resampling uniformly is exactly the same one-coordinate law as reversing with probability
    `(1-ρ)/2`. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.noiseKernel {n : } (ρ : ) ( : ρ  Set.Icc (-1) 1)
      (x : FABL.SignCube n) : PMF (FABL.SignCube n)
    def FABL.noiseKernel {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (x : FABL.SignCube n) :
      PMF (FABL.SignCube n)
    O'Donnell, Definition 2.40: `Nρ(x)`, the independent coordinate noise kernel on the
    sign cube. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.resamplingNoiseKernel {n : } (ρ : ) ( : ρ  Set.Icc 0 1)
      (x : FABL.SignCube n) : PMF (FABL.SignCube n)
    def FABL.resamplingNoiseKernel {n : } (ρ : )
      ( : ρ  Set.Icc 0 1)
      (x : FABL.SignCube n) :
      PMF (FABL.SignCube n)
    O'Donnell, Definition 2.40, first construction on the full cube: coordinates are retained
    independently with probability `ρ` and otherwise resampled independently and uniformly. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    theorem FABL.resamplingNoiseKernel_eq_noiseKernel {n : } (ρ : )
      ( : ρ  Set.Icc 0 1) (x : FABL.SignCube n) :
      FABL.resamplingNoiseKernel ρ  x = FABL.noiseKernel ρ  x
    theorem FABL.resamplingNoiseKernel_eq_noiseKernel
      {n : } (ρ : ) ( : ρ  Set.Icc 0 1)
      (x : FABL.SignCube n) :
      FABL.resamplingNoiseKernel ρ  x =
        FABL.noiseKernel ρ  x
    O'Donnell, Definition 2.40: the resampling and bit-reversal constructions of `Nρ(x)` agree
    for every `ρ ∈ [0,1]`. 
Definition2.4.2
Statement uses 2
Statement dependency previews
Preview
Definition 1.3.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 2.4.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Definition 2.41. Draw \boldsymbol x uniformly from \{-1,1\}^n and then draw \boldsymbol y\sim N_\rho(\boldsymbol x). The resulting (\boldsymbol x,\boldsymbol y) is called a \rho-correlated pair of random strings. This definition is symmetric in \boldsymbol x and \boldsymbol y. Equivalently, independently for every i\in[n], the pair (\boldsymbol x_i,\boldsymbol y_i) satisfies \mathbb E[\boldsymbol x_i]=\mathbb E[\boldsymbol y_i]=0, \qquad \mathbb E[\boldsymbol x_i\boldsymbol y_i]=\rho.

Lean code for Definition2.4.25 declarations
  • defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    def FABL.correlatedPairPMF {n : } (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      PMF (FABL.SignCube n × FABL.SignCube n)
    def FABL.correlatedPairPMF {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) :
      PMF (FABL.SignCube n × FABL.SignCube n)
    O'Donnell, Definition 2.41: the joint law of a uniform string and a conditionally
    `ρ`-correlated string. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    theorem FABL.correlatedPairPMF_map_swap {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) :
      PMF.map Prod.swap (FABL.correlatedPairPMF ρ ) =
        FABL.correlatedPairPMF ρ 
    theorem FABL.correlatedPairPMF_map_swap {n : }
      (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      PMF.map Prod.swap
          (FABL.correlatedPairPMF ρ ) =
        FABL.correlatedPairPMF ρ 
    O'Donnell, Definition 2.41: exchanging the two strings preserves the joint law. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    theorem FABL.correlatedPairPMF_expect_signValue_fst {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (i : Fin n) :
      (FABL.pmfExpectation (FABL.correlatedPairPMF ρ ) fun xy =>
          FABL.signValue (xy.1 i)) =
        0
    theorem FABL.correlatedPairPMF_expect_signValue_fst
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (i : Fin n) :
      (FABL.pmfExpectation
          (FABL.correlatedPairPMF ρ )
          fun xy => FABL.signValue (xy.1 i)) =
        0
    O'Donnell, Definition 2.41: every coordinate of the first string in a correlated pair has
    mean zero. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    theorem FABL.correlatedPairPMF_expect_signValue_snd {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (i : Fin n) :
      (FABL.pmfExpectation (FABL.correlatedPairPMF ρ ) fun xy =>
          FABL.signValue (xy.2 i)) =
        0
    theorem FABL.correlatedPairPMF_expect_signValue_snd
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (i : Fin n) :
      (FABL.pmfExpectation
          (FABL.correlatedPairPMF ρ )
          fun xy => FABL.signValue (xy.2 i)) =
        0
    O'Donnell, Definition 2.41: every coordinate of the second string in a correlated pair has
    mean zero. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseKernels.lean
    complete
    theorem FABL.correlatedPairPMF_expect_signValue_mul {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (i : Fin n) :
      (FABL.pmfExpectation (FABL.correlatedPairPMF ρ ) fun xy =>
          FABL.signValue (xy.1 i) * FABL.signValue (xy.2 i)) =
        ρ
    theorem FABL.correlatedPairPMF_expect_signValue_mul
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (i : Fin n) :
      (FABL.pmfExpectation
          (FABL.correlatedPairPMF ρ )
          fun xy =>
          FABL.signValue (xy.1 i) *
            FABL.signValue (xy.2 i)) =
        ρ
    O'Donnell, Definition 2.41: corresponding coordinates of a `ρ`-correlated pair have
    correlation `ρ`. 
Definition2.4.3
uses 1
Used by 6
Reverse dependency previews
L∃∀N

Definition 2.42. For f:\{-1,1\}^n\to\mathbb R and \rho\in[-1,1], the noise stability of f at \rho is \operatorname{Stab}_\rho[f] =\mathbb E_{(\boldsymbol x,\boldsymbol y)\ \rho\text{-correlated}} [f(\boldsymbol x)f(\boldsymbol y)]. If f:\{-1,1\}^n\to\{-1,1\}, then \operatorname{Stab}_\rho[f] =\Pr[f(\boldsymbol x)=f(\boldsymbol y)] -\Pr[f(\boldsymbol x)\ne f(\boldsymbol y)] =2\Pr[f(\boldsymbol x)=f(\boldsymbol y)]-1, where all probabilities are over a \rho-correlated pair.

Lean code for Definition2.4.35 declarations
  • defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    def FABL.noiseStability {n : } (ρ : ) ( : ρ  Set.Icc (-1) 1)
      (f : FABL.SignCube n  ) : 
    def FABL.noiseStability {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.SignCube n  ) : 
    O'Donnell, Definition 2.42: noise stability is the expected product over the honest
    `ρ`-correlated pair distribution. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    def FABL.correlatedAgreementProbability {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : 
    def FABL.correlatedAgreementProbability
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.BooleanFunction n) : 
    O'Donnell, Definition 2.42: agreement probability of a Boolean function on a
    `ρ`-correlated pair. 
  • defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    def FABL.correlatedDisagreementProbability {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : 
    def FABL.correlatedDisagreementProbability
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.BooleanFunction n) : 
    O'Donnell, Definition 2.42: disagreement probability of a Boolean function on a
    `ρ`-correlated pair. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.noiseStability_toReal_eq_agreement_sub_disagreement {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.BooleanFunction n) :
      FABL.noiseStability ρ  f.toReal =
        FABL.correlatedAgreementProbability ρ  f -
          FABL.correlatedDisagreementProbability ρ  f
    theorem FABL.noiseStability_toReal_eq_agreement_sub_disagreement
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.BooleanFunction n) :
      FABL.noiseStability ρ  f.toReal =
        FABL.correlatedAgreementProbability ρ
             f -
          FABL.correlatedDisagreementProbability
            ρ  f
    O'Donnell, Definition 2.42: Boolean stability is agreement minus disagreement. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.BooleanFunction n) :
      FABL.noiseStability ρ  f.toReal =
        2 * FABL.correlatedAgreementProbability ρ  f - 1
    theorem FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.BooleanFunction n) :
      FABL.noiseStability ρ  f.toReal =
        2 *
            FABL.correlatedAgreementProbability
              ρ  f -
          1
    O'Donnell, Definition 2.42: Boolean stability is twice agreement probability minus one. 
Definition2.4.4
Statement uses 2
Statement dependency previews
Preview
Definition 2.4.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Lemma 2.4.5
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Definition 2.43. Let f:\{-1,1\}^n\to\{-1,1\} and \delta\in[0,1]. The noise sensitivity \operatorname{NS}_\delta[f] is the probability that f(\boldsymbol x)\ne f(\boldsymbol y), where \boldsymbol x is uniform and \boldsymbol y is obtained by reversing each bit of \boldsymbol x independently with probability \delta. Equivalently, \operatorname{NS}_\delta[f]=\frac12-\frac12\operatorname{Stab}_{1-2\delta}[f].

Lean code for Definition2.4.42 declarations
  • defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    def FABL.noiseSensitivity {n : } (δ : ) ( : δ  Set.Icc 0 1)
      (f : FABL.BooleanFunction n) : 
    def FABL.noiseSensitivity {n : } (δ : )
      ( : δ  Set.Icc 0 1)
      (f : FABL.BooleanFunction n) : 
    O'Donnell, Definition 2.43: noise sensitivity is the probability that a Boolean function
    changes under independent bit reversals of probability `δ`. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.noiseSensitivity_eq_half_sub_half_noiseStability {n : } (δ : )
      ( : δ  Set.Icc 0 1) (f : FABL.BooleanFunction n) :
      FABL.noiseSensitivity δ  f =
        (1 - FABL.noiseStability (1 - 2 * δ)  f.toReal) / 2
    theorem FABL.noiseSensitivity_eq_half_sub_half_noiseStability
      {n : } (δ : ) ( : δ  Set.Icc 0 1)
      (f : FABL.BooleanFunction n) :
      FABL.noiseSensitivity δ  f =
        (1 -
            FABL.noiseStability (1 - 2 * δ) 
              f.toReal) /
          2
    O'Donnell, Definition 2.43: the equivalent relation between Boolean noise sensitivity
    and noise stability. 
Lemma2.4.5
Statement uses 4
Statement dependency previews
Preview
Definition 1.2.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0L∃∀N

Example 2.44. The constant functions \pm1 have noise stability 1 for every \rho. Dictators satisfy \operatorname{Stab}_\rho[\chi_i]=\rho and \operatorname{NS}_\delta[\chi_i]=\delta. More generally, for every S\subseteq[n], \operatorname{Stab}_\rho[\chi_S] =\mathbb E[\boldsymbol x^S\boldsymbol y^S] =\mathbb E\!\left[\prod_{i\in S} \boldsymbol x_i\boldsymbol y_i\right] =\prod_{i\in S}\mathbb E[\boldsymbol x_i\boldsymbol y_i] =\rho^{|S|}.

Lean code for Lemma2.4.55 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_const_one {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) : (FABL.noiseStability ρ  fun x => 1) = 1
    theorem FABL.noiseStability_const_one {n : }
      (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      (FABL.noiseStability ρ  fun x => 1) =
        1
    O'Donnell, Example 2.44: the constant `+1` function has stability one. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_const_neg_one {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) : (FABL.noiseStability ρ  fun x => -1) = 1
    theorem FABL.noiseStability_const_neg_one {n : }
      (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      (FABL.noiseStability ρ  fun x => -1) =
        1
    O'Donnell, Example 2.44: the constant `-1` function has stability one. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_dictator {n : } (ρ : ) ( : ρ  Set.Icc (-1) 1)
      (i : Fin n) : FABL.noiseStability ρ  (FABL.dictator i).toReal = ρ
    theorem FABL.noiseStability_dictator {n : }
      (ρ : ) ( : ρ  Set.Icc (-1) 1)
      (i : Fin n) :
      FABL.noiseStability ρ 
          (FABL.dictator i).toReal =
        ρ
    O'Donnell, Example 2.44: a dictator has noise stability `ρ`. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseSensitivity_dictator {n : } (δ : ) ( : δ  Set.Icc 0 1)
      (i : Fin n) : FABL.noiseSensitivity δ  (FABL.dictator i) = δ
    theorem FABL.noiseSensitivity_dictator {n : }
      (δ : ) ( : δ  Set.Icc 0 1)
      (i : Fin n) :
      FABL.noiseSensitivity δ 
          (FABL.dictator i) =
        δ
    O'Donnell, Example 2.44: a dictator has noise sensitivity `δ`. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_parityFunction {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (S : Finset (Fin n)) :
      FABL.noiseStability ρ  (FABL.parityFunction S).toReal = ρ ^ S.card
    theorem FABL.noiseStability_parityFunction {n : }
      (ρ : ) ( : ρ  Set.Icc (-1) 1)
      (S : Finset (Fin n)) :
      FABL.noiseStability ρ 
          (FABL.parityFunction S).toReal =
        ρ ^ S.card
    O'Donnell, Example 2.44: Boolean parity has stability `ρ ^ |S|`. 
Theorem2.4.6
Statement uses 3
Statement dependency previews
Preview
Definition 2.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1L∃∀N

Theorem 2.45. For every \rho\in[-1,1], as odd n tends to infinity, \lim_{\substack{n\to\infty\\n\text{ odd}}} \operatorname{Stab}_\rho[\operatorname{Maj}_n] =\frac2\pi\arcsin\rho =1-\frac2\pi\arccos\rho. Equivalently, for every \delta\in[0,1], \lim_{\substack{n\to\infty\\n\text{ odd}}} \operatorname{NS}_\delta[\operatorname{Maj}_n] =\frac1\pi\arccos(1-2\delta). Consequently, using \arccos(1-2\delta)=2\sqrt\delta+O(\delta^{3/2}), \lim_{\substack{n\to\infty\\n\text{ odd}}} \operatorname{NS}_\delta[\operatorname{Maj}_n] =\frac2\pi\sqrt\delta+O(\delta^{3/2}). The book proves this theorem in Chapter 5.2.

Lean code for Theorem2.4.67 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.tendsto_noiseStability_majority_odd (ρ : )
      ( : ρ  Set.Icc (-1) 1) :
      Filter.Tendsto
        (fun k =>
          FABL.noiseStability ρ  (FABL.majority (2 * k + 1)).toReal)
        Filter.atTop (nhds (2 / Real.pi * Real.arcsin ρ))
    theorem FABL.tendsto_noiseStability_majority_odd
      (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      Filter.Tendsto
        (fun k =>
          FABL.noiseStability ρ 
            (FABL.majority
                (2 * k + 1)).toReal)
        Filter.atTop
        (nhds (2 / Real.pi * Real.arcsin ρ))
    O'Donnell, Theorem 2.45: the noise stability of odd majority converges to the Gaussian
    arcsine law. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.two_div_pi_mul_arcsin_eq_one_sub_two_div_pi_mul_arccos (ρ : ) :
      2 / Real.pi * Real.arcsin ρ = 1 - 2 / Real.pi * Real.arccos ρ
    theorem FABL.two_div_pi_mul_arcsin_eq_one_sub_two_div_pi_mul_arccos
      (ρ : ) :
      2 / Real.pi * Real.arcsin ρ =
        1 - 2 / Real.pi * Real.arccos ρ
    The two standard trigonometric forms of the majority-stability limit agree. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.tendsto_noiseStability_majority_odd_arccos (ρ : )
      ( : ρ  Set.Icc (-1) 1) :
      Filter.Tendsto
        (fun k =>
          FABL.noiseStability ρ  (FABL.majority (2 * k + 1)).toReal)
        Filter.atTop (nhds (1 - 2 / Real.pi * Real.arccos ρ))
    theorem FABL.tendsto_noiseStability_majority_odd_arccos
      (ρ : ) ( : ρ  Set.Icc (-1) 1) :
      Filter.Tendsto
        (fun k =>
          FABL.noiseStability ρ 
            (FABL.majority
                (2 * k + 1)).toReal)
        Filter.atTop
        (nhds
          (1 - 2 / Real.pi * Real.arccos ρ))
    O'Donnell, Theorem 2.45, equivalent inverse-cosine form of the odd-majority stability
    limit. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.tendsto_noiseSensitivity_majority_odd (δ : )
      ( : δ  Set.Icc 0 1) :
      Filter.Tendsto
        (fun k => FABL.noiseSensitivity δ  (FABL.majority (2 * k + 1)))
        Filter.atTop (nhds (Real.arccos (1 - 2 * δ) / Real.pi))
    theorem FABL.tendsto_noiseSensitivity_majority_odd
      (δ : ) ( : δ  Set.Icc 0 1) :
      Filter.Tendsto
        (fun k =>
          FABL.noiseSensitivity δ 
            (FABL.majority (2 * k + 1)))
        Filter.atTop
        (nhds
          (Real.arccos (1 - 2 * δ) / Real.pi))
    O'Donnell, Theorem 2.45, equivalent noise-sensitivity form: odd majority converges to the
    Gaussian angle at correlation `1 - 2δ`. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt (δ : )
      ( : δ  Set.Icc 0 1) : Real.arccos (1 - 2 * δ) = 2 * Real.arcsin δ
    theorem FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt
      (δ : ) ( : δ  Set.Icc 0 1) :
      Real.arccos (1 - 2 * δ) =
        2 * Real.arcsin δ
    The half-angle identity underlying the small-noise expansion in Theorem 2.45. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.arccos_one_sub_two_mul_sub_two_mul_sqrt_isBigO :
      (fun δ =>
          Real.arccos (1 - 2 * δ) - 2 * δ) =O[nhdsWithin 0 (Set.Ici 0)]
        fun δ => δ ^ (3 / 2)
    theorem FABL.arccos_one_sub_two_mul_sub_two_mul_sqrt_isBigO :
      (fun δ =>
          Real.arccos (1 - 2 * δ) -
            2 *
              δ) =O[nhdsWithin 0 (Set.Ici 0)]
        fun δ => δ ^ (3 / 2)
    The inverse-cosine remainder in Theorem 2.45 is `O(δ^(3/2))` from the right at zero. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.majorityNoiseSensitivityLimit_sub_two_div_pi_mul_sqrt_isBigO :
      (fun δ =>
          Real.arccos (1 - 2 * δ) / Real.pi -
            2 / Real.pi * δ) =O[nhdsWithin 0 (Set.Ici 0)]
        fun δ => δ ^ (3 / 2)
    theorem FABL.majorityNoiseSensitivityLimit_sub_two_div_pi_mul_sqrt_isBigO :
      (fun δ =>
          Real.arccos (1 - 2 * δ) / Real.pi -
            2 / Real.pi *
              δ) =O[nhdsWithin 0 (Set.Ici 0)]
        fun δ => δ ^ (3 / 2)
    O'Donnell, Theorem 2.45, small-noise consequence: the limiting noise sensitivity of odd
    majority is `(2 / π) √δ + O(δ^(3/2))`. 
Definition2.4.7
uses 1
Used by 2
Reverse dependency previews
Preview
Proposition 2.4.8
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Definition 2.46. For \rho\in[-1,1], the noise operator with parameter \rho is the linear operator T_\rho on functions f:\{-1,1\}^n\to\mathbb R defined by T_\rho f(x)=\mathbb E_{\boldsymbol y\sim N_\rho(x)}[f(\boldsymbol y)].

Lean code for Definition2.4.72 declarations
  • defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    def FABL.noiseOperator {n : } (ρ : ) :
      (FABL.SignCube n  ) →ₗ[] FABL.SignCube n  
    def FABL.noiseOperator {n : } (ρ : ) :
      (FABL.SignCube n  ) →ₗ[]
        FABL.SignCube n  
    O'Donnell, Definition 2.46: the Fourier multiplier form of the noise operator.  The
    construction uses the Walsh basis to obtain linearity by construction. 
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.noiseOperator_apply_eq_pmfExpectation {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.SignCube n  )
      (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) f x =
        FABL.pmfExpectation (FABL.noiseKernel ρ  x) f
    theorem FABL.noiseOperator_apply_eq_pmfExpectation
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.SignCube n  )
      (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) f x =
        FABL.pmfExpectation
          (FABL.noiseKernel ρ  x) f
    O'Donnell, Definition 2.46: conditional expectation under `Nρ(x)` equals evaluation of
    the Fourier-multiplier noise operator. 
Proposition2.4.8
Statement uses 3
Statement dependency previews
Preview
Theorem 1.2.3
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1L∃∀N

Proposition 2.47. For f:\{-1,1\}^n\to\mathbb R, the Fourier expansion of T_\rho f is T_\rho f =\sum_{S\subseteq[n]}\rho^{|S|}\widehat f(S)\chi_S =\sum_{k=0}^n\rho^k f^{=k}. Equivalently, every Walsh character is an eigenfunction: T_\rho\chi_S=\rho^{|S|}\chi_S.

Lean code for Proposition2.4.83 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.noiseOperator_monomial_apply {n : } (ρ : ) (S : Finset (Fin n))
      (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) (FABL.monomial S) x =
        ρ ^ S.card * FABL.monomial S x
    theorem FABL.noiseOperator_monomial_apply {n : }
      (ρ : ) (S : Finset (Fin n))
      (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) (FABL.monomial S)
          x =
        ρ ^ S.card * FABL.monomial S x
    O'Donnell, Proposition 2.47: pointwise form of the Walsh-character eigenvalue identity. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseOperator_fourier_expansion {n : } (ρ : )
      (f : FABL.SignCube n  ) (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) f x =
         S, ρ ^ S.card * FABL.fourierCoeff f S * FABL.monomial S x
    theorem FABL.noiseOperator_fourier_expansion
      {n : } (ρ : )
      (f : FABL.SignCube n  )
      (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) f x =
         S,
          ρ ^ S.card * FABL.fourierCoeff f S *
            FABL.monomial S x
    O'Donnell, Proposition 2.47: pointwise Fourier expansion of the noise operator. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseOperator_eq_sum_degreePart {n : } (ρ : )
      (f : FABL.SignCube n  ) (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) f x =
         k  Finset.range (n + 1), ρ ^ k * FABL.degreePart k f x
    theorem FABL.noiseOperator_eq_sum_degreePart
      {n : } (ρ : )
      (f : FABL.SignCube n  )
      (x : FABL.SignCube n) :
      (FABL.noiseOperator ρ) f x =
         k  Finset.range (n + 1),
          ρ ^ k * FABL.degreePart k f x
    O'Donnell, Proposition 2.47: the noise operator is the degreewise multiplier
    `∑ₖ ρᵏ f⁼ᵏ`. 
Lemma2.4.9
Statement uses 3
Statement dependency previews
Preview
Definition 2.4.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1L∃∀N

Fact 2.48. For every f:\{-1,1\}^n\to\mathbb R and \rho\in[-1,1], one has \operatorname{Stab}_\rho[f]=\langle f,T_\rho f\rangle.

Lean code for Lemma2.4.91 theorem
  • theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.lean
    complete
    theorem FABL.noiseStability_eq_uniformInner_noiseOperator {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.SignCube n  ) :
      FABL.noiseStability ρ  f =
        FABL.uniformInner f ((FABL.noiseOperator ρ) f)
    theorem FABL.noiseStability_eq_uniformInner_noiseOperator
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.SignCube n  ) :
      FABL.noiseStability ρ  f =
        FABL.uniformInner f
          ((FABL.noiseOperator ρ) f)
    O'Donnell, Fact 2.48: stability is the normalized inner product with the noise operator. 
Theorem2.4.10
Statement uses 6
Statement dependency previews
L∃∀N

Theorem 2.49. For every f:\{-1,1\}^n\to\mathbb R and \rho\in[-1,1], \operatorname{Stab}_\rho[f] =\sum_{S\subseteq[n]}\rho^{|S|}\widehat f(S)^2 =\sum_{k=0}^n\rho^k\mathbf W^k[f]. Hence, if f:\{-1,1\}^n\to\{-1,1\}, then \operatorname{Stab}_\rho[f] =\mathbb E_{\boldsymbol S\sim\mathcal S_f}[\rho^{|\boldsymbol S|}], \tag{2.6} and, for \delta\in[0,1], \operatorname{NS}_\delta[f] =\frac12\sum_{k=0}^n \bigl(1-(1-2\delta)^k\bigr)\mathbf W^k[f]. \tag{2.7}

Lean code for Theorem2.4.104 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_eq_sum_rho_pow_mul_sq_fourierCoeff {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.SignCube n  ) :
      FABL.noiseStability ρ  f =
         S, ρ ^ S.card * FABL.fourierCoeff f S ^ 2
    theorem FABL.noiseStability_eq_sum_rho_pow_mul_sq_fourierCoeff
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.SignCube n  ) :
      FABL.noiseStability ρ  f =
         S,
          ρ ^ S.card *
            FABL.fourierCoeff f S ^ 2
    O'Donnell, Theorem 2.49: the subset-indexed Fourier formula for noise stability. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_eq_sum_level_rho_pow_mul_fourierWeight {n : }
      (ρ : ) ( : ρ  Set.Icc (-1) 1) (f : FABL.SignCube n  ) :
      FABL.noiseStability ρ  f =
         k  Finset.range (n + 1), ρ ^ k * FABL.fourierWeightAtLevel k f
    theorem FABL.noiseStability_eq_sum_level_rho_pow_mul_fourierWeight
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.SignCube n  ) :
      FABL.noiseStability ρ  f =
         k  Finset.range (n + 1),
          ρ ^ k *
            FABL.fourierWeightAtLevel k f
    O'Donnell, Theorem 2.49: regrouping the stability formula by Fourier level. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseStability_toReal_eq_spectralSample_moment {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1) (f : FABL.BooleanFunction n) :
      FABL.noiseStability ρ  f.toReal =
        FABL.pmfExpectation (FABL.spectralSample f) fun S => ρ ^ S.card
    theorem FABL.noiseStability_toReal_eq_spectralSample_moment
      {n : } (ρ : )
      ( : ρ  Set.Icc (-1) 1)
      (f : FABL.BooleanFunction n) :
      FABL.noiseStability ρ  f.toReal =
        FABL.pmfExpectation
          (FABL.spectralSample f) fun S =>
          ρ ^ S.card
    Theorem 2.49, Equation (2.6): Boolean stability is the spectral moment of `ρ^|S|`. 
  • theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.lean
    complete
    theorem FABL.noiseSensitivity_eq_sum_level {n : } (δ : )
      ( : δ  Set.Icc 0 1) (f : FABL.BooleanFunction n) :
      FABL.noiseSensitivity δ  f =
        1 / 2 *
           k  Finset.range (n + 1),
            (1 - (1 - 2 * δ) ^ k) * FABL.fourierWeightAtLevel k f.toReal
    theorem FABL.noiseSensitivity_eq_sum_level {n : }
      (δ : ) ( : δ  Set.Icc 0 1)
      (f : FABL.BooleanFunction n) :
      FABL.noiseSensitivity δ  f =
        1 / 2 *
           k  Finset.range (n + 1),
            (1 - (1 - 2 * δ) ^ k) *
              FABL.fourierWeightAtLevel k
                f.toReal
    O'Donnell, Theorem 2.49, Equation (2.7): the level-weight formula for Boolean noise
    sensitivity. 
Proposition2.4.11
Statement uses 4
Statement dependency previews
Preview
Theorem 1.4.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0L∃∀N

Proposition 2.50. Let \rho\in(0,1). If f:\{-1,1\}^n\to\{-1,1\} is unbiased, then \operatorname{Stab}_\rho[f]\le\rho. Equality holds if and only if f=\pm\chi_i for some i\in[n].

Lean code for Proposition2.4.112 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.noiseStability_le_rho_of_balanced {n : } (ρ : )
      ( : ρ  Set.Ioo 0 1) (f : FABL.BooleanFunction n)
      (hf : FABL.IsBalanced f.toReal) : FABL.noiseStability ρ  f.toReal  ρ
    theorem FABL.noiseStability_le_rho_of_balanced
      {n : } (ρ : ) ( : ρ  Set.Ioo 0 1)
      (f : FABL.BooleanFunction n)
      (hf : FABL.IsBalanced f.toReal) :
      FABL.noiseStability ρ  f.toReal  ρ
    O'Donnell, Proposition 2.50: an unbiased Boolean function has stability at most `ρ` for
    `0 < ρ < 1`. 
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.noiseStability_eq_rho_iff_signed_dictator {n : } (ρ : )
      ( : ρ  Set.Ioo 0 1) (f : FABL.BooleanFunction n)
      (hf : FABL.IsBalanced f.toReal) :
      FABL.noiseStability ρ  f.toReal = ρ 
         i, f = FABL.dictator i  f = -FABL.dictator i
    theorem FABL.noiseStability_eq_rho_iff_signed_dictator
      {n : } (ρ : ) ( : ρ  Set.Ioo 0 1)
      (f : FABL.BooleanFunction n)
      (hf : FABL.IsBalanced f.toReal) :
      FABL.noiseStability ρ  f.toReal = ρ 
         i,
          f = FABL.dictator i 
            f = -FABL.dictator i
    O'Donnell, Proposition 2.50: equality in the unbiased stability bound holds exactly for
    a dictator or its negation. 
Proposition2.4.12
Statement uses 4
Statement dependency previews
Preview
Definition 1.4.15
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0L∃∀N

Proposition 2.51. For every f:\{-1,1\}^n\to\mathbb R, \left.\frac{d}{d\rho}\operatorname{Stab}_\rho[f]\right|_{\rho=0} =\mathbf W^1[f], \qquad \left.\frac{d}{d\rho}\operatorname{Stab}_\rho[f]\right|_{\rho=1} =\mathbf I[f]. For f:\{-1,1\}^n\to\{-1,1\}, \operatorname{NS}_\delta[f] is increasing on [0,1/2], and the second identity is equivalently \left.\frac{d}{d\delta}\operatorname{NS}_\delta[f]\right|_{\delta=0}=\mathbf I[f].

Lean code for Proposition2.4.124 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.deriv_stabilityCurve_zero {n : } (f : FABL.SignCube n  ) :
      deriv (FABL.stabilityCurve f) 0 = FABL.fourierWeightAtLevel 1 f
    theorem FABL.deriv_stabilityCurve_zero {n : }
      (f : FABL.SignCube n  ) :
      deriv (FABL.stabilityCurve f) 0 =
        FABL.fourierWeightAtLevel 1 f
    O'Donnell, Proposition 2.51: the derivative at zero is the level-one Fourier weight. 
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.deriv_stabilityCurve_one {n : } (f : FABL.SignCube n  ) :
      deriv (FABL.stabilityCurve f) 1 = FABL.totalInfluence f
    theorem FABL.deriv_stabilityCurve_one {n : }
      (f : FABL.SignCube n  ) :
      deriv (FABL.stabilityCurve f) 1 =
        FABL.totalInfluence f
    O'Donnell, Proposition 2.51: the derivative of stability at one is total influence. 
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.deriv_noiseSensitivityCurve_zero {n : }
      (f : FABL.SignCube n  ) :
      deriv (FABL.noiseSensitivityCurve f) 0 = FABL.totalInfluence f
    theorem FABL.deriv_noiseSensitivityCurve_zero
      {n : } (f : FABL.SignCube n  ) :
      deriv (FABL.noiseSensitivityCurve f) 0 =
        FABL.totalInfluence f
    O'Donnell, Proposition 2.51: the derivative of noise sensitivity at zero is total
    influence. 
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.monotoneOn_noiseSensitivityCurve {n : }
      (f : FABL.BooleanFunction n) :
      MonotoneOn (FABL.noiseSensitivityCurve f.toReal) (Set.Icc 0 (1 / 2))
    theorem FABL.monotoneOn_noiseSensitivityCurve
      {n : } (f : FABL.BooleanFunction n) :
      MonotoneOn
        (FABL.noiseSensitivityCurve f.toReal)
        (Set.Icc 0 (1 / 2))
    O'Donnell, Proposition 2.51: Boolean noise sensitivity is increasing on `[0,1/2]`,
    stated for its canonical polynomial extension. 
Definition2.4.13
Statement uses 3
Statement dependency previews
Preview
Definition 2.2.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Lemma 2.4.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
L∃∀N

Definition 2.52. Let f:\{-1,1\}^n\to\mathbb R, \rho\in[0,1], and i\in[n]. The \rho-stable influence of coordinate i on f is \operatorname{Inf}^{(\rho)}_i[f] =\operatorname{Stab}_\rho[D_i f] =\sum_{S\ni i}\rho^{|S|-1}\widehat f(S)^2, where 0^0 is interpreted as 1. The total \rho-stable influence is \mathbf I^{(\rho)}[f]=\sum_{i=1}^n\operatorname{Inf}^{(\rho)}_i[f].

Lean code for Definition2.4.133 declarations
  • defdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    def FABL.stableInfluence {n : } (ρ : ) (f : FABL.SignCube n  )
      (i : Fin n) : 
    def FABL.stableInfluence {n : } (ρ : )
      (f : FABL.SignCube n  ) (i : Fin n) :
      
    O'Donnell, Definition 2.52: the `ρ`-stable influence of coordinate `i`, in its exact
    Fourier form. 
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.stableInfluence_eq_noiseStability_discreteDerivative {n : }
      (ρ : ) ( : ρ  Set.Icc 0 1) (f : FABL.SignCube n  ) (i : Fin n) :
      FABL.stableInfluence ρ f i =
        FABL.noiseStability ρ  ((FABL.discreteDerivative i) f)
    theorem FABL.stableInfluence_eq_noiseStability_discreteDerivative
      {n : } (ρ : ) ( : ρ  Set.Icc 0 1)
      (f : FABL.SignCube n  ) (i : Fin n) :
      FABL.stableInfluence ρ f i =
        FABL.noiseStability ρ 
          ((FABL.discreteDerivative i) f)
    O'Donnell, Definition 2.52: the Fourier definition of stable influence agrees with
    the noise stability of the discrete derivative. 
  • defdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    def FABL.totalStableInfluence {n : } (ρ : ) (f : FABL.SignCube n  ) : 
    def FABL.totalStableInfluence {n : } (ρ : )
      (f : FABL.SignCube n  ) : 
    O'Donnell, Definition 2.52: total `ρ`-stable influence. 
Lemma2.4.14
Statement uses 3
Statement dependency previews
Preview
Theorem 2.3.16
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1L∃∀N

Exercise 2.40. Verify that, for every f:\{-1,1\}^n\to\mathbb R and \rho\in[0,1], \mathbf I^{(\rho)}[f] =\frac{d}{d\rho}\operatorname{Stab}_\rho[f] =\sum_{k=1}^n k\rho^{k-1}\mathbf W^k[f].

Lean code for Lemma2.4.142 theorems
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.deriv_stabilityCurve_eq_totalStableInfluence {n : } (ρ : )
      (f : FABL.SignCube n  ) :
      deriv (FABL.stabilityCurve f) ρ = FABL.totalStableInfluence ρ f
    theorem FABL.deriv_stabilityCurve_eq_totalStableInfluence
      {n : } (ρ : )
      (f : FABL.SignCube n  ) :
      deriv (FABL.stabilityCurve f) ρ =
        FABL.totalStableInfluence ρ f
    O'Donnell, Fact 2.53: total stable influence is the derivative of the stability curve. 
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.totalStableInfluence_eq_sum_card_mul_rho_pow_mul_sq_fourierCoeff
      {n : } (ρ : ) (f : FABL.SignCube n  ) :
      FABL.totalStableInfluence ρ f =
         S, S.card * ρ ^ (S.card - 1) * FABL.fourierCoeff f S ^ 2
    theorem FABL.totalStableInfluence_eq_sum_card_mul_rho_pow_mul_sq_fourierCoeff
      {n : } (ρ : )
      (f : FABL.SignCube n  ) :
      FABL.totalStableInfluence ρ f =
         S,
          S.card * ρ ^ (S.card - 1) *
            FABL.fourierCoeff f S ^ 2
    O'Donnell, Fact 2.53: total stable influence is the cardinality-weighted Fourier sum. 
Lemma2.4.15
Statement uses 2
Statement dependency previews
Preview
Definition 2.4.13
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1L∃∀N

Fact 2.53. For every f:\{-1,1\}^n\to\mathbb R and \rho\in[0,1], \mathbf I^{(\rho)}[f] =\frac{d}{d\rho}\operatorname{Stab}_\rho[f] =\sum_{k=1}^n k\rho^{k-1}\mathbf W^k[f].

Lean code for Lemma2.4.151 theorem
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.totalStableInfluence_eq_sum_level {n : } (ρ : )
      (f : FABL.SignCube n  ) :
      FABL.totalStableInfluence ρ f =
         k  Finset.range (n + 1),
          k * ρ ^ (k - 1) * FABL.fourierWeightAtLevel k f
    theorem FABL.totalStableInfluence_eq_sum_level
      {n : } (ρ : )
      (f : FABL.SignCube n  ) :
      FABL.totalStableInfluence ρ f =
         k  Finset.range (n + 1),
          k * ρ ^ (k - 1) *
            FABL.fourierWeightAtLevel k f
    O'Donnell, Fact 2.53: regrouping total stable influence by Fourier level. 
Lemma2.4.16
uses 0used by 1L∃∀N

Exercise 2.45. For every 0<\delta\le1 and every positive integer k, one has (1-\delta)^{k-1}k\le\frac1\delta. One may compare both sides with 1+(1-\delta)+(1-\delta)^2+\cdots+(1-\delta)^{k-1}.

Lean code for Lemma2.4.161 theorem
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.card_mul_one_sub_pow_le_inv (δ : ) ( : δ  Set.Ioc 0 1) (k : )
      (hk : 0 < k) : k * (1 - δ) ^ (k - 1)  1 / δ
    theorem FABL.card_mul_one_sub_pow_le_inv (δ : )
      ( : δ  Set.Ioc 0 1) (k : )
      (hk : 0 < k) :
      k * (1 - δ) ^ (k - 1)  1 / δ
    O'Donnell, Exercise 2.45: for `0 < δ ≤ 1` and positive `k`,
    `k(1-δ)^(k-1) ≤ 1/δ`. 
Proposition2.4.17
Statement uses 4
Statement dependency previews
Preview
Proposition 1.4.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0L∃∀N

Proposition 2.54. Suppose f:\{-1,1\}^n\to\mathbb R satisfies \operatorname{Var}[f]\le1. Given 0<\delta\le1 and 0<\epsilon\le1, let J=\left\{i\in[n]: \operatorname{Inf}^{(1-\delta)}_i[f]\ge\epsilon\right\}. Then |J|\le\frac1{\delta\epsilon}.

Lean code for Proposition2.4.171 theorem
  • theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.lean
    complete
    theorem FABL.card_stableInfluence_ge_le {n : } (f : FABL.SignCube n  )
      (hvar : FABL.variance f  1) (δ ε : ) ( : δ  Set.Ioc 0 1)
      ( : ε  Set.Ioc 0 1) :
      {i | ε  FABL.stableInfluence (1 - δ) f i}.card  1 / (δ * ε)
    theorem FABL.card_stableInfluence_ge_le {n : }
      (f : FABL.SignCube n  )
      (hvar : FABL.variance f  1) (δ ε : )
      ( : δ  Set.Ioc 0 1)
      ( : ε  Set.Ioc 0 1) :
      {i |
              ε 
                FABL.stableInfluence (1 - δ) f
                  i}.card 
        1 / (δ * ε)
    O'Donnell, Proposition 2.54: at most `1/(δ ε)` coordinates can have
    `(1-δ)`-stable influence at least `ε`.