Comparison of topologies

In topology and related areas of mathematics, the set of all possible topologies on a given set forms a partially ordered set. This order relation can be used for comparison of the topologies.

Definition

A topology on a set may be defined as the collection of subsets which are considered to be "open". (An alternative definition is that it is the collection of subsets which are considered "closed". These two ways of defining the topology are essentially equivalent because the complement of an open set is closed and vice versa. In the following, it doesn't matter which definition is used.)

For definiteness the reader should think of a topology as the family of open sets of a topological space, since that is the standard meaning of the word "topology".

Let τ₁ and τ₂ be two topologies on a set X such that τ₁ is contained in τ₂:

${\displaystyle \tau _{1}\subseteq \tau _{2}}$.

That is, every element of τ₁ is also an element of τ₂. Then the topology τ₁ is said to be a coarser (weaker or smaller) topology than τ₂, and τ₂ is said to be a finer (stronger or larger) topology than τ₁.

If additionally

${\displaystyle \tau _{1}\neq \tau _{2}}$

we say τ₁ is strictly coarser than τ₂ and τ₂ is strictly finer than τ₁.

The binary relation ⊆ defines a partial ordering relation on the set of all possible topologies on X.

Examples

The finest topology on X is the discrete topology; this topology makes all subsets open. The coarsest topology on X is the trivial topology; this topology only admits the empty set and the whole space as open sets.

In function spaces and spaces of measures there are often a number of possible topologies. See topologies on the set of operators on a Hilbert space for some intricate relationships.

All possible polar topologies on a dual pair are finer than the weak topology and coarser than the strong topology.

The complex vector space Cⁿ may be equipped with either its usual (Euclidean) topology, or its Zariski topology. In the latter, a subset V of Cⁿ is closed if and only if it consists of all solutions to some system of polynomial equations. Since any such V also is a closed set in the ordinary sense, but not vice versa, the Zariski topology is strictly weaker than the ordinary one.

Properties

Let τ₁ and τ₂ be two topologies on a set X. Then the following statements are equivalent:

• τ₁ ⊆ τ₂
• the identity map id_X : (X, τ₂) → (X, τ₁) is a continuous map.
• the identity map id_X : (X, τ₁) → (X, τ₂) is a strongly/relatively open map.

(The identity map id_X is surjective and therefore it is strongly open if and only if it is relatively open.)

Two immediate corollaries of the above equivalent statements are

• A continuous map f : X → Y remains continuous if the topology on Y becomes coarser or the topology on X finer.
• An open (resp. closed) map f : X → Y remains open (resp. closed) if the topology on Y becomes finer or the topology on X coarser.

One can also compare topologies using neighborhood bases. Let τ₁ and τ₂ be two topologies on a set X and let B_i(x) be a local base for the topology τ_i at x ∈ X for i = 1,2. Then τ₁ ⊆ τ₂ if and only if for all x ∈ X, each open set U₁ in B₁(x) contains some open set U₂ in B₂(x). Intuitively, this makes sense: a finer topology should have smaller neighborhoods.

Lattice of topologies

The set of all topologies on a set X together with the partial ordering relation ⊆ forms a complete lattice that is also closed under arbitrary intersections. That is, any collection of topologies on X have a meet (or infimum) and a join (or supremum). The meet of a collection of topologies is the intersection of those topologies. The join, however, is not generally the union of those topologies (the union of two topologies need not be a topology) but rather the topology generated by the union.

Every complete lattice is also a bounded lattice, which is to say that it has a greatest and least element. In the case of topologies, the greatest element is the discrete topology and the least element is the trivial topology.

The lattice of topologies on a set ${\displaystyle X}$ is a complemented lattice; that is, given a topology ${\displaystyle \tau }$ on ${\displaystyle X}$ there exists a topology ${\displaystyle \tau '}$ on ${\displaystyle X}$ such that the intersection ${\displaystyle \tau \cap \tau '}$ is the trivial topology and the topology generated by the union ${\displaystyle \tau \cup \tau '}$ is the discrete topology.

If the set ${\displaystyle X}$ has at least three elements, the lattice of topologies on ${\displaystyle X}$ is not modular, and hence not distributive either.

See also

• Initial topology, the coarsest topology on a set to make a family of mappings from that set continuous
• Final topology, the finest topology on a set to make a family of mappings into that set continuous

Notes

1. There are some authors, especially analysts, who use the terms weak and strong with opposite meaning (Munkres, p. 78).

References

1. Munkres, James R. (2000). Topology (2nd ed.). Saddle River, NJ: Prentice Hall. pp. 77–78. ISBN 0-13-181629-2.
2. Larson, Roland E.; Andima, Susan J. (1975). "The lattice of topologies: A survey". Rocky Mountain Journal of Mathematics. 5 (2): 177–198. doi:10.1216/RMJ-1975-5-2-177.
3. Steiner, A. K. (1966). "The lattice of topologies: Structure and complementation". Transactions of the American Mathematical Society. 122 (2): 379–398. doi:10.1090/S0002-9947-1966-0190893-2.
4. Van Rooij, A. C. M. (1968). "The Lattice of all Topologies is Complemented". Canadian Journal of Mathematics. 20: 805–807. doi:10.4153/CJM-1968-079-9.
5. Steiner 1966, Theorem 3.1.