Specialization (pre)order

Last updated November 12, 2024

In the branch of mathematics known as topology, the specialization (or canonical) preorder is a natural preorder on the set of the points of a topological space. For most spaces that are considered in practice, namely for all those that satisfy the T₀ separation axiom, this preorder is even a partial order (called the specialization order). On the other hand, for T₁ spaces the order becomes trivial and is of little interest.

Definition and motivation

Consider any topological space X. The specialization preorder ≤ on X relates two points of X when one lies in the closure of the other. However, various authors disagree on which 'direction' the order should go. What is agreed^{[ citation needed ]} is that if

x is contained in cl{y},

(where cl{y} denotes the closure of the singleton set {y}, i.e. the intersection of all closed sets containing {y}), we say that x is a specialization of y and that y is a generalization of x; this is commonly written y ⤳ x.

Unfortunately, the property "x is a specialization of y" is alternatively written as "x ≤ y" and as "y ≤ x" by various authors (see, respectively, ^[1] and ^[2]).

Both definitions have intuitive justifications: in the case of the former, we have

x ≤ y if and only if cl{x} ⊆ cl{y}.

However, in the case where our space X is the prime spectrum Spec R of a commutative ring R (which is the motivational situation in applications related to algebraic geometry), then under our second definition of the order, we have

y ≤ x if and only if y ⊆ x as prime ideals of the ring R.

For the sake of consistency, for the remainder of this article we will take the first definition, that "x is a specialization of y" be written as x ≤ y. We then see,

x ≤ y if and only if x is contained in all closed sets that contain y.

x ≤ y if and only if y is contained in all open sets that contain x.

These restatements help to explain why one speaks of a "specialization": y is more general than x, since it is contained in more open sets. This is particularly intuitive if one views closed sets as properties that a point x may or may not have. The more closed sets contain a point, the more properties the point has, and the more special it is. The usage is consistent with the classical logical notions of genus and species; and also with the traditional use of generic points in algebraic geometry, in which closed points are the most specific, while a generic point of a space is one contained in every nonempty open subset. Specialization as an idea is applied also in valuation theory.

The intuition of upper elements being more specific is typically found in domain theory, a branch of order theory that has ample applications in computer science.

Upper and lower sets

Let X be a topological space and let ≤ be the specialization preorder on X. Every open set is an upper set with respect to ≤ and every closed set is a lower set. The converses are not generally true. In fact, a topological space is an Alexandrov-discrete space if and only if every upper set is also open (or equivalently every lower set is also closed).

Let A be a subset of X. The smallest upper set containing A is denoted ↑A and the smallest lower set containing A is denoted ↓A. In case A = {x} is a singleton one uses the notation ↑x and ↓x. For x ∈ X one has:

↑x = {y ∈ X : x ≤ y} = ∩{open sets containing x}.
↓x = {y ∈ X : y ≤ x} = ∩{closed sets containing x} = cl{x}.

The lower set ↓x is always closed; however, the upper set ↑x need not be open or closed. The closed points of a topological space X are precisely the minimal elements of X with respect to ≤.

Examples

In the Sierpinski space {0,1} with open sets {∅, {1}, {0,1}} the specialization order is the natural one (0 ≤ 0, 0 ≤ 1, and 1 ≤ 1).
If p, q are elements of Spec(R) (the spectrum of a commutative ring R) then p ≤ q if and only if q ⊆ p (as prime ideals). Thus the closed points of Spec(R) are precisely the maximal ideals.

Important properties

As suggested by the name, the specialization preorder is a preorder, i.e. it is reflexive and transitive.

The equivalence relation determined by the specialization preorder is just that of topological indistinguishability. That is, x and y are topologically indistinguishable if and only if x ≤ y and y ≤ x. Therefore, the antisymmetry of ≤ is precisely the T₀ separation axiom: if x and y are indistinguishable then x = y. In this case it is justified to speak of the specialization order.

On the other hand, the symmetry of the specialization preorder is equivalent to the R₀ separation axiom: x ≤ y if and only if x and y are topologically indistinguishable. It follows that if the underlying topology is T₁, then the specialization order is discrete, i.e. one has x ≤ y if and only if x = y. Hence, the specialization order is of little interest for T₁ topologies, especially for all Hausdorff spaces.

Any continuous function $f$ between two topological spaces is monotone with respect to the specialization preorders of these spaces: $x\leq y$ implies $f(x)\leq f(y).$ The converse, however, is not true in general. In the language of category theory, we then have a functor from the category of topological spaces to the category of preordered sets that assigns a topological space its specialization preorder. This functor has a left adjoint, which places the Alexandrov topology on a preordered set.

There are spaces that are more specific than T₀ spaces for which this order is interesting: the sober spaces. Their relationship to the specialization order is more subtle:

For any sober space X with specialization order ≤, we have

(X, ≤) is a directed complete partial order, i.e. every directed subset S of (X, ≤) has a supremum sup S,
for every directed subset S of (X, ≤) and every open set O, if sup S is in O, then S and O have non-empty intersection.

One may describe the second property by saying that open sets are inaccessible by directed suprema. A topology is order consistent with respect to a certain order ≤ if it induces ≤ as its specialization order and it has the above property of inaccessibility with respect to (existing) suprema of directed sets in ≤.

Topologies on orders

The specialization order yields a tool to obtain a preorder from every topology. It is natural to ask for the converse too: Is every preorder obtained as a specialization preorder of some topology?

Indeed, the answer to this question is positive and there are in general many topologies on a set X that induce a given order ≤ as their specialization order. The Alexandroff topology of the order ≤ plays a special role: it is the finest topology that induces ≤. The other extreme, the coarsest topology that induces ≤, is the upper topology, the least topology within which all complements of sets ↓x (for some x in X) are open.

There are also interesting topologies in between these two extremes. The finest sober topology that is order consistent in the above sense for a given order ≤ is the Scott topology. The upper topology however is still the coarsest sober order-consistent topology. In fact, its open sets are even inaccessible by any suprema. Hence any sober space with specialization order ≤ is finer than the upper topology and coarser than the Scott topology. Yet, such a space may fail to exist, that is, there exist partial orders for which there is no sober order-consistent topology. Especially, the Scott topology is not necessarily sober.

Related Research Articles

In topology and related branches of mathematics, a Hausdorff space ( HOWSS-dorf, HOWZ-dorf), T₂ space or separated space, is a topological space where distinct points have disjoint neighbourhoods. Of the many separation axioms that can be imposed on a topological space, the "Hausdorff condition" (T₂) is the most frequently used and discussed. It implies the uniqueness of limits of sequences, nets, and filters.

In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called points, along with an additional structure called a topology, which can be defined as a set of neighbourhoods for each point that satisfy some axioms formalizing the concept of closeness. There are several equivalent definitions of a topology, the most commonly used of which is the definition through open sets, which is easier than the others to manipulate.

This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also fundamental to algebraic topology, differential topology and geometric topology. For a list of terms specific to algebraic topology, see Glossary of algebraic topology.

In mathematics, an open set is a generalization of an open interval in the real line.

In topology and related fields of mathematics, a topological space X is called a regular space if every closed subset C of X and a point p not contained in C have non-overlapping open neighborhoods. Thus p and C can be separated by neighborhoods. This condition is known as Axiom T₃. The term "T₃ space" usually means "a regular Hausdorff space". These conditions are examples of separation axioms.

In topology and related branches of mathematics, a topological space X is a T₀ space or Kolmogorov space (named after Andrey Kolmogorov) if for every pair of distinct points of X, at least one of them has a neighborhood not containing the other. In a T₀ space, all points are topologically distinguishable.

In topology and related branches of mathematics, a T₁ space is a topological space in which, for every pair of distinct points, each has a neighborhood not containing the other point. An R₀ space is one in which this holds for every pair of topologically distinguishable points. The properties T₁ and R₀ are examples of separation axioms.

In mathematics, general topology is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometric topology, and algebraic topology.

Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of order-theoretic terms can be found in the order theory glossary.

In mathematics, a cofinite subset of a set $is a subset whose complement in is a finite set. In other words, contains all but finitely many elements of If the complement is not finite, but is countable, then one says the set is cocountable.$

In mathematics, the Sierpiński space is a finite topological space with two points, only one of which is closed. It is the smallest example of a topological space which is neither trivial nor discrete. It is named after Wacław Sierpiński.

In topology, an Alexandrov topology is a topology in which the intersection of every family of open sets is open. It is an axiom of topology that the intersection of every finite family of open sets is open; in Alexandrov topologies the finite qualifier is dropped.

In mathematics, a sober space is a topological space X such that every (nonempty) irreducible closed subset of X is the closure of exactly one point of X: that is, every nonempty irreducible closed subset has a unique generic point.

In mathematics, given two partially ordered sets P and Q, a function f: P → Q between them is Scott-continuous if it preserves all directed suprema. That is, for every directed subset D of P with supremum in P, its image has a supremum in Q, and that supremum is the image of the supremum of D, i.e. $, where is the directed join. When is the poset of truth values, i.e. Sierpiński space, then Scott-continuous functions are characteristic functions of open sets, and thus Sierpiński space is the classifying space for open sets.$

In topology and related areas of mathematics, a topological property or topological invariant is a property of a topological space that is invariant under homeomorphisms. Alternatively, a topological property is a proper class of topological spaces which is closed under homeomorphisms. That is, a property of spaces is a topological property if whenever a space X possesses that property every space homeomorphic to X possesses that property. Informally, a topological property is a property of the space that can be expressed using open sets.

In the mathematical field of topology, a topological space is usually defined by declaring its open sets. However, this is not necessary, as there are many equivalent axiomatic foundations, each leading to exactly the same concept. For instance, a topological space determines a class of closed sets, of closure and interior operators, and of convergence of various types of objects. Each of these can instead be taken as the primary class of objects, with all of the others directly determined from that new starting point. For example, in Kazimierz Kuratowski's well-known textbook on point-set topology, a topological space is defined as a set together with a certain type of "closure operator," and all other concepts are derived therefrom. Likewise, the neighborhood-based axioms can be retraced to Felix Hausdorff's original definition of a topological space in Grundzüge der Mengenlehre.

In the mathematical field of topology, a hyperconnected space or irreducible space is a topological space X that cannot be written as the union of two proper closed subsets. The name irreducible space is preferred in algebraic geometry.

In topology, two points of a topological space X are topologically indistinguishable if they have exactly the same neighborhoods. That is, if x and y are points in X, and N_x is the set of all neighborhoods that contain x, and N_y is the set of all neighborhoods that contain y, then x and y are "topologically indistinguishable" if and only if N_x = N_y. (See Hausdorff's axiomatic neighborhood systems.)

In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space which has only finitely many elements.

In topology and related fields of mathematics, there are several restrictions that one often makes on the kinds of topological spaces that one wishes to consider. Some of these restrictions are given by the separation axioms. These are sometimes called Tychonoff separation axioms, after Andrey Tychonoff.

References

↑ Hartshorne, Robin (1977), Algebraic geometry, New York-Heidelberg: Springer-Verlag
↑ Hochster, Melvin (1969), Prime ideal structure in commutative rings (PDF), vol. 142, Trans. Amer. Math. Soc., pp. 43–60

v t e Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types ( list )	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially ordered group Positive cone of a partially ordered group Upper set Young's lattice