Permutations? and Group Theory

Click For Summary
SUMMARY

The discussion centers on proving that in a finite group, the number of nonidentity elements satisfying the equation x5=e is a multiple of 4. The identity element "e" is defined in Gallian's notation. The user Elwin explores examples using the group {1, 3, 5, 7} under multiplication modulo 8 but finds no nonidentity elements. A hint suggests considering elements x2, x3, and x4 to further analyze their relationship to the identity. The recommendation is to explore cyclic groups, specifically Z5, for more relevant experimentation.

PREREQUISITES
  • Understanding of finite groups and their properties
  • Familiarity with group operations and identity elements
  • Knowledge of cyclic groups, specifically Z5
  • Basic concepts of group theory, including involutions
NEXT STEPS
  • Study the properties of cyclic groups, particularly Z5
  • Learn about direct products of cyclic groups in group theory
  • Investigate the implications of the equation x5=e in various group structures
  • Explore the concept of involutions in finite groups
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone studying group theory, particularly those interested in the properties of finite groups and cyclic groups.

Elwin.Martin
Messages
202
Reaction score
0

Homework Statement


In a finite group, show that the number of nonidentity elements that satisfy the equation x^5=e is a multiple of 4. If the stipulation that the group is finite is omitted, what can you say about the number of nonidentity elements that satisfy the equation x^5=e?

Homework Equations


Not sure anything should be here
"e" is the identity in Gallian's notation
x^5=e?

The Attempt at a Solution


I began typing that I wasn't sure how to show this, and now I'm doubting I understand why it's true. Involution (for groups) was covered, but I missed it and I'm hoping that I didn't miss anything relevant.

I tried some finite groups just to see how it would go:
So say we're looking at a simple group like, {1, 3, 5, 7} under multiplication modulo 8. The operation associative, it has an identity element (1), and has inverses for all of the components (each element is it's own inverse).

So besides 1 (or e here) I'll look at each element:
3^5=3 mod 8
5^5=5 mod 8
7^5=7 mod 8
(this make sense since they are all their own inverses, all even powers will be e and all odd power will be the element)

So I have 0 nonidentity elements...which is a multiple of 4, but gets me nowhere. I could try experimenting with larger groups (;O Monster group, anyone?) but I'm not sure that this would help as much as it would be tedious.

I don't know where I should go, conceptually. This is a good book, so I'm pretty sure all the information I need is present...I'm just not sure what I should be thinking about. I keep getting drawn to Cyclic groups and subgroups...I really wish I could show that like, break it into two cases. One where there are no nonidentity x such that x^5=e, and one where where there are. I have no idea if this would work though, and I can't see any easy way to test this.

Direction would be wonderful, this is the end of the problem set and I'm just burnt out.

Thanks for any and all advice,
Elwin
 
Physics news on Phys.org
Here's a hint. If x is a nonidentity element that satisfies x^5=e, then what about x^2, x^3 and x^4. Do they satisfy x^5=e? Can any of them equal each other or be the identity? And picking sample groups to try is a good idea, but you picked one that's pretty unrelated to the problem. Try the cyclic group Z5, the integers mod 5. Or direct products of cyclic groups if you want to experiment. Leave the monster group alone.
 
Last edited:

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 26 ·
Replies
26
Views
2K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K