Gauss-Seidel converges for diagonally dominant matrices
ProvedMetodosNumericos.gauss_seidel_convergesLet be diagonally dominant, for every row , and let x^\\star satisfy Ax^\\star = b. Then, from any starting vector, the Gauss-Seidel iterates converge to x^\\star. This is Proposição 5.10.1; the source states it for the start , and the formal statement allows an arbitrary start.
import Mathlib import Definitions.Def_MetodosNumericos_sistemasDefs open Filter Topology
namespace MetodosNumericos
theorem gauss_seidel_converges {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (b xstar x0 : Fin n → ℝ)
(hA : DiagDominant A) (hsol : A.mulVec xstar = b) :
Tendsto (gaussSeidelSeq A b x0) atTop (𝓝 xstar) := by sorry
end MetodosNumericosRead-back
What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)
Disclosure: this read-back is not blind. It was written by the same agent that drafted the Lean statement, at the explicit instruction of the mission's human owner, and not by an independent auditor with fresh context.
For a natural number , a real matrix and vectors , x^\\star, in , the hypotheses are:
- for every row index , (strict diagonal dominance, sum over the row with the diagonal removed);
- Ax^\\star = b.
The conclusion is that the sequence of Gauss-Seidel iterates starting from converges to x^\\star in .
The Gauss-Seidel iterates are defined by repeated application of the sweep that updates coordinates in increasing order, each coordinate being replaced by where is the vector as currently updated; thus coordinates contribute their new values and coordinates their old ones. Division is total, but diagonal dominance forces . The starting vector is arbitrary and x^\\star is assumed to exist as a hypothesis. For the space is a single point and the statement is trivially true.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.