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
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 ω
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
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
Uses 7

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
Uses 3
5 fully proved

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.