MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Obvious necessary condition is that the center must be a cyclic group. Is it sufficient (doubt here)? If not, is there any nice characterization in terms of group structure, without appealing to representations?

share|cite|improve this question
I'm assuming that "exact" here means "faithful" (representation has trivial kernel). For finite $p$-groups, it's a standard fact that having a faithful irreducible representation is equivalent to having a cyclic center. I'm not sure about the general case, but it's been discussed in many books and papers. My impression is that there is no known definitive structural condition for sufficiency. – Jim Humphreys Mar 2 '11 at 16:52
Thank you! I've edited the question. – Fedor Petrov Mar 2 '11 at 16:55
P.S. It's also important here to specify the field or its characteristic, since that affects such existence questions. – Jim Humphreys Mar 2 '11 at 17:01
I thought about complex numbers, but other fields are of interest too. – Fedor Petrov Mar 2 '11 at 18:25
up vote 17 down vote accepted

A finite abelian group has a faithful irreducible representation if and only if it is cyclic. The case of finite groups was solved by Gaschütz in

W. Gaschütz, Endliche Gruppen mit treuen absolut-irreduziblen Darstellungen. Math. Nach. 12 (1954)

From Mathematical Reviews:

"In the present formulation the author calls the direct product $$ S= M_1\times M_2\times\cdots\times M_t $$ of the minimal normal subgroups $M_i$ of $G$ the `base' of $ G$, and writes $S=A\times H$, where $A$ is abelian and $H$ contains no normal abelian subgroup. The condition is as follows: a finite group $G$ has a faithful irreducible representation in an algebraically closed field of characteristic zero if and only if the base $S$ (or alternatively, $A$) of $G$ is generated by a single class of conjugates in $G$. The proof is based on an elegant application of the exclusion principle."

Maybe you also want to look at

Bekka, Bachir; de la Harpe, Pierre, Irreducibly represented groups. Comment. Math. Helv. 83 (2008), no. 4, 847–868

where the case of infinite groups and unitary representations on Hilbert spaces was studied. One of the main results of the paper is the following:

Theorem: A countable group $G$ is irreducibly represented, if one of the following conditions hold:

  1. $G$ is torsion-free
  2. $G$ is icc; this means the all non-trivial conjugacy classes are infinite,
  3. $G$ has a faithful primitive action on an infinite set.
share|cite|improve this answer
The result of Gaschütz can be found also in Huppert's character theory book, Theorem 42.7. – Steve D Mar 2 '11 at 19:41
+1 Interesting! – Marc Palm Apr 12 '11 at 13:59
The subgroup generated by all the minimal normal subgroups is not the direct product of all of them, but of some of them (see Huppert's book, theorem 42.9). – Sébastien Palcoux Jan 29 at 14:19

I thought I'd add a specific example of a finite group with cyclic centre (trivial, in fact), yet no faithful irreducible complex representation (the example is from problem 2.19 of Isaacs' Character theory of finite groups, MR460423).

The group $(C_2)^4\rtimes C_3$, where $C_n$ denotes the cyclic group of order $n$ and $C_3=\langle \sigma\rangle$ acts on $(C_2)^4=\langle \tau_1,\tau_2,\tau_3,\tau_4\rangle$ via

$$\begin{align*} \sigma\cdot\tau_1=\tau_2 \hspace{0.5in}&\sigma\cdot\tau_2=\tau_1\tau_2 \newline \sigma\cdot\tau_3=\tau_4 \hspace{0.5in}&\sigma\cdot\tau_4=\tau_3\tau_4. \end{align*}$$

share|cite|improve this answer
A handy sufficient condition is this: $G$ has a faithful irreducible complex representation if each Sylow subgroup of $G$ has a cyclic center. – Marty Isaacs Jan 29 '12 at 20:35

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.