Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Iwasawa decomposition on the lie algebra level

Statement

Assume the Axiom of Choice. Let g0 be a finite-dimensional real semisimple Lie algebra with Cartan involution θ, Cartan decomposition g0=k0⊕p0, and maximal abelian subspace a⊆p0 with restricted-root system Σ (Restricted root and restricted root space, Restricted root space decomposition); let Σ+ be a positive system and let n=⨁λ∈Σ+g0λ be the associated nilpotent subalgebra (Positive restricted roots and nilpotent n algebra). Then g0 is the vector-space direct sum g0=k0⊕a⊕n. Moreover a is abelian, n is nilpotent, a⊕n is a solvable Lie subalgebra of g0, and its derived subalgebra is [a⊕n,a⊕n]=n.

Facts & Assumptions

Given: The Axiom of Choice; a real semisimple g0 with Cartan involution θ, Cartan decomposition g0=k0⊕p0, maximal abelian a⊆p0, restricted roots Σ, a positive system Σ+, and n=⨁λ∈Σ+g0λ.

[A1]

The Axiom of Choice is The Axiom of Choice; it is declared as part of the ZFC interface of the restricted-root chain and inherited through the decomposition of [L1]. No selection is made in the argument below.

[L1]

g0=g00⊕⨁λ∈Σg0λ with g00=a⊕m, [g0λ,g0μ]⊆g0λ+μ and θg0λ=g0−λ (Restricted root space decomposition).

[L2]

For every H∈a and every restricted root λ the endomorphism ad⁡H acts on g0λ by the scalar λ(H); Σ is finite, so a positive system Σ+ is cut out by a regular H0∈a with λ(H0)>0 for all λ∈Σ+, and the numbers λ(H0), λ∈Σ+, are finitely many positive reals (Positive restricted roots and nilpotent n algebra, Restricted root and restricted root space).

[L3]

k0∩p0=0 and θ is the identity on k0 and minus the identity on p0 (Bracket relations and Killing signs in a Cartan decomposition).

Proof

technique · direct
1.1L1L2algebra

n is a Lie subalgebra of g0: if λ,μ∈Σ+ then [g0λ,g0μ]⊆g0λ+μ by [L1], and g0λ+μ=0 unless λ+μ∈Σ, in which case (λ+μ)(H0)=λ(H0)+μ(H0)>0 and λ+μ∈Σ+; hence [n,n]⊆n.

1.2L1L2algebra

n is nilpotent: if Σ+=∅ then n=0 and nilpotency is trivial, so assume Σ+≠∅; let m=min⁡{λ(H0):λ∈Σ+}>0 and M=max⁡{λ(H0):λ∈Σ+}<∞ by [L2]; every iterated bracket of k elements of n lies in ⨁g0λ1+⋯+λk with λj∈Σ+, and this sum is 0 unless λ1+⋯+λk∈Σ∪{0}; but its value at H0 is at least km>0, so it is not 0 as a functional on the regular element H0, and if it were a restricted root it would lie in Σ+ and its value at H0 would be at most M; hence km≤M, so for k>M/m every iterated bracket of k elements of n vanishes and the descending central series of n reaches 0.

1.3L1L3algebra

k0∩(a⊕n)=0: let X∈k0∩(a⊕n); write X=H+Y with H∈a and Y∈n, and note that θX=X while θH=−H and θY∈⨁λ∈Σ+g0−λ; hence θX=−H+θY, and the direct sum decomposition of g0 into g00 and the restricted-root spaces, applied to the two expressions X=H+Y and θX=−H+θY for the same element, gives H=−H, that is H=0, and θY=Y; then Y∈n∩θn=0 by [L1] because the direct sum is over the disjoint sets of positive and negative roots; hence X=0, and X∈k0∩p0=0 by [L3].

1.4L1L3algebra

k0+a+n=g0: let X∈g0 and write X=X0+∑λ∈ΣXλ with X0∈g00 and Xλ∈g0λ; by [L1] write X0=H+Xm with H∈a and Xm∈m⊆k0, and put Z1=Xm+∑λ∈Σ+(X−λ+θX−λ), Z2=H and Z3=∑λ∈Σ+(Xλ−θX−λ); then Z1∈k0 because each X−λ+θX−λ is fixed by θ and Xm∈m⊆k0 by [L1] and [L3], Z2∈a, and Z3∈n because Xλ∈g0λ and θX−λ∈g0λ by [L1]; since Z1+Z2+Z3=X, the sum k0+a+n is all of g0.

2.1L1L2step 1.1algebra

a normalizes n: for λ∈Σ+ and H∈a with λ(H)≠0 the map X↦[H,X] on g0λ is multiplication by the nonzero scalar λ(H), hence is surjective onto g0λ; since such H exist and [H,g0λ]⊆g0λ by [L1], [a,g0λ]=g0λ for every λ∈Σ+ and [a,n]=n; therefore a⊕n is a subalgebra with [a⊕n,a⊕n]=[a,n]+[n,n]=n, since [a,a]=0 and [n,n]⊆n.

3.1step 2.1step 1.2step 1.3step 1.4algebra∎

By steps 1.3 and 1.4 the sum k0+a+n equals g0 and its intersection in pairs is zero, so g0=k0⊕a⊕n is a direct sum; a is abelian by definition, n is nilpotent by step 1.2, a⊕n is a subalgebra with derived subalgebra [a⊕n,a⊕n]=n by step 2.1, and it is solvable because its derived series begins a⊕n⊇n and then coincides with the derived series of the nilpotent algebra n, which reaches 0.

Depends on

Used by

Dependency tree · two levels

16 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