Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 groups and Bruhat cells for SL_2

Example

Assume the Axiom of Choice inherited from the named suppliers. Let k be any field and G=SL2 over k with diagonal torus T2={diag⁡(x,x−1)}, upper triangular Borel B, U+={(1 a0 1)} and U−={(1 0a 1)} (The root datum of a split reductive group, Structure of SL_2 and root coordinates, Bruhat decomposition for a split reductive group). The root datum is X(T2)=Zχ with α=2χ and α∨=χ∨, so ⟨α,α∨⟩=2 and the group is simply connected; the root groups are U±α=U±, nα=(0 1−1 0) represents sα, tuα(a)t−1=uα(α(t)a), and sl2=t⊕gα⊕g−α with dim⁡g±α=1. The Weyl group is W={1,sα}≅Z/2; the Bruhat decomposition is G=B⊔BnαB with BnαB=U+nαB the open Bruhat cell, parametrized by U+×B≅A1×Gm×A1; separately U−T2U+ is the open Gaussian cell; on k-points SL2(k)=B(k)⊔B(k)nαB(k), while G/B≅P1 with G(k) acting through PGL2(k). The cell B has dimension 2 and the open Bruhat cell has dimension 3; the unique longest element w0=sα gives this dense open cell, and the opposite Borel is B−=U−T.

Facts & Assumptions

Given: AC, a field k and G=SL2 with its diagonal torus T2, Borel B=U+T2 and root groups U±.

[F1]

The root coordinates of SL2: X(T2)=Zχ, Φ={±2χ}, α∨=χ∨, nα=uα(1)u−α(−1)uα(1) represents sα, and the conjugation identities hold (Structure of SL_2 and root coordinates, The root datum of a split reductive group).

[F2]

Bruhat decomposition: for a split reductive group, G=⨆w∈WBnwB, the multiplication Uw×B→BnwB is an isomorphism, the big cell is open dense with U−×T×U→G an open immersion, and the flag-cell dimensions are n(w) while group cells have dimension dim⁡B+n(w) (Bruhat decomposition for a split reductive group, Root subgroups of a split reductive group).

[F3]

Homogeneous curves and Aut⁡(P1)=PGL2: the quotient of SL2 by the Borel subgroup is a smooth complete geometrically connected homogeneous curve with the rational base point B, hence P1, with the action of G through PGL2 (Homogeneous curves and automorphisms of P^1, The root datum of a split reductive group).

Verification

1.1F1givenalgebra

The root datum and root coordinates are those of [F1]: Φ={±2χ} with coroot χ∨ and ⟨α,α∨⟩=2, so the root datum is the simply connected rank-one datum; the root groups are U±α=U±, and the Lie algebra decomposes as sl2=t⊕gα⊕g−α with one-dimensional root spaces. The Weyl group is W=NG(T2)/T2={1,sα}≅Z/2 because SL2 has exactly two Borel subgroups containing T2, namely B and U−T2=B−.

2.1F1F2step 1.1algebra

Write g=(abcd) with ad−bc=1. The cell B is defined by c=0 and has dimension 2. If c≠0, then g=uα(a/c)nαdiag⁡(−c,−c−1)uα(d/c) by multiplication. Thus BnαB=U+nαB is exactly c≠0, parametrized uniquely by U+×T2×U+ and of dimension 3. This proves the two-cell decomposition over k and on k-points. The Gaussian cell U−T2U+ is instead a≠0, as follows from g=u−α(c/a)diag⁡(a,a−1)uα(b/a); its multiplication map is also an open immersion, but its image differs from BnαB.

3.1F2F3step 2.1algebra∎

Finally G/B≅P1 by [F3], since the quotient of the connected nonsolvable group SL2 by the Borel subgroup is a homogeneous curve; the cell decomposition of G/B is {B}⊔Y(sα) with Y(sα)=Uw0B/B≅An(w0)=A1, so the two Bruhat cells of the flag variety correspond to the two T2-fixed points of P1; the action of G(k) factors through PGL2(k)=Aut⁡(P1)(k).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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