## Interiors and Closures

When we pick a topology on a set , not every subset is open, and not every subset is closed. However, we can still come up with some open and closed sets from any subset .

For the open set, notice that we always have at least one open set inside : the empty set. So we can gather up all the open sets contained in and take their union. Since they’re all contained in the union will be as well. And since arbitrary unions of open sets are still open, it’s an open set. In fact, it’s the largest open set contained in , because it contains all the other open subsets of . We call this the “interior” of , denoted or . Clearly the interior of an open set it the set itself.

Dually, we know that there is at least one closed set containing : the whole space . Then the intersection of all the closed sets containing will be a closed set containing , and will be the smallest such closed set. We call this the “closure” of and write or . As for the interior, the closure of a closed set is the set itself.

Now the complement of the closure of is an open set contained in the complement of . In fact, any other open set contained in the complement of will be contained in this one, so it is the interior of the complement of . Dually, the closure of the complement of is the complement of the interior of .

We can write this fact down categorically as well. Since it reverses subset containment, complementation is a contravariant equivalence from the poset of subsets of (considered as a category) to itself. That is, is equivalent to . The interior and closure operators are covariant functors from to itself, since they preserve containment. The previous paragraph states that these two functors are dual to each other, in the sense that is the same functor as under the above equivalence. So all the really important information is contained in the closure functor.

Now, what do we know about this functor? Well, since is contained in we have a natural transformation . Then since is contained in we have a natural transformation . I haven’t really covered these yet, but it’s straightforward from here to verify that along with these two natural transformations forms a monad. If you’re interested in learning more right away, go check out The Catsters’ series of YouTube videos.

We also can easily check that , and that . That is, the functor preserves all finite coproducts. It turns out that this is enough to characterize the topology in its entirety!

Given a set , a closure operator on is a monad , where is a functor which preserves finite coproducts. This data is equivalent to the four axioms given by Kuratowski:

From here we can define the closed sets of to be those in the image of the functor . From axiom 1 we see that , but this closure must be a subset of , and so is closed. Axiom 4 tells us straight off that is closed. Axiom 3 tells us that the finite union of closed sets is closed. We just need to know that arbitrary intersections of closed sets are again closed.

For this, we note that given any collection of subsets, the intersection lies in each , and so by functoriality for each . Thus we see that . In particular, if all the are closed, then . But since for all , this inclusion is actually an equality, and thus the intersection of the is in the image of the closure functor. And thus we really have constructed the closed sets of a topology on .

Topologies are a type of monad? How unexpected.

Comment by nbornak | November 13, 2007 |

Actually, just about closure operator can be construed as a monad acting on a poset, typically a lattice. For example, let G be a group, and consider the operator Gr: P(G) –> P(G) which assigns to each subset U of G the subgroup Gr(U) it generates (i.e., close up U under the group operations of G). Then Gr is a monad acting on the poset P(G). Examples of this sort are easily multiplied. It even seems reasonable to

definea closure operator as a monad acting on a poset.But it’s a pleasant fact that, as John said,

topologieson X are precisely tantamount to monads P(X) –> P(X)that preserve finite unions(= coproducts). (Or, alternatively, to comonads which preserve finite intersections.)Other monads which don’t act on posets but which still behave like closure operators are: completion of a metric space (as a monad on the category of metric spaces and uniformly continuous maps), and completion of an integral domain to its field of quotients. In cases like these, the “completion of the completion is isomorphic to the completion”; more precisely, the multiplication is an isomorphism. Such monads are called

idempotent.Comment by Todd Trimble | November 13, 2007 |

That seriously rocks. Thanks for the insight.

Comment by nbornak | November 13, 2007 |

S’what I’m here for. With ample assistance from Todd, of course.

Actually, to be honest a certain amount of the categorical interpretations are things I’ve idly thought should be there, but never worked out the details before. Presenting point-set topology here gives me the excuse to work it out as I go. The upshot is that there may be even cooler ways to say it, but I don’t notice them at a first (well, second) pass.

Comment by John Armstrong | November 13, 2007 |

[…] an open set containing — itself! Similarly, a subset is a neighborhood of any point in its interior. But what about a point not in its interior? If we take a point , but , then is a neighborhood of […]

Pingback by Neighborhoods « The Unapologetic Mathematician | November 15, 2007 |

[…] a topology. First we’re going to need yet another way of looking at the points in the closure of a […]

Pingback by Nets, Part II « The Unapologetic Mathematician | November 20, 2007 |

[…] (2) above does not account for arbitrary unions. The schema is rather messy, as well.Perhaps the closure axioms will be of more use. Let the language be . (That’s a constant for the empty set, operators […]

Pingback by Language of topology « Mort aux Triangles! | November 26, 2007 |

[…] . a forteriori it contains a neighborhood of , and thus contains itself. Thus the point is in the closure of the set . This is really close. The points are topologically distinguishable, but still a bit […]

Pingback by Separation Properties « The Unapologetic Mathematician | January 10, 2008 |

[…] is just the analogue in our particular categories. In particular, these functions behave like closure operators, but for the fact that general posets don’t have joins or bottom elements to preserve in the […]

Pingback by Galois Connections « The Unapologetic Mathematician | May 18, 2009 |

[…] Then we just count up all the subintervals in the partition that are completely contained in the interior and add their volumes together. This is the volume of some collection of boxes which is completely […]

Pingback by Jordan Content « The Unapologetic Mathematician | December 3, 2009 |

[…] a few times when it’s been pretty clear from context, but let me be clear. We know about the interior and closure of a set, and particularly of a subset of . The boundary of such a set will consist of all the […]

Pingback by Jordan Content and Boundaries « The Unapologetic Mathematician | December 4, 2009 |