PBiased Tensorize
DefinitionZero-one value of a bit#✓fully proved
The 0/1 value of a bit.
def ptn_val (b : Bool) : ℝ := if b then 1 else 0
Used by 7
DefinitionStandard deviation of a Bernoulli bit#✓fully proved
The standard deviation √(p(1-p)) of a Bernoulli(p) bit.
noncomputable def ptn_sigma (p : ℝ) : ℝ := Real.sqrt (p * (1 - p))
Used by 38
DefinitionNormalized Bernoulli bit#✓fully proved
The normalized Bernoulli(p) bit ψ(b) = (b - p) / √(p(1-p)), which has mean 0 and variance
1.
noncomputable def ptn_psi (p : ℝ) (b : Bool) : ℝ := (ptn_val b - p) / ptn_sigma p
def ptn_val (b : Bool) : ℝ := if b then 1 else 0
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:75
noncomputable def ptn_sigma (p : ℝ) : ℝ := Real.sqrt (p * (1 - p))
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:81
Uses 2 · Used by 8
TheoremExpectations of product functions factor under product measure#✓fully proved
Expectations of product functions factor under the product measure.
theorem ptn_expect_prod (p : ℝ) (h : ι → Bool → ℝ) :
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => ∏ e : ι, h e (ω e))
= ∏ e : ι, ((1 - p) * h e false + p * h e true)
noncomputable def expect (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ ω, weight ν ω * g ω
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:71
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
Uses 4 · Used by 1
Definition\(p\)-biased character#✓fully proved
The p-biased character φ_S(ω) = ∏_{i ∈ S} ψ(ω i).
noncomputable def ptn_pchar (p : ℝ) (S : Finset ι) (ω : ConfigSpace ι) : ℝ :=
∏ i ∈ S, ptn_psi p (ω i)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_psi (p : ℝ) (b : Bool) : ℝ := (ptn_val b - p) / ptn_sigma p
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:92
Uses 2 · Used by 13
TheoremOrthonormality of the \(p\)-biased characters#✓fully proved
The p-biased characters are orthonormal in L²(μ_p).
theorem ptn_orthonormal {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (S T : Finset ι) :
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => ptn_pchar p S ω * ptn_pchar p T ω)
= if S = T then 1 else 0
noncomputable def expect (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ ω, weight ν ω * g ω
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:71
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
noncomputable def ptn_pchar (p : ℝ) (S : Finset ι) (ω : ConfigSpace ι) : ℝ :=
∏ i ∈ S, ptn_psi p (ω i)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:130
Uses 8 · Used by 5
Definition\(p\)-biased Fourier coefficient#✓fully proved
The p-biased Fourier coefficient f̂(S) = 𝔼_p[f φ_S].
noncomputable def ptn_coeff (p : ℝ) (f : ConfigSpace ι → ℝ) (S : Finset ι) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * ptn_pchar p S ω)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def expect (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ ω, weight ν ω * g ω
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:71
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
noncomputable def ptn_pchar (p : ℝ) (S : Finset ι) (ω : ConfigSpace ι) : ℝ :=
∏ i ∈ S, ptn_psi p (ω i)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:130
Uses 4 · Used by 55
Theorem\(p\)-biased Fourier inversion#✓fully proved
Fourier inversion under μ_p: f = ∑_S f̂(S) φ_S for 0 < p < 1.
theorem ptn_expansion {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
(f : ConfigSpace ι → ℝ) (x : ConfigSpace ι) :
(∑ S : Finset ι, ptn_coeff p f S * ptn_pchar p S x) = f x
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 ptn_pchar (p : ℝ) (S : Finset ι) (ω : ConfigSpace ι) : ℝ :=
∏ i ∈ S, ptn_psi p (ω i)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:130
Uses 8 · Used by 4
TheoremParseval's identity under the \(p\)-biased measure#✓fully proved
Parseval's identity under μ_p: 𝔼_p[f g] = ∑_S f̂(S) ĝ(S).
theorem ptn_parseval {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (f g : ConfigSpace ι → ℝ) :
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * g ω)
= ∑ S : Finset ι, ptn_coeff p f S * ptn_coeff p g S
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def expect (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ ω, weight ν ω * g ω
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:71
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
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
Uses 8 · Used by 1
Theorem\(p\)-biased variance as Fourier weight off the empty set#✓fully proved
The variance under μ_p is the Fourier weight off the empty set.
theorem ptn_var_eq_fourierWeight {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (f : ConfigSpace ι → ℝ) :
OSSS.var (OSSS.bernoulliWeight p) f
= ∑ S ∈ (univ.erase (∅ : Finset ι)), (ptn_coeff p f S) ^ 2
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def var (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ := cov ν g g
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:161
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
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
Uses 8 · Used by 3
Theorem\(p\)-biased influence of a coordinate as Fourier weight#✓fully proved
The influence of e on a Boolean function under μ_p is ∑_{S ∋ e} f̂(S)² / (p(1-p)).
theorem ptn_infl_eq_fourierWeight {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
(φ : ConfigSpace ι → Bool) (e : ι) :
OSSS.infl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) e
= (1 / (ptn_sigma p) ^ 2) * ∑ S ∈ univ.filter (fun S : Finset ι => e ∈ S),
(ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def infl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) (e : E) : ℝ :=
expect ν (fun ω => |g (setOpen e ω) - g (setClosed e ω)|)
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:168
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
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
Uses 14 · Used by 4
Theorem\(p\)-biased total influence as Fourier weight#✓fully proved
The total influence of a Boolean function under μ_p is ∑_S |S| f̂(S)² / (p(1-p)).
theorem ptn_totalInfl_eq_fourierWeight {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
(φ : ConfigSpace ι → Bool) :
totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
= (1 / (ptn_sigma p) ^ 2) * ∑ S : Finset ι, (S.card : ℝ)
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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
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
Definition\(q\)-th moment under the \(p\)-biased measure#✓fully proved
The q-th moment 𝔼_p |f|^q.
noncomputable def ptn_qnormPow (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => |f ω| ^ q)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def expect (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ ω, weight ν ω * g ω
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:71
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
Uses 3 · Used by 6
Definition\(L^q\) norm under the \(p\)-biased measure#✓fully proved
The L^q(μ_p) norm (𝔼_p |f|^q)^{1/q}.
noncomputable def ptn_qnorm (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
(ptn_qnormPow p q f) ^ (1 / q)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_qnormPow (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => |f ω| ^ q)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:458
Uses 2 · Used by 5
Definition\(p\)-biased noise operator on the Fourier side#✓fully proved
The p-biased noise operator on the Fourier side: T_ρ f = ∑_S ρ^{|S|} f̂(S) φ_S.
noncomputable def ptn_noiseOp (p ρ : ℝ) (f : ConfigSpace ι → ℝ) : ConfigSpace ι → ℝ :=
fun ω => ∑ S : Finset ι, (ρ ^ S.card * ptn_coeff p f S) * ptn_pchar p S ω
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 ptn_pchar (p : ℝ) (S : Finset ι) (ω : ConfigSpace ι) : ℝ :=
∏ i ∈ S, ptn_psi p (ω i)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:130
Uses 3 · Used by 4
DefinitionOne-coordinate \(p\)-biased noise kernel#✓fully proved
The one-coordinate noise kernel: keep the bit with probability ρ, otherwise resample it from
Bernoulli(p).
noncomputable def ptn_kbit (p ρ : ℝ) (x y : Bool) : ℝ :=
ρ * (if x = y then 1 else 0) + (1 - ρ) * (if y then p else 1 - p)
Used by 6
DefinitionProduct noise kernel on the Boolean cube#✓fully proved
The product noise kernel on {0, 1}^ι.
noncomputable def ptn_kernel (p ρ : ℝ) (x y : ConfigSpace ι) : ℝ :=
∏ i : ι, ptn_kbit p ρ (x i) (y i)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_kbit (p ρ : ℝ) (x y : Bool) : ℝ :=
ρ * (if x = y then 1 else 0) + (1 - ρ) * (if y then p else 1 - p)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:557
Uses 2 · Used by 6
Definition\(p\)-biased noise operator via its Markov kernel#✓fully proved
The p-biased noise operator T_ρ f (x) = ∑_y K_ρ(x, y) f y, defined by its Markov kernel.
noncomputable def ptn_kop (p ρ : ℝ) (f : ConfigSpace ι → ℝ) : ConfigSpace ι → ℝ :=
fun x => ∑ y : ConfigSpace ι, ptn_kernel p ρ x y * f y
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_kernel (p ρ : ℝ) (x y : ConfigSpace ι) : ℝ :=
∏ i : ι, ptn_kbit p ρ (x i) (y i)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:561
Uses 2 · Used by 6
TheoremKernel and Fourier noise operators agree#✓fully proved
The kernel and Fourier definitions of the p-biased noise operator agree for 0 < p < 1.
theorem ptn_kop_eq_noiseOp {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (ρ : ℝ) (f : ConfigSpace ι → ℝ) :
ptn_kop p ρ f = ptn_noiseOp p ρ f
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_kop (p ρ : ℝ) (f : ConfigSpace ι → ℝ) : ConfigSpace ι → ℝ :=
fun x => ∑ y : ConfigSpace ι, ptn_kernel p ρ x y * f y
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:565
noncomputable def ptn_noiseOp (p ρ : ℝ) (f : ConfigSpace ι → ℝ) : ConfigSpace ι → ℝ :=
fun ω => ∑ S : Finset ι, (ρ ^ S.card * ptn_coeff p f S) * ptn_pchar p S ω
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:485
Uses 11 · Used by 3
TheoremTensorization step for \(p\)-biased hypercontractivity#✓fully proved
Induction step of the tensorization: hypercontractivity on {0, 1}^n implies it on {0,
1}^{n+1}.
theorem ptn_tensorStep {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ) (h1 : ρ ≤ 1)
(hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p)) (n : ℕ)
(ih : ∀ g : (Fin n → Bool) → ℝ, ptn_qnorm p 2 (ptn_kop p ρ g) ≤ ptn_qnorm p q g)
(f : (Fin (n + 1) → Bool) → ℝ) :
ptn_qnorm p 2 (ptn_kop p ρ f) ≤ ptn_qnorm p q f
noncomputable def ptn_qnorm (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
(ptn_qnormPow p q f) ^ (1 / q)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:462
noncomputable def ptn_kop (p ρ : ℝ) (f : ConfigSpace ι → ℝ) : ConfigSpace ι → ℝ :=
fun x => ∑ y : ConfigSpace ι, ptn_kernel p ρ x y * f y
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:565
Uses 11 · Used by 1
Theorem\(p\)-biased hypercontractivity on \(\{0, 1\}^n\)#✓fully proved
p-biased hypercontractivity on {0, 1}^n: ‖T_ρ f‖₂ ≤ ‖f‖_q for 0 < p < 1, 1 ≤ q ≤ 2 and
ρ² = 4p(1-p)(q - 1). The noise rate is not optimal for p ≠ 1/2.
theorem ptn_hypercontractivity_fin {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ)
(h1 : ρ ≤ 1) (hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p))
(n : ℕ) (f : (Fin n → Bool) → ℝ) :
ptn_qnorm p 2 (ptn_kop p ρ f) ≤ ptn_qnorm p q f
noncomputable def ptn_qnorm (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
(ptn_qnormPow p q f) ^ (1 / q)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:462
noncomputable def ptn_kop (p ρ : ℝ) (f : ConfigSpace ι → ℝ) : ConfigSpace ι → ℝ :=
fun x => ∑ y : ConfigSpace ι, ptn_kernel p ρ x y * f y
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:565
Uses 10 · Used by 1
TheoremFourier form of \(p\)-biased hypercontractivity on \(\{0, 1\}^n\)#✓fully proved
Fourier form of ptn_hypercontractivity_fin on {0, 1}^n.
theorem ptn_lowDegreeWeight_fin {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ)
(h1 : ρ ≤ 1) (hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p))
(n : ℕ) (f : (Fin n → Bool) → ℝ) :
(∑ S : Finset (Fin n), (ρ ^ S.card) ^ 2 * (ptn_coeff p f S) ^ 2)
≤ (ptn_qnorm p q f) ^ 2
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 ptn_qnorm (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
(ptn_qnormPow p q f) ^ (1 / q)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:462
Uses 14 · Used by 1
TheoremFourier form of \(p\)-biased hypercontractivity on finite index types#✓fully proved
p-biased hypercontractivity in Fourier form on any finite index type: ∑_S ρ^{2|S|} f̂(S)² ≤
‖f‖_q² for ρ² = 4p(1-p)(q - 1).
theorem ptn_lowDegreeWeight {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ)
(h1 : ρ ≤ 1) (hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p))
(f : ConfigSpace ι → ℝ) :
(∑ S : Finset ι, (ρ ^ S.card) ^ 2 * (ptn_coeff p f S) ^ 2)
≤ (ptn_qnorm p q f) ^ 2
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 ptn_qnorm (p q : ℝ) (f : ConfigSpace ι → ℝ) : ℝ :=
(ptn_qnormPow p q f) ^ (1 / q)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:462
Uses 17 · Used by 1
Theorem\(p\)-biased hypercontractivity for a discrete derivative#✓fully proved
p-biased hypercontractivity applied to the discrete derivative ∂ₑ 1_A.
theorem ptn_perCoord_hc {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ) (h1 : ρ ≤ 1)
(hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p))
(φ : ConfigSpace ι → Bool) (e : ι) :
(∑ S ∈ univ.filter (fun S : Finset ι => e ∈ S),
(ρ ^ (S.erase e).card) ^ 2 * (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S
/ ptn_sigma p) ^ 2)
≤ (OSSS.infl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0) e) ^ (2 / q)
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 ptn_sigma (p : ℝ) : ℝ := Real.sqrt (p * (1 - p))
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:81
noncomputable def infl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) (e : E) : ℝ :=
expect ν (fun ω => |g (setOpen e ω) - g (setClosed e ω)|)
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:168
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
Uses 24 · Used by 3
TheoremSummed per-coordinate \(p\)-biased hypercontractive bound#✓fully proved
ptn_perCoord_hc summed over all coordinates.
theorem ptn_summed_hc {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ) (h1 : ρ ≤ 1)
(hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p))
(φ : ConfigSpace ι → Bool) :
(1 / (ptn_sigma p) ^ 2) * ∑ S : Finset ι, (S.card : ℝ) * ((ρ ^ (S.card - 1)) ^ 2
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ ∑ e : ι, (OSSS.infl (OSSS.bernoulliWeight p)
(fun ω => if φ ω then (1 : ℝ) else 0) e) ^ (2 / q)
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
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 infl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) (e : E) : ℝ :=
expect ν (fun ω => |g (setOpen e ω) - g (setClosed e ω)|)
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:168
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
TheoremCapped per-coordinate estimate under the \(p\)-biased measure#✓fully proved
The capped per-coordinate estimate under μ_p: (1/(p(1-p))) ∑_S |S| ρ^{2(|S|-1)} f̂(S)² ≤
δ^{2/q - 1} ∑ₑ Infₑ, with δ = maxₑ Infₑ.
theorem ptn_capped_hc [Nonempty ι] {p ρ q : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (h0 : 0 ≤ ρ)
(h1 : ρ ≤ 1) (hq1 : 1 ≤ q) (hq2 : q ≤ 2) (hρsq : ρ ^ 2 = (q - 1) * 4 * p * (1 - p))
(φ : ConfigSpace ι → Bool) :
(1 / (ptn_sigma p) ^ 2) * ∑ S : Finset ι, (S.card : ℝ) * ((ρ ^ (S.card - 1)) ^ 2
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (2 / q - 1)
* 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_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 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
Uses 14 · Used by 3
Definition\(p\)-biased KKL inequality conditional on the capped estimate#✓fully proved
The KKL inequality with constant 2 for every p ∈ (1/2, q) with p < 1, with the capped
estimate ptn_capped_hc as a hypothesis.
def ptn_RhoOptimise (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
(∀ ρ : ℝ, 0 ≤ ρ → ρ ≤ 1 → ∀ q' : ℝ, 1 ≤ q' → q' ≤ 2 → ρ ^ 2 = (q' - 1) * 4 * p * (1 - p) →
(1 / (ptn_sigma p) ^ 2) * ∑ S : Finset E, (S.card : ℝ) * ((ρ ^ (S.card - 1)) ^ 2
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (2 / q' - 1)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) →
2 * OSSS.var (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
* Real.log (1 / maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
≤ 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_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 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
noncomputable def var (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ := cov ν g g
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:161
Uses 7 · Used by 4
TheoremConditional \(p\)-biased KKL statement yields KKL with constant \(2\)#✓fully proved
ptn_RhoOptimise q gives the KKL inequality with constant 2 at every p ∈ (1/2, q).
theorem ptn_kklHC_of_rhoOptimise {q : ℝ} (H : ptn_RhoOptimise q)
{p : ℝ} (hp : p ∈ Set.Ioo (1 / 2 : ℝ) q) (hp1 : p < 1) :
KKLHypercontractive p 2
def ptn_RhoOptimise (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
(∀ ρ : ℝ, 0 ≤ ρ → ρ ≤ 1 → ∀ q' : ℝ, 1 ≤ q' → q' ≤ 2 → ρ ^ 2 = (q' - 1) * 4 * p * (1 - p) →
(1 / (ptn_sigma p) ^ 2) * ∑ S : Finset E, (S.card : ℝ) * ((ρ ^ (S.card - 1)) ^ 2
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (2 / q' - 1)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) →
2 * OSSS.var (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
* Real.log (1 / maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
≤ totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:1120
def KKLHypercontractive (p c : ℝ) : Prop :=
∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E] (φ : ConfigSpace E → Bool),
c * OSSS.var (bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
* Real.log (1 / maxInfl (bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
≤ totalInfl (bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:159
TheoremConditional KKL gives KKL with constant 2 on \((1/2, q)\) for \(q \le 1\)#✓fully proved
ptn_RhoOptimise q implies kpb_PBiasedHC q.
theorem ptn_PBiasedHC_of_rhoOptimise {q : ℝ} (hq : q ≤ 1) (H : ptn_RhoOptimise q) :
kpb_PBiasedHC q
def ptn_RhoOptimise (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
(∀ ρ : ℝ, 0 ≤ ρ → ρ ≤ 1 → ∀ q' : ℝ, 1 ≤ q' → q' ≤ 2 → ρ ^ 2 = (q' - 1) * 4 * p * (1 - p) →
(1 / (ptn_sigma p) ^ 2) * ∑ S : Finset E, (S.card : ℝ) * ((ρ ^ (S.card - 1)) ^ 2
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (2 / q' - 1)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) →
2 * OSSS.var (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
* Real.log (1 / maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
≤ totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:1120
def kpb_PBiasedHC (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, KKLHypercontractive p 2
CSLibExt/Complexity/BooleanFunctions/KKL/KKLpBiased.lean:133
TheoremTrivial KKL inequality with constant \(0\)#✓fully proved
The KKL inequality with constant 0 holds trivially.
theorem ptn_rhoOptimise_c0 {p : ℝ} (hp0 : 0 ≤ p) (hp1 : p ≤ 1)
{E : Type} [Fintype E] [DecidableEq E] [Nonempty E] (φ : ConfigSpace E → Bool) :
(0 : ℝ) * OSSS.var (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
* Real.log (1 / maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
≤ 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 var (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ := cov ν g g
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:161
noncomputable def bernoulliWeight (p : ℝ) : E → Bool → ℝ :=
fun _ b => if b then p else 1 - p
CSLibExt/Complexity/BooleanFunctions/OSSS.lean:915
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 totalInfl (ν : E → Bool → ℝ) (g : ConfigSpace E → ℝ) : ℝ :=
∑ e, OSSS.infl ν g e
CSLibExt/Complexity/BooleanFunctions/KKL/KKLInequality.lean:62
TheoremSharp-threshold bound from the conditional KKL statement#✓fully proved
The sharp-threshold bound kpb_sharpThreshold under ptn_RhoOptimise q.
theorem ptn_sharpThreshold_of_rhoOptimise {q : ℝ} (hq1 : q ≤ 1) (H : ptn_RhoOptimise q)
{E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(A : Set (ConfigSpace E)) (hA : IsIncreasing A)
{v₀ L : ℝ} (hq : (1 : ℝ) / 2 ≤ q) (hv0 : 0 ≤ v₀) (hL : 0 ≤ L)
(hhalf : StatMech.prob (1 / 2) A = 1 / 2)
(hvar : ∀ p ∈ interior (Set.Icc (1 / 2 : ℝ) q),
v₀ ≤ StatMech.prob p A * (1 - StatMech.prob p A))
(hLL' : ∀ p ∈ interior (Set.Icc (1 / 2 : ℝ) q),
L ≤ StatMech.TwoDim.kklw_logMaxInfl p A) :
1 / 2 + (2 * v₀ * L) * (q - 1 / 2) ≤ StatMech.prob q A
def ptn_RhoOptimise (q : ℝ) : Prop :=
∀ p ∈ Set.Ioo (1 / 2 : ℝ) q, p < 1 → ∀ {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(φ : ConfigSpace E → Bool),
(∀ ρ : ℝ, 0 ≤ ρ → ρ ≤ 1 → ∀ q' : ℝ, 1 ≤ q' → q' ≤ 2 → ρ ^ 2 = (q' - 1) * 4 * p * (1 - p) →
(1 / (ptn_sigma p) ^ 2) * ∑ S : Finset E, (S.card : ℝ) * ((ρ ^ (S.card - 1)) ^ 2
* (ptn_coeff p (fun ω => if φ ω then (1 : ℝ) else 0) S) ^ 2)
≤ (maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) ^ (2 / q' - 1)
* totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)) →
2 * OSSS.var (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
* Real.log (1 / maxInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0))
≤ totalInfl (OSSS.bernoulliWeight p) (fun ω => if φ ω then (1 : ℝ) else 0)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:1120
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
noncomputable def prob (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
∑ ω, A.indicator (fun _ => (1 : ℝ)) ω * configWeight p ω
MathlibExt/Probability/CorrelationInequalities/Russo.lean:74
noncomputable def kklw_logMaxInfl [Nonempty E] (p : ℝ) (A : Set (ConfigSpace E)) : ℝ :=
Real.log (1 / maxInfl (OSSS.bernoulliWeight p) (A.indicator (fun _ => (1 : ℝ))))
CSLibExt/Complexity/BooleanFunctions/KKL/KKLEvents.lean:104
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.