Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 ΛQ=Q⊗ZΛ. For a partition ρ write mi(ρ):=#{j:ρj=i} and zρ:=∏i≥1imi(ρ)mi(ρ)! (Partitions, English diagrams, and conjugation, Power sums pk and complete homogeneous symmetric polynomials hk).

For partitions λ and ρ of the same integer, let N(λ,ρ) be the number of ways to distribute the cycles of a permutation w of cycle type ρ among the ℓ(λ) rows, labelled 1,…,ℓ(λ), so that row j receives cycles whose lengths sum to λj. Cycles of equal length count as distinct here, because they are distinct cycles of w; equivalently,

N(λ,ρ)=∑(mi(j)) ∏i≥1mi(ρ)!∏jmi(j)!,

the sum over all matrices (mi(j)) of nonnegative integers with ∑jmi(j)=mi(ρ) for every i and ∑ii mi(j)=λj for every j; each summand is the product over i of the number of ways to assign the mi(ρ) labelled cycles of length i to rows with the prescribed multiplicities mi(j), so N(λ,ρ) is a nonnegative integer. Then

hλ=∑ρ⊢∣λ∣N(λ,ρ) pρzρin ΛQ.

In particular hd=∑ρ⊢dpρ/zρ for every d≥0.

Facts & Assumptions

Given: Partitions λ and ρ of the same integer n, with λ=(λ1,…,λk) and ρ⊢n.

[F1]

Λ=⨁d≥0Λd, where an element of Λd is a compatible sequence of degree-d symmetric polynomials in N variables whose transition maps set the last variables to zero, and multiplication is coordinatewise polynomial multiplication (The stable graded ring of symmetric functions).

[F2]

For every d≥0 the family {hμ:μ⊢d} is a Z-basis of Λd, where hμ:=∏ihμi and h∅=1 (Elementary and complete families freely generate the stable ring).

[F3]

For k≥1 the stable power sum pk∈Λk is the compatible sequence of the finite power sums pk(x1,…,xN)=x1k+⋯+xNk, and for a partition μ one sets pμ:=∏ipμi, with p∅=1; likewise hk(x1,…,xN)=∑a1+⋯+aN=kx1a1⋯xNaN (Power sums pk and complete homogeneous symmetric polynomials hk).

[F4]

For every d≥0 the family {pμ:μ⊢d} is a Q-basis of ΛQd=Q⊗ZΛd (Power sums form a rational but not integral stable basis).

[F5]

A partition of n is a weakly decreasing finite sequence of positive integers with sum n; the empty partition ∅ is the only partition of 0, and mi(μ) denotes the number of parts of μ equal to i (Partitions, English diagrams, and conjugation).

Proof

technique · direct
1.1F3algebra

Fix a rank N≥0, work in Q[x1,…,xN][ ⁣[t] ⁣], and write hd(N):=hd(x1,…,xN) and pk(N):=pk(x1,…,xN) for the rank-N specializations. The coefficient of td in ∏i=1N(1−xit)−1 is ∑a1+⋯+aN=dx1a1⋯xNaN=hd(N), so ∑d≥0hd(N)td=∏i=1N(1−xit)−1; taking the formal logarithm gives log⁡∏i=1N(1−xit)−1=∑i=1N∑k≥1xiktk/k=∑k≥1pk(N)tk/k, and applying the formal exponential (with exp⁡(log⁡U)=U for U∈1+tQ[x1,…,xN][ ⁣[t] ⁣] and exp⁡(A+B)=exp⁡(A)exp⁡(B) for series A,B with zero constant term) yields ∏i=1N(1−xit)−1=exp⁡(∑k≥1pk(N)tk/k). Expanding, exp⁡(∑k≥1pk(N)tk/k)=∏k≥1exp⁡(pk(N)tk/k), and in degree td only the factors with k≤d contribute, so hd(N) equals the sum of ∏k≥1(pk(N))mk/(kmkmk!) over all tuples (mk)k≥1 of nonnegative integers with ∑kkmk=d; grouping the tuple by the partition ρ with mk(ρ)=mk, and using ∏kpkmk=pρ and ∏kkmkmk!=zρ, gives hd(N)=∑ρ⊢dpρ(N)/zρ.

2.1F1F3step 1.1

For M≥N the transition map that sets xN+1,…,xM to zero sends hd(M)↦hd(N) and pk(M)↦pk(N), by their finite-rank definitions; hence the rank-N identities of step 1.1 are the projections of a single compatible sequence of degree-d symmetric polynomials. Therefore hd=∑ρ⊢dpρ/zρ in ΛQd for every d≥0, since two compatible sequences with equal projections are equal by [F1].

3.1F2step 2.1algebra

Let λ=(λ1,…,λk)⊢n. By definition hλ=∏j=1khλj [F2], and applying step 2.1 to each part gives hλj=∑ρ(j)⊢λjpρ(j)/zρ(j); multiplying these k finite sums, hλ=∑(ρ(1),…,ρ(k))∏j=1kpρ(j)/zρ(j), the sum over all k-tuples of partitions with ρ(j)⊢λj.

4.1F4F5step 3.1algebra

The monomial ∏jpρ(j) equals pρ exactly when merging the parts of ρ(1),…,ρ(k) gives the multiset of parts of ρ, that is, when ∑jmi(j)=mi(ρ) for every i, where mi(j):=mi(ρ(j)); a k-tuple is uniquely recovered from its matrix (mi(j)) by listing mi(j) copies of each i in decreasing order, and the further condition ∑ii mi(j)=λj records that ρ(j)⊢λj. Hence the coefficient of pρ in hλ equals ∑(mi(j))∏j1/zρ(j), the sum over all matrices with those two properties; and for such a matrix ∑jmi(j)=mi(ρ) gives ∏jimi(j)=imi(ρ), so ∏j1/zρ(j)=(∏imi(ρ)!/∏i,jmi(j)!)/zρ. Therefore the coefficient of pρ in hλ is N(λ,ρ)/zρ, because the sum displayed in the statement counts, for each i independently, the assignments of the mi(ρ) distinct cycles of length i of a fixed permutation of cycle type ρ to the k labelled rows with the multiplicities mi(j). Since {pρ:ρ⊢n} is a Q-basis of ΛQn [F4], the coefficient comparison gives hλ=∑ρ⊢nN(λ,ρ)pρ/zρ in ΛQn.

5.1F2F3step 2.1step 4.1algebra∎

For n=0 one has λ=ρ=∅, k=0, and the empty product conventions give h∅=1=N(∅,∅) p∅/z∅, while for λ=(d) the single row must receive every cycle, so N((d),ρ)=1 for every ρ⊢d and step 4.1 gives hd=∑ρ⊢dpρ/zρ; combined with step 2.1 this is the stated one-row case for every d≥0, including d=0, where both sides equal 1. 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

Used by

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