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 be a finite-dimensional real semisimple Lie algebra with Cartan involution , Cartan decomposition , and maximal abelian subspace with restricted-root system (Restricted root and restricted root space, Restricted root space decomposition); let be a positive system and let be the associated nilpotent subalgebra (Positive restricted roots and nilpotent n algebra). Then is the vector-space direct sum Moreover is abelian, is nilpotent, is a solvable Lie subalgebra of , and its derived subalgebra is .
Facts & Assumptions
Given: The Axiom of Choice; a real semisimple with Cartan involution , Cartan decomposition , maximal abelian , restricted roots , a positive system , and .
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.
with , and (Restricted root space decomposition).
For every and every restricted root the endomorphism acts on by the scalar ; is finite, so a positive system is cut out by a regular with for all , and the numbers , , are finitely many positive reals (Positive restricted roots and nilpotent n algebra, Restricted root and restricted root space).
and is the identity on and minus the identity on (Bracket relations and Killing signs in a Cartan decomposition).
Proof
is a Lie subalgebra of : if then by [L1], and unless , in which case and ; hence .
is nilpotent: if then and nilpotency is trivial, so assume ; let and by [L2]; every iterated bracket of elements of lies in with , and this sum is unless ; but its value at is at least , so it is not as a functional on the regular element , and if it were a restricted root it would lie in and its value at would be at most ; hence , so for every iterated bracket of elements of vanishes and the descending central series of reaches .
: let ; write with and , and note that while and ; hence , and the direct sum decomposition of into and the restricted-root spaces, applied to the two expressions and for the same element, gives , that is , and ; then by [L1] because the direct sum is over the disjoint sets of positive and negative roots; hence , and by [L3].
: let and write with and ; by [L1] write with and , and put , and ; then because each is fixed by and by [L1] and [L3], , and because and by [L1]; since , the sum is all of .
normalizes : for and with the map on is multiplication by the nonzero scalar , hence is surjective onto ; since such exist and by [L1], for every and ; therefore is a subalgebra with , since and .
By steps 1.3 and 1.4 the sum equals and its intersection in pairs is zero, so is a direct sum; is abelian by definition, is nilpotent by step 1.2, is a subalgebra with derived subalgebra by step 2.1, and it is solvable because its derived series begins and then coincides with the derived series of the nilpotent algebra , which reaches .
Depends on
Used by
- Global iwasawa decomposition Theorem
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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter VI (standard reference, not scraped)