Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 8 — an optimal (LP)/(LD) pair, scaled by α = (n+1)/(eᵀx̄ + eᵀs̄ + 1), is a self-complementary solution of (HLP)

Proved
SelfDualLP.Output.optimal_pair_solution

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

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

Work with (HLP) under the choice (7). Let xˉ\bar xxˉ be an optimal solution of (LP) and (yˉ,sˉ)(\bar y,\bar s)(yˉ​,sˉ) an optimal solution of (LD) (with sˉ=c−ATyˉ\bar s=c-A^T\bar ysˉ=c−ATyˉ​). Put

α=n+1eTxˉ+eTsˉ+1.\alpha=\frac{n+1}{e^T\bar x+e^T\bar s+1}.α=eTxˉ+eTsˉ+1n+1​.

Then α>0\alpha>0α>0, and the point

y∗=αyˉ,x∗=αxˉ,τ∗=α,θ∗=0,s∗=αsˉ,κ∗=0y^*=\alpha\bar y,\quad x^*=\alpha\bar x,\quad \tau^*=\alpha,\quad \theta^*=0,\quad s^*=\alpha\bar s,\quad \kappa^*=0y∗=αyˉ​,x∗=αxˉ,τ∗=α,θ∗=0,s∗=αsˉ,κ∗=0

is a self-complementary (that is, optimal) solution of (HLP).

In the proof of Theorem 8 this solution is compared with the iterates; its component τ∗=α\tau^*=\alphaτ∗=α produces the lower bound (1−2β)/(eTxˉ+eTsˉ+1)(1-2\beta)/(e^T\bar x+e^T\bar s+1)(1−2β)/(eTxˉ+eTsˉ+1) on τk\tau^kτk.

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 (p. 63): if `x̄` is optimal for (LP) and `(ȳ, s̄)` is optimal for (LD), then
with `α = (n + 1)/(eᵀx̄ + eᵀs̄ + 1) > 0` the point
`(y*, x*, τ*, θ*, s*, κ*) = (αȳ, αx̄, α, 0, αs̄, 0)` is a self-complementary (i.e. optimal)
solution of (HLP) under (7). -/
theorem optimal_pair_solution {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) (xbar : Fin n → ℝ) (ybar : Fin m → ℝ) (sbar : Fin n → ℝ)
    (hx : SelfDualLP.Complexity.LPOptimal A b c xbar) (hy : SelfDualLP.Complexity.LDOptimal A b c ybar sbar) :
    0 < ((n : ℝ) + 1) / (ones n ⬝ᵥ xbar + ones n ⬝ᵥ sbar + 1) ∧
    HLPOptimal7 A b c
      (let α : ℝ := ((n : ℝ) + 1) / (ones n ⬝ᵥ xbar + ones n ⬝ᵥ sbar + 1)
       ⟨α • ybar, α • xbar, α, 0, α • sbar, 0⟩) := 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; 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