Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-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.

The additive Jordan–Chevalley supplier

Remark

The operator theorem used by the Jordan-decomposition items on this page is Over a perfect field, every endomorphism has a unique commuting semisimple-plus-nilpotent decomposition, polynomial in the endomorphism: over a perfect field every endomorphism T of a finite-dimensional vector space has a unique commuting semisimple-plus-nilpotent decomposition T=Ts+Tn, and both parts are polynomials in T. Its published contract assumes the Axiom of Choice (The Axiom of Choice); every use of it below inherits that assumption, and the items that use it declare the dependence explicitly.

On this page the theorem is applied only in the following special case: the field is C, which is perfect, and T=adx for an element x of a finite-dimensional complex Lie algebra g. The theorem then produces adx=S+N with S semisimple, N nilpotent, SN=NS, and both S and N polynomials in adx. No further operator theory is imported: the passage from these operator parts to elements of g is the content of Jordan–Chevalley parts agree under the adjoint representation and Jordan decomposition lies inside a complex semisimple Lie algebra.

The cited theorem is published with the Axiom of Choice in its statement but without The Axiom of Choice in its published dependency list. That metadata defect is recorded for the canonical published-defect ledger; it does not block this page, because the assumption is declared here and propagated through every consumer.

Depends on

Used by

Dependency tree · two levels

11 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