In topology and related areas of mathematics comparison of topologies refers to the fact that two topological structures on a given set may stand in relation to each other. The set of all possible topologies on a given set forms a partially ordered set. This order relation can be used to compare the different topologies.
Let τ1 and τ2 be two topologies on a set X such that τ1 is contained in τ2:
That is, every element of τ1 is also an element of τ2. Then the topology τ1 is said to be a coarser (weaker or smaller) topology than τ2, and τ2 is said to be a finer (stronger or larger) topology than τ1.[nb 1] If additionally
we say τ1 is strictly coarser than τ2 and τ2 is strictly finer than τ1.
The binary relation ⊆ defines a partial ordering relation on the set of all possible topologies on X.
The finest topology on X is the discrete topology. The coarsest topology on X is the trivial topology.
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.
Let τ1 and τ1 be two topologies on a set X. Then the following statements are equivalent:
* τ1 ⊆ τ1
Two immediate corollaries of this statement are
* A continuous map f : X → Y remains continuous if the topology on Y becomes coarser or the topology on X finer.
One can also compare topologies using neighborhood bases. Let τ1 and τ2 be two topologies on a set X and let Bi(x) be a local base for the topology τi at x ∈ X for i = 1,2. Then τ1 ⊆ τ2 if and only if for all x ∈ X, each open set U1 in B1(x) contains some open set U2 in B2(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, 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 is 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.
1. ^ There are some authors, especially analysts, who use the terms weak and strong with opposite meaning.
* Initial topology, the coarsest topology on a set to make a family of mappings from that set continuous