Determining the character table of a finite group
This is a survey article related to:linear representation theory
View other survey articles about linear representation theory
- The article focuses on constructing the character table even in the absence of complete information about the group -- for instance, if only some basic facts are known about the group, but its entire multiplication table and subgroup structure are unclear.
- The article includes methods to construct characters without knowing the linear representations they come from.
- Many of these methods work over fields of prime characteristic, where the prime does not divide the order of the group, as long as the field is a splitting field for the group.
- 1 Related survey articles
- 2 Writing the character table
- 3 Linear characters
- 4 Using existing characters to find more characters
- 5 Finding all the degrees
- 6 Making progress with filling the character table
Related survey articles
- Finding linear representations of a group
- Using the character table to find group-theoretic invariants
Writing the character table
The character table is a square matrix where the columns are indexed by conjugacy classes and the rows are indexed by representations. If the structure of the group is clearly understood, then the columns can easily be specified, which means that we know the number of rows as well as the number of columns. For later computations, it is also important to know the size of each conjugacy class.
By default, the left-most column is chosen for the conjugacy class of the identity element.
Linear characters are one-dimensional representations, or equivalently, characters of one-dimensional representations. These are homomorphisms from the group to the multiplicative group of the complex numbers. By obvious considerations, the image of a linear character is a cyclic group.
The principal character
The principal character, or trivial character, sends every element to the identity matrix of degree one. This is typically written in the first row, so the first row is all s.
Other linear characters
To determine other linear characters, we need to know what the abelianization of the group is. Let's first discuss the special case where is a cyclic group.
If is cyclic of order , then the linear characters of are given by maps sending the generator of to various roots of unity. There are such maps (one of which corresponds to the principal character). Suppose we write as . Then, the map sends to the complex number .
If is a finite abelian group, then by the classification of finite abelian groups, is a direct product of cyclic groups. The linear characters of are all possible products of linear characters of each of the direct factors for any chosen direct decomposition of .
If is not abelian, the linear characters of are precisely the linear characters of the abelianization of , i.e., the quotient of by its commutator subgroup . For every linear character of , the corresponding linear character of sends every element of to the value of the linear character on its coset for the subgroup .
Using existing characters to find more characters
The number of linear characters equals the index of the commutator subgroup, or the order of the abelianization. This is less than the total number of conjugacy classes if the group is non-abelian, so there exist more characters. Here ,we discuss a few methods to find more characters using existing ones.
Getting off the ground: finding a character of degree two or higher
Further information: Finding linear representations of a group
Determining whether a group has a character of degree two is equivalent to determining whether it has a quotient group that is isomorphic to a subgroup of . For this, it is useful to consider the classification of finite subgroups of U(2,C), and then check whether any of the quotients of the group is one of these.
Other methods include using some natural action that we know the group comes equipped with to obtain an irreducible representation.
Multiplying characters with linear characters
The product of an irreducible character with a linear character again yields an irreducible character of the same degree. The new character need not be distinct from the old character, but it often is.
Using outer automorphisms
Another way of getting new characters from existing ones is to use the outer automorphisms of a group that are not class-preserving. If is an automorphism of a group , and is an irreducible character, is also irreducible. Further, if is not class-preserving, it is possible that is distinct from .
More generally, if a character has kernel (the kernel can be determined as the union of all conjugacy classes where the character value equals that at the identity matrix) any automorphism of the quotient group can be used.
Multiplying two characters
The product of the characters of two (not necessarily distinct) linear representations is the character of a linear representation: the tensor product of the original representations. However, the tensor product of irreducible linear representations is not in general irreducible.
Nonetheless, since taking the product of two characters gives us a new (not necessarily irreducible) character, we can use techniques discussed later for decomposing characters to find irreducible constituents of this character that are not already in the table.
Finding all the degrees
Further information: Degrees of irreducible representations
The degree of an irreducible representation is its dimension, which is also the character value at the identity. In particular, the first column of the character table lists the degrees of irreducible representations. There are very strong constraints on these degrees, such as:
- Sum of squares of degree of irreducible representations equals order of group
- Degree of irreducible representation divides index of abelian normal subgroup (in particular, degree of irreducible representation divides order of group
- Order of inner automorphism group bounds square of degree of irreducible representation
In particular, if we know that there exists an abelian normal subgroup of large order, we get strong constraints on the degree. Even in the absence of this, the sum of squares condition is fairly strong, combined with the fact that we already know that the number of times occurs is the order of the abelianization.
Suppose is a non-abelian group of order . From some elementary group theory, we can deduce that:
- The center of has order : It is nontrivial because prime power order implies not centerless, and it cannot have order because then the quotient would be cyclic, and cyclic over central implies abelian.
- The quotient of by its center is abelian, so the commutator subgroup is contained in the center. Hence, the commutator subgroup also has order and the abelianization has order .
- has an abelian normal subgroup of order : Any subgroup of order is normal (nilpotent implies every maximal subgroup is normal) and any group of order is abelian. Finally, subgroups of order do exist.
Thus, from the general facts, has irreducible representations of degree one, and all the remaining irreducible representations must have degree . Suppose there are representations of degree . Then:
This solves to . Thus, there are irreducible representations of degree one and irreducible representations of degree .
We were able to deduce all this without even knowing uniquely up to isomorphism. In fact, for all primes , there are two isomorphism classes of such groups. For , there are dihedral group:D8 and quaternion group, and for odd , there is prime-cube order group:U3p and prime-cube order group:p2byp.
As another example, suppose is a group of order whose center has order , and whose commutator subgroup has order . Then, any degree of an irreducible representation must divide , and its square cannot be greater than . This leads to the possibilities for degrees of irreducible representations. Further, there are exactly two irreducible representations of degree one, since the abelianization has order two. Thus, the remaining degrees are . Suppose there are representations of degree . We get:
This has two solutions: and .
If we know the number of conjugacy classes in , we can determine which of these cases occur.
Notice how we made so many deductions based on very limited information about the group.
Making progress with filling the character table
If a substantial portion of the character table has been filled in, we can use the orthogonality relations as well as facts about rationality and realization. Some of the tools are described here.
Using a linear representation we know that is not irreducible
Given a linear representation with character , we can use the orthogonal projection formula to find out how many times each of the irreducible characters we already have occurs in . Subtracting these off gives a character that is a sum of irreducible characters all of which are unknown at present. Next, we can calculate the norm of the (modified) character , i.e., we compute:
The first sum is over all group elements and the second sum is over conjugacy classes. Computing this sum requires us to known the sizes of the conjugacy classes.
This number is the sum of squares of the multiplicity of each of 's irreducible constituents occurs in it. In other words, if we have:
where the are irreducible, then the above norm is:
Again, the are integers, so we can usually determine what kind of irreducible constituents has and to what multiplicity. If itself is irreducible we are done. Otherwise, we might be able to use the above information to guess the irreducible constituents.
Using the orthogonality relations
If any one column is complete (e.g., the left-most column, which records the degrees) and another column has only one entry missing, we can use the column orthogonality theorem to deduce the missing entry. Similarly, if any one row is complete (which is always the case -- we have the principal character giving the first row) and another row has only one entry missing, we can fill in that entry. (For applying row orthogonality we need to know the sizes of the conjugacy classes).
More generally, if we have filled rows, we can fill in missing entries from any other row. We can often fill in missing entries, because we also have the condition of norm one. The analogous statement holds for columns.
Using the kernel and center to determine values on other conjugacy classes using values on a few
If are in distinct conjugacy classes, and the ratio is in the center, and the character value at that central element is where is the degree of the representation, then .
Also, any element for which equals the degree must be in the kernel, and any element for which the ratio of and the degree is on the unit circle must map to a scalar matrix. Thus, we get the more general version:
If is of degree and is a root of unity , then .
Characters are cyclotomic integers, i.e., the values they take are sums of roots of unity. For groups of particular kinds, the rots of unity that we're allowed to consider are severely restricted.
For instance, an ambivalent group is a group for which every element is conjugate to its inverse. In an ambivalent group, every character is real-valued. A rational group is a group for which any two elements that generate the same cyclic subgroup are conjugate. In a rational group, every character is rational-valued, and thus, integer-valued. Examples of rational groups include symmetric groups, dihedral group:D8, and the quaternion group.
These rationality considerations place constraints on character values that we may be able to use to pinpoint them.