Complete reducibility of rational GL and SL representations Created 2026-10-07 Updated 2026-10-14
For finite-dimensional rational representations of complex or , average a Hermitian inner product over the compact group or using normalized Haar measure. Orthogonal complements become invariant under the compact group and its complexified Lie algebra. The latter generates the complex group, giving invariant complements and hence complete reducibility. This conclusion does not hold for arbitrary affine algebraic groups, such as the additive group.
Determinant twist 2026-10-07
Tensoring a rational representation of the general linear group with a determinant power shifts every highest-weight coordinate by the same integer . Positive twists can clear determinant denominators; negative twists supply rational representations that do not extend to singular matrices. Twisting preserves irreducibility and dimension.
For every finite-dimensional rational representation and every nonzero , a geometrically reductive algebraic group admits a homogeneous invariant polynomial of positive degree with . A linearly reductive group can take degree one. In positive characteristic, higher degree is essential: a power can separate a fixed vector even when an invariant linear functional cannot.
An affine algebraic group is linearly reductive when every finite-dimensional rational representation is completely reducible. Equivalently its invariants functor is exact. Over a field of characteristic zero, reductive algebraic groups are linearly reductive; in positive characteristic this stronger property fails for many reductive groups. An algebraic torus is linearly reductive in every characteristic because its rational representations decompose into character spaces.
For a real Lie group , its Lie algebra is the real tangent space at the identity. Each tangent vector extends uniquely to a left-invariant vector field, and the commutator of those fields defines the Lie bracket. For a matrix group this bracket is .
For a complex affine algebraic group, the Lie algebra of an affine algebraic group is the complex Zariski tangent space . Its bracket is the commutator of left-invariant derivations. In a faithful matrix realization, one can compute the tangent space using dual numbers: belongs to it exactly when satisfies the group equations modulo . This is a complex Lie algebra, whereas compact groups such as and have real Lie algebras.
Differentiate at the identity to get . Conversely is unitary for every skew-Hermitian . Differentiating the determinant gives , while proves sufficiency of the trace condition. Finally, is an open subset of all complex matrices, so its tangent space has no linear constraint. Therefore
Their dimensions are respectively , with real dimensions for the first and third and complex dimensions for the second and fourth. In every case the Lie bracket is the matrix commutator.
An irreducible complex affine algebraic group is connected. It is a reductive algebraic group when its unipotent radical , the largest connected normal unipotent subgroup, is trivial. This is an algebraic condition; in characteristic zero it also implies complete reducibility of finite-dimensional rational representations, as proved in Question 2.
Examples are algebraic tori, and , and products of these groups. A diagonal matrix that is unipotent must be the identity, so a torus has no nontrivial unipotent subgroup. For the two matrix groups, let be a normal unipotent subgroup. The Kolchin theorem supplies a nonzero fixed vector in their standard representation. The subspace fixed by is invariant under the whole group: for , . The standard representation is irreducible, so every vector is fixed by ; its faithfulness makes trivial. A normal unipotent subgroup of a product projects to such a subgroup of each factor, proving the product assertion. By contrast the additive group and a nontrivial upper-unitriangular group are not reductive: their unipotent radicals are the whole group.
For a compact Lie group, take any positive-definite Hermitian inner product on and average using probability Haar measure:
It remains positive definite, because the integrand is positive for a nonzero vector, and translation invariance makes it -invariant. If is an invariant subspace, then is invariant too: when . Thus . Induction on dimension proves complete reducibility. This uses the usual continuous finite-dimensional representations of the compact group.
For a connected complex reductive algebraic group, representations are understood to be rational representations. Use a compact real form with . The structural construction takes a compact real form of the semisimple derived factor and the unit circles in the central torus, then passes through their finite central quotient. This is the compact-form structure of a complex reductive group, rather than an assumption that its given representation is already unitary.
The group is Zariski dense: the Lie algebra of its Zariski closure contains the complex span of , hence all of ; connectedness then makes that closure . Average over as above. The orthogonal complement of a -submodule is -invariant. Its stabilizer is a Zariski-closed subgroup, since preserving a fixed subspace is a system of algebraic matrix conditions. The stabilizer contains dense , so it is all of . This again gives an invariant complement to every submodule and proves
If reductivity is defined to allow finitely many components, first obtain a -equivariant projection . Average its conjugates over the finite component group. Since commutes with , the average is independent of coset representatives; it is -equivariant and remains the identity on . Its kernel supplies the required complement. Thus the result holds in that convention too.
Here representations mean finite-dimensional rational representations of . Put . The irreducibles are
The invariant alternating form on identifies with , so these can equally be realized as binary forms of degree . With basis , the standard Lie algebra generators act as
The distinct torus weights and these nonzero lowering and raising coefficients show irreducibility: any nonzero invariant subspace contains a weight vector, and repeated applications of obtain the entire basis.
For exhaustion, choose a highest-weight vector of an irreducible representation, so , . The sl2 highest-weight lowering formula, obtained by induction from , is . If but , applying to the latter equality gives , hence . The vectors have distinct weights and span an invariant submodule, so irreducibility makes it the whole representation. After rescaling basis vectors it is . Complete reducibility from Question 2 now describes every representation as a finite direct sum of these symmetric powers. Their central element acts by .
The symbolic method for binary-form invariants works as follows. Write a degree- form as and introduce a formal letter . The formal power is converted to by the linear substitution . This is an umbral linear rule, not a claim that every form is an actual power of a linear form.
For a coefficient polynomial of degree , polarize it into copies of the form, represented by letters . Each letter must occur with degree . In characteristic zero, polarization and evaluation on equal forms recover the original coefficient polynomial. The basic invariant expressions in the letters are brackets
They are invariant because . Invariant tensors on copies of a two-dimensional space are spanned by pairwise alternating contractions; equivalently, the invariant polynomials in the letters are generated by these brackets. One can see the tensor statement from the two-row Young-symmetrizer description of the determinant powers in tensor space. Their basic relations include and . Multiply brackets, ensure the required degree in each letter, symmetrize letter copies as needed, and apply the umbral substitutions. This gives all coefficient invariants, and also works for joint invariants of several forms.
For example, for , the expression becomes , the quadratic discriminant up to its conventional scalar. Contractions leaving variable indices unpaired give covariants. A useful systematic construction is the transvectant of binary forms:
For forms of degrees , this is an equivariant form of degree . The corresponding tensor decomposition is
Its character identity follows by multiplying the weight sums; complete reducibility then gives the decomposition, and alternating contractions supply the displayed maps onto its summands.
A vector in a rational representation is an unstable vector in a rational representation when , with Zariski closure. For , the Hilbert-Mumford criterion for the affine null cone is
Every algebraic one-parameter subgroup is conjugate to with integer summing to zero. This follows by decomposing the standard representation into characters of the multiplicative group, then imposing determinant one. In its weight decomposition, a limit of zero means that only strictly positive weights occur.
The reverse implication in the criterion is immediate: the subgroup lies in and supplies points of the orbit tending to zero. For the harder implication, the complex orbit is locally closed and Zariski open in its closure. A nonempty Zariski-open subset of a complex irreducible variety is dense also in the usual topology. Thus choose in the ordinary vector-space topology. Singular value decomposition, with determinant phases adjusted, gives
Use an -invariant Hermitian inner product on . By compactness, after a subsequence . Put , and decompose it into the weights of the diagonal torus, . These weight spaces are orthogonal because the unitary diagonal torus preserves the inner product. Hence
For every with , its final norm is bounded away from zero for large , forcing . There are only finitely many such weights, so choose a single real vector with sum zero and for all of them. The inequalities are strict with integer coefficients. A nearby rational vector still satisfies them; multiply its negative by a common denominator to obtain integers of sum zero with throughout this support. Then takes to zero. Conjugating gives taking to zero, completing the proof. The zero vector itself satisfies the criterion trivially.
For degree-six binary forms, a nontrivial algebraic one-parameter subgroup of is, after conjugation and choosing its direction, with . On the weight is . Strictly positive weights permit only , so the form is divisible by . Conversely every such form tends to zero under that subgroup. Changing basis replaces by any linear factor. The root-multiplicity criterion for unstable binary forms therefore gives
A triple root alone is insufficient: has weight zero and is not unstable. Nor does merely having a repeated root suffice.
An affine algebraic group is a linearly reductive algebraic group if every finite-dimensional rational representation is completely reducible; equivalently the functor of invariants is exact. It is a geometrically reductive algebraic group if, whenever , there is a homogeneous invariant polynomial of positive degree with . Linear reductivity permits degree one; geometric reductivity allows higher degree.
Over the algebraically closed field, an algebraic torus is . Its coordinate ring is the Laurent polynomial ring. A rational action writes the coaction of a vector as a finite sum . The coaction identity and linear independence of Laurent monomials give and . Thus
Each weight space has scalar action, so any vector-space complement within each weight space is invariant. This proves complete reducibility, and hence tori are linearly reductive in every characteristic. The argument uses characters themselves, not their Lie algebra differentials, which could coincide modulo .
We now prove geometric reductivity of by determinant separation for positive-characteristic SL2. Fix a rational -module and a nonzero fixed vector . For the diagonal torus, choose a weight-zero functional with , using the torus decomposition just proved. Define matrix coefficients
These are regular functions on , and makes equivariant for left translations. Moreover because is torus-invariant. Thus maps into for the right torus action, and .
Write a matrix's two columns as and , with . Right torus multiplication scales these columns by and . Every right-torus-invariant regular function has a weight-zero polynomial lift, hence a sum of polynomials of bidegrees in . To see that a weight-zero lift exists, take any lift and retain its zero-weight component; the ideal is torus-stable and the quotient map preserves weights. Multiply each piece by to put the entire sum in bidegree without changing its restriction to .
Let be the space of degree- polynomials in one column. Restriction gives an injective equivariant map . Indeed if a bidegree- polynomial vanishes on determinant-one matrices, scale the first column of any invertible matrix to make its determinant one. Homogeneity then makes the polynomial vanish on every invertible matrix, a dense open subset, so it is zero. Denote the image by . These spaces increase because multiplication by realizes , and their union is . The finite-dimensional image therefore lies in one , and in any sufficiently larger filtration piece.
Choose with at least that bound, and set . The identity in characteristic gives
The invariant tensor
therefore defines an invertible equivariant linear map : its matrix is anti-diagonal with all entries nonzero. Interpret any tensor as a map and send it to . Equivariance of makes this identification intertwine the diagonal tensor action with conjugation on endomorphisms. Crucially, restricts to the constant function on , and is sent to the identity endomorphism.
Under the resulting equivariant linear map , the vector is sent to . Since , the endomorphism determinant is a homogeneous polynomial of positive degree , invariant under conjugation. Pull it back to . The resulting polynomial satisfies
This constructs the required invariant for every fixed nonzero vector and proves is geometrically reductive, including characteristic two. No averaging by a group order or division by is used; those operations would fail in the field's characteristic.
For a Young tableau , let permute the entries within its rows and within its columns. We use the Young symmetrizer convention
Reversing the order gives another usual realization of the same irreducible polynomial module. On the tensor power , the actions are
They commute because applying to every factor commutes with permuting the factors.
We state the permitted combinatorial input explicitly. A Young symmetrizer satisfies , where is the nonzero hook product of a partition. Thus is a primitive idempotent. The standard-tableau decomposition of the right regular module is . Tensor this right-module direct sum with the left module . The map sending to is an isomorphism, with inverse . Therefore the Young-symmetrizer tensor decomposition is
This is a direct sum of -modules; individual summands need not be -invariant.
We also state the allowed Schur algebra result, namely Schur–Weyl duality: the two actions are mutual commutants, and
where the are pairwise nonisomorphic irreducible homogeneous polynomial representations of degree . We also use the standard Schur algebra equivalence between its modules and homogeneous degree- polynomial representations, so these exhaust the irreducibles in that category. A primitive idempotent has one-dimensional image on and zero image on the other simple factors, so . This identifies the requested irreducibles. They classify the polynomial degree- representations in this tensor power, not all rational representations of every degree.
The length bound for a Schur module is if and only if . A column of length greater than antisymmetrizes more than vectors and gives zero. Conversely, for , fill every tensor position in row with the th basis vector of . Row symmetrization multiplies it by , and column antisymmetrization is nonzero because the vectors within each column are distinct basis vectors.
A rational representation of an algebraic group is a regular morphism into the general linear group of its representation space. For , its matrix entries belong to ; rational here permits determinant denominators but not arbitrary poles on . A one-dimensional rational character of is a Laurent polynomial with and . Comparing Laurent coefficients shows that just one monomial occurs and its coefficient is , hence for .
Restrict a one-dimensional rational character of to its diagonal torus. The same argument in several variables gives . Conjugation by permutation matrices makes all equal. On every diagonalizable invertible matrix it consequently agrees with . The allowed Zariski-density statement, and equality of regular functions on a dense subset, give
These are the one-dimensional rational characters of the general linear group.
For complete reducibility of rational GL and SL representations, use the compact-group averaging argument. Average any positive definite Hermitian inner product over using normalized Haar measure. The orthogonal complement of an invariant subspace is then -invariant. Differentiating makes it invariant under and therefore under its complex span . The elementary unipotent matrices generate , so the complement is -invariant. This proves complete reducibility. Averaging over similarly gives complete reducibility for rational representations.
Here is an explicit rational extension from SL to GL. Decompose the representation space by the finite scalar center of into subspaces on which acts as , with and . These subspaces are invariant. For , choose with , set , and define
Changing to changes to , so the two factors cancel. It is a homomorphism, since scalar roots multiply up to the same harmless factor, and it restricts to on .
It is rational as well. Every matrix coefficient of has a polynomial representative on . Averaging that representative over the finite scalar center selects its homogeneous parts with . Substitution in the extension gives , a regular function on . Each -invariant subspace decomposes into its parts, and the extension acts on each part by a scalar times an action. Thus these subspaces are also invariant under the chosen extension. Consequently is irreducible if and only if this is irreducible. For , is trivial and the trivial extension supplies the same conclusion.
For a decreasing integer tuple , let . Then is a partition and the highest-weight classification of rational GL representations defines
This is a determinant twist of a Schur module. Every irreducible rational representation becomes polynomial after multiplication by a sufficiently large positive determinant power, which clears all matrix-entry denominators. The polynomial degree decomposition and Schur–Weyl duality then identify it with a Schur module. Undoing the twist gives exactly one decreasing integer tuple . Distinct tuples have distinct highest torus weights, so these are the complete pairwise nonisomorphic irreducible rational representations.
The Weyl character formula specializes to
It is a symmetric Laurent polynomial in the eigenvalues. Equality extends from the dense set of diagonalizable matrices to all invertible matrices: both the character and the expression in the characteristic-polynomial coefficients are regular functions on . For a polynomial representation this also extends to every endomorphism of . For a general rational representation, the printed claim at singular endomorphisms needs this qualification: for example is undefined at a singular matrix. The displayed formula is valid on , and on all of when .
To compute the degree, set with distinct and take . For and , the leading coefficient of an exponential alternant is
Indeed, expand every exponential in powers of . The first nonzero determinant uses the distinct powers ; its coefficient is the product of the two Vandermonde determinants divided by . Taking the same expansion in the denominator cancels the powers and the factors, giving the Weyl dimension formula
This proof works for negative as well, since determinant twists have dimension one.
Every finite-dimensional rational module is completely reducible. The characters of its irreducible constituents are linearly independent: each Schur Laurent character has its highest dominant monomial with coefficient , and only lower weights besides it. In a finite relation, choose a lexicographically highest remaining weight; its coefficient must vanish, and iterate. Therefore equal characters give equal multiplicities of every irreducible constituent, proving rational modules with the same character are isomorphic.
Finally the symmetric algebra of has the formal torus character
Each factor sums the symmetric powers of a one-dimensional weight space; the exterior square has weights for . The permitted Schur identity makes this . In each fixed scalar degree there are only finitely many terms, so complete reducibility and character independence apply degree by degree without a convergence assumption. Thus the multiplicity-free symmetric-algebra model for polynomial GL representations contains each irreducible polynomial representation exactly once. The word irreducible is necessary: arbitrary reducible polynomial modules, such as two copies of the trivial module, do not each occur once in a multiplicity-free sum.