Problem Set | Mathematics - Wyatt's Notes
The following problems test understanding across all major topics. Full solutions are provided; Each problem includes a cross-reference to the relevant section for review.
Groups
Section titled “Groups”Problem 1. Let be a group and an element of order . Prove that .
Solution
Solution. Let and write , with . We show and that is the smallest such positive exponent.
. Since We have . So divides .
Conversely, if Then divides So divides Hence divides . Since We get divides . Thus .
If you get this wrong, revise: Section 1.6, Proposition 1.5; Section 2.4, Theorem 2.5.
Problem 2. Show that has exactly five subgroups of order and determine which are normal.
Solution
Solution. where , , .
Elements of order : , , , , . So there are five subgroups of order : , , , , .
For normality: and So . But So is not normal. Similarly, the other reflection subgroups are not normal. Only is normal.
If you get this wrong, revise: Section 1.3, 1.7; Section 4.1, Proposition 4.1.
Problem 3. Let . Prove that .
Solution
Solution. is non-empty since and So . If Then and . Since and are subgroups, and So . By the subgroup criterion, .
If you get this wrong, revise: Section 2.1, Theorem 2.1; Section 2.6, Theorem 2.6.
Lagrange’s Theorem and Cosets
Section titled “Lagrange’s Theorem and Cosets”Problem 4. Find all subgroups of and draw the subgroup lattice.
Solution
Solution. By Theorem 2.4, every subgroup of the cyclic group is cyclic, And there is exactly one subgroup of order for each divisor of .
The divisors of are . The subgroups are: (order ), (order ), (order ), (order ), (order ), (order ).
The subgroup lattice (Hasse diagram): connects to , , . connects to and . connects to . and connect to .
If you get this wrong, revise: Section 2.4, Theorem 2.4; Section 1.7.
Problem 5. Let . Find all left cosets of in and verify is not normal.
Solution
Solution. has order . Choose representatives from E.g., , , , . The six cosets are: , , , , , .
To show is not normal: (since is not among the four elements of listed above).
If you get this wrong, revise: Section 3.1, 3.4; Section 4.1.
Problem 6. Prove that if Then .
Solution
Solution. Since There are exactly two left cosets: and for some . These partition So . Similarly, the two right cosets are and And . Therefore for all . For : . For : . Thus for all So .
If you get this wrong, revise: Section 3.5, Corollary 3.7.
Normal Subgroups and Homomorphisms
Section titled “Normal Subgroups and Homomorphisms”Problem 7. Compute and identify the quotient group up to isomorphism.
Solution
Solution. with and of order . The quotient has order . The cosets are , , , . Every non-identity element satisfies So every element has order or . The quotient is abelian (since contains the commutator subgroup). Thus .
If you get this wrong, revise: Section 4.2, 4.3; Section 5.3, Theorem 5.3.
Problem 8. Let be defined by . Determine whether is a group homomorphism, find its kernel and image, and explain why it is not a ring homomorphism.
Solution
Solution. As a group homomorphism : . ✓ . .
is NOT a ring homomorphism because . Ring homomorphisms between rings with unity must send to .
If you get this wrong, revise: Section 5.1, Proposition 5.1; Section 8.6, Proposition 8.6.
Problem 9. State and prove the correspondence theorem (fourth isomorphism theorem).
Solution
Solution. Theorem. Let be a surjective homomorphism with . Then there is an inclusion-preserving bijection between subgroups of containing and Subgroups of Given by with inverse . Normality and indices are preserved.
Proof. Define and . since is surjective. since . For normality: (by conjugation argument). For indices: (since via the induced map).
If you get this wrong, revise: Section 5.7, Theorem 5.6.
Group Actions and Sylow Theorems
Section titled “Group Actions and Sylow Theorems”Problem 10. Find the conjugacy classes of and verify the class equation.
Solution
Solution. Conjugacy classes in are determined by cycle type. The cycle types in and Their sizes:
- . Identity. Size: .
- . Transpositions. Count: .
- — 3-cycles. Count: .
- . Double transpositions. Count: .
- — 4-cycles. Count: .
Class equation: . ✓ So And the sum of over non-central classes is .
If you get this wrong, revise: Section 6.4, Theorem 6.4; Section 1.4.
Problem 11. Let act transitively on a set with (prime). Prove that has a subgroup of index .
Solution
Solution. Let . Since acts transitively, . By the orbit-stabilizer theorem, So has index in . Since is a subgroup (Proposition 6.1), we are done.
If you get this wrong, revise: Section 6.2, Theorem 6.2.
Problem 12. Find all Sylow -subgroups of .
Solution
Solution. . Sylow -subgroups have order . and divides So . The elements of order in are the three transpositions: , , . Each generates a subgroup of order : , , . So and the three Sylow -subgroups are these.
If you get this wrong, revise: Section 7.1, 7.6; Theorem 7.3.
Problem 13. Prove that every group of order is cyclic.
Solution
Solution. . By Sylow’s third theorem: and divides So . and divides So .
Both the Sylow -subgroup and the Sylow -subgroup are normal. Since (their orders are coprime) And We have . Since both are normal with trivial intersection, .
If you get this wrong, revise: Section 7.3, Proposition 7.4; Section 7.7, Proposition 7.6.
Problem 14. Let be a group of order . Show that has a normal Sylow -subgroup. Must be abelian?
Solution
Solution. and divides . Since We must have . So the Sylow -subgroup is normal.
and divides So . If Both Sylow subgroups are normal and (abelian). If , is a semidirect product Which is non-abelian. This group exists: it is the unique non-abelian group of order . So need not be abelian.
If you get this wrong, revise: Section 7.3, 7.7; Theorem 7.3.
Rings, Ideals, and Polynomial Rings
Section titled “Rings, Ideals, and Polynomial Rings”Problem 15. Prove that is a prime ideal of but is not prime.
Solution
Solution. By Theorem 9.3, is prime in iff is an integral domain. is a field, hence an integral domain, so is prime.
: we have but . So has zero divisors and is not an integral domain. Therefore is not prime.
If you get this wrong, revise: Section 9.3, Theorem 9.3; Section 8.4.
Problem 16. Show that is irreducible in but reducible in .
Solution
Solution. In : suppose with . Then and So Giving Which has no real solution. Thus is irreducible in .
In : .
If you get this wrong, revise: Section 10.2; Section 12.7, Fundamental Theorem of Algebra.
Problem 17. Use the Euclidean algorithm to find in .
Solution
Solution.
Since the last non-zero remainder is We have (up to multiplication by a unit in I.e., a non-zero constant).
If you get this wrong, revise: Section 10.1, Theorem 10.1; Section 11.1.
Problem 18. Prove that is a UFD but not a PID.
Solution
Solution. UFD: By Gauss’s lemma, since is a UFD, is a UFD.
Not a PID: The ideal is not principal. Suppose for some . Then divides both and . Since divides , is a constant polynomial, say . Then So divides and divides Hence . But since (every element of has even constant term). Contradiction. Therefore is not principal, and is not a PID.
If you get this wrong, revise: Section 11.3, Theorem 11.3; Section 8.1.
Field Extensions and Galois Theory
Section titled “Field Extensions and Galois Theory”Problem 19. Compute and find the Galois group.
Solution
Solution. First, since is irreducible over (by Eisenstein with ). Then (if With Squaring gives Forcing and leading to contradiction). So .
By the tower law: .
The Galois group consists of four automorphisms determined by their action on and : : , : , : , : ,
Since all non-identity elements have order , .
If you get this wrong, revise: Section 12.1, Proposition 12.1; Section 13.1.
Problem 20. Prove that a quotient ring is an integral domain if and only if is a prime ideal.
Solution
Solution. () Suppose is an integral domain. Let . Then The zero element of . Since has no zero divisors, either or I.e., or . So is prime.
() Suppose is prime. is a commutative ring with unity (since is). If Then So or (since is prime). Thus or Meaning has no zero divisors. Also since . Therefore is an integral domain.
If you get this wrong, revise: Section 9.2, 9.3, Theorem 9.3; Section 8.4.
Challenge Problems
Section titled “Challenge Problems”Problem 21. Let be a finite group acting on a finite set . Prove Burnside’s lemma: The number of orbits equals .
Solution
Solution. Let . Count in two ways.
Grouping by : .
Grouping by : .
For each orbit Every has (by orbit-stabilizer). So .
Summing over all orbits: .
Combining: .
If you get this wrong, revise: Section 6.3, Theorem 6.3.
Problem 22. Show that is the smallest non-abelian simple group.
Solution
Solution. We show that every non-abelian group of order is not simple.
- Order : has normal subgroup .
- Order : all groups of order have non-trivial center (Theorem 6.5).
- Order : by Sylow.
- Order : or . If One checks has the normal Klein subgroup .
- Order : by Sylow.
- Order : , by Sylow.
- Order : by Sylow (since and divides ).
- Order : by Sylow (since and divides ).
- Order : by Sylow.
- Order : by Sylow.
- Order : if is simple, and . Counting elements gives a contradiction.
- Order : .
- Order : -group has non-trivial center.
- Order : by Sylow (since and divides ).
- Order : or by counting arguments (see Section 7.6).
- Order : .
- Order : .
- Order : , .
- Order : or . If The action on Sylow -subgroups gives a homomorphism whose kernel is a proper normal subgroup.
- Orders : similar arguments apply. For each, either a Sylow subgroup is unique, or counting arguments force a normal subgroup.
has order and is simple (Proposition 14.2). Therefore it is the smallest non-abelian simple group.
If you get this wrong, revise: Section 7.7, Proposition 7.7; Section 14.3, Proposition 14.2.
Problem 23. Prove that the quotient ring is isomorphic to .
Solution
Solution. Define by . This is a ring Homomorphism (evaluation at ). It is surjective: any equals .
The kernel consists of polynomials with . Since is the minimal Polynomial of over Every such is divisible by in . By Gauss’s lemma, is divisible by in as well. So .
By the ring isomorphism theorem, .
If you get this wrong, revise: Section 9.2, Theorem 9.2; Section 8.6.
Problem 24. Let be a field and let be irreducible of degree . Show that the Quotient ring is an -dimensional vector space over with basis .
Solution
Solution. Since is irreducible and is a PID, is a maximal ideal, so is a field. Write . Every element of is a coset for some .
By the division algorithm, where or . Then So every element of can be written as With . This representation is unique: if Then So Meaning divides a polynomial Of degree Which forces all .
Therefore is a basis for over And .
If you get this wrong, revise: Section 10.1, Theorem 10.1; Section 12.3, Theorem 12.4.
Problem 25. Classify all finite fields of order for and .
Solution
Solution. By Theorem 12.5, for each prime power there is a unique (up to isomorphism) finite field.
( elements): . Arithmetic modulo .
( elements): . Elements: where . Multiplicative group is cyclic of order : .
( elements): . Elements: Where . Multiplicative group is cyclic of order .
( elements): . Elements: Where . Multiplicative group is cyclic of order .
Note: is NOT a subfield of (since does not divide ), but IS A subfield of (since divides ). More generally, If and only if divides .
If you get this wrong, revise: Section 12.4, Theorem 12.5; Section 12.6.
flowchart TD A[18_Problem Set] --> B[Key Concepts] A --> C[Core Principles] A --> D[Practical Applications] B --> E[Fundamental definitions] C --> F[Design patterns] D --> G[Real-world usage]Intuition
Section titled “Intuition”Abstract algebra is the study of symmetry made precise. Groups capture the structure of symmetries, rings capture the structure of arithmetic, and fields combine both. The Sylow theorems exploit prime factorisation to pin down the internal structure of finite groups, much like prime factorisation reveals the building blocks of integers. Galois theory connects field extensions to group theory, explaining why polynomial equations of degree five or higher cannot be solved by radicals. The recurring theme is that quotient structures collapse information in controlled ways, revealing hidden patterns.
Common Mistakes
Section titled “Common Mistakes”Mistake 1: Forgetting that the order formula for elements requires gcd computation When computing the order of in a group, students often write instead of the correct . The correct formula requires dividing by the greatest common divisor, not directly. Always verify by checking that where .
Mistake 2: Confusing conjugacy classes with cosets Conjugacy classes partition a group by the equivalence relation iff for some , while cosets partition a group by a subgroup. The class equation involves conjugacy classes, not cosets, and the size of each class divides the group order by the orbit-stabilizer theorem.
Mistake 3: Assuming all groups of a given order are isomorphic Groups of order (for prime ) are always abelian, but groups of order are not all isomorphic. For example, there are two groups of order 8 that are non-abelian: and . Always check whether the group is abelian before assuming a unique structure.
Cross-References
Section titled “Cross-References”Groups: Problem 1 directly applies group order and element order from the foundational groups chapter.
Rings: Several problems involve ring-theoretic constructions such as polynomial rings and ideals.
Field Theory: The field extension problems in this set build on irreducibility and algebraic closure.
Sylow Theorems: Problems on group classification rely on Sylow analysis for determining subgroup structure.