A real symmetric positive-definite matrix factors uniquely as L times its transpose with positive diagonal. The point is to make the formal expression readable enough to audit line by line.
The mathematical object
An inner product \(\langle x,y\rangle\) converts algebraic decompositions into orthogonal ones. Self-adjoint maps satisfy \(T=T^\ast\) and have real spectral data.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
One explicit computation
A worked instance is useful here because it exposes every index that the compressed statement hides.
Why the identity matters
The abstraction earns its keep by explaining why the same computation reappears. The notation compresses repeated reasoning without erasing the hypothesis that licenses it.
Where it can fail
Orthogonal diagonalization requires self-adjointness over the real or complex inner-product setting. A general diagonalizable matrix need not have orthogonal eigenvectors.
I would use the boxed line as a reference later, while returning to the full display whenever a hypothesis becomes uncertain. That division keeps compression from becoming ambiguity.