A least-squares solution makes the residual orthogonal to every column of A. The formulas are more useful when each symbol has a job rather than merely decorating the theorem.
The data
Matrix factorizations expose different geometry: \(A=QR\) separates an orthonormal frame, while \(A=U\Sigma V^\ast\) separates rotations from axis scaling.
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\).
Derivation
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
Invariant content
What survives the example is not its particular numbers but the relation encoded by the two rows below. That relation is the part worth transporting to a new setting.
Scope
Conditioning matters numerically. An exact algebraic identity can be a poor computational method when it squares the condition number.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.