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

Borel subgroups and the opposition of root groups

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let (G,T) be a split reductive group over k and let α∈Φ(G,T). Every Borel subgroup B of G containing T contains exactly one of the two root groups Uα, U−α, and B∩Gα is a Borel subgroup of Gα; exactly two Borel subgroups of Gα contain T, namely UαT and U−αT. Moreover, for a cocharacter λ of T that is regular (⟨α,λ⟩≠0 for all roots α), PG(λ) is the unique Borel subgroup of G containing T with Lie⁡PG(λ)=t⊕⨁⟨α,λ⟩>0gα, and λ↦PG(λ) induces a bijection from the set of Weyl chambers onto the set of Borel subgroups containing T.

Facts & Assumptions

Given: AC, a split reductive group (G,T) over k and a root α∈Φ(G,T).

[F1]

Gα is split reductive of semisimple rank 1 with roots ±α and root groups U±α≅Ga, and UαT, U−αT are its two Borel subgroups containing T; a Borel B⊇T contains Uα iff its Lie algebra contains gα (Root subgroups of a split reductive group, Classification of split reductive groups of semisimple rank one).

[F2]

For a cocharacter λ, the groups ZG(λ), PG(λ) and UG(λ) are smooth; ZG(λ) is connected for reductive G, UG(λ) is connected unipotent, and PG(λ)=UG(λ)⋊ZG(λ) with Lie⁡PG(λ)=⨁n≥0gn (Cocharacter limit subgroups). If λ is regular, the zero-weight part is t, so ZG(λ)=T (Milne, Proposition 21.29).

[F3]

Over an algebraically closed field, for a torus S⊆B, the intersection CG(S)∩B is a Borel subgroup of CG(S) (Milne, paragraph 17.72). Borel subgroups containing a fixed maximal torus are conjugate by its normalizer (Conjugacy of Borel subgroups and of maximal tori over an algebraically closed field; Milne, Proposition 17.11). The torus T and the root groups for the positive weights of a regular cocharacter generate PG(λ) (Milne, Proposition 21.29); this use does not require an all-characteristics closed-weight-set criterion.

Proof

1.1F1F3givenalgebra

Work first over an algebraic closure. Put S=Tα and Gα=CG(S). Since S⊆T⊆B, the centralizer-intersection theorem [F3] says that B∩Gα is a Borel subgroup of Gα containing T. The rank-one classification [F1] says that it is therefore exactly UαT or U−αT, which proves that B contains exactly one of the two root groups. The two rank-one Borels and the intersection are defined over k, so these equalities descend to k; the same argument applies to geometric Borels containing the split torus.

2.1F1F2F3step 1.1algebra

Let λ be regular. By [F2], ZG(λ) contains T, is smooth connected and has Lie algebra t, hence equals T by dimension. Thus P=PG(λ)=UG(λ)⋊T is smooth connected solvable. Over an algebraic closure it lies in a Borel B containing T. Its Lie algebra is t⊕⨁⟨α,λ⟩>0gα. By step 1.1 and the root-group containment criterion [F1], the Lie algebra of B contains exactly one of each opposite pair of root spaces. It already contains the indicated positive ones, so Lie⁡B=Lie⁡P. The inclusion P⊆B of smooth connected groups of equal dimension implies P=B. If B′ contains T with this same Lie algebra, the containment criterion puts every positive root group in B′; by [F3] these root groups and T generate P, so P⊆B′ and equality follows again by dimension. These equalities descend to k, proving the claimed Borel and uniqueness assertions.

3.1F2F3step 2.1algebra∎

The Lie algebra in step 2.1 determines precisely the signs of ⟨α,λ⟩, so two regular cocharacters give the same Borel exactly when they lie in the same Weyl chamber. Each chamber contains an integral cocharacter because its defining strict inequalities have integral coefficients. For surjectivity, fix such a λ and let B be any geometric Borel containing T. Normalizer conjugacy [F3] gives B=nPG(λ)n−1 for some n∈NG(T) over the algebraic closure. Conjugation of the limit definition gives nPG(λ)n−1=PG(nλn−1). The cocharacter nλn−1 belongs to the lattice of the split torus T, so is defined over k. Consequently every such Borel equals PG(μ) for a k-cocharacter μ, and descent proves the asserted bijection over k.

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