Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(124), p. 35 — E(α, R) = (1/δ)(1 + dα, cα(1 + dα); −bα, 1 + aα − bcα²) and 0 < det E(α, R) = 1/δ = 1/(1 + |tr R|α + adα²) < 1

Proved
NAGFlow.GSSpectrum.eq_124

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

gauss-seidelmatrix-splittingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-radius

Let a,b,c,d≥0a,b,c,d\ge 0a,b,c,d≥0 and

R=(−ac−b−d)R=\begin{pmatrix}-a & c\\ -b & -d\end{pmatrix}R=(−a−b​c−d​)

with tr⁡R<0<det⁡R\operatorname{tr}R<0<\det RtrR<0<detR. Split R=M+NR=M+NR=M+N with M=(−a0−b−d)M=\begin{pmatrix}-a&0\\-b&-d\end{pmatrix}M=(−a−b​0−d​) its lower triangular part and N=(0c00)N=\begin{pmatrix}0&c\\0&0\end{pmatrix}N=(00​c0​). For every step size α>0\alpha>0α>0, with δ=(1+aα)(1+dα)\delta=(1+a\alpha)(1+d\alpha)δ=(1+aα)(1+dα),

E(α,R):=(I−αM)−1(I+αN)=1δ(1+dαcα(1+dα)−bα1+aα−bcα2),E(\alpha,R):=(I-\alpha M)^{-1}(I+\alpha N)=\frac1\delta\begin{pmatrix}1+d\alpha & c\alpha(1+d\alpha)\\ -b\alpha & 1+a\alpha-bc\alpha^2\end{pmatrix},E(α,R):=(I−αM)−1(I+αN)=δ1​(1+dα−bα​cα(1+dα)1+aα−bcα2​),

and

0<det⁡E(α,R)=1δ=11+∣tr⁡R∣ α+adα2<1.0<\det E(\alpha,R)=\frac1\delta=\frac{1}{1+|\operatorname{tr}R|\,\alpha+ad\alpha^2}<1.0<detE(α,R)=δ1​=1+∣trR∣α+adα21​<1.

This is the explicit form of the Gauss–Seidel step for the scalar model, from which Lemma A.1 and the spectral bounds for GHBG_{\mathrm{HB}}GHB​ and GNAGG_{\mathrm{NAG}}GNAG​ are derived.

Formalization Note. The paper leaves α>0\alpha>0α>0 implicit (it is the step size of (41)); it is a hypothesis here. MMM and NNN are obtained from RRR by the lower-triangular split of the definitions file, which on this RRR gives exactly the printed matrices.

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

open Matrix

/-- (124) and the display after it, App. A, p. 35. For R = (−a c ; −b −d) with a, b, c, d ≥ 0 and
tr R < 0 < det R, and a step size α > 0, the Gauss–Seidel matrix E(α, R) = (I − αM)⁻¹(I + αN)
(M the lower triangular part of R, N = R − M) equals
(1/δ)(1 + dα, cα(1 + dα) ; −bα, 1 + aα − bcα²) with δ = (1 + aα)(1 + dα), and
0 < det E(α, R) = 1/δ = 1/(1 + |tr R|α + adα²) < 1. -/
theorem eq_124 (a b c d α : ℝ) (ha : 0 ≤ a) (hb : 0 ≤ b) (hc : 0 ≤ c) (hd : 0 ≤ d)
    (htr : (Rmat a b c d).trace < 0) (hdet : 0 < (Rmat a b c d).det) (hα : 0 < α) :
    ER α (Rmat a b c d) = (1 / ((1 + a * α) * (1 + d * α))) •
        !![1 + d * α, c * α * (1 + d * α); -(b * α), 1 + a * α - b * c * α ^ 2] ∧
      0 < (ER α (Rmat a b c d)).det ∧
      (ER α (Rmat a b c d)).det = 1 / ((1 + a * α) * (1 + d * α)) ∧
      1 / ((1 + a * α) * (1 + d * α)) = 1 / (1 + |(Rmat a b c d).trace| * α + a * d * α ^ 2) ∧
      1 / (1 + |(Rmat a b c d).trace| * α + a * d * α ^ 2) < 1 := by sorry

end NAGFlow.GSSpectrum
Source
Luo & Chen, arXiv:1909.03145v4, App. A, proof of Theorem 2.1, (124) and the display after it, p. 35
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me