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.
Abstract root data and their Weyl groups
Definition
A root datum is a quadruple consisting of free -modules of finite rank in perfect duality , finite subsets and , and a bijection from to , subject to (rd1) for all ; (rd2) the reflections and satisfy and ; (rd3) the group generated by the acting on is finite. The root datum is reduced if for every . The group is the Weyl group, the root system and the coroot system; acts dually on by the , and fixes the hyperplane . For , the Weyl chambers are the connected components of , and a base is a linearly independent subset such that every root is a -combination of with all coefficients of one sign. A root datum is semisimple if has finite index in .
The reflection depends only on the pair : it fixes the hyperplane , sends to by (rd1), and is determined by those two conditions on the rational direct sum . The lattice form above is related to the Euclidean root-system theory of Weyl group and Positive systems and simple roots through a -invariant form on , but no choice of invariant inner product belongs to the definition. The perfect character–cocharacter pairing for a split torus is supplied by Character and cocharacter lattices of a split torus; roots and coroots are additional data, not supplied by that lattice lemma.
An isomorphism of root data is a pair of -linear isomorphisms and that are transpose to one another, for all , , and that carry bijectively onto with for every . Composites of isomorphisms are isomorphisms, with the evident inverses, so root data form a category whose isomorphisms are these pairs; this is the notion of isomorphism used when separating the root data of SL_2 and PGL_2.
Depends on
Used by
- The root datum of a split reductive group Definition
- Combinatorics of a reduced root datum 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
- Root subgroups of a split reductive group Theorem
Dependency tree · two levels
9 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)
- Florian Herzig, Linear Algebraic Groups (University of Toronto lecture notes, 2013) (standard reference, not scraped)
- Brian Conrad, Reductive Group Schemes (SGA 3 summer school, Luminy; Panoramas et Syntheses) (standard reference, not scraped)