Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a21fc3cde95252f1

Jump to content

// Workers AI · dad joke modeWhat did day convolution say? "I'm summed up nicely.

From Wikipedia, the free encyclopedia

In mathematics, specifically in category theory, Day convolution is an operation on functors that can be seen as a categorified version of function convolution. It was first introduced by Brian Day in 1970[1] in the general context of enriched functor categories.

Day convolution gives a symmetric monoidal structure on for two symmetric monoidal categories .

Another related version is that Day convolution acts as a tensor product for a monoidal category structure on the category of functors over some monoidal category .

Definition

[edit]

First version

[edit]

Given for two symmetric monoidal , we define their Day convolution as follows.

It is the left kan extension along of the composition

Thus evaluated on an object , intuitively we get a colimit in of along approximations of as a pure tensor

Left kan extensions are computed via coends, which leads to the version below.

Enriched version

[edit]

Let be a monoidal category enriched over a symmetric monoidal closed category . Given two functors , we define their Day convolution as the following coend.[2]

If is symmetric, then is also symmetric. We can show this defines an associative monoidal product:

References

[edit]
  1. Day, Brian (1970). "On closed categories of functors". Reports of the Midwest Category Seminar IV, Lecture Notes in Mathematics. 139: 1–38.
  2. Loregian, Fosco (2021). (Co)end Calculus. p. 51. arXiv:1501.02503. doi:10.1017/9781108778657. ISBN 9781108778657. S2CID 237839003.
[edit]