Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Centralizer of a regular semisimple element is Cartan

Statement

Let g be a finite-dimensional complex semisimple Lie algebra and let xg be regular semisimple (Regular element and rank). Then gx=ker(adx) is a Cartan subalgebra of g in the sense of Cartan subalgebra.

Facts & Assumptions

Given: Such a Lie algebra g and a regular semisimple element xg; write m=dimgx=rank(g).

[L1]

Regularity of x means dimker(ady)m for every yg (Regular element and rank).

[L2]

Semisimplicity of x means that adx is semisimple, and then g is the direct sum of its eigenspaces and g=ker(adx)im(adx) (Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms). Also ad[u,v]=[adu,adv] (Derivations form a Lie algebra and inner derivations an ideal).

[L3]

A Cartan subalgebra is a nilpotent subalgebra equal to its normalizer (Cartan subalgebra, Normalizer of a Lie subalgebra).

[L4]

A finite-dimensional Lie algebra on which every adjoint operator is nilpotent is nilpotent (Engel's theorem).

[L5]

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

Proof

technique · direct
1.1

gx is a Lie subalgebra: for y,zgx, Jacobi and [L5] give [x,[y,z]]=[[x,y],z]+[y,[x,z]]=0.

L2L5algebra
1.2

gx equals its normalizer. Let yNg(gx). Since xgx, we have [y,x]gx, so [x,[y,x]]=0. Decompose y=λyλ in the eigenspaces of the semisimple operator adx [L2]. Then [x,y]=λλyλ and [x,[y,x]]=λλ2yλ=0; the summands lie in distinct eigenspaces, so λ2yλ=0, and since the field is C we get yλ=0 for λ0. Hence y=y0gx, so Ng(gx)=gx.

L2L5algebra
1.3

Every zgx acts by zero on gx. Since [x,z]=0, the operators A=adx and B=adz commute [L2], and A is semisimple [L2], so g=λVλ with Vλ=ker(Aλ) and each Vλ is B-invariant. For tC put Mt=A+tB=adx+tz. For t0 an element v=λvλ with vλVλ is killed by Mt exactly when λvλ+tBvλ=0 for every λ, so dimkerMt=dimker(BV0)+λ0mλ(t), where mλ(t)=dimker(B+λt)Vλ is the multiplicity of the eigenvalue λt of the endomorphism BVλ and therefore vanishes for all but finitely many t. Choosing t outside this finite exceptional set and using [L1] at the element x+tz gives dimker(BV0)=dimkerMtm=dimV0, hence ker(BV0)=V0 and BV0=0; by definition V0=gx.

L1L2L5algebra
2.1

Since zgx was arbitrary, step 1.3 shows that adzgx=0 for every zgx, so gx is abelian and in particular nilpotent; alternatively, every adjoint operator of gx is nilpotent on gx and [L4] applies. By step 1.2, gx equals its normalizer, so [L3] makes gx a Cartan subalgebra. When g=0 we have x=0, gx=0, and the zero subalgebra is a Cartan subalgebra of the zero algebra; no nonempty choice occurs.

L3L4step 1.2step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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