(61), Appendix, proof of Lemma 3.1, p. 36 — eᵀXSe = Σᵢ (Tⁱxⁱ)ᵀTⁱsⁱ = xᵀs
ProvedConicQuadIPM.NewtonStep.eq_61Let be a product of cones of the kinds , , , with for , for and for , and let be the matrices of Definition 3.2. For arbitrary vectors and put , , and let be the first unit vector of . Then
This identity turns the arrow-head complementarity products into the duality gap. In the proof of Lemma 4.1 it evaluates ; in the proof of Lemma 3.1 it shows that for all implies .
Formalization Note The left-hand side is written block by block, , which is for the block-diagonal , . The page prints the upper limit of the first sum as ; it is . 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 with the matrix is not orthogonal).
import Mathlib import Definitions.Def_ConicQuadIPM_NewtonStep_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.