Group G is A5: How to Determine the Group with Permutations

In summary, there is a group generated by the two permutations (1 2 3 4 5) and (1 2)(3 4). The group is divisible by 5 and 2 and has order 10. The identity is in the group and the order of the group is divisible by 4.
  • #1
carmine
2
0

Homework Statement



Suppose G is a group generated
by the two permutations (1 2 3 4 5) and
(1 2)(3 4). Decide which group G is and
prove your answer.

Homework Equations


The Attempt at a Solution


So i crunched this out and I found

identity
15->2 cycles
20->3 cycles
and 24->5 cycles

So i think this is the A5.

Is there an easier way to determine this, other than crunching out the numbers.
 
Physics news on Phys.org
  • #2
how many elements do you think are in your group?
 
  • #3
I get 60 elements...took a while, I'm just assuming there is an easier way..
 
  • #4
Yes, there's somewhat easier ways. Both your generators are even permutations, so you know G will be a subgroup of A5. Now use Lagrange's theorem. Your first one has order 5, so you know 5 divides the order of G. The second has order 2. Now can you find subgroups of order 3 and 4? That would do it, right?
 
Last edited:
  • #5
wow. I've forgotten lots of group theory since last year. why is (12345) even? isn't (12345)=(12)(23)(34)(45)(51) i.e. the product of an odd no. of transpositions and thus the whole permutation is odd?

even using lagrange's theorem,
so if 5 divides 60 then there's a subgroup of size 12 and if 2 divides 60 then there's a subgroup of size 30, no?
 
  • #6
You've forgotten how to multiply permutations, that's for sure. (12345)=(15)(14)(13)(12). That's an even number of transpositions. Your product comes out to be (2345). And not necessarily for the second part. The order of a subgroup divides the order of the group. That's all.
 
  • #7
ok. checked my notes.
a k-cycle is even if k is odd as it can be written as a product of k-1 transpositions
(12345) is a 5-cycle and is therefore even as 5 is odd i.e. it can be written as (12)(23)(34)(45)
the general case given in my notes was (x1 x2 x3 ... xk)=(x1 x2)(x2 x3) ... (xk-1 xk) so i just fitted that to this case.

so the order of a subgroup divides the group. generators are always subgroups. so we know G is divisible by 5 and by 2. so #G is a multiple of 10. how can we deduce anything more?
 
  • #8
As I told carmine. Start taking products of the generators. See if you can find a subgroup of orders 3 and 4.
 
  • #9
i get (12)(12345)=(1543) which is of order 4
and (12)(34)(12345)=(153) which is of order 3

so that tells us #G is divisible by 2,3,4,5

2x3x4x5=120
but 60 is also divisible by 2,3,4,5
nothing smaller than 60 is divisible by 2,3,4,5
so G=A5
yeah?
 
  • #10
latentcorpse said:
i get (12)(12345)=(1543) which is of order 4
and (12)(34)(12345)=(153) which is of order 3

so that tells us #G is divisible by 2,3,4,5

2x3x4x5=120
but 60 is also divisible by 2,3,4,5
nothing smaller than 60 is divisible by 2,3,4,5
so G=A5
yeah?

The second one looks good. (1543) isn't in the group generated by the two given elements. It's an odd permutation. Notice, I didn't say 'find an element of order 4'. You aren't going to find one. I said 'find a subgroup of order 4'. It doesn't have to be cyclic.
 
  • #11
subgroup of order 4 is [itex]H=\{ (153),(145),(135),(235) \}[/itex]

so now we can use lagrange to say 4 divides the size of the group.

is the argument at the end of my last post ok for showing that G=A5?
 
  • #12
latentcorpse said:
subgroup of order 4 is [itex]H=\{ (153),(145),(135),(235) \}[/itex]

so now we can use lagrange to say 4 divides the size of the group.

is the argument at the end of my last post ok for showing that G=A5?

That's NOT a subgroup! It doesn't even have the identity in it. Think about it. A subgroup of order 4 is going to have to be generated by two elements of order 2. Right, the argument is fine. You just need to show the order of G is divisible by 4.
 
  • #13
depressing to forget identity

so [itex]H=\{ e , (12) , (34) , (12)(34) \}[/itex] would do the trick.
 
  • #14
latentcorpse said:
depressing to forget identity

so [itex]H=\{ e , (12) , (34) , (12)(34) \}[/itex] would do the trick.

At least you've got a group there. But again (12) and (34) aren't in G. They are ODD. So it's not a SUBgroup.
 
  • #15
ok (12345)(12)(34)=(135)
(34)(12345)(12)=(145)
(12)(12345)(34)=(235)

so H={(135),(145),(235)} looked ok until i tried combinations and found it wasn't closed under group action. any suggestions?
 
  • #16
Find the group generated by the two elements (12)(34) and (14)(32). What's it's order? You might ask how I knew (14)(32) was in G. Good question. I believe that carmine was correct in concluding the original two elements generate A5. So carmine knows how to check that (14)(32) is in G. I didn't bother to figure out how to generate it. Can you?
 
Last edited:
  • #17
ok well (12)(34)(14)(32)=(13)(24)

so H={e,(12)(34),(13)(24),(14)(23)} which is my subgroup of order 4 and then i can use my argument to deduce G=A5, yes?

so all that remains to be proven is that (14)(32) is in G

i assume i just have to play about with combinations of the cycles
(12)(34) and (12345) till it works?

also, does lagrange's theorem work on elements of size 3 as well as subgroups of order 3? i didn't find a subgroup of size 3, all i found was an element of order 3.

thanks for the revision tutorial in group theory. will be useful for my course in lie groups next semester hopefully!
 
Last edited:
  • #18
latentcorpse said:
ok well (12)(34)(14)(32)=(13)(24)

so H={e,(12)(34),(13)(24),(14)(23)} which is my subgroup of order 4 and then i can use my argument to deduce G=A5, yes?

so all that remains to be proven is that (14)(32) is in G

i assume i just have to play about with combinations of the cycles
(12)(34) and (12345) till it works?

also, does lagrange's theorem work on elements of size 3 as well as subgroups of order 3? i didn't find a subgroup of size 3, all i found was an element of order 3.

thanks for the revision tutorial in group theory. will be useful for my course in lie groups next semester hopefully!

Yes, you just have to play around with it until you find one. If you didn't find a subgroup of order 3 you should probably find one. That should be easy. An element of order 3 will generate it. Good luck with Lie groups. That's a whole nother ball of wax. But if you didn't understand finite groups, Lie groups would be hopeless.
 
  • #19
rewinding about 7 months i was actually pretty competent at this stuff - clearly my christmas will need to involve some revision!

so the subgroup of order 3 will be {e,(153),(135)}
 
  • #20
Yes, that's one of them.
 
  • #21
how would one go about finding the number of subgroups of order 3?
 
  • #22
latentcorpse said:
how would one go about finding the number of subgroups of order 3?

You tell me this time. Give it some thought.
 
  • #23
there are 5 choose 3 = 20 different 3-cycles

but each subgroup of order 3 contains the identity and 2 of these 3-cycles

20/2=10 such subgroups?
 
  • #24
You lucked out. 5 choose 3 is actually 10. Why is it still correct that there are 20 3-cycles?
 
  • #25
it's usually to do with some double counting trick. is it because 5 choose 3 gives us the number of ways of picking 3 things from 5 things but doesn't care about their order. i.e. it vies (135) and (153) as the same thing when in fact they are different?
 
  • #26
latentcorpse said:
it's usually to do with some double counting trick. is it because 5 choose 3 gives us the number of ways of picking 3 things from 5 things but doesn't care about their order. i.e. it vies (135) and (153) as the same thing when in fact they are different?

Exactly.
 

FAQ: Group G is A5: How to Determine the Group with Permutations

What is "Group G is A5: Prove It!"?

"Group G is A5: Prove It!" is a statement commonly used in the field of mathematics to prove the existence of a certain type of group, known as a finite simple group. This statement is derived from the classification of finite simple groups, a major achievement in modern mathematics.

What is a finite simple group?

A finite simple group is a group that does not contain any non-trivial normal subgroups, meaning it cannot be broken down into smaller groups. These groups have important applications in mathematics, including in group theory, algebra, and number theory.

Why is "Group G is A5: Prove It!" significant?

The statement "Group G is A5: Prove It!" is significant because it is part of the proof of the classification of finite simple groups, which is considered one of the most important mathematical achievements of the 20th century. It provides a way to prove the existence of a specific type of finite simple group, known as the alternating group of degree 5, or A5.

How is "Group G is A5: Prove It!" proven?

The proof of "Group G is A5: Prove It!" is a complex and lengthy process involving various mathematical techniques, including representation theory, algebraic geometry, and combinatorics. It was first proven by mathematicians Daniel Gorenstein, Richard Lyons, and Richard Solomon in 1983, and has since been verified by multiple other mathematicians.

What are the applications of "Group G is A5: Prove It!"?

The statement "Group G is A5: Prove It!" has important applications in various areas of mathematics, including group theory, algebra, and number theory. It also has connections to other fields such as physics, cryptography, and computer science. Additionally, the proof of this statement has led to further developments and advancements in the study of finite simple groups.

Similar threads

Replies
1
Views
2K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
4
Views
1K
Replies
6
Views
1K
Replies
7
Views
1K
Back
Top