SearcharxivSearch

arXiv · 2107.11301

Each closure operator induces a topology and vice-versa ("version for children")

Abstract

One of the main prerequisites for understanding sheaves on elementary toposes is the proof that a (Lawvere-Tierney) topology on a topos induces a closure operator on it, and vice-versa. That standard theorem is usually presented in a relatively brief way, with most details being left to the reader and with no hints on how to visualize some of the hardest axioms and proofs. These notes are, on a first level, an attempt to present that standard theorem in all details and in a visual way, following the conventions in "On my favorite conventions for drawing the missing diagrams in Category Theory" [Ochs2020]; in particular, some properties, like stability by pullbacks, are always drawn in the same "shape". On a second level these notes are also an experiment on doing these proofs on "archetypal cases" in ways that makes all the proofs easy to lift to the "general case". Our first archetypal case is a "topos with inclusions". This is a variant of the "toposes with canonical subobjects" from [Lambek/Scott 1986]; all toposes of the form $\mathbf{Set}^\mathbf{C}$, where $\mathbf{C}$ is a small category, are toposes with inclusions, and when we work with toposes with inclusions concepts like subsets and intersections are very easy to formalize. We do all our proofs on the correspondence between closure operators and topologies in toposes with inclusions, and then we show how to lift all our proofs to proofs that work on any topos. Our second archetypal case is toposes of the form $\mathbf{Set}^\mathbf{D}$, where $\mathbf{D}$ is a finite two-column graph. We show a way to visualize all the LT-topologies on toposes of the form $\mathbf{Set}^\mathbf{D}$, and we define formally a way to "add visual intuition to a proof about toposes"; this is related to the several techniques for doing "Category Theory for children" that are explained in "On my favorite conventions...".

Explore related subjects

Keep this discovery

BibTeXRIS

Eduardo Ochs. 2021-07-23. Each closure operator induces a topology and vice-versa ("version for children"). https://arxiv.org/abs/2107.11301

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT