Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2.1, p. 10 — for G = G_HB or G_NAG and 0 < α ≤ 2/√κ(A), the Gauss–Seidel scheme (41) is A-stable and ρ(E(α, G)) ≤ 1/√(1 + 2α)

Proved
NAGFlow.GSSpectrum.theorem_2_1

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

a-stabilityaccelerated-gradientgauss-seidelheavy-ballnesterovp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-radius

Let AAA be a real symmetric d×dd\times dd×d matrix whose eigenvalues satisfy 0<μ=λmin⁡(A)≤λ≤λmax⁡(A)=L0<\mu=\lambda_{\min}(A)\le\lambda\le\lambda_{\max}(A)=L0<μ=λmin​(A)≤λ≤λmax​(A)=L, and let κ(A)=L/μ\kappa(A)=L/\muκ(A)=L/μ. Let GGG be either of the transformations (39),

GHB=(0I−A/μ−2I),GNAG=(−III−A/μ−I),G_{\mathrm{HB}}=\begin{pmatrix}0 & I\\ -A/\mu & -2I\end{pmatrix},\qquad G_{\mathrm{NAG}}=\begin{pmatrix}-I & I\\ I-A/\mu & -I\end{pmatrix},GHB​=(0−A/μ​I−2I​),GNAG​=(−II−A/μ​I−I​),

split blockwise as G=M+NG=M+NG=M+N with MMM the lower triangular part (diagonal blocks included), and let E(α,G)=(I−αM)−1(I+αN)E(\alpha,G)=(I-\alpha M)^{-1}(I+\alpha N)E(α,G)=(I−αM)−1(I+αN) be the one-step matrix of the Gauss–Seidel splitting scheme (yk+1−yk)/α=Myk+1+Nyk(y_{k+1}-y_k)/\alpha=My_{k+1}+Ny_k(yk+1​−yk​)/α=Myk+1​+Nyk​ of (41). If

0<α≤2κ(A),0<\alpha\le\frac{2}{\sqrt{\kappa(A)}},0<α≤κ(A)​2​,

then the scheme is A-stable, ρ(E(α,G))<1\rho(E(\alpha,G))<1ρ(E(α,G))<1, and

ρ(E(α,G))≤11+2α.\rho(E(\alpha,G))\le\frac{1}{\sqrt{1+2\alpha}}.ρ(E(α,G))≤1+2α​1​.

With α=2/κ(A)\alpha=2/\sqrt{\kappa(A)}α=2/κ(A)​ this gives the contraction factor 1−O(1/κ(A))1-O(1/\sqrt{\kappa(A)})1−O(1/κ(A)​) per step, the accelerated rate, for an explicit scheme that never inverts AAA.

Formalization Note. Eigenvalues of the non-symmetric real matrix E(α,G)E(\alpha,G)E(α,G) are complex. "ρ(E)<1\rho(E)<1ρ(E)<1" and "ρ(E)≤r\rho(E)\le rρ(E)≤r" are stated for every eigenvalue zzz: ∣z∣<1|z|<1∣z∣<1 and ∣z∣≤r|z|\le r∣z∣≤r. This avoids a junk supremum; σ(E)\sigma(E)σ(E) is nonempty here anyway since d≥1d\ge1d≥1. μ=λmin⁡(A)\mu=\lambda_{\min}(A)μ=λmin​(A) and L=λmax⁡(A)L=\lambda_{\max}(A)L=λmax​(A) are encoded as: both are eigenvalues of AAA and bound all eigenvalues of AAA. The case μ>0\mu>0μ>0 is the one of Section 2.3, where GHBG_{\mathrm{HB}}GHB​ and GNAGG_{\mathrm{NAG}}GNAG​ are defined.

Preamble
import Mathlib
import Definitions.Def_NAGFlow_GSSpectrum_Setting
Formal statement
namespace NAGFlow.GSSpectrum

open Matrix

/-- Theorem 2.1, p. 10. In the quadratic model of Section 2 with μ = λ_min(A) > 0, for
G = G_HB or G_NAG of (39), if 0 < α ≤ 2/√κ(A), then the Gauss–Seidel splitting scheme (41) is
A-stable, i.e. ρ(E(α, G)) < 1, and ρ(E(α, G)) ≤ 1/√(1 + 2α). Both spectral-radius claims are
stated eigenvalue by eigenvalue. -/
theorem theorem_2_1 {d : ℕ} (A : Matrix (Fin d) (Fin d) ℝ) (μ L α : ℝ) (hA : IsQuadModel A μ L)
    (hμ : 0 < μ) (hα : 0 < α) (h127 : α ≤ 2 / Real.sqrt (kappa μ L)) :
    ∀ G, (G = GHB A μ ∨ G = GNAG A μ) →
      (∀ z ∈ cspec (EG α G), ‖z‖ < 1) ∧
        ∀ z ∈ cspec (EG α G), ‖z‖ ≤ 1 / Real.sqrt (1 + 2 * α) := by sorry

end NAGFlow.GSSpectrum
Source
Luo & Chen, arXiv:1909.03145v4, Theorem 2.1, p. 10 (with (39) p. 9, (41)–(42) p. 10); proof in App. A, pp. 35–36
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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