Overview
Fall 2024. Offered as a graduate course; taken for undergraduate credit.
Abstract algebra studies sets equipped with operations that obey a few stated rules, and asks what follows from the rules alone. The integers with addition and multiplication are the model. Many other systems obey the same rules or a subset of them: the remainders on division by 12, polynomials, matrices, the symmetries of a square, the moves of a Rubik's cube. A theorem proved from the rules holds in all of them at once. Two kinds of structure dominate a first course. A ring has an addition and a multiplication that behave much like those of the integers. A group has a single operation that can always be undone, as a symmetry can be reversed.
The course taught rings first, following Hungerford's Abstract Algebra: An Introduction (3rd ed., 2014). It opened with the arithmetic of the integers, because nearly every idea in ring theory is first an idea about whole numbers: division with remainder, greatest common divisors, primes and unique factorization, and arithmetic with remainders. Rings were then defined to capture what those arguments used, and the theory was applied to public-key cryptography and to polynomials, where the same ideas build new number systems such as the finite fields. Groups came last, with the symmetries of polygons and the Rubik's cube as examples, and the course ended with quotient groups and the first isomorphism theorem, the group version of a result already seen for rings.
How the articles are written
The articles are written for a reader meeting proofs in algebra for the first time. Every result that the course proved is stated precisely and proved in full, with each step justified and each symbol defined, and the proofs and examples are our own rather than the textbook's. Each article carries one example of its own from beginning to end, so that the reader can follow a single case through every definition and theorem. The first unit, for instance, follows the numbers 1729 and 1001 from the Euclidean algorithm to their prime factorizations.
Every computed example is checked by a script in the site's repository
(tools/experiments/abstract-algebra/, one per article), which prints the numbers that
the article uses, and figures are drawn by scripts from the same data. Definitions and theorems are
cited to the course text and to Judson's free textbook Abstract Algebra: Theory and
Applications, which the reader can consult online; historical claims are cited to the
original sources. Each article says which sections of the course text it corresponds to.
The articles do not work the textbook's exercises or the course's assignments. Where an exercise establishes a result that later material needs, the result is stated as a proposition and proved with different numbers.
Topics
The units below are in the order the course covered them. Each leads to a page of detailed articles; units without a link are still being written.
- Arithmetic in the integers. The division algorithm, the greatest common divisor and the Euclidean algorithm, and unique factorization into primes.
- Congruence and modular arithmetic. Equivalence relations, congruence modulo $n$, and the integers modulo $n$, with their units and zero divisors.
- Rings. The definition and first properties of a ring, integral domains and fields, subrings and direct products.
- Public-key cryptography. Fermat's little theorem and the RSA cryptosystem.
- Polynomial arithmetic. Polynomial rings, division with remainder over a field, and irreducible polynomials.
- Congruence in polynomial rings and field extensions. Congruence modulo a polynomial and the fields built from irreducible polynomials.
- Homomorphisms and the Chinese remainder theorem. Maps that respect both ring operations, isomorphisms, and the Chinese remainder theorem.
- Ideals and quotient rings. Ideals, principal ideal domains, quotient rings, prime and maximal ideals, and the first isomorphism theorem for rings.
- Groups. Dihedral, symmetric and Rubik's cube groups, subgroups, cyclic groups, homomorphisms, and Cayley's theorem.
- Cosets, normal subgroups and quotient groups. Lagrange's theorem, quotient groups, and the first isomorphism theorem for groups.
References
- Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.). Brooks/Cole, Cengage Learning. The course text.
- Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026). Free online at judsonbooks.org.