Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 (iv) — the optimal value of (HLP) is zero and ((x0)Ts0+1)θ=xTs+τκ((x^0)^Ts^0+1)\theta=x^Ts+\tau\kappa((x0)Ts0+1)θ=xTs+τκ on Fh\mathcal F_hFh​

Proved
SelfDualLP.Complexity.theorem_2_iv

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

Let (HLP) be built from data A,b,cA,b,cA,b,c and a starting triple with x0>0x^0>0x0>0, s0>0s^0>0s0>0 and arbitrary y0y^0y0. Then

  1. the optimal value of (HLP) is zero: (HLP) has an optimal solution, and its objective value ((x0)Ts0+1)θ((x^0)^Ts^0+1)\theta((x0)Ts0+1)θ is 000;
  2. for every feasible point (y,x,τ,θ,s,κ)∈Fh(y,x,\tau,\theta,s,\kappa)\in\mathcal F_h(y,x,τ,θ,s,κ)∈Fh​,
((x0)Ts0+1) θ=xTs+τκ.((x^0)^Ts^0+1)\,\theta=x^Ts+\tau\kappa .((x0)Ts0+1)θ=xTs+τκ.

The identity ties the artificial variable θ\thetaθ to the complementarity gap, so driving the gap to zero drives θ\thetaθ to zero; in particular θ=μ\theta=\muθ=μ on N(β)\mathcal N(\beta)N(β) under (7).

Preamble
import Mathlib
import Definitions.Def_SelfDualLP_Complexity_HLP

open Matrix
Formal statement
namespace SelfDualLP.Complexity

/-- Theorem 2 (iv) (p. 57). For any `x⁰ > 0`, `s⁰ > 0` and `y⁰`: the optimal value of (HLP) is
zero (there is an optimal solution and its objective value `((x⁰)ᵀs⁰ + 1)θ` is `0`), and every
feasible point `(y, x, τ, θ, s, κ) ∈ 𝓕_h` satisfies `((x⁰)ᵀs⁰ + 1)θ = xᵀs + τκ`. -/
theorem theorem_2_iv {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (x0 : Fin n → ℝ) (y0 : Fin m → ℝ) (s0 : Fin n → ℝ)
    (hx0 : ∀ j, 0 < x0 j) (hs0 : ∀ j, 0 < s0 j) :
    (∃ z : HLPPoint m n, HLPOptimal A b c x0 y0 s0 z ∧ hlpObjective x0 s0 z = 0) ∧
    ∀ z : HLPPoint m n, HLPFeasible A b c x0 y0 s0 z →
      (x0 ⬝ᵥ s0 + 1) * z.θ = z.x ⬝ᵥ z.s + z.τ * z.κ := by sorry

end SelfDualLP.Complexity
Source
Ye, Todd, Mizuno, An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm, Math. Oper. Res. 19(1) (1994), p. 57, Theorem 2 (iv)
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