Summary of Key Results
The following table provides a quick reference for the major theorems and their locations in this document.
| Result | Location |
|---|---|
| Subgroup Criterion | Theorem 2.1 |
| Every subgroup of a cyclic group is cyclic | Theorem 2.4 |
| Lagrange”s Theorem | Theorem 3.3 |
| Fermat’s Little Theorem | Corollary 3.5 |
| Index 2 subgroups are normal | Corollary 3.7 |
| First Isomorphism Theorem | Theorem 5.3 |
| Correspondence Theorem | Theorem 5.6 |
| Proposition 5.7 | |
| Orbit-Stabilizer Theorem | Theorem 6.2 |
| Class Equation | Theorem 6.4 |
| Center of -group is non-trivial | Theorem 6.5 |
| Sylow’s First Theorem | Theorem 7.1 |
| Sylow’s Second Theorem | Theorem 7.2 |
| Sylow’s Third Theorem | Theorem 7.3 |
| Ring Isomorphism Theorem | Theorem 9.2 |
| Prime ideals and integral domains | Theorem 9.3 |
| Chinese Remainder Theorem | Theorem 9.5 |
| Eisenstein’s Criterion | Theorem 10.5 |
| Euclidean domain PID UFD | Theorem 11.1, 11.3 |
| Tower Law for field extensions | Proposition 12.1 |
| Kronecker’s Theorem | Theorem 12.4 |
| Finite fields exist and are unique | Theorem 12.5 |
| Primitive Element Theorem | Theorem 12.8 |
| Fundamental Theorem of Galois Theory | Theorem 13.1 |
| Abel-Ruffini Theorem | Corollary 13.3 |
| Cauchy’s Theorem | Theorem 14.1 |
| is simple for | Proposition 14.2 |
| Structure theorem for finitely generated abelian groups | Theorem 14.4 |
Dependency Graph
The key dependencies among topics are:
- Groups Subgroups Lagrange’s Theorem Normal Subgroups Quotient Groups
- Homomorphisms Isomorphism Theorems Correspondence Theorem
- Group Actions Orbit-Stabilizer Sylow Theorems Applications
- Rings Ideals Quotient Rings Prime/Maximal Ideals
- Polynomial Rings Euclidean Domains PIDs UFDs
- Field Extensions Algebraic Extensions Splitting Fields Galois Theory
Mastering the earlier topics is essential before proceeding to the later ones. The problem set (Section 18) Is designed to test understanding across all these areas.
Common Pitfalls
- Confusing groups, rings, and fields. Group: one operation, inverses, identity. Ring: two operations (addition, multiplication). Field: ring where every non-zero element has a multiplicative inverse. Fix: is a ring but not a field ( has no multiplicative inverse). , , are fields.
- Wrong subgroup test. A subset must contain the identity, be closed under the operation and inverses. Fix: For finite groups, it suffices to check closure: if is non-empty and closed, then .
- Confusing normal subgroups and general subgroups. Normal subgroups satisfy for all ; they allow quotient group construction. Fix: Abelian groups: all subgroups are normal. Non-abelian: check for all .
Worked Examples
Example 1: Group verification
Problem. Show that is a group for any .
Solution. (1) Closure: . (2) Associativity: inherited from . (3) Identity: . (4) Inverse: . Therefore is a group.
Example 2: Lagrange’s theorem
Problem. has order 6. A subgroup has order 2. Verify Lagrange’s theorem.
Solution. , . , so Lagrange’s theorem is satisfied: divides . The index , and the cosets are , , .
Summary
- Group: set with associative binary operation, identity, inverses. Abelian if commutative.
- Lagrange’s theorem: divides for ; the index .
- Cyclic group: generated by a single element ; is cyclic.
- Ring: abelian group under , monoid under , distributive laws. Field: ring where every non-zero element is invertible.
Cross-References
| Topic | Site | Link |
|---|---|---|
| Abstract Algebra (Overview) | WyattsNotes | View |
| Number Theory | WyattsNotes | View |
| Linear Algebra | WyattsNotes | View |
| Abstract Algebra — Harvard 122 | Harvard | View |