Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Roots and root groups of a split reductive group

Definition

Let (G,T) be a split reductive group over k (Split reductive groups). The roots Φ(G,T) are the nontrivial characters α∈X(T) for which the adjoint weight space gα in g=Lie⁡G is nonzero. The adjoint action is rational, and the weight decomposition g=g0⊕⨁α∈Φ(G,T)gα is the choice-free decomposition into character eigenspaces (Representations of diagonalizable groups split into character eigenspaces, The adjoint representation of an affine group scheme). This nonzero-weight definition uses no choice principle.

Assume the Axiom of Choice for the following supplemental structural facts and subgroup constructions (The Axiom of Choice). The reductive centralizer identity CG(T)=T and Lie fixed-point equality give g0=Lie⁡T=Cg(T) (Chevalley's centralizer theorem and reductive centralizers, The Lie functor: exactness, fixed points and generation). For α∈Φ, put Tα=(ker⁡α)t=(ker⁡α)red∘, the maximal reduced subtorus of its kernel, of codimension one in T, and Gα=CG(Tα). The root group is Uα=H(α)⊆Gα, attached to the semigroup of strictly positive rational multiples of α in X(T); it is smooth connected unipotent and T-stable with Lie algebra ⨁β∈(α)∩Φgβ. Its identity-concentrator construction takes place in Gα, not in all of G (Weight subgroups of a torus action, Cocharacter limit subgroups).

The Weyl group is W(G,T)=NG(T)/T. Under the stated AC premise it is a finite étale group scheme and acts faithfully on X(T) (Milne21.1 and21.12). A Borel subgroup B⊇T determines the positive roots Φ+(B)={α∈Φ:gα⊆Lie⁡B} and negative roots −Φ+(B) (Borel subgroups, maximal tori and Borel pairs, Character and cocharacter lattices of a split torus). Root groups are independent of the auxiliary cocharacter because (α) is intrinsic and its smooth connected subgroup is characterized by its specified Lie weight subspace. Two Borels containing T give the same positive roots exactly when they are equal (Milne21.23 and21.35). These structural facts inherit the explicit AC premise; the definition of a root as a nonzero adjoint character above remains choice-free.

Depends on

Used by

Dependency tree · two levels

72 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