Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(15) — one iteration of Algorithm 2 gives μk+1≤(1−4βγ(1−γ)/n)μk\mu^{k+1}\le(1-4\beta\gamma(1-\gamma)/n)\mu^kμk+1≤(1−4βγ(1−γ)/n)μk

Proved
AdaptiveStepIPM.WideNbhd.eq_15

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

interior-point-methodslinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥1n\ge1n≥1, β,γ∈(0,1)\beta,\gamma\in(0,1)β,γ∈(0,1) with γ≤2(1−β)\gamma\le 2(1-\beta)γ≤2(1−β), and let N\mathcal NN be N∞(β)\mathcal N_\infty(\beta)N∞​(β) or N∞−(β)\mathcal N^-_\infty(\beta)N∞−​(β). If (x+,s+)(x^+,s^+)(x+,s+) is obtained from (x,s)(x,s)(x,s) by one iteration of Algorithm 2 with neighbourhood N\mathcal NN and parameter γ\gammaγ (a solution ddd of (2), the largest step θˉ\bar\thetaθˉ keeping (x(θ),s(θ))∈N(x(\theta),s(\theta))\in\mathcal N(x(θ),s(θ))∈N on [0,θˉ][0,\bar\theta][0,θˉ], and (x+,s+)=(x(θˉ),s(θˉ))(x^+,s^+) = (x(\bar\theta),s(\bar\theta))(x+,s+)=(x(θˉ),s(θˉ))), then with μ=xTs/n\mu = x^Ts/nμ=xTs/n and μ+=(x+)Ts+/n\mu^+ = (x^+)^Ts^+/nμ+=(x+)Ts+/n,

μ+  ≤  (1−4βγ(1−γ)n)μ.\mu^+ \;\le\; \Big(1-\frac{4\beta\gamma(1-\gamma)}{n}\Big)\mu .μ+≤(1−n4βγ(1−γ)​)μ.

This is inequality (15): every iteration of Algorithm 2 reduces the duality gap by a factor 1−Ω(1/n)1-\Omega(1/n)1−Ω(1/n), which is the per-iteration content of Theorem 2.

Formalization Note The paper writes (15) as μk+1≤(1−4βγ(1−γ)/n)μk\mu^{k+1}\le(1-4\beta\gamma(1-\gamma)/n)\mu^kμk+1≤(1−4βγ(1−γ)/n)μk along a run; it is stated here for a single iteration, which is how it is used. An iteration includes (x,s)∈N(x,s)\in\mathcal N(x,s)∈N (the step θ=0\theta=0θ=0 is admissible).

Preamble
import Mathlib
import Definitions.Def_AdaptiveStepIPM_WideNbhd_Neighborhoods
import Definitions.Def_AdaptiveStepIPM_WideNbhd_Algorithm2
Formal statement
namespace AdaptiveStepIPM.WideNbhd

open Matrix

/-- Inequality (15) in the proof of Theorem 2 of Mizuno–Todd–Ye (p. 10): for `β, γ ∈ (0, 1)` with
`γ ≤ 2(1 − β)` and `N = N_∞(β)` or `N_∞⁻(β)`, one iteration `(x, s) ↦ (x⁺, s⁺)` of Algorithm 2
satisfies `μ⁺ ≤ (1 − 4βγ(1 − γ)/n) μ`, where `μ = xᵀs/n`, `μ⁺ = (x⁺)ᵀs⁺/n`. -/
theorem eq_15 {n m : ℕ} (hn : 1 ≤ n) (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) (β γ : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (hγ0 : 0 < γ) (hγ1 : γ < 1)
    (hγβ : γ ≤ 2 * (1 - β)) (N : Set ((Fin n → ℝ) × (Fin n → ℝ)))
    (hN : N = Ninf A b c β ∨ N = NinfMinus A b c β) (x s x' s' : Fin n → ℝ)
    (hstep : Alg2Step A N γ x s x' s') :
    AdaptiveStepIPM.PredCorr.mu x' s' ≤ (1 - 4 * β * γ * (1 - γ) / n) * AdaptiveStepIPM.PredCorr.mu x s := by sorry

end AdaptiveStepIPM.WideNbhd
Source
Mizuno, Todd, Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Cornell ORIE Technical Report No. 944 (1990, rev. 1991), p. 10, proof of Theorem 2, (15)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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