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.

The simple-reflection double-coset rule and the Tits system

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let (G,T) be a split reductive group over k, B⊇T a Borel subgroup, Δ the corresponding base and W=NG(T)/T (The root datum of a split reductive group). For a simple root α∈Δ with image sα∈W and any w∈W one has the Tits inclusions sαB(k)w⊆B(k)wB(k)∪B(k)sαwB(k). Equivalently, the quadruple (G(k),B(k),NG(T)(k),S) with S={sα:α∈Δ} is a Tits system (BN-pair) in the abstract group G(k): (T1) G(k) is generated by B(k) and N(k) and B(k)∩N(k)=T(k) is normal in N(k); (T2) the elements of S are involutions generating W(k)=N(k)/T(k); (T3) sB(k)w⊆B(k)wB(k)∪B(k)swB(k) for all s∈S, w∈W; (T4) sB(k)s⊈B(k) for s∈S. In particular B(k)sαB(k)∪B(k)=B(k)∪B(k)sαB(k).

Facts & Assumptions

Given: AC, a split reductive group (G,T) with Borel B⊇T, base Δ, S={sα:α∈Δ} and W=NG(T)/T.

[F1]

The independent geometric cellular input is Milne21.70–21.73 and21.79: G/B is the disjoint union of U-orbits at the Weyl fixed points, and their root-coordinate sections give G=⨆wUwnwB with each multiplication Uw×B a k-scheme isomorphism onto its cell. These source results are proved from Bialynicki-Birula cells and root coordinates before the Tits-system proposition21.75, and give the full arbitrary-field point decomposition. Weyl representatives and conjugation of root groups are supplied by The Weyl group, Borel subgroups and chambers, and all ordered positive root-coordinate products by Root subgroups of a split reductive group and Root coordinate cells and generation.

[F2]

The two Borel subgroups of Gα containing T are UαT and U−αT, and the rank-one group satisfies Gα=Bα⊔BαnαBα with Bα=UαT; hence every element of U−α(k)∖{1} lies in Bα(k)nαBα(k) (Borel subgroups and the opposition of root groups, Structure of SL_2 and root coordinates).

[F3]

The Weyl group acts simply transitively on the Borels containing T, and W is a finite group generated by the involutions sα, α∈Δ (The Weyl group, Borel subgroups and chambers, The root datum of a split reductive group).

Proof

1.1F1F3

The independent source-cell isomorphisms of [F1] give G(k)=⨆wUw(k)nwB(k), so G(k) is generated by B(k) and N(k). This is a point statement obtained from scheme isomorphisms defined over k, not from algebraic generation alone. The Weyl action on Borels is free by [F3], so B(k)∩N(k)=T(k); this subgroup is normal in N(k) by the normalizer definition. Thus(T1) holds. The field-point quotient description of [F3] identifies N(k)/T(k) with W, generated by its simple reflections of order two, proving(T2).

1.2F1F3

Fix a simple root α, write s=sα and choose ns. A simple reflection permutes Φ+∖{α}. Order those root groups first and Uα last in the coordinates of B from [F1]; conjugating their first factors by ns keeps them in B, while Uα becomes U−α. Consequently it suffices for(T3) to show U−α(k)nsnw⊆B(k)nwB(k)∪B(k)nsnwB(k). If w−1α is positive, conjugating root groups gives U−αnsnw=nsnwUw−1α, so this set lies in the second double coset.

2.1F1F2step 1.2

If w−1α is negative, the identity element of U−α gives the second double coset. For a nonidentity element u, the explicit rank-one factorization [F2] gives u∈Bα(k)nsBα(k), where Bα=TUα. Hence unsnw∈B(k)nsBα(k)nsnw⊆B(k)U−α(k)nw=B(k)nwU−w−1α(k)⊆B(k)nwB(k). Here nsBαns−1=TU−α and ns2∈T, and the final root is positive. These algebraic formulas hold over every field, including small finite fields and characteristic two. This proves(T3) in both sign cases.

3.1F2F3step 1.1step 2.1∎

The negative root parameter u−α(1) is not in B: for a regular dominant cocharacter with B=PG(λ), its orbit parameter is t−⟨α,λ⟩ and has no limit at zero. Thus nsBns−1 is not contained in B, proving(T4). The four axioms yield the full Tits system with the claimed inclusion, and the displayed union with B(k) at the end of the Statement is the same union with its two summands written in the opposite order. No substantive assertion is derived from that tautological equality.

Depends on

Used by

Dependency tree · two levels

31 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