operads

References

Summary

Definitions

Day convolution

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

Composition product

(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

Symmetric sequence

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 → 𝒱

Intuition

The category S[C] is really almost the category of elements of the presheaf Mor (βˆ’, C)

Grothendieck construction:

Symmetric sequence

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 → 𝒱

Intuition

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.

Theorems

Examples