 Solution

For a decreasing integer tuple $\lambda =({\lambda }_1,\dots ,{\lambda }_m)$, let ${\mu }_i={\lambda }_i-{\lambda }_m$. Then $\mu$ is a partition and the highest-weight classification of rational GL representations definesThis is a determinant twist of a Schur module. Every irreducible rational $G{L}_m$ 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 $\lambda$. Distinct tuples have distinct highest torus weights, so these are the complete pairwise nonisomorphic irreducible rational representations.

The Weyl character formula specializes toIt 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 $G{L}_m$. For a polynomial representation this also extends to every endomorphism of $V$. For a general rational representation, the printed claim at singular endomorphisms needs this qualification: for example ${\det }^{-1}$ is undefined at a singular matrix. The displayed formula is valid on $G{L}_m$, and on all of $\mathrm{End}(V)$ when ${\lambda }_m\ge 0$.

To compute the degree, set $x_j=e^{t{c}_j}$ with distinct $c_j$ and take $t\to 0$. For ${\ell }_i={\lambda }_i+m-i$ and $d=\left(\genfrac{}{}{0ex}{}{m}{2}\right)$, the leading coefficient of an exponential alternant isIndeed, expand every exponential in powers of $t$. The first nonzero determinant uses the distinct powers $0,1,\dots ,m-1$; its coefficient is the product of the two Vandermonde determinants divided by $\prod k!$. Taking the same expansion in the denominator cancels the powers and the $c$ factors, giving the Weyl dimension formulaThis proof works for negative ${\lambda }_m$ 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 $x^{\lambda }$ with coefficient $1$, 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 $V\oplus {\Lambda }^{2}V$ has the formal torus characterEach factor sums the symmetric powers of a one-dimensional weight space; the exterior square has weights $x_i{x}_j$ for $i<j$. The permitted Schur identity makes this ${\sum }_{\lambda }{s}_{\lambda }(x)$. 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.