Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 34, p. 43 — eˣ ≤ 1 + x + (x²/2)e^{|x|}, hence e^{αx+αδ} ≤ e^{αx} + αδe^{αx} + ½α²δ²e^{αx+|α|c} for |δ| ≤ c

Proved
LSWCuttingPlane.ChasingZero.exp_taylor_bound

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

exponential-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-functiontaylor-bound

For every real number xxx,

ex≤1+x+x22e∣x∣,e^x\le 1+x+\frac{x^2}{2}e^{|x|},ex≤1+x+2x2​e∣x∣,

and consequently, for all real ccc, δ\deltaδ, xxx, α\alphaα with ∣δ∣≤c|\delta|\le c∣δ∣≤c,

eαx+αδ≤eαx+αδeαx+12α2δ2eαx+∣α∣c.e^{\alpha x+\alpha\delta}\le e^{\alpha x}+\alpha\delta e^{\alpha x}+\frac12\alpha^2\delta^2e^{\alpha x+|\alpha|c}.eαx+αδ≤eαx+αδeαx+21​α2δ2eαx+∣α∣c.

This second-order bound on the exponential is the first step of the proof of Theorem 34: applied coordinatewise, it controls the expected growth of the exponential potential Φ\PhiΦ under a random mean-zero move.

Formalization Note The two parts are stated as a conjunction; the second quantifies over all real ccc (the hypothesis ∣δ∣≤c|\delta|\le c∣δ∣≤c forces c≥0c\ge 0c≥0).

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

/-- Proof of Theorem 34, p. 43, first display: `e^x ≤ 1 + x + (x²/2) e^{|x|}` for all real `x`,
and therefore `e^{αx+αδ} ≤ e^{αx} + αδ e^{αx} + ½ α² δ² e^{αx + |α| c}` whenever `|δ| ≤ c`. -/
theorem exp_taylor_bound :
    (∀ x : ℝ, Real.exp x ≤ 1 + x + x ^ 2 / 2 * Real.exp |x|) ∧
    (∀ c δ x α : ℝ, |δ| ≤ c →
      Real.exp (α * x + α * δ) ≤
        Real.exp (α * x) + α * δ * Real.exp (α * x)
          + 1 / 2 * α ^ 2 * δ ^ 2 * Real.exp (α * x + |α| * 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. 43, proof of Theorem 34, first display
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