Link to original… generalizing modulo arithmetic …
Different representations of the same coset/element in the factor group.
For the abelian group and , its cosets area normal subgroup .
Looking at the concrete case of , we have the following congruence classes:
(note: is the neutral element of the factor group)
We can do arithmetic with these classes, e.g.:
This is the same as the addition in , adding the elements and taking the remainder modulo 4.
Same as above, but a different representation:
The reason we can do this is because .
For any group with a normal subgroup and the coses (left and right coset equiv).
Now (like above) we define the same operation on the cosets as on the group, i.e.
We can now take this concept of modulo arithmetic and generalize it it to any group with a normal subgroup.
,
Proof:
( are representatives of the same coset)
(since and being a subgroup and hence closed).
Quotient group (or factor group)
Let be a group and a normal subgroup of (written ).
The set is the set of all (left=right) cosets of in (read “G modulo N” or “G over N”).
The factor group is with the operation:The factor group does not need to be commutative, and isn’t if isn’t.
Group properties of the factor group
closure: is always in .
associativity: Inherited from since we’re just working with representatives.
neutral element: since for all cosets.
inverse element: is inverse to since .
Example factor group
Consider the integers under addition and the normal subgroup of multiples of .
The quotient group aka consists of the following cosets:Note: This quotient group is isomorphic to the cyclic group of order , generated by the congruence class :
For instance, in : arithmetic in .
Interpretation
The quotient group identifies elements that differ by elements of . Each element of represents an entire coset of , effectively treating elements that differ by elements of as equivalent.
For finite groups, by Lagrange's Theorem.
The kernel of a homomorphism determines a quotient group that is isomorphic to the image of :
Link to originalFirst Isomorphism Theorem
For any homomorphism :
The set of all cosets of the kernel in the group is isomorphic to the image of .
This shows that after “collapsing/factoring out” elements that map to the identity (the kernel), the factor group structure exactly matches the image.
Proof is an isomorphism We need to show that
- is well-defined: (can’t have elements from the same coset point to different elements in )
- is surjective
- is injective
- is a homomorphism
Ad 1: We need to show that if , then and are the same.
This would mean that there is an
Note: when mapped become the identity in as they are in the kernel.Ad 2: Surjectivity is clear as maps all cosets to elements in the image:
Note: is the definition of : maps cosets to elements in the image!Ad 3: For injectivity we want to show that:
In words: The -image of a coset is the same as the -image of the representative of that coset (representative = any element in the coset).
Note: (and we can wrhite – from the left – since the kernel is normal)
→ If the images are the same the preimages are the same.Ad 4: