Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — predictor step lower bound

Proved
AdaptiveStepIPM.PredCorr.lemma_4

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

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

At a pair (x,s)∈N2(1/4)(x,s)\in N_2(1/4)(x,s)∈N2​(1/4), let a predictor direction solve (2) with γ=0\gamma=0γ=0, and let θˉ\bar\thetaθˉ be the greatest step whose entire prefix stays in N2(1/2)N_2(1/2)N2​(1/2). Define θ1=min⁡{1/2,μ/(8∥Pq∥2)}\theta_1=\min\{1/2,\sqrt{\mu/(8\|Pq\|_2)}\}θ1​=min{1/2,μ/(8∥Pq∥2​)​} when ∥Pq∥2>0\|Pq\|_2>0∥Pq∥2​>0, and θ1=1/2\theta_1=1/2θ1​=1/2 otherwise. Then

θˉ≥θ1,\bar\theta\ge\theta_1,θˉ≥θ1​,

and every step 0≤θ≤θ10\le\theta\le\theta_10≤θ≤θ1​ is admissible. The bound supplies a guaranteed decrease of the duality measure at a predictor step.

Formalization Note The zero-denominator branch is the limiting value of the printed expression, avoiding Lean's totalized division by zero.

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

/-- Lemma 4, printed p. 8: the lower bound and its admissibility. -/
theorem lemma_4 {m n : ℕ} (hn : 1 ≤ n)
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (x s dx ds : Fin n → ℝ) (dy : Fin m → ℝ) (θbar : ℝ)
    (hxs : N2 A b c (1 / 4) x s)
    (hd : SearchDirection A x s 0 dx dy ds)
    (hmax : IsGreatest {θ : ℝ | PredictorAdmissible A b c x s dx ds θ} θbar) :
    PredictorAdmissible A b c x s dx ds (theta1 x s dx ds) ∧
      theta1 x s dx ds ≤ θbar := 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. 8, Lemma 4
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