Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 2026-09-22
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 cartan decomposition of sl n r

Example

Assume the Axiom of Choice. Let n≥2 and let g0=sln(R)=k0⊕p0 be the Cartan decomposition θ(X)=−XT of Cartan involution and k plus p for sl n r, so that k0=so(n) and p0={X∈sln(R):XT=X} (Cartan decomposition of a real semisimple Lie algebra). Then every g∈SL⁡n(R) has a unique factorization

g=kexp⁡X,k∈SO⁡(n),X∈p0,

with exp⁡ the matrix exponential; equivalently, the global Cartan decomposition of SL⁡n(R) is its polar factorization, and the multiplication map SO⁡(n)×p0→SL⁡n(R) is a diffeomorphism (Global Cartan decomposition for a connected finite center semisimple Lie group).

Facts & Assumptions

Given: The Axiom of Choice; an integer n≥2; the Lie group SL⁡n(R) with Lie algebra sln(R); the Cartan decomposition g0=k0⊕p0 with k0=so(n) and p0 the symmetric traceless matrices of Cartan involution and k plus p for sl n r; and an element g∈SL⁡n(R).

[A1]

The Axiom of Choice is The Axiom of Choice; it enters only through the global Cartan decomposition of [L5] and the smooth structure of SL⁡n(R).

[L1]

SL⁡n(R)={A:det⁡A=1} is an embedded Lie subgroup of GL⁡n(R) with Lie algebra sln(R), and SO⁡(n) is the determinant-one subgroup of O(n) with Lie algebra so(n) (General and special linear Lie groups, Orthogonal and special orthogonal Lie groups).

[L2]

Every endomorphism T of a finite-dimensional real inner product space has a polar decomposition T=SU with U=T∗T non-negative and S an isometry on the orthogonal complement of ker⁡T; the factor U is unique and S is unique when T is invertible (Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible).

[L3]

A self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis with real eigenvalues (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

[L4]

For a matrix Lie group the Lie-group exponential is the matrix exponential eX=∑k≥0Xk/k! (Matrix exponential as the Lie-group exponential).

[L5]

If G is a connected real semisimple Lie group with finite center and K=GΘ for a global Cartan involution with differential θ that fixes Z(G) pointwise, then K×p0→G, (k,X)↦kexp⁡X, is a diffeomorphism (Global Cartan decomposition for a connected finite center semisimple Lie group, Cartan decomposition of a real semisimple Lie algebra).

[L7]

The real algebra sln(R) is semisimple and θ(X)=−XT is its Cartan involution with symmetric traceless anti-fixed space (Cartan involution and k plus p for sl n r, Cartan decomposition of a real semisimple Lie algebra).

Verification

technique · direct matrix computation
1.1givenL2L3algebra

Put P:=gTg, the non-negative square root of the self-adjoint positive definite matrix gTg. By [L3] the matrix P is self-adjoint with an orthonormal eigenbasis and positive eigenvalues λ1,…,λn>0, because g is invertible and ⟨gTgv,v⟩=∥gv∥2>0 for v≠0.

1.2L1algebra

The group SO⁡(n) is path connected. For a unit vector v, a rotation of the plane spanned by v,e1 sends v to e1 and is joined to the identity by varying its angle. If v=−e1, use a rotation through π in the (e1,e2) plane; if v=e1, use the identity. For R∈SO⁡(n) apply this to its first column; after this rotation the matrix is diag⁡(1,R′) with R′∈SO⁡(n−1). Induction, ending with SO⁡(1)={1}, expresses every R as a product of rotations, each with a path to the identity.

2.1step 1.1L6algebra

The determinant of P is 1: det⁡(P)2=det⁡(P2)=det⁡(gTg)=det⁡(gT)det⁡(g)=(det⁡g)2=1 by [L6] and det⁡g=1, while det⁡P=λ1⋯λn>0 by step 1.1, so det⁡P=1.

2.2step 1.1L3L4algebra

Define X:=log⁡P by the spectral decomposition P=Qdiag⁡(λ1,…,λn)QT with Q orthogonal and X:=Qdiag⁡(log⁡λ1,…,log⁡λn)QT. Then X is self-adjoint, and Xk=Qdiag⁡((log⁡λ1)k,…,(log⁡λn)k)QT for every k≥0, so the matrix exponential of [L4] gives exp⁡X=Qdiag⁡(λ1,…,λn)QT=P.

3.1step 1.1step 2.1L1L6algebra

Define k:=gP−1, which is well defined because P is invertible with positive eigenvalues. Then kTk=P−1gTgP−1=P−1P2P−1=I and det⁡k=det⁡gdet⁡P−1=1 by [L6], so k∈SO⁡(n) by [L1].

3.2L7step 2.1step 2.2algebra

The trace of X vanishes: tr⁡X=∑i=1nlog⁡λi=log⁡(λ1⋯λn)=log⁡det⁡P=0 by step 2.1, so X∈p0 by [L7].

4.1step 3.1step 2.2step 3.2

Existence: steps 3.1, 2.2 and 3.2 give g=kP=kexp⁡X with k∈SO⁡(n) and X∈p0.

5.1L1L3L4L5L7step 1.2step 4.1algebra

Define Θ(g)=(gT)−1 on G=SL⁡n(R). It is a smooth involutive automorphism, differentiates to −XT, and has fixed group SO⁡(n). To compute the center, a central matrix commutes with I+tEij∈G for every i≠j and real t, hence with every Eij. Comparing entries of zEij=Eijz forces all off-diagonal entries of z to vanish and its diagonal entries to be equal. Thus z=λI with real λn=1, so the center consists of I and, only when n is even, −I. It is finite and fixed pointwise by Θ. Semisimplicity and the Cartan differential are [L7]. Finally, G is path connected without assuming the global theorem: by step 4.1, g=kexp⁡X, and t↦kexp⁡(tX) joins k to g inside G, since diagonalization gives det⁡exp⁡(tX)=exp⁡(ttr⁡X)=1. Step 1.2 joins I to k. Every hypothesis of [L5] is therefore established.

5.2step 3.1step 2.2step 4.1L2L3algebra

Uniqueness: suppose g=kexp⁡X=k′exp⁡X′ with k,k′∈SO⁡(n) and X,X′∈p0. Both exp⁡X and exp⁡X′ are self-adjoint positive definite, since the eigenvalues of X and X′ are real by self-adjointness and exponentiate to positive numbers, and both k,k′ are orthogonal. By the uniqueness clause of [L2] for the invertible element g the non-negative factor is unique, so exp⁡X=exp⁡X′=P and k=k′; then X=X′ because the self-adjoint logarithm is unique: both X and X′ commute with P=exp⁡X=exp⁡X′, hence preserve each eigenspace of P, and on the eigenspace for the eigenvalue λ>0 the equality eX=eX′=λI forces every eigenvalue of the self-adjoint operator X∣Eλ to lie in log⁡λ+2πiZ, hence to equal the real number log⁡λ.

6.1step 4.1step 5.2step 5.1L5L2

Consequently the map SO⁡(n)×p0→SL⁡n(R), (k,X)↦kexp⁡X, is a bijection by steps 4.1 and 5.2 and a diffeomorphism by [L5] applied as in step 5.1; its inverse is g↦(gP−1,log⁡P) with P=gTg.

7.1A1L6step 6.1algebra∎

The argument includes repeated eigenvalues, since the logarithm is scalar on each positive eigenspace. The zero logarithm gives the orthogonal elements of G. Although n≥2 is the stated scope, at n=1 both factors and the group are singletons. More generally the orthogonal polar factor is special orthogonal whenever det⁡g>0, since det⁡P=∣det⁡g∣; the stronger condition det⁡g=1 additionally makes tr⁡log⁡P=0. AC covers the cited Lie-group and global Cartan interfaces; no arbitrary eigenbasis selection over an indexed family is needed in the finite matrix calculations.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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