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.
(In the context of my conjectures on generalized equipments)
I've pretty much worked out what the generalized -construction in looks like. The result is basically, objects of are strict -cats internal to , arrows are strict -functors internal to , -dimensional pro-globes are "modules" in a fairly intuitive way and -dimensional cylinders are their strict maps. I'm also fairly convinced that the construction adds the right kind of "units" to make the "display" construction work--at any rate as convinced as I am for the virtual double category case! (I understand how to factor squares through the opcartesian morphism but not why the factorization is unique.)
There are really some interesting subtleties in the definition of "barrel" for higher shapes like squares. For barrels to be algebras closed under the operations, you need to allow, for example, a unary square whose source lives over a point, to live over a nullary square. So far I've been treating squares of different arity as basically independent of each other as they aren't, for example, facets or anything, but it's not like anything goes (you can't have arrows and proarrows living over each other in a nontrivial way) so this indicates there needs to be some relation between them derived somehow from the operations they represent, or front-loaded in the case of e.g. strict -cats. It seems like this is the same data that is needed to specify what "units" are probably. I still haven't found a better way to express that information than just drawing all the terminal barrels and being like "it's a barrel if it maps into that and preserves the facet inclusions", nor a formal way to induce the terminal barrels for from the barrels and operations for .
It is, however, pretty intuitive and I feel like I understand the "monoids and modules" construction way better than before even in the plain virtual equipment setting.
The rules for what can "live over" what in a barrel are starting to make some sense. It's basically similar to a kind of higher-dimensional graph minors, where if you contract away facets from in the mapping/minorization and get (or itself in some cases) then can live over . Need to see how this looks in the and 3-equipment cases where the boundaries can get more "interesting".
It seems to work fine in all the cases, as long as the barrel is over something "locally simply connected"--you don't have the same item occurring as two different facets of the same shape. Then a barreling of an algebra over a graph is a map from the cells of to the cells of so that:
Remaining: maybe something more robust than set mapping to handle barrels over interesting graphs; definitely some way to carry and synthesize the "intuitive sense of kind".
It might be possible to supply both desiderata at once by having some sort of category structure (on shapes? graphs?) that specifies when one thing is a 'contraction' of another. Might be similar to degeneracies. Maybe we even want them around when making "unitary" algebras, at least in some "weak" way, to bring in the units and their opcartesian morphisms.
Yeah, okay, with a nice system of degeneracies on shapes barrels get really simple: a barreling of over is a presheaf map from to the closure of under degeneracies. This is still a little simpler than specifying all the terminal barrels, though a bit more complex than "same kind". I have more confidence in it though ...
Where do the degeneracies come from? For virtual double categories, the degeneracies among just squares look like the degeneracies of the simplex category, 1, 2, 3 as you go up one-by-one in arity, as you skip many; however there are extra generators: from a point you get a degenerate looping arrow or proarrow, from an arrow a degenerate nullary square with the arrow on both sides and a degenerate target, from a proarrow a degenerate unary square the shape of an identity square for it.
For virtually-thickened strict -cats, you get, in the cylinders, a copy of the sensible degeneracies for globular pasting diagrams, plus from any globe you get its "identity cylinder" shape, and its "reflexive globe" shape, plus you get degeneracies (of cylinders again) that correspond to using reflexivity on the target. I can see how the former matches up as special cases of this when you limit to 0- and 1-globes as shapes.
For the virtual thickening of the trinary-operation planar operad ("odd multicategories"), the shapes are objects plus corollas with an odd number of in-leaves. For degeneracies it seems like you get: the identity shape from objects, tripling an in-leaf, plus three ways of tripling the output and bending two copies back. This is a nice example since the original operad has no (room for) nontrivial degeneracies among shapes so these must all arise from operations, compositions and/or dependencies somehow.
Speculation on how to get degeneracies somewhat systematically: an -barrel must simply be an algebra, so must be initial/terminal in the category of degeneracies. This gives you enough information to build the terminal -barrel. Then, building up the degeneracies and terminal barrels for each shape inductively, you must have enough degeneracies to include all the compositions of the seed shape with stuff already in the boundary of its terminal barrel.
One thing I can't see that approach getting you, though, is the 2-cells in the terminal barrel for arrows, in virtual double categories. It would seem to be "totally fair" to have no 2-cells at all in there, as nothing guarantees such cells to exist in a virtual double category. "Arrow-barrel" would just be a much more restrictive concept, but it wouldn't be impossible to produce examples. Maybe this has to do somehow with inheriting degeneracies from the original operad-with-shapes. The operad with shapes for categories does have an existing degeneracy from object to looping arrow (inherited as proarrow) and that degeneracy is directly useful for inheritance since proarrows no longer have composition; but I don't see a connection between this and the generator from arrows to squares.
Oh, wait: the generator from arrows to squares is a picture of the generator from objects to (pro)arrows. That must (?) be significant: when you inherit a generator, you must get some kind of pictures of it too. But what is the process to generate them from the thing they're picturing? (Another example of this is the reflexivize-targets-of-cylinders generator, coming from the inherited reflexivize-(pro)globes generator.)
I'm constructing the fibrant triple category of fibrant double categories (the 3-equipment of equipments), if you ever want to talk.
Certainly.
Continuing from before, probably is the best example to look at since it has so many more occurrences of the pattern than VDCs. In we can always view an -dimensional pasting diagram as an -dimensional pasting diagram that is "nullary", and pasting that way is equivalent to pasting the -dimensional way and then taking the identity on the result. I guess what I'm getting from this is that when two operations have the same input and their result is related by a degeneracy, then the new shapes from those operations are also related by a degeneracy?
Or maybe that's only a condition for it; maybe "degeneracies of operations" need to be tracked as such and nullary compositions are born with them.
Not sure if this is the best way to express the compatibility of degeneracies with composition, but the closure under degeneracies of a representable -graph should have a unique -algebra structure.
Christian Williams said:
I'm constructing the fibrant triple category of fibrant double categories (the 3-equipment of equipments), if you ever want to talk.
It's probably better to call it a '2-equipment', since it's one step up the categorical ladder from equipments, not 2.
To me the default equipment is a 2-equipment, a set is a 0-equipment, and a category is a 1-equipment ... do we really want a ladder where a set is a (-1)-equipment? Where a category is a 0-equipment?
I was missing something obvious about the degeneracies of the arrow and so on; you can paste a nullary square in the tip of the distinguished arrow to the distinguished arrow to get the nullary square over the distinguished arrow that starts it all out. This seems to work for the other cases as well, so there seems to be no need after all to track degeneracies on operations or distinguish "nullary" operations from operations in general just to get barrels/degeneracies right.
For me the word "equipment" is completely unhelpful, and I think it should be replaced asap, because the concept is too important: in this structure the language of category theory is unified.
"Fibrant double category" tells you exactly what matters: we use both functions and relations, and we can substitute the former into the latter. (and generalizes to fibrant n-tuple category)
But since it's long, I really want to find a good abbreviation of the phrase. If anyone has ideas please let me know.
If anything the word should be "category", but that ship has already sailed two or three times.
Yeah, maybe. This may be controversial in academia, but I think conventions are only "set in stone" when they are publically understood, not just by a subcommunity.
Why do you want to call them categories? And then what would you call categories?
Or to put it more simply/personally - I reserve the right to replace a term if I think it's helpful, and accept that its fate will be determined by community response.
Sorry for the tangent; I do want to catch up on what you're doing here.
I would call (1-)categories "categories", and the existing higher categories something like "narrow n-categories".
Much like the attempt to replace "weak n-category" with "n-category" and "n-category" with "strict n-category" which has been ... semi-successful.
Oh, yeah but so what would you call equipments?
"Equipments" or "fibrant double categories" I would call "2-categories".
ah, yes... this is very simple and I think I support it.
but then what would you call a double category that's not fibrant / not an equipment? (though I do agree that being fibrant should be the default, because that is the concept of universality via representable profunctor).
Probably "double 1-category" or maybe some evocative red herring adjective like "stiff 2-category" ...
yeah, it's stiff because it doesn't know how to "bend" tight morphisms into loose ones. that's good.
The shape category of an "operad with shapes" is a direct category with finite fan-in. The operations can be viewed as a category equipped with a discrete fibration and a profunctor such that the collage of the whole diagram (and thus also ) is direct with finite fan-in. The specifications exist as the arrows in and the action of the profunctor .
So far what has been specified is more like a "collection with shapes" than an "operad with shapes". Given two such collections with the same shapes , there is a monoidal product where the operations of are operations of equipped with consistent labellings of by operations of . "Consistent" means that: you have a -set morphism from to (viewed as a presheaf via ). is basically inherited from and is obtained from pointwise by gluing along the category of elements of . (A concern: does this actually exist in all cases? I think it does though since it looks pointwise like a colimit in a presheaf category...) Then an operad with shapes is a monoid in this monoidal category.
(It would be nice to have a form of this definition that didn't do so much equivocation between presheaves and discrete fibrations.)
A further conjecture related to this: A -algebra with one object is, when this is meaningful, the same thing as an operad with the shapes over , generalizing from Leinster in the case of globular operads.
You can turn a -set into a collection with shapes by making the category of elements, the corresponding projector, and pointwise the empty -set. Then this gives rise to an actegory structure and a (cartesian? probably/hopefully) monad describing the -algebras for each per the discussion in [[operad]] ("The monad attached to an operad"). I speculate hopefully that (prime a la Leinster).
A category on the same objects as with added morphisms can be given by a -monoid on , while a factorization system can be given as two -monoids on the same object with a distributive law between them. Is there some way to combine these constructions so you can add the part of an -factorization system in ?
Re: changing the meaning of the word "category": NO!
I can confidently predict that if you try to do that, the "community response" will be very negative, not only towards the attempted change of terminology, but towards the rest of your work by association.
Personally I'm happy to stick with "equipment" for about 10 or 20 more years until either that's no longer the case or "equipment" has legs of its own. I just want the default index of "equipment" to be 2 ...
What I don't want is to constantly rotate on the "next best thing" so that nobody outside can keep track of how things are developing.
My own opinion is that the really important structure where all of category theory is unified, including "multi-variable" notions, is a "compact closed equipment". This structure has yet to be precisely defined and studied (although Christian and I have had some ideas), and so I think rather than trying to rename ordinary equipments, it would be better to spend some time thinking of a new and snappy name for the compact closed ones. In some previous abortive work in that direction with Patrick Schultz, we used the word "kit" (Australian slang meaning something kind of like "equipment" or "outfit", I believe), but one can probably do better than that.
I can definitely see wanting duals, but it seems almost too on-the-nose to me in that a lot of nice generalizations of categories don't have ...
Treating degeneracies for now as a simple -monoid on , trying to come up with an -collection [[actegory]] structure on profunctors. So far what I've come up with is making them into an -collection themselves by taking the graph of the profunctor, using the fibrant projection as , and making the profunctor represented by the opfibrant projection. This has the unfortunate effect of kind of hiding the coaction of the profunctor but it might work anyway. The idea is to put an algebra structure on degeneracies as a whole, in a way consistent with the category and factorization structure ...
I don't know too many generalizations of categories that lack duals but with which one can actually do a substantial amount of category theory. What do you have in mind?
Ordinary multicategories for one.
What sort of category theory can you do with multicategories that needs more than the 2-category of them? I've tried to make something useful come out of formal category theory in the obvious equipment of multicategories, but for the most part what drops out didn't seem correct or useful.
I don't know what else yet, but surely you need the equipment for correct definitions if you enrich them. What all kind of things have you tried? Also, I don't think the equipment on toposes has duals, and there are definitely at least a few interesting things you can do there, although limits/colimits have disappointed me so far.
It's starting to seem like the above lifting of -endoprofunctors to -collections preserves composition? Am I hallucinating? I certainly didn't expect this from such a heap of ad-hockery. If it's true it's definitely a reason to like it.
Well, it definitely doesn't preserve nullary composition.
The super-simple option -- take as and as the profunctor -- doesn't work here for other reasons. It means you would get one operation for each shape and the arity of the operation would be "all the facets of the shape and all their degeneracies pasted together along facets" -- it would be, generally, an infinitary operation, and it would not read out the information needed for closing things up.
Mike Shulman said:
I don't know too many generalizations of categories that lack duals but with which one can actually do a substantial amount of category theory. What do you have in mind?
V-enriched category theory for nonsymmetric V is one obvious candidate, no?
The more complicated option above, though: it has as operations the heteromorphisms with sources as codomains and (presheaf represented by the) targets as codomains. In the case at hand, this means an operation is a way of taking a facet of the (always representable/"unary") domain and degenerating it into the shape of the codomain. If you start with the identity profunctor, though, then an operation is a way of taking a codomain-shaped facet of the domain. I think this lifting lands in a subcategory of -collections that all have these faceting operations, and they all laxly absorb the lifting of the identity, and composition is laxly preserved ... in all cases you miss out on quotienting away the action in the middle because the -collection product doesn't do that or have a way to do it.
Maybe the solution to the laxness (and some other stuff) is to take the degeneracies as a collection in the first place! Degeneracies can be degeneracies alone, not mixed with faces. The facets of the degeneracies-as-operations can represent the composition table for degeneracies getting precomposed by faces, outputting degeneracies postcomposed by faces like you normally can get uniquely in a Reedy category. Then the endoprofunctor (and the monoid structure on it) can be recovered from the collection (and its monoid structure?).
Yes! The degeneracies for should be an -operad! This nicely gives the composition table for the degeneracies among themselves. This works beautifully except ... well it doesn't make a very good -algebra! The problem is, the product still contains all these things with domains shaped like pasting diagrams, but only has operations with representable domains, so an action just isn't definable. This on the one hand defeats the entire original purpose of making a collection in the first place. On the other hand, this is a pretty nice presentation of the data needed to complete a direct category to a Reedy category, so I think I'll keep it anyway?
Maybe instead of an action of on , I should be looking at a distributive law, a map from to ? Looks somewhat promising, but there's seemingly a lot of space for arbitrariness to crawl in when it comes to "identity shape on" operations versus actual degeneracies doing the lifting. Maybe there's a way to leave this as a choice, make it systematically, then squish it down later when making barrels? Ugh.
The distributive law idea doesn't really seem very good after all. Maybe I actually got too distracted by the idea of degeneracies in the first place; after all, the idea was originally to complete a simple shape to an algebra in a way suitable to mapping into., keeping in mind that anything could live over an object. Maybe there's a simpler way to do that.
For the new year I'm going to try something new: working with Cartesian monads directly! I'm starting out by trying to figure out when (small) -multicategories are a special case of -enriched -multicategories; to keep from drowning in huge diagrams I am trying to axiomatize the (indiscrete) functor from Leinster. It seems that it is a reflective subcategory inclusion of in -categories and its underlying functor into -graphs is also one. The left adjoints are maybe even fibrations? And the left adjoint of commutes with .
Okay, I think the desired situation for enriching a thing is: is a category fibered over , with right adjoint to the fibration. is a cartesian monad on fibered over . is pointwise equipped with the unique possible -algebra structure.
Then you can define a "-multicategory" to be a monoid in , to be the canonical -multicategory on for a -algebra, plus the evident functor action, and finally:
An "-enriched -algebra" , for a -multicategory, is an object of , equipped with a -multicategory map .
James Deikun said:
I don't know what else yet, but surely you need the equipment for correct definitions if you enrich them. What all kind of things have you tried?
Well, internal notions in the 2-category of enriched multicategories don't suffice, but that doesn't mean that the equipment of them does suffice. My memory is that limits in the equipment of multicategories may be right, but colimits don't come out to be what one would want a colimit in a multicategory to be. Also one hopes maybe that universal arrows would be some kind of colimit in such an equipment, but they aren't.
Nathanael Arkor said:
V-enriched category theory for nonsymmetric V is one obvious candidate, no?
Yes, that's about the only example I know of where you don't have duals or tensor products, but you do get something meaningful from equipment-theoretic limits and colimits. (Well, and its generalization to W-enriched category theory for a bicategory W.) But nonsymmetric enrichment is pretty rare, compared to the vast amount of category theory for which you need duals and tensors.
Actually, although I paraphrased the comment about "all of category theory being unified", I think it's a mistake to even look for one structure in which all of category theory can be unified. It's certainly a mistake to focus too much on -categories as the only face of higher category theory, but it's likewise a mistake to focus too much on double categories or equipments. Higher category theory is so much richer than that -- it's an immense zoo of fascinating structures that are related to each other in many ways.
In order to recover actual small -algebras from an enrichment, it's necessary to pick an appropriate .
looks like : plus some monoid structure. The first requirement is for a map from to to be able to pick out any small object in the -fiber over . An example of such an object, when is , is , and is the free category monad, is the quiver with a universe worth of loops on a single point. I think the general thing one is looking for here is a "vertical morphism classifier" of some sort in .
Given a vertical morphism classifier (which I probably will return to later), the next thing that's required is to somehow be able to recover a map -- with the right conditions on it to be a -algebra -- from a map with certain commutation conditions.
Mike Shulman said:
Nathanael Arkor said:
V-enriched category theory for nonsymmetric V is one obvious candidate, no?
Yes, that's about the only example I know of where you don't have duals or tensor products, but you do get something meaningful from equipment-theoretic limits and colimits. (Well, and its generalization to W-enriched category theory for a bicategory W.) But nonsymmetric enrichment is pretty rare, compared to the vast amount of category theory for which you need duals and tensors.
I suspect categories internal to a nonsymmetric monoidal category with equalisers gives another example, but I never checked for want of examples.
If fibers of are closed under (vertical) pullback, then any universe in classifies vertical morphisms in . I think this condition is necessary anyway to have a monad that's both Cartesian and fibered? (If it isn't i think I'm willing to stipulate it as part of the setup ...)
Nathanael Arkor said:
I suspect categories internal to a nonsymmetric monoidal category with equalisers gives another example, but I never checked for want of examples.
Would the category of equaliser-preserving endofunctors on a category be an example?
(I mean of the thing you live in.)
According to the relations that hold around a functor of Burroni generalized multicategories, there must be two arrows into , corresponding respectively to pulling back along and along , and pulling them back along respectively give, in , the arrow from to and the second projection of . (This is probably some very painful plodding to someone more comfortable with the semantics of universes in type theory.)
This is reminding me of how you construct exponentials in an elementary topos as graphs of functional relations. Wonder how much of the apparatus you recover going the other way.
It seems like the essential ingredient for both this construction and the "-multicategory of -small -algebras" construction is building a weak classifier/universe of -algebras from a universe closed over and some other reasonable list of things to be closed over. Does anyone know a construction like this, either off-hand or in the literature?
(Particularly, it seems what's needed is where an arrow from to the universe classifies an algebra, carrier included.)
(It's not the same as a universe in -- in the case I'm looking for, if the arrow is of the form I think the algebra will turn out to be free on its carrier, assuming the universe is even of the form making that possible.)
Actually in more detail: it's not a completely arbitrary arrow; it's a there's a morphism to a plain old universe that classifies the carrier, then is a chosen factorization of through the universe-of-algebras through the adjunct of a morphism from the free -algebra on the universe-of-algebras to the free -algebra on the plain old universe. So basically you can recover the carrier from but not every possible is sensible.
I've gotta say, all this thinking about universes really makes me appreciate the notion of fibered category and the externalization of an internal category! This makes me think: if the monad is [[parametric right adjoint]] instead of merely Cartesian, and has an essentially small dense generating full subcategory , is automatically a [[monad with arities]] and its algebras can be externalized! In particular is the essentially small full subcategory of on objects whose -image is under an object of via a -generic morphism. Then let be the full subcategory of free -algebras on objects of , and the restriction of the free algebra functor. If I'm getting all this right, then an external -algebra is a presheaf on such that is naturally isomorphic to . (This is not as super nice as I was hoping, but maybe it will still be nicer than messing with universes?)
Anyway what I would really like to externalize would be -multicategories, not -algebras. I think there's a lot less prior art on this!
Basically what I can think of is Hermida on (op)fibrations of multicategories, but that's done in such a way that to be properly "external" we already need an elementary description of the kind of multicategory in question.
I'm looking at the definition of local smallness of a fibration since that's the most interesting ingredient of recovering an internal category from a fibration. Basically it's talking about defining a fiberwise "hom" where the "hom" for two objects in a fiber doesn't have to actually live in the same fiber as them, and it's fiberwise because the hom between objects in different fibers can't be freely chosen but is dictated by the fiberwise homs and the structure of the base. TBH I'm not really understanding the role of the "evaluation map" in this definition since in the final construction it gets thrown away.
Maybe I should first try to construct "externalization" and then see what kind of properties it follows. I think probably the best way to do it is in PROP-style where both inputs and outputs are given as collections so arrows can be composed directly. Let be an internal -multicategory in . For each object form a category with
I would like to say this just involves turning into an internal category in the Kleisli category , and doing normal externalization (via indexed categories) there. However, I'm not sure all the needed pullbacks actually exist in the Kleisli category or correspond to what they need to be. Perhaps it's best to try to understand it on its own terms.
I think via associativity of Kleisli composition it does turn out to be a split indexed/fibered category over , even if it doesn't get there in quite the usual way. It should have a bunch of other, not-particularly-smallness-related, properties though, coming from the fact that , , and enter in the form of free morphisms. What are these properties?
If you do this construction on a plain multicategory, you get:
Somehow the property seems like "all the morphisms are generated by the ones whose targets are free morphisms". But how to formalize that? Especially when you don't even "know" that objects are "really" families?
Probably somehow making use of the Cartesian morphisms which can still do reindexing without knowing something "is" a family in the first place ... there have to be relationships between , and ...
Then again, maybe there's an extra bit of structure, indicating where the "unary output" things lie, that shouldn't be forgotten, like with a [[category of operators]].
And actually the 1-output objects don't seem to carry all the information in a natural way; it seems like when externalizing a virtual double category you need the 0-input 0-output objects to get the arrows without having to attach them to any particular squares, which may not be forthcoming. So it seems like you need the outputs that are "shaped" by some kind of generator of , probably weaker than a dense generator though ... I find this so weird.
(Maybe this has more to do with which should get sampled, though.)
Yeah, I think it's still fine to only look at the things where the shape of the output is literally the quiver , whatever quiver that is.
Let's look at strongly cartesian (p.r.a.) monads again just for fun ... there is a generic/free factorization system in there and using it on arrows representing objects factors them into a generic cartesian arrow and a free arrow. Basically it's an "image factorization" where the generic cartesian arrow represents all the "reshaping" done and the free arrow is purely "labelling the generic shape". I think even without a strongly cartesian monad, you could indicate the class of objects that are "free" and they would be closed under following free cartesian arrows backward. Classes of objects are a bit odd, though, especially ones with such weak closure properties. And the free objects don't seem to do obvious things like form a [[coseparator]] in a fiber, or even the total category.
Is there any way a vertical arrow into a free object can be not a free vertical arrow (i.e. represented by a free arrow into )? It's easy to see that a free vertical arrow must terminate at a free object (composition of two free arrows is free) but while intuitively "obvious" the converse would seem to imply a factorization property on free arrows that's not immediately evident (if and are free so is ). It's not true for the reader monad (where the functor is Cartesian but the unit isn't) but my go-to test Cartesian monads do have this property (but they might be strongly Cartesian and it might be only a property of strongly Cartesian monads).
As a side effect of all the looking into parametric right adjoints, I've discovered that my notion of an -collection way up above is actually the same data as a p.r.a. endofunctor on , and the composition seems to be the same too.
If the notion of map between -collections is the same as a Cartesian natural transformation, then my -operad is exactly a [[p.r.a. monad]] !
By using (1) the definition of a free algebra in the EM category (2) the definition of an algebra morphism (3) the identity of free morphisms in the EM category as ones of the form (4) the cartesianness of 's naturality squares and (5) the two-pullback-square pasting lemma, I get something close to the factorization property I'm looking for, namely:
If and are free morphisms, is the pullback of along with other projection also . Having some trouble getting from there to being actually free though.
By pasting naturality squares for instead I got it. Nice little puzzle. Actually looks like only has to be Cartesian to make this work!
Actually Definition 6.2.2 in Higher Operads, Higher Categories may hold a clue to a better way to define a "large -multicategory". The slice over a universe object can be replaced with the Cartesian arrow category of , and the forgetful functor replaced with the restriction of the codomain fibration, resulting in a large discrete fibration instead of a small one, which is "almost representable" as only size issues prevent it. Similarly other discrete fibrations can be used. (It would be hilarious if the induced functor between Kleisli categories were that exact same fibration but I only give it about 50-50.)
Looks like it's not. I miss out on big lols but this functor looks nicer so I'll live.
I guess is only discrete as a Street fibration unless you weed out the projections from the non-designated pullbacks, and there may not be a consistent way to do that? Bother. I'm still going to guess it's good enough though.
So the first big production: as a large -multicategory!
I think even if I actually did this one internally with a universe it would only need to be closed under pullbacks, composition, and itself. It would have been a lot harder to think of, though!
I thought that one would actually be hard, maybe impossible, because didn't have any big conditions on it relating it to , but then I realized: lives there, how could it be more related?
Now that I have this, I can start working on a version of the display conjecture, since normal -multicategory maps into the -multicategory of -algebras should be the same as arbitrary -multicategory maps into the -multicategory of . I need a couple more ingredients, though: the -multicategory of pointed -objects, its standard projection, and the externalizing version of Leinster's .
First of all what even are pointed -objects? Well, plain -objects are represented as an arrow into the indexing object, I guess pointing such a thing is equipping it with a section? Cartesian arrows are still just Cartesian squares since everything else is determined. Same monad can be used except now also acts on the sections. Projection is forgetting the section -- I still don't know what properties the "sides" of large external -multifunctors need but if you imagine doing this with a universe it's going to be so it's probably fine. Again it's a strict monad morphism.
Just for fun let's try abusing the translation in Proposition 6.2.3 to create an internal version of the multicategory of -objects. Start with a universe . Then:
The underlying -algebra here is just , the name of , which if it exists is automatically a -algebra by general considerations of pullbacks.
Words of encouragement: while I understand but a tiny fraction of what you're posting in this thread, I'm an interested lurker who thinks you're poking around somewhere interesting. Much of the background material on which you're building is very near the top of my to-read list. Some of it is even on my 'to formalize' list.
Thank you for the kind words! Believe it or not considering the volume, it's been hard for me to keep going on this work with so little engagement, wondering if I'm just wasting everybody's time.
My guess is that there are very few people, even here, with the necessary background to follow what you're doing (myself included). So engagement will be thin. Not enough of the authors of like material are on here.
@James Deikun it looks like you've been working at this full time this week, but not everyone reading will be checking very often. Be patient and you'll get some comments or pointers. It will also help to regularly summarise where your up to or make explicit what questions you're tackling, since those will improve your chances of getting responses :innocent:
As I said before, I don't have the time to follow what you're doing right now, and some people who are interested may feel overwhelmed by such a high volume of posts. It sounds to me like you're investigating something potentially interesting, but rather than using Zulip as your scratch paper I would suggest working on it for a while on your own and then coming back to summarize and/or ask specific questions.
Fine, I'll slow down after the one I've been working on.
For the multicategory of pointed objects:
Everything being an algebra surprises me because seems like an actually vertically nontrivial virtual double category and it seems like that's what the "virtual double category of quivers" should be. Am I doing something wrong here and if so what?
At this point I consider that I've established the display conjecture . There are a few holes to fill in that involve eye-watering diagram chases or manipulating the internal logic of an LCCC but they don't really seem in doubt. The way this works is:
(And yes, I did have the wrong monad before. The right one doesn't even externalize because the monad part of the externalization would have large algebras.)
Update for the day:
As one would expect, the objects are functors and the vertical arrows are vertical transformations but there are also proarrows and squares.
I'm interested to hear what the proarrows are. I thought about it a little while ago, and the definition didn't seem obvious without having composites of proarrows.
Well, first off, correction: it seems the construction might not work for all . The problem is with composition of squares, which I clearly took for granted too much. It does still work for all vertically trivial , though, which is enough for the classic display equivalence; and maybe some more cases.
Let me see how far I can explain the construction within the limitations of Zulip.
A proarrow of functors consists of:
A square consists of, for each in with strictly ordered marked edges , a cell
(break because this comment was making Zulip give up on previewing)
with composites being preserved thusly:
It's all very straightforward locally, there's just globally a lot of stuff involved.
Composing squares (this will be much less detailed):
Thanks for explaining! So, if I understand correctly, for each cell (left), you have a family of 2-cells (right), of the following form (quiver)?
I'd like to think about it a little more, but it seems reasonable on first glance.
That looks right.
In the case of :
Update:
I'm trying to decide if an exotic definition of functors between virtual double categories is equivalent to the normal one. It's giving me headaches and I would greatly appreciate any help anybody can give. [I got over the headaches and this definition, but it was very helpful thinking about it.]
The conventional definition: A functor F between C and D consists of:
The exotic definition: Let be the quiver of objects and proarrows of C and the quiver of arrows and squares of C. A functor F between C and D consists of:
I'm mostly concerned that there might be too much freedom regarding how quivers of different shapes get mapped relative to each other and there might need to be an extra law or two to restrain that.
In order to talk about the objects of a T-multicategory, you need tools a little more sensitive than the global point . The first of these tools is the dot, . This is a subterminal object of which induces an idempotent modality via Cartesian product. This "flat" modality forgets everything but the "objects" or "dots" in an -object.
The second tool is the degeneracy monad, . This serves as a non-idempotent modality that builds up where "flat" tears down. Semantically, it serves to add "degenerate cells" that reflect lower-dimensional things, including objects, into the higher dimensions of . In good cases, at least, is stable, strongly Cartesian, and left adjoint, but which of these nice attributes are essential remains to be determined. must obey the law .
The third tool is the virtual distributive law (of over ). It serves as compatibility data between and , by deciding when a T-term with some degenerate arguments is actually a degenerate version of another T-term. In the case when T is the free category monad, it decides when a "slow path" that can pause at dots traverses the same edges as a "fast path", or when it doesn't traverse any "real" edges at all.
is a functor from to itself, with two natural projections, to and to . It has four structure morphisms corresponding to the four laws of a distributive law: satisfies and while follows and . and are symmetric compatibility laws with .
From you can construct the standard multicategory functor 𝕂. It raises to create T-multicategories, equipping the -image of each object with an object of morphisms and a compatible T-multicategory structure. Having a parameterized T-algebra structure on turns out to be too much to ask, but a T-multicategory stuff is just right!
Now, 𝕂 may seem like a lot of data, but like it usually folds out from a little data, because it is required to (1) be a left adjoint (its right adjoint might be called ) and (2) take to . This means you really need to just specify it for your basic shapes other than dots in a consistent way and the full thing will unfold. In the case of being the free category monad, is the one-dot quiver, is the dot-with-a-loop quiver, and is the "put a loop on every dot" monad. 𝕂 is entirely determined by its value on the walking edge; this is a vertically trivial -multicategory unfolded from the algebra that maps every path to the unique edge with the same source and target. The other 𝕂 values are "subtrivial"--there are never two squares for a given domain but there may be none. There is a square for a domain when the path involved only traversed at most one nondegenerate edge, and the codomain is either that edge or the degenerate edge it spun on. (Now if only I could figure out how to create all of that easily!)
With the aid of these tools, it's possible to generalize the definitions of "functor" and "natural transformation" of -multicategories to include not only the "objects" we usually think of them as denoting but a bunch of higher shapes, setting the stage for raising the display equivalence for -algebras from an equivalence of categories to an equivalence of -multicategories.
Update:
Update:
Haven't had as much time to work on this lately since I have a new job.
Congratulations on the new job!
@James Deikun may I suggest you move this thread to #practice: our work?
Maybe that would be a good idea. An even better idea might be to move it leaving the first few messages. I don't seem to have rights to do either one though.
If you tell me which message to cut off at I will do it
I was answering direct questions a bit longer than I thought, probably https://categorytheory.zulipchat.com/#narrow/stream/229136-theory.3A-category-theory/topic/Conjectures.20on.20generalized.20equipments/near/318354499 would be a good place to start putting it in #practice: our work since that is where I started doing updates.
In marked contrast to the virtual double category of virtual double categories, the virtual equipment of virtual equipments seems to have a unit-respecting right adjoint to the vertically-Cartesian product functor. This means that any shape of diagram in a given equipment forms another equipment, ! Here's how it works:
The vertical Cartesian product of two equipments, and , is an equipment such that (normal, restriction-preserving) virtual functors into it represent a pair of virtual functors into and . It's about the simplest thing imaginable:
The unit of the vertical Cartesian product is the vertical terminal object; it has exactly one thing of each shape and "all equations are true".
Everything so far is just inherited from virtual double categories; all the magic comes from the definition of an equipment itself. Let be some shape in an equipment (a dot, arrow, proarrow, or cell) and be the equipment freely generated from a virtual double category containing a single -shape. (In the case of a dot, you get ; this may be considered a good sign.)
Now we can define . An -shape in is simply a (normal, restriction-preserving) virtual functor from to . That's it! This definition "instantly" gives us virtual equipments of relative monads and many other things.
The "fun" part is unfolding what these Cartesian products look like in particular cases. For example, a proarrow of proarrows unfolds into a "butterfly" shape:
where the bottom cell points up.
An "arrow of proarrows" looks pretty involved at first because of all the restrictions, but it turns out to all be generated by a single square :
Where this approach really proves its worth is in figuring out the more obscure situations, like a 2-cell of 3-cells, or an arrow of maps out of restrictions, which are too complicated to draw with AMSCD sadly (?).
I'm currently trying to determine exactly how the definition of equipment does this "magic", which is very similar to the "magic of degeneracies" in simplicial sets, so I can write up something a little more formal and maybe generalize it to generalized equipments (see above).
Do you require to be an equipment, or is it enough to be a normal virtual double category (that is, admitting loose identities)?
(The normality assumption is necessary to define a diagonal functor, so this seems necessary.)
It would be nice to have this written out, because I think an appropriate definition of " admits -indexed colimits" for a virtual equipment is for the diagonal to have a normal left adjoint, and there are several motivating examples. For instance, taking to be the "free-standing loose-monad", I believe that asking for to admit -indexed colimits is close to asking for it to be exact in the sense of Schultz (with one caveat that can be addressed by asking for the unit of the adjunction to be cartesian).
(Of course, standard double categorical colimits like cotabulators/collages are also examples.)
AFAICT restrictions aren't doing any work until they're brought in explicitly, so probably all this works for normal VDCs as well. It's remarkable how well restrictions cooperate and stay out of the way, though.
Just a random note that, while investigating the concept of monadicity for equipments, I tried equipmentifying the explicit presentation of the EM category by hand, hoping for some insight, and ended up with exactly ...
It actually was pretty insightful, since it seems like you can use the monad data to turn the modules around so that it doesn't seem to much matter which direction of arrows you picked ...
And it seems like an equipment of actual algebras and an equipment of nice presentations of algebras are inches apart in this environment instead of miles.
If you have a virtual equipment (and this time it really does have to be an equipment) you can get a lot more 1-categorical data out of it than merely its vertical category. Consider the following functor , considered as a "category over ":
Now, this may seem rather plain, it's just a fibration after all. But wait! It's not just a plain fibration, it's a fibration in plain multicategories. How does this work? Each fiber has the structure of a plain multicategory, where the multi-arrows are all the cells in framed by the vertical identity on and having target and all sources in . The underlying categories are just the fibers as defined above. The pullback functors extend to transport this multicategory structure using composition and Cartesian factoring of cells.
So far all this works for any equipment, but if is a pseudo equipment rather than virtual, and is Cartesian monoidal, then Theorem 12.8 of Shulman's "Framed Bicategories and Monoidal Fibrations" should actually give a monoidal fibration out of this.
"But what is it good for?" you ask. Well, one important role is lowering monads on equipments back down to 1-category land without losing too much information. If you take the diagonal fibration of the horizontal Kleisli category of a monad on an equipment, you still have all the pieces you need to construct the vertical category of . This may seem like a bizarre thing to do, but it's really helpful for comparing Burroni-Leinster generalized multicategories to Cruttwell-Shulman ones and teasing out the hidden higher-dimensional features of the former. For example, the category of quivers fibered over their sets of dots is exactly the diagonal fibration of .
(In fact, in general the category of "-graphs" is the total category of the diagonal fibration of the equipment of "-spans", and the diagonal fibration itself gives the structure you need to reconstruct the "-multicategory on a -graph" monad.)
James Deikun said:
Just a random note that, while investigating the concept of monadicity for equipments, I tried equipmentifying the explicit presentation of the EM category by hand, hoping for some insight, and ended up with exactly ...
It may be worth noting that @Roald Koudenburg has studied augmented virtual double categories of algebras in §6 of the preprint A double-dimensional approach to formal category theory. Is this the same kind of structure you were looking at?
But this identification seems very curious... I'd be interested to see the details.
James Deikun said:
If you have a virtual equipment (and this time it really does have to be an equipment) you can get a lot more 1-categorical data out of it than merely its vertical category. Consider the following functor , considered as a "category over ":
In the setting of pseudo double categories, this functor looks related to the hom functor Paré describes in §2.1 of Yoneda theory for double categories, except that he considers a two-sided construction that captures arbitrary loose-cells , rather than just the endomorphisms. The same kind of construction should work for virtual double categories. Perhaps this is a useful perspective also?
(I was thinking about this at some point because I wanted a Yoneda embedding for virtual double categories, but I ran into issues because there didn't seem to be a functor virtual double category construction. But perhaps if one restricts to (virtual) equipments it will work out after all.)
Nathanael Arkor said:
But this identification seems very curious... I'd be interested to see the details.
For objects: the base proarrow of the monoid, becomes the algebra arrow. The multiplication and unit of the monoid become constraints:
matching the equations and . The monoid laws become the necessary coherences.
For arrows: the arrow part becomes the algebra morphism itself, the square becomes a constraint:
matching the equation , and the compatibilities become coherences.
For proarrows: here the guidance from the EM category was a bit less clear, but: the base proarrow of the bimodule becomes the algebra bimodule itself, the actions become a butterfly:
These match the equations and that make the bimodule like an algebra, and the "meta equation" that makes it almost like a morphism. The coherences of the action become, well, coherences.
I'm not going to try to draw out what happens with cells.
The horizontal Kleisli category includes in as "free modules" where all the cell parts are made from cartesian and opcartesian cells. Here, as in the inclusion of the underlying equipment into the horizontal Kleisli category, we rely heavily on the existence of units and restrictions, this doesn't work at all with simply a virtual double category. The really interesting part is how proarrows include: the "free bimodule" on a horizontal Kleisli arrow is . This is how proarrows "turn around".
There's stuff that's still mysterious about this correspondence, like: why doesn't there seem to be normalization? I think probably there is normalization, and it's probably because the unit constraint for an algebra just happens to be cartesian in the diagram equipment where it originally lives, and this has to be preserved by maps of equipments. This would then complete an equivalence between and this category; both categories have normal collapses for normalized monoids, so you could just turn around all the free stuff using the above free construction, and get the rest of the category by collapsing the standard presentations of the free stuff.
Nathanael Arkor said:
James Deikun said:
Just a random note that, while investigating the concept of monadicity for equipments, I tried equipmentifying the explicit presentation of the EM category by hand, hoping for some insight, and ended up with exactly ...
It may be worth noting that Roald Koudenburg has studied augmented virtual double categories of algebras in §6 of the preprint A double-dimensional approach to formal category theory. Is this the same kind of structure you were looking at?
Not really. They might be complementary, but I'm looking at virtual algebras while he is looking at (co)lax algebras.
Nathanael Arkor said:
(I was thinking about this at some point because I wanted a Yoneda embedding for virtual double categories, but I ran into issues because there didn't seem to be a functor virtual double category construction. But perhaps if one restricts to (virtual) equipments it will work out after all.)
Couldn't you find an embedding from a vdc to its vdc of 'modules in Set'? I'm thinking of a way to pull out Yoneda without necessarily having preseahves around in the way Garner and Shulman do here
James Deikun said:
Nathanael Arkor said:
But this identification seems very curious... I'd be interested to see the details.
For objects: the base proarrow of the monoid, becomes the algebra arrow. The multiplication and unit of the monoid become constraints:
This is very interesting; thanks for spelling out it. It's rather mysterious to me why this should happen. (It reminds me somewhat of the "horizontalizers in Kl(T)" that Paré considers in this talk.)
In §6.2 of Higher Operads, Higher Categories, Leinster defines , essentially a natural strictification of the category of -multicategories defined by Burroni. With the benefit of hindsight, we can see that there is an interesting equipment underlying this construction. Let be a category with finite limits, and be the strict equipment where:
Horizontal units are identity functors, and restrictions are given by the computation .
It should look pretty familiar already, but to really see how it connects to the category in the book, we need another construction: the slice of an equipment over a monoid. Let be a monoid in . Then is the equipment with:
The construction preserves the strictness of everything, and the existence of compositions of proarrows, and we can define the ordinary slice as the monoid slice over the trivial monoid on . Note that unless the monoid is trivial, the unit on the identity arrow over is not the identity square!
Then, to bring it all together:
Not only does this give a strictification and a different, sometimes simpler, perspective on the span-based constructions of this version of generalized multicategories, but the separation of -spans into -slices of semispans and the commutation of the equipment of monoids and modules with slicing directly gives the construction of the equipment of -multicategories from the equipment of -spans as one of the commonest constructions in equipment theory.
James Deikun said:
The construction preserves the strictness of everything, and the existence of compositions of proarrows, and we can define the ordinary slice as the monoid slice over the trivial monoid on . Note that unless the monoid is trivial, the unit on the identity arrow over is not the identity square!
Rather than specialising the construction of a "slice over a loose monad" to a "slice over an object", I think one can go in the other direction and define as the full sub-VCD of spanned by the representables (i.e. identity loose-monads). Then, analogously, there is a natural definition of a "slice over an -enriched category", etc.
(That slicing commutes with the modules construction is essentially a VDC analogue of the fact that slicing commutes with taking presheaves.)
James Deikun said:
Not only does this give a strictification and a different, sometimes simpler, perspective on the span-based constructions of this version of generalized multicategories, but the separation of -spans into -slices of semispans and the commutation of the equipment of monoids and modules with slicing directly gives the construction of the equipment of -multicategories from the equipment of -spans as one of the commonest constructions in equipment theory.
I think this is a very nice perspective. If you haven't come across it, it's very much connected to §5 of Gambino and Kock's Polynomial functors and polynomial monads, though in a more abstract context.
Nathanael Arkor said:
Rather than specialising the construction of a "slice over a loose monad" to a "slice over an object", I think one can go in the other direction and define as the full sub-VCD of spanned by the representables (i.e. identity loose-monads). Then, analogously, there is a natural definition of a "slice over an -enriched category, etc.
Yeah I'm pretty sure they're interdefinable in this way. I chose the presentation with the slice over monoids primary because it presents more of the right mental image for constructing multicategories from spans. But the other perspective makes it more obvious why slices and commute, as you note.
Nathanael Arkor said:
I think this is a very nice perspective. If you haven't come across it, it's very much connected to §5 of Gambino and Kock's Polynomial functors and polynomial monads, though in a more abstract context.
Huh, they're really doing almost the exact same thing as I am up to and including 5.11 (they assume Cartesian closedness from the beginning but don't seem to use it at all?) ... I read this before a long time ago but this section really didn't make it into my mental index properly, probably because I didn't really see the independent applicability of the first part at the time ...
they assume Cartesian closedness from the beginning but don't seem to use it at all?
Yes, I'm not sure why they need this. Earlier in the paper they mention that the theory of polynomial functors can be generalised from locally cartesian closed categories to cartesian closed categories, which I presume is where this assumption is coming from, but the appropriate generality is just a category with pullbacks (as in Weber's work).
A (space-valued) Rezk -algebra is a -valued presheaf on satisfying the following conditions:
David Kern, All Segal objects are monads in generalised spans (arXiv)
So what is this? The original idea is that the construction of [[Theta-spaces]] doesn't really depend that much on the details of the particular gadget that is the strict -category. Sure the iterative nature does, but that's about it. And Batanin-Leinster n-categories are similarly abstract, in that they just need a Cartesian monad and a cofibrant replacement comonad to get started. So I started analyzing these things to see if I could find a path to stuff like weak virtual double categories. And stuff like the [[canonical model structure]] got pulled in.
The idea I ended up with is that generally when you have a monad on a presheaf category describing some sort of higher structure, it comes along with a canonical model structure on the category of algebras. And that structure probably has all algebras fibrant, and the cofibrations/acyclic fibrations are "right transferred" along the monadic adjunction from the presheaf category, where they are something simple like a cellular model or, for finite dimensional things like 1-categories or 2-categories, maybe your canonical model structure has some extra generators thrown into the cellular model that allow you to force highest-dimensional cells to be equal.
But anyway, the idea is you have this model structure, and the cofibrations come from big obvious features of the shape category, with little to do with the monad. Where do the fibrations come from? What I eventually realized is the monad itself is playing the role of the fibrant replacement monad in a model structure, and if the monad has small arities that plays the role of cofibrant generation of the -factorization.
(And I'm probably missing some compatibility condition between and but I can't figure out what it is without actually trying to do proofs with this stuff. Also should probably be called .)
So then, the purpose of the -nerve in the "Rezk algebra" construction is to create a new setting where the weird half-monad half-model category can be turned into something more like a plain model category, by fattening up the shape category and correspondingly flattening the structure induced by the monad down to pure property. And then you can cross your algebras with spaces to get a spacelike algebralike thing.
One cool spinoff of this way of looking at things is that you see that the Segal conditions and the completeness condition of complete Segal/Theta spaces are two sides of the same coin, the name of that coin being "respect for the canonical model structure of strict n-categories".
(Oh, and one worry I have about this is that the completeness condition will cause a loss of cofibrant generation by moving enforcement of the original acyclic fibrations from the cofibrant to the fibrant side ... in the existing examples it works out because a small set of collapses of "walking equivalences" generates all of them, but I don't as yet see a way to make this systematic.)
I was hesitating to mention this in your "Segal conditions" question because I wasn't sure if the framework was maybe too different, but since you're looking at a homotopical use of the monads with arities, you might be interested in what goes on in Sections 10–13 of Chu—Haugseng's original work, where they study the relation between strongly cartesian (which they call polynomial) -monads and Segal condition.
Overall I'd say they about answer your first two conjectures and do not touch the remaining two: the model structure on -presheaves is a left Bousfield localisation along (the Yoneda embedding of) what you call the standard diagrams (see Lemma 2.11).
One thing they do not do, however, is integrate the Rezk-completeness condition like you describe; they just ignore the question for now.
Ah, thanks! I wasn't sure how related it was since I found the recap of algebraic patterns in your paper to be pretty opaque with my limited prior exposure to the homotopical algebra literature, and everything that was there seemed like it was tuned for algebras that natively live in the homotopical setting, but as you say, it seems like Segal objects are very much a "non-complete" generalization of what I describe here as "Rezk algebras", although exclusively for strongly Cartesian . (Which is all I really need anyway though.)
Translating into the dictionary above for anyone following along, their "algebraic patterns" explicitly describe an orthogonal factorization system on which is more-or-less the restriction of the generic/free factorization system on the Kleisli category of , plus a set of "generators" which correspond to the objects of . At least in the case where the pattern is "extendable" it seems they can recover the monad from this data up to some possible confusion about which operations live in the monad and which are part of the structure of the shape category.
(Actually their framework can sort of handle at least some of the non-strongly-Cartesian monads via non-extendable patterns but it becomes very opaque and hard to use and it's not clear how much it really covers.)
There are some very nice things about their framework--not worrying about completeness means they can recover models of 1-categorical patterns in Set as a special case of Segal objects, for example. And their Lemma 2.11 is pretty nifty. Do the -categories they define, without completeness, have the right equivalences though? My homotopy theory skills are still too weak to tell easily.
I'm definitely getting more interested in your article too now that I have absorbed some of the background. In the strict setting the classifying object of Conjecture 4 is known as the -multicategory of -spans.
Okay, I've read through a lot of it and you've pretty definitely established an alternative version in the algebraic patterns setting of Conjecture 4! Your "weak Segal fibrations" seem to be an acceptable notion of -multicategory. Your Theorem 5.7 establishes as a classifying object for "algebras of a -multicategory", which as in the strict setting is actually a notion independent of exactly what kind of multicategory it is taken to be. (Here it only depends on the total category of the weak Segal fibration, for instance.)
There are some things missing before I'd really count Conjecture 4 to be thoroughly established even in this setting, though:
(How do you do that Fraktur light in the article anyway? Is it \mma which we don't have here?)
James Deikun said:
everything that was there seemed like it was tuned for algebras that natively live in the homotopical setting
That's true, I tend to ignore that because the Segal objects over an algebraic pattern make sense as much in sets as in the homotopical setting, but the monad side of things is purely -categorical, so there's maybe no direct
way of recovering the strict case besides saying "well, their construction and nerve theorem is really a direct generalisation of the -categorical one, so we can use the equivalence with Segal objects on each side and include those".
And indeed, while the constructions surely work in more generality than strongly cartesian monads or saturated patterns, I don't think you'll get an equivalence there.
For the matter of Rezk-completeness, indeed without it you don't quite get the right equivalences, or in fact even the right objects: non-complete Segal objects should be seen as "flagged" -multicategories, where for operads (including categories) a flagging is a surjective-on-colours map from from some -groupoid, for -categories it is a kind of iterative sequence of lower flaggings, and in higher generality I don't know that anyone has any idea (I guess that's why they ignore the question of completeness in their paper).
In fact, I may be reading your proposed definition of completeness wrong, because it doesn't seem to me to correspond to what it normally is: taking the case where is , I think the -morphisms are the active maps between elementary arities, of which there is only the "identity" map , but for Rezk-completeness you rather want to be local with respect to , where is the walking equivalence (the localisation of ); I'm pretty sure that being local for means being not just Rezk-complete but also a groupoid.
James Deikun said:
In the strict setting the classifying object of Conjecture 4 is known as the -multicategory of -spans.
Ah, thanks, I somehow missed that this already existed. And I also didn't realise that Leinster's book has this section about opfibrations of multicategories, I was only familiar with Hermida's version. In any case, I think that what I do in my paper is not the fully correct thing for your Conjecture 4, because (with the conjectures at the end) I get a classifier for discrete opfibrations in the -category of -algebras in categories/internal categories in -algebras, but this is not the right notion of opfibrations of -multicategories.
Also, I should make clear that the weak Segal fibrations are not mine, they're due to the original paper of Chu–Haugseng.
James Deikun said:
(How do you do that Fraktur light in the article anyway? Is it \mma which we don't have here?)
The (more readable) Fraktur I use is the one from kp-fonts. Unfortunately I have to resort to some demonic summoning ritual in my preamble to get it, so it seems unlikely that we can use it here.
Also, a thought about your Conjecture 3, I have the impression that in order to define a -algebra of -algebras and "bimodules" between them (if I'm correct in assuming that this is what this conjecture should construct), you need a bit more information than just the one in the algebraic pattern: for example, in the case of , you need the data of what Haugseng calls the "cellular" maps (the construction is recalled in Section 2 of Roman Kositsyn's paper on -categorical monads and theories in a more pattern-full language).
David Kern said:
For the matter of Rezk-completeness, indeed without it you don't quite get the right equivalences, or in fact even the right objects: non-complete Segal objects should be seen as "flagged" -multicategories, where for operads (including categories) a flagging is a surjective-on-colours map from from some -groupoid, for -categories it is a kind of iterative sequence of lower flaggings, and in higher generality I don't know that anyone has any idea (I guess that's why they ignore the question of completeness in their paper).
Ah, guess I was right to include the completeness in my definition even though I don't quite know how to handle it as a localization yet. Ignoring it for now and forging ahead would also be a reasonable decision of course but it's not my kind of reasonable decision I guess.
In fact, I may be reading your proposed definition of completeness wrong, because it doesn't seem to me to correspond to what it normally is: taking the case where is , I think the -morphisms are the active maps between arities, of which there is only the "identity" map , but for Rezk-completeness you rather want to be local with respect to , where is the walking equivalence (the localisation of ); I'm pretty sure that being local for means being not just Rezk-complete but also a groupoid.
Yeah if you're reading it right that would be a groupoid, but I think you're not? The for are going to be just the standard cellular model of plus the collapse of the parallel pair so -morphisms in their original setting will be ones that right lift against injective-on-objects maps on reflexive graphs. They lift objects and lift arrows uniquely.
Then you right transfer them to the category of algebras (that's ) and get the functors that are fully faithful and surjective on objects. Then putting that through the nerve functor you get ... ... hm. Maybe that's not quite right. Neither Rezk's nor is the nerve of a category, is it? I might need to find another way to transfer the data.
David Kern said:
Ah, thanks, I somehow missed that this already existed. And I also didn't realise that Leinster's book has this section about opfibrations of multicategories, I was only familiar with Hermida's version. In any case, I think that what I do in my paper is not the fully correct thing for your Conjecture 4, because (with the conjectures at the end) I get a classifier for discrete opfibrations in the -category of -algebras in categories/internal categories in -algebras, but this is not the right notion of opfibrations of -multicategories.
Also, I should make clear that the weak Segal fibrations are not mine, they're due to the original paper of Chu–Haugseng.
"Existed" might be a slight exaggeration. AFAIK it only exists in my unpublished notes that are referenced at Conjectures on generalized equipments and this thread, so it's not surprising at all if you missed them. It's hard enough to find everything that is in the literature.
As far as Conjecture 4 it feels to me like it should classify the right thing. I can only hope your conjectures are off in a serindipitous way, or it classifies both things with different kinds of maps in, or something.
James Deikun said:
Neither Rezk's nor is the nerve of a category, is it? I might need to find another way to transfer the data.
is certainly (the nerve of) a category; what it is not, however, is free on a linear graph, i.e. an object of . This is one of the subtleties that make the matter of Rezk-completeness in a general setting difficult: it uses our knowledge of the relation between the Segal objects of interest and categories. So for, say, operads, it doesn't make sense to speak of invertibility for an operation of arity different from ; fortunately the only corolla that admits an appropriate map to (the nodeless edge) is the -ary one so we can formulate the Rezk-completeness condition, but really we're using the fact that an operad concentrated in arity is a category, or in other words we're stating the completeness condition as "the underlying category of the operad is Rezk-complete". But for a shape of multicategories that you know nothing about, this isn't possible.
A second subtlety is that in order to formulate this condition, we have to impose a distinction between the elementary arities: for the Segal condition they all play the same role, but for Rezk-completeness for operads you really set aside as being kind of your "base" elementary while the corollas stick to a more algebraic role, and for -categories it's the same thing with putting the -globes with on one side and the -globe on the other (I guess this disappears when , but still). In the language of patterns, an enrichable structure in the sense of Chu–Haugseng's newer work gives you that — and, when you think about it, it makes sense that it should — but maybe there could be something more canonical.
James Deikun said:
"Existed" might be a slight exaggeration. AFAIK it only exists in my unpublished notes that are referenced at Conjectures on generalized equipments and this thread, so it's not surprising at all if you missed them. It's hard enough to find everything that is in the literature.
As far as Conjecture 4 it feels to me like it should classify the right thing. I can only hope your conjectures are off in a serindipitous way, or it classifies both things with different kinds of maps in, or something.
Well, thanks for the pointer nonetheless. I'm fairly confident that the construction in my paper (which, really, is just an extension of what Weber explains) gives a more naïve kind of opfibration than the correct one from Leinster, but I'll have to read through this and think about it some more.
David Kern said:
Also, a thought about your Conjecture 3, I have the impression that in order to define a -algebra of -algebras and "bimodules" between them (if I'm correct in assuming that this is what this conjecture should construct), you need a bit more information than just the one in the algebraic pattern: for example, in the case of , you need the data of what Haugseng calls the "cellular" maps (the construction is recalled in Section 2 of Roman Kositsyn's paper on -categorical monads and theories in a more pattern-full language).
I'm reading Kositsyn and Proposition 2.1 looks just like the second thing that's missing for Conjecture 4 in the pattern setting! As for the "cellular" maps, I'm having trouble figuring out how they become needed. In the strict setting all you need to construct correspondences (or whatever is appropriate) is the monad. I think I'll have to digest this and the "enrichable" paper a bit more to figure out exactly what they're doing.
David Kern said:
is certainly (the nerve of) a category; what it is not, however, is free on a linear graph, i.e. an object of . This is one of the subtleties that make the matter of Rezk-completeness in a general setting difficult: it uses our knowledge of the relation between the Segal objects of interest and categories. So for, say, operads, it doesn't make sense to speak of invertibility for an operation of arity different from ; fortunately the only corolla that admits an appropriate map to (the nodeless edge) is the -ary one so we can formulate the Rezk-completeness condition, but really we're using the fact that an operad concentrated in arity is a category, or in other words we're stating the completeness condition as "the underlying category of the operad is Rezk-complete". But for a shape of multicategories that you know nothing about, this isn't possible.
Since is the nerve of a category my condition should probably be all right after all. Except for my slight doubts about its 2-coskeletality, is exactly the kind of object that lies over by an -morphism, and is definitely not (its terminal morphism doesn't lift the identity as a morphism from 1 to 0).
As far as extra data to bring in for completeness goes, I think exactly what you need is , but I'm not sure what it would precisely look like in the pattern setting. It ties into a question I've long been interested in, which is "if the -category presented by a model category only remembers the weak equivalences, what kind of structure on that -category remembers the rest of the model category structure?"
A second subtlety is that in order to formulate this condition, we have to impose a distinction between the elementary arities: for the Segal condition they all play the same role, but for Rezk-completeness for operads you really set aside as being kind of your "base" elementary while the corollas stick to a more algebraic role, and for -categories it's the same thing with putting the -globes with on one side and the -globe on the other (I guess this disappears when , but still). In the language of patterns, an enrichable structure in the sense of Chu–Haugseng's newer work gives you that — and, when you think about it, it makes sense that it should — but maybe there could be something more canonical.
Hm. In the strict setting the main problem with enrichment of generalized multicategories is getting the enrichment to descend far enough through the dimensions of the structure--it works out of the box for categories, but for virtual double categories not so much. It doesn't seem like that kind of structure would help much with completeness in the general case.
James Deikun said:
As for the "cellular" maps, I'm having trouble figuring out how they become needed. In the strict setting all you need to construct correspondences (or whatever is appropriate) is the monad.
Ah, sorry; I remembered erroneously that the cellular maps were used to define the would-be (meaning virtual) tensor products of bimodules, but it seems that in fact they are only used to define actual tensor products (the construction in Haugseng's original paper is probably more readable, if less pattern-minded, than Kositsyn's), so for generalising the virtual double category of categories they might not be needed after all.
James Deikun said:
Since is the nerve of a category my condition should probably be all right after all. Except for my slight doubts about its 2-coskeletality, is exactly the kind of object that lies over by an -morphism, and is definitely not (its terminal morphism doesn't lift the identity as a morphism from 1 to 0).
As far as extra data to bring in for completeness goes, I think exactly what you need is , but I'm not sure what it would precisely look like in the pattern setting. It ties into a question I've long been interested in, which is "if the -category presented by a model category only remembers the weak equivalences, what kind of structure on that -category remembers the rest of the model category structure?"
I see; I had a wrong idea of what the -morphisms are. I still don't have a good grasp on how you define , but I can at least agree that it seems more promising for defining completeness than I first said.
For your second question, I think if anything can do that, it would have to be really a lot of data, simply because of the fact that one -category can be presented by many different model categories: look for example at Grothendieck's [[test categories]], which give you a mind-boggling amount of presheaf categories equipped with weak equivalences (maybe not quite a model structure, but a model structure is just something to make sure a localisation is computationally well-behaved) whose localisations are all the -category of -groupoids.
James Deikun said:
Hm. In the strict setting the main problem with enrichment of generalized multicategories is getting the enrichment to descend far enough through the dimensions of the structure--it works out of the box for categories, but for virtual double categories not so much. It doesn't seem like that kind of structure would help much with completeness in the general case.
Right, I only had in mind the fact that these enrichable structures specify which elementaries should be thought of more as (relative) "objects" or "morphisms", but indeed for -categories the -globes with have to play both roles, once for the "-dimensional completeness" and once for the -dimensional one, so it does make more sense to specify the maps involved in the completeness condition like you do rather than just the elementary arities.
David Kern said:
I see; I had a wrong idea of what the -morphisms are. I still don't have a good grasp on how you define , but I can at least agree that it seems more promising for defining completeness than I first said.
I'm still researching how to define in the general case. The first method I use is that in practice, even a strict category-like structure comes with a notion of equivalence and a canonical (or "folk") model structure; I find a free set of generators for the canonical cofibrations and that is .
The second method, if I don't already know the canonical notion of equivalence, is if I have a sufficiently nice 1-category of elementaries, like a regular skeletal Reedy category, then you can take, say, the inert monos between elementaries to define the sorts part of a FOLDS signature. Then, inspired by the idea "weak equivalences are the morphisms that preserve truth of FOLDS sentences when -algebras are interpreted as FOLDS models", but without needing to dive into the details of defining the entire FOLDS signature, I take to be maps of set-presheaves injective on the sorts that don't have equality, and pick an appropriate set of cofibrant generators to be itself.
For your second question, I think if anything can do that, it would have to be really a lot of data, simply because of the fact that one -category can be presented by many different model categories: look for example at Grothendieck's [[test categories]], which give you a mind-boggling amount of presheaf categories equipped with weak equivalences (maybe not quite a model structure, but a model structure is just something to make sure a localisation is computationally well-behaved) whose localisations are all the -category of -groupoids.
Yeah, I guess to remember the entire model structure including the objects that aren't fibrant-cofibrant could take a stuff, or maybe even a 2-stuff, rather than a structure.
Maybe what I'm looking for here anyway is just a notion of an infinity-model category, which would present a further localization of a category that already has higher structure.
I think what's really going on in the 1-categorical case is that there is a notion of "extended algebraic model category structure" which is sufficiently determined (if it exists) by the class of cofibrations plus the forgetful functor of the algebraic fibrant replacement monad, just like an ordinary model category structure is determined by its classes of cofibrations and fibrant objects. And you can turn this into an ordinary algebraic model category (with all objects fibrant) by right transferring it along its own fibrant replacement monad.
Because the fibrant replacement monad here is allowed to be "interesting", not all objects of the resulting -category are modeled by plain objects of the base category, but in the category of algebraically fibrant objects they are. And this gives you the -category of strict objects and weak maps, and (at least if the original fibrant replacement monad is nice enough) you can cofibrant-replace the fibrant replacement monad itself to get an especially nice extended algebraic model category, which has generally some new equivalence classes of objects ("weak objects").
Then the notion of complete Segal object comes in as a way to replay this whole story in the intrinsically homotopical setting, while Rezk algebras as a special case are a way to transfer particular instances of the story from the 1-categorical setting to the homotopical setting.
This makes it seem like is part of the data and can't be synthesized from the monad/pattern alone. This is certainly a valid way to look at it; we can see [[strict categories]] as involving the same monad as categories and a different class of cofibrations. However, I think there's another way to look at it, where instead of taking as defined up to its category of algebras and as separate data, we look at the intensional data of and its base category as telling us something, or rather everything, about . I think and , or alternately , contain enough "pure gauge" degrees of freedom that we can eliminate the ability to separately pick without losing any, or at least any mathematically useful, generality.
Well there is a notion of model -category, developed by Aaron Mazel-Gee over several of his earlier papers, but again it's "just" something to make sure a localisation is nicely computable and well-behaved, so indeed your question about recovering the original data could be just about recovering a reflective localisation.
Your remark about the model structure for (complete) Segal objects somehow being algebraic made me remember that there has been a recent paper by Barkan–Steinebrunner studying the "fibrant replacement" -functor, for the case of -fold Segal spaces.
I would tend to err more on the side of thinking that is additional data than thinking it can be recovered for free from the pattern/the algebraic monad. Incidentally, I think I mentioned earlier that non-complete Segal objects should correspond to what's called "flagged" objects (in the cases where we know how to make sense of it), and these strict categories of the nlab are exactly the flagged 1-categories in this sense.
Yeah, I noticed that about strict categories too. What makes me think that should be recoverable is how natural it (or even more so, ) tends to be in examples, and how unnatural flagged objects feel. It feels like there should be a way to express things so that if you want a flag you have to ask for it, rather than having to do something--but something pretty natural!--to expunge it.
Thanks for the references--I'm checking out Mazel-Gee's series on model -categories right now.
I'm curious; would you also say that is natural for the example of -uple categories?
Also, rather than "expunging" the flagging, I think it's better to think of it as forcing it to be the canonical flagging (there is the interesting phenomenon that -categories can be modelled either by [[Segal categories]] (corresponding to the "minimal" flagging by the discrete set of objects, less natural from the homotopical point of view) or by complete Segal spaces (the "maximal" flagging by the space of objects)) — but maybe that's what you meant.
Oh, hm, I think I see what you're getting at. There's a that's natural from looking at as a shape category in its own right and maybe a different one that's natural from looking at it as an -fold product?
I don't actually know — that's why I'm curious! The only completeness condition I've ever seen used for double -categories (I've never seen one at all for bigger than ) is the rather minimal one of asking for the "tight" category to be complete as a Segal space: this is only saying that, viewing a Segal -space as a Segal -object in Segal -spaces, it is in fact a Segal -object in -categories. So from this point of view, it might make some sense not to require anything more, or it may make sense to ask that the categories with objects the "loose" arrows and morphisms the squares be Rezk-complete as well (which might be the version you see as natural from looking at it as a -fold product, since it is a bit recursive?). Or there might also exist a more "symmetric" kind of completeness condition, but I don't think it could be as relevant to how double categories are thought of.
Algebraic weak factorization systems can express classes of maps that ordinary weak factorization systems can't, because they have structure instead of just properties. A notion of model categories built from the ground up on AWFS ought to likewise be able to express more -categories on a given base, because being algebraically bifibrant is a structure, not a property. This additional power is so great, in fact, that the name "model category" is no longer appropriate, as there can now be objects of the -category that are not modeled by any (bare) object of the base category. I propose the name "carrier category" for this concept, as the objects of the base category now play a role more like the carrier of an algebra or coalgebra.
The following will be a somewhat vague sketch of the concept. The main missing pieces of the puzzle are: what exactly is the proper generalization of the 2-of-3 property for weak equivalences? And: what even is a homotopy of maps in this setting? If anyone has ideas they are most welcome.
Riehl defines an algebraic model category as an ordinary model category "enhanced" with some compatible extra data. Taking this extra data on its own terms defines a pre-carrier category, to wit: a pair of algebraic factorization systems and and a map of AWFS from the first to the second. Pre-carrier categories already have some nice properties. The existence of the map means lifts of trivial cofibrations against trivial fibrations are well-defined on an algebraic level.
Using the newer technology in Bourke and Garner's AWFS I we can cofibrantly generate a pre-carrier category structure on from the data of a double category over and a double category over the as generated by . Speculatively this generates all pre-carrier categories where both AWFS are accessible.
Riehl was right in saying we should keep a focus on the weak equivalences associated with these structures. Weak equivalences in a carrier category should form a (probably concrete in the sense of AWFS I) double category over . Its arrow category should consist of the formal composites of a trivial fibration and trivial cofibration, and these should be required to support composition and lifting properties corresponding to "two out of three". The new idea with these, though is that they should act as objects as well as equivalences.
The trivial double category of weak equivalences on a category is the double category of commutative squares where two sides (the vertical sides in Bourke and Garner's terminology) are isomorphisms. An annihilator of a double category of weak equivalences is a map of double categories of weak equivalences where the codomain is trivial. The localization of a double category of weak equivalences is its initial annihilator.
The difference between this and the localization at a class of morphisms is that the functor underlying the localization no longer has to be eso. The effect of localization, essentially, is to turn the domain and codomain functors of into equivalences. The initial way to do this isn't to quotient away the vertical arrows of but rather to freely add new objects for them to land on. As in the case of model categories, the (algebraically) bifibrant objects are (just) suitable representatives up to equivalence of categories.
The ideal way to derive an -category from a carrier category isn't to come up with some ad-hoc construct, but rather to categorify the entire story and then take the localization treating the 1-categorical version as a special case of the higher version. For this we need a -categorical version of AWFS and then we can proceed along the lines of Aaron Mazel-Gee's series on -model categories.
Looks interesting! If you don’t know cisinski’s book on higher categories and homotopical algebra, the last chapter gives a more concise treatment of lots of what AMG did and some things he didn’t.
Right now I'm going through that book in detail with a reading group; we just started chapter 5 this week. Maybe I'll sneak a peek ahead for that though!
I finally have more of a grasp on what carrier categories should look like:
An algebraic homotopical category consists of two categories , and a functor such that every morphism of is Cartesian and opCartesian with respect to , and such that all isomorphisms in have Cartesian and opCartesian lifts.
A carrier category consists of an algebraic homotopical category endowed with:
The (big) remaining problem with this definition is that I don't have much idea what data and laws comprise a relative algebraic factorization system or a morphism thereof!
All I really understand is the functorial factorization part. Given functors , , a functorial factorization relative to is a functor from where the codomain looks like "an arrow in followed by an arrow in such that their images in are composable". It is required that the composition in gives the original arrow and that the "edges" of the "composable" pair match the original lifts from the object in .
For now I'd like to take a closer look at the notion of "algebraic homotopical category". First of all, in the case that is bo and faithful, this reduces to a [[category with weak equivalences]]--the [[isofibration]] condition becomes "contains all isomorphisms", and the always-Cartesian-and-opCartesian condition becomes "2 out of 3".
Secondly, there's a notion of localization for an algebraic homotopical category. Consider the (bo,ff) factorization of , which factors through the [[full image]]. Then the bicategory of functors out of whose restrictions via land in the core of their codomains should in good cases have an initial object, which we call the localization of .