6.5 Operads and their algebras#
6.5.1 Operads design wiring diagrams#
See also Operad.
See also Context-free grammar.
6.5.2 Operads from symmetric monoidal categories#
Exercise 6.96#
For part 1.
:
For part 2.
:
For part 3.
see part (iii) of Rough Definition 6.91, which is more detailed than part (iii) of Example 6.94. In this case we have \(i=1\). The variable \(i\) can be interpreted as โthe index where we want to substitute the first tupleโ (assuming the variable \(s\) is used to mean โsubstitutedโ) so that:
Weโll have to assume:
So that:
We must make this assumption because the definition in part (iii) of Definition 6.91 is unclear about order, and because the opposite substitution just doesnโt work. This assumption also fits Example 6.93, where the author is also using the variable names \(f\) and \(g\) (suggesting that is also what he is looking at). In Example 6.93, notice the author flips the order of \(f\) and \(g\) between the equation that defines \(g โ_i f\) and the sentence below it.
Turning the cospans on their sides to compute the composite in the connected-components style of (6.47) (and adding colors only to help visually distinguish connected components):
For part 4.
:
Reveal 7S answer