Frobenius determinant theorem

From testwiki
Jump to navigation Jump to search

In mathematics, the Frobenius determinant theorem states that if one takes the multiplication table of a finite group G and replaces each entry g with a variable xg, and subsequently takes the determinant, then the resulting multivariable polynomial factors as a product of n irreducible polynomials, where n is the number of conjugacy classes of G. Moreover, in the factorization, each of these irreducibles appears raised to a power equal to its degree.

This was first stated as a conjecture in a letter of 1896 by the mathematician Richard Dedekind to F. G. Frobenius, who proved it by methods which began a new branch of mathematics, the representation theory of finite groups.[1] See Template:Harv, with English translation Template:Harv.

Formal statement

Let a finite group G have elements g1,g2,…,gn, and let xgi be associated with each element of G. Define the matrix XG with entries aij=xgigj. Then:

det⁡XG=∏j=1rPj(xg1,xg2,…,xgn)deg⁡Pj

where the Pj's are pairwise non-proportional irreducible polynomials and r is the number of conjugacy classes of G.[2]

Examples

If G=ℤ/2ℤ={e,g} with g2=e with n = 2 conjugacy classes, the matrix would be:

XG=[xexgxgxe].

The determinant of this matrix has n = 2 irreducible factors of degree 1, each with multiplicity 1:

det⁡XG=(xe−xg)(xe+xg).

If G=S3, the symmetric group of order 3, the matrix would be:

XG=[xex(12)x(23)x(31)x(123)x(321)x(12)xex(321)x(123)x(31)x(23)x(23)x(123)xex(321)x(12)x(31)x(31)x(321)x(123)xex(23)x(12)x(123)x(23)x(31)x(12)x(321)xex(321)x(31)x(12)x(23)xex(123)].

The determinant of this matrix factors out as:

det⁡XG=(∑σ∈S3xσ)(∑σ∈S3sign(σ)xσ)(F(xe,x(123),x(321))−F(x(12),x(23),x(31)))2

where F(a,b,c)=a2+b2+c2−ab−bc−ca. The number of irreducible polynomial factors is three, which is equal to the number of conjugacy classes of S3. The degree-2 polynomial factor has multiplicity 2.[3]

Proof

This proof is based on the one given by Evan Chen, which involves representation theory.[3] It relies on the following lemma:

Template:Math theorem

Let V=(V,ρ)=ℂ[G] be the regular representation of group G. Consider the linear map:

T=∑g∈Gxgρ(g),

whose matrix is given by XG. We wish to examine det⁡T.

By Maschke's theorem, ℂ[G] is a semisimple algebra, so it is possible to break down V into a direct sum of irreducible representations,

V=⨁i=1rVi⊕dim⁡Vi

where each Vi is an irreducible representation of V. This lets us write:

det⁡T=∏i=1r(det⁡(T|Vi))dim⁡Vi,

where each det⁡(T|Vi) is a polynomial factor of det⁡T.

A result from character theory states that the number of nonisomorphic irreps of regular representation V equals the number of conjugacy classes of G. This explains why the number of polynomial factors is equal to the number of conjugacy classes.

Furthermore, dim⁡Vi is both the degree and multiplicity of the polynomial det⁡(T|Vi), which explains why the degree and multiplicity of each polynomial factor are equal.

To complete the proof, we wish to show that polynomials det⁡(T|Vi) are irreducible and not proportional to each other.

Proof of irreducibility: By Jacobson density theorem, for any matrix M∈Mat(Vi), there exists a particular choice of complex numbers for each xg∈G such that:

M=∑g∈Gxgρi(g)=T|Vi({xg})

This shows that T|Vi, when viewed as a matrix with polynomial entries, must have linearly independent entries. Thus, by letting each of these entries be an independent variable yij, it follows by Lemma above that det⁡T|Vi is an irreducible polynomial.

Proof of non-proportionality: This follows by noticing that we can read off the character χVi from the coefficients of det⁡T|Vi, using the fact that for all g∈G, the coefficient of xgx1Gk−1 in det⁡T|Vi is equal to χVi(g). Since characters are linearly independent to each other, it follows that det⁡T|Vi is not proportional to any other polynomial factor.

References

Template:Reflist