1 Definitions and basic properties

1.1 Algebraic sets and varieties

An algebraic set is the common zero locus of a collection of polynomials in an affine or projective space over a field. Such sets are naturally studied with the Zariski topology, in which closed sets are defined by polynomial equations. In affine geometry, algebraic sets may be arbitrary finite unions of simpler pieces, while in the classical language of varieties the term often refers to an algebraic set with additional regularity assumptions, depending on the convention being used.

The basic objects of study are the sets of solutions to polynomial systems together with the algebraic relations among the defining equations. This makes algebraic sets central to algebraic geometry, since geometric questions can often be translated into questions about ideals and coordinate rings.

1.2 Irreducible algebraic set

An irreducible algebraic set is an algebraic set that cannot be expressed as the union of two proper algebraic subsets. In other words, it is not built from two smaller closed algebraic pieces. This property identifies sets that behave like single geometric units rather than composites.

Irreducibility is a topological notion in the Zariski topology, but it has strong algebraic consequences. Over an algebraically closed field, it corresponds to primality of the defining ideal, making it one of the main bridges between geometry and commutative algebra.

1.2.1 Equivalent characterizations

Several equivalent criteria describe irreducibility. An algebraic set is irreducible if and only if every pair of nonempty open subsets intersects, if and only if it cannot be separated into two proper closed subsets, and, in the affine case over an algebraically closed field, if and only if its coordinate ring has no zero divisors. These formulations are often used interchangeably depending on whether the argument is geometric or algebraic.

Another useful viewpoint is that an irreducible algebraic set has a unique dense open subset in a suitable sense, and any nonempty open subset is itself irreducible. These properties make irreducible sets the natural analogues of indivisible components in the Zariski topology.

1.2.2 Topological interpretation

In topology, irreducibility means that the space cannot be written as the union of two proper closed subsets. The Zariski topology is particularly well suited to this notion because its closed sets are highly rigid and often encode algebraic structure directly. As a result, irreducibility becomes a powerful geometric condition rather than a purely formal one.

For algebraic sets, the topological interpretation is closely related to the idea of generic behavior. A property holding on a dense open subset of an irreducible set is often regarded as holding “generically,” since the exceptional locus is contained in a proper closed subset.

1.3 Reducible versus irreducible sets

A reducible algebraic set decomposes nontrivially as a union of proper algebraic subsets. Such a decomposition reflects the presence of multiple algebraic components, each of which may have distinct geometric or combinatorial features. Reducibility is common in polynomial systems whose equations factor or intersect in several pieces.

By contrast, an irreducible algebraic set behaves as a single piece under decomposition. Many structural results in algebraic geometry are simplest when stated for irreducible sets, since dimension, generic points, and morphisms often have cleaner behavior in that setting.

1.4 Examples and non-examples

A line in affine or projective space is irreducible. More generally, an affine subspace, an irreducible curve, or a nonsingular quadric hypersurface is often irreducible. The zero set of a single irreducible polynomial in a polynomial ring over an algebraically closed field is also an irreducible hypersurface.

By contrast, the zero set of a product of distinct polynomials is typically reducible, since it is the union of the zero sets of the factors. For example, the solution set of \(xy=0\) in the affine plane is the union of two coordinate axes, hence reducible. Likewise, a finite set of two or more distinct points is reducible, as each point is a closed algebraic subset.

2 Algebraic characterization

2.1 Coordinate rings

To an affine algebraic set one associates its coordinate ring, formed by quotienting the polynomial ring by the ideal of all polynomials vanishing on the set. This ring records polynomial functions on the set and captures its algebraic structure. The geometry of the set is reflected in the ring’s algebraic properties.

Irreducibility is detected in the coordinate ring by the absence of zero divisors. When the coordinate ring is an integral domain, the corresponding algebraic set is irreducible. This correspondence is one of the most useful examples of the geometric meaning of ring-theoretic properties.

2.2 Prime ideals

Prime ideals are the algebraic counterpart of irreducible algebraic sets. In a polynomial ring, a prime ideal defines an algebraic set that cannot be decomposed into a union of smaller closed sets. This relationship is central to the dictionary between algebraic geometry and commutative algebra.

Prime ideals also organize the structure of algebraic sets by controlling their components and local behavior. In many arguments, one first studies the ideal and then reads irreducibility from its algebraic features.

2.2.1 Relation to radical ideals

Every vanishing ideal of an algebraic set is radical, meaning it contains every polynomial whose some power lies in the ideal. Radicality ensures that the ideal reflects the set of common zeros exactly, without extra multiplicity information. However, radical ideals need not be prime, so they may define reducible sets.

A radical ideal may decompose as an intersection of prime ideals. This algebraic decomposition parallels the geometric decomposition of the associated set into irreducible components. The distinction between radical and prime ideals is therefore essential in understanding how equations factor into geometric pieces.

2.2.2 Prime ideal criterion for irreducibility

Over an algebraically closed field, an affine algebraic set is irreducible if and only if its defining ideal is prime. Equivalently, the coordinate ring is an integral domain. This criterion is one of the most frequently used tests for irreducibility in practice.

The proof relies on the correspondence between unions of closed sets and intersections of ideals. If an algebraic set were reducible, its vanishing ideal would be an intersection of two larger radical ideals, forcing the coordinate ring to have zero divisors. Conversely, if the ideal is prime, such a decomposition is impossible.

2.3 Vanishing ideals

The vanishing ideal of an algebraic set consists of all polynomials that vanish on every point of the set. It is a fundamental invariant because it encodes the set in purely algebraic terms. For affine algebraic sets, the set can often be recovered from this ideal via the zero locus construction.

Irreducibility can be studied through the vanishing ideal by examining whether it is prime or can be expressed as an intersection of smaller radical ideals. Thus, the ideal serves as a bridge between equations and geometry.

2.4 Nullstellensatz connections

Hilbert’s Nullstellensatz gives the basic correspondence between algebraic sets and radical ideals over algebraically closed fields. It states that the ideal of a zero set is the radical of the generating ideal, and it underlies the bijective relation between affine algebraic sets and radical ideals.

Within this framework, irreducibility becomes a statement about prime radical ideals. The Nullstellensatz therefore supplies the foundational theorem that makes the algebraic characterization of irreducibility precise and usable.

3 Irreducible decomposition

3.1 Decomposition into irreducible components

Every algebraic set can be expressed as a finite union of irreducible algebraic subsets, called irreducible components. This decomposition provides a canonical way to break a reducible set into its simplest closed pieces. Each component is maximal among irreducible closed subsets contained in the set.

The existence of such a decomposition is one of the standard structural facts in algebraic geometry. It allows one to study a complicated algebraic set by analyzing its finitely many irreducible pieces separately.

3.2 Uniqueness of decomposition

The decomposition into irreducible components is unique up to ordering. This means that although one may write the same algebraic set as a union in different ways, the maximal irreducible closed subsets are determined intrinsically. Uniqueness makes the decomposition a robust invariant of the set.

This result is especially useful in calculations with ideals and varieties, where one often wants to identify the geometric components without ambiguity. The uniqueness also ensures that irreducible components are not artifacts of a particular presentation of the equations.

3.3 Maximal irreducible subsets

A maximal irreducible subset is an irreducible closed subset that is not properly contained in any larger irreducible closed subset of the given algebraic set. In the Zariski topology, these are precisely the irreducible components of the set. They form the largest indivisible geometric pieces available.

Maximality is a closed-set condition, so it interacts naturally with containment relations among algebraic subsets. In many examples, these subsets correspond to the visible pieces of a solution set, such as intersecting lines or several components of a curve.

3.4 Minimal prime ideals

Minimal prime ideals above a radical ideal correspond to irreducible components of the associated algebraic set. Each minimal prime defines one component, and the intersection of these primes reconstructs the radical ideal. This correspondence connects the geometric decomposition of a set with the prime decomposition of its ideal.

From the algebraic perspective, minimal primes identify the smallest prime pieces in the ideal structure. They are therefore indispensable in describing the component structure of algebraic sets.

4 Topological and geometric aspects

4.1 Zariski topology

The Zariski topology is the topology in which algebraic sets are closed. It is coarse compared with ordinary Euclidean topology, but it is adapted to polynomial equations and algebraic structure. In this topology, irreducibility becomes a natural and meaningful notion.

Because closed sets are defined by vanishing conditions, the topology reflects the algebraic behavior of the coordinate ring. Many seemingly strong topological properties become common in this setting, especially for irreducible sets.

4.2 Closure and dense subsets

A subset is dense in an algebraic set if its closure is the whole set. In an irreducible algebraic set, any nonempty open subset is dense, and many properties of the entire set are already visible on such subsets. This makes dense open subsets central tools in geometric arguments.

Closure interacts well with irreducibility: the closure of an irreducible subset remains irreducible. This stability is frequently used when passing from an open part of a set to its completion or ambient closure.

4.3 Generic points

A generic point is a point whose closure equals the entire irreducible set. In schemes, generic points are especially important, but even in classical algebraic geometry the idea captures the notion of a point representing the whole component. The existence of a generic point is one of the hallmarks of irreducible behavior.

Generic points formalize the intuition that many properties are determined “at a general point” of an irreducible set. They provide a useful language for discussing dense behavior without specifying coordinates.

4.4 Connectedness versus irreducibility

Irreducibility is stronger than connectedness in the Zariski topology. Every irreducible algebraic set is connected, but a connected algebraic set need not be irreducible. This distinction is important because topological connectedness alone does not capture the algebraic component structure.

4.4.1 When irreducibility implies connectedness

If an algebraic set is irreducible, it cannot be partitioned into two disjoint nonempty open-and-closed subsets. Therefore it is connected. The reason is that such a separation would produce a decomposition into two proper closed subsets, contradicting irreducibility.

This implication is one of the standard immediate consequences of the definition. It often serves as a first check when comparing the topology of an algebraic set with its algebraic decomposition.

4.4.2 Counterexamples to the converse

A connected algebraic set may still be reducible. For example, two coordinate axes in the affine plane meeting at the origin form a connected set in the Zariski topology, but the set is reducible because it is the union of two proper closed subsets. Similar examples arise whenever distinct irreducible components intersect.

These examples show that connectedness detects only the absence of a topological separation, not the finer algebraic splitting into components. As a result, irreducibility remains the more informative notion in algebraic geometry.

5 Dimension and structure

5.1 Dimension of irreducible algebraic sets

The dimension of an irreducible algebraic set measures the length of the longest chain of proper irreducible closed subsets. It is a fundamental invariant that reflects the number of independent parameters needed to describe the set locally or generically. For irreducible sets, dimension behaves especially well.

In many cases, dimension can be interpreted in terms of transcendence degree or the Krull dimension of the coordinate ring. This provides another strong link between geometry and algebra.

5.2 Chains of subvarieties

A chain of subvarieties is a nested sequence of irreducible closed subsets ordered by inclusion. The maximum length of such a chain determines the dimension. This description is particularly useful for proofs and for comparing dimensions of related algebraic sets.

In irreducible settings, chains often reveal how smaller subvarieties sit inside a larger ambient piece. They also clarify the structure of singular loci, divisors, and other important subspaces.

5.3 Codimension

Codimension measures how far a subvariety lies from filling its ambient space. For irreducible algebraic sets, codimension interacts cleanly with dimension and often satisfies familiar inequalities. It is especially useful in the study of intersections and hypersurfaces.

When a subvariety is irreducible, its codimension can often be read from the height of the corresponding prime ideal. This algebraic interpretation is one of the reasons prime ideals are so central to the theory.

5.4 Singular and nonsingular points

An irreducible algebraic set may have both singular and nonsingular points. The nonsingular points usually form a dense open subset, while the singular locus is typically a proper closed subset. Irreducibility ensures that generic points avoid singular behavior in many common situations.

The distinction between singular and nonsingular points is part of the local geometry of the set. Although irreducibility does not imply smoothness, it provides a setting in which smooth behavior can be studied generically.

6 Morphisms and images

6.1 Images of irreducible sets under morphisms

The image of an irreducible algebraic set under a morphism is irreducible, provided the image is taken with the Zariski closure if necessary. This is a foundational fact, since morphisms preserve the notion of being a single geometric piece. It allows irreducibility to be transported through many constructions.

This property is often used to show that parameter spaces, families of solutions, and projection images inherit irreducibility from the source. It is one of the main reasons irreducibility is stable under geometric operations.

6.2 Dominant morphisms

A dominant morphism is a morphism whose image is dense in the target. When the source is irreducible, dominant morphisms are especially important because they relate the function fields and dimensions of the source and target. They often arise in parametrizations and projection maps.

Dominance ensures that the map captures the generic structure of the target. In irreducible settings, this is particularly effective since the closure of the image is again irreducible.

6.3 Fibers and constructibility

Fibers of morphisms over irreducible sets can vary in dimension and shape, but their behavior is constrained by constructibility results. Constructible sets are built from finite unions of locally closed pieces, and they often describe the images or parameter loci associated with a morphism. These tools are important for understanding how irreducibility behaves in families.

In many standard results, the generic fiber of a morphism from an irreducible source has especially regular behavior. This leads to powerful dimension and specialization statements.

6.4 Products of irreducible algebraic sets

The product of two irreducible algebraic sets is irreducible. This fact is compatible with the tensor product behavior of coordinate rings and with the idea that independent geometric pieces combine to form a single larger piece. Products therefore preserve the essential indivisibility of the factors.

This property is frequently used when studying parameter spaces, incidence varieties, and families of algebraic objects. It allows one to build new irreducible sets from old ones in a controlled way.

7 Examples in affine and projective geometry

7.1 Affine plane curves

An affine plane curve defined by an irreducible polynomial is irreducible as an algebraic set. Such curves provide some of the most accessible examples, since factorization of the defining equation often directly determines reducibility. A curve given by a product of linear factors, for instance, splits into several lines.

Affine plane curves illustrate how algebraic factorization mirrors geometric decomposition. They are therefore standard test cases for the prime ideal criterion.

7.2 Projective varieties

Projective varieties can also be irreducible or reducible, depending on whether their homogeneous defining ideals are prime. Irreducible projective varieties play the same role in projective geometry as irreducible affine varieties do in affine geometry. They are stable under projective closure in many common situations.

Because projective space is compact in the Zariski sense, projective irreducible varieties often arise as closures of affine ones. This makes them useful in compactification arguments and in the study of global geometric properties.

7.3 Hypersurfaces

A hypersurface defined by a single irreducible polynomial is irreducible. If the polynomial factors nontrivially, the hypersurface decomposes into the union of the hypersurfaces of the factors. Hypersurfaces are therefore one of the clearest settings in which irreducibility can be checked directly from the equation.

Examples include smooth quadric hypersurfaces, which are often irreducible, and reducible hypersurfaces like the zero set of \(xy\) or \(xyz\). The algebraic factorization is usually the decisive feature.

7.4 Coordinate examples over algebraically closed fields

Over an algebraically closed field, coordinate examples often make the irreducibility criterion especially concrete. The zero set of \(x^2+y^2\) in an algebraically closed field may be reducible or irreducible depending on whether the polynomial factors in that field, while over the complex numbers many quadratic forms split after suitable change of variables. By contrast, ideals generated by prime polynomials define irreducible sets directly.

Such examples show that irreducibility depends not only on the equations but also on the ground field. The same geometric-looking system can behave differently after base-field extension, which makes the algebraic setting essential.