The fixed points of the Jacobi sweep are the solutions of
ProvedMetodosNumericos.jacobi_fixed_point_equivIf all diagonal entries of are nonzero, then a vector satisfies if and only if it is unchanged by the Jacobi sweep. This is the equivalence of Proposição 5.5.2, stated for the Jacobi splitting.
import Mathlib import Definitions.Def_MetodosNumericos_sistemasDefs
namespace MetodosNumericos
theorem jacobi_fixed_point_equiv {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (b : Fin n → ℝ)
(hdiag : ∀ i, A i i ≠ 0) (x : Fin n → ℝ) :
A.mulVec x = b ↔ jacobiSweep A b x = x := 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 , a vector and a vector , under the hypothesis that for every index , the statement is an if-and-only-if between:
- the vector equality , where is the usual matrix-vector product; and
- the vector equality , where is the Jacobi sweep, whose -th coordinate is .
Both sides are equalities of functions on the index type, i.e. hold coordinatewise for every . For both sides are trivially true.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.