Direct product of faithful representations into direct sum

Click For Summary
SUMMARY

The discussion centers on the decomposition of irreducible representations of finite groups, specifically addressing the ability to generate all irreducible representations from a single faithful irreducible representation through direct products. It confirms that while direct products can be decomposed into direct sums, the use of tensor products is more appropriate for generating all irreducible representations, as stated in the Burnside-Molien theorem. Additionally, examples such as the group Z/2Z x Z/2Z illustrate that finite groups can exist without any faithful irreducible representations, particularly in noncyclic abelian groups.

PREREQUISITES
  • Understanding of finite group theory
  • Familiarity with irreducible representations
  • Knowledge of tensor products in representation theory
  • Ability to analyze character tables of groups
NEXT STEPS
  • Study the Burnside-Molien theorem in detail
  • Explore the properties of tensor products of representations
  • Research character tables of various finite groups
  • Investigate examples of noncyclic abelian groups and their representations
USEFUL FOR

This discussion is beneficial for mathematicians, particularly those specializing in group theory and representation theory, as well as students seeking to deepen their understanding of irreducible representations and their properties.

rkrsnan
Messages
53
Reaction score
0
Direct product of two irreducible representations of a finite group can be decomposed into a direct sum of irreducible representations. So, starting from a single faithful irreducible representation, is it possible generate every other irreducible representation by successively taking direct products?

My second question is (if it makes sense), can we have a finite group in which none of the irreducible representations are faithful?

Thanks.
 
Physics news on Phys.org
rkrsnan said:
Direct product of two irreducible representations of a finite group can be decomposed into a direct sum of irreducible representations. So, starting from a single faithful irreducible representation, is it possible generate every other irreducible representation by successively taking direct products?
Do you mean to say tensor products here instead of direct products? If so, then the answer to your question is in some sense affirmative. A result due to Molien (sometimes called the Burnside-Molien theorem) says that every irreducible representation of a finite group is contained inside some tensor power V^{\otimes n} of a faithful irreducible representation V.

My second question is (if it makes sense), can we have a finite group in which none of the irreducible representations are faithful?
Yes. For example Z/2Z x Z/2Z doesn't have any. You can spot this by looking at the character table: if the the column corresponding to \chi has \chi(g)=\chi(1) for some g\neq 1 then necessarily g \in \ker \chi and \chi isn't faithful.

Thus there are lots of other examples, e.g. any noncyclic abelian group, and more generally any group with noncyclic center.
 
Thank you so much! That was totally what I wanted to know.

PS: Yes, I should have written 'tensor product' instead of 'direct product'.
 
No problem. By the way, the end of my first paragraph above should of course read "of a faithful representation V" and not "of a faithful irreducible representation V" (as there might not be such a V! :smile:).
 
Yep, understood.
About the cyclic center and having faithful irreducible reps, does this result work if the center is identity? I can find examples of groups in which center is identity; in some cases faithful irreps exist and in some others it doesn't.
 
Yes, you're right - the center being cyclic is a necessary but by no means sufficient condition!
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
669
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K