Alphabeta Math
TheoremStatement: 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.

Complete reducibility of rational modules in characteristic zero

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let G be a connected reductive algebraic group over a field k of characteristic 0 (in particular, let G be any split reductive group over such a field). Then the following are equivalent: (a) G is reductive; (b) every finite-dimensional rational representation of G is semisimple; (c) some faithful finite-dimensional rational representation of G is semisimple (Rational representations and comodules of an affine group scheme, Radical, unipotent radical, semisimple and reductive algebraic groups, Simple and semisimple rational representations). In particular G is linearly reductive, so every rational representation is a direct sum of simple representations.

Facts & Assumptions

Given: A connected reductive algebraic group G over a characteristic-zero field k, its unipotent radical U=Ru(G) (Radical, unipotent radical, semisimple and reductive algebraic groups) and its derived subgroup G′=[G,G] (The derived subgroup, the derived series and solvable algebraic groups).

[F1]

A reductive group is the almost product G=Z(G)tG′ of its largest central torus and its semisimple derived group. In characteristic 0, Cartier makes the centre smooth, so Z(G)∘=Z(G)t. (Centre, radical and semisimple quotient of a reductive group, Groups of multiplicative type and tori, Cartier's theorem: affine group schemes in characteristic zero are smooth)

[F3]

Semisimple groups in characteristic zero. Every finite-dimensional rational representation of a semisimple group over a characteristic-zero field is a direct sum of simple subrepresentations (Semisimple groups in characteristic zero are linearly reductive).

[F4]

Faithful representations exist. Every affine group scheme of finite type over a field has a faithful finite-dimensional rational representation (A finitely generated affine group scheme has a faithful finite-dimensional representation).

[F5]

Unipotent fixed vectors. A unipotent affine algebraic group has a nonzero fixed vector in every nonzero rational representation; equivalently, every simple representation of a unipotent group is one-dimensional with trivial action (Unipotent algebraic groups and unipotent representations).

[F7]

Descent of semisimplicity. If a finite-dimensional rational module becomes semisimple after a field extension, it is semisimple over the original field (Semisimplicity of rational representations descends along field extensions).

[F8]

Weights of a split torus. A rational representation of a split torus decomposes as the direct sum of its character weight spaces (Representations of diagonalizable groups split into character eigenspaces).

[F9]

Every finite subset of a rational representation is contained in a finite-dimensional subrepresentation. (Every element of a comodule lies in a finite-dimensional subcomodule)

[A1]

Under AC, every nonempty poset whose chains have upper bounds has a maximal element. (Zorn's lemma)

Proof

technique · direct
1.1F4given

(b)⇒(c). By [F4] there is a faithful finite-dimensional rational representation of G; if (b) holds, that representation is semisimple, so (c) holds.

1.2F5given

(c)⇒(a). Let V be a faithful semisimple finite-dimensional representation and put U=Ru(G), which is unipotent and normal in G. For every simple subrepresentation S⊆V the fixed space SU is nonzero by [F5]; it is a G-subrepresentation because U is normal, so simplicity gives SU=S, that is, U acts trivially on S. Hence U acts trivially on V, and faithfulness forces U=1. Over the perfect field k of characteristic 0, triviality of the unipotent radical is exactly reductivity of G, so (a) holds.

1.3F1F8given

(a)⇒(b), reduce to a split central torus. Extend scalars to an algebraic closure kˉ; it is enough first to prove that Vkˉ is semisimple. Apply [F1] to Gkˉ: its largest central torus Z(Gkˉ)t is a split torus, and its derived subgroup Gkˉ′ is semisimple. By [F8], Vkˉ is the direct sum of the character weight spaces for Z(Gkˉ)t. Since this torus is central in Gkˉ, each weight space is stable under Gkˉ′.

2.1F3F7step 1.3

(a)⇒(b), decompose the weight spaces. Each weight space from step 1.3 is a finite-dimensional rational representation of Gkˉ′, so [F3] decomposes it into simple Gkˉ′-submodules. The central torus acts on each whole weight space by its character, so every such simple submodule is stable under both Z(Gkˉ)t and Gkˉ′, hence under their product Gkˉ. Thus Vkˉ is semisimple. By [F7] semisimplicity descends from kˉ to k, proving (a)⇒(b) over the original field.

3.1F9A1step 1.1step 1.2step 2.1∎

Steps 1.1, 1.2 and 2.1 prove the equivalence of (a), (b) and (c). If (b) holds, an arbitrary rational representation V is the union of its finite-dimensional subrepresentations by [F9], each of which is a direct sum of simple subrepresentations; the sets of simple subrepresentations whose sum is direct form a nonempty poset under inclusion. The union of a chain is again such a family, since every finite relation occurs in one chain member. By [A1] choose a maximal family with sum S⊆V. If S≠V, [F9] gives a finite-dimensional subrepresentation W containing a vector outside S. A simple summand C of W is then not contained in S, and simplicity gives C∩S=0, so adjoining C extends the family, a contradiction. Hence V=S is a direct sum of simple representations, that is, G is linearly reductive.

Remarks

  • The three implications are Milne's proof of Theorem 22.42: the structure G=Z(G)t⋅G′ reduces the reductive case to the multiplicative-type and semisimple cases, while the converse uses that a unipotent radical acts trivially on every simple module.
  • The final Zorn argument extends the finite-dimensional statement to arbitrary rational representations; the Axiom of Choice is declared and used there in addition to the inherited AC premises of the structural suppliers.

Depends on

Used by

Dependency tree · two levels

86 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