Hermite nodes from two moments
Abstract
The mean and total squared deviation of positive finite coordinates determine a positive lower Hermite node and an upper node bounding all coordinates.
Theorem 1.1 (Positive lower node and coordinate upper bound).
Proof. Machine-checked in Lean as D5/S3/Analytic/Interpolation/HermiteMomentBounds.hermite_moment_bounds (✓ std3). ∎
Source. Repository-derived.
Commentary.
Let k be a natural number at least two, and let x assign a positive real coordinate to each element of Fin k. Write m for their arithmetic mean, V for their total squared deviation, and r for the nonnegative radius defined below. The lower and upper nodes are m-r and m+(k-1)r.
Strict positivity gives a sum of squares strictly smaller than the square of the sum, hence V is less than k(k-1)m squared and r is less than m. The centered coordinates sum to zero. Cauchy-Schwarz on all indices other than a chosen index bounds its squared deviation by (k-1) times the remaining squared deviations. Substitution of the radius gives the upper bound, including when V is zero.
References
- Truth anchor:
D5/S3/Analytic/Interpolation/HermiteMomentBounds.hermite_moment_bounds