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.
Complete homogeneous functions expand in power sums with cycle-distribution coefficients
Statement
Work in . For a partition write and (Partitions, English diagrams, and conjugation, Power sums and complete homogeneous symmetric polynomials ).
For partitions and of the same integer, let be the number of ways to distribute the cycles of a permutation of cycle type among the rows, labelled , so that row receives cycles whose lengths sum to . Cycles of equal length count as distinct here, because they are distinct cycles of ; equivalently,
the sum over all matrices of nonnegative integers with for every and for every ; each summand is the product over of the number of ways to assign the labelled cycles of length to rows with the prescribed multiplicities , so is a nonnegative integer. Then
In particular for every .
Facts & Assumptions
Given: Partitions and of the same integer , with and .
, where an element of is a compatible sequence of degree- symmetric polynomials in variables whose transition maps set the last variables to zero, and multiplication is coordinatewise polynomial multiplication (The stable graded ring of symmetric functions).
For every the family is a -basis of , where and (Elementary and complete families freely generate the stable ring).
For the stable power sum is the compatible sequence of the finite power sums , and for a partition one sets , with ; likewise (Power sums and complete homogeneous symmetric polynomials ).
For every the family is a -basis of (Power sums form a rational but not integral stable basis).
A partition of is a weakly decreasing finite sequence of positive integers with sum ; the empty partition is the only partition of , and denotes the number of parts of equal to (Partitions, English diagrams, and conjugation).
Proof
Fix a rank , work in , and write and for the rank- specializations. The coefficient of in is , so ; taking the formal logarithm gives , and applying the formal exponential (with for and for series with zero constant term) yields . Expanding, , and in degree only the factors with contribute, so equals the sum of over all tuples of nonnegative integers with ; grouping the tuple by the partition with , and using and , gives .
For the transition map that sets to zero sends and , by their finite-rank definitions; hence the rank- identities of step 1.1 are the projections of a single compatible sequence of degree- symmetric polynomials. Therefore in for every , since two compatible sequences with equal projections are equal by [F1].
Let . By definition [F2], and applying step 2.1 to each part gives ; multiplying these finite sums, , the sum over all -tuples of partitions with .
The monomial equals exactly when merging the parts of gives the multiset of parts of , that is, when for every , where ; a -tuple is uniquely recovered from its matrix by listing copies of each in decreasing order, and the further condition records that . Hence the coefficient of in equals , the sum over all matrices with those two properties; and for such a matrix gives , so . Therefore the coefficient of in is , because the sum displayed in the statement counts, for each independently, the assignments of the distinct cycles of length of a fixed permutation of cycle type to the labelled rows with the multiplicities . Since is a -basis of [F4], the coefficient comparison gives in .
For one has , , and the empty product conventions give , while for the single row must receive every cycle, so for every and step 4.1 gives ; combined with step 2.1 this is the stated one-row case for every , including , where both sides equal . The general identity of the statement now follows from step 4.1 in all cases, with the empty partition handled by the computation just given.
Depends on
- The stable graded ring of symmetric functions
- Elementary and complete families freely generate the stable ring
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
- Power sums form a rational but not integral stable basis
- Partitions, English diagrams, and conjugation
- Power sums are orthogonal for the Hall form
Used by
- Outer induction is not the Kronecker product Counterexample
- Sign twist conjugates the (3,1) character of S₄ Example
- The Frobenius characteristic dictionary for S₃ Example
- The characteristic of a Young permutation character is complete homogeneous Lemma
- The characteristic of a Specht character is a Schur function Theorem
Dependency tree · two levels
17 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
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I (2.14′) and §7 (standard reference, not scraped)
- G. D. James, The Representation Theory of the Symmetric Groups, §6 (standard reference, not scraped)