Let π± be symmetric monoidal and π be π±-enriched and monoidal. Given any two enriched functors F,βGβ:βπopβββπ± their Day convolution is the functor (Fβ ββ G)[A]β=ββ«(B1,βB2)βββπβ Γβ πHomπ(B1β ββ B2,βA)β ββ F(B1)β ββ G(B2)
In the case of set-enrichment
(Mβ ββ N)(A)β=ββ«BβββGr(FSet)M(B)β ββ NβDayB
where for any functor FβDayB[A]ββ ββ¨fβ:βAβββBβ¨bβββBF[fβ1(b)]
The idea of this is that f is any set map, and the fibers (preimages of each b) tell you what sits at the input of each operation
Let C be a set. Define S[C] to be the category whose objects are pairs (A,βf), where A is a finite set and fβ:βAβββC is a set map. Morphisms (A,βf)βββ(B,βg) in this category are maps Οβ:βAβββB such that fβ=βgβ ββ Ο
A symmetric sequence is a functor Fβ:βS[C]β Γβ Cβββπ±
The category S[C] is really almost the category of elements of the presheaf Morβ(β,βC)
Grothendieck construction:
Let C be a set. The groupoid S[C] has as objects pairs (xΜ,βΟ) where xΜ is a finite sequence of elements of C of length nββ₯β0 , and ΟβββSn is a permuation.
The morphisms are all permutations, with the action (xΜ,βΟ)
finite sequences (including empty sequences) of elements of C, and as morphisms all bijections on the indices.
A symmetric C-sequence in a symmetric monoidal category π± is a functor Fβ:βS[C]opβ Γβ Cβββπ±
Permutations: Since S[C] has all bijections,
each of the permutation groups acts on all the appropriately sized
sequences.
Bijections: The action of a bijection
Ο is defined on the indices.
If we have a constant sequence
The maps have to have two indices, to allow you to utilize the action of the symmetric group. If we think about it in terms of string diagrams, one of the indices corresponds to the order that you write terms down at the bottom of the tree, while the other corresponds to the order that you twist the wires into above your sequence.