There is one polynomial of degree at most n through n plus one data points with distinct nodes. The point is to make the formal expression readable enough to audit line by line.
Definitions first
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.
The definition determines which expressions are legal; only then does the identity become meaningful. An equality in \(\mathcal A\) may change ambient meaning, so I keep \(\mathsf D\) separate from \(\mathsf C\).
A small case in full
This is the algebraic core of the note. Once this line is correct, the surrounding interpretation has something solid to refer to.
The reusable statement
The formula is reusable precisely because it says which pieces are structural and which belong only to the worked example.
A nearby false statement
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.
A symbolic summary is trustworthy only because the example and limitation remain visible beside it. The box compresses the conclusion without hiding its origin.