lattice of topologies
Let be a set. Let be the set of all topologies on . We may order by inclusion. When , we say that is finer (http://planetmath.org/Finer) than , or that refines .
Theorem 1.
, ordered by inclusion, is a complete lattice.
Proof.
Clearly is a partially ordered set when ordered by . Furthermore, given any family of topologies on , their intersection also defines a topology on . Finally, let ’s be the corresponding subbases for the ’s and let . Then generated by is easily seen to be the supremum of the ’s. ∎
Let be the lattice of topologies on . Given , is called the common refinement of . By the proof above, this is the coarsest topology that is than each .
If is non-empty with more than one element, is also an atomic lattice. Each atom is a topology generated by one non-trivial subset of (non-trivial being non-empty and not ). The atom has the form , where .
Remark. In general, a lattice of topologies on a set is a sublattice of the lattice of topologies (mentioned above) on .
Title | lattice of topologies |
---|---|
Canonical name | LatticeOfTopologies |
Date of creation | 2013-03-22 16:54:42 |
Last modified on | 2013-03-22 16:54:42 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 8 |
Author | CWoo (3771) |
Entry type | Definition |
Classification | msc 54A10 |
Related topic | Coarser |
Defines | common refinement |