Abstract Algebra Tutorial
Learn Abstract Algebra step by step: 37 lessons in 9 chapters with examples, quizzes, diagrams and practice.
Start learning →
of lessons completed
Getting Started
- What Is Abstract Algebra? Meet abstract algebra: the study of structures like groups, rings and fields, and why one set of rules can describe clocks, symmetries and codes.
- Sets, Functions and Relations Review the language of abstract algebra: sets, functions, injective and surjective maps, bijections and equivalence relations, with runnable checkers.
- Binary Operations Learn what a binary operation is and how to test closure, associativity, commutativity, identity and inverses, using a small property checker in Python.
- Modular Arithmetic and the Integers Review the division algorithm, gcd, the Euclidean algorithm and arithmetic mod n, and find which residues have multiplicative inverses.
Groups and Subgroups
- What Is a Group? Learn the four group axioms (closure, associativity, identity, inverses), see examples and non-examples, and test any finite operation with a checker.
- Group Tables and Small Groups Use Cayley tables to explore groups of order 1 to 6, spot the Latin square property and see why the cyclic group of order 4 differs from the Klein four-group.
- Basic Properties of Groups Prove that identities and inverses are unique, that groups allow cancellation, that (ab)โปยน = bโปยนaโปยน, and learn the order of an element with runnable checks.
- Subgroups and the Subgroup Test Define subgroups, use the one-step and two-step subgroup tests, find all subgroups of Z12 by brute force and meet the center and the subgroup generated by a set.
- Dihedral Groups Build the dihedral group D_n of rotations and reflections of a regular n-gon, find its order 2n, relations and center, and compute with it in Python.
Cyclic and Permutation Groups
- Cyclic Groups Learn what a cyclic group is, find generators of Z_n, discover primitive roots in groups of units, and see why every cyclic group is abelian.
- Subgroups and Orders in Cyclic Groups Prove that subgroups of cyclic groups are cyclic, that Z_n has exactly one subgroup for each divisor of n, and count elements of each order with the totient.
- Permutations and Cycle Notation Understand permutations as bijections, compose them, write them as disjoint cycles, compute their order with lcm, and code it all in Python.
- Symmetric Groups and Parity Meet the symmetric group S_n, write permutations as transpositions, define even and odd permutations, and build the alternating group A_n of order n!/2.
- Cayley's Theorem See why every finite group sits inside a symmetric group: build the left regular representation of a group in Python and check it respects the operation.
Cosets and Lagrange
- Cosets Define left and right cosets of a subgroup, see that cosets partition a group into equal-sized pieces, and compare them in Z12 and the non-abelian S3.
- Lagrange's Theorem Prove Lagrange's theorem that the order of a subgroup divides the order of the group, check it by computer in S3, and see why the converse fails.
- Consequences of Lagrange's Theorem Use Lagrange to show element orders divide |G|, that groups of prime order are cyclic, and to prove Fermat's little theorem and Euler's theorem.
- Group Actions, Orbits and Stabilizers Learn how groups act on sets, prove the orbit-stabilizer theorem with cosets, and count necklaces with Burnside's lemma using Python.
Homomorphisms and Quotient Groups
- Group Homomorphisms Learn what a group homomorphism is, why it preserves identity and inverses, and how to test maps between finite groups with a brute-force Python checker.
- Kernel and Image of a Homomorphism Compute the kernel and image of a group homomorphism, see why a trivial kernel means injective, and explore both with runnable Python examples.
- Normal Subgroups Understand normal subgroups through conjugation and cosets, test normality in S3 with Python, and see why every kernel is normal.
- Quotient Groups Build the quotient group G/N from the cosets of a normal subgroup, see why normality makes the operation well defined, and compute Z12/<4> in Python.
- The First Isomorphism Theorem State and prove the first isomorphism theorem G/ker f โ im f, then check it by computer for maps on Z12 and the sign map on S3.
Rings and Ideals
- Rings: The Definition Learn the ring axioms, meet rings such as the integers, Z_n, polynomials and matrices, and test the axioms with a short Python checker.
- Units, Zero Divisors and Integral Domains Find the units and zero divisors of Z_n, learn when a ring is an integral domain or a field, and verify the rules with Python.
- Ideals Learn what an ideal of a ring is, why it plays the role of a normal subgroup, and enumerate all ideals of Z_12 with a brute-force Python search.
- Quotient Rings Build the quotient ring R/I from an ideal, see why ideals make the operations well defined, and find which quotients of Z_12 are fields.
Fields and Polynomial Rings
- Polynomial Rings Study the polynomial ring F[x] over a field, implement the division algorithm over Z_p from scratch, and use it for gcds, roots and the factor theorem.
- Irreducible Polynomials Learn when a polynomial is irreducible, use the root test for degrees 2 and 3, list irreducibles over Z_2 and count them with a formula, all in Python.
- Finite Fields Construct finite fields GF(4), GF(8) and GF(16) as quotients of Z_p[x] by an irreducible polynomial and verify the field axioms and primitive elements in Python.
- Field Extensions Learn field extensions, degree, minimal polynomials and the tower law, with Python examples that build Q(sqrt 2) and compute algebraic degrees with sympy.
Applications: Codes and Cryptography
- Linear Codes and Hamming Codes See how vector spaces over the field Z_2 give error-correcting codes: build the Hamming (7,4) code, compute its distance and correct errors in Python.
- RSA from Scratch Understand why RSA works using the unit group of Z_n and Euler's theorem, then build a toy RSA with the extended Euclidean algorithm in Python.
- Diffie-Hellman and Discrete Logarithms Use cyclic groups and primitive roots to run a Diffie-Hellman key exchange, then attack a toy instance with baby-step giant-step in Python.
Projects and Practice
- Practice: Homomorphisms and Quotients Practice set on group homomorphisms, kernels, normal subgroups and quotient groups, with a Python checker for each problem and worked answers.
- Practice: Rings, Ideals and Fields Practice set on units, zero divisors, ideals, quotient rings, irreducible polynomials and finite fields, each checked by a short Python program.
- Project: A Group Explorer Build a small program that takes any finite group, finds its subgroups, center and normal subgroups, forms quotient groups and compares groups.