Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. A, proof of Lemma 5 — explicit minimization of ½ΔᵀHΔ + wᵀΔ over {CΔ = 0}

Proved
ALADIN.DualDecomp.explicit_min_dy

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

linear-algebrap2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-programming

Let H∈Rn×nH\in\mathbb R^{n\times n}H∈Rn×n be symmetric positive definite, C∈Rnh×nC\in\mathbb R^{n_h\times n}C∈Rnh​×n of full row rank nhn_hnh​, and w∈Rnw\in\mathbb R^nw∈Rn. Put

P=H−1−H−1C⊤(CH−1C⊤)−1CH−1.P = H^{-1} - H^{-1}C^\top\big(CH^{-1}C^\top\big)^{-1}CH^{-1}.P=H−1−H−1C⊤(CH−1C⊤)−1CH−1.

Then

  1. CH−1C⊤CH^{-1}C^\topCH−1C⊤ is invertible;
  2. Δ⋆=−Pw\Delta^\star = -PwΔ⋆=−Pw satisfies CΔ⋆=0C\Delta^\star = 0CΔ⋆=0;
  3. Δ⋆\Delta^\starΔ⋆ minimizes Δ↦12Δ⊤HΔ+w⊤Δ\Delta\mapsto\tfrac12\Delta^\top H\Delta + w^\top\DeltaΔ↦21​Δ⊤HΔ+w⊤Δ over {Δ:CΔ=0}\{\Delta : C\Delta = 0\}{Δ:CΔ=0};
  4. the minimum value is −12 w⊤Pw-\tfrac12\,w^\top P w−21​w⊤Pw;
  5. w⊤Pw≥0w^\top P w\ge 0w⊤Pw≥0.

In the proof of Lemma 5 this is applied blockwise with H=HiH = H_iH=Hi​, C=CiC = C_iC=Ci​, w=Ai⊤(λQP−λ)w = A_i^\top(\lambda_{\mathrm{QP}}-\lambda)w=Ai⊤​(λQP​−λ): summing the minimum values gives 12(λQP−λ)⊤M(λQP−λ)\tfrac12(\lambda_{\mathrm{QP}}-\lambda)^\top M(\lambda_{\mathrm{QP}}-\lambda)21​(λQP​−λ)⊤M(λQP​−λ) with MMM from (the corrected) (A.6), and item 5 shows that MMM is negative semidefinite.

Preamble
import Mathlib
Formal statement
namespace ALADIN.DualDecomp

open Matrix

/-- App. A, proof of Lemma 5, p. 1124 ("we solve the remaining minimization problem over Δy
explicitly"): for `H ∈ ℝ^{n×n}` positive definite, `C ∈ ℝ^{nh×n}` of full row rank and `w ∈ ℝⁿ`, put
`P = H⁻¹ − H⁻¹ Cᵀ (C H⁻¹ Cᵀ)⁻¹ C H⁻¹`. Then `C H⁻¹ Cᵀ` is invertible, `Δ⋆ = −P w` satisfies `C Δ⋆ = 0`
and minimizes `½ Δᵀ H Δ + wᵀ Δ` over `{Δ | C Δ = 0}`, the minimum value is `−½ wᵀ P w`, and `wᵀ P w ≥ 0`. -/
theorem explicit_min_dy {n nh : ℕ} (H : Matrix (Fin n) (Fin n) ℝ) (C : Matrix (Fin nh) (Fin n) ℝ)
    (hH : H.PosDef) (hC : C.rank = nh) (w : Fin n → ℝ) :
    let P := H⁻¹ - H⁻¹ * Cᵀ * (C * H⁻¹ * Cᵀ)⁻¹ * C * H⁻¹
    IsUnit (C * H⁻¹ * Cᵀ).det ∧
    C *ᵥ (-(P *ᵥ w)) = 0 ∧
    IsMinOn (fun Δ : Fin n → ℝ => 1 / 2 * (Δ ⬝ᵥ (H *ᵥ Δ)) + w ⬝ᵥ Δ) {Δ | C *ᵥ Δ = 0}
      (-(P *ᵥ w)) ∧
    1 / 2 * ((-(P *ᵥ w)) ⬝ᵥ (H *ᵥ (-(P *ᵥ w)))) + w ⬝ᵥ (-(P *ᵥ w)) = -(1 / 2) * (w ⬝ᵥ (P *ᵥ w)) ∧
    0 ≤ w ⬝ᵥ (P *ᵥ w) := by sorry

end ALADIN.DualDecomp
Source
Houska, Frasch, Diehl, An augmented Lagrangian based algorithm for distributed nonconvex optimization, SIAM J. Optim. 26 (2016), p. 1124, App. A, proof of Lemma 5, explicit minimization over Δy
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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