Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sober topologies on a set

Published 7 Aug 2025 in math.GN | (2508.05419v1)

Abstract: The collection of all topologies on a set X forms a complete lattice with respect to the inclusion order, which have been investigated by many researchers. Sobriety is one of the core and extensively studied properties in non-Hausdorff topology. This property plays a crucial role in characterizing the spectral spaces of commutative rings and topological spaces determined by their lattices of open sets. In this paper, we investigate the statute of sober topologies in the complete lattice of all topologies on a given set. The main results to be proved include: (1) every T1 topology is the join of some sober topologies; (2) every topology is the meet of some sober topologies; (3) the set of all sober topologies is directed complete; (4) every Alexanderoff - discrete topology is the meet of some sober Alexanderoff - discrete topologies; (5) the minimal sober topologies are exactly the Scott topologies of sup-complete chains; (6) an example will be constructed to show that the intersection of a decreasing sequence of Hausdorff topologies need not be sober.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We found no open problems mentioned in this paper.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.