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.

Radical, unipotent radical, semisimple and reductive algebraic groups

Definition

Let k be a field and let G be a smooth connected affine algebraic group of finite type over k (Group schemes of finite type over a field). Its radical R(G) is the largest smooth connected normal solvable closed subgroup scheme, and its unipotent radical Ru(G) is the largest smooth connected normal unipotent closed subgroup scheme (The derived subgroup, the derived series and solvable algebraic groups, Unipotent algebraic groups and unipotent representations). These are subgroup varieties: arbitrary infinitesimal normal subgroups are not included in the maximization. One has Ru(G)⊆R(G), because unipotent groups are solvable.

The group is semisimple if R(Gka)=1, and reductive if Ru(Gka)=1. The smoothness, connectedness and affineness requirements are part of these terms. Over a perfect field, and in particular an algebraically closed field, reductivity is equivalent to Ru(G)=1. Over an imperfect field the condition Ru(G)=1 alone is weaker; such a smooth connected affine group is called pseudo-reductive, and pseudo-reductivity does not imply reductivity.

Assume the Axiom of Choice for the following field-extension and rank assertions and their cited geometric suppliers (The Axiom of Choice). Formation of both radicals commutes with separable algebraic field extensions (Milne Propositions 19.1 and 19.9). Consequently, if k is perfect, Ru(G)ka=Ru(Gka) and the analogous equality holds for R(G). These equalities are not asserted for general purely inseparable extensions. The geometric definition of reductivity is retained precisely to handle that distinction.

The rank of G is the dimension of a maximal torus (Borel subgroups, maximal tori and Borel pairs), and its semisimple rank here is the rank of the smooth connected affine quotient G/R(G). Maximal tori exist, remain maximal under field extension, and are geometrically conjugate, so their dimensions are independent of the choice. If k is perfect, G/R(G) is semisimple; this also holds over every field when G is reductive, because then R(G) is the largest central torus and commutes with every base extension (Centre, radical and semisimple quotient of a reductive group ↗). No assertion that G/R(G) is geometrically semisimple for every nonreductive G over an imperfect field is made.

The largest-subgroup property gives uniqueness. Existence follows by taking products of smooth connected normal subgroups with the relevant property: such products are again smooth connected normal, and remain solvable, respectively unipotent; a strict increase of a connected subgroup variety increases dimension, so a finite product attains the maximum dimension and contains every such subgroup. Over an algebraically closed field the radical is also the reduced identity component of the intersection of all Borel subgroups, as proved in Solvable subgroups, the radical, and the Borel intersection ↗. All representation-theoretic statements below concern affine groups, so the rational-representation/comodule dictionary applies (Rational representations and comodules of an affine group scheme).

Depends on

Used by

Dependency tree · two levels

28 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