A least-squares minimizer satisfies the normal system
ProvedMetodosNumericos.mmq_minimizer_normal_systemIf the coefficient vector minimizes among all coefficient vectors, then it satisfies the normal system for every . This is the derivation of §6.3, where the source obtains the normal system from the vanishing of the partial derivatives of at a minimum.
import Mathlib import Definitions.Def_MetodosNumericos_ajusteDefs
namespace MetodosNumericos
theorem mmq_minimizer_normal_system {m n : ℕ} (phi : Fin (n + 1) → ℝ → ℝ)
(x f : Fin (m + 1) → ℝ) (c : Fin (n + 1) → ℝ)
(hmin : ∀ d : Fin (n + 1) → ℝ, sqError phi x f c ≤ sqError phi x f d) :
NormalSystem phi x f c := 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, families and of reals, and a coefficient family , the hypothesis is that for every coefficient family ,
that is, is a global minimizer of the sum of squared residuals.
The conclusion is that for every index ,
No differentiability, distinctness of nodes or independence of the base functions is assumed, and nothing is asserted about the existence of a minimizer: the statement is conditional on one being given.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.