For an integer partition with at most parts, padded with zeros, the Schur polynomial in variables is
Both determinants change sign when two variables are exchanged. Every factor of the denominator's Vandermonde determinant divides the numerator, so the quotient is a symmetric polynomial, including at repeated variable values. The bialternant formula and Jacobi–Trudi identity give equivalent descriptions; the latter writes it as in complete homogeneous symmetric functions.[ref]
Equivalently, sums the weight monomials of all Semistandard Young tableaux of shape , with entries in , weakly increasing along rows and strictly increasing down columns. For example,
The two monomials correspond to the two possible fillings of this three-cell shape. A single-row shape gives , while a single-column shape gives an elementary symmetric polynomial.
Adding a zero variable leaves these expressions unchanged, defining a Schur function in the ring of symmetric functions. In each fixed degree, the Schur functions form a basis indexed by the integer partitions of that degree. The Frobenius characteristic map identifies this basis with the irreducible characters of symmetric groups, connecting tableau enumeration to representation theory.
For an integer partition , , where is the cell's hook length. It counts Semistandard Young tableaux of shape whose entries belong to .
Let and . Multiply the Jacobi–Trudi identity matrix by . The generating-function identity makes the product matrix . Setting shows , proving the formula as a polynomial identity.
Put . In the bialternant formula, substitute with distinct and compare the first nonzero determinant coefficients as . They arise from the distinct degrees in the exponential expansions. The common factor in the and the factorials cancel, leaving the product of differences of the divided by the differences of . This proves the displayed integral specialization without dividing by a vanishing Vandermonde value.
Sum the weight monomials of all Semistandard Young tableaux on the skew Young diagram , with weak rows and strict columns. A Bender-Knuth involution interchanges the counts of adjacent letters without changing the shape, so the sum is a symmetric function. Taking empty gives the Schur function.
The Jacobi–Trudi identity expresses a Schur polynomial as
In particular, .
Here is the trivial character of , is the induction-product unit, for , and multiplication is induction of external tensor products. The Frobenius characteristic map turns the expression into the Jacobi–Trudi identity. A sign-reversing involution on intersecting lattice-path systems leaves precisely the nonintersecting systems corresponding to Semistandard Young tableaux, proving the determinant identity.

Articles by others on the same topic (1)

The Schur polynomial is a specific type of symmetric polynomial that plays a significant role in algebraic combinatorics, representation theory, and geometry. It is associated with a given partition of integers and is used in the study of symmetric functions.