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.
This thread is for a continuation of this discussion on MO chat which was a continuation of the comments on this answer. Because Zulip is a better platform for conversations than either MO comments or MO chat.
Oh cool!
Something I've been meaning to mention in this area is that Charles Rezk has a draft up on his website investigating oo-categorical limit doctrines
https://faculty.math.illinois.edu/~rezk/accessible-cat-thoughts.pdf
The most exciting thing to me is that Charles discovered that oo-categorically, the doctrine of pullbacks is _sound_ (in the evident sense mimicking ABLR in oo-categories)
Notoriously, this doctrine is not sound 1-categorically.
That's neat that there's another way in which limits/colimits are better -categorically. I don't work enough with sound doctrines that it sounds exciting to me, though. Does it have useful applications?
I'm not sure! One thing it tells you is that Cat_oo (which is sketchable by a pullback sketch of course) has certain limit/colimit commmutativity properties.
PB-filteredness is equivalent, Charles shows, to being a space-indexed colimit of filtered categories
So colimits in Cat_oo indexed by such categories commute with pullbacks.
I think Charles gives some interesting unexpected examples like mapping tori
But I guess mostly I just find it suggestive -- in 1-categories, it seems to me the main limitation of sound doctrines is that there just don't seem to be that many of them, and you can really generally get by treating them on an ad hoc individual basis.
Maybe the true potential of the theory will be more fully realized in oo-categories.
-categories
@Tim Campion:
I've had occasion to wonder recently if maybe the whole apparatus of limit doctrines could be redone with distributivity rather than commutation of limits and colimits.
To my understanding, the paper Accessibility and presentability in 2-categories by @Ivan Di Liberti and @fosco is very much inspired by this perspective.
@Nathanael Arkor Oh that's really cool! Could you explain more? I don't see the word "distribut-" appearing in the paper.
Perhaps the version on my computer is old though
The notion of "envelope" (Definition 3.1) can be rephrased in terms of a distributive law of KZ doctrines (for S over D), so that P is the composite SD.
@Dmitri Pavlov Thanks for the reference. Taking a look, I _think_ the idea generalizes as follows: any KZ-doctrine distributes over the doctrine Lim
And a free algebra for the KZ doctrine is automatically an algebra for the composite doctrine
I think it just boils down to the fact that the structure map for the algebra fits into an appropriate string of adjoints (by virtue of KZ ness), and in particular preserves limits.
Tim Campion said:
Dmitri Pavlov Thanks for the reference. Taking a look, I _think_ the idea generalizes as follows: any KZ-doctrine distributes over the doctrine Lim
This is certainly true for for sound .
(By Corollary 6.4 of A classification of accessible categories.)
Right... my claim does seem fishy, given that ABLR have to do _some_ work to prove there's a distributive law.
I suppose what I should really claim is that _if_ there's a distributive law, then the free algebras for the KZ monad are automatically algebras for the composite monad
In the particular case of composing the one's KZ doctrine with the doctrine Lim
Surely that can't be true unless your algebra is free on a Lim-algebra?
(in which case it should follow formally from the existence of a distributive law, right?)
I agree that case follows formally from the existence of a distributive law
Okay -- there's an additional requirement.
Let T be a KZ doctrine and suppose that T distributes over Lim. Let C be a category, and suppose that T(C) in fact has limits. Then T(C) is an algebra for
Proof: the only thing to check is that the structure map preserves limits. But by KZness it has a left adjoint
The left adjoint is where is the unit for the KZ doctrine
I would have to look up the definitions to verify that that particular adjunction is guaranteed to exist by the KZ property, but at least it seems to be the case when (and this adjunction is the core of the Johnstone-Joyal proof).
So I feel pretty comfortable asserting that this is the correct generalization.
My memory of lax-idempotence is that is right adjoint to the structure map. I don't remember anything about being left adjoint to it.
I think they both hold
You only get one adjunction for a generic T-algebra
But we have a free T-algebra
So both adjunctions potentially make sense
And I believe they both hold
Ah, that could be.
I think Marmolejo and Wood talk about this adjoint triple
Yes, it's on the first page of Kan extensions and lax idempotent pseudomonads.
Let's see. Does this work in great generality?
Let be any class of small categories
To be used for indexing colimits
The free -cocompletion can always be computed as the closure in the presheaf category under -indexed colimits.
Call this functor
Suppose that is naturally reflective in for any small .
Where is the presheaf category.
Then for every small , is complete.
And by the previous argment, since is lax-idempotent, the structure map has a left adjoint and so is continuous.
So in order to get a distributive law with , and have that is always an algebra for the composite monad, well, we just need the distributive law.
(I am still perpetually confused about which monad is said to distribute over which other one)
The thing to check is that preserves completeness of categories and continuity of functors between complete categories.
(It's good to remember that multiplication distributes over addition, so timesy things like the monad for cartesian categories tend to distribute over plussy things like the monad for categories with some class of colimits.)
(But you probably know that.)
@John Baez Ah, thanks. Yeah, that makes sense.
I think the part which confuses me is that to verify the distributive law of over so that is a monad, you need to consider , which feels backwards
Of course, you just consider in order to get a functor from it to , but it still feels strange.
Er -- I guess I'm still a bit turned around :)
What I want to say is that will preserve right adjoints and that that will be enough to preserve continuity. Of course that doesn't quite work because we end up leaving adjoint-functor-theorem land.
I guess this is how I remember this stuff:
In a ring you can rewrite any product of sums as a sum of products (but not vice versa), so you define the monad for rings using a distributive law PS SP, where P is for products (the monad for monoids) and S is for sums (the monad for abelian groups).
But then, yeah, the monad for rings is SP, with multiplication SPSP SSPP SP.
Thanks. I think I got that well enough to at least rewrite my confusion in an accurate way!
I managed not to be too confused by the fact that my corresponds to your :)
I think
However, is co-lax-idempotent.
So is complete iff there is a right adjoint to the unit
So completeness is witnessed by an adjunction. Unfortunately maybe that doesn't help.
Tim Campion said:
I managed not to be too confused by the fact that my corresponds to your :)
Darn, I was trying to confuse you.
It really feels like all that needs to be juggled is size. It doesn't feel like soundness should actually be necessary for anything here.
Let be the doctrine for -small limits. If is small, then is small.
Let be the dotrine for all small limits.
In general, the unit induces
If is small, then is small. By hypothesis, this implies that is complete.
and in particular -complete.
By the universal property of , we get an induced functor .
which hopefully gives us a distributive law.
Ah, but the hypothesis was a bit problematic.
Generally we expect that will only be complete, or even -complete, if is appropriately cocomplete.
And that's where we might actually need some theory of limit doctrines to understand things.
Perhaps an easier approach would be: prove once and for all that there is a distributive law .
This is done in Day and Lack's "Limits of small functors"
in the enriched setting. So it seems to be reasonably formal.
Then all these other distributive laws are "sub-distributive laws" of that one.
I think it follows that there is a distributive law [which is a sub-distributive law of ] if is complete for every .
And showing this does indeed seem to be the substantive part of any proof in the literature that there is such a distributive law for a particular .
Tim Campion said:
I think it follows that there is a distributive law [which is a sub-distributive law of ] if is complete for every .
I think this is Theorem 5.4 of Karazeris–Velebil's Representability relative to a doctrine.
@Nathanael Arkor Thanks, that is very nice! And they are treating sub-monads of at the same time!
I bet one can get away with this holding for small.
Just because these monads should commute with colimits of -indexed chains.
Here's a cute criterion. Suppose that the canonical functor is an equivalence (or even just has a right adjoint) for every and every (where is a collection of small categories used for indexing limits). Then if is -complete, the diagonal functor has a right adjoint. By 2-functoriality, has a right adjoint. Composing, we get that has a right adjoint. Thus, under this hypothesis, we get that preserves -completeness.
So -- if preserves exponentials in the above sense, then distributes over for every class of limits .
I think this at least recovers the case where is the filtered categories.
Actually, I think the weaker form of the criterion -- just saying that has a right adjoint -- holds... always?
That sounds a bit strong.
Maybe not always, but maybe if one simply assumes that may be "computed in one step"" -- i.e. assume that the closure of the representables under -colimits comprises precisely the -colimits of representables.
That is... just assume that is saturated in the sense of Albert and Kelly's "closed".
No, there is an additional condition.
Tim Campion said:
But I guess mostly I just find it suggestive -- in 1-categories, it seems to me the main limitation of sound doctrines is that there just don't seem to be that many of them, and you can really generally get by treating them on an ad hoc individual basis.
This seems unlikely - there are lots of classes of commuting limits and colimits, for example, it's just that few of them are generic enough to have been studied in any depth.
A few tangents to this conversation:
First is the notion of codistributivity; the argument for constructing the canonical morphism dualizes just fine. It's interesting to see just how far codistributivity can fail for simple cases!
Second, related to my previous reply, I have partially translated from French (and, in places, corrected) the work of F. Foltz giving precise but involved criteria for commutativity of limits and colimits in Set. An interesting one, quoted as Lemma 2.2 in the paper linked above, is that in order for a colimit diagram to commute with any non-trivial connected limits at all, the diagram has to have cones under all spans. I wonder if this result has an analogue for distributivity.
@Morgan Rogers (he/him) This is fantastic! I would be very interested to read what you have on Foltz.
I once made an MO post where my wording suggested I didn't fully trust Foltz's results.
After years, I changed the wording because I thought it was unfair to Foltz.
But I did have this nagging sense that because of the involved combinatorial nature of the results, it seemed not unreasonable to suppose there might be errors.
@Morgan Rogers (he/him) Your point that there are many classes of commuting limits and colimits in Set is good -- but on the other hand, I know of only a handful of them which are sound.
And I don't know anything about getting interesting results about limit doctrines without soundness.
Tim Campion said:
I once made an MO post where my wording suggested I didn't fully trust Foltz's results.
To some extent you were right not to trust them, a lot of the diagrams have morphisms incorrectly labelled or pointing in the wrong direction due to them being hastily added by hand. There is also a sticking point that I haven't yet resolved.
Tim Campion said:
Morgan Rogers (he/him) Your point that there are many classes of commuting limits and colimits in Set is good -- but on the other hand, I know of only a handful of them which are sound.
Would you mind elaborating? The nLab definition is not very enlightening.
Soundness was introduced by Adamek, Borceux, Lack and Rosicky.
Tim Campion said:
Morgan Rogers (he/him) This is fantastic! I would be very interested to read what you have on Foltz.
I wasn't planning to finish drafting it any time soon (I have a thesis to write..!) but if you're willing to wait until, say, December, I can share it!
I once wrote a blog post about their paper https://golem.ph.utexas.edu/category/2014/05/classifying_by_generalizing_th.html
Morgan Rogers (he/him) said:
Tim Campion said:
Morgan Rogers (he/him) This is fantastic! I would be very interested to read what you have on Foltz.
I wasn't planning to finish drafting it any time soon (I have a thesis to write..!) but if you're willing to wait until, say, December, I can share it!
Oh sure -- no rush! I am not thinking about this stuff actively.
One way of looking at it is the following: if you've got some class of limits D (a "limit doctrine")
Say that a category I is "D-filtered" if I-colimits commute with D-limits in Set.
In the case where D = finite categories for example, there's this rich theory of finitely accessible categories
And free cocompletion under filtered colimits.
There are several related constructions one can do for general D which end up being equivalent in this case, and the equivalence is kind of necessary to get accessiblity theory to tick.
Soundness is a condition which guarantees that one has these equivalences.
I'm alluding basically to the fact that there are several different ways to characterize Ind(C)
for a category C
In particular, one general result says that if D is sound, then the "free completion functor" Lim distributes over the "free D-filtered cocompletion functor" D-Ind.
I don't know if there are examples where this holds when D is not sound.
Oh hey I've encountered this paper before! From those examples, it seems like the problem is one of saturation; their example of the doctrine of pullbacks and terminal objects not being sound in particular. I wonder if soundness could be reduced to "every diagram in the saturation of admits an initial functor from a diagram in " or some condition to that effect.
Where by "saturation" I mean the maximal class of limits commuting with -filtered colimits
Soundness and saturation are related in some weird way I don't fully understand.
There are examples of doctrines which are saturated but not sound. There's an example somewhere…
The doctrine of L-finite simply-connected limits (the saturation of Pullbacks) is saturated but not sound.
(However the oo-categorical analog is sound according to Charles Rezk!)
For example, Dostal and Velebil make saturation a blanket assumption on their doctrines here https://arxiv.org/abs/1405.3090
But soundness is still an important question in their setting.
ABLR also give the weird example of the doctrine of pullbacks + terminal objects, which is not sound.
even though its saturation is sound
Back in undergrad when I was doing my first CT research project (incidentally, also when I started translating Foltz :joy:) I started investigating the relationship between this sort of saturation and the sort that @Tim Campion just referenced, but didn't have enough background to see deeply into it.
Note also that finite limits is not a saturated doctrine!
Morgan Rogers (he/him) said:
Back in undergrad when I was doing my first CT research project (incidentally, also when I started translating Foltz :joy:) I started investigating the relationship between this sort of saturation and the sort that Tim Campion just referenced, but didn't have enough background to see deeply into it.
Oh sorry -- are we talking about different sorts of "saturation"?
One is "if has limits in , what is the maximal class of limits it automatically has", whose answer for pullbacks is what you said;
The other is "which limits commute with the colimits commuting with the limits in "
Tim Campion said:
Note also that finite limits is not a saturated doctrine!
Oh, I didn't realise this. What is the saturation?
Nathanael Arkor said:
Tim Campion said:
Note also that finite limits is not a saturated doctrine!
Oh, I didn't realise this. What is the saturation?
The L-finite limits!
Tim Campion said:
The doctrine of L-finite simply-connected limits (the saturation of Pullbacks) is saturated but not sound.
It's not clear to me that this is the saturation of pullbacks in the latter sense
Oh I see.
Tim Campion said:
Nathanael Arkor said:
Tim Campion said:
Note also that finite limits is not a saturated doctrine!
Oh, I didn't realise this. What is the saturation?
The L-finite limits!
Is there a nice example of an L-finite limit that is not finite?
Any category equivalent to a finite one, or having a finite initial subcategory
One characterization says that the terminal presheaf should be finitely-presentable. https://ncatlab.org/nlab/show/L-finite+category
A dumb example would be any category with a terminal object
Morgan Rogers (he/him) said:
Any category equivalent to a finite one, or having a finite initial subcategory
Oh, I see, this is very intuitive.
I think it even suffices to have a finitely-generated initial subcategory?
Oh sure -- so the walking endomorphism would be a natural example!
or BN if you roll that way
Morgan Rogers (he/him) said:
One is "if has limits in , what is the maximal class of limits it automatically has", whose answer for pullbacks is what you said;
The other is "which limits commute with the colimits commuting with the limits in "
Yeah, my convention has been to use "saturated" for the first sense (which Albert and Kelly call "closed") and I think I'm realizing I don't have a word for the second sense
I keep saying mouthfuls like "closed in the Galois connection given by commutativity of limits and colimits in Set"
I think I picked up this convention from a later set of notes by Kelly and Schmitt http://www.tac.mta.ca/tac/volumes/14/17/14-17abs.html
Morgan Rogers (he/him) said:
One is "if has limits in , what is the maximal class of limits it automatically has", whose answer for pullbacks is what you said;
The other is "which limits commute with the colimits commuting with the limits in "
It seems intuitive that the latter should contain the former, since the former should somehow be the "maximal class of limits constructible from ", but that's not so clear cut because of how these things are typically computed.
Anyway, I hope to gain more insight into this eventually, probably using toposes, and the distributivity direction seems promising.
Morgan Rogers (he/him) said:
Tim Campion said:
The doctrine of L-finite simply-connected limits (the saturation of Pullbacks) is saturated but not sound.
It's not clear to me that this is the saturation of pullbacks in the latter sense
Just noticed this comment. It's a theorem of Pare, in his paper "simply-connected limits". I believe this paper is also where L-finiteness was first introduced, or at least first studied systematically.
Er -- I see. In the case of finite limits, we have that the L-finite limits are the saturation in both senses.
In the case of pullbacks, I believe Pare shows that the L-finite simply-connected limits are the saturation in the sense of Albert and Kelly's "closed" -- i.e. they are the limits you have if you have pullbacks.
But it is conceivable that they are not precisely the limits which commute with those colimits which commute with pullbacks in Set.
There could in principle be more such limits.
Certainly any such limit-indexing diagram must be L-finite, since its limits commute with filtered colimits in Set
It's quite surprising to me that something as fundemental as the interaction between limits and colimits hasn't yet been completely understood.
Nathanael Arkor said:
It's quite surprising to me that something as fundemental as the interaction between limits and colimits hasn't yet been completely understood.
I think it's a fundamental issue. There are a lot of places in category theory where one can construct a canonical map, but the question of whether the map is an isomorphism is not generally something which can be answered by category theory alone.
Like, questions of the form "is the following map an isomorphism" are a natural entrypoint for domain-specific facts to enter.
I also suspect personally that in the present case, the 1-categorical questions are probably best understood as shadows of oo-categorical questions.
This sense is based on the fact that colimits in Set involve pi_0 truncations.
Which I think very often become better-behaved when one moves to the oo-category of spaces.
where the pi_0 truncation is replaced by taking a classifying space.
So for a start, I guess I would suspect that maybe Foltz's paper on commutativity of limits and colimits might be actually easier to re-do in an oo-categorical setting.
Would the 1-categorical results be derivable from the -categorical results?
I'm thinking probably not directly.
But I would suspect that the oo-categorical story, if it were understood, might shed some light indirectly on the 1-categorical story. Maybe suggest a framework to understand it more conceptually rather then just having at it with a bunch of subdivision categories like Foltz.
Tim Campion said:
So for a start, I guess I would suspect that maybe Foltz's paper on commutativity of limits and colimits might be actually easier to re-do in an oo-categorical setting.
Teach me oo-category theory and I'll juggle some limits and colimits for you.
There is precedent for 1-categorical statements becoming easier when analogized oo-categorically. I think the classic one is descent for oo-topoi.
In an oo-topos, , the functor straight-up preserves limits.
Whereas if is a 1-topos, the functor only preserves van Kampen limits. I don't believe this improves if you treat everything as (2,1)-category or something like that.
I also have a toy example I'm starting to throw around in these kinds of conversations: the (large, locally large, but locally locally small) -category of spaces and spans between them is complete and cocomplete.
Whereas the (2,1)-category of sets and spans between them is not.
(From the former fact, you can also deduce that the (2,1)-category of sets and spans between them does at least have split idempotents; I don't know a more direct proof!)
Morgan Rogers (he/him) said:
Tim Campion said:
Morgan Rogers (he/him) This is fantastic! I would be very interested to read what you have on Foltz.
I wasn't planning to finish drafting it any time soon (I have a thesis to write..!) but if you're willing to wait until, say, December, I can share it!
@Morgan Rogers (he/him): did you find time to continue your translation/correction of Foltz? I'd be very interested to read it.
Ah, no, unfortunately it has yet to reach the top of the priority queue. Depending on how little I procrastinate wrt job applications, I may have time to work on it by the end of the month (knowing someone is interested is certainly a motivator, but it's probably healthiest if I don't make a hard commitment on that for the time being).
Completely understandable :) (For what it's worth, I know a couple of other people who are also interested.)