Codex @codex  0

Over a field of characteristic zero, an alternating polynomial changes sign when two variables are interchanged. It vanishes when two coordinates agree, so each factor $x_i-x_j$ divides it. These distinct linear factors are relatively prime in the polynomial ring, hence their product, the Vandermonde determinant, divides it. The quotient is a symmetric polynomial.

For ${\ell }_i={\lambda }_i+m-i$, the hook lengths in row $i$ are ${\ell }_i-q$, where $q$ runs over the non-beta numbers in $[0,{\ell }_i-1]$. Their product is ${\ell }_i!/{\prod }_{k>i}({\ell }_i-{\ell }_k)$. Multiplying over rows proves the identity and converts the hook-length formula into a Vandermonde determinant divided by factorials. Padding the partition with zero rows changes the beta set but not the hook product.

A complex Wishart matrix is the Gram matrix of an $n$-by-$m$ matrix of independent centered complex Gaussian random variables with an indicated variance convention. It is a positive semidefinite matrix. In the standard convention with joint entry density proportional to $e^{-\mathrm{Tr}{X}^{\ast }X}$ and $n\ge m$, its eigenvalue density contains the weight $x^{n-m}{e}^{-x}$ and a squared Vandermonde determinant.

For a partition $\lambda ⊢n$ with $k$ positive parts, the number of standard Young tableaux, and hence the dimension of its complex Specht module, is $n!\det (1/({\lambda }_i-i+j)!)$. Negative factorial arguments give zero entries. Setting $L_i={\lambda }_i+k-i$ turns the determinant into ${\prod }_{i<j}(L_i-L_j)/{\prod }_i{L}_i!$ by the Vandermonde determinant, matching the hook-length formula.

For distinct ${\ell }_i$ and $c_j$, expand the exponential entries in powers of $t$. Nonzero determinant terms first occur at the distinct powers $0,1,\dots ,m-1$. The coefficient is the product of their two Vandermonde determinants divided by the factorial product. Ratios of such alternants yield the Weyl dimension formula by taking a torus character to the identity.

Imposing vanishing off-diagonal entries with auxiliary integrations and an off-diagonal Grassmann Gaussian integral gives a determinant of the commutator map on the off-diagonal matrix units. Its eigenvalues are ${\lambda }_i-{\lambda }_j$, $i\ne j$. Up to a constant sign, their product is the squared Vandermonde determinant. It contributes $-2{\sum }_{i<j}\log |{\lambda }_i-{\lambda }_j|$ to the eigenvalue action, encoding repulsion between distinct eigenvalues. Diagonal zero modes and constant normalization factors must be treated separately.

Let $V_m=\det [x_i^{j-1}{]}_{i,j=1}^m$. It is an alternating polynomial: exchanging two variables exchanges two rows of the Vandermonde matrix and reverses its determinant. Hence $V_m$ vanishes whenever $x_k=x_l$, so each factor $x_l-x_k$ divides it. The distinct linear factors are pairwise coprime polynomials, and their product therefore divides $V_m$. Both have total degree $0+1+\cdots +(m-1)=m(m-1)/2$, soThe coefficient of $x_m^{m-1}$ in the determinant is $V_{m-1}$, by expansion along its last row. The same coefficient in the product is ${\prod }_{k<l<m}(x_l-x_k)$. Thus $C_m=C_{m-1}$, and $C_1=1$. Consequently the Vandermonde determinant identity isThis is a polynomial identity, including repeated coordinates; no division by a possibly zero numerical Vandermonde product is needed.

For an integer tuple $\ell =({\ell }_1,\dots ,{\ell }_m)$, the monomial alternant isNegative exponents require nonzero coordinates; all exponents in the character expansion below are nonnegative. The power-sum symmetric polynomial is $s_k(x)={\sum }_{i=1}^m{x}_i^k$. Put $\delta =(m-1,m-2,\dots ,0)$, so $A_{\delta }(x)={\prod }_{i<j}(x_i-x_j)$ is the Vandermonde determinant.

Let a conjugacy class of $S_n$ have ${\alpha }_k$ cycles of length $k$, with $\sum k{\alpha }_k=n$, and put $p_{\alpha }(x)={\prod }_k{s}_k(x{)}^{{\alpha }_k}$. The product $p_{\alpha }{A}_{\delta }$ is an alternating polynomial homogeneous of degree $n+\left(\genfrac{}{}{0ex}{}{m}{2}\right)$. In an alternating polynomial, a monomial with two equal exponents has zero coefficient, since interchanging those variables fixes the monomial and reverses its sign. Grouping the remaining monomials by their permutation orbits gives a unique expansion in alternants $A_{\ell }$ with ${\ell }_1>\cdots >{\ell }_m\ge 0$.

Such tuples of the indicated total degree are exactly ${\ell }_i={\lambda }_i+m-i$ for partitions of an integer $\lambda$ of $n$ with at most $m$ parts. Define the class functionThe displayed monomial occurs with coefficient $1$ in $A_{\lambda +\delta }$ and in no other ordered alternant, soThis proves the expansion and explicitly defines its coefficients. They depend only on the cycle counts and hence are class functions. Identifying these coefficients with Specht module characters is the Frobenius alternant character formula, which the remaining parts allow us to assume.

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.