Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 p,q≥0, J=diag⁡(Ip,−Iq), and A∈O(p,q)={A∈GL⁡p+q(R):ATJA=J}. There are unique matrices K and P such that

A=KP,K∈O(p)×O(q),P=(ATA)1/2>0.

Moreover PJP=J, X=log⁡P is symmetric and satisfies JXJ=−X, and Kexp⁡(sX)∈O(p,q) for every real s. Thus A is joined to its block-diagonal orthogonal factor K by a path in O(p,q); if det⁡A=1, the path lies in SO(p,q).

Facts & Assumptions

Given: The matrix J and ATJA=J as in the Statement.

[F1]

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

technique · direct
1.1givenalgebraconstruct

If p+q=0, there is one 0×0 matrix, and A=K=P=I0, X=0 satisfy every assertion. If p+q=1, write A=(a); ATJA=J gives a2=1, so P=(1), K=A, and X=0, and the factorization and path assertions follow. For p+q≥2, set M=ATA. For x≠0, xTMx=∥Ax∥2>0, so M is positive definite and symmetric. The relation ATJA=J gives A−1=JATJ and, by transposition, A−T=JAJ. Hence JMJ=JATAJ=A−1A−T=M−1.

2.1F1step 1.1construct

By [F1], diagonalize M in an orthonormal basis; all its eigenvalues λi are positive. Define P to have eigenvalues λi in that basis. Then P is symmetric positive definite and P2=M. If R is another symmetric positive definite root, it commutes with M=R2 and preserves each eigenspace of M; on the λ-eigenspace, [F1] diagonalizes R and positivity forces every eigenvalue to be λ. Thus R=P.

3.1step 1.1step 2.1algebra

Both JPJ and P−1 are symmetric positive definite roots of M−1=JMJ. Uniqueness in step 2.1 yields JPJ=P−1, hence PJ=JP−1 and P−1JP−1=J.

4.1step 1.1step 3.1algebra

Put K=AP−1. Then KTK=P−1ATAP−1=I, and KTJK=P−1ATJAP−1=P−1JP−1=J. Thus K is Euclidean orthogonal and preserves J; multiplying KTJK=J by K shows JK=KJ, so K is block diagonal in the positive and negative coordinates. The factorization is unique because its positive factor must be the positive square root of ATA.

5.1F1step 3.1step 4.1algebra∎

Diagonalize P by [F1] and define X=log⁡P by replacing each positive eigenvalue λ by log⁡λ. Then X is symmetric. Conjugation by J preserves the matrix logarithm, so JXJ=log⁡(JPJ)=log⁡(P−1)=−X. Consequently Jexp⁡(sX)J=exp⁡(−sX)=exp⁡(sX)−1; because K commutes with J and is orthogonal, Kexp⁡(sX) preserves J. At s=0 this is K and at s=1 it is A. Its determinant is constant and equals det⁡A, proving the path assertion.

Remarks

When p,q>0, K lies in S(O(p)×O(q)) if A∈SO(p,q). The two possible common signs of det⁡K∣Rp and det⁡K∣Rq 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