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.

Split reductive groups

Definition

A split reductive group over k is a pair (G,T) consisting of a reductive algebraic group G over k (Radical, unipotent radical, semisimple and reductive algebraic groups) and a maximal torus T⊆G that is split, i.e. isomorphic over k to Gmr for some r (Groups of multiplicative type and tori, Borel subgroups, maximal tori and Borel pairs).

The following supplemental existence and field-invariance facts assume the Axiom of Choice (The Axiom of Choice) through their cited suppliers. Since maximal tori exist, any torus lies in one, and maximality is preserved by field extension (Maximal tori, field extensions, normal subgroups and derived groups), the rank dim⁡T and the semisimple rank rk⁡(G/R(G)) are well defined. A homomorphism of split reductive groups (G,T)→(G′,T′) is a homomorphism of algebraic groups carrying T into T′. Because G is affine of finite type, the adjoint representation Ad⁡:G→GL⁡g (The adjoint representation of an affine group scheme, The Lie bracket from infinitesimals and the adjoint action) restricts to a rational representation of T on g=Lie⁡(G), to which the eigenspace decomposition of diagonalizable groups applies (Representations of diagonalizable groups split into character eigenspaces). We write X=X(T), X∨=X∗(T) for the lattices of Character and cocharacter lattices of a split torus. Every reductive group splits over a finite separable extension of the base field; the split hypothesis is kept throughout.

Under this same assumption, the rank of (G,T) is the common dimension of its maximal tori and the semisimple rank is the rank of the semisimple quotient G/R(G); both are additive invariants of the pair. The split hypothesis is exactly the requirement that the geometric character lattice X∗(T)=Hom⁡ks(Tks,Gm) have trivial Gal⁡(ks/k)-action; it is always a free Z-module of finite rank, and X(T)=X∗(T)Gal⁡(ks/k). The equivalence with splitting is Multiplicative type groups and Galois character modules, which is why the root datum of (G,T) is defined over k rather than only over a finite extension. A homomorphism of split reductive groups need not carry T isomorphically onto T′; the induced map on character lattices is then only a homomorphism. An isogeny carrying T onto T′ induces an injective character-lattice map with finite cokernel, by the split character anti-equivalence (Split diagonalizable groups are dual to abelian groups); it need not induce an isomorphism even if the two groups have the same abstract root datum. For example, the isogeny t↦tp of Gm in characteristic p induces multiplication by p on its character lattice Z.

Depends on

Used by

Dependency tree · two levels

56 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