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 in which:
- and are finite free abelian groups of the same rank, equipped with a perfect -bilinear pairing ;
- and are finite subsets with a fixed bijection , , such that for every root;
- the paired reflections preserve and and are compatible: if then ;
- is reduced: if for , then (equivalently, no root is a nontrivial integral multiple of another).
For a compact connected Lie group with maximal torus , the root datum of is where and are the character and cocharacter lattices (Character and cocharacter lattices), is the root system of the pair (Roots of a compact connected Lie group), and consists of the cocharacters supplied by the compact root subgroups, so that (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 .
Central torus directions are retained: the roots vanish on and do not span when the centre is positive-dimensional, and the datum records the central character lattice as part of rather than discarding it.
Remarks
- Two root data are isomorphic when there are isomorphisms of and 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 of the root systems page, written additively for the lattice .
- The definition of a root datum here is deliberately symmetric in and ; 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 ; 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
- Brian Conrad and Aaron Landesman, Compact Lie Groups (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)