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

Jordan–Chevalley parts agree under the adjoint representation

Statement

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra and let xg.

(i) If x=xs+xn is an abstract Jordan decomposition of x, then the additive Jordan–Chevalley parts of adx are adxs and adxn.

(ii) Conversely, if adx=S+N is the additive Jordan–Chevalley decomposition of adx, then there are unique ys,yng with S=adys and N=adyn. They satisfy ys+yn=x, [ys,yn]=0, with adys semisimple and adyn nilpotent; consequently x=ys+yn is an abstract Jordan decomposition of x, and it is the only one.

Facts & Assumptions

Given: The Axiom of Choice, a finite-dimensional complex semisimple Lie algebra g, and an element xg.

[A1]

The Axiom of Choice is the principle of The Axiom of Choice; it is used in this lemma only through [L1].

[L1]

Every endomorphism T of a finite-dimensional vector space over a perfect field has a unique commuting semisimple-plus-nilpotent decomposition T=Ts+Tn, and Ts,Tn are polynomials in T (Over a perfect field, every endomorphism has a unique commuting semisimple-plus-nilpotent decomposition, polynomial in the endomorphism).

[L2]

Every derivation of a finite-dimensional semisimple Lie algebra in characteristic zero is inner, and the representing element is unique (Derivations of semisimple Lie algebras are inner).

[L3]

A finite-dimensional semisimple complex Lie algebra is centerless and perfect, so ad is injective (Semisimple Lie algebras are centerless and perfect).

[L4]

An abstract Jordan decomposition of x is a decomposition x=xs+xn with [xs,xn]=0, adxs semisimple and adxn nilpotent (Abstract Jordan decomposition).

Proof

technique · direct
1.1

Suppose x=xs+xn is an abstract Jordan decomposition. Then adx=adxs+adxn by linearity of ad, the two summands commute because [adxs,adxn]=ad[xs,xn]=0, and by [L4] the first is semisimple while the second is nilpotent. The uniqueness assertion of [L1] therefore identifies them with the additive Jordan–Chevalley parts of adx. This proves (i).

A1L1L4algebra
1.2

Now let adx=S+N be the additive Jordan–Chevalley decomposition of the derivation T=adx; by [L1] there are polynomials p,qC[t] with S=p(T) and N=q(T). We show that S is a derivation and that S acts on the generalized eigenspace of T for λ as multiplication by λ. The generalized eigenspaces gλ={y:(Tλ)ky=0 for some k} satisfy g=λgλ and [gλ,gμ]gλ+μ: the second claim follows from the binomial expansion (Tλμ)n[y,z]=i+j=n(ni)[(Tλ)iy,(Tμ)jz]. Each gλ is invariant under T, hence under p(T)=S. On gλ the operator T equals λ1 plus a commuting nilpotent operator, so p(T)=p(λ)1+(nilpotent) there; since S is semisimple and restricts semisimply to the invariant subspace gλ, this forces Sgλ=p(λ)1. On the other hand Sλ1=(Tλ1)N is a difference of two commuting nilpotent operators on gλ, hence nilpotent; comparing with the scalar operator (p(λ)λ)1 gives p(λ)=λ. Therefore Sgλ=λ1, and for ygλ, zgμ one has S[y,z]=(λ+μ)[y,z]=[λy,z]+[y,μz]=[Sy,z]+[y,Sz] because [y,z]gλ+μ. Thus S is a derivation; T is a derivation by the Jacobi identity, so N=TS is a derivation too.

A1L1algebra
2.1

By [L2] there are unique ys,yng with S=adys and N=adyn. Then adys+yn=S+N=adx, so ys+yn=x by injectivity of ad [L3]; also ad[ys,yn]=[S,N]=0, so [ys,yn]=0 by [L3]; and adys=S is semisimple while adyn=N is nilpotent. Hence x=ys+yn is an abstract Jordan decomposition by [L4].

L2L3L4step 1.2
3.1

If x=u+v is any abstract Jordan decomposition, then adu,adv is a commuting semisimple-plus-nilpotent decomposition of adx by step 1.1's computation, so uniqueness in [L1] gives adu=S=adys and adv=N=adyn; injectivity of ad [L3] gives u=ys and v=yn. Hence the decomposition of (ii) is unique. If g=0 then x=0=ys=yn and every assertion holds with the zero endomorphism, which is both semisimple and nilpotent; no nonempty choice is made anywhere in this argument, the Axiom of Choice being used only through the appeal to [L1].

A1L1L3step 1.13.1

Depends on

Used by

Dependency tree · two levels

20 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