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.
I just noticed something which is really messing with my head. Let .
Let be a regular cardinal. Let denote the -category of locally -presentable -categories and left adjoint functors which preserve -presentable objects. Note that there is an adjoint equivalence , where is the -category of small -categories with -small colimits and split idempotents (this last proviso is automatic when ). Here is what you think, and takes the full subcategory of -presentable objects.
¡¡Observation!!: is itself locally -presentable.
That is, we have -- "a category that eats itself"!
Proof: It's equivalent to show that is locally -presentable. For this, observe that the forgetful functor is monadic (with left adjoint ), and preserves -filtered colimits (you can deduce this from the observation that the walking idempotent , along with every -small -category, is -presentable in ). Since is locally -presentable and is the algebras for a -accessible monad thereon, the latter is also locally -presentable.
It's so unusual for me to think about a "category which appears as an object of itself" that I'm still pondering whether the simple argument above is mistaken...
I think it's correct, though. Assuming this, the next thing to ponder is whether there is a category-theoretic sense in which " is an object of itself". Something more "intrinsic" than saying " lies in the image of the forgetful functor ".
And most of all -- how does the relation avoid leading to Russell-type paradoxes?
This would all work just as well with locally presentable -categories, except for the fact that the collection thereof really needs to be a -category.
Tim Campion said:
... Since is locally -presentable and is the algebras for a -accessible monad thereon, the latter is also locally -presentable....
I'm a bit paranoid now -- although the nlab page indicates that taking EM categories preserves accessibility ranks, the citation is to 2.78 of Adamek-Rosicky, which only says that the EM category of an accessible monad is accessible, without commenting on the preservation of accessibility ranks. But I think the nlab is correct under the stated assumption of local presentability -- if is a -accessible monad on a - accessible category , then I believe that is densely generated by the free algebras on -presentable objects of , and these objects are definitely -presentable. This doesn't immediately imply that is -accessible, but if we assume that is locally -presentable and not just -accessible, then is also cocomplete, so we can deduce that it's locally -presentable by the criterion of Gabriel and Ulmer (Thm 1.20 in Adamek-Rosicky), i.e. we see that is cocomplete with a strong generator of -presentable objects.
(Strictly speaking this might not all be in the literature in the -setting, but it should at least be expected there.)
The technical details of this are way beyond me, but instinctively the idea that things can be parts of themselves is pretty natural: fractals are everywhere in nature. So this seems like someething which should be possible and useful. is this construction related to non-wellfounded sets?
I'll have to trust you on the accessibility part, but how does this avoid running into the same size issues as the usual ?
naso evangelou-oost said:
The technical details of this are way beyond me, but instinctively the idea that things can be parts of themselves is pretty natural: fractals are everywhere in nature.
Isn't that more about containing isomorphic copies of itself? That's of course completely unproblematic, but as far as I understand that's not what's happening here.
The relationship between the accessibility rank of a monad and the accessibility rank of the category of algebras is a little bit fiddly. You might want to look at theorem 2.18 in my model categories paper: http://www.tac.mta.ca/tac/volumes/31/2/31-02abs.html
As you have observed, the key to this phenomenon is Gabriel–Ulmer duality. I don't think there's anything surprising or paradoxical if you stick to the small categories picture. But I do object somewhat to the notion that the correct notion of morphism of locally -presentable categories is a left adjoint functor that preserves -presentable objects – this seems unnatural, though it does amount to taking the opposite of the category where the morphisms are -accessible right adjoint functors...
Not every condition of the form ``let be the category of all ...'' determines a well-defined category. In this case, the condition:
Tim Campion said:
Let be a regular cardinal. Let denote the -category of locally -presentable -categories...
needs a qualifier - like ``small'' - else you run into the problem that you have observed. The elaborate structure in this example is a red herring though, the category of categories with finite products has finite products, etc. :smile:
Steve Awodey said:
Not every condition of the form ``let be the category of all ...'' determines a well-defined category. In this case, the condition:
Tim Campion said:Let be a regular cardinal. Let denote the -category of locally -presentable -categories...
needs a qualifier - like ``small'' - else you run into the problem that you have observed. The elaborate structure in this example is a red herring though, the category of categories with finite products has finite products, etc. :smile:
I'm not sure I understand the point about size. The category of small categories with finite products _does_ have finite products, but it is not a small category, so it is not an object of itself. The category of locally small categories with finite products has finite products, but it is not locally small, so it is not an object of itself.
But in the case I'm discussing, the "smallness" condition is precisely the local -presentability condition. So the striking thing is that is a category of _all_ categories-with-smallness-condition, but itself satisfies the _same_ smallness condition as its objects!
So it seems to me that from the perspective of smallness, there is something genuinely surprising going on here which doesn't show up in things like "categories with finite products".
Zhen Lin Low said:
As you have observed, the key to this phenomenon is Gabriel–Ulmer duality. I don't think there's anything surprising or paradoxical if you stick to the small categories picture. But I do object somewhat to the notion that the correct notion of morphism of locally -presentable categories is a left adjoint functor that preserves -presentable objects – this seems unnatural, though it does amount to taking the opposite of the category where the morphisms are -accessible right adjoint functors...
In the past I have in some sense agreed with this -- I have generally assumed that is never really the category I want to understand or think about, but only something which is introduced as a technical tool to understand more "intrinsically interesting" categories like (the category of all locally presentable categories and all left adjoint functors).
Of course, the notion of the "right" morphisms to consider is only truly justified by what you can do with them.
But maybe I'll push back from a purely conceptual perspective -- I think there's a case to be made that when considering the collection of locally -presentable categories as such, it _is_ very natural to restrict the morphisms to be left adjoints which preserve -compact objects. I can think of several reasons (perhaps not wholly independent from one another):
At a very basic level, when restricting the objects of to be the objects of , it seems very natural to also restrict the morphisms. One indication of this is that the full subcategory of on the objects of has an essentially small set of objects, but is not even locally essentially small! When was the last time you thought about a non-locally-small category with a small set of objects?
As you say, this condition is equivalent to requiring the right adjoints to be -accessible. So to the extent that it's natural to consider the category of -accessible categories and -accessible functors, it's also natural to consider . For instance, the morphisms of are precisely the morphisms in the ambient 2-category which have right adjoints in .
is a very nice category -- as I've mentioned, it's complete and cocomplete, monadic over , even locally -presentable. The full subcategory of on the same objects has none of these properties.
Tobias Schmude said:
I'll have to trust you on the accessibility part, but how does this avoid running into the same size issues as the usual ?
That's what I'd like to know!
Tim Campion said:
I think it's correct, though. Assuming this, the next thing to ponder is whether there is a category-theoretic sense in which " is an object of itself". Something more "intrinsic" than saying " lies in the image of the forgetful functor ".
Maybe one could say that is a model of some type theory satisfying type-in-type.
The analogue of Russell's paradox would only arise if the "subcategory of -presentable categories which do not contain themselves" is also -presentable, and I would bet that it isn't.
I think the problem disappears if you specify precisely from which universe the objects of are drawn. itself should live in a higher universe, so it can't be an element of itself, although it is equivalent, as a category, to an object of itself.
Leopold Schlicht said:
I think the problem disappears if you specify precisely from which universe the objects of are drawn. itself should live in a higher universe, so it can't be an element of itself, although it is equivalent, as a category, to an object of itself.
I suppose you could do that if you view this as a problem. But to me, what's interesting is that it's something which looks like it should be a problem but... apparently it is not a problem! (i.e. there is no contradiction here)
Leopold Schlicht Oh, I think I see what you mean now -- you're saying that this story actually would be a problem if the object - set of were literally an element of (a tuple packaging it with its morphisms and composition to form a category, which is an element of) the object set of . You're pointing out that this is not literally the case... which is an important point!
The precise reason why will be sensitive to how things are formalized. But if we work in ZFC with one universe , and if we define the object-set of to comprise certain categories whose object sets are subsets of , and if we encode categories as certain 4-tuples of sets (objects, morphisms, composition, identities), and if we just assume that 4-tuples are part of our basic language rather than worrying about how Kuratowski ordered pairs work, then the elements of are certain elements of $$V_{\lambda+1}$, and is an element of . And some (in fact most) of its elements are too big to live in , so they are properly in , so is properly in . So it's not an element of itself.
We might alternatively think about whether is an element of , where the objects of are certain elements of . The answer is no for size reasons -- is essentially small, but not literally small, so it doesn't live in .
But what if we impose some skeletality condition? For instance, define to comprise those objects of whose von Neumann rank is minimal in their equivalence class. Then... well, is again large even though it's essentially small, so again it is trivially not an element of itself.
It should be that , although an object of itself, is not a -presentable object of itself. So the left adjoint functor , which carries to , is not a morphism in . I think this fact ought to be relevant to various paradox-evasion maneuvers.
I would describe the situation as: there is a large category and a functor (where is the very-large category of large categories) that contains in its essential image. As has been pointed out, the objects of are not actually themselves large categories, they are "presentations" of large categories by the functor . So there's nothing paradoxical about the fact that itself might be presented by one of the presentations that it contains.
Here's a simpler version of the same phenomenon, requiring nothing so fancy or higher-categorical: let and let . Then , so in this sense also "contains itself" if we "identify" a set with the corresponding power .
More generally, any category with a terminal object "contains itself" via the functor defined by , since .
Mike Shulman said:
As has been pointed out, the objects of are not actually themselves large categories, they are "presentations" of large categories by the functor . So there's nothing paradoxical about the fact that itself might be presented by one of the presentations that it contains.
I feel this is dismissing the curiousness of the set-up. If we had a general way to build Ind-functors on -presentable categories (so to view the objects of a generic such category as themselves being -presentable categories) we could nail down Russell's paradox and get a genuinely interesting result for free. Your last example might provide some insight into what that might look like: the category of small categories without a terminal object cannot be a small category, or else we could ask whether the slice pseudo-functor contains that category in its essential image. (This is easy to argue by other means, by constructing a class of them, but hopefully it illustrates the point.)
From a categorical logic perspective, a locally finitely presentable category is precisely the category of models of an essentially algebraic theory. That the category of locally finitely presentable categories is locally finitely presentable means that locally finitely presentable categories are essentially algebraic, which is really just an observation about the expressivity of essentially algebraic theories, and in that sense should be expected for any sufficiently expressive notion of logic, since with enough expressivity, you ought to be able to describe any kind of structure: in particular, the one that axiomatises the structure of categories of models of that kind of theory.
Yes, I am dismissing the curiousness of the setup, becuase I don't feel it is curious. I think those who think it is curious are being misled by the apparent "canonicalness" of the equivalence , when in fact nothing very strange is going on.
A less fancy example of that phenomenon is that there's a multisorted Lawvere theory whose algebras are multisorted Lawvere theories.
We need "multisorted" here because there's not an ordinary ("1-sorted") Lawvere theory for ordinary Lawvere theories. But there's a multisorted Lawvere theory for ordinary Lawvere theories. So if we're looking for a kind of fixed point - a kind of theory that can describe itself - that's powerful enough to describe Lawvere theories, it's natural to go up to multisorted Lawvere theories.
An even more stripped-down example is that there's a colored operad for colored operads.
John Baez said:
A less fancy example of that phenomenon is that there's a multisorted Lawvere theory whose algebras are multisorted Lawvere theories.
This isn't quite an example (though the principle is similar). For every set , there is a set and an -sorted algebraic theory whose algebras are -sorted algebraic theories. However, the category of all multisorted algebraic theories (where is not fixed) is not the category of models for an algebraic theory (multisorted or otherwise), nor is the category of locally strongly finitely presentable categories. So the situation is not quite the same as the essentially algebraic setting, where we really do recover the entire category, without fixing the sorts.
Okay, it's different. Yes, in my both my examples there's an -sorted theory whose algebras are -sorted theories, where is obtained by applying some functor to the set .
Nathanael Arkor said:
From a categorical logic perspective, a locally finitely presentable category is precisely the category of models of an essentially algebraic theory. That the category of locally finitely presentable categories is locally finitely presentable means that locally finitely presentable categories are essentially algebraic, which is really just an observation about the expressivity of essentially algebraic theories, and in that sense should be expected for any sufficiently expressive notion of logic, since with enough expressivity, you ought to be able to describe any kind of structure: in particular, the one that axiomatises the structure of categories of models of that kind of theory.
Isn't this exactly the kind of loop that Gödel exploited to get his incompleteness theorem? You and @Mike Shulman might have enough intuition about the area that this seems unsurprising, but that doesn't preclude the possibility of exploiting this perspective.
I've wondered about that before myself. It's a neat fact that "essentially algebraic theories are essentially algebraic" (for example, a category with chosen finite limits can be axiomatized as a generally algebraic theory or a essentially algebraic theory). But does that have any proof-theoretical implications?
Taichi Uemura said:
Tim Campion said:
I think it's correct, though. Assuming this, the next thing to ponder is whether there is a category-theoretic sense in which " is an object of itself". Something more "intrinsic" than saying " lies in the image of the forgetful functor ".
Maybe one could say that is a model of some type theory satisfying type-in-type.
I like this idea!
If you could interpret type theory in , so that an object of is a type in your type theory, and if you moreover interpret a term of type to mean an object of , then it seems plausible that you could arrange to have the judgment be valid in your type theory, where is the type corresponding to itself. So I wonder:
It will probably have to be some kind of linear type theory.
Same as (1), but additionally requiring that a term correspond to an object.
Can such a type theory be set up with being valid?
In general, what kinds of limitations on a type theory validating are there?
Tim Campion said:
- Can such a type theory be set up with being valid?
I don't know about , but here's a different example of such a type theory: Consider MLTT without universes and with the induction scheme for (the only recursive inductive type) restricted to first-order motives. It's known that all functions in this system are primitive recursive. Now add a universe , where is interpreted as the natural numbers, and , the -th recursively enumerable set. This universe is closed under all the type formers of the theory except -types, indeed with codes given by primitive recursive operations, and we obviously have a code for in as well, e.g., by picking the same code as for .
- In general, what kinds of limitations on a type theory validating are there?
From Girard's paradox, you can't have this if is closed under -types and you have contraction, i.e., you allow non-linear uses of variables. So there are two options: Disallow -types as above, or move to a linear or affine logic.
Maybe goes without saying, but you could retain dependent functions and non-linear logic and accept that all types are inhabited (Girard's paradox). Which is a certain kind of inconsistency ("logical inconsistency"), but does not imply that all terms collapse (are judgementally equal, "equational inconsistency"). Right?
I think that's right, and that's a good point.
I think you can say even a bit more than that. It's true that all types will be inhabited, but not all types will be inhabited by a normal form. So you can recover a sort of logical consistency if you insist that only normal (or normalizing) terms count as proofs. Now the price you pay is giving up cut / modus ponens: you can have normal terms and for which doesn't normalize. (In fact I think you get a sort of "paraconsistent logic", with "dialetheias" such that and are both provable, but can't be combined into a normal proof of .)
One of these days I want to explore this idea more deeply. I think there are some philosophers who've thought about a similar approach to sequent calculus under the heading of "proof-theoretic semantics", but I don't think I've seen it considered in type theory (has anyone?).
Mike Shulman said:
One of these days I want to explore this idea more deeply. I think there are some philosophers who've thought about a similar approach to sequent calculus under the heading of "proof-theoretic semantics", but I don't think I've seen it considered in type theory (has anyone?).
Thierry once told me that he had looked into this as a way of using the original system with type:type. He said it was Per's idea. So, yes.
Cool! Thanks, I'll ask him about it sometime.
Ulrik Buchholtz said:
Tim Campion said:
- Can such a type theory be set up with being valid?
I don't know about , but here's a different example of such a type theory: Consider MLTT without universes and with the induction scheme for (the only recursive inductive type) restricted to first-order motives. It's known that all functions in this system are primitive recursive. Now add a universe , where is interpreted as the natural numbers, and , the -th recursively enumerable set. This universe is closed under all the type formers of the theory except -types, indeed with codes given by primitive recursive operations, and we obviously have a code for in as well, e.g., by picking the same code as for .
- In general, what kinds of limitations on a type theory validating are there?
From Girard's paradox, you can't have this if is closed under -types and you have contraction, i.e., you allow non-linear uses of variables. So there are two options: Disallow -types as above, or move to a linear or affine logic.
Ah, that's promising! I would expect any type theory modeled by to be "linear" in nature anyway. So maybe Girard's paradox can be avoided.