Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5 (ii) — directions in the null space QQQ satisfy dxTds+dτdκ=0d_x^Td_s+d_\tau d_\kappa=0dxT​ds​+dτ​dκ​=0

Proved
SelfDualLP.Complexity.theorem_5_ii

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 under the choice (7). Let (dy,dx,dτ,dθ,ds,dκ)(d_y,d_x,d_\tau,d_\theta,d_s,d_\kappa)(dy​,dx​,dτ​,dθ​,ds​,dκ​) lie in the null space QQQ of the constraint matrix of (HLP) after adding the surplus variables sss and κ\kappaκ, i.e.

Adx−bdτ+bˉdθ=0,−ATdy+cdτ−cˉdθ−ds=0,bTdy−cTdx+zˉdθ−dκ=0,−bˉTdy+cˉTdx−zˉdτ=0.\begin{aligned} Ad_x-bd_\tau+\bar bd_\theta&=0,\\ -A^Td_y+cd_\tau-\bar cd_\theta-d_s&=0,\\ b^Td_y-c^Td_x+\bar zd_\theta-d_\kappa&=0,\\ -\bar b^Td_y+\bar c^Td_x-\bar zd_\tau&=0 . \end{aligned}Adx​−bdτ​+bˉdθ​−ATdy​+cdτ​−cˉdθ​−ds​bTdy​−cTdx​+zˉdθ​−dκ​−bˉTdy​+cˉTdx​−zˉdτ​​=0,=0,=0,=0.​

Then

(dx)Tds+dτdκ=0.(d_x)^Td_s+d_\tau d_\kappa=0 .(dx​)Tds​+dτ​dκ​=0.

This orthogonality is what makes the predictor–corrector analysis of the standard primal–dual setting apply verbatim to (HLP).

Preamble
import Mathlib
import Definitions.Def_SelfDualLP_Complexity_HLP
import Definitions.Def_SelfDualLP_Complexity_Neighborhood

open Matrix
Formal statement
namespace SelfDualLP.Complexity

/-- Theorem 5 (ii) (p. 59), under the choice (7). If `(d_y, d_x, d_τ, d_θ, d_s, d_κ)` lies in the
null space `Q` of the constraint matrix of (HLP) after adding surplus variables `s` and `κ`, then
`(d_x)ᵀd_s + d_τ d_κ = 0`. -/
theorem theorem_5_ii {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (d : HLPPoint m n) (hd : InQ7 A b c d) :
    d.x ⬝ᵥ d.s + d.τ * d.κ = 0 := 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. 59, Theorem 5 (ii)
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