Converse of Lagrange's Theorem is false

  • Thread starter Thread starter math_nerd
  • Start date Start date
  • Tags Tags
    Theorem
math_nerd
Messages
21
Reaction score
0
This is not a homework problem. In Gallian, there is an example given:

The group A_4 of order 12 has no subgroups of order 6. I can't seem to understand what this means in terms of how this is the "converse" of Lagrange's Theorem.
 
Physics news on Phys.org
A converse of Lagrange's theorem would say for every divisor of the order of group, there's a subgroup of that order. It's false. Apparently.
 
Hmm...okay. So here's a problem in the book that I think applies this concept. Prove that group order of 12 must have an element of order 2. This problem uses the converse, because 12|1,2,3,4,6,12. But by Lagrange we can say that order of 2 is definitely there. But to prove that order 3 is not a possibility, we can use the converse to make a contradiction: for every divisor of the order of the group, there's a subgroup of order 12. I hope this makes sense!
 
They didn't use a "converse to the Lagrange theorem". They used Cauchy's theorem, which is that if p is prime and divides the order of G then there is a subgroup of order p. There is no complete converse to the Lagrange theorem. Which is what they are trying to tell you. 6 isn't prime. There is a subgroup of order 3.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

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