Molien series

In mathematics, a Molien series is a generating function attached to a linear representation ρ of a group G on a finite-dimensional vector space V. It counts the homogeneous polynomials of a given total degree d that are invariants for G. It is named for Theodor Molien.

Formulation

More formally, there is a vector space of such polynomials, for each given value of d = 0, 1, 2, ..., and we write nd for its vector space dimension, or in other words the number of linearly independent homogeneous invariants of a given degree. In more algebraic terms, take the d-th symmetric power of V, and the representation of G on it arising from ρ. The invariants form the subspace consisting of all vectors fixed by all elements of G, and nd is its dimension.

The Molien series is then by definition the formal power series

M(t) = \sum_d n_d t^d.

This can be looked at another way, by considering the representation of G on the symmetric algebra of V, and then the whole subalgebra R of G-invariants. Then nd is the dimension of the homogeneous part of R of dimension d, when we look at it as graded ring. In this way a Molien series is also a kind of Hilbert function. Without further hypotheses not a great deal can be said, but assuming some conditions of finiteness it is then possible to show that the Molien series is a rational function. The case of finite groups is most often studied.

Formula

Molien showed that

 M(t) = \frac{1}{|G|} \sum_{g\in G} \frac{1}{\det(I-tg)}

This means that the coefficient of td in this series is the dimension nd defined above. It assumes that the characteristic of the field does not divide |G| (but even without this assumption, Molien's formula in the form |G| \cdot M(t) = \sum_{g\in G} \frac{1}{\det(I-tg)} is valid, although it does not help with computing M(t)).

Example

Consider the symmetric group S_3 acting on R3 by permuting the coordinates. We add up the sum by group elements, as follows. Starting with the identity, we have


 \det \begin{pmatrix} 1-t & 0 & 0 \\ 0 & 1-t & 0 \\ 0 & 0 & 1-t \end{pmatrix} = (1-t)^3 .

There is a three-element conjugacy class of S_3, consisting of swaps of two coordinates. This gives three terms of the form


\det \begin{pmatrix} 1 & -t & 0 \\ -t & 1 & 0 \\ 0 & 0 & 1-t \end{pmatrix} = (1-t)(1-t^2).

There is a two-element conjugacy class of cyclic permutations, yielding two terms of the form


 \det \begin{pmatrix} 1 & -t & 0 \\ 0 & 1 & -t \\ -t & 0 & 1 \end{pmatrix} =(1-t^3).

Notice that different elements of the same conjugacy class yield the same determinant. Thus


M(t) = \frac16\left(\frac{1}{(1-t)^3} + \frac3{(1-t)(1-t^2)} + \frac{2}{1-t^3}\right)
= \frac{1}{(1-t)(1-t^2)(1-t^3)}.

On the other hand, we can expand the geometric series and multiply out to get


M(t) = (1 + t + t^2 + t^3 + \ldots)(1+ t^2 + t^4 + \ldots)(1 + t^3 + t^6 + \ldots)
= 1 + t + 2t^2 + 3t^3 + 4t^4 + 4t^5 + 6t^6 + \ldots

The coefficients of the series tell us the number of linearly independent homogeneous polynomials in three variables which are invariant under permutations of the three variables, i.e. the number of independent symmetric polynomials in three variables. In fact, if we consider the elementary symmetric polynomials


\sigma_1 = x + y + z
 \sigma_2 = xy + xz + yz
 \sigma_3 = xyz

we can see for example that in degree 5 there is a basis consisting of  \sigma_3 \sigma_2, \sigma_3 \sigma_1^2, \sigma_2^2 \sigma_1, and  \sigma_1^3 .

(In fact, if you multiply the series out by hand, you can see that the t^k term comes from combinations of t, t^2 and t^3 exactly corresponding to combinations of \sigma_1, \sigma_2 and \sigma_3, also corresponding to partitions of k with 1, 2, and 3 as parts. See also Partition (number theory) and Representation theory of the symmetric group.)


References

This article is issued from Wikipedia - version of the Friday, March 18, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.