Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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 center is the common kernel of the roots inside the Cartan subalgebra

Statement

Assume the Axiom of Choice. Let h be a Cartan subalgebra of a finite-dimensional complex semisimple Lie algebra g, with root set Φ (Root and root space). Then {H∈h:α(H)=0 for all α∈Φ}=Z(g)∩h=0. In particular the roots span h∗, and the description of the zero common-root-kernel as the center is an equality inside h.

Facts & Assumptions

Given: The Axiom of Choice and such g and h.

[A1]

The Axiom of Choice is The Axiom of Choice; it licenses the structural suppliers [L1] and [L2].

[L1]

g=h⊕⨁α∈Φgα is a direct sum over the root spaces (Root-space decomposition, Roots of a complex semisimple Lie algebra form a reduced crystallographic root system, Root and root space).

Proof

technique · direct
1.1A1L1L2L3algebra

If H∈h has α(H)=0 for every α∈Φ, then [H,gα]=α(H)gα=0 for every root, and [H,h]=0 by [L2]; by [L1] [H,g]=0, so H∈Z(g) and H=0 by [L3].

2.1L1step 1.1algebra∎

Conversely every central element of h is annihilated by all roots, since α(H)=0 is the eigenvalue of ad⁡H on gα and ad⁡H=0 for central H. Hence the common kernel equals Z(g)∩h=0; and because no nonzero H annihilates all roots, the finite set Φ spans h∗.

Depends on

Used by

Dependency tree · two levels

34 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