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.
Combinatorics of a reduced root datum
Statement
Let be a reduced root datum (Abstract root data and their Weyl groups). Then: (a) is finite and generated by the reflections , ; for a base it is generated by the simple reflections , ; (b) the correspondences between bases, positive systems and Weyl chambers are bijective, and acts simply transitively on the set of Weyl chambers, equivalently on the set of bases; (c) for a chosen positive system there is a unique longest element with , and for every the integer equals the length of with respect to the simple reflections, with and ; (d) spans iff the root datum is semisimple, and then is a reduced root system in in the Euclidean sense.
Facts & Assumptions
Given: A reduced root datum , the -vector space spanned by the roots, and its image under a chosen base and positive system.
Root data, reflections, bases, positive systems, chambers, the Weyl group and reducedness are as in Abstract root data and their Weyl groups, with (rd1) and (rd2) , .
For a reduced crystallographic root system : the Weyl group is finite and faithful on (The Weyl group is finite and faithful); simple roots form a basis and every root is an integral combination with coefficients of one sign (Simple roots form a signed integral basis); the chambers are the connected components of the complement of the root hyperplanes and permutes them (Open and closed Weyl chambers); the Weyl group acts simply transitively on chambers (Simple transitivity on Weyl chambers).
In a reduced crystallographic root system the inversion number of an element equals its length as a word in simple reflections, and there is a unique longest element with (Length and longest Weyl-group element, Weyl length equals inversion number).
Proof
Since by (rd1), every is nonzero, and is finite and spans by construction; each preserves , acts on by , fixes the hyperplane and sends to . Restricting the coroots to gives functionals with and , so satisfies the root-system axioms with coroots ; reducedness of the root datum is exactly the reducedness of this root system. Since is finite by (rd3) and acts on the finite-dimensional real vector space , averaging an arbitrary inner product over produces an invariant inner product. For an invariant inner product the relation holds for all , and the right side is independent of the choice of invariant inner product; hence is the orthogonal reflection with vector of the Euclidean theory, and the image of in is precisely the Weyl group of the reduced crystallographic root system in the sense of Weyl group.
The natural map is surjective because the reflections generating the latter are restrictions of the generators of . For injectivity let restrict to the identity on . Each reflection acts as the identity on , where , since its difference from the identity has image in the root line. Consequently sends into and vanishes on , so . The finite group gives for some positive integer ; the binomial identity then forces over . Thus and . This also transfers finiteness, faithful action on the roots, and generation by the simple reflections of any base.
By the identification of step 2.1, [F2] transfers verbatim: the simple roots of a base form a basis, every root is an integral combination of with coefficients of one sign, the Weyl chambers are the connected components of the complement of the hyperplanes , and acts simply transitively on them. To compare with the chambers in the full character space, average an inner product on over the finite group . Its orthogonal decomposition is . Each reflection fixes pointwise: its difference from the identity lies in , while invariance of the form keeps that difference in . Thus every coroot functional vanishes there, and the full chambers are products of the root-span chambers with . The transferred action is therefore simply transitive also on the full chambers. Moreover the sign conditions defining positive systems and the indecomposability defining simple roots are the same in the two languages, so bases, positive systems and chambers correspond bijectively, and simple transitivity on chambers is equivalent to simple transitivity on bases.
By [F3] applied to there is a unique longest element with , and for every the inversion number equals the length in simple reflections. Further , because length is the minimum word length and whenever is minimal. Finally . For put ; this is a bijection of . The condition says , equivalently . These are precisely the complement of the positive roots whose image under is negative. Therefore the required count is . If the root datum is semisimple, then has finite index in , so and is a reduced root system in in the Euclidean sense by step 1.1; conversely if spans then the finitely generated subgroup has full rank, hence finite index, in , so the root datum is semisimple.
Depends on
Used by
- The Lie algebra and root system do not determine the root datum Counterexample
- The root datum of a split reductive group Definition
- Weights, dominant weights and the highest-weight order of a rational representation Definition
- 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
- Root coordinate cells and generation Lemma
- Standard Levi subgroups of a split reductive group Lemma
- Modules generated by a primitive vector Proposition
- Parabolic subgroups and Levi decomposition Theorem
- Root subgroups of a split reductive group Theorem
- Simple rational representations have a unique highest weight Theorem
- The Weyl group, Borel subgroups and chambers Theorem
Dependency tree · two levels
13 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)
- Brian Conrad, Reductive Group Schemes (SGA 3 summer school, Luminy; Panoramas et Syntheses) (standard reference, not scraped)