Frobenius characteristic map

From HandWiki

In mathematics, especially representation theory and combinatorics, a Frobenius characteristic map is an isometric isomorphism between the ring of characters of symmetric groups and the ring of symmetric functions. It builds a bridge between representation theory of the symmetric groups and algebraic combinatorics. This map makes it possible to study representation problems with help of symmetric functions and vice versa. This map is named after German mathematician Ferdinand Georg Frobenius.

Definition

The ring of characters

Source:[1]

Let Rn be the -module generated by all irreducible characters of Sn over . In particular S0={1} and therefore R0=. The ring of characters is defined to be the direct sumR=n=0Rnwith the following multiplication to make R a graded commutative ring. Given fRn and gRm, the product is defined to befg=indSm×SnSm+n(f×g)with the understanding that Sm×Sn is embedded into Sm+n and ind denotes the induced character.

Frobenius characteristic map

For fRn, the value of the Frobenius characteristic map ch at f, which is also called the Frobenius image of f, is defined to be the polynomial

ch(f)=1n!wSnf(w)pρ(w)=μnzμ1f(μ)pμ.

Remarks

Here, ρ(w) is the partition of integers determined by w. For example, when n=3 and w=(12)(3), ρ(w)=(2,1) corresponds to the partition 3=2+1. Conversely, a partition μ of n (written as μn) determines a conjugacy class Kμ in Sn. For example, given μ=(2,1)3, Kμ={(12)(3),(13)(2),(23)(1)} is a conjugacy class. Hence by abuse of notation f(μ) can be used to denote the value of f on the conjugacy class determined by μ. Note this always makes sense because f is a class function.

Let μ be a partition of n, then pμ is the product of power sum symmetric polynomials determined by μ of n variables. For example, given μ=(3,2), a partition of 5,

pμ(x1,x2,x3,x4,x5)=p3(x1,x2,x3,x4,x5)p2(x1,x2,x3,x4,x5)=(x13+x23+x33+x43+x53)(x12+x22+x32+x42+x52)

Finally, zλ is defined to be n!kλ, where kλ is the cardinality of the conjugacy class Kλ. For example, when λ=(2,1)3, zλ=3!3=2. The second definition of ch(f) can therefore be justified directly:1n!wSnf(w)pρ(w)=μnkμn!f(μ)pμ=μnzμ1f(μ)pμ

Properties

Inner product and isometry

Hall inner product

Source:[2]

The inner product on the ring of symmetric functions is the Hall inner product. It is required that hμ,mλ=δμλ . Here, mλ is a monomial symmetric function and hμ is a product of completely homogeneous symmetric functions. To be precise, let μ=(μ1,μ2,) be a partition of integer, thenhμ=hμ1hμ2.In particular, with respect to this inner product, {pλ} form a orthogonal basis: pλ,pμ=δλμzλ, and the Schur polynomials {sλ} form a orthonormal basis: sλ,sμ=δλμ, where δλμ is the Kronecker delta.

Inner product of characters

Let f,gRn, their inner product is defined to be[3]

f,gn=1n!wSnf(w)g(w)=μnzμ1f(μ)g(μ)If f=nfn,g=ngn, then

f,g=nfn,gnn

Frobenius characteristic map as an isometry

One can prove that the Frobenius characteristic map is an isometry by explicit computation. To show this, it suffices to assume that f,gRn:ch(f),ch(g)=μnzμ1f(μ)pμ,λnzλ1g(λ)pλ=μ,λnzμ1zλ1f(μ)g(μ)pμ,pλ=μ,λnzμ1zλ1f(μ)g(μ)zμδμλ=μnzμ1f(μ)g(μ)=f,g

Ring isomorphism

The map ch is an isomorphism between R and the -ring Λ. The fact that this map is a ring homomorphism can be shown by Frobenius reciprocity.[4] For fRn and gRm,ch(fg)=indSn×SmSm+n(f×g),ψm+n=f×g,resSn×SmSm+nψ=1n!m!πσSn×Sm(f×g)(πσ)pρ(πσ)=1n!m!πSn,σSmf(π)g(σ)pρ(π)pρ(σ)=[1n!πSnf(π)pρ(π)][1m!σSmg(σ)pρ(σ)]=ch(f)ch(g)

Defining ψ:SnΛn by ψ(w)=pρ(w), the Frobenius characteristic map can be written in a shorter form:

ch(f)=f,ψn,fRn.

In particular, if f is an irreducible representation, then ch(f) is a Schur polynomial of n variables. It follows that ch maps an orthonormal basis of R to an orthonormal basis of Λ. Therefore it is an isomorphism.

Example

Computing the Frobenius image

Let f be the alternating representation of S3, which is defined by f(σ)v=sgn(σ)v, where sgn(σ) is the sign of the permutation σ. There are three conjugacy classes of S3, which can be represented by e (identity or the product of three 1-cycles), (12)(transpositions or the products of one 2-cycle and one 1-cycle) and (123) (3-cycles). These three conjugacy classes therefore correspond to three partitions of 3 given by (1,1,1), (2,1), (3). The values of f on these three classes are 1,1,1 respectively. Therefore:ch(f)=z(1,1,1)1f((1,1,1))p(1,1,1)+z(2,1)f((2,1))p(2,1)+z(3)1f((3))p(3)=16(x1+x2+x3)312(x12+x22+x32)(x1+x2+x3)+13(x13+x23+x33)=x1x2x3Since f is an irreducible representation (which can be shown by computing its characters), the computation above gives the Schur polynomial of three variables corresponding to the partition 3=1+1+1.

References

  1. MacDonald, Ian Grant (2015). Symmetric functions and Hall polynomials. Oxford University Press; 2nd edition. pp. 112. ISBN 9780198739128. 
  2. Macdonald, Ian Grant (2015) (in English). Symmetric functions and Hall polynomials. Oxford University Press; 2nd edition. pp. 63. ISBN 9780198739128. 
  3. Stanley, Richard (1999). Enumerative Combinatorics: Volume 2 (Cambridge Studies in Advanced Mathematics Book 62). Cambridge University Press. pp. 349. ISBN 9780521789875. 
  4. Stanley, Richard (1999) (in English). Enumerative Combinatorics: Volume 2 (Cambridge Studies in Advanced Mathematics Book 62). Cambridge University Press. pp. 352. ISBN 9780521789875.