Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — one-iteration contraction

Proved
AdaptiveStepIPM.PredCorr.contraction

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

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

For n≥2n\ge2n≥2, one Algorithm 1 iteration starting from (x,s)∈N2(1/4)(x,s)\in N_2(1/4)(x,s)∈N2​(1/4) reduces the duality measure according to

μ+≤(1−8−1/4n−1/2)μ.\mu^+\le\left(1-8^{-1/4}n^{-1/2}\right)\mu.μ+≤(1−8−1/4n−1/2)μ.

This is the per-iteration estimate displayed in the proof of Theorem 1 and drives its termination count.

Formalization Note The bound on θ1\theta_1θ1​ used in the printed proof fails at n=1n=1n=1; this milestone records the range n≥2n\ge2n≥2. Nothing is lost: at n=1n=1n=1 the predictor term PqPqPq vanishes, the admissible predictor steps form [0,1)[0,1)[0,1) with no greatest element, and Algorithm 1 has no iteration at all.

Preamble
import Mathlib
import Definitions.Def_AdaptiveStepIPM_PredCorr_Algorithm
Formal statement
namespace AdaptiveStepIPM.PredCorr

/-- The contraction displayed in the proof of Theorem 1, printed p. 9. -/
theorem contraction {m n : ℕ} (hn : 2 ≤ n)
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (x s xNext sNext : Fin n → ℝ)
    (hxs : N2 A b c (1 / 4) x s)
    (hstep : Alg1Step A b c x s xNext sNext) :
    mu xNext sNext ≤
      (1 - (8 : ℝ) ^ (-(1 / 4 : ℝ)) * (n : ℝ) ^ (-(1 / 2 : ℝ))) * mu x s := by sorry

end AdaptiveStepIPM.PredCorr
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. 9, proof of Theorem 1, contraction display
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