Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 34, p. 44 — with α = 1/(2(c+R)): e^{2α(c+R)}(α(c+R))² ≤ 1 and α²e^{αc}c² ≤ e^{−α(R+c)}

Proved
LSWCuttingPlane.ChasingZero.alpha_choice

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1parameter-choicepotential-function

Let c>0c>0c>0 and R>0R>0R>0, and put α=12(c+R)\alpha=\dfrac{1}{2(c+R)}α=2(c+R)1​. Then

e2α(c+R)(α(c+R))2≤1andα2eαcc2≤e−α(R+c).e^{2\alpha(c+R)}\big(\alpha(c+R)\big)^2\le1\qquad\text{and}\qquad \alpha^2e^{\alpha c}c^2\le e^{-\alpha(R+c)}.e2α(c+R)(α(c+R))2≤1andα2eαcc2≤e−α(R+c).

This is the choice of the scale α\alphaα of the exponential potential in the proof of Theorem 34: it makes the adversary's drift term α2eαcc2η\alpha^2e^{\alpha c}c^2\etaα2eαcc2η no larger than the decrease e−α(R+c)ηe^{-\alpha(R+c)}\etae−α(R+c)η claimed for the player's reset, and it fixes the factor 2(c+R)=1/α2(c+R)=1/\alpha2(c+R)=1/α in the final bound.

Preamble
import Mathlib
import Definitions.Def_LSWCuttingPlane_ChasingZero_Setting
Formal statement
namespace LSWCuttingPlane.ChasingZero

/-- Proof of Theorem 34, p. 44: with `α = 1/(2(c + R))`,
`e^{2α(c+R)} (α(c + R))² ≤ 1` and `α² e^{αc} c² ≤ e^{−α(R+c)}`. -/
theorem alpha_choice (c R α : ℝ) (hc : 0 < c) (hR : 0 < R) (hα : α = 1 / (2 * (c + R))) :
    Real.exp (2 * α * (c + R)) * (α * (c + R)) ^ 2 ≤ 1 ∧
      α ^ 2 * Real.exp (α * c) * c ^ 2 ≤ Real.exp (-(α * (R + c))) := by sorry

end LSWCuttingPlane.ChasingZero
Source
Lee, Sidford, Wong, A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization, arXiv:1508.04874v2, p. 44, proof of Theorem 34, first sentence
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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