Alphabeta Math
LemmaStatement: 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.

Root coordinate cells and generation

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let (G,T) be a split reductive group with Borel B⊇T, base Δ and U=Bu (Roots and root groups of a split reductive group). (a) G is generated by T and the subgroups Gα for α∈Δ, hence by T and the U±α with α∈Δ; if G is semisimple it is generated by the Uα, α∈Φ. (b) For w∈W(G,T) let Uw (resp. Uw) be the subgroup generated by the Uα with α∈Φ+∩w(Φ+) (resp. α∈Φ+∩w(Φ−)). These subgroups are smooth, connected and T-stable, equal to the products of their root groups in any order; the multiplication map Uw×Uw→U is an isomorphism; and Uα⊆Uw iff α∈Φ+∩wΦ+, while Uα⊆Uw iff α∈Φ+∩wΦ−. (c) The isotropy group of wB/B in U equals Uw, the orbit map Uw→UwB/B is an isomorphism, and dim⁡(UwB/B)=n(w)=∣Φ+∩wΦ−∣.

Facts & Assumptions

Given: AC, a split reductive group (G,T) with Borel B⊇T, base Δ, U=Bu, and an element w∈W(G,T).

[F1]

G is generated by T and the root groups; W⋅Δ=Φ, nwUαnw−1=Uwα, and W(G,T)≅W(R) with simple reflections generating W (The Weyl group, Borel subgroups and chambers, Root subgroups of a split reductive group, Combinatorics of a reduced root datum).

[F2]

Products of root groups: for a Borel B with positive system Φ+, the multiplication map ∏α∈Φ+Uα→U is a T-equivariant isomorphism for any ordering; every smooth T-stable subgroup of U is the product of the Uα it contains, and the weight set of such a subgroup is quasi-closed; ordinary root closure is sufficient in every characteristic and is necessary in characteristic 0 or p>3 (Root subgroups of a split reductive group).

[F3]

The Lie functor detects generation for smooth connected groups, and containment of a root group is equivalent to containment of its Lie algebra for smooth T-stable subgroups (The Lie functor: exactness, fixed points and generation, Root subgroups of a split reductive group, The Axiom of Choice).

[F4]

For K=U∩nwBnw−1, the Lie intersection is ⨁α∈Φ+∩wΦ+gα. The reduced geometric identity subgroup of a T-stable subgroup of U is the product of the root groups it contains, as in the ordered-root-coordinate theorem. The smooth limit subgroup UG(λ) has positive Lie weights, and its points are precisely those contracted to 1 by λ. (Root subgroups of a split reductive group, Cocharacter limit subgroups) These are the precise inputs for the intersection and orbit argument of Milne, Propositions 21.77–21.79; arbitrary smooth T-stable intersections need not be smooth.

Proof

1.1F1F3givenalgebra

Let H be the subgroup generated by T and the Gα for α∈Δ. Each Gα contains its two root groups and a representative of sα, by the rank-one results in [F1]. As the simple reflections generate W, products of these representatives in H represent every w∈W. Conjugation by them and W⋅Δ=Φ show that H contains every root group. It therefore equals G by [F1]. Each Gα is generated by T and its two root groups, so this also proves generation by T and the simple positive and negative root groups. If G is semisimple, let K be generated by all root groups. The standard SL2 root-group generation in each rank-one derived subgroup puts every coroot image in K. The coroots span X∗(T)⊗Q for semisimple G, so these images generate T. Thus K=G. If Δ is empty, G=T and the first assertion still holds; a semisimple group with empty root system is trivial.

2.1F2step 1.1algebra

The subgroups Uw and Uw are smooth connected T-stable by [F2], being generated by root groups with weight sets Φ+∩wΦ+ and Φ+∩wΦ− respectively; these two subsets of Φ+ are disjoint and their union is Φ+ (a positive root is either in wΦ+ or in wΦ−), and each is ordinarily closed: a positive root sum of members remains positive and its inverse image under w retains the same positive or negative sign. Ordinary closure is sufficient by [F2], so each is the weight set of a smooth T-stable subgroup of U and the product decomposition of U from [F2] gives a T-equivariant isomorphism Uw×Uw→U. The membership criterion for root groups follows because Uα⊆Uw iff the weight α belongs to the weight set of Uw (uniqueness of the smooth subgroup with a given weight semigroup in [F2]). This proves (b).

3.1F1F2F4step 2.1algebra∎

The stabilizer of nwB in U is K=U∩nwBnw−1. Work geometrically and take Kred∘, which is smooth connected over the algebraically closed field. By the root-subgroup containment criterion its root groups are exactly those with α∈Φ+∩wΦ+, since its Lie algebra is contained in the Lie intersection of [F4], and all these shared root groups lie in K. The ordered-coordinate theorem therefore identifies Kred∘ with Uw. Its dimension is the dimension of Lie⁡K, so K is regular at the identity and translation makes it smooth. To identify all components, choose a regular cocharacter λ with nwBnw−1=PG(λ). Every root coordinate of U has nonzero λ-weight. An element of U∩PG(λ) has a limit under conjugation, so its negative coordinates vanish and the positive coordinates tend to zero. Thus its limit is 1, and it lies in UG(λ). This also contracts K to 1, showing its components all meet the identity component, hence K is connected. Therefore K=Uw, and the equality descends to k. Order the complementary root groups first: Uw×Uw≃U identifies the fppf quotient U/Uw with Uw, since right multiplication by Uw changes only the second factor. The homogeneous orbit map identifies this quotient with UnwB/B, and its dimension is dim⁡Uw=n(w).

Depends on

Used by

Dependency tree · two levels

46 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