Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix, proof of Lemma 4.2, p. 38 — WQW = Q for the arrow form of (31) forces w₁² − ‖w_{2:n}‖² = 1

Proved
ConicQuadIPM.NTScaling.w_normalization

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≥1d\ge1d≥1 and Q=diag⁡(1,−1,…,−1)Q = \operatorname{diag}(1,-1,\dots,-1)Q=diag(1,−1,…,−1) be the matrix of the quadratic cone. For w∈Rdw\in\mathbb R^dw∈Rd with 1+w1>01+w_1>01+w1​>0 let

W=[w1w2:dTw2:dI+w2:dw2:dT1+w1].W = \begin{bmatrix} w_1 & w_{2:d}^T\\ w_{2:d} & I + \frac{w_{2:d}w_{2:d}^T}{1+w_1}\end{bmatrix}.W=[w1​w2:d​​w2:dT​I+1+w1​w2:d​w2:dT​​​].

If WQW=QWQW = QWQW=Q, then

w12−∥w2:d∥2=1.w_1^2 - \|w_{2:d}\|^2 = 1.w12​−∥w2:d​∥2=1.

This normalization is what makes the square of WWW collapse to the rank-one correction (62).

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 hypothesis 1+w1>01+w_1>01+w1​>0 is added so that the division by 1+w11+w_11+w1​, which the page performs without comment, is defined.

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. 38: if the arrow-form matrix (31) satisfies `WQW = Q` for
the quadratic cone, then `w₁² − ‖w_{2:n}‖² = 1`. -/
theorem w_normalization (d : ℕ) (hd : 1 ≤ d) (w : Fin d → ℝ) (hw : 0 < 1 + ConicQuadIPM.Complementarity.coord w 0)
    (hWQW : WquadArrow w * Qmat .quad d * WquadArrow w = Qmat .quad d) :
    ConicQuadIPM.Complementarity.coord w 0 ^ 2 - ConicQuadIPM.Complementarity.tailSq w 1 = 1 := 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. 38, Appendix, proof of Lemma 4.2 (line after (62))
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