How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Vertex-operator generating series for the padded Schur functions
Statement
Let be a partition and a formal variable. With the Jacobi-Trudi convention of The Jacobi–Trudi completion , the operators and , and for the integer sequences , one has an identity of formal Laurent series with coefficients in the symmetric function ring (Specializations of symmetric functions and the series ): where is evaluated through and through . Equivalently,
Facts & Assumptions
Given: A partition of length ; formal variables and ; a partition .
, , , and by homogeneity of in the power sums (Specializations of symmetric functions and the series , Power sums and complete homogeneous symmetric polynomials ).
and the Cauchy identity hold for all specializations (The series : product formula, Cauchy identity, adjunction and reproducing kernel).
and for all specializations; in particular the coproduct applies to , (Schur functions on sums and products of alphabets).
and : the first by the LR product expansion and Schur orthonormality, the second because (The Littlewood–Richardson rule for products of Schur functions, Schur functions form an orthonormal integral basis); and (Skew Schur functions by Hall adjointness).
Jacobi–Trudi: for every partition and every , with , for ; and for , , with if (Jacobi–Trudi and dual Jacobi–Trudi identities, Skew Jacobi–Trudi and tableau expansion).
A Littlewood–Richardson tableau of shape and content is a semistandard skew tableau whose reading word (rows right to left, top to bottom) satisfies the lattice condition: in every prefix and for every , the number of 's is at least the number of 's; counts them (Littlewood--Richardson tableaux and coefficients).
is a partition of exactly when , and is the Jacobi–Trudi determinant of the integer sequence , equal to for (First-row padding of a partition, The Jacobi–Trudi completion , the operators and , and ).
Proof
Negative one-letter evaluation. By [F2], , so homogeneity gives , and for . If , every entry in the first row of its Jacobi–Trudi determinant [F5] has index at least two, so . If , the matrix is lower triangular with diagonal , hence . The empty determinant gives . Thus .
Consequences for skew functions. For all partitions one has by [F4], so the skew expansion [F4] gives for every , where and .
Coproduct at . Apply [F3] with , , and expand over using step 1.1: by step 1.2, using that for and for not a column. Since is homogeneous of degree and , homogeneity in the power sums gives , so .
Coefficient of and the Jacobi–Trudi expansion. By [F2], , so the coefficient of in is , where for by [F5]. Expand the Jacobi–Trudi determinant of [F8] and [F5] along its first row: the entry in column is , its cofactor sign is , and deleting row and column leaves the matrix with entries over column offsets , which is exactly the skew Jacobi–Trudi determinant of [F5], the first columns being shifted by one. Hence for every , which is the coefficient of computed above; for all indices are negative, both sides vanish, and for the skew functions vanish.
Vertical strips and the second form. By the definition of the Littlewood–Richardson coefficients [F7], counts semistandard skew tableaux of shape with content whose reading word is lattice. A word using each of exactly once is lattice if and only if it is the increasing word : the lattice condition at the position of the letter forces to occur earlier, for every . Hence such a tableau exists precisely when each row of has at most one box (a vertical strip), the filling being then forced row by row top to bottom, with the empty skew shape giving the case ; so . Substituting into step 2.1 and collecting by gives , which combined with [F2] and step 3.1 is the second displayed formula.
Second evaluation of the shift. By [F1], , so by homogeneity; this gives the middle equality of the first display. All coefficient sums are finite in each degree: for fixed only contribute, with whenever , and each is a finite -combination of Schur functions. No convergence of a scalar series is asserted, no value is evaluated, and no choice principle is used.
Depends on
- Specializations of symmetric functions and the series $\sigma$
- Schur functions on sums and products of alphabets
- The series $\sigma$: product formula, Cauchy identity, adjunction and reproducing kernel
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
- First-row padding of a partition
- The Jacobi–Trudi completion $s_\mu$, the operators $U_n$ and $V$, and $\operatorname{stab}(\alpha,\beta)$
- Jacobi–Trudi and dual Jacobi–Trudi identities
- Skew Jacobi–Trudi and tableau expansion
- Skew Schur functions by Hall adjointness
- The Littlewood–Richardson rule for products of Schur functions
- Littlewood--Richardson tableaux and coefficients
- Irreducible symmetric-group character values are power-sum coefficients
- The irreducible complex characters form an orthonormal basis of $\mathrm{cf}(G)$
- Power sums are orthogonal for the Hall form
- Schur functions form an orthonormal integral basis
- The Hall inner product on symmetric functions
Used by
Dependency tree · two levels
46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Emmanuel Briand, Amarpreeet Rattan and Mercedes Rosas, On the growth of the Kronecker coefficients, arXiv:1607.02887v1 (2016); section 2.4, identity (6), p. 7 (the vertex operator series), and section 2.3 p. 6 (lambda-ring specializations) (standard reference, not scraped)
- Emmanuel Briand, Rosa Orellana and Mercedes Rosas, The stability of the Kronecker product of Schur functions, arXiv:0907.4652v2 (2009); Section 1 p. 3, equation (1) (Jacobi-Trudi completion) and Lemma 2.1, identity (9), pp. 7-8 (Littlewood's vertex-operator identity) (standard reference, not scraped)