Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: theory: mathematics

Topic: A couple of conjectures on heaps


view this post on Zulip John Baez (Jun 28 2024 at 12:37):

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.

view this post on Zulip John Baez (Jun 28 2024 at 12:42):

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 Tors\mathsf{Tors}, works like this:

view this post on Zulip John Baez (Jun 28 2024 at 12:45):

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 Tors\mathsf{Tors} is related to all the categories GTorsG \mathsf{Tors} of GG-torsors. In GTorsG \mathsf{Tors}

view this post on Zulip John Baez (Jun 28 2024 at 12:49):

LeeMph raised this question:

Question. Is there a pseudofunctor from Grp\mathsf{Grp} to Cat\mathsf{Cat} sending each group GG to the category GTorsG \mathsf{Tors}, either covariant or contravariant, such that performing the Grothendieck construction stitches together all the category GTorsG \mathsf{Tors} to form the category Tors\mathsf{Tors}?

view this post on Zulip John Baez (Jun 28 2024 at 12:51):

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 Tors\mathsf{Tors} from all the categories GTorsG \mathsf{Tors}?

view this post on Zulip John Baez (Jun 28 2024 at 12:55):

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.

view this post on Zulip John Baez (Jun 28 2024 at 12:56):

Indeed maybe someone has already studied it at that level of generality!

view this post on Zulip Rémy Tuyéras (Jun 28 2024 at 12:58):

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):

view this post on Zulip John Baez (Jun 28 2024 at 13:05):

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

U:GrpHeapU : \mathsf{Grp} \to \mathsf{Heap}

sending any group GG to the underlying set of GG made into a heap with operation t(a,b,c)=ab1ct(a,b,c) = a b^{-1} c. This must have a left adjoint (by general nonsense about Lawvere theories), so:

Question. Concretely as possible, what is the left adjoint of U:GrpHeapU : \mathsf{Grp} \to \mathsf{Heap} ?

And Oscar Cunningham proposed an answer. First, recall that there's a functor

Str:HeapGrp \mathrm{Str}: \mathsf{Heap} \to \mathsf{Grp}

sending any heap HH to the group of all maps ht(a,b,h)h \mapsto t(a,b,h) from HH to itself, where a,ba,b are arbitrary elements of HH. (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 U:GrpHeapU : \mathsf{Grp} \to \mathsf{Heap} was this functor Str\mathsf{Str}, but Oscar improved that guess:

Conjecture. The left adjoint of U:GrpHeapU : \mathsf{Grp} \to \mathsf{Heap} sends any heap HH to the group ZStr(H)\mathbb{Z} \ast \mathsf{Str}(H), where \ast is the "free product", or coproduct, of groups.

view this post on Zulip John Baez (Jun 28 2024 at 13:09):

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 Rn\mathbb{R}^n to Rn+1\mathbb{R}^{n+1}, where the extra dimension arises from freely putting in an origin.

view this post on Zulip Rémy Tuyéras (Jun 28 2024 at 13:38):

Rémy Tuyéras said:

I will just adjust this statement by proposing to take TGT_G to be the Lawvere theory (EDIT: product sketch):

view this post on Zulip John Baez (Jun 28 2024 at 13:48):

What does it mean to say you've got a Lawvere theory whose only objects are G0G^0 and G1G^1? I must be misinterpreting you somehow.

view this post on Zulip Rémy Tuyéras (Jun 28 2024 at 13:50):

Thanks, edited to terminology

view this post on Zulip Eric M Downes (Jun 28 2024 at 14:55):

I conjecture that what we have been thinking of as the division v:X2Gv:X^2\to G is actually a functor V:HeapTorsV:{\sf Heap\to Tors}. If instead of considering a ternary operator t:X3Xt:X^3\to X, you curry it, you get the signature t~:X2XX\tilde{t}:X^2\to X^X and it works exactly like a left group action. These diagrams make this clearest:

(I was using YY for John's HH; the set on which GG 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 GG

view this post on Zulip Rémy Tuyéras (Jun 28 2024 at 16:24):

Just to finish the details... in case it is useful...

Part 1 - Functorially mapping a group to a product sketch

To do this, I would define a functor T:GrpCatT:\mathsf{Grp} \to \mathsf{Cat} by

This defines a morphism TGTHT_G \to T_H in Cat\mathsf{Cat} because uu is a group homomorphism. This morphism also preserves the limit G0=1G^0 = \mathbf{1} by definition.

Part 2 - Functorially mapping a group to a category of models (for a given product sketch)

Now, the functor T:GrpCatT:\mathsf{Grp} \to \mathsf{Cat} gives us a functor T=Mod(T()):GrpopCat\mathcal{T} = \mathsf{Mod}(T(-)):\mathsf{Grp}^{\mathsf{op}} \to \mathbf{Cat}. The functor T\mathcal{T} is a subfunctor of the more obvious functor [T(),Set]:GrpopCat[T(-),\mathsf{Set}]:\mathsf{Grp}^{\mathsf{op}} \to \mathbf{Cat} which maps a group GG to the functor category [T(G),Set][T(G),\mathsf{Set}].

view this post on Zulip Rémy Tuyéras (Jun 28 2024 at 16:49):

Part 3 - Checking the Grothendieck construction

Finally, the Grothendieck construction for the functor T:GrpopCat\mathcal{T}:\mathsf{Grp}^{\mathsf{op}} \to \mathbf{Cat}, usually denoted as T\int \mathcal{T}, as defined as follows:

view this post on Zulip John Baez (Jun 28 2024 at 21:42):

I'm not clear on what the functor T ⁣:GrpopCat\mathcal{T} \colon \mathsf{Grp}^{\rm{op}} \to \mathbf{Cat} 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?

view this post on Zulip Rémy Tuyéras (Jun 28 2024 at 21:57):

Ah right, I wrote [TG,Set][T_G,\mathsf{Set}] but I meant Mod(TG)\mathsf{Mod}(T_G).

In a few words, T\mathcal{T} maps a group GG to the category of limit preserving functors TGSetT_G \to \mathbf{Set} where TGT_G is the product sketch I defined a few posts earlier

view this post on Zulip Nathan Corbyn (Jun 29 2024 at 11:09):

I’m confused why you need to go through finite limit sketches. If Mod(TG)\mathrm{Mod}(T_G) is supposed to be equivalent to GTorG\mathrm{-Tor}, what stops you from defining the functor as mapping GG to GTorG\mathrm{-Tor} directly?

view this post on Zulip Nathan Corbyn (Jun 29 2024 at 11:11):

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

view this post on Zulip John Baez (Jun 29 2024 at 12:40):

Rémy Tuyéras said:

In a few words, T\mathcal{T} maps a group GG to the category of limit preserving functors TGSetT_G \to \mathbf{Set} where TGT_G is the product sketch I defined a few posts earlier.

Nathan seems to be saying it in fewer words: T\mathcal{T} maps a group GG to the category of GG-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.)

view this post on Zulip Rémy Tuyéras (Jun 29 2024 at 14:25):

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 (C,L)(C, L) where CC is a small category and LL is a set of cones in CC. Here, I define a cone as a natural transformation of the form ΔI(X)F\Delta_I(X) \Rightarrow F where:

If all the small categories II associated with the cones in LL are discrete categories, then I would tend to call (C,L)(C, L) a product sketch.

I define a model for a limit sketch as a functor M:CSetM: C \to \mathbf{Set} sending every cone a:ΔI(X)Fa:\Delta_I(X) \Rightarrow F in LL to a limit cone M(a):ΔI(M(X))MFM(a):\Delta_I(M(X)) \Rightarrow M \circ F in Set\mathbf{Set}.

While this is one definition, there are other common definitions for limit sketches. For instance, one might assume that the cones in LL must be limit cones in CC. In that case, the models send the limit cones in LL to limit cones in Set\mathsf{Set}.

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 Set\mathbf{Set}, 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)

view this post on Zulip Rémy Tuyéras (Jun 29 2024 at 14:43):

Nathan Corbyn said:

I’m confused why you need to go through finite limit sketches. If Mod(TG)\mathrm{Mod}(T_G) is supposed to be equivalent to GTorG\mathrm{-Tor}, what stops you from defining the functor as mapping GG to GTorG\mathrm{-Tor} directly?

That's a good point, and I see where you are coming from. But given why we are interested in GG-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 GG-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.

view this post on Zulip Rémy Tuyéras (Jun 29 2024 at 14:55):

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.

view this post on Zulip Nathan Corbyn (Jun 29 2024 at 15:45):

I haven’t checked this carefully but I think it’s true that GTorsBGG\mathrm{-Tors} \simeq \mathbf{B}G. There’s a fully faithful functor from the delooping to torsors coming from taking GG’s action on itself (Yoneda lemma) and (assuming torsors are assumed to be non-empty) then every tosor admits an isomorphism with GG 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 B:GrpCat\mathbf{B} : \mathrm{Grp} \to \mathrm{Cat} sending each group to its delooping and how this compares to Tors\mathrm{Tors}.

view this post on Zulip Todd Trimble (Jun 29 2024 at 18:26):

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 G,HG, H on a category C\mathbf{C} with reflexive coequalizers, with a monad morphism ϕ:HG\phi: H \to G, and CGCH\mathbf{C}^G \to \mathbf{C}^H 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 HH-algebra XX to the coequalizer of a pair of arrows

GHXGλρXGX.GHX \overset{\rho X}{\underset{G\lambda}{\rightrightarrows}} GX.

This is just like the situation for writing down the tensor product of a right RR-module YY with a left RR-module XX, as a coequalizer:

YRXYXYRXY \otimes R \otimes X \rightrightarrows Y \otimes X \to Y \otimes_R X.

Only this time, HH acts on GG on the right by a composite GHGϕGGμGGH \overset{G\phi}{\to} GG \overset{\mu}{\to} G, and on the left on an HH-algebra XX by the algebra structure λ:HXX\lambda: HX \to X.

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 GXGX). Oscar's proposal is working exactly the same way.

view this post on Zulip John Baez (Jun 29 2024 at 19:27):

Nathan Corbyn said:

I haven’t checked this carefully but I think it’s true that GTorsBGG\mathrm{-Tors} \simeq \mathsf{B}G

Yes, that's true. From one point of view the point of torsors is to take BG\mathsf{B}G, which has one object and one morphism for each element of GG, and find an equivalent category with objects that are sets with extra structure - namely GG-torsors - and structure-preserving maps between them. It gives a new and fruitful outlook.