Group theory and generalizations Proof
Proof of the correspondence theorem
Builds on Normal subgroupQuotient groupLeft cosetSubgroupSubgroup criterionUniqueness of inverses
Proof
We show that taking the preimage under is an inverse of , and then check inclusions and normality.
- Let be a group with identity , and let be a normal subgroup of . The quotient group has the operation and the identity .
- For , . By the uniqueness of inverses, .
- Let . If , then : closure gives , and each is .
- Let be the set of subgroups of with , and the set of subgroups of .
- For , let , the set of left cosets of with a representative in .
- Let . The set contains . For , step 2 gives , and . By the subgroup criterion, .
- For , let .
- Let . Then , since is the identity of . For , , so .
- By step 8 and the subgroup criterion, is a subgroup of . For , step 3 gives , so . Thus .
- Let . We claim . Each has , so .
- Conversely, let , so for some . Then , so with . Hence .
- Let . We claim . Each element of is with . Each element of is a coset , and then .
- By steps 10 to 12, the maps and are inverse to each other. So is a bijection from to .
- Let . If , then each with lies in , so .
- Let . Each with has , so . By step 10, . So exactly when .
- Let be normal in . For and , step 2 gives , and . So is normal in .
- Conversely, let be normal in , and let and . Then .
- By step 17, , which is by step 10. So is normal in .
- Steps 13, 15, 16 and 18 prove all the claims of the statement.
Idea
A subgroup of that contains is a union of cosets of , so it can be recovered from the set of these cosets. This is why taking the preimage undoes . Since products and conjugates in are computed on representatives, the inclusions and the normality pass back and forth.
Reading path
To understand this page from the ground up, read these 18 pages in order. The foundations come first. The path takes the proofs Proof that a subgroup is normal iff its left and right cosets agree, Proof of the uniqueness of inverses, Proof of the subgroup criterion.
Show the path as a graph
- no evidence level
- Binary operation definition
- Group concept
- Identity element definition
- Conjugate elements definition
- Subgroup definition
- Inverse element definition
- Conjugate subgroup definition
- Left coset definition
- Right coset definition
- Proof of the uniqueness of inverses proof
- Normal subgroup definition
- Uniqueness of inverses statement
- Proof that a subgroup is normal iff its left and right cosets agree proof
- Proof of the subgroup criterion proof
- Normality via left and right cosets statement
- Subgroup criterion statement
- Quotient group definition
- Proof of the correspondence theorem proof
Where this leads
7 pages build on this one.
- A finite group is nilpotent iff it is the product of its Sylow subgroups
- Finite p-groups are nilpotent
- Upper central series
- Jordan–Hölder theorem
- Correspondence theorem
- Proof of the Jordan–Hölder theorem by induction on the length
- Proof that a finite group is nilpotent iff it is the product of its Sylow subgroups
Further reading
About this page
| Tag | Y4WX4RKWY9 |
|---|---|
| URI | m2://Y4WX4RKWY9 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 20A05 |
| Proves | Correspondence theorem |
| Uses | Normal subgroup, Quotient group, Left coset, Subgroup, Subgroup criterion, Uniqueness of inverses |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.