Every solution of the normal system is a global least-squares minimizer
ProvedMetodosNumericos.mmq_normal_system_minimizerIf the coefficients satisfy the normal system, then for every coefficient vector . This converse of the source's derivation is what makes the normal system a characterization of the least-squares fit and not merely a necessary condition.
import Mathlib import Definitions.Def_MetodosNumericos_ajusteDefs
namespace MetodosNumericos
theorem mmq_normal_system_minimizer {m n : ℕ} (phi : Fin (n + 1) → ℝ → ℝ)
(x f : Fin (m + 1) → ℝ) (c : Fin (n + 1) → ℝ) (hc : NormalSystem phi x f c) :
∀ d : Fin (n + 1) → ℝ, sqError phi x f c ≤ sqError phi x f d := 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 natural numbers , a family of real functions, node and data families of reals each, and a coefficient family of reals, the hypothesis is that for every index ,
The conclusion is that for every coefficient family of reals,
The comparison is with all coefficient vectors (a global statement), the inequality is non-strict, and no uniqueness is claimed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.