Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2 — ∥Pq∥∞−≤∥Pq∥∞≤∥r∥2/4≤nμ/4\|Pq\|^-_\infty\le\|Pq\|_\infty\le\|r\|^2/4\le n\mu/4∥Pq∥∞−​≤∥Pq∥∞​≤∥r∥2/4≤nμ/4, hence θ2−≥θ2≥4βγ/n\theta_2^-\ge\theta_2\ge 4\beta\gamma/nθ2−​≥θ2​≥4βγ/n

Proved
AdaptiveStepIPM.WideNbhd.theta2_lower_bound

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≥2n\ge2n≥2, β,γ∈(0,1)\beta,\gamma\in(0,1)β,γ∈(0,1) with γ≤2(1−β)\gamma\le2(1-\beta)γ≤2(1−β), let (x,s)∈N∞−(β)(x,s)\in\mathcal N^-_\infty(\beta)(x,s)∈N∞−​(β) with μ=xTs/n\mu = x^Ts/nμ=xTs/n, let (dx,dy,ds)(d_x,d_y,d_s)(dx​,dy​,ds​) solve (2) at (x,s)(x,s)(x,s) with parameter γ\gammaγ, and let p,q,rp,q,rp,q,r be the scaled vectors (6). Then

∥Pq∥∞−≤∥Pq∥∞≤∥r∥24≤nμ4,henceθ2− ≥ θ2 ≥ 4βγn,\|Pq\|^-_\infty\le\|Pq\|_\infty\le\frac{\|r\|^2}{4}\le\frac{n\mu}{4}, \qquad\text{hence}\qquad \theta_2^-\ \ge\ \theta_2\ \ge\ \frac{4\beta\gamma}{n},∥Pq∥∞−​≤∥Pq∥∞​≤4∥r∥2​≤4nμ​,henceθ2−​ ≥ θ2​ ≥ n4βγ​,

where θ2=min⁡{1,βγμ/∥Pq∥∞}\theta_2 = \min\{1,\beta\gamma\mu/\|Pq\|_\infty\}θ2​=min{1,βγμ/∥Pq∥∞​} and θ2−=min⁡{1,βγμ/∥Pq∥∞−}\theta_2^- = \min\{1,\beta\gamma\mu/\|Pq\|^-_\infty\}θ2−​=min{1,βγμ/∥Pq∥∞−​} are the step bounds of Lemma 5.

Since N∞(β)⊂N∞−(β)\mathcal N_\infty(\beta)\subset\mathcal N^-_\infty(\beta)N∞​(β)⊂N∞−​(β), this covers every iterate of Algorithm 2 with either neighbourhood, and gives a step length of order 1/n1/n1/n.

Formalization Note The paper writes this in the proof of Theorem 2 without a condition on nnn. The bound min⁡{1,⋅}≥4βγ/n\min\{1,\cdot\}\ge4\beta\gamma/nmin{1,⋅}≥4βγ/n needs 4βγ/n≤14\beta\gamma/n\le14βγ/n≤1, which holds for n≥2n\ge2n≥2 because βγ≤2β(1−β)≤1/2\beta\gamma\le2\beta(1-\beta)\le1/2βγ≤2β(1−β)≤1/2, but can fail for n=1n=1n=1 (e.g. β=1/2\beta = 1/2β=1/2, γ=0.9\gamma = 0.9γ=0.9). For n=1n=1n=1 Algorithm 2 makes no iteration at all (the largest step does not exist), so the hypothesis n≥2n\ge2n≥2 loses nothing for Theorem 2. A zero norm makes the corresponding bound 111, as in Lemma 5.

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

open Matrix

/-- Proof of Theorem 2 of Mizuno–Todd–Ye (p. 10): for `β, γ ∈ (0, 1)` with `γ ≤ 2(1 − β)`,
`(x, s) ∈ N_∞⁻(β)` and a solution `d` of (2) at `(x, s)` with `γ`,
`‖AdaptiveStepIPM.PredCorr.Pq‖⁻_∞ ≤ ‖AdaptiveStepIPM.PredCorr.Pq‖_∞ ≤ ‖r‖²/4 ≤ nμ/4`, hence `θ₂⁻ ≥ θ₂ ≥ 4βγ/n`. The last step needs `n ≥ 2`. -/
theorem theta2_lower_bound {n m : ℕ} (hn : 2 ≤ 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 - β)) (x s : Fin n → ℝ) (hN : (x, s) ∈ NinfMinus A b c β)
    (dx : Fin n → ℝ) (dy : Fin m → ℝ) (ds : Fin n → ℝ) (hd : IsDirection A x s γ dx dy ds) :
    normInfNeg (AdaptiveStepIPM.PredCorr.Pq x s dx ds) ≤ normInf (AdaptiveStepIPM.PredCorr.Pq x s dx ds) ∧
      normInf (AdaptiveStepIPM.PredCorr.Pq x s dx ds) ≤ norm2 (rvec γ x s) ^ 2 / 4 ∧
      norm2 (rvec γ x s) ^ 2 / 4 ≤ (n : ℝ) * AdaptiveStepIPM.PredCorr.mu x s / 4 ∧
      stepBound β γ (AdaptiveStepIPM.PredCorr.mu x s) (normInf (AdaptiveStepIPM.PredCorr.Pq x s dx ds)) ≤
        stepBound β γ (AdaptiveStepIPM.PredCorr.mu x s) (normInfNeg (AdaptiveStepIPM.PredCorr.Pq x s dx ds)) ∧
      4 * β * γ / n ≤ stepBound β γ (AdaptiveStepIPM.PredCorr.mu x s) (normInf (AdaptiveStepIPM.PredCorr.Pq x s dx ds)) := 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
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