Degree truncation of the capped estimate under p-biased measures
TheoremFourier total weight equals \(4p(1-p)\) times the total influence#✓fully proved
The Fourier total weight under μ_p: 4 ∑_S |S| f̂(S)² = 4p(1-p) ∑ₑ Infₑ.
theorem dtr_full_weight_eq {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (φ : ConfigSpace ι → Bool) :
4 * ∑ S : Finset ι, (S.card : ℝ)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2
= 4 * p * (1 - p) * totalInfl (OSSS.bernoulliWeight p)
(fun ω => if φ ω then (1 : ℝ) else 0)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_coeff (p : ℝ) (f : ConfigSpace ι → ℝ) (S : Finset ι) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * ptn_pchar p S ω)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:182
noncomputable def totalInfl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ e, OSSS.infl ν g e
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:62
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
Uses 6 · Used by 1
TheoremBound on the high-degree part of the damped total weight#✓fully proved
The Fourier part of degree greater than k contributes at most 4p(1-p)(1-u)^k ∑ₑ Infₑ to the
damped total weight.
theorem dtr_high_part_le {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (φ : ConfigSpace ι → Bool)
{u : ℝ} (hu0 : 0 < u) (hu1 : u < 1) (k : ℕ) :
4 * ∑ S ∈ univ.filter (fun S : Finset ι => k < S.card),
(S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2
≤ (1 - u) ^ k * (4 * p * (1 - p)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_coeff (p : ℝ) (f : ConfigSpace ι → ℝ) (S : Finset ι) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * ptn_pchar p S ω)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:182
noncomputable def totalInfl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ e, OSSS.infl ν g e
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:62
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
Uses 5 · Used by 1
TheoremCapped estimate from its low-degree part#✓fully proved
The capped estimate follows from a bound on its part of degree at most k.
theorem dtr_trunc_split {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (φ : ConfigSpace ι → Bool)
{u : ℝ} (hu0 : 0 < u) (hu1 : u < 1) (k : ℕ) :
(∑ S : Finset ι, 4 * (S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (4 * ∑ S ∈ univ.filter (fun S : Finset ι => 1 ≤ S.card ∧ S.card ≤ k),
(S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
+ (1 - u) ^ k * (4 * p * (1 - p)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_coeff (p : ℝ) (f : ConfigSpace ι → ℝ) (S : Finset ι) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * ptn_pchar p S ω)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:182
noncomputable def totalInfl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ e, OSSS.infl ν g e
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:62
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
Uses 5 · Used by 1
DefinitionExponent \(q^{\ast}(p, u)\) paired with the damping#✓fully proved
The exponent q*(p, u) = 1 + (1-u)/(4p(1-p)) paired with the damping 1 - u.
noncomputable def dtr_qstar (p u : ℝ) : ℝ := 1 + (1 - u) / (4 * p * (1 - p))
DefinitionLow-degree residual case of the capped estimate#✓fully proved
The low-degree form of the capped estimate for every p ∈ (1/2, q) with p < 1, small maximal
influence δ < e^{-1}, and parameters u outside the range handled by CappedExponentGap.
StatMech.Probability.dtr_lowDegreeResidue · 17 lines
def dtr_lowDegreeResidue (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) < Real.exp (-1) →
∀ u : ℝ, 0 < u → u < 1 →
(u < 1 - 4 * p * (1 - p) ∨
(maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u) - (2 / dtr_qstar p u - 1))
< 4 * (ptn_sigma p) ^ 2) →
∃ k : ℕ,
4 * ∑ S ∈ univ.filter (fun S : Finset E => 1 ≤ S.card ∧ S.card ≤ k),
(S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2
≤ ((maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u))
- 4 * p * (1 - p) * (1 - u) ^ k)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def maxInfl [Nonempty E] (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
Finset.univ.sup' Finset.univ_nonempty (OSSS.infl ν g)
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:70
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
noncomputable def dtr_qstar (p u : ℝ) : ℝ := 1 + (1 - u) / (4 * p * (1 - p))
CSLibExt/Complexity/BooleanFunctions/KKL/DegreeTruncation.lean:157
noncomputable def ptn_sigma (p : ℝ) : ℝ := Real.sqrt (p * (1 - p))
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:81
noncomputable def ptn_coeff (p : ℝ) (f : ConfigSpace ι → ℝ) (S : Finset ι) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * ptn_pchar p S ω)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:182
noncomputable def totalInfl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ e, OSSS.infl ν g e
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:62
Uses 7 · Used by 3
TheoremLow-degree case implies the low-range case#✓fully proved
dtr_lowDegreeResidue q implies hcq_lowRangeResidue q.
theorem dtr_lowDegree_of_residue {q : ℝ} (H : dtr_lowDegreeResidue q) :
hcq_lowRangeResidue q
def dtr_lowDegreeResidue (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) < Real.exp (-1) →
∀ u : ℝ, 0 < u → u < 1 →
(u < 1 - 4 * p * (1 - p) ∨
(maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u) - (2 / dtr_qstar p u - 1))
< 4 * (ptn_sigma p) ^ 2) →
∃ k : ℕ,
4 * ∑ S ∈ univ.filter (fun S : Finset E => 1 ≤ S.card ∧ S.card ≤ k),
(S.card : ℝ) * (1 - u) ^ (S.card - 1)
⋯
CSLibExt/Complexity/BooleanFunctions/KKL/DegreeTruncation.lean:162
def hcq_lowRangeResidue (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) < Real.exp (-1) →
∀ u : ℝ, 0 < u → u < 1 →
(u < 1 - 4 * p * (1 - p) ∨
(maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u) - (2 / (1 + (1 - u) / (4 * p * (1 - p))) - 1))
< 4 * (ptn_sigma p) ^ 2) →
(∑ S : Finset E, 4 * (S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (u / (2 - u))
⋯
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/CappedExponentGap.lean:201
Uses 10 · Used by 1
TheoremLow-degree case implies the small-influence case#✓fully proved
dtr_lowDegreeResidue q implies cvg_smallDeltaResidue q.
theorem dtr_smallDelta_of_residue {q : ℝ} (H : dtr_lowDegreeResidue q) :
cvg_smallDeltaResidue q
def dtr_lowDegreeResidue (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) < Real.exp (-1) →
∀ u : ℝ, 0 < u → u < 1 →
(u < 1 - 4 * p * (1 - p) ∨
(maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u) - (2 / dtr_qstar p u - 1))
< 4 * (ptn_sigma p) ^ 2) →
∃ k : ℕ,
4 * ∑ S ∈ univ.filter (fun S : Finset E => 1 ≤ S.card ∧ S.card ≤ k),
(S.card : ℝ) * (1 - u) ^ (S.card - 1)
⋯
CSLibExt/Complexity/BooleanFunctions/KKL/DegreeTruncation.lean:162
def cvg_smallDeltaResidue (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) < Real.exp (-1) →
∀ u : ℝ, 0 < u → u < 1 →
(∑ S : Finset E, 4 * (S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (u / (2 - u))
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/ConvexGapHC.lean:281
Uses 4 · Used by 1
TheoremLow-degree case implies the full capped estimate on \((1/2, q)\)#✓fully proved
dtr_lowDegreeResidue q implies mxd_martingaleHC_statement q.
theorem dtr_martingaleHC_of_residue {q : ℝ} (H : dtr_lowDegreeResidue q) :
mxd_martingaleHC_statement q
def dtr_lowDegreeResidue (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) < Real.exp (-1) →
∀ u : ℝ, 0 < u → u < 1 →
(u < 1 - 4 * p * (1 - p) ∨
(maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u) - (2 / dtr_qstar p u - 1))
< 4 * (ptn_sigma p) ^ 2) →
∃ k : ℕ,
4 * ∑ S ∈ univ.filter (fun S : Finset E => 1 ≤ S.card ∧ S.card ≤ k),
(S.card : ℝ) * (1 - u) ^ (S.card - 1)
⋯
CSLibExt/Complexity/BooleanFunctions/KKL/DegreeTruncation.lean:162
def mxd_martingaleHC_statement (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool), ∀ u : ℝ, 0 ≤ u → u ≤ 1 →
(∑ S : Finset E, 4 * (S.card : ℝ) * (1 - u) ^ (S.card - 1)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (u / (2 - u))
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
CSLibExt/Complexity/BooleanFunctions/KKL/MaxElementDecomp.lean:295
TheoremSome truncation level gives a nonnegative budget#✓fully proved
For δ > 0 the truncation budget δ^{u/(2-u)} - 4p(1-p)(1-u)^k is nonnegative for some k.
theorem dtr_budget_pos {p δ u : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (hu0 : 0 < u) (_hu1 : u < 1)
(hδ0 : 0 < δ ^ (u / (2 - u))) :
∃ k : ℕ, 0 ≤ δ ^ (u / (2 - u)) - 4 * p * (1 - p) * (1 - u) ^ k
Used by 1
TheoremSome truncation level makes the low-degree right side nonnegative#✓fully proved
For δ^{u/(2-u)} > 0 some truncation level k makes the right side of the low-degree bound
in dtr_lowDegreeResidue nonnegative.
theorem dtr_residue_c0 {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
{u : ℝ} (hu0 : 0 < u) (hu1 : u < 1)
{E : Type} [Fintype E] [DecidableEq E] [Nonempty E] (φ : ConfigSpace E → Bool)
(hδ0 : 0 < (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
^ (u / (2 - u))) :
∃ k : ℕ, (0 : ℝ)
≤ ((maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (u / (2 - u))
- 4 * p * (1 - p) * (1 - u) ^ k)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def maxInfl [Nonempty E] (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
Finset.univ.sup' Finset.univ_nonempty (OSSS.infl ν g)
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:70
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
noncomputable def totalInfl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ e, OSSS.infl ν g e
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:62
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.