Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 root datum of a split reductive group

Definition

Let (G,T) be a split reductive group over k (Split reductive groups). Its root datum is the quadruple R(G,T)=(X(T),Φ(G,T),X∗(T),Φ∨(G,T)), where the character and cocharacter lattices are those of Character and cocharacter lattices of a split torus, the roots are the nonzero adjoint characters, and Φ∨={α∨:α∈Φ} consists of the associated coroots. Its rank is rank⁡ZX(T)=dim⁡T. For a split Borel pair (B,T), its base Δ(B) consists of roots in Φ+(B) that are not sums of two positive roots; the pair gives the based root datum (R(G,T),Δ(B)).

Assume the Axiom of Choice inherited from the root-group, Weyl and centre suppliers for the following structural assertions (The Axiom of Choice). The coroots supplied by Root subgroups of a split reductive group are in bijection with the roots and satisfy ⟨α,α∨⟩=2. This quadruple is a reduced root datum in the sense of Abstract root data and their Weyl groups, its Weyl group is canonically W(G,T), and Δ(B) is a base whose nonnegative integral combinations recover Φ+(B) (The Weyl group, Borel subgroups and chambers, Combinatorics of a reduced root datum). Its semisimple rank is ∣Δ∣=rank⁡G−dim⁡Z(G), and G is semisimple exactly when ZΦ has finite index in X(T) (Centre, radical and semisimple quotient of a reductive group).

The isomorphism class of the unbased root datum is independent of the split Borel pair, but it is not asserted to have a unique abstract isomorphism: Weyl automorphisms already refute that assertion in type A1. For two fixed split Borel pairs (B,T),(B′,T′), conjugation by g∈G(k) carrying the first pair to the second induces a canonical comparison of their based root data. If g′ is another such element, g−1g′ lies in NG(B)∩NG(T)=B∩NG(T)=T, by Borel self-normality and the Weyl/Borel correspondence. Conjugation by T acts trivially on its character and cocharacter lattices and preserves the root-coroot labels, so the two induced comparisons agree. Thus uniqueness applies to the comparison attached to the fixed based pairs, while the unbased datum is defined up to isomorphism class. (The Weyl group, Borel subgroups and chambers, Cartan subgroups: conjugacy, density and normalizers)

Depends on

Used by

Dependency tree · two levels

59 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