Abstract Algebra: Theory and Applications PDF Download – Judson (2026 Edition) BS Math

BS Mathematics students taking Abstract Algebra (sometimes called Modern Algebra) can download the complete textbook “Abstract Algebra: Theory and Applications” by Thomas W. Judson, free under the GNU Free Documentation License from the author’s own official site. It is an upper-division, proof-driven text built in two halves: the first develops group theory from scratch through the Sylow Theorems, and the second develops rings, integral domains, Boolean algebras, vector spaces, and fields, closing with Galois Theory.

This book is aimed squarely at BS Math juniors and seniors preparing for their Abstract Algebra board and semester exams, and it is unusually exam-friendly for a proof-heavy subject: every one of its 23 chapters ends with a substantial exercise set — 916 exercises in total, ranging from routine computation to full theoretical proofs — plus reading questions to check understanding before class. The Annual Edition 2026 is the most recently updated release, so nothing in it has gone stale.

Book Overview

Chapter List

Chapter 1: Preliminaries

Difficulty: Medium · Key topics: proof technique, set operations, De Morgan’s Laws, mappings, equivalence relations, partitions

This opening chapter builds the toolkit every later chapter assumes: a short note on how to read and write mathematical proofs, followed by a full treatment of sets and equivalence relations. It covers the standard set operations — union, intersection, complement, and difference — and proves De Morgan’s Laws relating them. It then turns to mappings between sets, proving that composition of mappings is associative and that a mapping is invertible exactly when it is both one-to-one and onto. The chapter closes on equivalence relations, proving the central correspondence: an equivalence relation on a set always produces a partition of that set into equivalence classes, and conversely, any partition defines an equivalence relation.

Key Points:

• Set operations — union, intersection, complement, difference — are linked by De Morgan’s Laws
• A mapping is invertible if and only if it is both one-to-one (injective) and onto (surjective)
• Composition of mappings is always associative: (h ∘ g) ∘ f = h ∘ (g ∘ f)
• An equivalence relation on a set X corresponds exactly to a partition of X into equivalence classes
• Two equivalence classes of the same relation are always either disjoint or identical — never partially overlapping

Memory Tip: Think of equivalence classes as labeled bins — everything inside one bin is related to everything else in it, and no element is ever split across two bins.

Common Mistake: Calling a relation an equivalence relation after checking only two of the three required properties. All three — reflexive, symmetric, and transitive — must hold; skipping the reflexive check is the one students miss most.

Important Questions:

• What three properties must a relation satisfy to be an equivalence relation? It must be reflexive (every element relates to itself), symmetric (a~b implies b~a), and transitive (a~b and b~c implies a~c).
• When is a mapping invertible? Exactly when it is both one-to-one (injective) and onto (surjective) — that is, bijective.

Chapter 2: The Integers

Difficulty: Medium · Key topics: mathematical induction, well-ordering, division algorithm, gcd as a linear combination, Fundamental Theorem of Arithmetic

This chapter investigates the fundamental properties of the integers that the rest of the book builds on. It opens by proving that the Principle of Mathematical Induction and the Principle of Well-Ordering are logically equivalent — each can be used to prove the other. It then proves the Division Algorithm (unique quotient and remainder for any integer division), and uses it to show that the greatest common divisor of two integers can always be written as an integer linear combination of them. The chapter closes with two landmark results: Euclid’s proof that infinitely many primes exist, and the Fundamental Theorem of Arithmetic, which guarantees every integer greater than 1 factors into primes in exactly one way.

Key Points:

• The Principle of Mathematical Induction and the Principle of Well-Ordering are logically equivalent
• Division Algorithm: for integers a, b with b > 0, there exist unique integers q, r with a = bq + r and 0 ≤ r < b
• gcd(a, b) can always be written as an integer linear combination ar + bs (Bézout’s identity)
• Euclid’s Lemma: if a prime p divides ab, then p divides a or p divides b
• Fundamental Theorem of Arithmetic: every integer greater than 1 factors into primes, and that factorization is unique

Memory Tip: Bezout’s identity is what the Extended Euclidean Algorithm actually computes — if you can run the algorithm by hand, you already know how to find r and s for gcd(a,b) = ar + bs.

Common Mistake: Treating unique factorization as too obvious to need a proof. Uniqueness genuinely depends on Euclid’s Lemma (p | ab ⇒ p | a or p | b) — without it, factorization into irreducibles can fail to be unique, exactly as it does in some other number systems covered later in the book.

Important Questions:

• State the Division Algorithm. Given integers a and b with b > 0, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b.
• What does the Fundamental Theorem of Arithmetic say? Every integer greater than 1 can be written as a product of primes, and this factorization is unique up to the order of the factors.

Chapter 3: Groups

Difficulty: Hard · Key topics: group axioms, ℤₙ arithmetic, exponent laws, subgroups, one-step subgroup test

The book’s first real algebraic structure. It opens by building ℤₙ (the integers mod n) as a concrete, familiar example of arithmetic satisfying closure, associativity, an identity, and inverses — the four group axioms — before giving the formal definition of a group and working through further examples. It proves that the equations ax = b and xa = b always have unique solutions in a group, that (ab)⁻¹ = b⁻¹a⁻¹ (inverses reverse order), and that the usual laws of exponents hold. The chapter closes with subgroups, proving the one-step subgroup test: a nonempty subset H of G is a subgroup exactly when gh⁻¹ ∈ H for every g, h ∈ H.

Key Points:

• A group is a set with one operation satisfying closure, associativity, an identity element, and inverses for every element
• ℤₙ (integers mod n) under addition is the book’s first concrete group example
• The equations ax = b and xa = b always have unique solutions in a group
• (ab)⁻¹ = b⁻¹a⁻¹ — inverses reverse order under a product
• The usual laws of exponents hold in any group: g^mgⁿ = g^m+n and (g^m)ⁿ = g^mn
• One-Step Subgroup Test: a nonempty subset H of G is a subgroup if and only if gh⁻¹ ∈ H for all g, h ∈ H

Memory Tip: Closure and an identity are usually the quick checks when verifying a group — inverses are where most non-examples fail (the integers under multiplication have an identity, 1, but almost no element has an inverse).

Common Mistake: Assuming any set with an operation and an identity element is automatically a group, without checking that every single element has an inverse.

Important Questions:

• What are the four group axioms? Closure, associativity, existence of an identity element, and existence of an inverse for every element.
• State the one-step subgroup test. A nonempty subset H of a group G is a subgroup of G if and only if gh⁻¹ ∈ H for all g, h ∈ H.

Chapter 4: Cyclic Groups

Difficulty: Medium · Key topics: generated subgroups, cyclic groups are abelian, order of a^k, generators of ℤₙ, method of repeated squares

Cyclic groups — the groups generated by a single element — are among the simplest and most important groups to fully understand. The chapter proves that ⁨a⁩ = {a^k : k ∈ ℤ} is always a subgroup, that every cyclic group is abelian, and that every subgroup of a cyclic group is itself cyclic. It gives a precise formula for the order of a^k in a cyclic group of order n (it equals n divided by gcd(k,n)), and identifies exactly which integers generate ℤₙ. A section on the multiplicative group of complex numbers connects cyclic groups to polar form and roots of unity, and the chapter closes with the method of repeated squares, an efficient algorithm for computing large powers modulo n that underlies modern cryptography.

Key Points:

• ⁨a⁩ = {a^k : k ∈ ℤ} is always a subgroup of G, generated by a
• Every cyclic group is abelian, though not every abelian group is cyclic
• Every subgroup of a cyclic group is itself cyclic
• In a cyclic group of order n with generator a, the element a^k has order n / gcd(k, n)
• The generators of ℤₙ are exactly the integers r with 1 ≤ r < n and gcd(r, n) = 1
• The method of repeated squares computes aⁿ mod m efficiently, without multiplying a by itself n times

Practice Tip: Practice the method of repeated squares by hand on a small case, such as 3⁶⁵ mod 7 — write the exponent in binary first, then square and multiply only where a binary digit is 1.

Common Mistake: Assuming a cyclic group’s generator is unique. Most cyclic groups have several generators — ℤ₆ has two, generated by both 1 and 5.

Important Questions:

• How many generators does ℤₙ have? Exactly φ(n) of them — the integers r with 1 ≤ r < n and gcd(r, n) = 1.
• True or false: every subgroup of a cyclic group is cyclic. True — this is one of the chapter’s core theorems, proved directly from the well-ordering principle.

Chapter 5: Permutation Groups

Difficulty: Hard · Key topics: permutations as bijections, cycle notation, even/odd permutations, dihedral groups, symmetries of the cube

Permutation groups give the book’s richest early source of nonabelian examples. The chapter defines a permutation of a set S as a bijection π: S → S, introduces cycle notation, and proves that although a permutation can be written as a product of transpositions in more than one way, the parity — even or odd — of that count is always the same, no matter how it’s decomposed. It then studies the dihedral group D_n, the symmetry group of a regular n-gon, proving it consists of all products of a rotation r (order n) and a reflection s (order 2) satisfying srs = r⁻¹. A worked example shows that the rigid-motion symmetry group of a cube has exactly 24 elements.

Key Points:

• A permutation of a set S is a bijection π: S → S; S_n, the symmetric group on n symbols, has n! elements
• Every permutation can be written as a product of transpositions, and its parity (even or odd) never changes across different decompositions
• The dihedral group D_n has 2n elements, generated by a rotation r of order n and a reflection s of order 2, satisfying srs = r⁻¹
• The group of rigid motions of a cube has exactly 24 elements
• Permutation multiplication is function composition, so order matters — S_n is nonabelian for n ≥ 3

Memory Tip: Parity of a permutation works like parity of swaps needed to sort a shuffled list — however you decompose it into transpositions, the even/odd count never flips.

Common Mistake: Applying permutations in the wrong order. Because permutation multiplication is function composition, the convention for whether you apply the rightmost or leftmost permutation first must be fixed and used consistently throughout a calculation.

Important Questions:

• What is the defining relation between the rotation r and reflection s in the dihedral group D_n? srs = r⁻¹, where r has order n and s has order 2.
• Is the parity of a permutation always well-defined? Yes — although a permutation can be decomposed into transpositions in many different ways, the number of transpositions used is always entirely even or entirely odd for that permutation.

Chapter 6: Cosets and Lagrange’s Theorem

Difficulty: Hard · Key topics: left/right cosets, Lagrange’s Theorem, Euler’s Theorem, Fermat’s Little Theorem

One of the most important results in finite group theory. The chapter proves that the left cosets of a subgroup H always partition the group G, and that the number of left cosets equals the number of right cosets — this common count is the index [G:H]. That sets up Lagrange’s Theorem itself: for a finite group G and subgroup H, |H| always divides |G|. Direct corollaries follow — every element’s order divides the order of the group, and a group of prime order is always cyclic. The chapter then applies coset counting to number theory, proving Euler’s Theorem and Fermat’s Little Theorem, and closes by showing the converse of Lagrange’s Theorem is false: A₄ has order 12 but no subgroup of order 6.

Key Points:

• Lagrange’s Theorem: for a finite group G and subgroup H, |H| divides |G|, with |G|/|H| = [G:H]
• The left cosets of H partition G, and the number of left cosets always equals the number of right cosets
• Every element’s order divides the order of the group — a direct corollary of Lagrange’s Theorem
• A group of prime order is always cyclic
• Euler’s Theorem: if gcd(a, n) = 1 then a^φ(n) ≡ 1 (mod n); Fermat’s Little Theorem is the special case n = p prime
• The converse of Lagrange’s Theorem is false — A₄ has order 12 but no subgroup of order 6

Memory Tip: Picture cosets as equal-sized tiles that exactly cover the group — that’s literally why |H| must divide |G|.

Common Mistake: Assuming Lagrange’s Theorem runs in both directions. A divisor of |G| does not guarantee a subgroup of that order exists — A₄ (order 12, no subgroup of order 6) is the book’s own standard counterexample.

Important Questions:

• What does Lagrange’s Theorem say? If H is a subgroup of a finite group G, then |H| divides |G|.
• Give a counterexample showing the converse of Lagrange’s Theorem is false. A₄ has order 12 (and 6 divides 12), but A₄ has no subgroup of order 6.

Chapter 7: Introduction to Cryptography

Difficulty: Medium · Key topics: plaintext/ciphertext, private-key cryptosystems, public-key cryptosystems

The book’s first applied chapter, and it applies the group and number theory from Chapters 2, 4 and 6 directly. It defines a cryptosystem as an encryption transformation paired with a decryption transformation between plaintext and ciphertext, and introduces classical private-key (symmetric) cryptosystems, where a single secret key is shared by sender and receiver. The chapter’s second half turns to public-key cryptography, where two separate keys are used — an encoding key that can safely be published, and a decoding key that stays secret — so that anyone can encrypt a message to a recipient, but only that recipient can decrypt it.

Key Points:

• A cryptosystem pairs an encryption transformation (plaintext to ciphertext) with a decryption transformation (ciphertext back to plaintext)
• A classical private-key (symmetric) cryptosystem uses one secret key, shared by both sender and receiver
• A public-key cryptosystem uses two separate keys — an encoding key that can be published openly, and a decoding key that stays secret
• Public-key systems let anyone encrypt a message to a recipient, while only that recipient can decrypt it
• This chapter is a direct application of the modular arithmetic and group theory built up in earlier chapters

Practice Tip: Work through encrypting and decrypting a short message by hand with a simple shift cipher first, before tackling the modular-exponentiation arithmetic behind public-key systems.

Common Mistake: Confusing the public encoding key with the private decoding key — the whole point of a public-key system is that knowing the encoding key does not let you efficiently determine the decoding key.

Important Questions:

• What is the key difference between a private-key and a public-key cryptosystem? A private-key system uses one shared secret key for both encoding and decoding; a public-key system uses two separate keys, where the encoding key can be made public without compromising the decoding key.
• Why can the encoding key in a public-key cryptosystem be published safely? Because knowledge of the encoding key alone does not give enough information to efficiently determine the decoding key.

Chapter 8: Algebraic Coding Theory

Difficulty: Hard · Key topics: error-detecting/correcting codes, linear codes, parity-check and generator matrices, syndrome decoding

A second applied chapter, showing how linear algebra over finite fields solves a real communications problem: recovering a message sent over a noisy channel. It proves that a code with minimum distance d_min = 2n + 1 can correct any n or fewer errors and detect up to 2n errors, and characterizes exactly when the null space of a binary matrix H is a single-error-detecting code (no column of H is entirely zero). The chapter develops linear codes as subspaces of ℤ₂ⁿ, describable by a generator matrix or a parity-check matrix, and closes with syndrome decoding, an efficient method for locating and correcting the actual errors in a received message.

Key Points:

• A code with minimum distance d_min = 2n + 1 corrects any n or fewer errors, and detects up to 2n errors
• A linear code is a subspace of ℤ₂ⁿ, described compactly by a generator matrix or a parity-check matrix
• The null space of a parity-check matrix H is single-error-detecting exactly when no column of H is entirely zero
• Syndrome decoding uses the received vector’s error syndrome to locate and correct errors without searching the whole code
• All arithmetic in a binary linear code is done modulo 2

Practice Tip: Build a small parity-check matrix by hand and encode/decode a 4-bit message — the arithmetic is entirely mod 2, so it is quick to check by hand.

Common Mistake: Treating a column sum in a binary code like ordinary integer addition instead of XOR (addition mod 2), which silently produces the wrong syndrome.

Important Questions:

• What does it mean for a code to have minimum distance d_min = 2n + 1? It can correct any n or fewer transmission errors, and detect any 2n or fewer errors.
• When is the null space of a binary matrix H a single-error-detecting code? Exactly when no column of H consists entirely of zeros.

Chapter 9: Isomorphisms

Difficulty: Hard · Key topics: isomorphism definition, Cayley’s Theorem, direct products, order of (g,h)

This chapter formalizes what it means for two groups to be “the same” group in disguise. It proves that isomorphism is an equivalence relation on the class of all groups, that every infinite cyclic group is isomorphic to ℤ, and that every finite cyclic group of order n is isomorphic to ℤₙ. The chapter’s centerpiece is Cayley’s Theorem: every group, no matter how it is defined, is isomorphic to a group of permutations. The second half studies direct products, proving that the order of (g, h) in G × H is the least common multiple of the orders of g and h, and identifying exactly when ℤₘ × ℤₙ is isomorphic to ℤₘₙ (precisely when gcd(m, n) = 1).

Key Points:

• Two groups are isomorphic if a bijection between them preserves the group operation — isomorphic groups are structurally identical
• Isomorphism is an equivalence relation on the class of all groups
• Every infinite cyclic group is isomorphic to ℤ; every finite cyclic group of order n is isomorphic to ℤₙ
• Cayley’s Theorem: every group is isomorphic to a group of permutations
• The order of (g, h) in a direct product G × H is the least common multiple of the orders of g and h
• ℤₘ × ℤₙ is isomorphic to ℤₘₙ exactly when gcd(m, n) = 1

Memory Tip: Before trying to build an isomorphism, compare order, abelian-ness, and element orders first — if any of those differ between two groups, they cannot be isomorphic, and you’ve saved yourself the work of searching for a map that doesn’t exist.

Common Mistake: Trying to prove two groups are isomorphic by matching up only a few elements, instead of exhibiting one explicit, operation-preserving bijection between the entire groups.

Important Questions:

• What does Cayley’s Theorem say? Every group is isomorphic to a group of permutations — a subgroup of some symmetric group.
• Under what condition is ℤₘ × ℤₙ isomorphic to ℤₘₙ? Exactly when gcd(m, n) = 1.

Chapter 10: Normal Subgroups and Factor Groups

Difficulty: Hard · Key topics: normal subgroups, factor groups, simplicity of the alternating group

Not every subgroup H of G satisfies gH = Hg for every g — the ones that do are called normal, and the chapter proves several equivalent ways to characterize them. Only normal subgroups let you form a factor group G/N with a well-defined operation, which the chapter sets up carefully. The second half proves a landmark structural result: the alternating group A_n is simple (has no nontrivial proper normal subgroups) for n ≥ 5. The proof builds up through three lemmas about 3-cycles — A_n is generated by them, and any nontrivial normal subgroup of A_n must contain one.

Key Points:

• A subgroup N of G is normal exactly when gNg⁻¹ = N (equivalently gN = Ng) for every g ∈ G
• Only normal subgroups allow a well-defined factor (quotient) group G/N to be formed
• The alternating group A_n is simple — no nontrivial proper normal subgroups — for n ≥ 5
• The simplicity proof works up through 3-cycles: A_n is generated by them, and any nontrivial normal subgroup must contain one
• Simplicity of A_n for n ≥ 5 is the group-theoretic fact behind why the general quintic has no solution by radicals (developed fully in the Galois Theory chapter)

Memory Tip: Normal = “sandwich-safe” — conjugating any element of N by any g ∈ G lands back inside N, so N survives being sandwiched between g and g⁻¹.

Common Mistake: Assuming every subgroup is normal. In a nonabelian group most subgroups are not — always check gNg⁻¹ ⊆ N (or find a counterexample) rather than assuming it.

Important Questions:

• What does it mean for a subgroup N of G to be normal? gNg⁻¹ = N (equivalently gN = Ng) for every g ∈ G, so left and right cosets of N always coincide.
• For which n is the alternating group A_n simple? For n ≥ 5 — one of this chapter’s central results.

Chapter 11: Homomorphisms

Difficulty: Hard · Key topics: homomorphism vs. isomorphism, kernel, First/Second/Third Isomorphism Theorems, Correspondence Theorem

A homomorphism relaxes an isomorphism’s bijectivity requirement — it is any map between groups that preserves the operation, whether or not it is one-to-one or onto. The chapter proves the kernel of any homomorphism is always a normal subgroup of the domain, which sets up its central result, the First Isomorphism Theorem: if ψ: G → H is a homomorphism with kernel K, then G/K is isomorphic to the image of ψ. The Second and Third Isomorphism Theorems relate factor groups built from different subgroups, and the Correspondence Theorem sets up a one-to-one match between subgroups of G containing N and subgroups of G/N.

Key Points:

• A homomorphism preserves the group operation but need not be bijective; an isomorphism is a bijective homomorphism
• The kernel of any group homomorphism is always a normal subgroup of the domain
• First Isomorphism Theorem: if ψ: G → H is a homomorphism with kernel K, then G/K is isomorphic to the image of ψ
• Second Isomorphism Theorem: for subgroup H and normal subgroup N of G, H/(H ∩ N) is isomorphic to HN/N
• Third Isomorphism Theorem: for normal subgroups N ⊆ H of G, G/H is isomorphic to (G/N)/(H/N)
• The Correspondence Theorem matches subgroups of G containing N one-to-one with subgroups of G/N

Memory Tip: The First Isomorphism Theorem is the engine behind the rest of the chapter — G/ker(ψ) ≅ image(ψ) means every homomorphism secretly is an isomorphism, once you quotient out its kernel.

Common Mistake: Building a factor group G/K from a homomorphism’s kernel without stating why K is normal — it is automatic, but a proof needs the reason stated, not assumed.

Important Questions:

• State the First Isomorphism Theorem. If ψ: G → H is a group homomorphism with kernel K, then K is normal in G, and G/K is isomorphic to the image of ψ.
• Is the kernel of a group homomorphism always a normal subgroup? Yes — this holds for every group homomorphism, and it is exactly what makes the First Isomorphism Theorem work.

Chapter 12: Matrix Groups and Symmetry

Difficulty: Medium · Key topics: general linear group, special linear group, orthogonal group, symmetry groups

Motivated by Felix Klein’s Erlangen program — treating geometry as the study of properties invariant under a transformation group — this chapter studies classical matrix groups directly. It defines the general linear group GL(n, F) (all invertible n × n matrices over a field F), the special linear group SL(n, F) (the subgroup with determinant 1), and the orthogonal group, proving that a matrix A is orthogonal exactly when A⁻¹ = A^T, equivalently when its columns form an orthonormal set. The second half applies these matrix groups to describe the symmetry groups of concrete geometric figures.

Key Points:

• The general linear group GL(n, F) consists of every invertible n × n matrix over a field F
• The special linear group SL(n, F) is the subgroup of GL(n, F) with determinant exactly 1
• A matrix A is orthogonal exactly when A⁻¹ = A^T, equivalently when its columns form an orthonormal set
• Felix Klein’s Erlangen program — geometry as the study of invariants under a transformation group — is this chapter’s historical motivation
• Matrix groups give a concrete, computable way to describe the symmetry group of a geometric figure

Memory Tip: GL, SL, O form a chain of restrictions — GL is “any invertible matrix”, SL adds “determinant exactly 1”, and orthogonal adds “preserves lengths and angles” (orthonormal columns).

Common Mistake: Assuming every orthogonal matrix has determinant 1. An orthogonal matrix can have determinant −1 (a reflection), so the orthogonal group is not a subset of SL(n).

Important Questions:

• What condition on a matrix A makes it orthogonal? A⁻¹ = A^T, equivalently that the columns of A form an orthonormal set.
• What extra condition distinguishes SL(n) from GL(n)? SL(n) additionally requires determinant exactly 1, while GL(n) only requires the matrix to be invertible (nonzero determinant).

Chapter 13: The Structure of Groups

Difficulty: Hard · Key topics: Fundamental Theorem of Finite Abelian Groups, p-groups, solvable groups

Group theory’s ultimate goal is classifying all groups up to isomorphism, and this chapter fully achieves that for one important class. It proves the Fundamental Theorem of Finite Abelian Groups: every finite abelian group is isomorphic to a direct product of cyclic groups of prime-power order, built up through lemmas showing that a finite abelian group of order divisible by prime p contains an element of order p, and that such a group is a p-group exactly when its order is itself a power of p. The chapter closes by introducing solvable groups — groups with a chain of subgroups from G down to the identity where every consecutive factor is abelian — which become central to the Galois Theory chapter’s proof about polynomial equations.

Key Points:

• The Fundamental Theorem of Finite Abelian Groups: every finite abelian group is isomorphic to a direct product of cyclic groups of prime-power order
• If a prime p divides the order of a finite abelian group G, then G contains an element of order p
• A finite abelian group is a p-group exactly when its order is a power of p
• A solvable group has a chain G = H_n ⊃ … ⊃ H₀ = {e}, where each H_i is normal in H_i+1 and every factor H_i+1/H_i is abelian
• Solvable groups are the structural condition behind which polynomial equations can be solved by radicals

Memory Tip: Every finite abelian group is secretly just a product of ℤ_p^k‘s in disguise — the Fundamental Theorem guarantees there is nothing more exotic out there.

Common Mistake: Treating the decomposition guaranteed by the Fundamental Theorem as easy to find in practice. The theorem guarantees existence and uniqueness, but writing down the actual decomposition for a specific order still requires working through the partitions of each prime’s exponent.

Important Questions:

• What does the Fundamental Theorem of Finite Abelian Groups say? Every finite abelian group is isomorphic to a direct product of cyclic groups whose orders are prime powers.
• What makes a group solvable? It has a chain of subgroups from G down to the trivial group where each subgroup is normal in the next one up, and every consecutive factor group is abelian.

Chapter 14: Group Actions

Difficulty: Hard · Key topics: group actions, orbit-stabilizer theorem, class equation, Burnside’s Counting Theorem

Group actions generalize group multiplication: for a group G acting on a set X, every pair g ∈ G and x ∈ X produces a product gx that again lies in X. The chapter proves the Orbit-Stabilizer Theorem — the size of an element’s orbit equals the index of its stabilizer — and builds the class equation from it, a tool used to prove that any group of order pⁿ has a nontrivial center, with the direct corollary that every group of order p² is abelian. The chapter closes with Burnside’s Counting Theorem, which uses group actions to count distinct configurations up to symmetry, such as the number of genuinely different ways to color a figure.

Key Points:

• A group action of G on a set X assigns to each g ∈ G and x ∈ X a product gx ∈ X, generalizing group multiplication
• Orbit-Stabilizer Theorem: the size of the orbit of x equals [G : G_x], the index of x’s stabilizer
• The class equation organizes a finite group’s elements into conjugacy classes and is a key structural tool
• Any group of order pⁿ (p prime) has a nontrivial center
• A group of order p² is always abelian — a direct corollary of the center result
• Burnside’s Counting Theorem uses group actions to count distinct configurations up to symmetry

Memory Tip: Orbit-Stabilizer is Lagrange’s Theorem wearing a costume — orbit size times stabilizer size always equals |G|, just as a subgroup’s index times its size equals |G|.

Common Mistake: Confusing the orbit of an element (where it can be moved to) with its stabilizer (what fixes it in place) — they answer opposite questions, and the theorem relates their sizes, not their contents.

Important Questions:

• State the Orbit-Stabilizer Theorem. For a finite group G acting on a set X and x ∈ X, the size of the orbit of x equals [G : G_x], the index of the stabilizer of x in G.
• Why must a group of order p² be abelian? Because groups of prime-power order have a nontrivial center, and working through the size of that center forces the whole group to be abelian at order p².

Chapter 15: The Sylow Theorems

Difficulty: Hard · Key topics: Cauchy’s Theorem, existence/conjugacy/count of Sylow p-subgroups, commutator subgroup

The converse of Lagrange’s Theorem is false in general, but the Sylow Theorems provide a genuine partial converse, guaranteeing subgroups of specific prime-power orders. The chapter opens with Cauchy’s Theorem: if a prime p divides |G|, then G has a subgroup of order p. It then builds the three Sylow Theorems — existence of Sylow p-subgroups, that all Sylow p-subgroups of G are conjugate to each other, and that their number is congruent to 1 mod p and divides |G|. A worked application shows that a group of order pq for distinct primes p < q always has a normal subgroup of order q, so it can never be simple, and the chapter closes by proving the commutator subgroup G′ is always normal in G with abelian quotient G/G′.

Key Points:

• Cauchy’s Theorem: if a prime p divides |G|, then G contains an element (hence a subgroup) of order p
• Second Sylow Theorem: all Sylow p-subgroups of a finite group are conjugate to each other
• Third Sylow Theorem: the number of Sylow p-subgroups is congruent to 1 (mod p) and divides |G|
• A group of order pq for distinct primes p < q always has a normal subgroup of order q, so it is never simple
• The Sylow Theorems are a genuine partial converse to Lagrange’s Theorem, guaranteeing subgroups of specific prime-power orders
• The commutator subgroup G′ is always normal in G, and the factor group G/G′ is always abelian

Memory Tip: The three Sylow Theorems answer, in order: does a p-subgroup exist, are they all conjugate, and how many are there.

Common Mistake: Extending the Sylow Theorems into a general converse of Lagrange’s Theorem. They only guarantee subgroups of prime-power order dividing |G| — not a subgroup for every divisor of |G|.

Important Questions:

• What does the Third Sylow Theorem say about the number of Sylow p-subgroups? It is congruent to 1 (mod p) and divides |G|.
• Why can no group of order pq (distinct primes p < q) be simple? It always has a normal Sylow q-subgroup of order q, which is a nontrivial proper normal subgroup.

Chapter 16: Rings

Difficulty: Hard · Key topics: ring axioms, subring test, characteristic, ideals, maximal/prime ideals, Chinese Remainder Theorem

This chapter opens the book’s second half by generalizing from one operation to two. A ring is a set with addition and multiplication linked by the distributive law — the integers are the model example. The chapter proves the subring test (mirroring the earlier subgroup test), shows the characteristic of an integral domain is always 0 or prime, and proves every ideal of ℤ is principal. It develops ring homomorphisms and ideals, proving that an ideal M of a commutative ring R with identity is maximal exactly when R/M is a field, that every maximal ideal is also prime, and closes with a lemma version of the Chinese Remainder Theorem for systems of congruences with coprime moduli.

Key Points:

• A ring is a set with two operations, addition and multiplication, linked by the distributive law
• The subring test mirrors the subgroup test: S is a subring iff S is nonempty, closed under subtraction, and closed under multiplication
• The characteristic of an integral domain is always either 0 or a prime number
• Every ideal of ℤ is a principal ideal, generated by a single element
• An ideal M of a commutative ring R with identity is maximal exactly when the factor ring R/M is a field
• Every maximal ideal in a commutative ring with identity is also a prime ideal (though not conversely)
• The Chinese Remainder Theorem: a system of congruences with coprime moduli always has a solution, unique modulo the product of the moduli

Memory Tip: Maximal ⇒ field, prime ⇒ domain — the strength of the ideal matches the strength of the factor ring it produces.

Common Mistake: Assuming every prime ideal is also maximal. The implication only runs one way (maximal ⇒ prime) — the ideal ⁨x⁩ in ℤ[x] is prime but not maximal.

Important Questions:

• When is an ideal M of a commutative ring R with identity maximal? Exactly when the factor ring R/M is a field.
• Is every maximal ideal also a prime ideal? Yes — every maximal ideal in a commutative ring with identity is prime, though the converse is not true in general.

Chapter 17: Polynomials

Difficulty: Hard · Key topics: polynomial rings, division algorithm for polynomials, Gauss’s Lemma, Eisenstein’s Criterion, Factor Theorem

This chapter builds the algebraic theory of polynomial rings, proving results that closely mirror the integer theory from Chapter 2. It shows R[x] is a commutative ring with identity whenever R is, develops the evaluation homomorphism, and proves that every ideal of F[x] is principal when F is a field — F[x] behaves like ℤ in this respect. It develops two key irreducibility tools, Gauss’s Lemma and Eisenstein’s Criterion, and proves the Factor Theorem (α is a zero of p(x) exactly when x − α divides p(x)) along with the bound that a degree-n polynomial over a field has at most n distinct zeros. The Rational Roots Theorem closes the chapter, narrowing the search for rational zeros of an integer-coefficient polynomial to a finite, computable list.

Key Points:

• If R is a commutative ring with identity, then R[x] (polynomials over R) is also a commutative ring with identity
• Every ideal of F[x], for F a field, is principal
• Eisenstein’s Criterion gives a sufficient condition for a polynomial to be irreducible over ℚ
• Factor Theorem: α ∈ F is a zero of p(x) if and only if (x − α) divides p(x) in F[x]
• A nonzero degree-n polynomial over a field has at most n distinct zeros in that field
• The Rational Roots Theorem narrows the search for rational zeros of an integer-coefficient polynomial to a short, computable list

Practice Tip: Before reaching for Eisenstein’s Criterion, try it with a few different primes — a polynomial can still be irreducible even when the first prime you try fails the criterion’s conditions.

Common Mistake: Applying Eisenstein’s Criterion after checking only one of its three conditions. All three must hold together: p divides every coefficient except the leading one, p does not divide the leading coefficient, and p² does not divide the constant term.

Important Questions:

• State the Factor Theorem for polynomials over a field. α ∈ F is a zero of p(x) ∈ F[x] if and only if (x − α) is a factor of p(x) in F[x].
• What does Eisenstein’s Criterion test for? Irreducibility of an integer-coefficient polynomial over ℚ, using a prime p that divides every coefficient except the leading one, does not divide the leading coefficient, and whose square does not divide the constant term.

Chapter 18: Integral Domains

Difficulty: Hard · Key topics: field of fractions, characteristic and subfields, PID vs. UFD, ℤ[x] as a UFD

The ring of integers is the model for every integral domain, and this chapter generalizes that model. It proves every integral domain D embeds in a field of fractions, where elements behave exactly like the fractions a/b built from ℤ to form ℚ. It shows a field of characteristic 0 always contains a copy of ℚ, and a field of characteristic p always contains a copy of ℤₚ. The chapter’s second half studies factorization, proving that in a PID every irreducible element is automatically prime, that a PID satisfies the ascending chain condition on ideals, and — despite ℤ[x] not being a PID — that ℤ[x] is nonetheless a Unique Factorization Domain, using a UFD version of Gauss’s Lemma.

Key Points:

• Every integral domain D can be embedded in a field of fractions, where elements act like fractions a/b
• A field of characteristic 0 always contains a copy of ℚ; a field of characteristic p always contains a copy of ℤₚ
• In a PID, every irreducible element is automatically prime
• The ring of integer polynomials ℤ[x] is a Unique Factorization Domain, even though it is not a PID
• A PID satisfies the ascending chain condition on ideals — any increasing chain of ideals must eventually stabilize
• Gauss’s Lemma (UFD form): the product of two primitive polynomials is itself primitive

Memory Tip: The field of fractions is just “building ℚ from ℤ” done in general — any integral domain can be fattened up into a field the same way.

Common Mistake: Assuming PID and UFD are interchangeable terms. Every PID is a UFD, but ℤ[x] is a UFD that is not a PID, which is exactly why this chapter proves it separately.

Important Questions:

• What does it mean that every integral domain embeds in a field of fractions? There is always a field built from formal fraction-like classes into which D injects, mirroring how ℤ sits inside ℚ.
• Is every irreducible element in a PID also prime? Yes — this equivalence between irreducible and prime elements is a defining feature of PIDs, and more generally of UFDs.

Chapter 19: Lattices and Boolean Algebras

Difficulty: Medium · Key topics: lattices, join/meet, distributive lattices, classification of finite Boolean algebras, circuits

Ring axioms structure addition and multiplication, but lattices and Boolean algebras generalize a different pair of operations — union/intersection in set theory, or inequality in the number systems. The chapter defines a lattice by four laws on its join (∨) and meet (∧) operations — commutative, associative, idempotent, and absorption — which together induce a natural partial order, and characterizes exactly when a lattice is distributive. Its main result classifies every finite Boolean algebra completely: each one is isomorphic to the power set of some set X. The chapter closes with a genuine application — proving that the set of all switching (electrical) circuits itself forms a Boolean algebra.

Key Points:

• A lattice is a set with join (∨) and meet (∧) operations satisfying commutative, associative, idempotent, and absorption laws, which together define a partial order
• A lattice is distributive exactly when a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) for all elements
• Every finite Boolean algebra is isomorphic to the power set P(X) of some set X — a complete classification
• The atoms of a finite Boolean algebra are its minimal nonzero elements, and every element is a join of the atoms beneath it
• The set of all switching (electrical) circuits forms a Boolean algebra — a direct real-world application

Memory Tip: A finite Boolean algebra is always secretly a power set — once you know its atoms, you know the entire structure, just as knowing a set’s elements tells you its whole power set.

Common Mistake: Assuming every lattice is automatically distributive. Most are not; the distributive law must be checked explicitly rather than assumed from the join/meet axioms alone.

Important Questions:

• What does the classification theorem say about finite Boolean algebras? Every finite Boolean algebra B is isomorphic to the power set P(X) of some set X.
• What four laws define a lattice’s join and meet operations? The commutative, associative, idempotent, and absorption laws.

Chapter 20: Vector Spaces

Difficulty: Medium · Key topics: vector space axioms, subspace test, linear independence and spanning

This chapter connects the axiomatic method used throughout the book to the linear algebra most BS Math students already know informally. It defines a vector space over a field with axioms parallel to the group and ring axioms studied earlier, and proves a subspace test that again mirrors the subgroup and subring tests: a subset is a subspace exactly when it’s nonempty and closed under both addition and scalar multiplication. Its central theorem underlies the whole concept of dimension: if a vector space V is spanned by n vectors, then any set of more than n vectors in V must be linearly dependent.

Key Points:

• A vector space is a set of vectors with addition and scalar multiplication (by elements of a field), satisfying axioms parallel to the group and ring axioms already studied
• The subspace test mirrors earlier subgroup/subring tests: nonempty, closed under addition, closed under scalar multiplication
• If V is spanned by n vectors, any set of more than n vectors in V must be linearly dependent
• This single counting fact is what makes the concept of dimension a well-defined number at all
• Linear independence and spanning together set up the idea of a basis, developed fully in a full linear algebra course

Memory Tip: More vectors than a spanning set’s size forces automatic dependence — that one fact is the entire reason “dimension” is a well-defined number.

Common Mistake: Checking only closure under addition when verifying a subspace, and forgetting to also check closure under scalar multiplication.

Important Questions:

• What happens if you have more vectors than a spanning set for V? Any set of more vectors than the size of a spanning set for V must be linearly dependent.
• What does the subspace test require? That the subset is nonempty and closed under both vector addition and scalar multiplication.

Chapter 21: Fields

Difficulty: Hard · Key topics: extension fields, splitting fields, Tower Law, constructible numbers, geometric constructions

Given a field F and a polynomial p(x) ∈ F[x], can a larger field always be found where p(x) has a root? This chapter proves yes — every nonconstant polynomial has an extension field containing a zero — then builds splitting fields, proving they’re unique up to isomorphism, and proves the Tower Law: if K is a finite extension of E, and E of F, then [K:F] = [K:E]·[E:F]. It proves the set of all algebraic numbers forms a field, and closes with geometric constructions, showing the set of constructible real numbers forms a subfield of ℝ — the rigorous field-theoretic reason classical problems like doubling the cube and trisecting an arbitrary angle are provably impossible with straightedge and compass alone.

Key Points:

• For any field F and nonconstant polynomial p(x) ∈ F[x], there is always an extension field E of F containing a root of p(x)
• Tower Law: if K is a finite extension of E and E is a finite extension of F, then [K:F] = [K:E]·[E:F]
• A splitting field of a polynomial is unique up to isomorphism
• The set of all algebraic numbers (complex numbers algebraic over ℚ) forms a field
• The set of constructible real numbers forms a subfield of ℝ
• Field theory proves classical straightedge-and-compass problems — doubling the cube, trisecting an arbitrary angle — are impossible

Memory Tip: The Tower Law multiplies degrees just like index multiplies in Lagrange’s Theorem for groups — [K:F] = [K:E][E:F] is the field-theory cousin of [G:K] = [G:H][H:K].

Common Mistake: Assuming every real number is constructible. Geometric constructibility is a genuinely restrictive condition — only numbers reachable through a tower of degree-2 extensions — which is exactly why doubling the cube and trisecting an angle are impossible.

Important Questions:

• State the Tower Law for field extensions. If K is a finite extension of E, and E is a finite extension of F, then [K:F] = [K:E]·[E:F].
• What classical geometric problems does this chapter’s field theory prove impossible? Doubling the cube and trisecting an arbitrary angle using only straightedge and compass, because both require constructing a number no tower of degree-2 extensions can reach.

Chapter 22: Finite Fields

Difficulty: Hard · Key topics: Galois fields GF(pⁿ), subfield structure, cyclic multiplicative group, Freshman’s Dream, cyclic codes

Finite fields underpin both coding theory (Chapter 8) and cryptography (Chapter 7), and this chapter builds their theory from scratch. It proves that for every prime p and positive integer n, there exists exactly one field with pⁿ elements, up to isomorphism — the Galois field GF(pⁿ). It shows every subfield of GF(pⁿ) has p^m elements for some m dividing n, and conversely one exists for every such m, and proves the multiplicative group of nonzero elements of any finite field is always cyclic. A genuinely true identity in characteristic p, nicknamed the “Freshman’s Dream”, states (a+b)^pn = a^pn + b^pn. The chapter closes by connecting back to coding theory: a cyclic code is precisely an ideal of the ring ℤ₂[x] / ⁨xⁿ − 1⁩.

Key Points:

• For every prime p and positive integer n, exactly one field of order pⁿ exists, up to isomorphism — the Galois field GF(pⁿ)
• Every subfield of GF(pⁿ) has p^m elements for some m dividing n, and one exists for every such m
• The multiplicative group of nonzero elements of any finite field is always cyclic
• The “Freshman’s Dream” identity, (a+b)^pn = a^pn + b^pn, genuinely holds in characteristic p
• A cyclic code is precisely an ideal of the ring ℤ₂[x] / ⁨xⁿ − 1⁩, linking coding theory directly to finite-field ring structure

Memory Tip: GF(pⁿ) is unique up to isomorphism — there is exactly one finite field of each prime-power order, no matter how you construct it.

Common Mistake: Dismissing the “Freshman’s Dream” identity out of habit as the usual false shortcut. In characteristic p it is a genuine, provable theorem — not the mistake the nickname usually refers to over the real numbers.

Important Questions:

• How many finite fields of order pⁿ exist, up to isomorphism? Exactly one, for every prime p and positive integer n.
• What structural fact about a finite field’s multiplicative group underlies discrete-log-based cryptography? The multiplicative group of nonzero elements of any finite field is cyclic.

Chapter 23: Galois Theory

Difficulty: Hard · Key topics: Fundamental Theorem of Galois Theory, Primitive Element Theorem, solvability by radicals, insolvability of the quintic

The book’s capstone chapter answers a classic problem: which polynomial equations can be solved by a formula, and which cannot. It proves the Primitive Element Theorem (every finite separable extension is generated by a single element), then builds to the Fundamental Theorem of Galois Theory, an exact, order-reversing correspondence between the intermediate fields of a finite normal extension E/F and the subgroups of its Galois group G(E/F). The chapter proves that if a polynomial is solvable by radicals, its Galois group must be solvable — the precise algebraic condition for solvability — and closes the book’s central thread: because S₅ is not a solvable group, the general quintic equation has no solution by radicals, exactly as Galois himself proved.

Key Points:

• The Fundamental Theorem of Galois Theory sets up an order-reversing correspondence between intermediate fields of E/F and subgroups of the Galois group G(E/F)
• Primitive Element Theorem: every finite separable extension is a simple extension, generated by a single element
• If f(x) is solvable by radicals, its Galois group over F must be a solvable group
• Any automorphism in the Galois group permutes the roots of the original polynomial that lie in the extension
• Because S₅ (and every S_n, n ≥ 5) is not solvable, the general quintic equation cannot be solved by a radical formula
• This chapter closes the loop opened in Chapter 10 (simplicity of A_n) and Chapter 13 (solvable groups), turning pure group theory into a proof about polynomial equations

Memory Tip: The Galois correspondence flips things upside-down — bigger subfields correspond to smaller subgroups, mirroring the tower of field extensions against the subgroup lattice of the Galois group, inverted.

Common Mistake: Applying the Fundamental Theorem of Galois Theory to an extension that isn’t finite and normal. The correspondence in this form requires E/F to be a finite normal extension over a field of characteristic zero or a finite field — skipping that check breaks the argument.

Important Questions:

• What does the Fundamental Theorem of Galois Theory establish? An order-reversing one-to-one correspondence between the intermediate fields of a finite normal extension E/F and the subgroups of its Galois group G(E/F).
• Why is the general quintic equation unsolvable by radicals? Because its Galois group can be S₅, which is not a solvable group, and solvability by radicals requires the polynomial’s Galois group to be solvable.

Download Abstract Algebra: Theory and Applications PDF (Free)

This book is free from its official source, author Thomas Judson’s own site. Click below to go to the official downloads page, where you can get the complete PDF or EPUB edition (and the source code, if you want it) directly — no cost, no registration.

How to Study This Book

This book naturally splits into two semesters by its own design. The author’s own preface says the first half — Chapters 1 through 15 — builds group theory through the Sylow Theorems, and the second half — Chapters 16 through 23 — covers rings, integral domains, Boolean algebras, vector spaces, and fields, closing with Galois Theory.

Start with Chapter 1 (Preliminaries) and Chapter 2 (The Integers) even if your course syllabus doesn’t formally assign them. They set up the proof techniques — direct proof, induction, working with equivalence relations — that every later chapter assumes without re-explaining.

Chapters 3 through 11 — Groups, Cyclic Groups, Permutation Groups, Cosets and Lagrange’s Theorem, Isomorphisms, Normal Subgroups and Factor Groups, and Homomorphisms — form one connected argument. Do not skip ahead: the author’s own chapter-dependency chart shows Chapters 7 through 9 depending on Chapters 1 through 6, and Chapter 10 depending directly on Chapter 9.

Chapters 7 (Cryptography) and 8 (Algebraic Coding Theory) are applications the author built to run alongside the core theory. The book’s own suggested one-semester syllabus — Chapters 1–6, 9, 10, 11, and 13 — skips both of them entirely, so check your own course outline before assuming they’re required reading.

Chapters 12 through 15 — Matrix Groups and Symmetry, The Structure of Groups, Group Actions, and The Sylow Theorems — close out group theory with increasingly structural results. Read Group Actions (14) closely even under time pressure, since the Sylow Theorems (15) build directly on the orbit-stabilizer result it proves.

The second half opens the same way the first one did: Chapters 16 through 18 (Rings, Polynomials, Integral Domains) rebuild the group-theory pattern — definitions, substructures, homomorphisms, factor structures — for rings instead. Chapter 19 (Lattices and Boolean Algebras) is the one chapter in the whole book that can genuinely be read on its own, independent of everything before or after it.

Chapters 20 through 23 — Vector Spaces, Fields, Finite Fields, and Galois Theory — build toward the book’s capstone. The author’s own dependency chart shows Chapter 23 (Galois Theory) depending directly on Chapter 13 (solvable groups) and Chapter 15 (Sylow Theorems), so if your course jumps straight to a Galois Theory special-topics unit, review those two chapters’ results on solvability first.

This is the Annual Edition 2026, dated August 4, 2026. Judson updates the book every year, and the Sage computer-algebra material has been verified against the current SageMath release, so there is no age caveat anywhere in this book.

Used In These Programs

This book is used for the Abstract Algebra (Modern Algebra) course in BS Mathematics programs. Browse all Abstract Algebra books or all Mathematics books.

Who Should Read This

Abstract Algebra: Theory and Applications is written for a junior- or senior-level BS Mathematics student who has already built some comfort writing proofs — Chapter 1 reviews proof technique and set theory in a few pages, but it is a refresher, not a first introduction to the subject. Students who have already worked through Discrete Mathematics: An Open Introduction or an equivalent foundations/discrete-structures course will find the notation and pace of the first chapter familiar. It is not a light read for someone approaching pure mathematics for the very first time, and its second half (rings, fields, Galois Theory) assumes the group theory from its first half is already solid. A student looking only for a single-semester group theory course can stop after Chapter 15 and return to the rest later, exactly as the author’s own preface recommends.

Applicable Universities

This book is useful for BS Mathematics students at Pakistani universities including Punjab University, Virtual University, COMSATS, FAST, UET, NUST, Quaid-i-Azam University, and other HEC-recognized institutions that offer an Abstract Algebra or Modern Algebra course.

FAQs

Related Books

• Discrete Mathematics: An Open Introduction – Oscar Levin (4th Edition)
• Calculus Volume 1 – Strang & Herman (OpenStax)
• Calculus Volume 2 – Strang & Herman (OpenStax)

Abstract Algebra: Theory and Applications is this project’s first upper-division, proof-based Mathematics-category book — the core course most BS Mathematics students take in their junior or senior year, covering everything from group theory to Galois Theory in one free, GFDL-licensed text. Browse more Mathematics books for the rest of your degree.

Abstract Algebra: Theory and Applications, Annual Edition 2026, by Thomas W. Judson (Sage material by Robert A. Beezer). Free under the GNU Free Documentation License (GFDL), Version 1.2 or any later version. Access for free at http://abstract.ups.edu/