Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix, proof of Lemma 4.2, p. 40 — T(−Q + (Te₁+w)(Te₁+w)ᵀ/(1+e₁ᵀTw))T is (31) at ŵ = Tw

Proved
ConicQuadIPM.NTScaling.rot_scaling_conjugate

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

conic-optimizationnesterov-todd-scalingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1second-order-cone

Let d≥2d\ge2d≥2, let TTT, QQQ be the matrices (18), (19) of the rotated quadratic cone and Qq=diag⁡(1,−1,…,−1)Q^q=\operatorname{diag}(1,-1,\dots,-1)Qq=diag(1,−1,…,−1). For every w∈Rdw\in\mathbb R^dw∈Rd,

T(−Q+(Te1+w)(Te1+w)T1+e1TTw)T=−Qq+(e1+w^)(e1+w^)T1+e1Tw^,w^=Tw.T\Bigl(-Q + \frac{(Te_1+w)(Te_1+w)^T}{1+e_1^TTw}\Bigr)T = -Q^q + \frac{(e_1+\hat w)(e_1+\hat w)^T}{1+e_1^T\hat w},\qquad \hat w = Tw.T(−Q+1+e1T​Tw(Te1​+w)(Te1​+w)T​)T=−Qq+1+e1T​w^(e1​+w^)(e1​+w^)T​,w^=Tw.

Combined with (63) this shows that the rotated-cone matrix (34) is the conjugate by TTT of the quadratic-cone NT matrix (31), from which (34) follows.

Formalization Note Vectors are Fin d → ℝ with 0-based indices (the paper's x1x_1x1​ is coord x 0); ∥x2:n∥2\|x_{2:n}\|^2∥x2:n​∥2 is tailSq x 1, a sum of squares (Euclidean, never Mathlib's sup norm); xTsx^TsxTs is x ⬝ᵥ s. The page writes the denominator as 1+w^i1+\hat w^i1+w^i, a printed slip for 1+(e1)Tw^i=1+w^1i1+(e_1)^T\hat w^i = 1 + \hat w^i_11+(e1​)Tw^i=1+w^1i​; the Lean uses 1+e1Tw^1+e_1^T\hat w1+e1T​w^. Both sides use Mathlib's total inverse, so the identity is stated for every www.

Preamble
import Mathlib
import Definitions.Def_ConicQuadIPM_NTScaling_Setting
import Definitions.Def_ConicQuadIPM_NTScaling_Scaling
open Matrix
Formal statement
namespace ConicQuadIPM.NTScaling

/-- Appendix, proof of Lemma 4.2, p. 40 (rotated quadratic cone): conjugating the matrix (34)
by `T` gives the quadratic-cone matrix (31) at `ŵ = Tw`, i.e. `T W T = Ŵ`. -/
theorem rot_scaling_conjugate (d : ℕ) (hd : 2 ≤ d) (w : Fin d → ℝ) :
    Tmat .rot d * Wrot d w * Tmat .rot d = WquadOuter d (Tmat .rot d *ᵥ w) := by sorry
end ConicQuadIPM.NTScaling
Source
Andersen, Roos & Terlaky, On implementing a primal-dual interior-point method for conic quadratic optimization, Math. Program. (2003), DOI 10.1007/s10107-002-0349-3; authors' preprint of 18 Dec 2000, p. 40, Appendix, proof of Lemma 4.2 (end)
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