Category Theory
Zulip Server
Archive

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.


Stream: theory: category theory

Topic: On doing category theory within set-theoretic foundations


view this post on Zulip Patrick Nicodemus (Jan 04 2024 at 04:54):

This paper is pretty interesting and hard to find a copy of so I'm posting it here to share it as I think others might also find it interesting. Rather than Grothendieck universes it proposes working in the category of sets in V_\lambda, parametrically in lambda for all sufficiently nice lambda (regular uncountable, say). It introduces a notion of "slow-growing categories" which i found pretty intriguing.
The paper is by V. K. Rao at Ohio State.

vidhyanath-rao-foundations.pdf

view this post on Zulip David Michael Roberts (Jan 04 2024 at 06:31):

Thanks for this! I saw you add it to the nLab ( :partying_face: ) but couldn't find more than a partial Google Books preview.

view this post on Zulip Matteo Capucci (he/him) (Jan 04 2024 at 20:08):

"A category C is called slowly growing if the underlying set of C is contained in V and every
small set of morphisms of C is contained in a small subcategory of C"
How could the second clause fail? If I have a small set of morphisms, then they span at most twice as many objects, and twice a small set is still small, innit?

view this post on Zulip Mike Shulman (Jan 04 2024 at 20:16):

"small" here doesn't refer just to size, but to membership in a specific ZFC-style set. In particular, something small can be isomorphic to something large. So the condition is a non-structural one about what the objects and morphisms of the category "actually are" in the ZFC sense.

view this post on Zulip Matteo Capucci (he/him) (Jan 04 2024 at 20:18):

ooh I see

view this post on Zulip Matteo Capucci (he/him) (Jan 04 2024 at 20:18):

thanks!