Frobenius characteristic map explained

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

R ^{n} be the Z -module generated by all irreducible characters of S _{n} over C . In particular S _{0=\{1\}} and therefore R ^{0=Z} . The ring of characters is defined to be the direct sum$$R=\backslash bigoplus\_^R^n$$with the following multiplication to make R a graded commutative ring. Given f \in R ^{n} and g \in R ^{m} , the product is defined to be$$f\; \backslash cdot\; g\; =\; \backslash operatorname\_^(f\; \backslash times\; g)$$with the understanding that S _{m} x S _{n} is embedded into S _{m+n} and \operatorname{ind} denotes the induced character.

Frobenius characteristic map

For

f \in R ^{n} , the value of the Frobenius characteristic map \operatorname{ch} at f , which is also called the Frobenius image of f , is defined to be the polynomial

$$\backslash operatorname(f)=\backslash frac\backslash sum\_f(w)p\_=\backslash sum\_z\_\backslash mu^f(\backslash mu)p\_\backslash mu.$$

Remarks

Here,

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

Let

\mu be a partition of n , then p _{\mu} is the product of power sum symmetric polynomials determined by \mu of n variables. For example, given \mu = ( 3 , 2 ) , a partition of 5 ,\begin{aligned} p _{\mu(x} _{1,x} _{2,x} _{3,x} _{4,x} _{5)&=p} _{3(x} _{1,x} _{2,x} _{3,x} _{4,x} _{5)p} _{2(x} _{1,x} _{2,x} _{3,x} _{4,x} _{5)} \\ & = (x ^{2 ) \end{aligned}} _{5}

Finally,

z _{λ} is defined to be (n!)/(k _{λ}) , where k _{λ} is the cardinality of the conjugacy class K _{λ} . For example, when λ = ( 2 , 1 )\vdash 3 , z _{λ} = (3 !)/(3) =2 . The second definition of \operatorname{ch}(f) can therefore be justified directly:$$\backslash frac\backslash sum\_f(w)p\_\; =\; \backslash sum\_\backslash fracf(\backslash mu)p\_\backslash mu\; =\; \backslash sum\_z\_\backslash mu^f(\backslash mu)p\_\backslash mu$$

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 $\backslash langle\; h\_\backslash mu,m\_\backslash lambda\; \backslash rangle\; =\; \backslash delta\_$ . Here,

m _{λ} is a monomial symmetric function and h _{\mu} is a product of completely homogeneous symmetric functions. To be precise, let \mu = (\mu _{1,\mu} _{2, … )} be a partition of integer, then$$h\_\backslash mu=h\_h\_\backslash cdots.$$In particular, with respect to this inner product, \{p _{λ\}} form a orthogonal basis: $\backslash langle\; p\_\backslash lambda,p\_\backslash mu\; \backslash rangle\; =\; \backslash delta\_z\_\backslash lambda$, and the Schur polynomials \{s _{λ\}} form a orthonormal basis: $\backslash langle\; s\_\backslash lambda,s\_\backslash mu\; \backslash rangle\; =\; \backslash delta\_$, where \delta _{λ\mu} is the Kronecker delta.

Inner product of characters

Let

f,g \in R ^{n} , their inner product is defined to be^[3]

$$\backslash langle\; f,\; g\; \backslash rangle\_n\; =\; \backslash frac\backslash sum\_f(w)g(w)\; =\; \backslash sum\_z\_\backslash mu^f(\backslash mu)g(\backslash mu)$$If

f = \sum _{n} f _{n,g} = \sum _{n} g _{n} , then

$$\backslash langle\; f,g\; \backslash rangle\; =\; \backslash sum\_n\; \backslash langle\; f\_n,\; g\_n\; \backslash rangle\_n$$

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,g \in R ^{n} :

Ring isomorphism

The map

\operatorname{ch} is an isomorphism between R and the Z -ring Λ . The fact that this map is a ring homomorphism can be shown by Frobenius reciprocity.^[4] For f \in R ^{n} and g \in R ^{m} ,

\end

Defining

\psi:S _{n} \to Λ ^{n} by \psi(w) = p _{\rho(w)} , the Frobenius characteristic map can be written in a shorter form:

$$\backslash operatorname(f)=\backslash langle\; f,\; \backslash psi\; \backslash rangle\_n,\; \backslash quad\; f\; \backslash in\; R^n.$$

In particular, if

f is an irreducible representation, then \operatorname{ch}(f) is a Schur polynomial of n variables. It follows that \operatorname{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 S _{3} , which is defined by f(\sigma)v =sgn (\sigma)v , where sgn (\sigma) is the sign of the permutation \sigma . There are three conjugacy classes of S _{3} , 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:Since 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 .

Notes and References

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