Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6, p. 25 — X² ≤ √(2/π)X + (C/2)δ ⟹ X ≤ √(1/2π) + √(1/2π + Cδ/2) and X² ≤ 2/π + Cδ

Proved
OptInapprox.LevelOne.quadratic_step

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

inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-inequality

Let C=2(1−2/π)C=2(1-\sqrt{2/\pi})C=2(1−2/π​), and let X≥0X\ge 0X≥0 and δ≥0\delta\ge 0δ≥0 be real numbers with

X2≤2/π X+C2 δ.X^2\le\sqrt{2/\pi}\,X+\frac C2\,\delta .X2≤2/π​X+2C​δ.

Then

X≤12π+12π+Cδ2andX2≤2π+Cδ.X\le\sqrt{\frac{1}{2\pi}}+\sqrt{\frac{1}{2\pi}+\frac{C\delta}{2}}\qquad\text{and}\qquad X^2\le\frac{2}{\pi}+C\delta .X≤2π1​​+2π1​+2Cδ​​andX2≤π2​+Cδ.

This is the last step of the proof of Theorem 6, applied with X=∥ℓ∥2X=\|\ell\|_2X=∥ℓ∥2​: the quadratic inequality obtained from the König–Schütt–Tomczak-Jaegermann bound is solved for ∥ℓ∥2\|\ell\|_2∥ℓ∥2​, and the level-one weight ∥ℓ∥22\|\ell\|_2^2∥ℓ∥22​ is bounded by 2/π+Cδ2/\pi+C\delta2/π+Cδ.

Formalization Note Both conclusions are stated, as on the page. The second does not follow from the first by squaring alone (that leaves a δ\sqrt\deltaδ​ term); it is a separate consequence of the quadratic inequality.

Preamble
import Mathlib
Formal statement
namespace OptInapprox.LevelOne

theorem quadratic_step (X δ : ℝ) (hX : 0 ≤ X) (hδ : 0 ≤ δ)
    (h : X ^ 2 ≤ Real.sqrt (2 / Real.pi) * X + (2 * (1 - Real.sqrt (2 / Real.pi)) / 2) * δ) :
    X ≤ Real.sqrt (1 / (2 * Real.pi)) +
        Real.sqrt (1 / (2 * Real.pi) + 2 * (1 - Real.sqrt (2 / Real.pi)) * δ / 2) ∧
    X ^ 2 ≤ 2 / Real.pi + 2 * (1 - Real.sqrt (2 / Real.pi)) * δ := 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 (last display and sentence)
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