Kernels normality and quotient structure
A quotient can compress a group while preserving its operation. The compression is useful only if multiplication remains independent of representatives. We derive the exact compatibility condition, identify quotients arising from homomorphisms, and prove a correspondence between subgroups before and after compression.
1 Normal subgroups as compatible equivalence classes
For , normality means for every . This is equivalent to : multiply the first equality on the right by , or the second on the right by . In an abelian group every subgroup is normal. For nonabelian groups it must be checked.
The kernel of a homomorphism is normal. If lies in the kernel, then , giving one inclusion; replacing by gives the other. Notice the distinction between an inclusion proof and the equality required by normality.
Theorem. The rule is well defined on left cosets if and only if is normal.
Proof. For normal , replace representatives by and . Their product is , which lies in . Thus any choices give the same output coset. Conversely, if the rule is well defined, implies for every , so . This gives for every , and the reverse inclusion follows by conjugating the corresponding statement for .
The quotient group has identity and inverse . Associativity is inherited from . The projection , , is onto with kernel . Hence normal subgroups are precisely kernels of group homomorphisms.
2 The first isomorphism theorem as a complete proof
For , define by .
To prove it is well defined, suppose . Then , so . Conversely, equality of the two images gives this kernel condition, proving injectivity as well. Every element of the image has a representative , proving surjectivity. Finally,
Thus
Each step is necessary: naming a formula alone does not prove it defines an isomorphism.
Worked determinant example. The determinant map is a homomorphism because determinants multiply. It is onto: has determinant for every nonzero real . Its kernel is , the determinant-one matrices. Therefore
This does not say the quotient retains every matrix entry. It retains exactly the multiplicative determinant information.
3 Subgroup correspondence
Correspondence theorem. For , subgroups of correspond bijectively to subgroups containing , by and . Normal subgroups correspond to normal subgroups.
Proof. A preimage of a subgroup is a subgroup by the homomorphism laws and contains the projection kernel. If contains , then the preimage of is : membership of means for some , giving . Conversely, surjectivity of gives . For normality, conjugating by gives ; this lies in for every exactly when is normal, using .
If additionally , the map , , has kernel . The first theorem gives the third isomorphism theorem:
The second isomorphism theorem follows by restricting to any subgroup : kernel , image , hence . Normality of ensures is a subgroup, since products can move an factor across a factor by conjugation.
For the supplement below, the second isomorphism argument resets notation to an arbitrary subgroup and a normal subgroup . In its third isomorphism argument the assumptions are instead with . In particular is a group in that argument; no such normality is asserted for an arbitrary subgroup used earlier.
Representative failure and the full projection-map arguments
Take in and . The same coset has representatives and . Using in its product with gives ; using gives , which is different because . Thus a rule on representatives can fail to define any operation on cosets at all. Merely counting the cosets cannot repair that failure.
Here are the closure details for the second theorem. The set is nonempty because it contains . For ,
The first factor is in and the parenthesized factor is in by normality. The subgroup test proves . Normality of in implies normality in . For the restricted projection , the kernel is exactly ; every coset of an element equals , so its image is all of . These statements justify every group and every map used in the theorem.
For the third theorem, gives , hence . Therefore is well defined. It preserves products since , and is onto because each is the image of . Its kernel consists precisely of the cosets with , which form . A kernel is normal, so follows before taking the final quotient.
4 Graded practice
E1 Foundation. Prove a subgroup of index 2 is normal without enumerating a multiplication table.
E2 Cyclic maps. Classify homomorphisms . Find each kernel and image.
E3 Correspondence. List the subgroups of by lifting them to subgroups of containing .
E4 Quotient in stages. Identify and describe its natural map explicitly.
E5 Nonexample. In , show is not normal and explain which step of quotient multiplication fails.
5 Full solutions
S1. If , both cosets and equal . Otherwise each is the complement of , because the index-2 left and right partitions each have only one other block. Thus for every .
S2. A map is determined by , and the relation requires modulo 9. Thus . For , kernel is the whole domain and image is zero. For or 6, the kernel is and image is . The two nonzero maps have quotient domain of order 3, agreeing with their images.
S3. Every subgroup of is . Containment means . Thus gives all six quotient subgroups, with orders . The correspondence proves completeness of the list.
S4. The map sends to and has kernel . The quotient is by the first or third theorem.
S5. Conjugating by gives outside the subgroup. In the necessity proof, replacing by can change the product with , because need not lie in . Thus the proposed multiplication depends on representatives.
Summary
Normality is exactly the condition for group quotient multiplication. The first isomorphism theorem identifies a map's retained information, and the correspondence theorem tracks subgroup structure through the projection. Further isomorphism results follow from explicit maps and their kernels rather than from symbolic cancellation of quotient notation.