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

Semisimplicity of rational representations descends along field extensions

Statement

Let G be an algebraic group over a field k, let (V,r) be a finite-dimensional rational representation and let k′⊇k be a field extension. If the base change (Vk′,rk′) is semisimple as a representation of Gk′, then (V,r) is semisimple (Rational representations and comodules of an affine group scheme, Simple and semisimple rational representations). In particular it suffices to test semisimplicity after extending scalars to an algebraic closure of k. For a possibly nonaffine G, rationality here means that r:G→GL⁡V is a morphism; subrepresentations are the invariant subspaces. This agrees with the cited comodule definition for affine G.

Facts & Assumptions

Given: An algebraic group G over k, a finite-dimensional rational representation (V,r), a field extension k′⊇k, and the base changes Gk′ and (Vk′,rk′). Put A=Γ(G,OG); finite representation matrices have entries in A, whether or not G is affine.

[F1]

Base change of matrix coefficients. Base change of the morphism r:G→GL⁡V defines the representation on Vk′, and preserves invariant subspaces. A finite-dimensional subspace C⊆A remains linearly independent after base change: the restriction maps from C to the rings of affine opens jointly detect zero, and finitely many suffice. Indeed choose a finite intersection of their kernels of minimal dimension; if it were nonzero, another restriction would lower its dimension. Thus C injects into a finite direct sum of affine-open coordinate rings. Tensoring with k′ preserves this injection by finite coefficient comparison, and these rings become the coordinate rings of the base-changed affine opens by Affine fibre products are spectra of tensor products. Consequently C⊗kk′→Γ(Gk′,OGk′) is injective. In the affine case these are the usual comodule coefficient calculations of Rational representations and comodules of an affine group scheme; the argument does not require global affineness.

[F2]

Hom representation and scalar extension. For finite-dimensional W, the space M=Hom⁡k(V,W) with (g⋅f)(v)=g⋅f(g−1v) is a finite-dimensional rational representation of G (Tensor products, exterior powers and Hom spaces of finite-dimensional rational representations are rational). For nonaffine G its matrices are still regular: they are the products of the representation matrix on W and the inverse representation matrix on V, so the displayed action gives a morphism into GL⁡M directly. Choose a finite basis (ei) of V with dual basis (ei∗), and a finite basis (wj) of W. The rank-one maps Eij:v↦ei∗(v)wj form a k-basis of M; after scalar extension, their corresponding maps on Vk′ with values in Wk′ form a k′-basis of Hom⁡k′(Vk′,Wk′). Thus the canonical map M⊗kk′→Hom⁡k′(Vk′,Wk′) sending f⊗a to afk′ is an isomorphism (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear functionals and the algebraic dual V∗=L(V,F)).

[F3]

Equivariance is a finite linear system. In a finite basis m1,…,mN of M, write g⋅mj=∑iaij(g)mi with aij∈A. For f=∑jzjmj, fixedness is exactly ∑jaijzj=zi as regular functions on G, for every i. Let C⊆A be the span of 1 and all aij. Comparing coefficients in a finite basis of C turns these identities into finitely many linear equations over k. By [F1] that coefficient basis stays independent on Gk′, so the base-changed equations express exactly Gk′-fixedness. Fixedness in the Hom action means equivariance of f. Adding the finite coordinate equations f∣W=id⁡W defines the affine solution set S={f∈M:f is G-equivariant, f∣W=id⁡W}. This uses the finite matrix interpretation of rationality; in the affine case it is the usual comodule condition (Rational representations and comodules of an affine group scheme, [F2]).

[F4]

Linear systems over a field. Every finite matrix over a field is row equivalent to a matrix in reduced row echelon form, obtained by Gauss-Jordan elimination (Gauss–Jordan elimination reduces every finite matrix over a field to reduced row echelon form). Row operations are invertible and preserve solution sets over every extension field; a system in reduced row echelon form is solvable if and only if it has no row (0 ⋯ 0∣c) with c≠0, and when it is solvable, setting the free variables equal to 0 and solving the pivot equations gives a solution with coordinates in the field generated by the coefficients, hence in k when the coefficients lie in k.

[F5]

Splitting implies semisimplicity. If every subrepresentation of a finite-dimensional rational representation U is a direct summand, then U is semisimple: choose a nonzero subrepresentation of minimal dimension, which is simple, split it off, and iterate on the complement of smaller dimension (Simple and semisimple rational representations).

Proof

technique · direct
1.1F1givenalgebra

Assume that (Vk′,rk′) is semisimple and let W⊆V be a subrepresentation. Then Wk′ is a subrepresentation of Vk′. Write Vk′ as a finite direct sum of simple subrepresentations and choose a largest subfamily whose sum C intersects Wk′ trivially. If Wk′+C≠Vk′, some simple summand Si is not contained in Wk′+C; simplicity gives Si∩(Wk′+C)=0, so adjoining Si contradicts maximality. Hence Vk′=Wk′⊕C.

1.2F2F3

The set S of G-equivariant k-linear maps f:V→W with f∣W=id⁡W is, by [F3], the solution set of a finite system of linear equations with coefficients in k, inside the finite-dimensional k-vector space M=Hom⁡k(V,W); and M⊗kk′≅Hom⁡k′(Vk′,Wk′) identifies the base-changed system with the corresponding system over k′.

2.1step 1.1step 1.2

The base-changed system has a solution over k′: the projection p:Vk′→Wk′ along the decomposition Vk′=Wk′⊕C of step 1.1 is Gk′-equivariant and restricts to the identity on Wk′. Thus p solves the equations of step 1.2 over k′; the affine solution set S itself need not be a vector space.

3.1F4step 1.2step 2.1

The system of step 1.2 has a solution over k. Row-reduce its augmented matrix over k by Gauss-Jordan elimination; the resulting reduced row echelon system has the same solution set over k′, so it is solvable over k′ by step 2.1 and therefore has no row of the form (0 ⋯ 0∣c) with c≠0; setting the free variables equal to zero and solving the pivot equations then produces a solution in k.

4.1step 3.1

Let f∈S. Then f:V→W is G-equivariant with f∣W=id⁡W, so W∩ker⁡f=0 and every v∈V satisfies v−f(v)∈ker⁡f, giving V=W⊕ker⁡f; thus every subrepresentation of V is a direct summand.

5.1F5step 4.1

By [F5] the representation (V,r) is semisimple.

6.1step 5.1∎

If in particular Vkˉ is semisimple for an algebraic closure kˉ of k, applying step 5.1 to the extension k⊆kˉ shows that V is semisimple; this completes the proof.

Remarks

  • The extension k′ need not be algebraic or separable: only the invariance of consistency of a k-linear system under base change is used, which holds for every field extension.
  • The field extension enters twice: in defining the base-changed representation Vk′ and in producing the k′-solution of the complement equations; the descent of the solution itself is elementary linear algebra over k.

Depends on

Used by

Dependency tree · two levels

40 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