Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 314 — the rank-one correction A_{k+1}⁻¹ = (1 + ε/((n−1)(1+ε)))A_k⁻¹ − (ε/((n−1)(1+ε)²)) b bᵗ

Proved
KhachiyanRound.BCD.rank_one_correction

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

coordinate-descentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rank-one-update

Let n≥2n \ge 2n≥2, a1,…,am∈Rna_1,\dots,a_m \in \mathbb{R}^na1​,…,am​∈Rn and p∈SFp \in S_Fp∈SF​. Let rrr be an index maximizing wj(p)w_j(p)wj​(p), let ε=ε(p)\varepsilon = \varepsilon(p)ε=ε(p), τ=ε/(wr(p)−1)\tau = \varepsilon/(w_r(p) - 1)τ=ε/(wr​(p)−1), and let p′=(1−τ)p+τerp' = (1-\tau)p + \tau e_rp′=(1−τ)p+τer​ be the BCD step from ppp. With A=A(p)A = A(p)A=A(p) and b=A−1arb = A^{-1}a_rb=A−1ar​,

A(p′)−1=(1+ε(n−1)(1+ε))A−1−ε(n−1)(1+ε)2 b bT.A(p')^{-1} = \Big(1 + \frac{\varepsilon}{(n-1)(1+\varepsilon)}\Big)A^{-1} - \frac{\varepsilon}{(n-1)(1+\varepsilon)^2}\, b\, b^{\mathsf T}.A(p′)−1=(1+(n−1)(1+ε)ε​)A−1−(n−1)(1+ε)2ε​bbT.

The inverse moment matrix is thus updated by a rank-one correction, which is what makes each BCD iteration cost O(nm)O(nm)O(nm) arithmetic operations.

Formalization Note Only the matrix identity is formalized; the operation count O(nm)O(nm)O(nm) per iteration is not. Central symmetry (2.1) and full dimension (2.2) are not needed (p∈SFp \in S_Fp∈SF​ already makes AAA invertible) and are dropped; n≥2n \ge 2n≥2 is kept, as the formula divides by n−1n-1n−1.

Preamble
import Mathlib
import Definitions.Def_LinearOptimization_Ellipsoid
import Definitions.Def_KhachiyanRound_BCD_Setting

open scoped Pointwise
Formal statement
namespace KhachiyanRound.BCD

theorem rank_one_correction {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
    (a : ι → Fin n → ℝ) (hn : 2 ≤ n) (p : ι → ℝ) (hp : p ∈ SF a)
    (r : ι) (hr : ∀ j, w a p j ≤ w a p r)
    (ε τ : ℝ) (hε : ε = epsOf a p) (hτ : τ = ε / (w a p r - 1))
    (b : Fin n → ℝ) (hb : b = (momentMatrix a p)⁻¹.mulVec (a r)) :
    (momentMatrix a ((1 - τ) • p + τ • Pi.single r 1))⁻¹ =
      (1 + ε / (((n : ℝ) - 1) * (1 + ε))) • (momentMatrix a p)⁻¹ -
        (ε / (((n : ℝ) - 1) * (1 + ε) ^ 2)) • Matrix.vecMulVec b b := by sorry
end KhachiyanRound.BCD
Source
Khachiyan, Rounding of polytopes in the real number model of computation, Math. Oper. Res. 21 (1996), p. 314, rank-one corrections after the proof of Lemma 4
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