## The Kernel of a Character

**Point of post: **In this post we discuss the notion of the kernel of a character in general preparation to prove some pretty serious theorems in pure group theory.

*Motivation*

Despite all the cool things we’ve done with representations, we must not forget that at the end of the day every representation is just a homomorphism between groups. It makes sense then that one of the most natural things to do with a representation is to look at its kernel with respect to its homomorphism qualities. It turns out though that there is a natural way to translate this notion of the kernel of a representation into the notion of the *kernel of a character*. This notion shall be paramount in the theory to come.

*Kernel of a Character*

Let be a finite group and a representation. We define as usual, pursuant to the usual definitions of the kernel of a homomorphism the *kernel* of , denoted as

What is interesting about this whole concept is that there is way to describe in terms of its induced character . Indeed:

**Theorem: ***Let be a finite group and is a representation with induced character . Then,*

**Proof: **Evidently if then and so from where the conclusion follows.

Conversely, suppose that . Note that since is unitary we know by the spectral theorem that is similar to (where and the ‘s are the eigenvalues) with respect to any basis. But, we know by the assumption that

$laetx \text{ }$

and since is unitary we know that for and so it follows then that . Thus, is similar to and thus . Thus, as desired. The conclusion follows.

It makes sense then to define the *kernel *of the character , denoted , by

In particular, we know that for every character one has that . For the irreducible characters we give the special symbols for . What we now show is that knowing for every enables one to know for every character . Indeed:

**Theorem: ***Let be a character with representation as a linear combination of the irreducible characters . Then,*

**Proof: **Clearly if for every such that one sees that

and so .

Conversely, since one evidently has that for every we see that for any one has that

from where it follows from this that must be real and so if for any then this would induce a strict inequality for and . It follows that for every such that . The conclusion follows.

**References:**

1. Isaacs, I. Martin. *Character Theory of Finite Groups*. New York: Academic, 1976. Print.

[…] saw in our last post that there is a particularly fruitful way to produce normal subgroups ofa finite group . Namely, […]

Pingback by Representation Theory: Relation Between the Kernels of Characters and Normal Subgroups « Abstract Nonsense | March 7, 2011 |

[…] previous posts we’ve seen how we can take concepts from plain group theory and attempt to make an analogy […]

Pingback by Representation Theory: The Center of a Character (Pt. I) « Abstract Nonsense | March 9, 2011 |

[…] shall be a numerical array of numbers (a matrix really) which using our past information about the kernel of a character, the center of a character, etc. to shall tell us most of things one may initally like to know […]

Pingback by Representation Theory: Character Tables « Abstract Nonsense | March 21, 2011 |

Hi, Din’t you mean |Re(\lambda)| \le 1? The norm of the eigenvalues of a unitary matrix is always equal to 1.

Comment by Soumyashant Nayak | April 24, 2011 |

Soumyashant Nayak,

Indeed. Thank you for pointing that out!

Best,

Alex Youcis

Comment by Alex Youcis | April 24, 2011 |