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 be a finite-dimensional complex semisimple Lie algebra and let .
(i) If is an abstract Jordan decomposition of , then the additive Jordan–Chevalley parts of are and .
(ii) Conversely, if is the additive Jordan–Chevalley decomposition of , then there are unique with and . They satisfy , , with semisimple and nilpotent; consequently is an abstract Jordan decomposition of , and it is the only one.
Facts & Assumptions
Given: The Axiom of Choice, a finite-dimensional complex semisimple Lie algebra , and an element .
The Axiom of Choice is the principle of The Axiom of Choice; it is used in this lemma only through [L1].
Every endomorphism of a finite-dimensional vector space over a perfect field has a unique commuting semisimple-plus-nilpotent decomposition , and are polynomials in (Over a perfect field, every endomorphism has a unique commuting semisimple-plus-nilpotent decomposition, polynomial in the endomorphism).
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).
A finite-dimensional semisimple complex Lie algebra is centerless and perfect, so is injective (Semisimple Lie algebras are centerless and perfect).
An abstract Jordan decomposition of is a decomposition with , semisimple and nilpotent (Abstract Jordan decomposition).
Proof
Suppose is an abstract Jordan decomposition. Then by linearity of , the two summands commute because , 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 . This proves (i).
Now let be the additive Jordan–Chevalley decomposition of the derivation ; by [L1] there are polynomials with and . We show that is a derivation and that acts on the generalized eigenspace of for as multiplication by . The generalized eigenspaces satisfy and : the second claim follows from the binomial expansion . Each is invariant under , hence under . On the operator equals plus a commuting nilpotent operator, so there; since is semisimple and restricts semisimply to the invariant subspace , this forces . On the other hand is a difference of two commuting nilpotent operators on , hence nilpotent; comparing with the scalar operator gives . Therefore , and for , one has because . Thus is a derivation; is a derivation by the Jacobi identity, so is a derivation too.
By [L2] there are unique with and . Then , so by injectivity of [L3]; also , so by [L3]; and is semisimple while is nilpotent. Hence is an abstract Jordan decomposition by [L4].
If is any abstract Jordan decomposition, then is a commuting semisimple-plus-nilpotent decomposition of by step 1.1's computation, so uniqueness in [L1] gives and ; injectivity of [L3] gives and . Hence the decomposition of (ii) is unique. If then 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter II (standard reference, not scraped)