Definitions, claims, and proof checks by unit
Each unit names the actual skills, demonstrates one complete case, and identifies the mistake most likely to change the result.
Groups
You can check whether a set with an operation forms a group and read a group table. You can also find the order of an element inside it.
Claims to justify
- Test closure, identity, inverses and associativity on a small set.
- Find the order of the element 2 in the integers mod 6 under addition.
- Explain why the integers under subtraction fail to be a group.
Worked example: Is {1, 2, 3, 4} a group under multiplication modulo 5?
- The identity is 1, and 2 x 3 = 6 = 1, so 2 and 3 invert each other
- 4 x 4 = 16 = 1, so 4 is its own inverse
- Yes, it is a group of order 4
Unsupported step: Including 0 in the set: 0 has no multiplicative inverse mod 5, so {0, 1, 2, 3, 4} fails the group test on that one element.
Subgroups
You can decide whether a smaller set inside a group is itself a group, and use Lagrange's theorem on the sizes. You can also list the cosets it produces.
Claims to justify
- Apply the one-step subgroup test.
- Use Lagrange's theorem: a subgroup's order divides the group's order.
- List the left cosets of a subgroup of order 3 inside a group of order 12.
Worked example: Can a group of order 12 have a subgroup of order 5?
- Lagrange: the subgroup's order has to divide 12
- The divisors of 12 are 1, 2, 3, 4, 6 and 12
- No, because 5 is not on that list
Unsupported step: Reading Lagrange's theorem backwards: assuming every divisor gives a subgroup, though the group A4 of order 12 has no subgroup of order 6.
Homomorphisms
You can map one group into another so the operation survives, then find the kernel and the image. You can also decide whether the map is an isomorphism.
Claims to justify
- Verify that a proposed map sends products to products.
- Find the kernel as everything that lands on the identity.
- Show that a trivial kernel makes the map one-to-one.
Worked example: Map each integer to its remainder mod 4. Find the kernel.
- The kernel is every n whose remainder is 0
- That is 0, 4, -4, 8, -8 and so on
- The kernel is the set of all multiples of 4
Unsupported step: Calling the kernel {0}: only the single integer 0 gets listed, though every other multiple of 4 also lands on the identity.
Quotient groups
You can build a new group whose elements are whole cosets, once the subgroup is normal. You can also apply the first isomorphism theorem.
Claims to justify
- Check normality by conjugating the subgroup and getting it back.
- List the elements of the integers mod 4 as four cosets.
- Use the first isomorphism theorem to identify a quotient with an image.
Worked example: Describe the integers mod 4 as a quotient group
- Take the group of integers and the subgroup of multiples of 4
- The cosets are 0 + N, 1 + N, 2 + N and 3 + N
- A group of order 4
Unsupported step: Building a quotient by a subgroup that is not normal: in S3 the two-element subgroup generated by a single swap is not normal, so its cosets do not multiply consistently.
Rings and ideals
You can work with a set that carries both addition and multiplication and find its ideals. You can also spot zero divisors hiding inside it.
Claims to justify
- Check whether a subset absorbs multiplication and so forms an ideal.
- Find the zero divisors in the integers mod 6.
- Tell an integral domain apart from a general ring.
Worked example: Find zero divisors in the integers modulo 6
- 2 x 3 = 6, which is 0 mod 6
- Neither 2 nor 3 is itself zero
- 2 and 3 are zero divisors, so this ring is not an integral domain
Unsupported step: Assuming a product of zero forces one factor to be zero: that holds in the ordinary integers but fails mod 6, where 2 x 3 = 0.
Polynomial rings
You can divide, factor and test irreducibility for polynomials whose coefficients live in a ring or field. You can also apply Eisenstein's criterion.
Claims to justify
- Divide one polynomial by another and read off the remainder.
- Apply Eisenstein's criterion with a chosen prime.
- Explain why a polynomial can be irreducible over one field and not another.
Worked example: Is x squared + 1 irreducible over the reals? Over the complex numbers?
- Over the reals it has no root, since x squared is never negative
- Over the complex numbers it factors as (x + i)(x - I)
- Irreducible over the reals, reducible over the complex numbers
Unsupported step: Calling a polynomial irreducible without naming the field: x squared - 2 is irreducible over the rationals but splits over the reals.
Field extensions
You can build a larger field by adding a root and measure how much larger it is with a degree. You can also multiply degrees through a chain with the tower rule.
Claims to justify
- Find the minimal polynomial of the square root of 2 over the rationals.
- Compute the degree of that extension.
- Use the tower rule to multiply degrees along a chain of fields.
Worked example: Find the degree of the rationals extended by the square root of 2
- The square root of 2 is a root of x squared - 2, which does not factor over the rationals
- A basis for the extension is 1 and the square root of 2
- Degree 2
Unsupported step: Reading the degree off the root symbol instead of the minimal polynomial: calling the cube root of 2 a degree-2 extension when x cubed - 2 makes it degree 3.
Read, attempt, challenge, and revise an argument
Short cycles create evidence that the idea is becoming usable rather than merely familiar.
Define
Write the definitions and assumptions that the claim can use.
Attempt
Build the argument without consulting a model proof.
Challenge
Search for a missing direction, edge case, or unsupported implication.
Revise
Repair the earliest logical gap and present the dependency clearly.
Trace the dependency of each claim
Definitions and earlier results supply the reasons used later, so repair the first unsupported step.
Questions about studying Abstract Algebra
Where should I begin in this course?
Start with the earliest unit whose definitions or notation you cannot explain from memory. Later units often depend on that foundation even when the current assignment looks different.
When should I move to the next unit?
Move on after you can choose the method on a changed problem, complete it without copying a model, and check the answer independently.
How should I use the practice workspace?
Begin without a hint, record the first uncertain decision, repair only that connection, and then answer a fresh question to test whether the repair transferred.