Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Bruhat double cosets from rank-one multiplication

Statement

Assume the Axiom of Choice. Let G be the connected simply connected complex semisimple affine algebraic group with maximal torus T, root system Φ, positive system Φ+ and subgroups B=T⋉U, U±, B− fixed in Complex semisimple algebraic group, Borel, and flag variety and Borel, opposite unipotent groups and root coordinates, and let W=NG(T)/T with its reflections sα and representatives nα of Rank-one SL2 homomorphism and Weyl representative. Make the identifications recorded as a proof obligation in the definition: W is identified with the abstract Weyl group W(Φ)=⟨sα⟩ of Weyl group, the class in W of a representative nα is sα, and for w∈W we write nw for a representative and ℓ(w) for the length of Weyl length equals inversion number. For w∈W put Uw=∏α∈Φ+∩wΦ−Uα. Then:

(i) G is the disjoint union of the double cosets BnwB for w∈W;

(ii) for every w∈W the multiplication morphism Uw×B⟶BnwB,(u,b)⟼u nw b, is an isomorphism of varieties onto BnwB; and

(iii) Uw≅Aℓ(w) and dim⁡Uw=ℓ(w); and

(iv) the normalizer group scheme NG(T) is the disjoint union of the cosets nwT, and its fppf sheaf quotient by T is the constant finite group scheme W(Φ).

The choice of representative nw does not change BnwB: replacing nw by nwt with t∈T does not change the double coset.

Facts & Assumptions

Given: the connected smooth affine group G over C, its torus T, root system Φ, positive system Φ+, root subgroups Uβ, and B=T⋉U.

[F1]

Multiplication U−×T×U→G is an open immersion onto the dense open Ω=U−B, and U−×B→Ω is an isomorphism. (The opposite-root big cell is an open chart)

[F2]

Each uβ:Ga→Uβ is a closed algebraic-group isomorphism with uβ(z)=exp⁡G(zeβ); the root subgroup depends only on its one-dimensional root space. (Algebraic root subgroups from root exponentials)

[F3]

The products of positive and negative root subgroups in height-compatible orders are polynomial coordinate isomorphisms onto U and U−; T acts on each root coordinate by the nontrivial character β, and B=T⋉U. (Borel, opposite unipotent groups and root coordinates)

[F4]

The rank-one morphism φα:SL2→G identifies the two standard unipotent groups with U±α and maps w=(0−110) to nα∈NG(T), whose action on roots is sα. (Rank-one SL2 homomorphism and Weyl representative)

[F5]

For each simple α, Pα=⟨B,U−α⟩=B⊔BnαB is a subgroup; its two-cell decomposition and the SL2 root coordinates hold scheme-theoretically. (Minimal parabolic from one negative simple root)

[F6]

The abstract finite Weyl group acts simply transitively on Weyl chambers, and every root reflection is conjugate to a simple reflection. (Simple transitivity on Weyl chambers)

[F7]

ℓ(w)=∣Φ+∩wΦ−∣, and every Weyl element has a word in simple reflections. (Weyl length equals inversion number)

[F8]

Exponentials commute with homomorphisms of finite-dimensional real Lie groups. (Exponential map is natural for Lie-group homomorphisms)

Proof

1.1F2F8given

Conjugation preserves root subgroups in the needed algebraic sense. If n∈NG(T)(C) acts on characters by σ, then Ad⁡(n)gβ=gσβ by the defining root-space eigenvalue equation. The target is one-dimensional; hence Ad⁡(n)eβ=ceσβ for some c≠0. Apply exponential naturality [F8] to the conjugation automorphism Cn and the explicit curves [F2]: nuβ(z)n−1=uσβ(cz) for every z∈C. Thus nUβn−1=Uσβ as closed subgroup schemes: both morphisms are algebraic and agree on the reduced affine line's C-points. This use of exponentials is within the present characteristic-zero complex-group scope.

2.1F1F3step 1.1

If n∈NG(T)(C) preserves Φ+, then n normalizes U, U− and B by step 1.1 and [F3]. The open subsets Ω=U−B and Ωn=U−nB of the irreducible G meet by [F1]. At an intersection write u1−b1=u2−nb2; rearranging puts n=(u2−)−1u1−b1b2−1∈Ω. Write its unique big-cell coordinates as n=u−tu and put ns=σ(s)n for s∈T. The big-cell coordinates of ns=u−(ts)(s−1us) and σ(s)n=(σ(s)u−σ(s)−1)(σ(s)t)u have middle factors ts and σ(s)t. Uniqueness gives σ(s)=s for every s, so n centralizes T. Comparing the outer coordinates again gives s−1us=u and su−s−1=u− for every s∈T. In the polynomial root coordinates [F3], conjugation by s scales the coordinate indexed by β by β(s); since no root character is trivial, all coordinates vanish. Hence u=u−=1 and n=t∈T. In particular CG(T)(C)=T(C) and B(C)∩NG(T)(C)=T(C): the latter follows also directly by comparing the unique T⋉U coordinates of bs and σ(s)b.

3.1F4F6step 2.1

Every n∈NG(T)(C) permutes the root set by step 1.1 and carries Φ+ to a positive system. By simple transitivity [F6], there is a unique abstract w∈W(Φ) carrying Φ+ to this system. Choose a simple-reflection word for w and multiply its rank-one representatives [F4] to obtain nw with the same action on roots. Then nw−1n preserves Φ+ and lies in T by step 2.1. Conversely the nα realize the simple reflections, so the map NG(T)(C)/T(C)→W(Φ) is surjective and injective, and different words for w differ by T. This proves the identification promised in the statement without assuming Coxeter relations for the representatives.

4.1F1F3step 3.1construct

The scheme-theoretic quotient has the same finite set of components. Because G is affine of finite type and T closed, the condition gTg−1⊆T is closed in g: choose finite generators for the ideal of T in O(G), pull each through conjugation G×T→G, and set to zero its finitely many coefficients in O(T); impose the analogous equations for g−1Tg⊆T. Their intersection represents the normalizer functor N=NG(T) as a closed finite-type subgroup scheme. Differentiating the normalizing condition at the identity gives the inclusion Lie⁡N⊆{X∈g:[X,h]⊆h}. The root decomposition makes the set on the right equal to h, while T⊆N gives the reverse inclusion h⊆Lie⁡N, so dim⁡T=dim⁡Lie⁡N; since T⊆N is smooth of this dimension, the local ring of N at the identity is regular, and group translations make N smooth and reduced everywhere. By step 3.1 the closed cosets nwT exhaust N(C) and are pairwise disjoint. A reduced finite-type C-scheme is Jacobson, so its closed points are dense in every nonempty locally closed subset; the finite union of those closed cosets therefore equals N as a scheme, and each coset is open as well as closed. On each component the quotient map nwT→Spec⁡C is the trivial right T-torsor. These components glue to a Zariski-locally trivial T-torsor N→∐w∈W(Φ)Spec⁡C, and the displayed target represents the fppf sheaf quotient N/T. Multiplication agrees with W(Φ) on closed points, hence between the finite reduced constant schemes, proving (iv).

4.2F3F4step 1.1step 3.1

With the Weyl representatives established in step 3.1, fix a simple root α, write s=sα, and let U′′ be the subgroup generated by Uβ for β∈Φ+∖{α}. The root-coordinate and height-raising commutator law of [F3] gives U=U′′Uα: in a height-compatible order the simple α factor can be moved to the far right, because swapping it past another positive-root factor changes only factors at strictly larger heights, never a new α factor. Step 1.1 and the root-system fact that s permutes Φ+∖{α} show nαU′′nα−1=U′′. Consequently, after absorbing torus and U′′ factors into the left B, one has nαBnw⊆B U−α nαnw for every w.

5.1F4step 1.1step 4.2

The product in step 4.2 occupies at most two cells, with a direct rank-one calculation. Take nsw=nαnw, permissible by step 3.1. If w−1α>0, then nsw−1U−αnsw=Uw−1α⊆B by step 1.1, so BU−αnsw⊆BnswB. If w−1α<0, the zero parameter is in BnswB. For z≠0, direct multiplication in SL2 gives (10z1)w=(−z−1−10−z)(10−z−11); applying φα, the first matrix lies in B, while nw−1U−αnw=U−w−1α⊆B, so u−α(z)nαnw∈BnwB. Therefore nαBnw⊆BnwB∪BnswB in both cases. This is Milne's two-cell inclusion, proved here from the displayed matrix identity and root coordinates.

6.1F1F3F4F5F6step 1.1step 5.1

Let X=⋃w∈W(Φ)BnwB. It contains B, is stable under left B and right B, and is stable under left U−α for each simple α: the minimal-parabolic two-cell equality [F5] places U−α inside B∪BnαB, and step 5.1 controls BnαBnwB. The subgroup H generated by B and the simple negative-root groups contains each nα, by the standard three-unipotent factorization of w in SL2 through [F4]. Every root is a Weyl translate of a simple root by [F6], so conjugation by products of the nα and step 1.1 put every positive and negative root group in H. Thus Ω=U−B⊆H by [F1] and [F3]. Every left coset of H contains an open translate of Ω, so every coset is open; connectedness of G forces a single coset and H=G. Since X contains 1 and is stable under the generators of H, X=G. This proves coverage without asserting that an abstract generated subgroup is closed.

7.1F3step 1.1step 6.1

For each w in the covering of step 6.1, put Iw=Φ+∩wΦ−, Jw=Φ+∩wΦ+. Both sets are closed under root addition: if β,γ are in either set and β+γ is a root, its image under w−1 has the same strict sign as the images of β,γ. The corresponding sums nIw=⨁β∈Iwgβ and nJw=⨁β∈Jwgβ are Lie subalgebras, and the finite polynomial exponential/logarithm construction of [F3] makes their images Uw and Uw closed root-coordinate subgroups. In height-graded Lie coordinates, BCH⁡(X,Y)=X+Y plus brackets of strictly greater height. Given Z∈n+, solve Z=BCH⁡(X,Y) recursively by height with X∈nIw and Y∈nJw: in each root coordinate exactly one of X,Y occurs linearly, while every bracket term uses already solved lower heights. The recursion is polynomial over C and gives a polynomial inverse to multiplication Uw×Uw→U on every test algebra, hence a scheme isomorphism. By step 1.1, nw−1Uwnw⊆U, and so BnwB=UnwB=UwnwB.

8.1F1step 7.1

The parameter map Uw×B→G, (u,b)↦unwb, is an isomorphism onto its image as a locally closed subscheme. Indeed, Vw−=nw−1Uwnw is a closed root-coordinate subgroup of U− because w−1Iw⊆Φ−; left translation by nw−1 identifies the map with the restriction of the big-cell isomorphism U−×B→∼Ω of [F1] to the closed subscheme Vw−×B. Its image is therefore closed in the open nwΩ, and step 7.1 identifies its underlying set with BnwB. This proves (ii), including a regular inverse, rather than inferring an isomorphism from an injective differential.

9.1F3step 2.1step 3.1step 6.1step 8.1

The cells are disjoint. The chart in step 8.1 descends to Uw→∼BnwB/B because its second factor is the right B action. The point nwB is fixed by T. In this chart the left T action on unwB sends u to tut−1, since nw−1tnw∈T⊂B. By [F3] every root coordinate of Uw has a nontrivial T weight, so 1 is its unique T-fixed C-point. If nw′B were in the w cell, it would be fixed by T and hence equal nwB; then nw−1nw′∈B∩NG(T)=T by step 2.1, giving w=w′ by step 3.1. Any nonempty intersection of two double cosets contains a representative of each, so they are pairwise disjoint. Combined with step 6.1 this proves (i).

10.1F1F2F3F4F7F8step 7.1step 9.1discharge-construct∎

With the disjoint decomposition of step 9.1 established, [F7] gives ∣Iw∣=ℓ(w−1)=ℓ(w), and the closed root-coordinate subgroup Uw in step 7.1 is a product of ∣Iw∣ copies of Ga as a variety. Hence Uw≅Aℓ(w) and dim⁡Uw=ℓ(w), proving (iii). The Axiom of Choice is assumed and declared through The Axiom of Choice; its exact uses here are inherited from the exponential-naturalness supplier [F8], the root-factorization and big-cell suppliers [F1]–[F3], and the rank-one supplier [F4]. The finite Weyl representatives and the finite root orders require only finite choices.

Depends on

Used by

Dependency tree · two levels

50 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