You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I hadn't meant to get drawn in this deep into the study of [[heaps]], but some people are posing nice conjectures about them after I posted about them on Mastodon, so I feel a duty to record those conjectures.
First, while I believe the category of heaps is equivalent to the category of group-torsor pairs, there are some questions about the nature of the latter category: what it actually is, and whether it can be defined using the Grothendieck construction.
I think the category of group-torsor pairs, say , works like this:
It would be nice to verify that this really is equivalent to the category of heaps as claimed in the nLab article [[heap]]. There shouldn't be anything very hard about checking this.
But then there's the question of how this category is related to all the categories of -torsors. In
LeeMph raised this question:
Question. Is there a pseudofunctor from to sending each group to the category , either covariant or contravariant, such that performing the Grothendieck construction stitches together all the category to form the category ?
We discussed it a while, and his latest verdict is negative, but he thinks something a bit fancier will work. So a better version of the question above may be:
Question. How exactly can we get from all the categories ?
By the way, if anyone had the insane amount of energy necessary to do this, it would be nice to investigate this in a general topos, since the concept of 'torsor' becomes very interesting then: it more or less subsumes the concept of [[principal bundle]], which is very important in geometry.
Indeed maybe someone has already studied it at that level of generality!
Here are some potential directions (which I did not have time to check thoroughly yet, but just wanted to share some intuitions as I have to go):
Second - sorry, I'm just plowing ahead here before I forget - there's the question of what's the free group on a heap. There's a forgetful functor
sending any group to the underlying set of made into a heap with operation . This must have a left adjoint (by general nonsense about Lawvere theories), so:
Question. Concretely as possible, what is the left adjoint of ?
And Oscar Cunningham proposed an answer. First, recall that there's a functor
sending any heap to the group of all maps from to itself, where are arbitrary elements of . (If we think of a heap as a group-torsor pair, this functor picks out the group in that pair.)
I foolishly ventured that the left adjoint of was this functor , but Oscar improved that guess:
Conjecture. The left adjoint of sends any heap to the group , where is the "free product", or coproduct, of groups.
He motivated this with a nice analogy: the left adjoint of the forgetful functor from real vector spaces to affine spaces takes any affine space to , where the extra dimension arises from freely putting in an origin.
Rémy Tuyéras said:
- can we define a -torsor as a functor where is the limit sketch (Lawvere theory?) made of Cartesian products and group homomorphism between them?
I will just adjust this statement by proposing to take to be the Lawvere theory (EDIT: product sketch):
What does it mean to say you've got a Lawvere theory whose only objects are and ? I must be misinterpreting you somehow.
Thanks, edited to terminology
I conjecture that what we have been thinking of as the division is actually a functor . If instead of considering a ternary operator , you curry it, you get the signature and it works exactly like a left group action. These diagrams make this clearest:
(I was using for John's ; the set on which acts) Okay, gotta run, but I think the "transitive, free" part comes in when you need to establish equivalence. E.g. so that the effective action is not that of a subgroup of
Just to finish the details... in case it is useful...
- (if yes then) denoting the reflective subcategory restricted to limit preserving functors, is the mapping a functor (or )?
To do this, I would define a functor by
This defines a morphism in because is a group homomorphism. This morphism also preserves the limit by definition.
Now, the functor gives us a functor . The functor is a subfunctor of the more obvious functor which maps a group to the functor category .
Finally, the Grothendieck construction for the functor , usually denoted as , as defined as follows:
I'm not clear on what the functor is supposed to be, @Rémy Tuyéras. I get lost in all the details. Can you say in words what category it's supposed to map a group to?
Ah right, I wrote but I meant .
In a few words, maps a group to the category of limit preserving functors where is the product sketch I defined a few posts earlier
I’m confused why you need to go through finite limit sketches. If is supposed to be equivalent to , what stops you from defining the functor as mapping to directly?
Or rather, if there’s a problem defining this as a (pseudo)functor explicitly (I think I can see it), there should still be a problem when you phrase it in terms of sketches
Rémy Tuyéras said:
In a few words, maps a group to the category of limit preserving functors where is the product sketch I defined a few posts earlier.
Nathan seems to be saying it in fewer words: maps a group to the category of -torsors. Is that the goal here?
(I'm a bit confused by why you're using limit preserving functors out of a product sketch, instead of product preserving functors out of a product sketch or limit preserving functors out of a limit sketch.)
John Baez said:
(I'm a bit confused by why you're using limit preserving functors out of a product sketch, instead of product preserving functors out of a product sketch or limit preserving functors out of a limit sketch.)
@John Baez This is an abuse of language on my part and my fault for trying to go too fast. I usually see a limit sketch as a pair where is a small category and is a set of cones in . Here, I define a cone as a natural transformation of the form where:
If all the small categories associated with the cones in are discrete categories, then I would tend to call a product sketch.
I define a model for a limit sketch as a functor sending every cone in to a limit cone in .
While this is one definition, there are other common definitions for limit sketches. For instance, one might assume that the cones in must be limit cones in . In that case, the models send the limit cones in to limit cones in .
Based on my experience and interactions, I usually prefer to use the term limit-preserving to evoke the idea that these functors send the "equipped (synthetic) limits" to limits in , avoiding potential confusion with the various meanings of "model". But in this case, that did not help me much with the clarity :upside_down:
(Also, I would love to hear how others define limit sketches so I can feel more comfortable with the terminology)
Nathan Corbyn said:
I’m confused why you need to go through finite limit sketches. If is supposed to be equivalent to , what stops you from defining the functor as mapping to directly?
That's a good point, and I see where you are coming from. But given why we are interested in -torsors, I think it is useful to first understand them as models for limit sketches. Heaps can also be seen as models for limit sketches pretty straightforwardly (same with groups). Plus, if you check out the nLab page on [[heaps]], you will see that converting -torsors to heaps and back mostly involves playing around with operations, hinting at deeper theoretical connections (as in theory for models).
If we are going to talk about the yoga of techniques that let us switch between them, I would rather get the big picture in the same language. That is why I lean towards limit sketches -- they would set the stage for understanding how groups, torsors, and heaps all fit together with their left adjoints.
And maybe I should add that limit sketches are a very natural language to build those left adjoints, even giving us formulas, often useful for end, co-end and transfinite calculi.
For anyone interested in the topic, see Categories of continuous functors, I as a starting point.
I haven’t checked this carefully but I think it’s true that . There’s a fully faithful functor from the delooping to torsors coming from taking ’s action on itself (Yoneda lemma) and (assuming torsors are assumed to be non-empty) then every tosor admits an isomorphism with as a set. The bit I haven’t checked is whether this isomorphism can always be made into an equivariant map.
In which case, we’re really talking about the functor sending each group to its delooping and how this compares to .
Question. Concretely as possible, what is the left adjoint of U:Grp→Heap?
And Oscar Cunningham proposed an answer.
The answer Oscar gave is the answer I would have given (without trying too hard to be concrete). In general, if you have monads on a category with reflexive coequalizers, with a monad morphism , and denotes the forgetful functor between the categories of algebras that is induced by the monad morphism, then the left adjoint to this forgetful functor takes an -algebra to the coequalizer of a pair of arrows
This is just like the situation for writing down the tensor product of a right -module with a left -module , as a coequalizer:
.
Only this time, acts on on the right by a composite , and on the left on an -algebra by the algebra structure .
Think for example of the way that the universal enveloping algebra of a Lie algebra works: by taking a certain quotient of the tensor algebra (which plays the role of ). Oscar's proposal is working exactly the same way.
Nathan Corbyn said:
I haven’t checked this carefully but I think it’s true that
Yes, that's true. From one point of view the point of torsors is to take , which has one object and one morphism for each element of , and find an equivalent category with objects that are sets with extra structure - namely -torsors - and structure-preserving maps between them. It gives a new and fruitful outlook.