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 Weyl group, Borel subgroups and chambers
Statement
Assume the Axiom of Choice inherited from the named suppliers. Let be a split reductive group over with root datum (Roots and root groups of a split reductive group). Then: (a) is a finite constant group scheme and for every field ; (b) every split maximal torus of lies in a Borel subgroup, and every Borel subgroup of containing is of the form for a regular cocharacter , hence is split; (c) acts simply transitively on the finite set of Borel subgroups of containing , and the map sending a Borel subgroup to its system of positive roots is a bijection onto the set of positive systems; (d) there is a canonical isomorphism of finite groups, and is generated by the simple reflections , , for any base ; (e) for a Borel subgroup , for and a representative , the double coset depends only on and for all roots .
Facts & Assumptions
Given: AC, a split reductive group with root datum and Weyl group .
The root-subgroup theorem supplies the reduced root datum, generation of by and its root groups, , the -rational representatives of root reflections, and acting on the root groups. For a Borel with positive system , ordered multiplication is a -equivariant variety isomorphism; its smooth -stable subgroups are products of the root groups they contain, and their weight sets are exactly the quasi-closed subsets of (Root subgroups of a split reductive group, clauses (b)-(f), Roots and root groups of a split reductive group).
For a split reductive pair over , the groups for regular cocharacters of are Borel subgroups containing , and induces a bijection from Weyl chambers onto these Borel subgroups; their Lie algebra is (Borel subgroups and the opposition of root groups). This is a statement over ; no Borel conjugacy theorem over is being assumed.
The abstract root datum has finite reflection group, generated by the simple reflections of any base and acting simply transitively on its chambers (Combinatorics of a reduced root datum).
Over an algebraically closed field, centralizers of tori in a reductive group are smooth connected reductive, and for a maximal torus (Chevalley's centralizer theorem and reductive centralizers). We apply this interface after extension to an algebraic closure.
For reductive , the cocharacter-limit theorem gives smooth connected unipotent , a group-scheme isomorphism , the Lie weight descriptions, and (Cocharacter limit subgroups). For regular , pass to an algebraic closure: contains , has Lie algebra , and is connected as a torus centralizer by [F4]. Thus by dimension there, and this equality descends to .
Proof
The normalizer quotient is finite étale by the structural root Definition. Its action on is faithful: after algebraic closure, a normalizer element acting trivially on the character lattice centralizes , and then lies in by [F4]. The exact root-subgroup theorem F1 identifies its geometric group with the reflection group, and F1 supplies a -rational normalizer representative for every root reflection. Products of these representatives therefore realize every geometric element of over . A finite étale scheme all of whose geometric points are rational is a disjoint union of copies of , so is constant. This proves constantness from the actual representatives, rather than from torsor lifting alone.
Let be any split maximal torus. Then is a split reductive pair, and there is an integral regular cocharacter : outside finitely many rational hyperplanes in choose a rational point and clear denominators. If there are no roots, the weight decomposition gives , hence by smoothness and connectedness, and it is its own Borel. Otherwise [F2], applied to , makes a Borel over containing . For every Borel , [F2] gives for a regular -cocharacter , and [F5] gives with .
For a field extension , constantness in step 1.1 identifies with the same finite group as . Every element therefore has a -rational normalizer representative, constructed in step 1.1 as a product of the root-reflection representatives supplied by F1. Base change of this representative gives a point of mapping to the specified element of . Two such points have the same image precisely when their quotient lies in , since the scheme-theoretic kernel is . Thus the quotient map induces the bijection , completing (a).
By F1, the faithful action of on is precisely the group generated by the root reflections, canonically . The root combinatorics [F3] show that the simple reflections for any base generate it. This proves(d) directly from the supplier, without a backward reference to a later step or an unrelated claim about generating .
To prove splitness, put for . In the ordered root coordinates of [F1], let be the product of the root groups with , for integers . This root subset is quasi-closed, since every root with has weight . Thus [F1] makes each a smooth connected -stable subgroup, with and for large . For roots , every root coordinate of the commutator is a polynomial in , is homogeneous for the -weights, and vanishes when either variable is zero. Each nonzero monomial therefore has and weight . Conjugating a root generator of by a root generator of therefore keeps it in , as does inverse conjugation, proving normality under ; preserves the weight subsets. Applying the same argument to , the root-generator commutators vanish modulo this normal subgroup, so . Thus is normal in . Root coordinates of weight exactly induce : ordering those factors first gives a variety product with , and collecting root factors modulo adds those coordinates, since their commutators have greater weight. The coordinate projection is a surjective group morphism with kernel . Refining these vector-group quotients by coordinate subspaces yields a normal series with quotients; the split torus quotient yields quotients. Hence is split as a solvable group. Together with step 1.2 this proves (b).
The opposition theorem [F2] identifies Borels containing with the sign chambers of regular cocharacters, equivalently with positive root systems. Conjugation by a normalizer representative permutes root groups by [F1], hence transports these sign systems by its lattice action. Under the canonical identification in step2.2, [F3] gives the simple transitivity of that action and the bijection onto positive systems. This proves(c).
For (e), changing a representative by an element of preserves . Conjugation by carries to , and its conjugate root group is smooth, connected and -stable. The root-group containment criterion of F1, applied to that conjugate group and , gives containment; both groups have dimension one, so they are equal. Thus scheme-theoretically. This proves (e).
Depends on
Used by
- The root datum of a split reductive group Definition
- 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
- Primitive vectors from standard maximal parabolics Lemma
- Root coordinate cells and generation 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
49 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)