Interpolating symmetric functions

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last update: 21 July 2012

Interpolating symmetric functions

Define qr( Xn;q,t ) = qr( x1,...,xn;q,t ) by the generating function ∏i=1n 1-xitz 1-xiqz = (q-t) ∑r≥0 qr( x1,...,xn;q,t ) zr. Note that with this definition q0 = 1(q-t). Define the elementary symmetric functions, the complete symmetric functions and the power symmetric functions by the formulas (-t)r-1 er(Xn) = qr( Xn;0,t ), qr-1 hr(Xn) = qr( Xn;q,0 ), and qr-1 pr(Xn) = qr( Xn;q,q ), respectively. (ISF 1) The elementary symmetric functions have special importance because of the following ways in which they appear naturally.

  1. If f(t) is a polynomial in t with roots γ1,...,γn then the coefficient of  tr  in   f(t)   is   (-1)n-r er( γ1,...,γn ). (ISF 2)
  2. If A is an n×n matrix with entries in 𝔽 with eigenvalues γ1,...,γn then the trace of the action of A on the rth exterior power of the vector space 𝔽n is tr( A, ⋀r𝔽n ) = er( γ1,...,γn ), so that Tr(A) = e1( γ1,...,γn ), and det(A) = en(γ1,...,γn), (ISF 3) and the characteristic polynomial of A is chart(A) = ∑r=0n (-1)n-r en-r( γ1,...,γn ) tr. (ISF 4)

Expanding 1-xitz 1-xiqz = 1+(q-t) ∑l>0 ql-1 xilzl and multiplying out ∏i=1n 1-xitz 1-xiqz = 1-x1tz 1-x1qz ⋯ 1-xntz 1-xnqz gives qr = ∑ 1≤i1 ≤⋯≤ ir≤n (q-t) Card( {j | ij<ij+1} ) q Card( {j | ij=ij+1} ) xi1 xi2 ⋯ xir, (ISF 5) from which it follows that qr = ∑λ⊢r (q-t) l(λ)-1 q r-l(λ) mλ( x1,...,xn ). For an n×n matrix a=(aij) with entries from ℤ≥0 let xa = ∏i=1n (xi)aij, and wt(a) = q |λ|-l(a) (q-t) l(a)-l(λ) , where l(a) is the number of nonzero entries in a, l(λ) is the number of nonzero entries in λ, and |λ| is the sum of the entries of λ. Define rs(a) = ( ρ1,...,ρn ), cs(a) = ( γ1,...,γn ), where ρi = ∑j=1laij and γj = ∑i=1naij, so that rs(a) and cs(a) are the sequences of row sums and column sums of a, respectively.

For a sequence of nonnegative integers λ = (λ1,...,λl) define qλ( Xn;q,t ) = qλ1( Xn;q,t ) ⋅ qλ2( Xn;q,t ) ⋅⋯⋅ qλl( Xn;q,t ). Then qλ = ∑μ aλμ (q,t) mμ, where aλμ (q,t) = ∑ a∈Aλμ wt(a), and the sum is over partitions μ such that |μ| = |λ|.

Proof.
If λ = (λ1,...,λl) then qλ = ∏j=1lqλj = ∑ rs(a)=λ wt(a)xa = ∑γ∈ ℤ≥0n ∑ rs(a)=λ cs(a)=γ wt(a)xγ = ∑μ aλμ (q,t) mμ.

□

Multiplying out ∏i=1n 1-xitz 1-xiqz = 1 1-x1qz ⋅ 1 1-x2qz ⋅⋯⋅ 1 1-xnqz ( 1-xntz ) ( 1-xn-1tz ) ⋅⋯⋅ ( 1-x1tz ) gives qr = ∑ i1≤i2 ≤⋯≤ik >ik+1 >⋯>ir qk-1 (-t)r-k xi1 ⋯ xik xik+1 ⋯ xir. (ISF 6) The bijection ???? between sequences i1≤i2 ≤⋯≤ik >ik+1 >⋯>ir and column strict tableaux of shape (k1r-k) yields qr = ∑k=1r (-t)r-k qk-1 s(k1r-k) (Xn). (ISF 7)

For each positive integer k define [k]q,t = qk-tk q-t = qk-1 + tqk-2 +⋯+ tk-2q + tk-1.

Comparing coefficients of zr on each side of ( ∏i=1n 1-xisz 1-xitz ) ( ∏i=1n 1-xitz 1-xiqz ) = ∏i=1n 1-xisz 1-xiqz gives (t-s) qr(Xn;t,s) + (q-t) (t-s) ( ∑j=1r-1 qj( Xn;q,t ) qr-j( Xn;t,s ) ) + (q-t) qr( Xn;q,t ) = (q-s) qr( Xn;qs ). (ISF 8)

Example. Putting s=0,  q=0 and t=0 in (???) yield, respectively, qr( Xn;q,t ) + ( ∑j=1r-1 hj(Xn) tj qr-j( Xn;q,t ) ) - hr(Xn) [r]q,t = 0 qr( Xn;q,t ) + ( ∑j=1r-1 ej(Xn) (-q)j qr-j( Xn;q,t ) ) + (-1)r er(Xn) [r]q,t = 0 ∑j=0r (-t)r-j [j]q,t hj(Xn) er-j(Xn) = (q-t) qr( Xn;q,t ). Then putting ????? (???) gives rqr( Xn;q,t ) - ( ∑j=1r-1 pj(Xn) ( qj-tj ) qr-j( Xn;q,t ) ) - pr(Xn) [r]q,t = 0, and the Newton identities khk = ∑i=1k pihk-i and kek = ∑i=1k (-1)i-1piek-i, are obtained by putting ??? in (???).

Let λ = (λ1,...,λn) be a partition. Then

  1. eλ′ = ∑μ≤λ aλ′μmμ, where aλμ is the number of matrices with entries from {0,1} with row sums λ′ and column sums μ.
  2. aλ′λ = 1 and aλ′μ = 0 unless μ≤λ.
  3. {eλ | l(λ′)≤n} is a ℤ-basis of ℤ[Xn]Sn.
  4. ℤ[x1,...,xn]Sn = ℤ[e1,...,en] = ℤ[h1,...,hn] and ℚ[x1,...,xn]Sn = ℚ[p1,...,pn].
  5. The set {hλ | l(λ′)≤n} is a basis of ℤ[Xn]Sn.

Proof.
  1. Follows by putting q=0 in (???).
  2. Since there is a unique matrix A with rs(A)=λ′ and cs(A)=λ, aλ′λ = 1. If A is a 0, 1 matrix with rs(A)=λ′ and cs(A)=μ then μ1+⋯+μi ≤ λ1+⋯+λi since there are at most λ1+⋯+λi nonzero entries in the first i columns of A. Thus aλ′μ = 0 unless μ≤λ.
  3. This is a consequence of (b) and the fact that {mλ | l(λ)≤n} is a basis of ℤ[Xn]Sn.
  4. The first equality is an immediate consequence of (c). The second equality follows from the identity (???), which allows one to, inductively, expand hr in terms of er,er-1,...,e1. Similarly, the third equality follows from the Newton identity (???) which allows one to, inductively, expand pr in terms of er,er-1,...,e1 (with coefficients in ℚ).

□

  1. There is an involutive automorphism ω of ℤ[Xn]Sn defined by ω: ℤ[Xn]Sn → ℤ[Xn]Sn ek ↦ hk .
  2. ω( qr(Xn;q,t) ) = qr(Xn;-t,-q) and ω(pk) = (-1)k-1pk.

Proof.
  1. The map ω is a well defined ring homomorphism since ℤ[Xn]Sn = ℤ[e1,...,en] is a polynomial ring. Comparing coefficients of zk on each side of 1 = ( ∏i=1n (1-xiz) ) ( ∏i=1n 1 1-xiz ) yields 0 = ∑r=1k (-1)r erhn-r. Thus e1=h1, and hk = ∑i=1k(-1) eihk-i and ek = (-1)-k ∑i=0k(-1) eihk-i = ∑j=1k (-1)-j-1 ek-j hj. (ISF 9) From the first of these relations, by induction on k, ω(hk) = ∑i=1k (-1)i+1 hiek-i, and, by comparing this identity with the second relation in (???) shows that ω(hk) = ek. Hence ω2=id.
  2. ????

□

For a partition λ = ( 1m1 2m2 ⋯ ) of k define zλ = 1m1 m1! 2m2 m2! ⋯ so that n! zλ = Card( {w∈Sk | w has cycle type λ} ) (ISF 10) is the size of the conjugacy class indexed by λ in the symmetric group Sk. Recalling that ln( 1-xiyj ) = ∑k≥1 xikyjk k since ln(1-t) = ∫11-tdt = ∫( 1+t+t2+⋯ )dt, we have ∏i,j 1 1-xiyj = expln( ∏i,j 1 1-xiyj ) = exp ∑i,j ln( 1-xiyj ) = exp( ∑k∑i,j xikyjk k ) = exp( ∑k pk(x)pk(y) k ) = ∏kexp( pk(x) pk(y) k ) = ∏k ∑mk≥0 ( pkmk(x) pkmk(y) kmkmk! ) = ∑m1,m2,... ( p1m1(x) p2m2(x) ⋯ p1m1(y) p2m2(y) ⋯ 1m1 m1! 2m2 m2! ⋯ ) = ∑λ pλ(x) pλ(y) zλ .

Notes and References

[Mac] I.G. Macdonald, Symmetric functions and Hall polynomials, Second edition, Oxford University Press, 1995.

page history