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: learning: reading & references

Topic: Monoidal Closure of tensor in Poly


view this post on Zulip Ian Price (Oct 24 2026 at 17:59):

Hello,

In the poly book https://toposinstitute.github.io/poly/poly-book.pdf it is proven in section 4.5 that there is an adjoint to the parallel/dirichlet product in the category of polynomial functors. I was wondering where this was first proven.

I can see that it is in Spivak's "functorial aggregation" paper as Proposition 2.1.12 paper. The first draft of that is from 2021. https://arxiv.org/abs/2111.10968v1 However, it's not clear if that's the origin.

view this post on Zulip Jacques Carette (Oct 24 2026 at 18:45):

I would not be surprised if the core of that proof was already in Joyal's work on Species, and the case of Poly is a specialization of that.

view this post on Zulip John Baez (Oct 24 2026 at 20:49):

I don't know about Poly, but for the category of species, which are presheaves on the groupoid of finite sets, the Dirichlet product is obtained via [[Day convolution]] from a monoidal structure on the groupoid of finite sets. Thanks to how Day convolution works, the Dirichlet product thus preserves colimits in each argument, and it follows (via an adjoint functor theorem) that it has an adjoint in each argument.

view this post on Zulip Ian Price (Oct 25 2026 at 11:58):

Thanks Jacques and John,
I hadn't thought to explicitly look in the species literature. The story using Day convolution makes a lot of sense.

view this post on Zulip Orestis Melkonian (Oct 26 2026 at 11:16):

We call tensor the "Hancock" product in Scotland, so I felt obliged to point you to Hyvernat-Setzer-Hancock's work on interactions structures (a.k.a. indexed containers, a.k.a. dependent polynomial functors). So the Poly case is precisely the special case where the index set I = 1.

view this post on Zulip Chaitanya Leena Subramaniam (Nov 03 2026 at 13:24):

Apologies in advance for rehashing this. I'm not yet convinced that the category Poly\mathrm{Poly} in question is closed for the symmetric monoidal Dirichlet product. If it is true, then the argument involves something subtle that I'm not seeing. It doesn't seem to follow immediately from the closure of the Dirichlet product on species.

Consider the composite k=jik=ji of the bijective-on-objects inclusions N→core(Fin)→Fin\mathbb{N} \to \mathrm{core(Fin)}\to \mathrm{Fin}, where N\mathbb{N} is the set of natural numbers, Fin\mathrm{Fin} is a skeleton of the category of finite sets and functions, and core(Fin)\mathrm{core(Fin)} is its groupoid core.

By left Kan extension, we have a composite k!=j!i!:SetN→Species→SetFink_! = j_! i_! : \mathrm{Set}^{\mathbb{N}} \to \mathrm{Species} \to \mathrm{Set^{Fin}}, where the third category is just the category of finitary endofunctors on Set. Then the category Poly\mathrm{Poly} is the full image of k!k_!. (I understand that people consider the category POLY\mathrm{POLY} of polynomial functors of _all_ arities---and not just finitary ones---but that doesn't change what follows.)

Both ii and jj are monoidal for (N,×)(\mathbb{N},\times), (core(Fin),×)(\mathrm{core(Fin)},\times) and (Fin,×)(\mathrm{Fin},\times). Hence so are i!i_! and j!j_! (for Day convolution). This shows that the Dirichlet product in Poly\mathrm{Poly} is the image of the Dirichlet product of polynomial endofunctors qua species.

By presentability and bi-cocontinuity of Day convolution, SetFin\mathrm{Set^{Fin}} is closed symmetric monoidal for the "Dirichlet" product ⊗\otimes of finitary endofunctors on Set. If we denote the adjoint to (−⊗F)(-\otimes F) by (F⊸−)(F\multimap-), then we need to show that k!P⊸k!Qk_!P\multimap k_!Q is in the image of k!k_!.

But I can't see why this is the case. We have the formula k!R=Σn(Rn×Fin(n,−))k_! R = \Sigma_n \left(R_n \times \mathrm{Fin}(n,-)\right). I can't reduce k!P⊸k!Qk_!P\multimap k_!Q to this form. The formula provided in Proposition 2.1.12 of https://arxiv.org/abs/2111.10968v1 claims that this should hold, at least when PP has finitely many operations. I'd be grateful if someone could explain this formula to me, hopefully in a conceptual way :slight_smile:. Maybe I need to bash my head against it some more.