How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Polar decomposition of a real indefinite orthogonal matrix
Statement
Let , , and . There are unique matrices and such that
Moreover , is symmetric and satisfies , and for every real . Thus is joined to its block-diagonal orthogonal factor by a path in ; if , the path lies in .
Facts & Assumptions
Given: The matrix and as in the Statement.
Every self-adjoint endomorphism of a finite-dimensional real inner-product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
Proof
If , there is one matrix, and , satisfy every assertion. If , write ; gives , so , , and , and the factorization and path assertions follow. For , set . For , , so is positive definite and symmetric. The relation gives and, by transposition, . Hence .
By [F1], diagonalize in an orthonormal basis; all its eigenvalues are positive. Define to have eigenvalues in that basis. Then is symmetric positive definite and . If is another symmetric positive definite root, it commutes with and preserves each eigenspace of ; on the -eigenspace, [F1] diagonalizes and positivity forces every eigenvalue to be . Thus .
Both and are symmetric positive definite roots of . Uniqueness in step 2.1 yields , hence and .
Put . Then , and . Thus is Euclidean orthogonal and preserves ; multiplying by shows , so is block diagonal in the positive and negative coordinates. The factorization is unique because its positive factor must be the positive square root of .
Diagonalize by [F1] and define by replacing each positive eigenvalue by . Then is symmetric. Conjugation by preserves the matrix logarithm, so . Consequently ; because commutes with and is orthogonal, preserves . At this is and at it is . Its determinant is constant and equals , proving the path assertion.
Remarks
When , lies in if . The two possible common signs of and are analyzed in The even Clifford norm detects the identity component in mixed signature.
Depends on
Used by
Dependency tree · two levels
4 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Eckhard Meinrenken, Lie groups and Clifford algebras, Chapter 1 §6 and Chapter 2 §4.1 (standard reference, not scraped)