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

Toral and maximal toral subalgebras

Definition

Let g be a finite-dimensional complex Lie algebra. A Lie subalgebra tg (Lie subalgebras, ideals, and center) is toral if it is abelian and adx is a semisimple endomorphism of g for every xt, semisimplicity being understood in the sense of Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms (Derivations of Lie algebras supplies the notation adx(y)=[x,y]). Because t is abelian, adxt is the zero endomorphism of t and is therefore semisimple automatically: the requirement must be placed on g itself, and requiring only that adxt be semisimple would merely repeat abelianness.

The coordinates on g are irrelevant to this notion: the choice of an algebraic closure in Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms makes semisimplicity of an endomorphism a basis-free property, and restricting a semisimple endomorphism to an invariant subspace is again semisimple. A toral subalgebra is maximal toral if it is maximal by inclusion among toral subalgebras of g.

Depends on

Used by

Dependency tree · two levels

13 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