Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6, p. 25 — Σ_{|S|=1} f̂(S)² = ‖ℓ‖₂² = ⟨f, ℓ⟩ ≤ ‖f‖_∞‖ℓ‖₁ ≤ ‖ℓ‖₁

Proved
OptInapprox.LevelOne.level_one_le_l1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-functionsfourier-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1parseval

Let f:{−1,1}n→[−1,1]f:\{-1,1\}^n\to[-1,1]f:{−1,1}n→[−1,1] and let ℓ(x)=∑i=1nf^({i})xi\ell(x)=\sum_{i=1}^n\hat f(\{i\})x_iℓ(x)=∑i=1n​f^​({i})xi​ be its linear part. Then

∑∣S∣=1f^(S)2=∥ℓ∥22,∥ℓ∥22=⟨f,ℓ⟩,⟨f,ℓ⟩≤∥f∥∞∥ℓ∥1,∥f∥∞∥ℓ∥1≤∥ℓ∥1.\sum_{|S|=1}\hat f(S)^2=\|\ell\|_2^2,\qquad \|\ell\|_2^2=\langle f,\ell\rangle,\qquad \langle f,\ell\rangle\le\|f\|_\infty\|\ell\|_1,\qquad \|f\|_\infty\|\ell\|_1\le\|\ell\|_1 .∣S∣=1∑​f^​(S)2=∥ℓ∥22​,∥ℓ∥22​=⟨f,ℓ⟩,⟨f,ℓ⟩≤∥f∥∞​∥ℓ∥1​,∥f∥∞​∥ℓ∥1​≤∥ℓ∥1​.

Here ⟨f,ℓ⟩=E[fℓ]\langle f,\ell\rangle=\mathbf E[f\ell]⟨f,ℓ⟩=E[fℓ], ∥ℓ∥1=E∣ℓ∣\|\ell\|_1=\mathbf E|\ell|∥ℓ∥1​=E∣ℓ∣, ∥ℓ∥2=E[ℓ2]\|\ell\|_2=\sqrt{\mathbf E[\ell^2]}∥ℓ∥2​=E[ℓ2]​ and ∥f∥∞=max⁡x∣f(x)∣\|f\|_\infty=\max_x|f(x)|∥f∥∞​=maxx​∣f(x)∣, all under the uniform measure on the cube.

This chain is the first step of the proof of Theorem 6: it reduces the level-one weight of a bounded function to the L1L^1L1 norm of its linear part, a weighted sum of independent random signs.

Preamble
import Mathlib
import Definitions.Def_OptInapprox_LevelOne_Cube
Formal statement
namespace OptInapprox.LevelOne

theorem level_one_le_l1 {n : ℕ} (f : (Fin n → Bool) → ℝ) (hf : ∀ x, |f x| ≤ 1) :
    levelOneWeight f = l2Norm (linPart f) ^ 2 ∧
    l2Norm (linPart f) ^ 2 = OptInapprox.MaxCut.cubeE (fun x => f x * linPart f x) ∧
    OptInapprox.MaxCut.cubeE (fun x => f x * linPart f x) ≤ supNorm f * l1Norm (linPart f) ∧
    supNorm f * l1Norm (linPart f) ≤ l1Norm (linPart f) := by sorry

end OptInapprox.LevelOne
Source
Khot, Kindler, Mossel & O'Donnell, Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?, SIAM J. Comput. 37(1), 2007 (authors' version of February 7, 2007), p. 25, §10.2, Proof of Theorem 6 (first display)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me