Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2(iv): zero optimal value and the complementarity identity

Proved
SelfDualLP.Regularity.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

For arbitrary initial x0>0x^0>0x0>0, s0>0s^0>0s0>0, and y0y^0y0, the homogeneous program (HLP) has an optimal point with objective value zero. At every feasible point (y,x,τ,θ,s,κ)(y,x,\tau,\theta,s,\kappa)(y,x,τ,θ,s,κ),

((x0)Ts0+1)θ=xTs+τκ.((x^0)^Ts^0+1)\theta=x^Ts+\tau\kappa.((x0)Ts0+1)θ=xTs+τκ.

Because all terms on the right are nonnegative at feasible points, this identity also shows why an optimal point has θ=0\theta=0θ=0 and zero complementarity.

The identity connects the artificial objective with primal-dual complementarity and is used throughout the analysis of (HLP).

Preamble
import Definitions.Def_SelfDualLP_Regularity_HLP

open Matrix
Formal statement
namespace SelfDualLP.Regularity

/-- Ye--Todd--Mizuno (1994), Theorem 2(iv), p. 57. -/
theorem theorem_2_iv {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ)
    (b : Fin m → ℝ) (c : Fin n → ℝ)
    (x₀ : Fin n → ℝ) (y₀ : Fin m → ℝ) (s₀ : Fin n → ℝ)
    (hx₀ : ∀ j, 0 < x₀ j) (hs₀ : ∀ j, 0 < s₀ j) :
    (∃ w : HLPPoint m n,
      IsHLPOptimal A b c x₀ y₀ s₀ w ∧ HLPObjective x₀ s₀ w = 0) ∧
    ∀ w : HLPPoint m n, HLPFeasible A b c x₀ y₀ s₀ w →
      HLPObjective x₀ s₀ w = w.x ⬝ᵥ w.s + w.τ * w.κ := by sorry

end SelfDualLP.Regularity
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); 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