Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 9 — x, s ∈ K are complementary iff XⁱSⁱeⁱ = SⁱXⁱeⁱ = 0 for every cone i

Proved
ConicQuadIPM.Complementarity.lemma_3_1

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

complementarityconic-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1second-order-cone

Let K=K1×⋯×KkK=K^1\times\dots\times K^kK=K1×⋯×Kk be a product of cones, each of which is R+\mathbb R_+R+​, a quadratic cone KqK^qKq or a rotated quadratic cone KrK^rKr (Definition 3.1), and let TiT^iTi be the matrices of Definition 3.2. For x,s∈Kx,s\in Kx,s∈K put

Xi=mat⁡(Tixi),Si=mat⁡(Tisi),mat⁡(v)=(v1v2:nTv2:nv1I),X^i=\operatorname{mat}(T^ix^i),\qquad S^i=\operatorname{mat}(T^is^i),\qquad \operatorname{mat}(v)=\begin{pmatrix}v_1&v_{2:n}^T\\v_{2:n}&v_1I\end{pmatrix},Xi=mat(Tixi),Si=mat(Tisi),mat(v)=(v1​v2:n​​v2:nT​v1​I​),

and let ei∈Rnie^i\in\mathbb R^{n^i}ei∈Rni be the first unit vector. Then xxx and sss are complementary, xTs=0x^Ts=0xTs=0, if and only if

XiSiei=SiXiei=0,i=1,…,k.(20)X^iS^ie^i=S^iX^ie^i=0,\qquad i=1,\dots,k. \tag{20}XiSiei=SiXiei=0,i=1,…,k.(20)

Lemma 3.1 turns the single scalar condition xTs=0x^Ts=0xTs=0 into the block-wise system (20), which is the form of complementarity that the central path (21) relaxes and that Newton's method linearises.

Formalization Note. Vectors are Fin d → ℝ with the paper's x1x_1x1​ at index 0; points of KKK are stored block by block and xTs=∑i(xi)Tsix^Ts=\sum_i (x^i)^Ts^ixTs=∑i​(xi)Tsi. Norms inside the cone definitions are Euclidean, written out. The block dimensions (ni=1n^i=1ni=1 for R+\mathbb R_+R+​, ni≥1n^i\ge1ni≥1 for KqK^qKq, ni≥2n^i\ge2ni≥2 for KrK^rKr) are implicit in the paper and added as the hypothesis WellFormed. The hypothesis "x,s∈Kx,s\in Kx,s∈K" is taken literally (KKK is self-dual, so this is primal and dual feasibility).

Preamble
import Mathlib
import Definitions.Def_ConicQuadIPM_Complementarity_Setting

open Matrix
Formal statement
namespace ConicQuadIPM.Complementarity

theorem lemma_3_1 {k : ℕ} (kind : Fin k → ConeKind) (n : Fin k → ℕ)
    (hwf : WellFormed kind n) (x s : (i : Fin k) → Fin (n i) → ℝ)
    (hx : inK kind x) (hs : inK kind s) :
    ∑ i, x i ⬝ᵥ s i = 0 ↔
      ∀ i : Fin k,
        (arrow (Tmat (kind i) (n i) *ᵥ x i) * arrow (Tmat (kind i) (n i) *ᵥ s i)) *ᵥ e1 = 0 ∧
        (arrow (Tmat (kind i) (n i) *ᵥ s i) * arrow (Tmat (kind i) (n i) *ᵥ x i)) *ᵥ e1 = 0 := by sorry

end ConicQuadIPM.Complementarity
Source
Andersen, Roos & Terlaky, On implementing a primal-dual interior-point method for conic quadratic optimization, Math. Program. (2003); authors' preprint of 18 Dec 2000, p. 9, Lemma 3.1 and (20); proof in the Appendix, pp. 36–37
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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