For a Young tableau , let permute the entries within its rows and within its columns. We use the Young symmetrizer conventionReversing the order gives another usual realization of the same irreducible polynomial module. On the tensor power , the actions areThey 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 isThis 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, andwhere 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, giveThese 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 defineChanging 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.
Articles by others on the same topic
There are currently no matching articles.