Cosets and Lagranges Theorem - Graceland University陪集和拉格朗日定理-格雷斯兰学院.pptVIP

Lagranges Theorem Lagranges Theorem The most important single theorem in group theory. It helps answer: How large is the symmetry group of a volleyball? A soccer ball? How many groups of order 2p where p is prime? (4, 6, 10, 14, 22, 26, …) Is 2257-1 prime? Is computer security possible? etc. Recall: Let H be a subgroup of G, and a,b in G. 3. aH = bH iff a belongs to bH 4. aH and bH are either equal or disjoint 6. |aH| = |bH| Lagranges Theorem If G is finite group and H is a subgroup of G, then |H| divides |G|. The number of distinct left (right) cosets of H in G is |G|/|H| My proof: Let H ≤ G with |G| = n, and |H| = k. Write the elements of H in row 1: My proof: Choose any a2 in G not in row 1. Write a2H in the second row. My proof: Continue in a similar manner… Since G is finite, this process will end My proof: Rows are disjoint by (4) Each row has k elements by (6) My proof: Let r be the number of distinct cosets. Clearly |G| = |H|?r, and r = |G|/|H|. What doesLagranges Theorem say? Let H ≤ G where |G| = 12. Then |H| could only be… 1, 2, 3, 4, 6, 12: The divisors of 12. G =Z12 is cyclic, so there is exactly one subgroup of each of these orders. G = A4 is not cyclic, and there is no subgroup of order 6. The converse of Lagranges theorem is False! Definition Let H be a subgroup of G. The number of left (right) cosets of H in G is called the index in G of H and is denoted |G:H|. |G:H| = |G|/|H| Corollary 1: If G is a finite group and H is a subgroup of G, then |G:H| = |G|/|H|. Proof: This is a restatement of Lagranges theorem using the definition of the index in G of H. |a| divides |G| Corollary 2. In a finite group G, the order of each element of the group divides the order of the group. Proof: Let a be any element of G. Then |a| = |a|. By Lagranges Theorem, |a| divides |G|. Groups of prime order Corollary 3. A group of prime order is cyclic. Proof: Let |G| be prime. Choose any a≠e in G. Then |a| 1. Since |a| divides |G|, |