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.
Groups of multiplicative type are linearly reductive
Statement
Assume the Axiom of Choice. Let be a field and let be a finite-type group scheme of multiplicative type over (Groups of multiplicative type and tori). Then every rational representation of (Rational representations and comodules of an affine group scheme) is a direct sum of simple representations, and the simple representations are classified by the -orbits of the character group : is linearly reductive.
Facts & Assumptions
Given: The Axiom of Choice, a field , and a finite-type group of multiplicative type over .
Assume AC. Every finite-type group of multiplicative type splits over a finite Galois extension : there is a finite Galois with diagonalizable, , where is a finitely generated abelian group with continuous -action, and is a contravariant equivalence between finite-type groups of multiplicative type over and finitely generated abelian groups with continuous -action. (Multiplicative type groups split over a finite Galois extension, Multiplicative type groups and Galois character modules)
Assume AC. For a finite Galois extension with group , the functor is an equivalence between finite-dimensional -vector spaces and finite-dimensional semilinear -spaces, with inverse . (Galois fixed points recover finite-dimensional scalar extensions, Semilinear Galois actions, twists, and split central idempotents)
Over a field in which is diagonalizable with character group , every rational representation of decomposes as into eigenspaces for the distinct characters. (Representations of diagonalizable groups split into character eigenspaces, Rational representations and comodules of an affine group scheme)
Proof
Given: The Axiom of Choice, a field , a finite-type group of multiplicative type over , and a rational representation of that is finite-dimensional over .
By [F1] choose a finite Galois extension with group such that is diagonalizable with , finitely generated, and the -action permutes the characters with . The base change is a representation of equipped with a semilinear -action compatible with the comodule structure, and by [F2] the passage is an equivalence with the corresponding category of finite-dimensional semilinear -equivariant -representations, with inverse .
By [F3] the representation decomposes as a direct sum of eigenspaces for the distinct characters, and the -equivariance of the comodule structure gives for , so the decomposition is permuted by . For each -orbit put ; then is a -stable -subrepresentation and is a sum over the finitely many orbits.
Fix an orbit , choose , and put and . The weight space has a semilinear -action. Galois descent [F2] identifies it with for the -space . Choose a basis of . Each basis vector defines a -stable -line in . Translate that line by representatives of and take their direct sum across the weights in ; the result is a -stable -subrepresentation with one-dimensional weight spaces, and it is independent of the choice of representatives because the initial line is -stable. These orbit subrepresentations, one for each basis vector, decompose . Each descends by [F2] to a simple -module: a submodule after scalar extension is a sum of some of its distinct one-dimensional weight spaces, and -stability and transitivity on force either none or all. Thus the whole isotypic block need not be simple, but is a direct sum of copies of one simple module indexed by .
Every finite-dimensional representation is therefore a direct sum of simple modules. For each orbit the construction with a one-dimensional -space gives a simple module, and any simple module must have a single orbit and multiplicity one by step 3.1; different orbits have different scalar-extended weights. This gives the asserted classification. For an arbitrary rational , project its coaction onto the direct sum of weight-coalgebra blocks for each Galois orbit; these finite-dimensional blocks descend from the spans of , , and counit and coassociativity give a direct decomposition . Finite Galois descent also holds for arbitrary semilinear spaces: for each vector, its finite orbit under the Galois group spans a finite-dimensional stable subspace, to which [F2] applies. This proves surjectivity of the canonical map from the scalar extension of invariants; a finite relation among invariant vectors lies in such a finite stable subspace, and finite-dimensional descent proves injectivity. Apply this argument to each weight space and its stabilizer subgroup. In each block choose a basis of the descended possibly infinite-dimensional space under AC; the construction of step3.1 then decomposes into copies of its orbit simple. Hence every rational representation is a direct sum of simples and is linearly reductive.
Depends on
- The Axiom of Choice
- Groups of multiplicative type and tori
- Linear subspace of a vector space
- Rational representations and comodules of an affine group scheme
- Semilinear Galois actions, twists, and split central idempotents
- Galois fixed points recover finite-dimensional scalar extensions
- Multiplicative type groups split over a finite Galois extension
- Representations of diagonalizable groups split into character eigenspaces
- Multiplicative type groups and Galois character modules
Used by
- Extensions of multiplicative-type groups by a one-dimensional vector group with a linear action split Proposition
- Complete reducibility of rational modules in characteristic zero Theorem
- Conjugacy of diagonalizable complements and maximal subgroups under smoothness hypotheses Theorem
- Fixed-point schemes and centralizers of linearly reductive actions Theorem
- Splitting trigonalizable extensions: algebraically closed fields and two perfect-field cases Theorem
Dependency tree · two levels
41 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
- J. S. Milne, Algebraic Groups (corrected 2022 printing, Cambridge University Press) (standard reference, not scraped)
- Florian Herzig, Linear Algebraic Groups (University of Toronto lecture notes, 2013) (standard reference, not scraped)