Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(61), Appendix, proof of Lemma 3.1, p. 36 — eᵀXSe = Σᵢ (Tⁱxⁱ)ᵀTⁱsⁱ = xᵀs

Proved
ConicQuadIPM.NewtonStep.eq_61

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

arrow-head-matrixconic-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1second-order-cone

Let K=K1×⋯×KkK = K^1\times\cdots\times K^kK=K1×⋯×Kk be a product of cones of the kinds R+\mathbb R_+R+​, KqK^qKq, KrK^rKr, with ni=1n^i = 1ni=1 for R+\mathbb R_+R+​, ni≥1n^i\ge1ni≥1 for KqK^qKq and ni≥2n^i\ge2ni≥2 for KrK^rKr, and let TiT^iTi be the matrices of Definition 3.2. For arbitrary vectors x=(x1;… ;xk)x = (x^1;\dots;x^k)x=(x1;…;xk) and s=(s1;… ;sk)s = (s^1;\dots;s^k)s=(s1;…;sk) put Xi=mat⁡(Tixi)X^i = \operatorname{mat}(T^ix^i)Xi=mat(Tixi), Si=mat⁡(Tisi)S^i = \operatorname{mat}(T^is^i)Si=mat(Tisi), and let eie^iei be the first unit vector of Rni\mathbb R^{n^i}Rni. Then

eTXSe=∑i=1k(ei)TXiSiei=∑i=1k(Tixi)TTisi=xTs.e^TXSe = \sum_{i=1}^k (e^i)^TX^iS^ie^i = \sum_{i=1}^k (T^ix^i)^TT^is^i = x^Ts.eTXSe=i=1∑k​(ei)TXiSiei=i=1∑k​(Tixi)TTisi=xTs.

This identity turns the arrow-head complementarity products into the duality gap. In the proof of Lemma 4.1 it evaluates eTX(0)S(0)e=(x(0))Ts(0)e^TX^{(0)}S^{(0)}e = (x^{(0)})^Ts^{(0)}eTX(0)S(0)e=(x(0))Ts(0); in the proof of Lemma 3.1 it shows that XiSiei=0X^iS^ie^i = 0XiSiei=0 for all iii implies xTs=0x^Ts = 0xTs=0.

Formalization Note The left-hand side is written block by block, ∑i(ei)TXiSiei\sum_i (e^i)^TX^iS^ie^i∑i​(ei)TXiSiei, which is eTXSee^TXSeeTXSe for the block-diagonal XXX, SSS. The page prints the upper limit of the first sum as nnn; it is kkk. The statement is the chain of the last two equalities. No cone membership is assumed, as on the page; the dimension conventions are needed (for KrK^rKr with ni=1n^i = 1ni=1 the matrix TiT^iTi is not orthogonal).

Preamble
import Mathlib
import Definitions.Def_ConicQuadIPM_NewtonStep_Setting
Formal statement
namespace ConicQuadIPM.NewtonStep

open Matrix

theorem eq_61
    {k : ℕ} (kind : Fin k → ConicQuadIPM.Complementarity.ConeKind) (n : Fin k → ℕ) (hwf : ConicQuadIPM.Complementarity.WellFormed kind n)
    (x s : (i : Fin k) → Fin (n i) → ℝ) :
    (∑ i, ConicQuadIPM.Complementarity.e1 ⬝ᵥ ((ConicQuadIPM.Complementarity.arrow (ConicQuadIPM.Complementarity.Tmat (kind i) (n i) *ᵥ x i) * ConicQuadIPM.Complementarity.arrow (ConicQuadIPM.Complementarity.Tmat (kind i) (n i) *ᵥ s i))
        *ᵥ ConicQuadIPM.Complementarity.e1))
      = ∑ i, (ConicQuadIPM.Complementarity.Tmat (kind i) (n i) *ᵥ x i) ⬝ᵥ (ConicQuadIPM.Complementarity.Tmat (kind i) (n i) *ᵥ s i) ∧
    (∑ i, (ConicQuadIPM.Complementarity.Tmat (kind i) (n i) *ᵥ x i) ⬝ᵥ (ConicQuadIPM.Complementarity.Tmat (kind i) (n i) *ᵥ s i))
      = ∑ i, x i ⬝ᵥ s i := by sorry

end ConicQuadIPM.NewtonStep
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. 36, Appendix, proof of Lemma 3.1, (61)
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