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

Root datum of a compact connected Lie group

Definition

Assume the Axiom of Choice. A reduced compact root datum is a quadruple (X,Φ,X∨,Φ∨) in which:

  1. X and X∨ are finite free abelian groups of the same rank, equipped with a perfect Z-bilinear pairing ⟨⋅,⋅⟩:X×X∨→Z;
  2. Φ⊆X and Φ∨⊆X∨ are finite subsets with a fixed bijection Φ→Φ∨, α↦α∨, such that ⟨α,α∨⟩=2 for every root;
  3. the paired reflections sα(x)=x−⟨x,α∨⟩α,sα∨(y)=y−⟨α,y⟩α∨ preserve Φ and Φ∨ and are compatible: if sα(β)=γ then sα∨(β∨)=γ∨;
  4. Φ is reduced: if α,cα∈Φ for c∈Z, then c=±1 (equivalently, no root is a nontrivial integral multiple of another).

For a compact connected Lie group G with maximal torus T, the root datum of (G,T) is (X,Φ,X∨,Φ∨)=(X∗(T), Φ(G,T), X∗(T), Φ∨), where X∗(T) and X∗(T) are the character and cocharacter lattices (Character and cocharacter lattices), Φ(G,T) is the root system of the pair (Roots of a compact connected Lie group), and Φ∨={α∨} consists of the cocharacters supplied by the compact root SU(2) subgroups, so that ⟨α,α∨⟩=2 (Analytic and root-system Weyl groups agree). The pairing is the perfect character–cocharacter pairing of the definition above; the reflections are preserved by the identification of the root Weyl group with W(G,T).

Central torus directions are retained: the roots vanish on Z(G)0 and do not span X when the centre is positive-dimensional, and the datum records the central character lattice as part of X rather than discarding it.

Remarks

  • Two root data are isomorphic when there are isomorphisms of X and X∨ preserving the pairings and the root and coroot sets; identifying the source of the isomorphism is the exact sense in which the classification by root data holds on this page.
  • The reflection formula in (3) is the abstract form of the geometric reflection sα(λ)=λ−⟨λ,α∨⟩α of the root systems page, written additively for the lattice X.
  • The definition of a root datum here is deliberately symmetric in X and X∨; the perfect pairing is data, not a consequence of the axioms.
  • Empty root and coroot sets are allowed. In particular, a torus has root datum (X,∅,X∨,∅); the root-indexed conditions above are then vacuous.

Depends on

Used by

Dependency tree · two levels

39 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