Study guide
10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
Key Takeaways Explain This Topic AI
An integral domain is a commutative ring with unity 1 != 0 having no zero divisors; a field is a commutative ring in which every non-zero element has a multiplicative inverse.
In a commutative ring with unity, an ideal P is prime if and only if R/P is an integral domain; an ideal M is maximal if and only if R/M is a field, meaning every maximal ideal is prime.
For any field F, the polynomial ring F[x] is a Principal Ideal Domain (PID) and Unique Factorization Domain (UFD); an ideal <p(x)> is maximal if and only if p(x) is irreducible over F.
Finite fields GF(p^n) exist uniquely up to isomorphism for every prime power p^n; their non-zero elements form a cyclic multiplicative group of order p^n - 1.
An R-module generalizes a vector space by allowing scalars from a ring; submodules, quotient modules, cyclic modules, and F[x]-module actions connect module theory to invariant subspaces and linear operators.
Last updated: September 2026
10.3 Rings, Ideals, Polynomial Rings, and Field Extensions
Ring and field theory expand algebraic study to systems equipped with two binary operations. On the GRE Mathematics Subject Test, questions test ring axioms, zero divisors, integral domains, prime versus maximal ideals, polynomial factorization in PIDs, and the construction and properties of finite fields.
Rings, Zero Divisors, and Integral Domains
A ring ( R , + , ⋅ ) (R, +, \cdot) ( R , + , ⋅ ) is a set R R R equipped with addition and multiplication such that:
( R , + ) (R, +) ( R , + ) is an abelian group (additive identity 0 0 0 , additive inverse − a -a − a ).
Multiplication is associative: ( a ⋅ b ) ⋅ c = a ⋅ ( b ⋅ c ) (a \cdot b) \cdot c = a \cdot (b \cdot c) ( a ⋅ b ) ⋅ c = a ⋅ ( b ⋅ c ) .
Multiplication distributes over addition: a ( b + c ) = a b + a c a(b + c) = ab + ac a ( b + c ) = ab + a c and ( a + b ) c = a c + b c (a + b)c = ac + bc ( a + b ) c = a c + b c .
Special Ring Classifications
Commutative Ring: a b = b a ab = ba ab = ba for all a , b ∈ R a, b \in R a , b ∈ R .
Ring with Unity: There exists an element 1 ≠ 0 1 \neq 0 1 = 0 such that 1 ⋅ a = a ⋅ 1 = a 1 \cdot a = a \cdot 1 = a 1 ⋅ a = a ⋅ 1 = a for all a ∈ R a \in R a ∈ R .
Units: An element u ∈ R u \in R u ∈ R is a unit if there exists v ∈ R v \in R v ∈ R such that u v = v u = 1 uv = vu = 1 uv = vu = 1 . The units form a multiplicative group R ∗ R^* R ∗ .
Zero Divisors: A non-zero element a ∈ R a \in R a ∈ R is a zero divisor if there exists a non-zero b ∈ R b \in R b ∈ R such that a b = 0 ab = 0 ab = 0 or b a = 0 ba = 0 ba = 0 .
Integral Domain: A commutative ring with unity 1 ≠ 0 1 \neq 0 1 = 0 that has no zero divisors . Equivalently, the cancellation law holds: if a b = a c ab = ac ab = a c and a ≠ 0 a \neq 0 a = 0 , then b = c b = c b = c .
Division Ring (Skew Field): A ring with unity in which every non-zero element is a unit (multiplicative inverses exist, but multiplication may be non-commutative).
Field: A commutative division ring. Every non-zero element is a unit.
Structural Theorems
Wedderburn's Little Theorem: Every finite division ring is a field.
Finite Domain Theorem: Every finite integral domain is a field. (Proof: For non-zero a ∈ D a \in D a ∈ D , the map x ↦ a x x \mapsto ax x ↦ a x is injective by cancellation; by finiteness, it is surjective, so a x = 1 ax = 1 a x = 1 has a solution).
Ideals, Quotient Rings, and Homomorphisms
An ideal I I I of a ring R R R is an additive subgroup ( I ≤ ( R , + ) I \le (R, +) I ≤ ( R , + ) ) that satisfies the absorption property : r ∈ R , x ∈ I ⟹ r x ∈ I and x r ∈ I r \in R, x \in I \implies rx \in I \text{ and } xr \in I r ∈ R , x ∈ I ⟹ r x ∈ I and x r ∈ I
If R R R is commutative, the ideal generated by a single element a a a is the principal ideal ⟨ a ⟩ = a R = { a r : r ∈ R } \langle a \rangle = aR = \{ar : r \in R\} ⟨ a ⟩ = a R = { a r : r ∈ R } .
An ideal I I I contains a unit if and only if I = R I = R I = R . Consequently, the only ideals of a field F F F are { 0 } \{0\} { 0 } and F F F .
Quotient Ring R / I R/I R / I
For an ideal I ⊆ R I \subseteq R I ⊆ R , the set of cosets R / I = { r + I : r ∈ R } R/I = \{r + I : r \in R\} R / I = { r + I : r ∈ R } forms a ring under: ( r + I ) + ( s + I ) = ( r + s ) + I , ( r + I ) ( s + I ) = r s + I (r + I) + (s + I) = (r + s) + I, \qquad (r + I)(s + I) = rs + I ( r + I ) + ( s + I ) = ( r + s ) + I , ( r + I ) ( s + I ) = rs + I
The absorption property of ideals guarantees that multiplication of cosets is well-defined.
First Isomorphism Theorem for Rings
If ϕ : R → S \phi: R \to S ϕ : R → S is a ring homomorphism (preserving addition and multiplication), then:
The kernel ker ( ϕ ) = { r ∈ R : ϕ ( r ) = 0 } \ker(\phi) = \{r \in R : \phi(r) = 0\} ker ( ϕ ) = { r ∈ R : ϕ ( r ) = 0 } is an ideal of R R R .
The quotient ring R / ker ( ϕ ) R / \ker(\phi) R / ker ( ϕ ) is isomorphic to the image im ( ϕ ) ⊆ S \operatorname{im}(\phi) \subseteq S im ( ϕ ) ⊆ S : R / ker ( ϕ ) ≅ im ( ϕ ) R / \ker(\phi) \cong \operatorname{im}(\phi) R / ker ( ϕ ) ≅ im ( ϕ )
Prime Ideals vs. Maximal Ideals
Let R R R be a commutative ring with unity and I ⊊ R I \subsetneq R I ⊊ R a proper ideal:
Characterizations via Quotients
Prime Ideal: P P P is prime if whenever a b ∈ P ab \in P ab ∈ P , either a ∈ P a \in P a ∈ P or b ∈ P b \in P b ∈ P . P is a prime ideal ⟺ R / P is an integral domain \mathbf{P \text{ is a prime ideal}} \iff R/P \text{ is an integral domain} P is a prime ideal ⟺ R / P is an integral domain
Maximal Ideal: M M M is maximal if no proper ideal strictly contains M M M (if M ⊆ J ⊆ R M \subseteq J \subseteq R M ⊆ J ⊆ R for an ideal J J J , then J = M J = M J = M or J = R J = R J = R ). M is a maximal ideal ⟺ R / M is a field \mathbf{M \text{ is a maximal ideal}} \iff R/M \text{ is a field} M is a maximal ideal ⟺ R / M is a field
Core Implications
Because every field is an integral domain, every maximal ideal is prime .
The converse is false in general: In Z [ x ] \mathbb{Z}[x] Z [ x ] , the ideal ⟨ x ⟩ \langle x \rangle ⟨ x ⟩ is prime because Z [ x ] / ⟨ x ⟩ ≅ Z \mathbb{Z}[x]/\langle x \rangle \cong \mathbb{Z} Z [ x ] / ⟨ x ⟩ ≅ Z (an integral domain), but it is not maximal because Z \mathbb{Z} Z is not a field. The ideal ⟨ 2 , x ⟩ \langle 2, x \rangle ⟨ 2 , x ⟩ strictly contains ⟨ x ⟩ \langle x \rangle ⟨ x ⟩ .
In a Principal Ideal Domain (PID) , every non-zero prime ideal is maximal.
Polynomial Rings F [ x ] F[x] F [ x ] , PIDs, and UFDs
When F F F is a field, the polynomial ring F [ x ] F[x] F [ x ] possesses rich algebraic structure:
Division Algorithm: For f ( x ) , g ( x ) ∈ F [ x ] f(x), g(x) \in F[x] f ( x ) , g ( x ) ∈ F [ x ] with g ( x ) ≠ 0 g(x) \neq 0 g ( x ) = 0 , there exist unique q ( x ) , r ( x ) ∈ F [ x ] q(x), r(x) \in F[x] q ( x ) , r ( x ) ∈ F [ x ] such that f ( x ) = g ( x ) q ( x ) + r ( x ) f(x) = g(x)q(x) + r(x) f ( x ) = g ( x ) q ( x ) + r ( x ) with deg ( r ) < deg ( g ) \deg(r) < \deg(g) de g ( r ) < de g ( g ) or r = 0 r = 0 r = 0 .
Euclidean Domain (ED): The degree function deg \deg de g serves as a Euclidean valuation.
Principal Ideal Domain (PID): Every ideal in F [ x ] F[x] F [ x ] is principal: I = ⟨ p ( x ) ⟩ I = \langle p(x) \rangle I = ⟨ p ( x )⟩ .
Unique Factorization Domain (UFD): Every non-constant polynomial factors uniquely into irreducible polynomials up to order and unit associates.
Domain Hierarchy Fields ⊂ Euclidean Domains ⊂ Principal Ideal Domains ⊂ Unique Factorization Domains ⊂ Integral Domains \text{Fields} \subset \text{Euclidean Domains} \subset \text{Principal Ideal Domains} \subset \text{Unique Factorization Domains} \subset \text{Integral Domains} Fields ⊂ Euclidean Domains ⊂ Principal Ideal Domains ⊂ Unique Factorization Domains ⊂ Integral Domains
Note: Z [ x ] \mathbb{Z}[x] Z [ x ] is a UFD, but not a PID (the ideal ⟨ 2 , x ⟩ \langle 2, x \rangle ⟨ 2 , x ⟩ is not principal).
Irreducibility and Maximality in F [ x ] F[x] F [ x ]
Let p ( x ) ∈ F [ x ] p(x) \in F[x] p ( x ) ∈ F [ x ] with deg ( p ) ≥ 1 \deg(p) \ge 1 de g ( p ) ≥ 1 : ⟨ p ( x ) ⟩ is maximal ⟺ ⟨ p ( x ) ⟩ is prime ⟺ p ( x ) is irreducible over F \langle p(x) \rangle \text{ is maximal} \iff \langle p(x) \rangle \text{ is prime} \iff p(x) \text{ is irreducible over } F ⟨ p ( x )⟩ is maximal ⟺ ⟨ p ( x )⟩ is prime ⟺ p ( x ) is irreducible over F
If p ( x ) p(x) p ( x ) is irreducible over F F F , then the quotient ring E = F [ x ] / ⟨ p ( x ) ⟩ E = F[x]/\langle p(x) \rangle E = F [ x ] / ⟨ p ( x )⟩ is a field .
- Field Extensions and Finite Fields F p n \mathbb{F}_{p^n} F p n
- Constructing Extension Fields
Let p ( x ) ∈ F [ x ] p(x) \in F[x] p ( x ) ∈ F [ x ] be irreducible with deg ( p ( x ) ) = n \deg(p(x)) = n de g ( p ( x )) = n . The quotient E = F [ x ] / ⟨ p ( x ) ⟩ E = F[x]/\langle p(x) \rangle E = F [ x ] / ⟨ p ( x )⟩ is an extension field of F F F with degree [ E : F ] = n [E : F] = n [ E : F ] = n .
The element α = x + ⟨ p ( x ) ⟩ \alpha = x + \langle p(x) \rangle α = x + ⟨ p ( x )⟩ satisfies p ( α ) = 0 p(\alpha) = 0 p ( α ) = 0 , meaning α \alpha α is a root of p ( x ) p(x) p ( x ) in E E E .
Every element in E E E has a unique representation as: c 0 + c 1 α + c 2 α 2 + ⋯ + c n − 1 α n − 1 ( c i ∈ F ) c_0 + c_1\alpha + c_2\alpha^2 + \dots + c_{n-1}\alpha^{n-1} \quad (c_i \in F) c 0 + c 1 α + c 2 α 2 + ⋯ + c n − 1 α n − 1 ( c i ∈ F )
Structure of Finite Fields (Galois Fields F q \mathbb{F}_q F q )
Let F q \mathbb{F}_q F q be a finite field:
Prime Power Cardinality: The characteristic of F q \mathbb{F}_q F q must be a prime p p p . The field contains Z p \mathbb{Z}_p Z p as its prime subfield, forming a vector space over Z p \mathbb{Z}_p Z p of dimension n n n . Therefore, its order must be a prime power: q = p n q = p^n q = p n
Uniqueness: For every prime power p n p^n p n , there exists a unique field of order p n p^n p n up to isomorphism, denoted F p n \mathbb{F}_{p^n} F p n or GF ( p n ) \operatorname{GF}(p^n) GF ( p n ) .
Cyclic Multiplicative Group: The non-zero elements form a cyclic group under multiplication: ( F p n ∗ , ⋅ ) ≅ ( Z p n − 1 , + ) (\mathbb{F}_{p^n}^*, \cdot) \cong (\mathbb{Z}_{p^n - 1}, +) ( F p n ∗ , ⋅ ) ≅ ( Z p n − 1 , + )
Subfield Criterion: F p d \mathbb{F}_{p^d} F p d is a subfield of F p n \mathbb{F}_{p^n} F p n if and only if d d d divides n n n .
Ring Classification and Ideal Summary
Algebraic Structure Inverses / Zero Divisors Ideals / Quotients Prototypical Examples
Commutative Ring May have zero divisors Quotients R / I R/I R / I well-defined for ideals Z 6 , Z × Z \mathbb{Z}_6, \mathbb{Z} \times \mathbb{Z} Z 6 , Z × Z
Integral Domain No zero divisors; cancellation holds P P P prime ⟺ R / P \iff R/P ⟺ R / P domain Z , Z [ x ] \mathbb{Z}, \mathbb{Z}[x] Z , Z [ x ]
PID Every ideal is principal ⟨ a ⟩ \langle a \rangle ⟨ a ⟩ Non-zero prime ideals are maximal Z , F [ x ] \mathbb{Z}, F[x] Z , F [ x ]
Field Every non-zero element has inverse Only ideals are { 0 } \{0\} { 0 } and F F F ; M M M maximal ⟺ R / M \iff R/M ⟺ R / M field Q , R , C , F p , F p n \mathbb{Q}, \mathbb{R}, \mathbb{C}, \mathbb{F}_p, \mathbb{F}_{p^n} Q , R , C , F p , F p n
Step-by-Step Worked Problem
Problem: Construct the finite field F 8 = GF ( 2 3 ) \mathbb{F}_8 = \operatorname{GF}(2^3) F 8 = GF ( 2 3 ) as a quotient ring Z 2 [ x ] / ⟨ p ( x ) ⟩ \mathbb{Z}_2[x] / \langle p(x) \rangle Z 2 [ x ] / ⟨ p ( x )⟩ . Verify irreducibility of p ( x ) = x 3 + x + 1 p(x) = x^3 + x + 1 p ( x ) = x 3 + x + 1 , compute the multiplicative inverse of α + 1 \alpha + 1 α + 1 (where α = x + ⟨ p ( x ) ⟩ \alpha = x + \langle p(x) \rangle α = x + ⟨ p ( x )⟩ ), and find the order of α \alpha α in F 8 ∗ \mathbb{F}_8^* F 8 ∗ .
Solution:
Step 1: Verify Irreducibility. For a polynomial of degree 2 or 3 over a field, it is reducible if and only if it has a root in the base field. Testing elements of Z 2 \mathbb{Z}_2 Z 2 in p ( x ) = x 3 + x + 1 p(x) = x^3 + x + 1 p ( x ) = x 3 + x + 1 :
p ( 0 ) = 0 + 0 + 1 = 1 ≠ 0 p(0) = 0 + 0 + 1 = 1 \neq 0 p ( 0 ) = 0 + 0 + 1 = 1 = 0 .
p ( 1 ) = 1 + 1 + 1 = 3 ≡ 1 ≠ 0 p(1) = 1 + 1 + 1 = 3 \equiv 1 \neq 0 p ( 1 ) = 1 + 1 + 1 = 3 ≡ 1 = 0 .
Since p ( x ) p(x) p ( x ) has no roots in Z 2 \mathbb{Z}_2 Z 2 , it is irreducible. Hence ⟨ x 3 + x + 1 ⟩ \langle x^3 + x + 1 \rangle ⟨ x 3 + x + 1 ⟩ is a maximal ideal in Z 2 [ x ] \mathbb{Z}_2[x] Z 2 [ x ] , and F 8 = Z 2 [ x ] / ⟨ x 3 + x + 1 ⟩ \mathbb{F}_8 = \mathbb{Z}_2[x]/\langle x^3 + x + 1 \rangle F 8 = Z 2 [ x ] / ⟨ x 3 + x + 1 ⟩ is a field with 2 3 = 8 2^3 = 8 2 3 = 8 elements.
Step 2: Multiplicative Inverse of α + 1 \alpha + 1 α + 1 . In F 8 \mathbb{F}_8 F 8 , α 3 + α + 1 = 0 ⟹ α 3 = α + 1 \alpha^3 + \alpha + 1 = 0 \implies \alpha^3 = \alpha + 1 α 3 + α + 1 = 0 ⟹ α 3 = α + 1 (since − 1 ≡ + 1 ( m o d 2 ) -1 \equiv +1 \pmod 2 − 1 ≡ + 1 ( mod 2 ) ).
We seek β = a 2 α 2 + a 1 α + a 0 \beta = a_2\alpha^2 + a_1\alpha + a_0 β = a 2 α 2 + a 1 α + a 0 such that ( α + 1 ) β = 1 (\alpha + 1)\beta = 1 ( α + 1 ) β = 1 .
Multiply ( α + 1 ) ( α 2 + α ) (\alpha + 1)(\alpha^2 + \alpha) ( α + 1 ) ( α 2 + α ) : ( α + 1 ) ( α 2 + α ) = α 3 + α 2 + α 2 + α = α 3 + 2 α 2 + α = ( α + 1 ) + 0 + α = 2 α + 1 ≡ 1 ( m o d 2 ) (\alpha + 1)(\alpha^2 + \alpha) = \alpha^3 + \alpha^2 + \alpha^2 + \alpha = \alpha^3 + 2\alpha^2 + \alpha = (\alpha + 1) + 0 + \alpha = 2\alpha + 1 \equiv 1 \pmod 2 ( α + 1 ) ( α 2 + α ) = α 3 + α 2 + α 2 + α = α 3 + 2 α 2 + α = ( α + 1 ) + 0 + α = 2 α + 1 ≡ 1 ( mod 2 )
Thus, ( α + 1 ) − 1 = α 2 + α (\alpha + 1)^{-1} = \alpha^2 + \alpha ( α + 1 ) − 1 = α 2 + α .
Step 3: Multiplicative Order of α \alpha α . The group F 8 ∗ \mathbb{F}_8^* F 8 ∗ has order 8 − 1 = 7 8 - 1 = 7 8 − 1 = 7 . By Lagrange's theorem, the order of α \alpha α must divide 7. Since 7 7 7 is prime and α ≠ 1 \alpha \neq 1 α = 1 , ∣ α ∣ = 7 |\alpha| = 7 ∣ α ∣ = 7 . The element α \alpha α is a primitive element (generator) of F 8 ∗ \mathbb{F}_8^* F 8 ∗ .
GRE Exam Traps & Pitfalls
Trap 1: Confusing Prime and Maximal Ideals in Non-PIDs An ideal P P P being prime only guarantees that R / P R/P R / P is an integral domain, not a field. In Z [ x ] \mathbb{Z}[x] Z [ x ] , ⟨ x ⟩ \langle x \rangle ⟨ x ⟩ is prime because Z [ x ] / ⟨ x ⟩ ≅ Z \mathbb{Z}[x]/\langle x \rangle \cong \mathbb{Z} Z [ x ] / ⟨ x ⟩ ≅ Z , but it is not maximal because Z \mathbb{Z} Z is not a field.
Trap 2: Assuming Finite Field F p n \mathbb{F}_{p^n} F p n Is Isomorphic to Z p n \mathbb{Z}_{p^n} Z p n The finite field F p n \mathbb{F}_{p^n} F p n has characteristic p p p , meaning p ⋅ 1 = 0 p \cdot 1 = 0 p ⋅ 1 = 0 . Its additive group is isomorphic to ( Z p ) n (\mathbb{Z}_p)^n ( Z p ) n . In contrast, Z p n \mathbb{Z}_{p^n} Z p n has characteristic p n p^n p n and contains zero divisors (e.g., p ⋅ p n − 1 = 0 p \cdot p^{n-1} = 0 p ⋅ p n − 1 = 0 ), so Z p n \mathbb{Z}_{p^n} Z p n is never a field for n > 1 n > 1 n > 1 .
Trap 3: Irreducibility Is Field-Dependent The polynomial x 2 + 1 x^2 + 1 x 2 + 1 is irreducible over R \mathbb{R} R (so R [ x ] / ⟨ x 2 + 1 ⟩ ≅ C \mathbb{R}[x]/\langle x^2 + 1 \rangle \cong \mathbb{C} R [ x ] / ⟨ x 2 + 1 ⟩ ≅ C is a field), but reducible over C \mathbb{C} C as ( x − i ) ( x + i ) (x - i)(x + i) ( x − i ) ( x + i ) , and reducible over Z 2 \mathbb{Z}_2 Z 2 as ( x + 1 ) 2 (x + 1)^2 ( x + 1 ) 2 .
Trap 4: Subfield Divisibility Condition F p d \mathbb{F}_{p^d} F p d is a subfield of F p n \mathbb{F}_{p^n} F p n if and only if d ∣ n d \mid n d ∣ n , not p d ∣ p n p^d \mid p^n p d ∣ p n . For instance, F 2 2 \mathbb{F}_{2^2} F 2 2 is a subfield of F 2 6 \mathbb{F}_{2^6} F 2 6 because 2 ∣ 6 2 \mid 6 2 ∣ 6 , but F 2 4 \mathbb{F}_{2^4} F 2 4 is not a subfield of F 2 6 \mathbb{F}_{2^6} F 2 6 because 4 ∤ 6 4 \nmid 6 4 ∤ 6 .
Modules: Vector Spaces over Rings
Let R R R be a ring with identity. A left R R R -module M M M is an abelian group under addition together with scalar multiplication R × M → M R\times M\to M R × M → M satisfying distributivity, associativity ( r s ) m = r ( s m ) (rs)m=r(sm) ( rs ) m = r ( s m ) , and 1 R m = m 1_Rm=m 1 R m = m . A vector space is exactly a module whose scalar ring is a field. The distinction matters: a nonzero scalar in a ring need not be invertible, so familiar vector-space conclusions can fail.
Examples organize the theory:
Every abelian group is a Z \mathbb Z Z -module, with n ⋅ m n\cdot m n ⋅ m defined by repeated addition and additive inverses.
Every ideal I I I of a commutative ring R R R is an R R R -submodule of the regular module R R R .
R n R^n R n is a free R R R -module with standard generators, but not every module has a basis.
The quotient M / N M/N M / N by a submodule N N N is an R R R -module with ( m + N ) + ( m ′ + N ) = ( m + m ′ ) + N (m+N)+(m'+N)=(m+m')+N ( m + N ) + ( m ′ + N ) = ( m + m ′ ) + N and r ( m + N ) = r m + N r(m+N)=rm+N r ( m + N ) = r m + N .
A nonempty subset N ⊆ M N\subseteq M N ⊆ M is a submodule when it is closed under subtraction and scalar multiplication: x , y ∈ N x,y\in N x , y ∈ N and r ∈ R r\in R r ∈ R imply x − y ∈ N x-y\in N x − y ∈ N and r x ∈ N rx\in N r x ∈ N . An R R R -linear map ϕ : M → N \phi:M\to N ϕ : M → N preserves addition and scalar multiplication. Its kernel and image are submodules, and the module form of the First Isomorphism Theorem is M / ker ϕ ≅ im ϕ . M/\ker\phi\cong\operatorname{im}\phi. M / ker ϕ ≅ im ϕ .
A module generated by one element m m m is cyclic : R m = { r m : r ∈ R } . Rm=\{rm:r\in R\}. R m = { r m : r ∈ R } .
As a Z \mathbb Z Z -module, every cyclic group is either Z \mathbb Z Z or Z / n Z \mathbb Z/n\mathbb Z Z / n Z . Unlike vector spaces, a linearly independent spanning set need not exist. For example, Z / 6 Z \mathbb Z/6\mathbb Z Z /6 Z is a cyclic Z \mathbb Z Z -module but cannot be a free Z \mathbb Z Z -module because the nonzero element 1 ˉ \bar1 1 ˉ is annihilated by 6.
Linear operators as polynomial-module actions
Let V V V be a vector space over a field F F F and T : V → V T:V\to V T : V → V a linear operator. Define an F [ x ] F[x] F [ x ] -module structure on V V V by p ( x ) ⋅ v = p ( T ) v . p(x)\cdot v=p(T)v. p ( x ) ⋅ v = p ( T ) v .
Then an F F F -subspace W ⊆ V W\subseteq V W ⊆ V is an F [ x ] F[x] F [ x ] -submodule exactly when it is T T T -invariant: T ( W ) ⊆ W T(W)\subseteq W T ( W ) ⊆ W . The annihilator of a vector, Ann ( v ) = { p ∈ F [ x ] : p ( T ) v = 0 } , \operatorname{Ann}(v)=\{p\in F[x]:p(T)v=0\}, Ann ( v ) = { p ∈ F [ x ] : p ( T ) v = 0 } ,
is an ideal. Since F [ x ] F[x] F [ x ] is a principal ideal domain, it is generated by a single monic polynomial. For a cyclic vector whose iterates span V V V , that generator records the operator's minimal polynomial on the cyclic subspace.
This viewpoint explains why quotient modules F [ x ] / ( p ) F[x]/(p) F [ x ] / ( p ) model cyclic linear operators. In the basis 1 , x , … , x n − 1 1,x,\ldots,x^{n-1} 1 , x , … , x n − 1 modulo a monic polynomial p p p of degree n n n , multiplication by x x x is represented by the companion matrix of p p p .
Common traps
Submodules must contain zero and be closed under multiplication by every ring scalar. A module over a general ring need not have a basis or a well-defined dimension. Torsion—nonzero m m m with r m = 0 rm=0 r m = 0 for nonzero r r r —cannot occur in a vector space over a field but is common in modules.