2.4. Noise stability
-
FABL.correlationKeepProbability[complete] -
FABL.coordinateNoisePMF[complete] -
FABL.nonnegativeCorrelationProbability[complete] -
FABL.coordinateResamplingNoisePMF[complete] -
FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF[complete] -
FABL.noiseKernel[complete] -
FABL.resamplingNoiseKernel[complete] -
FABL.resamplingNoiseKernel_eq_noiseKernel[complete]
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.1●8 declarations
Associated Lean declarations
-
FABL.correlationKeepProbability[complete]
-
FABL.coordinateNoisePMF[complete]
-
FABL.nonnegativeCorrelationProbability[complete]
-
FABL.coordinateResamplingNoisePMF[complete]
-
FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF[complete]
-
FABL.noiseKernel[complete]
-
FABL.resamplingNoiseKernel[complete]
-
FABL.resamplingNoiseKernel_eq_noiseKernel[complete]
-
FABL.correlationKeepProbability[complete] -
FABL.coordinateNoisePMF[complete] -
FABL.nonnegativeCorrelationProbability[complete] -
FABL.coordinateResamplingNoisePMF[complete] -
FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF[complete] -
FABL.noiseKernel[complete] -
FABL.resamplingNoiseKernel[complete] -
FABL.resamplingNoiseKernel_eq_noiseKernel[complete]
-
defdefined in FABL/Chapter02/NoiseStability/NoiseKernels.leancomplete
def FABL.correlationKeepProbability (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : NNReal
def FABL.correlationKeepProbability (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
def FABL.coordinateNoisePMF (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (x : FABL.Sign) : PMF FABL.Sign
def FABL.coordinateNoisePMF (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
def FABL.nonnegativeCorrelationProbability (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) : NNReal
def FABL.nonnegativeCorrelationProbability (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
def FABL.coordinateResamplingNoisePMF (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) (x : FABL.Sign) : PMF FABL.Sign
def FABL.coordinateResamplingNoisePMF (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
theorem FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) (x : FABL.Sign) : FABL.coordinateResamplingNoisePMF ρ hρ x = FABL.coordinateNoisePMF ρ ⋯ x
theorem FABL.coordinateResamplingNoisePMF_eq_coordinateNoisePMF (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) (x : FABL.Sign) : FABL.coordinateResamplingNoisePMF ρ hρ 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.leancomplete
def FABL.noiseKernel {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (x : FABL.SignCube n) : PMF (FABL.SignCube n)
def FABL.noiseKernel {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
def FABL.resamplingNoiseKernel {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) (x : FABL.SignCube n) : PMF (FABL.SignCube n)
def FABL.resamplingNoiseKernel {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
theorem FABL.resamplingNoiseKernel_eq_noiseKernel {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) (x : FABL.SignCube n) : FABL.resamplingNoiseKernel ρ hρ x = FABL.noiseKernel ρ ⋯ x
theorem FABL.resamplingNoiseKernel_eq_noiseKernel {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc 0 1) (x : FABL.SignCube n) : FABL.resamplingNoiseKernel ρ hρ x = FABL.noiseKernel ρ ⋯ x
O'Donnell, Definition 2.40: the resampling and bit-reversal constructions of `Nρ(x)` agree for every `ρ ∈ [0,1]`.
-
FABL.correlatedPairPMF[complete] -
FABL.correlatedPairPMF_map_swap[complete] -
FABL.correlatedPairPMF_expect_signValue_fst[complete] -
FABL.correlatedPairPMF_expect_signValue_snd[complete] -
FABL.correlatedPairPMF_expect_signValue_mul[complete]
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.2●5 declarations
Associated Lean declarations
-
FABL.correlatedPairPMF[complete]
-
FABL.correlatedPairPMF_map_swap[complete]
-
FABL.correlatedPairPMF_expect_signValue_fst[complete]
-
FABL.correlatedPairPMF_expect_signValue_snd[complete]
-
FABL.correlatedPairPMF_expect_signValue_mul[complete]
-
FABL.correlatedPairPMF[complete] -
FABL.correlatedPairPMF_map_swap[complete] -
FABL.correlatedPairPMF_expect_signValue_fst[complete] -
FABL.correlatedPairPMF_expect_signValue_snd[complete] -
FABL.correlatedPairPMF_expect_signValue_mul[complete]
-
FABL.noiseStability[complete] -
FABL.correlatedAgreementProbability[complete] -
FABL.correlatedDisagreementProbability[complete] -
FABL.noiseStability_toReal_eq_agreement_sub_disagreement[complete] -
FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one[complete]
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.3●5 declarations
Associated Lean declarations
-
FABL.noiseStability[complete]
-
FABL.correlatedAgreementProbability[complete]
-
FABL.correlatedDisagreementProbability[complete]
-
FABL.noiseStability_toReal_eq_agreement_sub_disagreement[complete]
-
FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one[complete]
-
FABL.noiseStability[complete] -
FABL.correlatedAgreementProbability[complete] -
FABL.correlatedDisagreementProbability[complete] -
FABL.noiseStability_toReal_eq_agreement_sub_disagreement[complete] -
FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one[complete]
-
defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
def FABL.noiseStability {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : ℝ
def FABL.noiseStability {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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.
-
theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
theorem FABL.noiseStability_toReal_eq_agreement_sub_disagreement {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : FABL.noiseStability ρ hρ f.toReal = FABL.correlatedAgreementProbability ρ hρ f - FABL.correlatedDisagreementProbability ρ hρ f
theorem FABL.noiseStability_toReal_eq_agreement_sub_disagreement {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : FABL.noiseStability ρ hρ f.toReal = FABL.correlatedAgreementProbability ρ hρ f - FABL.correlatedDisagreementProbability ρ hρ f
O'Donnell, Definition 2.42: Boolean stability is agreement minus disagreement.
-
theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
theorem FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : FABL.noiseStability ρ hρ f.toReal = 2 * FABL.correlatedAgreementProbability ρ hρ f - 1
theorem FABL.noiseStability_toReal_eq_two_mul_agreement_sub_one {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : FABL.noiseStability ρ hρ f.toReal = 2 * FABL.correlatedAgreementProbability ρ hρ f - 1
O'Donnell, Definition 2.42: Boolean stability is twice agreement probability minus one.
-
FABL.noiseSensitivity[complete] -
FABL.noiseSensitivity_eq_half_sub_half_noiseStability[complete]
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.4●2 declarations
Associated Lean declarations
-
FABL.noiseSensitivity[complete]
-
FABL.noiseSensitivity_eq_half_sub_half_noiseStability[complete]
-
FABL.noiseSensitivity[complete] -
FABL.noiseSensitivity_eq_half_sub_half_noiseStability[complete]
-
defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
def FABL.noiseSensitivity {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (f : FABL.BooleanFunction n) : ℝ
def FABL.noiseSensitivity {n : ℕ} (δ : ℝ) (hδ : δ ∈ 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.leancomplete
theorem FABL.noiseSensitivity_eq_half_sub_half_noiseStability {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (f : FABL.BooleanFunction n) : FABL.noiseSensitivity δ hδ f = (1 - FABL.noiseStability (1 - 2 * δ) ⋯ f.toReal) / 2
theorem FABL.noiseSensitivity_eq_half_sub_half_noiseStability {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (f : FABL.BooleanFunction n) : FABL.noiseSensitivity δ hδ f = (1 - FABL.noiseStability (1 - 2 * δ) ⋯ f.toReal) / 2
O'Donnell, Definition 2.43: the equivalent relation between Boolean noise sensitivity and noise stability.
-
FABL.noiseStability_const_one[complete] -
FABL.noiseStability_const_neg_one[complete] -
FABL.noiseStability_dictator[complete] -
FABL.noiseSensitivity_dictator[complete] -
FABL.noiseStability_parityFunction[complete]
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.5●5 theorems
Associated Lean declarations
-
FABL.noiseStability_const_one[complete]
-
FABL.noiseStability_const_neg_one[complete]
-
FABL.noiseStability_dictator[complete]
-
FABL.noiseSensitivity_dictator[complete]
-
FABL.noiseStability_parityFunction[complete]
-
FABL.noiseStability_const_one[complete] -
FABL.noiseStability_const_neg_one[complete] -
FABL.noiseStability_dictator[complete] -
FABL.noiseSensitivity_dictator[complete] -
FABL.noiseStability_parityFunction[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.leancomplete
theorem FABL.noiseStability_const_one {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : (FABL.noiseStability ρ hρ fun x => 1) = 1
theorem FABL.noiseStability_const_one {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : (FABL.noiseStability ρ hρ fun x => 1) = 1
O'Donnell, Example 2.44: the constant `+1` function has stability one.
-
theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.leancomplete
theorem FABL.noiseStability_const_neg_one {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : (FABL.noiseStability ρ hρ fun x => -1) = 1
theorem FABL.noiseStability_const_neg_one {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : (FABL.noiseStability ρ hρ fun x => -1) = 1
O'Donnell, Example 2.44: the constant `-1` function has stability one.
-
theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.leancomplete
theorem FABL.noiseStability_dictator {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (i : Fin n) : FABL.noiseStability ρ hρ (FABL.dictator i).toReal = ρ
theorem FABL.noiseStability_dictator {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (i : Fin n) : FABL.noiseStability ρ hρ (FABL.dictator i).toReal = ρ
O'Donnell, Example 2.44: a dictator has noise stability `ρ`.
-
theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.leancomplete
theorem FABL.noiseSensitivity_dictator {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (i : Fin n) : FABL.noiseSensitivity δ hδ (FABL.dictator i) = δ
theorem FABL.noiseSensitivity_dictator {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (i : Fin n) : FABL.noiseSensitivity δ hδ (FABL.dictator i) = δ
O'Donnell, Example 2.44: a dictator has noise sensitivity `δ`.
-
theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.leancomplete
theorem FABL.noiseStability_parityFunction {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (S : Finset (Fin n)) : FABL.noiseStability ρ hρ (FABL.parityFunction S).toReal = ρ ^ S.card
theorem FABL.noiseStability_parityFunction {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (S : Finset (Fin n)) : FABL.noiseStability ρ hρ (FABL.parityFunction S).toReal = ρ ^ S.card
O'Donnell, Example 2.44: Boolean parity has stability `ρ ^ |S|`.
-
FABL.tendsto_noiseStability_majority_odd[complete] -
FABL.two_div_pi_mul_arcsin_eq_one_sub_two_div_pi_mul_arccos[complete] -
FABL.tendsto_noiseStability_majority_odd_arccos[complete] -
FABL.tendsto_noiseSensitivity_majority_odd[complete] -
FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt[complete] -
FABL.arccos_one_sub_two_mul_sub_two_mul_sqrt_isBigO[complete] -
FABL.majorityNoiseSensitivityLimit_sub_two_div_pi_mul_sqrt_isBigO[complete]
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.6●7 theorems
Associated Lean declarations
-
FABL.tendsto_noiseStability_majority_odd[complete]
-
FABL.two_div_pi_mul_arcsin_eq_one_sub_two_div_pi_mul_arccos[complete]
-
FABL.tendsto_noiseStability_majority_odd_arccos[complete]
-
FABL.tendsto_noiseSensitivity_majority_odd[complete]
-
FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt[complete]
-
FABL.arccos_one_sub_two_mul_sub_two_mul_sqrt_isBigO[complete]
-
FABL.majorityNoiseSensitivityLimit_sub_two_div_pi_mul_sqrt_isBigO[complete]
-
FABL.tendsto_noiseStability_majority_odd[complete] -
FABL.two_div_pi_mul_arcsin_eq_one_sub_two_div_pi_mul_arccos[complete] -
FABL.tendsto_noiseStability_majority_odd_arccos[complete] -
FABL.tendsto_noiseSensitivity_majority_odd[complete] -
FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt[complete] -
FABL.arccos_one_sub_two_mul_sub_two_mul_sqrt_isBigO[complete] -
FABL.majorityNoiseSensitivityLimit_sub_two_div_pi_mul_sqrt_isBigO[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
theorem FABL.tendsto_noiseStability_majority_odd (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : Filter.Tendsto (fun k => FABL.noiseStability ρ hρ (FABL.majority (2 * k + 1)).toReal) Filter.atTop (nhds (2 / Real.pi * Real.arcsin ρ))
theorem FABL.tendsto_noiseStability_majority_odd (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : Filter.Tendsto (fun k => FABL.noiseStability ρ hρ (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.leancomplete
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.leancomplete
theorem FABL.tendsto_noiseStability_majority_odd_arccos (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : Filter.Tendsto (fun k => FABL.noiseStability ρ hρ (FABL.majority (2 * k + 1)).toReal) Filter.atTop (nhds (1 - 2 / Real.pi * Real.arccos ρ))
theorem FABL.tendsto_noiseStability_majority_odd_arccos (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) : Filter.Tendsto (fun k => FABL.noiseStability ρ hρ (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.leancomplete
theorem FABL.tendsto_noiseSensitivity_majority_odd (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) : Filter.Tendsto (fun k => FABL.noiseSensitivity δ hδ (FABL.majority (2 * k + 1))) Filter.atTop (nhds (Real.arccos (1 - 2 * δ) / Real.pi))
theorem FABL.tendsto_noiseSensitivity_majority_odd (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) : Filter.Tendsto (fun k => FABL.noiseSensitivity δ hδ (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.leancomplete
theorem FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) : Real.arccos (1 - 2 * δ) = 2 * Real.arcsin √δ
theorem FABL.arccos_one_sub_two_mul_eq_two_mul_arcsin_sqrt (δ : ℝ) (hδ : δ ∈ 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.leancomplete
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.leancomplete
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))`.
-
FABL.noiseOperator[complete] -
FABL.noiseOperator_apply_eq_pmfExpectation[complete]
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.7●2 declarations
Associated Lean declarations
-
FABL.noiseOperator[complete]
-
FABL.noiseOperator_apply_eq_pmfExpectation[complete]
-
FABL.noiseOperator[complete] -
FABL.noiseOperator_apply_eq_pmfExpectation[complete]
-
defdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
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.leancomplete
theorem FABL.noiseOperator_apply_eq_pmfExpectation {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) (x : FABL.SignCube n) : (FABL.noiseOperator ρ) f x = FABL.pmfExpectation (FABL.noiseKernel ρ hρ x) f
theorem FABL.noiseOperator_apply_eq_pmfExpectation {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) (x : FABL.SignCube n) : (FABL.noiseOperator ρ) f x = FABL.pmfExpectation (FABL.noiseKernel ρ hρ x) f
O'Donnell, Definition 2.46: conditional expectation under `Nρ(x)` equals evaluation of the Fourier-multiplier noise operator.
-
FABL.noiseOperator_monomial_apply[complete] -
FABL.noiseOperator_fourier_expansion[complete] -
FABL.noiseOperator_eq_sum_degreePart[complete]
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.8●3 theorems
Associated Lean declarations
-
FABL.noiseOperator_monomial_apply[complete]
-
FABL.noiseOperator_fourier_expansion[complete]
-
FABL.noiseOperator_eq_sum_degreePart[complete]
-
FABL.noiseOperator_monomial_apply[complete] -
FABL.noiseOperator_fourier_expansion[complete] -
FABL.noiseOperator_eq_sum_degreePart[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
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.leancomplete
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.leancomplete
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⁼ᵏ`.
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.9●1 theorem
Associated Lean declarations
-
theoremdefined in FABL/Chapter02/NoiseStability/NoiseOperator.leancomplete
theorem FABL.noiseStability_eq_uniformInner_noiseOperator {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : FABL.noiseStability ρ hρ f = FABL.uniformInner f ((FABL.noiseOperator ρ) f)
theorem FABL.noiseStability_eq_uniformInner_noiseOperator {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : FABL.noiseStability ρ hρ f = FABL.uniformInner f ((FABL.noiseOperator ρ) f)
O'Donnell, Fact 2.48: stability is the normalized inner product with the noise operator.
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.10●4 theorems
Associated Lean declarations
-
theoremdefined in FABL/Chapter02/NoiseStability/FourierFormulas.leancomplete
theorem FABL.noiseStability_eq_sum_rho_pow_mul_sq_fourierCoeff {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : FABL.noiseStability ρ hρ f = ∑ S, ρ ^ S.card * FABL.fourierCoeff f S ^ 2
theorem FABL.noiseStability_eq_sum_rho_pow_mul_sq_fourierCoeff {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : FABL.noiseStability ρ hρ 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.leancomplete
theorem FABL.noiseStability_eq_sum_level_rho_pow_mul_fourierWeight {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : FABL.noiseStability ρ hρ f = ∑ k ∈ Finset.range (n + 1), ρ ^ k * FABL.fourierWeightAtLevel k f
theorem FABL.noiseStability_eq_sum_level_rho_pow_mul_fourierWeight {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.SignCube n → ℝ) : FABL.noiseStability ρ hρ 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.leancomplete
theorem FABL.noiseStability_toReal_eq_spectralSample_moment {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : FABL.noiseStability ρ hρ f.toReal = FABL.pmfExpectation (FABL.spectralSample f) fun S => ρ ^ S.card
theorem FABL.noiseStability_toReal_eq_spectralSample_moment {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ Set.Icc (-1) 1) (f : FABL.BooleanFunction n) : FABL.noiseStability ρ hρ 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.leancomplete
theorem FABL.noiseSensitivity_eq_sum_level {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (f : FABL.BooleanFunction n) : FABL.noiseSensitivity δ hδ f = 1 / 2 * ∑ k ∈ Finset.range (n + 1), (1 - (1 - 2 * δ) ^ k) * FABL.fourierWeightAtLevel k f.toReal
theorem FABL.noiseSensitivity_eq_sum_level {n : ℕ} (δ : ℝ) (hδ : δ ∈ Set.Icc 0 1) (f : FABL.BooleanFunction n) : FABL.noiseSensitivity δ hδ 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.
-
FABL.noiseStability_le_rho_of_balanced[complete] -
FABL.noiseStability_eq_rho_iff_signed_dictator[complete]
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.11●2 theorems
Associated Lean declarations
-
FABL.noiseStability_le_rho_of_balanced[complete]
-
FABL.noiseStability_eq_rho_iff_signed_dictator[complete]
-
FABL.noiseStability_le_rho_of_balanced[complete] -
FABL.noiseStability_eq_rho_iff_signed_dictator[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
theorem FABL.noiseStability_le_rho_of_balanced {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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 : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
theorem FABL.noiseStability_eq_rho_iff_signed_dictator {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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 : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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.
-
FABL.deriv_stabilityCurve_zero[complete] -
FABL.deriv_stabilityCurve_one[complete] -
FABL.deriv_noiseSensitivityCurve_zero[complete] -
FABL.monotoneOn_noiseSensitivityCurve[complete]
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.12●4 theorems
Associated Lean declarations
-
FABL.deriv_stabilityCurve_zero[complete]
-
FABL.deriv_stabilityCurve_one[complete]
-
FABL.deriv_noiseSensitivityCurve_zero[complete]
-
FABL.monotoneOn_noiseSensitivityCurve[complete]
-
FABL.deriv_stabilityCurve_zero[complete] -
FABL.deriv_stabilityCurve_one[complete] -
FABL.deriv_noiseSensitivityCurve_zero[complete] -
FABL.monotoneOn_noiseSensitivityCurve[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
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.leancomplete
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.leancomplete
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.leancomplete
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.
-
FABL.stableInfluence[complete] -
FABL.stableInfluence_eq_noiseStability_discreteDerivative[complete] -
FABL.totalStableInfluence[complete]
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.13●3 declarations
Associated Lean declarations
-
FABL.stableInfluence[complete]
-
FABL.stableInfluence_eq_noiseStability_discreteDerivative[complete]
-
FABL.totalStableInfluence[complete]
-
FABL.stableInfluence[complete] -
FABL.stableInfluence_eq_noiseStability_discreteDerivative[complete] -
FABL.totalStableInfluence[complete]
-
defdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
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.leancomplete
theorem FABL.stableInfluence_eq_noiseStability_discreteDerivative {n : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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 : ℕ} (ρ : ℝ) (hρ : ρ ∈ 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.leancomplete
def FABL.totalStableInfluence {n : ℕ} (ρ : ℝ) (f : FABL.SignCube n → ℝ) : ℝ
def FABL.totalStableInfluence {n : ℕ} (ρ : ℝ) (f : FABL.SignCube n → ℝ) : ℝ
O'Donnell, Definition 2.52: total `ρ`-stable influence.
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.14●2 theorems
Associated Lean declarations
-
theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
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.leancomplete
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.
-
FABL.totalStableInfluence_eq_sum_level[complete]
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.15●1 theorem
Associated Lean declarations
-
FABL.totalStableInfluence_eq_sum_level[complete]
-
FABL.totalStableInfluence_eq_sum_level[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
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.
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.16●1 theorem
Associated Lean declarations
-
FABL.card_mul_one_sub_pow_le_inv[complete]
-
FABL.card_mul_one_sub_pow_le_inv[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
theorem FABL.card_mul_one_sub_pow_le_inv (δ : ℝ) (hδ : δ ∈ Set.Ioc 0 1) (k : ℕ) (hk : 0 < k) : ↑k * (1 - δ) ^ (k - 1) ≤ 1 / δ
theorem FABL.card_mul_one_sub_pow_le_inv (δ : ℝ) (hδ : δ ∈ 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/δ`.
-
FABL.card_stableInfluence_ge_le[complete]
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.17●1 theorem
Associated Lean declarations
-
FABL.card_stableInfluence_ge_le[complete]
-
FABL.card_stableInfluence_ge_le[complete]
-
theoremdefined in FABL/Chapter02/NoiseStability/StableInfluence.leancomplete
theorem FABL.card_stableInfluence_ge_le {n : ℕ} (f : FABL.SignCube n → ℝ) (hvar : FABL.variance f ≤ 1) (δ ε : ℝ) (hδ : δ ∈ Set.Ioc 0 1) (hε : ε ∈ 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) (δ ε : ℝ) (hδ : δ ∈ Set.Ioc 0 1) (hε : ε ∈ 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 `ε`.