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 root datum of a split reductive group
Definition
Let be a split reductive group over (Split reductive groups). Its root datum is the quadruple where the character and cocharacter lattices are those of Character and cocharacter lattices of a split torus, the roots are the nonzero adjoint characters, and consists of the associated coroots. Its rank is . For a split Borel pair , its base consists of roots in that are not sums of two positive roots; the pair gives the based root datum .
Assume the Axiom of Choice inherited from the root-group, Weyl and centre suppliers for the following structural assertions (The Axiom of Choice). The coroots supplied by Root subgroups of a split reductive group are in bijection with the roots and satisfy . This quadruple is a reduced root datum in the sense of Abstract root data and their Weyl groups, its Weyl group is canonically , and is a base whose nonnegative integral combinations recover (The Weyl group, Borel subgroups and chambers, Combinatorics of a reduced root datum). Its semisimple rank is , and is semisimple exactly when has finite index in (Centre, radical and semisimple quotient of a reductive group).
The isomorphism class of the unbased root datum is independent of the split Borel pair, but it is not asserted to have a unique abstract isomorphism: Weyl automorphisms already refute that assertion in type . For two fixed split Borel pairs , conjugation by carrying the first pair to the second induces a canonical comparison of their based root data. If is another such element, lies in , by Borel self-normality and the Weyl/Borel correspondence. Conjugation by acts trivially on its character and cocharacter lattices and preserves the root-coroot labels, so the two induced comparisons agree. Thus uniqueness applies to the comparison attached to the fixed based pairs, while the unbased datum is defined up to isomorphism class. (The Weyl group, Borel subgroups and chambers, Cartan subgroups: conjugacy, density and normalizers)
Depends on
- Cartan subgroups: conjugacy, density and normalizers
- The Axiom of Choice
- Root subgroups of a split reductive group
- The Weyl group, Borel subgroups and chambers
- Abstract root data and their Weyl groups
- Character and cocharacter lattices of a split torus
- Centre, radical and semisimple quotient of a reductive group
- Combinatorics of a reduced root datum
- Split reductive groups
Used by
- The Lie algebra and root system do not determine the root datum Counterexample
- Root groups and Bruhat cells for SL₂ Example
- Standard parabolics in GLₙ Example
- The simple modules of SL₂ and its fundamental representation Example
- Central characters and descent along a central isogeny Lemma
- Dominant characters of a torus times a split semisimple group are primitive weights Lemma
- Every dominant character of a split reductive group is a highest weight Lemma
- Every dominant weight of a split semisimple group is a primitive weight Lemma
- Multiples of the fundamental weights are primitive weights in the semisimple case Lemma
- Primitive vectors from standard maximal parabolics Lemma
- Standard Levi subgroups of a split reductive group Lemma
- The normalizer of the torus permutes weight spaces Lemma
- The simple-reflection double-coset rule and the Tits system Lemma
- Modules generated by a primitive vector Proposition
- Bruhat decomposition for a split reductive group Theorem
- Parabolic subgroups and Levi decomposition Theorem
Dependency tree · two levels
59 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
- J. S. Milne, Algebraic Groups (corrected 2022 printing, Cambridge University Press) (standard reference, not scraped)