1 Basic concepts
Commutative algebra studies algebraic structures in which multiplication is commutative, with particular emphasis on rings, ideals, and modules. It supplies the language used to describe polynomial equations, local behavior near a point, and algebraic invariants that measure size, factorization, and singularity. Many of its central notions are shared with other branches of algebra, but the commutative setting allows stronger structural results and a rich geometric interpretation.
1.1 Rings and ring homomorphisms
A ring is a set equipped with addition and multiplication satisfying familiar distributive and associative laws, together with additive inverses. In commutative algebra, the multiplication is assumed to satisfy ab = ba for all elements a and b. Ring homomorphisms are functions that preserve addition, multiplication, and the multiplicative identity when one is specified. They provide the basic notion of structure-preserving map, allowing rings to be compared, transferred, and studied through their images and kernels.
1.2 Ideals
An ideal is an additive subgroup of a ring that is stable under multiplication by arbitrary ring elements. Ideals encode divisibility-like behavior and are the principal tool for forming quotient rings. They also serve as algebraic analogues of geometric subspaces, especially when studying polynomial rings and solution sets of equations.
1.2.1 Principal ideals
A principal ideal is generated by a single element. In a ring R, the principal ideal generated by a is the set of all multiples of a. Principal ideals are especially important in rings with simple divisibility theory, such as principal ideal domains and Euclidean domains.
1.2.2 Prime ideals
A prime ideal is an ideal p such that if a product ab lies in p, then at least one of a or b lies in p. Prime ideals generalize prime numbers and are fundamental in the geometric interpretation of rings. They determine the points of the prime spectrum and capture a robust notion of irreducibility.
1.2.3 Maximal ideals
A maximal ideal is a proper ideal that is not properly contained in any other proper ideal. Quotienting by a maximal ideal produces a field. Maximal ideals often represent closed points in geometric settings and are essential in local algebra.
1.3 Modules over commutative rings
Modules generalize vector spaces by allowing scalars from a ring rather than a field. Over a commutative ring, modules form the natural setting for linear algebra with coefficients in the ring itself. They are used to study ideals, sheaves, homological invariants, and algebraic dependence.
1.3.1 Submodules
A submodule is a subset of a module that is closed under addition and scalar multiplication. Submodules play the same role as subspaces in vector space theory. They are used to analyze structure, define kernels and images of module maps, and build filtrations.
1.3.2 Quotient modules
A quotient module is formed by collapsing a submodule to zero. It measures the difference between a module and one of its submodules and is central to exactness arguments. Quotient constructions appear throughout commutative algebra, especially in defining factor modules and resolving module structure.
1.4 Examples of commutative rings
Standard examples include the integers, fields, polynomial rings over a field or ring, and rings of integers in number fields. Products of commutative rings are again commutative, as are quotient rings and formal power series rings. These examples illustrate the wide range of behavior possible, from simple factorization in the integers to more intricate ideal theory in polynomial and local rings.
2 Ring constructions and operations
Ring constructions provide ways to build new commutative rings from existing ones. They are used to encode algebraic relations, combine data from several sources, and create rings suited to geometric or analytic problems. Many properties of a ring can be studied by observing how they change under these operations.
2.1 Quotient rings
Given a ring R and an ideal I, the quotient ring R/I identifies elements differing by an element of I. This construction is central because it turns ideal data into a new algebraic object. Many questions about equations and congruences are naturally expressed in quotient rings.
2.2 Direct products
The direct product of rings combines several rings componentwise. Addition and multiplication are defined coordinate by coordinate. Direct products often serve as examples and counterexamples, showing how properties may hold or fail when a ring is decomposed into simpler factors.
2.3 Polynomial rings
Polynomial rings are among the most important objects in commutative algebra. They consist of polynomials with coefficients in a commutative ring, and they model algebraic expressions in one or more indeterminates. They are the primary setting for studying algebraic equations and ideal structure.
2.3.1 Multivariable polynomial rings
Polynomial rings in several variables extend the one-variable case by allowing expressions in x1, x2, and so on. Their ideal theory is richer and more closely tied to algebraic geometry. Many key results, including dimension theorems and basis theorems, are formulated for these rings.
2.3.2 Laurent polynomial rings
Laurent polynomial rings allow finitely many negative as well as nonnegative powers of variables. They arise naturally in algebraic and geometric contexts where variables are invertible. Their structure is useful in studying torus-like objects and graded constructions.
2.4 Formal power series rings
Formal power series rings consist of infinite sums with no concern for convergence, only for algebraic manipulation. They are especially useful in local analysis and deformation theory. These rings often reflect the behavior of objects near a chosen point and are closely related to completion.
3 Divisibility and factorization
Divisibility theory in commutative algebra generalizes arithmetic in the integers. It concerns units, irreducibility, factorization into atoms, and conditions under which factorization is well behaved. Different classes of rings are distinguished by how closely their factorization resembles that of the integers.
3.1 Units and zero divisors
A unit is an element with a multiplicative inverse. Units represent the elements that do not affect divisibility in an essential way. A zero divisor is a nonzero element that annihilates some nonzero element under multiplication. The presence of zero divisors often signals that a ring has a more complicated internal structure.
3.2 Divisibility in rings
An element a divides b if b = ac for some c in the ring. This relation organizes ring elements into classes of associated and nonassociated elements and helps define notions of prime and irreducible elements. Divisibility can be studied through ideals, since containment relations among principal ideals encode divisibility.
3.3 Greatest common divisors
A greatest common divisor is an element that generates the largest principal ideal contained in the ideals generated by two elements, up to multiplication by a unit. In familiar rings such as the integers, gcds measure the common factors of two elements. Their existence and uniqueness properties vary across rings and are closely tied to principal ideal structure.
3.4 Unique factorization domains
A unique factorization domain is an integral domain in which every nonzero nonunit factors uniquely into irreducible elements, up to order and units. This property generalizes the fundamental theorem of arithmetic. UFDs are central because they retain much of the arithmetic simplicity of the integers while covering many polynomial rings.
3.4.1 Irreducible elements
An irreducible element is a nonunit that cannot be factored into two nonunits. Irreducibility is the first step toward factorization theory. In a UFD, irreducible elements serve as the building blocks of all nonzero nonunits.
3.4.2 Prime elements
A prime element is an element whose associated principal ideal is a prime ideal. Prime elements have a stronger divisibility property than irreducibles in general rings. In a UFD, irreducible and prime elements coincide, which greatly simplifies factorization.
3.5 Principal ideal domains
A principal ideal domain is an integral domain in which every ideal is principal. This condition yields strong control over module structure and factorization. PID theory provides a bridge between ideal-theoretic and arithmetic methods.
3.6 Euclidean domains
A Euclidean domain is an integral domain equipped with a division algorithm based on a size function. This allows the use of Euclid-style arguments to prove existence of gcds and ideal principality. Every Euclidean domain is a principal ideal domain, though the converse need not hold.
4 Prime spectrum and localization
The prime spectrum of a ring packages all prime ideals into a single topological space. Localization refines a ring by inverting selected elements, allowing one to focus on behavior near a prime or on regions where certain elements are nonzero. These tools connect algebra to geometry and local analysis.
4.1 The prime spectrum of a ring
The prime spectrum of a ring is the set of its prime ideals. It is usually denoted Spec R. This set carries both algebraic information and geometric meaning, serving as the underlying space in modern algebraic geometry.
4.2 Zariski topology
The Zariski topology on the prime spectrum is defined by specifying closed sets via sets of prime ideals containing a given ideal. It is a coarse topology, but one that matches algebraic data remarkably well. Closed sets correspond to solution sets of collections of polynomial conditions in geometric applications.
4.3 Localization
Localization is the process of forcing a chosen collection of elements to become invertible. It allows algebraists to study a ring “near” a prime ideal or away from certain divisors. Many properties become simpler after localization, particularly in local and geometric arguments.
4.3.1 Multiplicative sets
A multiplicative set is a subset closed under multiplication and containing 1. Such sets specify which elements should be inverted during localization. The choice of multiplicative set controls the resulting localized ring.
4.3.2 Local rings
A local ring is a ring with a single maximal ideal. Local rings capture the algebraic behavior at one point or one neighborhood in a geometric space. They are indispensable in studying singularities, completions, and infinitesimal properties.
4.4 Support and stalks
The support of a module is the set of prime ideals where the module does not vanish after localization. It indicates where the module has meaningful local presence. A stalk is the localized module at a prime ideal, and it records the module’s behavior at that specific point in the spectrum.
5 Integral dependence and field extensions
Integral dependence describes elements that satisfy monic polynomial equations with coefficients in a given ring. This notion extends the idea of algebraic numbers and is essential for studying how rings sit inside larger rings or fields. It is a core mechanism in understanding normalization and finite extension behavior.
5.1 Integral elements
An element in an algebra over a ring is integral over the ring if it satisfies a monic polynomial equation with coefficients in that ring. Integral elements behave like algebraic numbers over the integers. They often bring strong finiteness properties to extensions.
5.2 Integral extensions
An integral extension is an extension of rings in which every element of the larger ring is integral over the smaller one. Such extensions preserve many ideal-theoretic features in a controlled way. They are central in the study of algebraic extensions of domains and in normalization theory.
5.3 Going-up and going-down
The going-up and going-down properties describe how chains of prime ideals behave under integral extensions. Going-up concerns lifting chains from the base ring to the extension, while going-down concerns descending chains under suitable hypotheses. These theorems are crucial for understanding how dimension and prime structure change across extensions.
5.4 Integral closure
The integral closure of a ring in an extension is the set of elements integral over the ring. It measures how far the ring is from being integrally complete within that extension. Integral closure is a key tool in resolving singularities and studying arithmetic rings.
5.5 Normal domains
A normal domain is an integral domain that is integrally closed in its field of fractions. Normality is a strong form of regularity for domains and is often associated with good geometric and arithmetic behavior. Many important rings in algebraic geometry and number theory are normal or are studied through their normalizations.
6 Dimension theory
Dimension theory measures the complexity of a ring by examining chains of prime ideals. It provides a numerical invariant that corresponds to geometric dimension in the spectrum. This area links algebraic properties to the size and shape of algebraic varieties and schemes.
6.1 Krull dimension
The Krull dimension of a ring is the supremum of lengths of chains of prime ideals. It is one of the most fundamental invariants in commutative algebra. Dimension zero often corresponds to Artinian-like behavior, while larger dimensions reflect richer geometric structure.
6.2 Chains of prime ideals
Chains of prime ideals are sequences of prime ideals ordered by inclusion. Their lengths give the basic raw data from which dimension is measured. Studying these chains reveals how primes are layered inside a ring.
6.3 Height and codimension
The height of a prime ideal is the supremum of lengths of chains ending at that prime. Codimension is often used in geometric contexts to describe how far a subobject sits inside a larger one. These concepts refine the dimension theory of rings by focusing on individual primes.
6.4 Dimension of polynomial rings
Polynomial rings typically increase dimension by the number of variables, under standard hypotheses. This principle is a cornerstone of algebraic geometry and ring theory. It helps predict how algebraic complexity changes when new indeterminates are introduced.
6.5 Catenary rings
A catenary ring is one in which all saturated chains between two prime ideals have the same length. Catenarity gives a well-behaved notion of dimension along chains of primes. It is important for comparing local and global dimension formulas.
7 Noetherian rings and modules
Noetherian conditions impose finiteness on ascending chains of ideals or submodules. They are central because many constructions become manageable under these hypotheses. A large portion of classical commutative algebra is built on Noetherian assumptions.
7.1 Ascending chain condition
The ascending chain condition requires that every increasing sequence of ideals or submodules eventually stabilizes. This finiteness condition prevents infinite uncontrolled growth. It is equivalent, in many contexts, to the Noetherian property.
7.2 Noetherian modules
A Noetherian module is one satisfying the ascending chain condition on submodules. Such modules share many useful finiteness properties with Noetherian rings. They are stable under quotients and play an important role in structural theorems.
7.3 Hilbert basis theorem
The Hilbert basis theorem states that if a ring is Noetherian, then so is its polynomial ring in finitely many variables. This result is fundamental because it guarantees that polynomial extensions preserve a crucial finiteness property. It underlies much of the finiteness theory in algebraic geometry.
7.4 Primary decomposition
Primary decomposition expresses an ideal, or more generally a submodule in suitable settings, as an intersection of primary components. It is a refined analogue of prime factorization for ideals. This decomposition reveals how an algebraic object breaks into pieces supported at prime ideals.
7.5 Artinian rings
An Artinian ring satisfies the descending chain condition on ideals. Such rings are often finite in a strong structural sense and frequently decompose into products of local components. In commutative algebra, Artinian rings are closely related to zero-dimensional Noetherian rings.
8 Homological methods
Homological algebra provides a systematic way to measure the failure of exactness in sequences of modules. In commutative algebra, it supplies tools for studying depth, regularity, and hidden relations among generators. These methods have become indispensable in both theory and applications.
8.1 Exact sequences
An exact sequence is a sequence of module homomorphisms in which the image of each map equals the kernel of the next. Exactness captures the idea that no information is lost or duplicated at each stage. Such sequences are the basic language for many structural arguments.
8.2 Projective modules
Projective modules are modules that lift through surjections in a particularly flexible way. They generalize free modules and often behave like direct summands of free modules. Projectivity is useful for constructing resolutions and proving splitting results.
8.3 Injective modules
Injective modules are modules into which homomorphisms can be extended from submodules. They are dual to projective modules in many respects. Injective objects are central in constructing derived functors and in studying duality phenomena.
8.4 Free resolutions
A free resolution of a module is an exact sequence built from free modules that maps onto the module. It expresses the module in terms of elementary pieces. Free resolutions are foundational for defining Tor and Ext and for analyzing syzygies.
8.5 Tor and Ext
Tor and Ext are derived functors that measure, respectively, how tensor products fail to be exact and how homomorphism spaces fail to be exact. They encode subtle relationships between modules and reveal higher-order structure invisible to ordinary maps. These invariants appear throughout modern commutative algebra and algebraic geometry.
8.6 Depth and regular sequences
Depth is a measure of how many successive nonzerodivisors lie in an ideal relative to a module. A regular sequence is a sequence of elements that acts nontrivially and independently on a module. Together, these notions control homological dimension and are closely tied to singularity and regularity.
9 Completions and local methods
Completion formalizes the idea of studying a ring near an ideal by taking limits of successive approximations. Local methods focus attention on one prime or maximal ideal at a time. These techniques are especially effective in deformation theory, singularity analysis, and formal geometry.
9.1 Adic topologies
An adic topology is defined using powers of an ideal as a neighborhood basis of zero. It measures closeness in terms of divisibility by higher and higher powers of the ideal. This topology is the natural setting for completion with respect to an ideal.
9.2 Completion of rings and modules
The completion of a ring or module is formed by taking an inverse limit of its quotients by powers of an ideal. The resulting object captures infinite-order information in a formalized way. Completion is widely used in local algebra and in the study of formal power series.
9.3 Henselian rings
A Henselian ring satisfies a lifting property for certain polynomial factorizations or solutions modulo an ideal. It behaves, in important respects, like a ring complete with respect to a local topology. Henselian methods are useful when one wants local lifting without full completion.
9.4 Nakayama's lemma
Nakayama's lemma is a fundamental result about finitely generated modules over local rings. It gives a criterion for when a module is zero or when a generating set can be reduced. This lemma is one of the most frequently used tools in local commutative algebra.
9.5 Associated graded rings
An associated graded ring is built from successive quotients of powers of an ideal. It replaces a filtered ring with a graded object that is often easier to analyze. This construction is useful for comparing local structure with leading-term behavior.
10 Advanced topics and applications
Commutative algebra has far-reaching applications beyond its intrinsic theory. It interacts deeply with geometry, arithmetic, and computation, often providing the algebraic framework for solving concrete and conceptual problems. Many modern developments combine several of its methods at once.
10.1 Intersection theory
Intersection theory studies how geometric objects meet, and commutative algebra supplies the local algebra needed to measure multiplicities and intersection numbers. Ideals, local rings, and homological invariants all play major roles. The subject translates geometric overlap into algebraic data.
10.2 Algebraic geometry connections
Algebraic geometry relies on commutative algebra to connect polynomial equations with geometric spaces. Prime ideals correspond to geometric points in a generalized sense, while local rings describe neighborhoods and singularities. The spectrum of a ring provides the bridge between algebraic and geometric viewpoints.
10.3 Commutative algebra in number theory
Number theory uses commutative algebra to study rings of integers, local fields, valuations, and ideal factorization. Concepts such as integral closure, localization, and completion are especially important. These tools help analyze arithmetic properties that are not visible from ordinary integer arithmetic alone.
10.4 Computational commutative algebra
Computational commutative algebra develops algorithms for manipulating ideals, modules, and polynomial systems. It is central to symbolic computation and supports applications in geometry, coding theory, and robotics. Algorithmic methods make many theoretical constructions explicit.
10.4.1 Gröbner bases
A Gröbner basis is a distinguished generating set for an ideal in a polynomial ring relative to a term order. It enables algorithmic reduction, ideal membership testing, and elimination. Gröbner bases are one of the most important computational tools in the subject.
10.4.2 Syzygies
Syzygies are relations among generators of a module or ideal. They are the next layer of structure after generators themselves and are closely tied to free resolutions. Studying syzygies reveals hidden dependencies and helps organize computational procedures.
10.4.3 Computer algebra systems
Computer algebra systems implement algorithms for polynomial arithmetic, ideal operations, and homological computations. They make it possible to carry out explicit calculations that would be difficult by hand. Such systems are widely used in research and teaching across algebra and geometry.