Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 8 — every predictor–corrector iterate lies in N(2β), and θᵏ ≤ 1

Proved
SelfDualLP.Output.sequence_in_neighborhood

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

interior-point-methodslinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1predictor-correctorself-dual-embedding

Work with (HLP) under the choice (7) and β=1/4\beta=1/4β=1/4. Let (zk)k≥0(z^k)_{k\ge0}(zk)k≥0​, zk=(yk,xk,τk,θk,sk,κk)z^k=(y^k,x^k,\tau^k,\theta^k,s^k,\kappa^k)zk=(yk,xk,τk,θk,sk,κk), be a predictor–corrector sequence. Then for every kkk,

zk∈N(2β)andθk≤1.z^k\in\mathcal N(2\beta)\qquad\text{and}\qquad \theta^k\le 1 .zk∈N(2β)andθk≤1.

The first part is the opening sentence of the proof of Theorem 8 ("the sequence generated by the predictor-corrector algorithm is in N(2β)\mathcal N(2\beta)N(2β)"). Both facts feed every inequality in Theorem 8: membership in N(2β)\mathcal N(2\beta)N(2β) gives (1−2β)μk≤τkκk≤(1+2β)μk(1-2\beta)\mu^k\le\tau^k\kappa^k\le(1+2\beta)\mu^k(1−2β)μk≤τkκk≤(1+2β)μk, and θk≤1\theta^k\le1θk≤1 gives the upper bound κk≤2(n+1)\kappa^k\le 2(n+1)κk≤2(n+1).

Formalization Note The second conjunct is not printed as a separate sentence; it is read from the step ratios on p. 62 (θk+1/θk≤1−8−1/4/n+1\theta^{k+1}/\theta^k\le 1-8^{-1/4}/\sqrt{n+1}θk+1/θk≤1−8−1/4/n+1​ for predictor steps, =1=1=1 for corrector steps) together with θ0=1\theta^0=1θ0=1, and it is the inequality (n+1)θk≤n+1(n+1)\theta^k\le n+1(n+1)θk≤n+1 used on p. 63.

Preamble
import Mathlib
import Definitions.Def_SelfDualLP_Complexity_LPData
import Definitions.Def_SelfDualLP_Output_HLP
import Definitions.Def_SelfDualLP_Output_Neighborhood
import Definitions.Def_SelfDualLP_Output_PCSequence

open Matrix
Formal statement
namespace SelfDualLP.Output

/-- Proof of Theorem 8, first sentence (p. 63): every iterate of the predictor–corrector
algorithm lies in `𝒩(2β)`, `2β = 1/2`. The second conjunct, `θᵏ ≤ 1 = θ⁰`, is the monotonicity
of `θᵏ` given by the step ratios of p. 62 (`θᵏ⁺¹/θᵏ ≤ 1 − 8^{−1/4}/√(n+1)` on predictor steps,
`= 1` on corrector steps); the proof of Theorem 8 uses it in `κᵏ ≤ (n+1) + (n+1)θᵏ ≤ 2(n+1)`. -/
theorem sequence_in_neighborhood {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) (z : ℕ → HLPPoint m n) (hz : IsPCSequence A b c z) :
    ∀ k, Nbhd A b c (2 * beta) (z k) ∧ (z k).θ ≤ 1 := by sorry
end SelfDualLP.Output
Source
Ye, Todd, Mizuno, An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm, Math. Oper. Res. 19(1) (1994), p. 63, proof of Theorem 8 (first sentence); p. 62, step ratios; DOI 10.1287/moor.19.1.53
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