Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(26), proof of Lemma 4.1, p. 13 — 0 = (ηx⁽⁰⁾ + d_x)ᵀ(ηs⁽⁰⁾ + d_s) + (ητ⁽⁰⁾ + d_τ)(ηκ⁽⁰⁾ + d_κ) and its expansion

Proved
ConicQuadIPM.NewtonStep.eq_26

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

conic-optimizationinterior-pointnewton-directionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the setting of the Newton system (22) of Andersen, Roos and Terlaky — a product cone K=K1×⋯×KkK = K^1\times\cdots\times K^kK=K1×⋯×Kk with the usual dimension conventions, data AAA, bbb, ccc, any point (x(0),τ(0),y(0),s(0),κ(0))(x^{(0)},\tau^{(0)},y^{(0)},s^{(0)},\kappa^{(0)})(x(0),τ(0),y(0),s(0),κ(0)), γ∈[0,1]\gamma\in[0,1]γ∈[0,1] and a solution (dx,dτ,dy,ds,dκ)(d_x,d_\tau,d_y,d_s,d_\kappa)(dx​,dτ​,dy​,ds​,dκ​) of (22) — put η=1−γ\eta = 1-\gammaη=1−γ. Then

0=(ηx(0)+dx)T(ηs(0)+ds)+(ητ(0)+dτ)(ηκ(0)+dκ)=η2((x(0))Ts(0)+τ(0)κ(0))+η((x(0))Tds+(s(0))Tdx+τ(0)dκ+κ(0)dτ)+dxTds+dτdκ.\begin{aligned} 0 &= (\eta x^{(0)} + d_x)^T(\eta s^{(0)} + d_s) + (\eta\tau^{(0)} + d_\tau)(\eta\kappa^{(0)} + d_\kappa)\\ &= \eta^2\big((x^{(0)})^Ts^{(0)} + \tau^{(0)}\kappa^{(0)}\big) + \eta\big((x^{(0)})^Td_s + (s^{(0)})^Td_x + \tau^{(0)}d_\kappa + \kappa^{(0)}d_\tau\big) + d_x^Td_s + d_\tau d_\kappa. \end{aligned}0​=(ηx(0)+dx​)T(ηs(0)+ds​)+(ητ(0)+dτ​)(ηκ(0)+dκ​)=η2((x(0))Ts(0)+τ(0)κ(0))+η((x(0))Tds​+(s(0))Tdx​+τ(0)dκ​+κ(0)dτ​)+dxT​ds​+dτ​dκ​.​

The first equality says that the shifted direction of (25) is complementary; the second expands the product. Together with the value of the middle term computed on p. 14 it yields the orthogonality dxTds+dτdκ=0d_x^Td_s + d_\tau d_\kappa = 0dxT​ds​+dτ​dκ​=0.

Formalization Note Both equalities of (26) are stated, as a conjunction: the first equality, and the expansion of its right-hand side. xTsx^TsxTs is ∑i(xi)Tsi\sum_i (x^i)^Ts^i∑i​(xi)Tsi over the blocks; η\etaη is written out as 1−γ1-\gamma1−γ. The hypothesis γ∈[0,1]\gamma\in[0,1]γ∈[0,1] is the range of (21) and is not needed.

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

open Matrix

theorem eq_26
    {m k : ℕ} (kind : Fin k → ConicQuadIPM.Complementarity.ConeKind) (n : Fin k → ℕ) (hwf : ConicQuadIPM.Complementarity.WellFormed kind n)
    (A : (i : Fin k) → Matrix (Fin m) (Fin (n i)) ℝ) (b : Fin m → ℝ)
    (c : (i : Fin k) → Fin (n i) → ℝ)
    (x0 : (i : Fin k) → Fin (n i) → ℝ) (τ0 : ℝ) (y0 : Fin m → ℝ)
    (s0 : (i : Fin k) → Fin (n i) → ℝ) (κ0 : ℝ) (γ : ℝ) (hγ : γ ∈ Set.Icc (0 : ℝ) 1)
    (dx : (i : Fin k) → Fin (n i) → ℝ) (dτ : ℝ) (dy : Fin m → ℝ)
    (ds : (i : Fin k) → Fin (n i) → ℝ) (dκ : ℝ)
    (h22 : NewtonSystem kind n A b c x0 τ0 y0 s0 κ0 γ dx dτ dy ds dκ) :
    0 = (∑ i, ((1 - γ) • x0 i + dx i) ⬝ᵥ ((1 - γ) • s0 i + ds i))
          + ((1 - γ) * τ0 + dτ) * ((1 - γ) * κ0 + dκ) ∧
    (∑ i, ((1 - γ) • x0 i + dx i) ⬝ᵥ ((1 - γ) • s0 i + ds i))
          + ((1 - γ) * τ0 + dτ) * ((1 - γ) * κ0 + dκ)
      = (1 - γ) ^ 2 * ((∑ i, x0 i ⬝ᵥ s0 i) + τ0 * κ0)
        + (1 - γ) * ((∑ i, x0 i ⬝ᵥ ds i) + (∑ i, s0 i ⬝ᵥ dx i) + τ0 * dκ + κ0 * dτ)
        + ((∑ i, dx i ⬝ᵥ ds i) + dτ * dκ) := 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. 13, proof of Lemma 4.1, (26)
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