Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8 — τᵏ ≥ (1 − 2β)/(eᵀx̄ + eᵀs̄ + 1) if (LP) has an optimum; otherwise κᵏ ≥ (1 − 2β)ε/(n + 1) and τᵏ/θᵏ is bounded

Proved
SelfDualLP.Output.theorem_8

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

Let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n, b∈Rmb\in\mathbb R^mb∈Rm, c∈Rnc\in\mathbb R^nc∈Rn be real data, and let (yk,xk,τk,θk,sk,κk)k≥0(y^k,x^k,\tau^k,\theta^k,s^k,\kappa^k)_{k\ge0}(yk,xk,τk,θk,sk,κk)k≥0​ be the iterates of the Mizuno–Todd–Ye predictor–corrector algorithm applied to the homogeneous self-dual program (HLP) under the choice (7), with β=1/4\beta=1/4β=1/4.

  1. If (LP) possesses an optimal solution, then
τk≥1−2βeTxˉ+eTsˉ+1for all k,\tau^k\ge\frac{1-2\beta}{e^T\bar x+e^T\bar s+1}\qquad\text{for all }k,τk≥eTxˉ+eTsˉ+11−2β​for all k,

where xˉ\bar xxˉ and (yˉ,sˉ)(\bar y,\bar s)(yˉ​,sˉ) are any optimal solution pair for (LP) and (LD). 2. Otherwise there is a fixed number ε>0\varepsilon>0ε>0, independent of kkk, such that for all kkk

κk≥(1−2β)εn+1\kappa^k\ge\frac{(1-2\beta)\varepsilon}{n+1}κk≥n+1(1−2β)ε​

and

1−2β2(n+1)≤1−2βκk≤τkθk≤1+2βκk≤(n+1)(1+2β)(1−2β)ε.\frac{1-2\beta}{2(n+1)}\le\frac{1-2\beta}{\kappa^k}\le\frac{\tau^k}{\theta^k}\le\frac{1+2\beta}{\kappa^k}\le\frac{(n+1)(1+2\beta)}{(1-2\beta)\varepsilon}.2(n+1)1−2β​≤κk1−2β​≤θkτk​≤κk1+2β​≤(1−2β)ε(n+1)(1+2β)​.

So either τk\tau^kτk stays bounded away from zero, which happens exactly when (LP) has an optimal solution, or τk\tau^kτk and θk\theta^kθk tend to zero at the same rate while κk\kappa^kκk stays bounded away from zero. This lets one decide the status of (LP) from an approximate iterate, without running the algorithm to an exact solution.

Formalization Note β\betaβ is the algorithm's fixed parameter 1/41/41/4, so 1−2β=1/21-2\beta=1/21−2β=1/2 and 1+2β=3/21+2\beta=3/21+2β=3/2. "Otherwise" is the negation of "(LP) possesses an optimal solution": it covers infeasible (LP), and feasible but unbounded (LP). The number ε\varepsilonε is chosen after the data and the sequence and before kkk; it may depend on the instance. The chain is kept as printed, with divisions; all denominators are positive along the sequence (κk>0\kappa^k>0κk>0, θk=μk>0\theta^k=\mu^k>0θk=μk>0 on N(2β)\mathcal N(2\beta)N(2β)), so no link holds because of Lean's convention x/0=0x/0=0x/0=0. The statement quantifies over predictor–corrector sequences; on an instance where the maximum in (13) is not attained, no such sequence exists and the statement is vacuous there.

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

/-- Theorem 8 (p. 63), with `β = 1/4`. Let `(yᵏ, xᵏ, τᵏ, θᵏ, sᵏ, κᵏ)` be the iterates of the
predictor–corrector algorithm on (HLP) under (7).
* If (LP) possesses an optimal solution, then `τᵏ ≥ (1 − 2β)/(eᵀx̄ + eᵀs̄ + 1)` for all `k`,
  where `x̄` and `(ȳ, s̄)` are any optimal solution pair for (LP) and (LD);
* otherwise there is a fixed `ε > 0`, independent of `k`, such that for all `k`
  `κᵏ ≥ (1 − 2β)ε/(n + 1)` and
  `(1 − 2β)/(2(n + 1)) ≤ (1 − 2β)/κᵏ ≤ τᵏ/θᵏ ≤ (1 + 2β)/κᵏ ≤ (n + 1)(1 + 2β)/((1 − 2β)ε)`. -/
theorem theorem_8 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (z : ℕ → HLPPoint m n) (hz : IsPCSequence A b c z) :
    (SelfDualLP.Complexity.LPHasSolution A b c →
      ∀ (xbar : Fin n → ℝ) (ybar : Fin m → ℝ) (sbar : Fin n → ℝ),
        SelfDualLP.Complexity.LPOptimal A b c xbar → SelfDualLP.Complexity.LDOptimal A b c ybar sbar →
        ∀ k, (1 - 2 * beta) / (ones n ⬝ᵥ xbar + ones n ⬝ᵥ sbar + 1) ≤ (z k).τ) ∧
    (¬ SelfDualLP.Complexity.LPHasSolution A b c →
      ∃ ε : ℝ, 0 < ε ∧ ∀ k,
        (1 - 2 * beta) * ε / ((n : ℝ) + 1) ≤ (z k).κ ∧
        (1 - 2 * beta) / (2 * ((n : ℝ) + 1)) ≤ (1 - 2 * beta) / (z k).κ ∧
        (1 - 2 * beta) / (z k).κ ≤ (z k).τ / (z k).θ ∧
        (z k).τ / (z k).θ ≤ (1 + 2 * beta) / (z k).κ ∧
        (1 + 2 * beta) / (z k).κ ≤ ((n : ℝ) + 1) * (1 + 2 * beta) / ((1 - 2 * beta) * ε)) := 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, Theorem 8; 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