The KKL inequality at p = 1/2, and the p-biased basis at p = 1/2
TheoremNormalized bit at \(p = 1/2\) is \(-(-1)^b\)#✓fully proved
At p = 1/2 the normalized bit is -(-1)^b.
theorem fsr_ptn_psi_half (b : Bool) :
ptn_psi (1 / 2 : ℝ) b = - khc_sign b
noncomputable def ptn_psi (p : ℝ) (b : Bool) : ℝ := (ptn_val b - p) / ptn_sigma p
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:92
def khc_sign (b : Bool) : ℝ := if b then -1 else 1
CSLibExt/Complexity/BooleanFunctions/KKL/KKLfromHC.lean:72
Uses 4 · Used by 1
Theorem\(p\)-biased character at \(p = 1/2\) is the Walsh character up to sign#✓fully proved
At p = 1/2 the p-biased character is (-1)^{|S|} times the Walsh character.
theorem fsr_ptn_pchar_half (S : Finset ι) (ω : ConfigSpace ι) :
ptn_pchar (1 / 2 : ℝ) S ω = (-1) ^ S.card * khc_walshChar S ω
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def ptn_pchar (p : ℝ) (S : Finset ι) (ω : ConfigSpace ι) : ℝ :=
∏ i ∈ S, ptn_psi p (ω i)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:130
noncomputable def khc_walshChar (S : Finset ι) (x : ι → Bool) : ℝ :=
∏ i ∈ S, khc_sign (x i)
CSLibExt/Complexity/BooleanFunctions/KKL/KKLfromHC.lean:84
Uses 6 · Used by 1
TheoremSquared \(p\)-biased and Walsh coefficients agree at \(p = 1/2\)#✓fully proved
At p = 1/2 the squared p-biased and Walsh Fourier coefficients agree.
theorem fsr_ptn_coeff_half_sq (f : ConfigSpace ι → ℝ) (S : Finset ι) :
(ptn_coeff (1 / 2 : ℝ) f S) ^ 2 = (khc_fourierCoeff f S) ^ 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 khc_fourierCoeff (f : (ι → Bool) → ℝ) (S : Finset ι) : ℝ :=
bnt_uexp (fun x => f x * khc_walshChar S x)
CSLibExt/Complexity/BooleanFunctions/KKL/KKLfromHC.lean:116
Uses 10 · Used by 1
TheoremTotal influence at \(p = 1/2\) via \(p\)-biased Fourier coefficients#✓fully proved
Total influence at p = 1/2 in terms of the p-biased Fourier coefficients.
theorem fsr_totalInfl_half_eq (φ : ConfigSpace ι → Bool) :
totalInfl (OSSS.bernoulliWeight (1 / 2 : ℝ)) (fun ω => if φ ω then (1 : ℝ) else 0)
= ∑ S : Finset ι, 4 * (S.card : ℝ)
* (ptn_coeff (1 / 2 : ℝ) (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_coeff (p : ℝ) (f : ConfigSpace ι → ℝ) (S : Finset ι) : ℝ :=
OSSS.expect (OSSS.bernoulliWeight p) (fun ω => f ω * ptn_pchar p S ω)
CSLibExt/Complexity/BooleanFunctions/Hypercontractivity/PBiasedTensorize.lean:182
TheoremKahn–Kalai–Linial inequality#✓fully proved
Kahn–Kalai–Linial inequality for the uniform measure with constant 2 (J. Kahn, G. Kalai,
N. Linial, The influence of variables on Boolean functions, FOCS 1988; proof after D. Falik,
A. Samorodnitsky, 2007): for every finite nonempty E and every Boolean function φ on {0,
1}^E, 2 · Var(φ) · log (1 / maxₑ Infₑ(φ)) ≤ ∑ₑ Infₑ(φ), where Infₑ(φ) is the probability
that e is pivotal. This is the p = 1/2 case of the p-biased KKL inequality.
theorem fsr_pbiased_endpoint :
KKLHypercontractive (1 / 2 : ℝ) 2
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
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.