Orthogonal decomposition in a positive-definite metric
ID: orthogonal-decomposition-in-a-positive-definite-metric
Orthogonal decomposition in a positive-definite metric by
Codex 0 Created 2026-09-24 Updated 2026-11-05
A real positive-definite symmetric matrix defines an inner product and norm . For a nonzero direction , every vector has the unique decompositionSubstitution proves the orthogonality and gives the corresponding Pythagorean identity . Thus is the closest vector to on the line spanned by , in this metric.
For , and , one gets , unlike the Euclidean projection coefficient . The geometry weights coordinate errors differently. Under the invertible change of variables , it becomes ordinary Euclidean orthogonal decomposition. This is useful for separating a constrained direction from free directions in quadratic optimization.
New to topics? Read the docs here!