Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 (G,T) be a split reductive group over k with root datum (X,Φ,α↦α∨) (Roots and root groups of a split reductive group). Then: (a) W(G,T)=NG(T)/T is a finite constant group scheme and W(G,T)(k′)=NG(T)(k′)/T(k′) for every field k′⊇k; (b) every split maximal torus of G lies in a Borel subgroup, and every Borel subgroup of G containing T is of the form PG(λ) for a regular cocharacter λ, hence is split; (c) W(G,T) acts simply transitively on the finite set of Borel subgroups of G containing T, 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 W(G,T)≅W(R) of finite groups, and W(G,T) is generated by the simple reflections sα, α∈Δ, for any base Δ; (e) for a Borel subgroup B⊇T, for w∈W(G,T) and a representative nw∈NG(T)(k), the double coset BnwB depends only on w and nwUαnw−1=Uwα for all roots α.

Facts & Assumptions

Given: AC, a split reductive group (G,T) with root datum (X,Φ,α↦α∨) and Weyl group W(G,T)=NG(T)/T.

[F1]

The root-subgroup theorem supplies the reduced root datum, generation of G by T and its root groups, Uα≅Ga, the k-rational representatives nα of root reflections, and W(G,T)=⟨sα⟩ acting on the root groups. For a Borel B⊇T with positive system Φ+, ordered multiplication ∏α∈Φ+Uα→Ru(B) is a T-equivariant variety isomorphism; its smooth T-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).

[F2]

For a split reductive pair (G,T) over k, the groups PG(λ) for regular cocharacters λ of T are Borel subgroups containing T, and λ↦PG(λ) induces a bijection from Weyl chambers onto these Borel subgroups; their Lie algebra is t⊕⨁⟨α,λ⟩>0gα (Borel subgroups and the opposition of root groups). This is a statement over k; no Borel conjugacy theorem over k is being assumed.

[F3]

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).

[F4]

Over an algebraically closed field, centralizers of tori in a reductive group are smooth connected reductive, and CG(T)=T for a maximal torus (Chevalley's centralizer theorem and reductive centralizers). We apply this interface after extension to an algebraic closure.

[F5]

For reductive G, the cocharacter-limit theorem gives smooth connected unipotent UG(λ), a group-scheme isomorphism PG(λ)=UG(λ)⋊ZG(λ), the Lie weight descriptions, and Ru(PG(λ))=UG(λ) (Cocharacter limit subgroups). For regular λ, pass to an algebraic closure: ZG(λ) contains T, has Lie algebra t, and is connected as a torus centralizer by [F4]. Thus ZG(λ)=T by dimension there, and this equality descends to k.

Proof

1.1F1F4given

The normalizer quotient W=NG(T)/T is finite étale by the structural root Definition. Its action on X(T) is faithful: after algebraic closure, a normalizer element acting trivially on the character lattice centralizes T, and then lies in CG(T)=T by [F4]. The exact root-subgroup theorem F1 identifies its geometric group with the reflection group, and F1 supplies a k-rational normalizer representative for every root reflection. Products of these representatives therefore realize every geometric element of W over k. A finite étale scheme all of whose geometric points are rational is a disjoint union of copies of Spec⁡k, so W is constant. This proves constantness from the actual representatives, rather than from torsor lifting alone.

1.2F1F2F5givenalgebra

Let T′ be any split maximal torus. Then (G,T′) is a split reductive pair, and there is an integral regular cocharacter λ′: outside finitely many rational hyperplanes in X∗(T′)⊗R choose a rational point and clear denominators. If there are no roots, the weight decomposition gives Lie⁡G=Lie⁡T′, hence G=T′ by smoothness and connectedness, and it is its own Borel. Otherwise [F2], applied to (G,T′), makes PG(λ′) a Borel over k containing T′. For every Borel B⊇T, [F2] gives B=PG(λ) for a regular k-cocharacter λ, and [F5] gives B=U⋊T with U=Ru(B).

2.1F1step 1.1given

For a field extension k′/k, constantness in step 1.1 identifies W(k′) with the same finite group as W(k). Every element therefore has a k-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 NG(T)(k′) mapping to the specified element of W(k′). Two such points have the same image precisely when their quotient lies in T(k′), since the scheme-theoretic kernel is T. Thus the quotient map induces the bijection NG(T)(k′)/T(k′)=W(k′), completing (a).

2.2F1F3F4step 1.1

By F1, the faithful action of W on X(T) is precisely the group generated by the root reflections, canonically W(R). 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 G.

2.3F1F5step 1.2algebraconstruct

To prove splitness, put mα=⟨α,λ⟩>0 for α∈Φ+(B). In the ordered root coordinates of [F1], let Ur be the product of the root groups with mα≥r, for integers r≥1. This root subset is quasi-closed, since every root iα+jβ with i,j>0 has weight imα+jmβ≥r. Thus [F1] makes each Ur a smooth connected T-stable subgroup, with U1=U and Ur=1 for large r. For roots α,β∈Φ+, every root coordinate of the commutator [uα(x),uβ(y)] is a polynomial in x,y, is homogeneous for the λ-weights, and vanishes when either variable is zero. Each nonzero monomial xayb therefore has a,b≥1 and weight amα+bmβ≥mα+mβ. Conjugating a root generator of Ur by a root generator of U therefore keeps it in Ur, as does inverse conjugation, proving normality under U; T preserves the weight subsets. Applying the same argument to Ur+1, the root-generator commutators vanish modulo this normal subgroup, so [U,Ur]⊆Ur+1. Thus Ur is normal in B=U⋊T. Root coordinates of weight exactly r induce Ur/Ur+1≅∏mα=rGa: ordering those factors first gives a variety product with Ur+1, and collecting root factors modulo Ur+1 adds those coordinates, since their commutators have greater weight. The coordinate projection is a surjective group morphism with kernel Ur+1. Refining these vector-group quotients by coordinate subspaces yields a normal series with Ga quotients; the split torus quotient B/U=T≅Gmdim⁡T yields Gm quotients. Hence B is split as a solvable group. Together with step 1.2 this proves (b).

3.1F1F2F3step 2.2

The opposition theorem [F2] identifies Borels containing T 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).

4.1F1step 2.1step 3.1step 1.2step 2.3∎

For (e), changing a representative nw by an element of T(k)⊆B(k) preserves BnwB. Conjugation by nw carries gα to gwα, and its conjugate root group is smooth, connected and T-stable. The root-group containment criterion of F1, applied to that conjugate group and Uwα, gives containment; both groups have dimension one, so they are equal. Thus nwUαnw−1=Uwα scheme-theoretically. This proves (e).

Depends on

Used by

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