Alphabeta Math
PropositionStatement: 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.

Finite-dimensional modules decompose into weight spaces

Statement

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h, and let V be a finite-dimensional representation of g (Representations of Lie algebras). Then V is the direct sum of its weight spaces for h (Weight and weight space): V=⨁μ∈h∗Vμ, and only finitely many of the spaces Vμ are nonzero.

Facts & Assumptions

Given: The Axiom of Choice, such g,h and a finite-dimensional representation V.

[A1]

The Axiom of Choice is assumed; it enters through the root-space theory supplying [L1] and [L4], whose contracts carry the assumption (The Axiom of Choice).

[L1]

For every root α of (g,h) there are eα∈gα and fα∈g−α with [eα,fα]=hα, [hα,eα]=2eα and [hα,fα]=−2fα, so that span⁡{eα,fα,hα} is a copy of sl2 (The root sl2 triple).

[L2]

For a nonzero finite-dimensional module over sl2, the operator h acts diagonalisably with integer eigenvalues (Finite-dimensional representations of sl2).

[L3]

A family of diagonalisable endomorphisms of a finite-dimensional vector space is simultaneously diagonalisable if and only if its members commute pairwise (A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise).

[L4]

The roots of (g,h) form a reduced crystallographic Euclidean root system on E=span⁡RΦ whose simple coroots span h over C; in particular the coroots hα with α ranging over the finitely many roots span h (The roots form a reduced crystallographic Euclidean root system).

Proof

technique · direct
1.1A1L1L2L4

If V=0, every weight space is zero and the asserted direct sum is the empty direct sum, so the conclusion is immediate. If the root set Φ is empty, [L4] gives h=0, and then V=V0 is already the required decomposition. Assume henceforth that V≠0 and Φ≠∅. Fix a root α and the sl2-triple (eα,fα,hα) of [L1]; restricting the representation to this three-dimensional subalgebra makes V a nonzero finite-dimensional sl2-module, so by [L2] the operator ρ(hα) is diagonalisable.

1.2A1L4

The coroots span h over C by [L4] and the root set Φ is finite, so there are roots α1,…,αN with h=span⁡C{hα1,…,hαN}.

2.1A1L2L3step 1.1

Every H∈h is a linear combination H=∑i=1Ncihαi; the operators ρ(hα1),…,ρ(hαN) are diagonalisable by step 1.1 and commute pairwise because h is abelian and ρ preserves brackets, so by [L3] they are simultaneously diagonalisable, and in a common eigenbasis every ρ(H) is diagonal, hence diagonalisable.

3.1A1L3step 2.1

The family {ρ(H):H∈h} consists of pairwise commuting diagonalisable endomorphisms by step 2.1, so [L3] provides a basis v1,…,vn of V and functionals μ1,…,μn∈h∗ with ρ(H)vj=μj(H)vj for all H∈h and all j.

4.1A1step 3.1

A basis vector vj spans a nonzero weight space Vμj (Weight and weight space), while a vector v∈Vμ has ρ(H)v=μ(H)v for all H and is therefore a linear combination of the basis vectors vj with μj=μ; hence each Vμ is the span of those vj with μj=μ, distinct weights have disjoint sets of basis vectors, and V=⨁μVμ, with only finitely many nonzero summands.

5.1step 4.1∎

The stated direct-sum decomposition and finiteness of the list of weights are proved.

Depends on

Used by

Dependency tree · two levels

49 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