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.

Existence of Cartan subalgebras

Statement

Assume the Axiom of Choice. Every finite-dimensional complex semisimple Lie algebra has a Cartan subalgebra (Cartan subalgebra). Indeed every maximal toral subalgebra (Toral and maximal toral subalgebras) of such an algebra is a Cartan subalgebra.

Facts & Assumptions

Given: The Axiom of Choice and a finite-dimensional complex semisimple Lie algebra g with Killing form B.

[A1]

The Axiom of Choice is The Axiom of Choice; it is inherited through [L1] and [L9].

[L1]

Under AC, every element xg has an abstract Jordan decomposition x=xs+xn, and adxs, adxn are the additive Jordan–Chevalley parts of adx (Jordan decomposition lies inside a complex semisimple Lie algebra).

[L2]

A finite-dimensional Lie algebra is nilpotent if and only if all its adjoint operators are nilpotent (Engel's theorem), and a nilpotent Lie algebra is solvable (Nilpotent Lie algebras are solvable).

[L3]

Over an algebraically closed field of characteristic zero, a finite-dimensional solvable Lie algebra has a common eigenvector in every nonzero finite-dimensional module, by Lie's theorem (Lie's theorem).

[L4]

A pairwise commuting family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable, so a sum of commuting semisimple endomorphisms is semisimple (A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise).

[L5]

The Killing form B(x,y)=tr(adxady) is symmetric and invariant: B([z,x],y)+B(x,[z,y])=0; it is nondegenerate because g is semisimple (Killing form, Trace forms are symmetric and invariant, Cartan's semisimplicity criterion).

[L6]

The algebra is centerless and perfect: Z(g)=0 and [g,g]=g (Semisimple Lie algebras are centerless and perfect); semisimplicity means vanishing of the radical (Simple, semisimple, and reductive Lie algebras); and ad[u,v]=[adu,adv] (Derivations form a Lie algebra and inner derivations an ideal).

[L7]

A toral subalgebra is an abelian subalgebra all of whose adjoint operators are semisimple, and it is maximal toral when maximal by inclusion (Toral and maximal toral subalgebras); a Cartan subalgebra is nilpotent and equal to its normalizer (Cartan subalgebra, Normalizer of a Lie subalgebra).

[L8]

adx(y)=[x,y] (Derivations of Lie algebras).

[L9]

Under AC, the additive Jordan–Chevalley parts of an endomorphism of a finite-dimensional vector space over a perfect field are polynomials in that endomorphism (Over a perfect field, every endomorphism has a unique commuting semisimple-plus-nilpotent decomposition, polynomial in the endomorphism).

Proof

technique · maximal toral subalgebra and Killing-form counting
1.1

If g=0, the zero subalgebra is nilpotent and equals its own normalizer, hence is a Cartan subalgebra. Assume now g0. There is a nonzero semisimple element: if every element of g had nilpotent adjoint operator, then [L2] would make g nilpotent, hence solvable, so its radical would be g0, contradicting semisimplicity [L6]. Choose an element x whose adjoint operator is not nilpotent and let x=xs+xn be its decomposition from [L1]; if xs=0 then adx=adxn is nilpotent, contrary to the choice of x, so xs0 is semisimple.

L1L2L6algebra
2.1

A toral subalgebra of maximal dimension exists and is maximal by inclusion. Let t be any maximal toral subalgebra; it is nonzero since the zero subalgebra is contained in Cxs from step 1.1. By [L7] the subalgebra t is abelian, so the operators adh, ht, are pairwise commuting, and each is semisimple by [L7]; hence by [L4] and [L8] they are simultaneously diagonalisable and g=λtgλ,gλ={xg:[h,x]=λ(h)x for all ht}. Put l=g0=Cg(t).

L4L7L8step 1.1algebra
3.1

For xl the Jordan parts lie in l: by [L1] and [L9] there is a polynomial p with adxs=p(adx), and [adx,adh]=ad[x,h]=0 for ht [L6, L8], so [adxs,adh]=0 and therefore ad[xs,h]=0, that is, [xs,h]Z(g)=0; thus xsl, and xn=xxsl as well. Moreover t+Cxs is toral: it is a subalgebra because [xs,t]=0, it is abelian, and each of its elements has semisimple adjoint operator by [L4] since adxs and the commuting operators adh are semisimple. By the maximality of t we get xst.

A1L1L4L6L7L8L9step 2.1algebra
3.2

Invariance of B gives (λ(h)+μ(h))B(y,z)=B([h,y],z)+B(y,[h,z])=0 for ygλ, zgμ and ht; if λ+μ0 some h has (λ+μ)(h)0, so B(gλ,gμ)=0.

L5L8step 2.1algebra
4.1

For xl we have adl(x)=adl(xn), because xst centralises l; by [L1] the operator adxn is nilpotent, so every adjoint operator of l is nilpotent on l and [L2] makes l nilpotent.

L1L2step 3.1algebra
5.1

The algebra l is abelian. It is nilpotent by step 4.1, hence solvable, so [L3] supplies a common eigenvector in the nonzero module g. Its line is invariant. Apply [L3] to the quotient by that line and then to successive nonzero quotients; the dimension drops at each step, and lifting the resulting invariant flag gives a basis of g in which all adx, xl, are upper triangular. For x[l,l] the operator adx is a sum of commutators of upper triangular operators, hence strictly upper triangular, hence nilpotent; consequently B(x,y)=tr(adxady)=0 for every yl, since a strictly upper triangular operator times an upper triangular operator stays strictly upper triangular.

L2L3L5step 4.1algebra
6.1

The restriction Bl is nondegenerate: if xl satisfies B(x,l)=0, then for every nonzero weight λ we have B(x,gλ)=0 by step 3.2, and B(x,l)=0 by hypothesis, so B(x,g)=0 and [L5] gives x=0. Applying this to step 5.1 yields [l,l]=0.

L5step 5.1step 3.2algebra
7.1

Every element of l is semisimple: for xl we have xnl by step 3.1, and [xn,y]=[x,y][xs,y]=0 for every yl because xl and xst; hence adxn commutes with ady and the product adxnady is nilpotent, so B(xn,y)=0 for all yl. Nondegeneracy from step 6.1 forces xn=0. Thus l is abelian and consists of semisimple elements, i.e. l is toral; since tl, maximality gives l=t.

L1L5step 3.1step 6.1algebra
8.1

Finally Ng(t)=t: if xNg(t) and x=λxλ is its decomposition from step 2.1, then for every ht we have [h,x]=λλ(h)xλt=g0. Uniqueness of the direct weight-space decomposition forces every nonzero-weight component λ(h)xλ of this sum to vanish. For each λ0, choose ht with λ(h)0; then xλ=0. Therefore xg0=l=t. Since t is abelian and hence nilpotent and equals its normalizer, [L7] makes it a Cartan subalgebra. The Axiom of Choice was inherited through [L1] and [L9].

A1L1L7L9step 2.1step 7.1algebra

Depends on

Used by

Dependency tree · two levels

50 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