Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 4 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Stationary iterations and relaxation

1 · Prerequisites

2 · Summary

This page adds finite-budget Richardson, Jacobi, fixed-order Gauss–Seidel, and SOR procedures using the published stationary-splitting definition. The diagonal/lower/upper convention is A=D−L−U, with L and U the negatives of the strict lower and upper parts. Zero pivots and the inadmissible Richardson or SOR parameter return explicit failure statuses; a finite iteration budget reports the iterate, not a convergence certificate.

The all-start, all-right-hand-side criterion remains the published equivalence ρ(M−1N)<1 on the canonical stationary-splitting page. This page proves the source-backed Jacobi and Gauss–Seidel sufficient conditions: strict row diagonal dominance, and weak row diagonal dominance with a strongly connected off-diagonal graph and at least one strict row. It also proves that for Hermitian A with positive diagonal, SOR converges for every start exactly when A is positive definite and 0<ω<2.

These are exact-arithmetic asymptotic claims. A spectral-radius bound does not prevent transient growth for a nonnormal iteration matrix or polynomial factors from defective Jordan blocks. A norm contraction is sufficient but is not asserted as necessary. No universal convergence factor or optimal relaxation parameter is claimed; any optimal-parameter formula requires its matrix-ordering hypotheses.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Diagonal, lower, and upper parts in the stationary-iteration convention

Definition

Let F be either R or C, let n≥1, fix the coordinate order 1,…,n, and let A=(aij)∈Mn(F). Define D,L,U∈Mn(F) by

Dij={aiii=j,0i≠j,Lij={−aiji>j,0i≤j,Uij={−aiji<j,0i≥j.

Thus D is diagonal, L is strictly lower triangular, U is strictly upper triangular (in the sense of Upper triangular, lower triangular and diagonal square matrices over a commutative ring), and A=D−L−U. If A=A∗, then U=L∗, where ∗ denotes conjugate transpose. The decomposition uses the fixed coordinate order and is an exact-arithmetic identity.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-budget Richardson stationary iteration

Definition

Input n≥1, A∈Mn(C), b,x(0)∈Cn, a real relaxation parameter ω, and an iteration budget m∈N0. First, if dimensions do not match, return invalid-input. Otherwise, if ω=0, return invalid-relaxation. If both checks pass, set M=ω−1In and N=M−A, and for k=0,…,m−1 set

x(k+1)=M−1Nx(k)+M−1b=x(k)+ω(b−Ax(k)).

Return completed with x(m). This is the stationary iteration of Stationary iteration from a matrix splitting A=M−N for A=M−N; M is invertible because ω≠0. The budget may be zero, in which case the output is x(0). The procedure reports no convergence or accuracy certificate.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An irreducible row-substochastic matrix with a strict row has a weighted contraction

Statement

Let n≥1 and let C=(cij)∈Mn(R) have nonnegative entries and row sums at most 1. Form the directed graph with vertices {1,…,n} and an edge i→j exactly when cij>0; assume this graph is strongly connected, with paths of length 0 allowed. Assume one row r has sum strictly less than 1. Then, with 1=(1,…,1)T,

Cn1<1

coordinatewise, and the series v=∑k=0∞Ck1 converges coordinatewise to a vector satisfying v>0 and Cv<v coordinatewise.

Facts & Assumptions

Given: A nonnegative n×n matrix C with row sums at most 1, strongly connected directed support graph, and at least one strict row r.

[A1]

C1≤1 and d:=1−C1≥0 coordinatewise, with dr>0 for a strict row r.

[A2]

For every vertex i, strong connectivity supplies a directed path from i to r; a shortest path has length at most n−1.

Proof

1.1givenA1algebra

Put d=1−C1. Telescoping gives 1−Cn1=∑k=0n−1Ckd, since (I−C)∑k=0n−1Ck=I−Cn. Each summand is coordinatewise nonnegative by [A1].

2.1A1A2step 1.1algebra

For each i, choose by [A2] a path of length si≤n−1 from i to r. The product of the positive edge weights along it is a positive term of (Csi)ir; for si=0 this entry is 1. Hence (Csid)i≥(Csi)irdr>0. Step 1.1 then gives (Cn1)i<1 for every i.

3.1A1step 2.1algebra

Let q:=max⁡i(Cn1)i<1. Since Cs1≤1 for 0≤s<n, nonnegativity gives Ckn+s1≤qk1 for all k≥0 and 0≤s<n. Therefore ∑j=0∞Cj1 converges coordinatewise and its sum v satisfies v≥1>0.

4.1step 3.1algebra∎

Multiplying the convergent series by C shifts its terms, so Cv=v−1<v coordinatewise.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-budget Jacobi stationary iteration

Definition

Input n≥1, A∈Mn(C), b,x(0)∈Cn, and an iteration budget m∈N0. Check dimensions; on a mismatch return invalid-input. Form D,L,U by Diagonal, lower, and upper parts in the stationary-iteration convention. If some diagonal entry of A is zero, return pivot-failure(i) for the least such index i.

Otherwise set M=D and N=L+U, so A=M−N. For each k=0,…,m−1, compute the diagonal solve

Dx(k+1)=(L+U)x(k)+b,

equivalently, simultaneously for every i,

xi(k+1)=bi−∑j≠iaijxj(k)aii.

Return completed with x(m). The solve is the unique diagonal instance of Forward and backward substitution for triangular linear systems when the pivot check succeeds; Forward and backward substitution are correct, unique, and quadratic in scalar operations gives its well-definedness. A zero budget returns x(0). The procedure reports no convergence or accuracy certificate.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Finite-budget Gauss–Seidel stationary iteration

Definition

Input n≥1, A∈Mn(C), b,x(0)∈Cn, and an iteration budget m∈N0. Use the fixed order 1,…,n. Check dimensions; on a mismatch return invalid-input. Form D,L,U by Diagonal, lower, and upper parts in the stationary-iteration convention. If some diagonal entry of A is zero, return pivot-failure(i) for the least such index i.

Otherwise set M=D−L and N=U, so A=M−N. For each k=0,…,m−1, solve the lower-triangular system

(D−L)x(k+1)=Ux(k)+b

by forward substitution in increasing index order. Equivalently, the component updates are

xi(k+1)=bi+∑j<iLijxj(k+1)+∑j>iUijxj(k)aii,i=1,…,n.

Return completed with x(m). The lower-triangular solve is unique after the pivot check by Forward and backward substitution for triangular linear systems and Forward and backward substitution are correct, unique, and quadratic in scalar operations. After the dimension and pivot checks succeed, a zero budget returns completed with x(0). The procedure reports no convergence or accuracy certificate.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-budget successive over-relaxation stationary iteration

Definition

Input n≥1, A∈Mn(C), b,x(0)∈Cn, a real relaxation parameter ω, and an iteration budget m∈N0. Check dimensions; on a mismatch return invalid-input. If ω=0, return invalid-relaxation. Form D,L,U by Diagonal, lower, and upper parts in the stationary-iteration convention. If some diagonal entry of A is zero, return pivot-failure(i) for the least such index i.

Otherwise set

Mω=ω−1D−L,Nω=(ω−1−1)D+U,

so A=Mω−Nω. For each k=0,…,m−1, solve

Mωx(k+1)=Nωx(k)+b

by forward substitution in increasing index order. The lower-triangular coefficient matrix has diagonal entries aii/ω, which are nonzero after the checks. Return completed with x(m). The solve is unique by Forward and backward substitution for triangular linear systems and Forward and backward substitution are correct, unique, and quadratic in scalar operations. A zero budget returns x(0). This procedure is defined for every real ω≠0; it reports no convergence or accuracy certificate.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Strict row diagonal dominance guarantees Jacobi and Gauss–Seidel convergence

Statement

Let n≥1 and A=(aij)∈Mn(R) satisfy strict row diagonal dominance:

∣aii∣>∑j≠i∣aij∣(i=1,…,n).

Then the Jacobi and fixed-order Gauss–Seidel iterations defined by Finite-budget Jacobi stationary iteration and Finite-budget Gauss–Seidel stationary iteration converge in exact arithmetic to the unique solution of Ax=b for every b,x(0)∈Rn.

Facts & Assumptions

Given: n≥1, a real matrix A=(aij) satisfying the displayed strict row diagonal-dominance inequalities, any b,x(0)∈Rn, and the fixed order 1,…,n.

[A1]

For each row i, ∣aii∣>∑j≠i∣aij∣.

[L1]

The diagonal/lower/upper convention has A=D−L−U, with L strictly lower and U strictly upper (Diagonal, lower, and upper parts in the stationary-iteration convention).

[F1]

Jacobi uses the stationary split MJ=D, NJ=L+U and solves Dx(k+1)=(L+U)x(k)+b (Finite-budget Jacobi stationary iteration).

[F2]

Fixed-order Gauss–Seidel uses MG=D−L, NG=U and solves (D−L)x(k+1)=Ux(k)+b (Finite-budget Gauss–Seidel stationary iteration).

[L2]

If a finite-dimensional triangular system has nonzero diagonal, forward or backward substitution gives its unique solution (Forward and backward substitution are correct, unique, and quadratic in scalar operations).

[L3]

For a stationary split A=M−N with invertible M, the iteration matrix is G=M−1N and the update is x(k+1)=Gx(k)+M−1b (Stationary iteration from a matrix splitting A=M−N).

[L4]

Such an iteration converges to the unique solution for every right-hand side and every start if and only if ρ(G)<1 (A stationary splitting converges for every start if and only if its iteration matrix has spectral radius below 1).

Proof

1.1A1F1F2L2algebra

By [A1], every aii≠0. Thus D and the lower-triangular matrix D−L have nonzero diagonal, so the solves in [F1] and [F2] are uniquely defined by [L2].

2.1F1F2L3step 1.1algebra

By [F1]–[F2] and [L3], the iteration matrices are GJ=D−1(L+U) and GG=(D−L)−1U.

3.1A1L1step 2.1algebra

For each row i, set qi=∑j≠i∣aij∣/∣aii∣ and qJ=max⁡iqi<1. Since Lij=−aij below the diagonal and Uij=−aij above it, ∑j∣(GJ)ij∣=qi. Hence for any eigenpair GJz=λz with z≠0, choose i with ∣zi∣=max⁡j∣zj∣; the row equation gives ∣λ∣∣zi∣≤qi∣zi∣≤qJ∣zi∣, so ∣λ∣<1 and ρ(GJ)<1.

3.2A1L1step 2.1algebra

Let GGz=λz with z≠0, and choose i with ∣zi∣=max⁡j∣zj∣=:R. The equation Uz=λ(D−L)z in row i is ∑j>iUijzj=λ(aiizi−∑j<iLijzj), so ∣λ∣ ∣aiizi−∑j<iLijzj∣≤∑j>i∣Uij∣∣zj∣. By the reverse triangle inequality and [A1], the left factor is at least ∣λ∣(∣aii∣−∑j<i∣aij∣)R, while the right side is at most ∑j>i∣aij∣R. Therefore ∣λ∣≤max⁡i∑j>i∣aij∣∣aii∣−∑j<i∣aij∣<1; the denominators are positive and each strict inequality follows from [A1]. Thus ρ(GG)<1.

4.1L4step 3.1step 3.2∎

The bounds in steps 3.1 and 3.2 and [L4] imply that both methods converge to the unique solution of Ax=b for every b and every initial vector.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Irreducibly weak row diagonal dominance with a strict row guarantees Jacobi and Gauss–Seidel convergence

Statement

Let n≥1 and A=(aij)∈Mn(R) satisfy weak row diagonal dominance

∣aii∣≥∑j≠i∣aij∣(i=1,…,n),

with strict inequality in at least one row. Assume the directed off-diagonal graph, with edge i→j when i≠j and aij≠0, is strongly connected (paths of length 0 are allowed). Then the Jacobi and fixed-order Gauss–Seidel iterations defined by Finite-budget Jacobi stationary iteration and Finite-budget Gauss–Seidel stationary iteration converge in exact arithmetic to the unique solution of Ax=b for every b,x(0)∈Rn.

Facts & Assumptions

Given: n≥1, a real matrix A satisfying the displayed weak row inequalities, at least one strict row, and a strongly connected directed off-diagonal graph.

[A1]

Every row satisfies ∣aii∣≥∑j≠i∣aij∣, with at least one strict row; the off-diagonal graph has edges i→j exactly when aij≠0 and is strongly connected.

[L1]

A=D−L−U, where D is diagonal and L,U are the negative strict lower and upper parts (Diagonal, lower, and upper parts in the stationary-iteration convention).

[F1]

Jacobi has iteration matrix GJ=D−1(L+U) (Finite-budget Jacobi stationary iteration).

[F2]

Fixed-order Gauss–Seidel has iteration matrix GG=(D−L)−1U (Finite-budget Gauss–Seidel stationary iteration).

[L2]

For the comparison matrix C≥0 with row sums at most 1, strongly connected positive-entry graph, and a strict row, there is v>0 with Cv<v (An irreducible row-substochastic matrix with a strict row has a weighted contraction).

[L3]

In a stationary split A=M−N, the update has iteration matrix G=M−1N (Stationary iteration from a matrix splitting A=M−N).

[L4]

A stationary iteration converges to the unique solution for every right-hand side and every start exactly when ρ(G)<1 (A stationary splitting converges for every start if and only if its iteration matrix has spectral radius below 1).

[L5]

A lower-triangular system with nonzero diagonal has a unique forward substitution solution (Forward and backward substitution are correct, unique, and quadratic in scalar operations).

Proof

1.1A1L5algebra

If n>1 and aii=0, [A1] forces every off-diagonal entry in row i to vanish, contradicting strong connectivity. If n=1, the strict-row hypothesis forces ∣a11∣>0. Hence every diagonal entry is nonzero, and the Jacobi and lower-triangular Gauss–Seidel solves are defined by [L5].

2.1A1L1L2step 1.1algebra

Define Cii=0 and Cij=∣aij∣/∣aii∣ for i≠j. Its row sums are at most 1, one is strictly below 1, and its positive-entry graph is the graph in [A1]. By [L2], choose v>0 with Cv<v, and set qJ=max⁡i(Cv)i/vi<1.

3.1F1step 2.1algebra

By [F1], ∣GJ∣=C entrywise. For ∥z∥v:=max⁡i∣zi∣/vi, nonnegativity gives ∣GJz∣≤C∣z∣≤∥z∥vCv≤qJ∥z∥vv. Thus every eigenvalue λ of GJ satisfies ∣λ∣≤qJ<1, so ρ(GJ)<1.

3.2A1L1step 2.1algebra

Set BL=∣D∣−1∣L∣ and BU=∣D∣−1∣U∣. Then C=BL+BU, BL is strictly lower triangular, and (I−BL)−1=∑r=0n−1BLr≥I. Thus H:=(I−BL)−1BU=∑r=0n−1BLrBU≥0. Since (I−BL)v−BUv=(I−C)v>0, multiplying by (I−BL)−1≥I gives Hv<v. Consequently qG:=max⁡i(Hv)i/vi<1.

4.1F2L1step 3.2algebra

Because D−L=D(I−D−1L) and D−1L is strictly lower triangular, (D−L)−1U=∑r=0n−1(D−1L)rD−1U. Entrywise absolute values obey ∣XY∣≤∣X∣∣Y∣, so ∣GG∣≤H. The same weighted-vector estimate as in step 3.1 yields ∥GGz∥v≤qG∥z∥v; hence ρ(GG)<1.

5.1L3L4step 3.1step 4.1∎

By [L3]–[L4], the two spectral-radius bounds imply convergence to the unique solution of Ax=b for every right-hand side and every initial vector.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

SOR converges exactly for positive-definite A and relaxation parameter in (0, 2)

Statement

Let n≥1, A∈Mn(C) be Hermitian with strictly positive diagonal, and let ω∈R∖{0}. Write A=D−L−L∗ by Diagonal, lower, and upper parts in the stationary-iteration convention, and define

Mω=ω−1D−L,Nω=(ω−1−1)D+L∗,Gω=Mω−1Nω.

The SOR iteration is x(k+1)=Gωx(k)+Mω−1b. It converges to the unique solution of Ax=b for every b,x(0)∈Cn if and only if A is positive definite (meaning x∗Ax>0 for every nonzero x) and 0<ω<2.

Facts & Assumptions

Given: n≥1, a Hermitian matrix A with positive diagonal, a real ω≠0, and arbitrary b,x(0)∈Cn.

[A1]

A=A∗, aii>0, and ω∈R∖{0}.

[F1]

SOR uses Mω=ω−1D−L and Nω=(ω−1−1)D+L∗ (Finite-budget successive over-relaxation stationary iteration).

[L1]

The fixed diagonal/lower/upper convention gives A=D−L−L∗ for Hermitian A (Diagonal, lower, and upper parts in the stationary-iteration convention).

[L2]

For an invertible matrix M and A=M−N, the stationary update is x(k+1)=M−1Nx(k)+M−1b (Stationary iteration from a matrix splitting A=M−N).

[L3]

This iteration converges to the unique solution for every right-hand side and every start exactly when ρ(M−1N)<1 (A stationary splitting converges for every start if and only if its iteration matrix has spectral radius below 1).

[L4]

Hermitian positive definite means A=A∗ and x∗Ax>0 for every nonzero x (Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal).

[L5]

A lower-triangular system with nonzero diagonal has a unique forward substitution solution (Forward and backward substitution are correct, unique, and quadratic in scalar operations).

[L6]

Determinants are multiplicative for same-sized square matrices over a commutative ring (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[L7]

The determinant of a triangular matrix is the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).

[L9]

Every complex polynomial splits over C (The complex numbers are algebraically closed).

Proof

1.1A1F1L1L2L5L6L7algebra

By [A1] and [F1], Mω is lower triangular with diagonal aii/ω≠0, hence invertible by [L5]. Also A=Mω−Nω by [L1], so [L2] applies with iteration matrix Gω. The matrix Nω is upper triangular with diagonal entries (ω−1−1)aii. Thus [L6]–[L7] give det⁡(Mω)=ω−n∏iaii and det⁡(Nω)=(ω−1−1)n∏iaii. From MωGω=Nω and multiplicativity, det⁡(Gω)=det⁡(Nω)/det⁡(Mω)=(1−ω)n.

1.2A1F1L1L2L4algebra

For sufficiency, suppose A is positive definite and 0<ω<2. Then Q:=Mω+Mω∗−A=(2/ω−1)D is positive definite. For an eigenpair Gωv=λv with v≠0, one has λ≠1 since Av=(1−λ)Mωv and A is invertible. Put a=v∗Av>0. Then v∗Mωv=a/(1−λ), so v∗Qv=a(2Re⁡11−λ−1)=a1−∣λ∣2∣1−λ∣2>0. Therefore ∣λ∣<1 for every eigenvalue and ρ(Gω)<1.

2.1L3L8L9step 1.1algebra

If SOR converges for every right-hand side and start, [L3] gives ρ(Gω)<1. By [L8]–[L9], ∣det⁡(Gω)∣=∏j=1n∣λj∣≤ρ(Gω)n<1. Step 1.1 therefore gives ∣1−ω∣<1, which for real ω is equivalent to 0<ω<2.

2.2A1F1L1L2L3step 1.1algebra

Assume now that SOR converges for every right-hand side and start. Then ρ(Gω)<1 by [L3], so 1 is not an eigenvalue of Gω and I−Gω is invertible. By [L2], A=Mω(I−Gω) is invertible. For b=0, its unique solution is x∗=0. For arbitrary nonzero e(0):=x(0), set e(k):=x(k)−x∗=x(k) and δk=e(k+1)−e(k). The homogeneous SOR recurrence gives Mωe(k+1)=Nωe(k), hence Ae(k)+Mωδk=0. Expanding the Hermitian quadratic form gives (e(k))∗Ae(k)−(e(k+1))∗Ae(k+1)=δk∗(Mω+Mω∗−A)δk=(2/ω−1)δk∗Dδk. The last equality follows from [L1] and [F1].

3.1A1L3L4step 2.1step 2.2algebra

By step 2.1, c:=2/ω−1>0. Summing the identity in step 2.2 from k=0 to N−1 and taking N→∞ (the error tends to 0 by the assumed convergence) gives (e(0))∗Ae(0)=c∑k=0∞δk∗Dδk. Moreover δ0≠0: otherwise step 2.2 implies Ae(0)=0, contrary to invertibility of A. Since D has positive diagonal, the first summand is strictly positive and all others are nonnegative. Thus (e(0))∗Ae(0)>0 for every nonzero e(0), so [L4] gives that A is positive definite.

4.1L3step 2.1step 3.1step 1.2∎

By [L3], ρ(Gω)<1 implies convergence to the unique solution for every right-hand side and every initial vector. Steps 2.1 and 3.1 prove the reverse implication.

Remarks

The conclusion is exact-arithmetic asymptotic convergence; it is not a one-step error decrease or a finite-precision accuracy guarantee. No optimal-ω formula is asserted.

5 · Examples, counterexamples and false statements

None yet.

Sources