You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Let be a Boolean topos satisfying the internal axiom of choice.
This is a question about doing set theory internal to . Not " as model of structural set theory" but closer to "models of set theory in ".
Actually the set theory I am interested in here is more material than structural, as I am interested in subsets of modelled as predicates , so we have extensionality and so on.
Let be an object in .
There should, I think, be an internal category structure in where is the object of objects. The arrows in this category are "functions between subsets of ". I am not talking about functions that respect the subset inclusion into A (which are unique if they exist) - the functions in this category can be arbitrary.
I have three different ideas for exactly what the object of arrows should be, which I'll discuss later.
The basic question is: Treating as the objects of the "category of subsets of A", what assumptions can we impose on so that the subcategory of "small subsets of " (for a suitable definition of "small") has the good properties we want of a category of sets? For example, finite products, finite coproducts, exponentials, limits and colimits indexed by a map for a "small" object , and so on.
Even without "smallness" assumptions, I would expect that if is infinite in the appropriate sense then has finite products and coproducts, as and should admit an embedding into . What definitions of "infinite" work here?
My motivations here are practical.
My question is really about the theorem prover Isabelle/HOL, whose logic is very close to that of a Boolean topos satisfying the internal axiom of choice. I want to develop category theory in Isabelle/HOL.
This analogy is not perfect. The most important distinction I have noticed is that the "subobject classifier" in Isabelle actually gives something strictly weaker: for every predicate such that , there is a subobject of classified by ; but it is essential that the predicate be true for at least one element. This category has no initial object and every object is equipped with a canonical map from the terminal object. Still, for practical purposes it appears one can get away with the constantly-false predicate on an object every time one appears to need the initial object, and so there is no real harm done. It would be a valuable contribution of the categorical logic community if anyone wants to work out what exactly the internal logic of such a category is and how it relates to topos theory, or prove an equivalence between fragments of logic, as this is actually a real world logic that literally thousands of people use! It's very important!
The fact that this is a "real world problem" (I want to actually prove theorems in this logic) is relevant here because it biases me away from verbose solutions to problems which will become unwieldy later on even if they're more categorically elegant.
In the definition of the morphisms of , the one could do this with functions as relations on , i.e. if then is a function from if and . My instinct is that relations instead of functions would get pretty unwieldy in actually proving theorems in this logic (I want to use terms to denote values) and so I want to work with a subset of . There are two relevant definitions that jump out at me here:
Perhaps all these definitions are isomorphic when is inhabited, I have not thought through that yet.
In conclusion I propose three basic definitions of the "internal category of subsets of and arbitrary functions between them" and ask, for whichever choice of definition you care to investigate, what do we need to assume about in order to do mathematics?
Since is Boolean and satisfies choice, via the internal language of , we can turn these questions back into questions about ordinary classical set theory, right?
The question is about the category of all sets that are (isomorphic to) subsets of some fixed set .
Then the answers would be (0) these definitions of the morphisms are equivalent, (1) this category has finite (co)limits as soon as is infinite, (2) the category will be closed under small colimits but not under small limits, (3) again as soon as is infinite (or in general, big enough compared to the size of the algebraic theory)
About 2: the category will not have a product of copies of an object with two elements, by Cantor ().
Usually the good way to build a "category of sets" in classical mathematics is to fix a universe--let's say --of "classes", and make the objects be subsets of of cardinality smaller than .
Then, good cardinal features of will translate into good features of the resulting category of sets.
Yes, that all makes sense. In that case I will need to formalize a little bit of cardinal arithmetic and/or import some additional libraries.
I was hoping for a little more of a lightweight solution but it is certainly the most robust.