This sheet introduces cosets, derives Lagrange's Theorem—one of the most important counting theorems in group theory—and defines normal subgroups.
Commentary. Cosets are the fundamental tool for understanding the relationship between a group and its subgroups. They partition a group into equal-sized pieces, which leads directly to Lagrange's Theorem: the order of any subgroup divides the order of the group. This simple counting theorem has profound consequences—it tells us, for example, that every group of prime order is cyclic, and that the order of every element divides the order of the group. Normal subgroups, which are subgroups whose left and right cosets coincide, are exactly the subgroups that can serve as kernels of homomorphisms.
Equivalence Relations and Equivalence Classes#
Definition 3.0.1(Equivalence Relation). Let be a set. A relation on is an equivalence relation if for all :
- Reflexive: .
- Symmetric: If , then .
- Transitive: If and , then .
Definition 3.0.2 (Equivalence Class). For , the equivalence class of is:
The set of all equivalence classes is denoted .
Theorem 3.0.3(Equivalence Classes Partition the Set). If is an equivalence relation on , then the equivalence classes of form a partition of . That is:
- Every element of belongs to at least one equivalence class.
- If two equivalence classes intersect, they are equal.
Theorem 3.0.4(Equivalence Relation from a Partition). Conversely, if is partitioned into a collection of nonempty disjoint subsets, then the relation iff and belong to the same subset is an equivalence relation.
Corollary.3.0.5 There is a one-to-one correspondence between equivalence relations on and partitions of .
Example.3.0.6 On , define iff is divisible by . The equivalence classes are the residue classes modulo :
Remark. In Sheet 3, left cosets of a subgroup in a group are precisely the equivalence classes of the relation iff . In Sheet 8, ideals and quotient rings use the same construction.
Cosets#
Definition 3.1. Let and . The left coset of in containing is:The right coset of in containing is:
Theorem 3.2. Let . The left cosets of in form a partition of .
Theorem 3.3. For any , the map is a bijection from to . Hence all left cosets have the same cardinality as .
Theorem 3.4. For , the following are equivalent:
Theorem 3.5. Two left cosets of in are either equal or disjoint.
Example 3.6. In , the cosets of are:
Example 3.7. In , let . The left cosets are:
Exercise 3.8. Let and . List all left cosets of in .
Exercise 3.9. Let and (the rotations). List all left cosets of in .
Connecting Cosets to Equivalence Classes#
Theorem 3.9.1(Cosets as Equivalence Classes). Let . Define a relation on by:
Then is an equivalence relation, and for each , the equivalence class of is:
Similarly, define . Then is an equivalence relation, and the equivalence class of is:
Remark. The correspondence between equivalence classes and cosets is the reason we can form quotient groups : the elements of are equivalence classes under , and the coset multiplication is well-defined when is normal.
Lagrange's Theorem#
Theorem 3.10 (Lagrange's Theorem). If is finite and , then divides . Moreover,where is the index of in , i.e., the number of distinct left cosets of in ; is finite if there exists ,
Corollary 3.11. The order of any element of a finite group divides the order of the group.
Say , consider and .
By Theorem 3.10, devides .
Corollary 3.12. Every group of prime order is cyclic.
By corollary 3.11, we know that the order of all elements in with a prime order , is either or 1.
Pick that , .
Suppose for contradiction that , then .
Contradiction arises.
Thus, the supposition is wrong, .
So except from the identity with the order of 1, all other elements could be expressed as other elements to k powers. That fits the definition of cyclic group.
Alternative proof: We have and prove . Then G is cyclic.
Corollary 3.13. If is finite of order , then for every .
By theorem 3.11.
Corollary 3.14. If and , then .
Use Lagrange's Theorem respectively to G,H; G,K, and H,K.
Theorem 3.15. If , then contains the square of every element of .
Theorem 3.4. what about the intuition solution here?
Example 3.16. A group of order is cyclic; every nonidentity element is a generator.
Exercise 3.17. Let be a group of order where and are distinct primes. Show that every proper subgroup of is cyclic.
Exercise 3.19. Show that a group of order has an element of order and an element of order .
Exercise 3.20. Prove that if is a finite group and with where is the smallest prime dividing , then is normal in .
Normal Subgroups#
Definition 3.21. A subgroup is normal in , denoted , if for all and :
Theorem 3.22. The following are equivalent for :
- .
- for all .
- for all .
- is the kernel of some homomorphism from to another group. (no need to do it until u know what the kernel and homomorphism are)
- Every left coset of is also a right coset of .
Theorem 3.23. If , then the set of cosets forms a group under the operation:
1, This operation is Closed-- is a coset of G.
2, Identity: is identity.
3, Inverse:
4, Associativity:
Example 3.24. Every subgroup of an abelian group is normal.
Example 3.26. The subgroup of rotations in is normal. The subgroup generated by a reflection is not normal when .
Theorem 3.27. The intersection of normal subgroups is normal.
Theorem 3.28. If and , then .
Theorem 3.29. If and , then .
First of all, .
Secondly, we prove it is normal.
Let i.e. and
Because H is closed, for all , .
By and , .
Thus, for all
Overall, .
Theorem 3.30. If and with , then . Moreover, iff .
Theorem 3.31. If and , then is a subgroup of .
.
Associativity holds.
All the and are in .
Closed: (By N is normal, N is closed and respectively.)
Since it's closed, and that for arbitrary ; ,
the inverse of , .
Therefore, is a subgroup of .
Theorem 3.32. If and , then .
Exercise 3.33. Show that .
Exercise 3.37. Let . Prove that if has finite order, then the order of in divides the order of .
The Quotient Group#
Definition 3.38. Let . The quotient group (or factor group) is the set of left cosets of in with operation:
Theorem 3.39. If , then is a group.
Theorem 3.40 (The Natural Homomorphism). If , the map
is a surjective homomorphism with kernel .
Theorem 3.41. If is cyclic, then every quotient group is cyclic.
Theorem 3.42. If is abelian, then every quotient group is abelian.
Theorem 3.43. If is finite, then .
By lagrange theorem.
Theorem 3.44. If and is finite, then for every :
Now normal group is not only about itself and its definition. It's an elements in the quotient group whose properties can be used.
Example 3.47. (where is rotation).
Exercise 3.48. Let and . List the elements of and write its Cayley table. To which familiar group is isomorphic?
Exercise 3.49. Let and . Compute . Is it abelian?
Exercise 3.50. Let be a group and . Prove that if and are both cyclic, it does not necessarily follow that is cyclic. Find a counterexample.
The Correspondence Theorem for Groups#
Theorem 3.51 (Correspondence Theorem). Let . There is a bijection between:
- Subgroups of with , and
- Subgroups of ,
given by:
Moreover, this bijection preserves inclusions, intersections, products, and normality. Specifically:
- iff .
- iff .
Corollary 3.52. The subgroups of are exactly the subgroups of that contain .
Exercise 3.53. Let and . List all subgroups of using the Correspondence Theorem.
Exercise 3.54. Let be a finite group and . Prove that has a subgroup of order for every dividing iff has a subgroup of order containing .
Summary#
We have introduced:
- Left and right cosets
- The partition of a group into cosets
- Lagrange's Theorem and its corollaries
- The index of a subgroup
- Normal subgroups and their characterizations
- The quotient group
- The natural homomorphism
- Properties of quotient groups: cyclic, abelian, order
- The Correspondence Theorem for groups
- Applications to subgroups and quotients