Choosing nodes as roots of an orthogonal polynomial doubles the polynomial exactness available from n samples. I want the notation, the mechanism, and the failure mode visible at the same time.
Statement
Numerical analysis replaces an exact object \(x^\ast\) by approximations \(x_n\) with controlled error. Stability asks how rounding or data perturbations affect the answer.
There are two layers here: the object \(\mathsf D\) and the law \(\mathsf C\). Writing them separately makes the direction of \(\Longrightarrow\) visible and keeps an accidental converse from slipping in.
Worked algebra
An explicit case prevents the notation from becoming ceremonial. Every subscript and superscript in the display contributes to the value.
Conceptual compression
The invariant statement is the one that does not depend on a convenient choice of coordinates, representatives, basis, or enumeration.
Caveat
Fast local convergence is not a global guarantee. Newton's method can diverge, interpolation can oscillate, and a small residual can coexist with a large forward error.
With the dependency made explicit, the same pattern can be recognised safely in nearby problems. A changed hypothesis should now be easy to spot.