Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma (2.1), (13), p. 174 — inverse of the updated matrix A_k*; A_k* is positive definite

Proved
EllipsoidGLS.Rounded.inv_Astar

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

ellipsoid-methodp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-definitesherman-morrison

Let n≥2n\ge 2n≥2, let AAA be a symmetric positive definite n×nn\times nn×n real matrix and let a∈Rna\in\mathbb{R}^na∈Rn be nonzero. Put b=Aa/aTAab=Aa/\sqrt{a^{\mathsf T}Aa}b=Aa/aTAa​ and

A∗=2n2+32n2(A−2n+1 bbT),A^*=\frac{2n^2+3}{2n^2}\left(A-\frac{2}{n+1}\,bb^{\mathsf T}\right),A∗=2n22n2+3​(A−n+12​bbT),

the matrix update of the rounded ellipsoid method. Then A∗A^*A∗ is positive definite and

(A∗)−1=2n22n2+3(A−1+2n−1⋅aaTaTAa).(A^*)^{-1}=\frac{2n^2}{2n^2+3}\left(A^{-1}+\frac{2}{n-1}\cdot\frac{aa^{\mathsf T}}{a^{\mathsf T}Aa}\right).(A∗)−1=2n2+32n2​(A−1+n−12​⋅aTAaaaT​).

This explicit inverse is what the paper uses to control the smallest eigenvalue of the next matrix (Lemma (2.1)) and to verify that the new ellipsoid contains the retained part of the body (Lemma (2.3)).

Formalization Note Positive definiteness is Mathlib's Matrix.PosDef (over R\mathbb{R}R it includes symmetry), and M−1M^{-1}M−1 is Mathlib's matrix inverse; the conclusion asserts the formula for the genuine inverse, since A∗A^*A∗ is shown nonsingular. The page states (13) for the step's matrix AkA_kAk​ and cut vector aaa; here it is stated for an arbitrary positive definite AAA and nonzero aaa, which is the content of the computation.

Preamble
import Mathlib
import Definitions.Def_LinearOptimization_Ellipsoid
import Definitions.Def_EllipsoidGLS_Rounded_Basic
import Definitions.Def_EllipsoidGLS_Rounded_Run
Formal statement
namespace EllipsoidGLS.Rounded

open Matrix

theorem inv_Astar {n : ℕ} (hn : 2 ≤ n) (A : Matrix (Fin n) (Fin n) ℝ) (hA : A.PosDef)
    (a : Fin n → ℝ) (ha : a ≠ 0) :
    (Astar A a).PosDef ∧
      (Astar A a)⁻¹ = (2 * (n : ℝ) ^ 2 / (2 * (n : ℝ) ^ 2 + 3)) •
        (A⁻¹ + ((2 / ((n : ℝ) - 1)) * (a ⬝ᵥ A.mulVec a)⁻¹) • vecMulVec a a) := by sorry

end EllipsoidGLS.Rounded
Source
Grötschel, Lovász, Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981), p. 174, proof of Lemma (2.1), (13)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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