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 x∈g.

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

(ii) Conversely, if ad⁡x=S+N is the additive Jordan–Chevalley decomposition of ad⁡x, then there are unique ys,yn∈g with S=ad⁡ys and N=ad⁡yn. They satisfy ys+yn=x, [ys,yn]=0, with ad⁡ys semisimple and ad⁡yn 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 x∈g.

[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, ad⁡xs semisimple and ad⁡xn nilpotent (Abstract Jordan decomposition).

Proof

technique · direct
1.1A1L1L4algebra

Suppose x=xs+xn is an abstract Jordan decomposition. Then ad⁡x=ad⁡xs+ad⁡xn by linearity of ad⁡, the two summands commute because [ad⁡xs,ad⁡xn]=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 ad⁡x. This proves (i).

1.2A1L1algebra

Now let ad⁡x=S+N be the additive Jordan–Chevalley decomposition of the derivation T=ad⁡x; by [L1] there are polynomials p,q∈C[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 S∣gλ=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 S∣gλ=λ⋅1, and for y∈gλ, z∈gμ 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=T−S is a derivation too.

2.1L2L3L4step 1.2

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

3.1A1L1L3step 1.13.1∎

If x=u+v is any abstract Jordan decomposition, then ad⁡u,ad⁡v is a commuting semisimple-plus-nilpotent decomposition of ad⁡x by step 1.1's computation, so uniqueness in [L1] gives ad⁡u=S=ad⁡ys and ad⁡v=N=ad⁡yn; 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].

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