I have tried to understand this using various websites and m,y notes but i still dont understand whats going on.

Could someone please explain what im meant to do to prove a a set in lagranges theorem thanks.

Printable View

- January 5th 2010, 04:00 AMadam_leedsLagranges theorem
I have tried to understand this using various websites and m,y notes but i still dont understand whats going on.

Could someone please explain what im meant to do to prove a a set in lagranges theorem thanks. - January 5th 2010, 04:19 AMSwlabr
What is it your are wanting us to explain how to prove?

Lagranges Theorem states that the order of every subgroup of a finite group divides the order of , .

This is, perhaps, a result which is easier to understand once you have played around with it a bit. So, pick a few of your favourite groups and verify the result.

For instance, the Klein 4-group has order 4 and subgroups of order 1, 2, 2, 2 and 4, and cyclic groups of prime order (for instance, ) have no proper subgroups. - January 5th 2010, 04:36 AMadam_leeds
- January 5th 2010, 04:47 AMSwlabr
Do you mean how do you calculate the orders of the group and the subgroup? This is just the number of elements in your group.

For instance, the Klein 4-group has order 4 as it has precisely 4 elements, and the cyclic group of order 7 has, well, order 7. It is just the elements under addition modulo 7. - January 5th 2010, 04:52 AMHallsofIvy
We don't!

G is a**given**group and H is a**given**subgroup of G. If by "g" and "h" you mean the number of elements in G and H, respectively, when we are given G and H, we are given g and h.

I think you should look closely at the concept of "left cosets" of H. They are crucial in Lagrange's theorem and important for other things as well. For any x in G, its left coset is the set {xy| y in H}. (A "right" coset would be of the form {gx| y in H}.) You should look at the proofs that

1) Every left coset contains the same number of elements.

(And since {1y |y in H} is just H itself, that is just h.)

2) Every member of G is in exactly one such left coset.

If there are, say, n left cosets, each containing h members, and each member of G is in exactly one, we must have g= nh so h divides g. - January 5th 2010, 04:53 AMadam_leeds
In my notes it says If G is a finite group of order g = ¦G¦ and H is a subgroup of order h = ¦H¦, then h must be a factor of G.

So if the set was G = {1, -1, i, -i}, i = ((-1)^0.5). I know how to show its a group by the axioms.

But then the question says obtain a non-trivial solution subgoup H which i ahve no idea to do. And use it to illustrate lagranges theorem for a finite group.

Would G and H be 4 in this case? - January 5th 2010, 04:57 AMSwlabr
A non-trivial subgroup is a subgroup which is not equal to the group itself nor the trivial group. Thus, it must have order strictly greater to one and not equal to that of the group. The group you have been given is the Klein 4-group which I havev mentioned above. It has 3 non-trivial subgroups each of order 2. Can you find them? (Hint: Pick an element. Any element...other than 1...)

- January 5th 2010, 05:01 AMadam_leeds
- January 5th 2010, 05:45 AMDefunkt
- January 5th 2010, 05:49 AMadam_leeds
- January 5th 2010, 05:56 AMSwlabr
- January 5th 2010, 05:57 AMDefunkt
edit: answered by swlabr

- January 5th 2010, 05:58 AMadam_leeds
- January 5th 2010, 06:05 AMSwlabr
A subgroup is a set of elements from G which form a group under the operation of G.

So, a subgroup will always contain the identity, in this case denoted 1. If it is non-trivial it will contain other elements too, for instance -1.

So, take the set . Firstly, you should note that you have associativity as you inherit this from the group itself. You also have the identity element, this is just 1.

Can you find an inverse for -1? Is this in the set?

What about closure? If you multiply two elements from this set are we still in the set? The only non-trivial product is , but this is still easy... - January 5th 2010, 06:09 AMadam_leeds