Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.2 — Powell-regularized updates keep ∣det⁡Bk∣≥θˉmk>0|\det B_k|\ge\bar\theta^{m_k}>0∣detBk​∣≥θˉmk​>0

Proved
AndersonAccel.Safe.abs_det_ge

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

anderson-accelerationdeterminantp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1rank-one-update

Let θˉ∈(0,1)\bar\theta\in(0,1)θˉ∈(0,1), let s0,…,smk−1s_0,\dots,s_{m_k-1}s0​,…,smk​−1​ and y0,…,ymk−1y_0,\dots,y_{m_k-1}y0​,…,ymk​−1​ be arbitrary vectors in Rn\mathbb R^nRn, and let B0=I,…,BmkB^0=I,\dots,B^{m_k}B0=I,…,Bmk​ be the Powell-regularized rank-one matrices of (3.5), with s^i\hat s_is^i​ the orthogonalization (3.2) and y~i\tilde y_iy~​i​ as in (3.3). Suppose every update is well-defined, i.e. s^iTsi≠0\hat s_i^Ts_i\neq0s^iT​si​=0 for i=0,…,mk−1i=0,\dots,m_k-1i=0,…,mk​−1. Then

∣det⁡(Bk)∣ ≥ θˉ mk > 0,Bk=Bmk,|\det(B_k)|\ \ge\ \bar\theta^{\,m_k}\ >\ 0,\qquad B_k=B^{m_k},∣det(Bk​)∣ ≥ θˉmk​ > 0,Bk​=Bmk​,

and in particular BkB_kBk​ is invertible.

This is the nonsingularity result for the modified quasi-Newton matrices; it shows how the parameter θˉ\bar\thetaθˉ trades stability against the size of each update.

Formalization Note det⁡\detdet is LinearMap.det of the continuous linear map; invertibility is IsUnit in the ring of continuous linear maps. The window is re-indexed to start at 000 (the paper's sk−mk,…,sk−1s_{k-m_k},\dots,s_{k-1}sk−mk​​,…,sk−1​).

Preamble
import Mathlib
import Definitions.Def_AndersonAccel_Safe_Basic
import Definitions.Def_AndersonAccel_Safe_windowB
Formal statement
namespace AndersonAccel.Safe

/-- Lemma 3.2 (p. 3176). If every update of (3.5) is well-defined (`ŝ_iᵀ s_i ≠ 0`), then
`|det B| ≥ θ̄^{m_k} > 0` and `B` is invertible. -/
theorem abs_det_ge {n : ℕ} (θbar : ℝ) (hθ0 : 0 < θbar) (hθ1 : θbar < 1)
    (s y : ℕ → EuclideanSpace ℝ (Fin n)) (mk : ℕ)
    (hwd : ∀ i < mk, inner ℝ (windowShat s i) (s i) ≠ 0) :
    θbar ^ mk ≤ |LinearMap.det (windowB θbar s y mk :
        EuclideanSpace ℝ (Fin n) →ₗ[ℝ] EuclideanSpace ℝ (Fin n))| ∧
      0 < θbar ^ mk ∧ IsUnit (windowB θbar s y mk) := by sorry

end AndersonAccel.Safe
Source
Zhang, O'Donoghue, Boyd, SIAM J. Optim. 30 (2020), p. 3176, Lemma 3.2
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me