Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6.1, p. 30 — on u, v ≥ 0 the exponent g(u, v) dominates h(u, v)

Proved
OptInapprox.Orthant.g_ge_h

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

elementary-inequalitygaussianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0≤ρ<10\le\rho<10≤ρ<1 and t>0t>0t>0, and let

g(u,v)=u+v1+ρ+(u−v)2+2(1−ρ)uv2(1−ρ2)t2,h(u,v)=u+v1+ρ+(u−v)22(1−ρ2)t2.g(u,v)=\frac{u+v}{1+\rho}+\frac{(u-v)^2+2(1-\rho)uv}{2(1-\rho^2)t^2},\qquad h(u,v)=\frac{u+v}{1+\rho}+\frac{(u-v)^2}{2(1-\rho^2)t^2}.g(u,v)=1+ρu+v​+2(1−ρ2)t2(u−v)2+2(1−ρ)uv​,h(u,v)=1+ρu+v​+2(1−ρ2)t2(u−v)2​.

Then for all u,v≥0u,v\ge0u,v≥0,

g(u,v) ≥ h(u,v).g(u,v)\ \ge\ h(u,v).g(u,v) ≥ h(u,v).

On the quadrant of integration of (18) this lets ggg be replaced by the simpler exponent hhh, at the cost of an inequality; it is the only place where the proof of Proposition 6.1 loses anything.

Preamble
import Mathlib
import Definitions.Def_OptInapprox_Orthant_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace OptInapprox.Orthant

/-- Proof of Proposition 6.1, p. 30: on `u, v ≥ 0`, `g(u, v) ≥ h(u, v)`. -/
theorem g_ge_h (t ρ u v : ℝ) (ht : 0 < t) (hρ0 : 0 ≤ ρ) (hρ1 : ρ < 1) (hu : 0 ≤ u) (hv : 0 ≤ v) :
    hExp ρ t u v ≤ gExp ρ t u v := by sorry

end OptInapprox.Orthant
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. 30, proof of Proposition 6.1 (the sentence after (18))
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