symmetric monoidal (∞,1)-category of spectra
An operad is a gadget used to describe algebraic structures in symmetric monoidal categories. An operad is like a Lawvere theory in that it can be used to describe structures having finitary operations obeying equational laws. However, unlike Lawvere theories, operads can be applied to general symmetric monoidal categories where the tensor product might not be the cartesian product.
Actually the notion of operad (and allied notions such as PROP, club?, multicategory and so on) come in many flavors. Originally used in algebraic topology to provide a systematic formalism for describing the internal operations which exist on iterated loop spaces, the basic idea is quite flexible and adaptable to many categorical situations, and the importance of operads continues to grow.
The original definition is due to J.P. May and was given in his book The Geometry of Iterated Loop Spaces. Since the detailed definition is available from many sources, we will just sketch May’s definition; in the section following this, we give a more detailed higher-level description which generalizes in a number of directions.
Let be a symmetric monoidal category. A ( permutative or symmetric ) operad in consists of objects of indexed over the natural numbers which we intuitively think of as “objects that parametrize the -ary operations of an algebraic theory” equipped with the following extra structure:
Right actions of symmetric groups ;
An unit which we think of as picking out the identity map as unary operation;
Composition operations
which we think of as the result of plugging the outputs of operations into a -ary operation , to produce a new operation .
These data are subject to obvious identities such as associativity of composition, unit laws, and compatibility of composition with symmetric group actions. For example, the unit laws say that the evident composite
is the identity map, as is
Compatibility with symmetric group actions means that for each element , the composition operation
coequalizes a pair of automorphisms
where acts on the big tensor product on the left by permuting tensor factors in the obvious way. If has suitable colimits, this condition could be expressed in terms of tensor products over .
The associativity condition will be left for others to fill in.
An algebra over an operad in is just a semantics for interpreting the as objects of actual -ary operations on an object . That is, an -algebra structure on an object in consists of a collection of maps
which intuitively is a mapping like this:
so that “elements” of are interpreted as as -ary operations on . These data are subject to some natural conditions which implement this idea.
Perhaps the quickest way to define it is to suppose that is symmetric monoidal closed, and work by way of parallel to how representations or modules work. Just as an -module (over a ring ) can be defined as a ring homomorphism
where the hom here is an internal hom of abelian groups, called an endomorphism ring, so there is such a thing as an endomorphism operad attached to any object in a symmetric monoidal closed category, and an -algebra over an operad is the same thing as an operad morphism
to an endomorphism operad (also called a tautological operad).
Now that the clue has been given, the rest is not hard to figure out. The components of the endomorphism operad are defined by
Certainly acts on the right (that is, contravariantly) on the hom-object . And clearly there is a canonical map to play the role of the unit. The operad composition involves an instance of enriched functoriality of iterated tensor products: there is a map
The endomorphism operad composition is obtained by tensoring this last arrow with on the left, and composing the result with ordinary internal hom-composition
A closely related way of defining an -algebra is via the monad attached to an operad, which we will describe below.
We describe here a compact one-sentence definition of operad first worked out by G.M. Kelly, after a few preliminaries which are important in their own right. The treatment is essentially an exercise in enriched category theory and the formalism of Day convolution. We will work this out fully in the case of ordinary category theory first, that is for categories enriched in ; the case for categories enriched in a complete, cocomplete, symmetric monoidal closed is completely parallel.
Let be the groupoid of finite cardinals and bijections thereon. Since is the underlying groupoid of the category of finite cardinals and functions between them, the tensor product given by the coproduct on restricts to a symmetric monoidal product on . Under this symmetric monoidal structure, may be characterized as the free symmetric strict monoidal category on one generator.
The symmetric monoidal product on extends along the Yoneda embedding to a symmetric monoidal product on the category of presheaves on ; this is an instance of Day convolution. The presheaf category is cocomplete, and Day convolution is cocontinuous in each of its separate arguments ; we say in that case that is symmetric monoidally cocomplete.
is also a skeleton of the category of finite sets and bijections; a functor (or what is more or less the same thing, a functor ) is called a species. The Day convolution product on the category of species may be described by the rule
where the sum is over all ways of partitioning the finite set into two (possibly empty) parts.
According to the yoga of presheaf categories and Day convolution, given a symmetric monoidally cocomplete category , a symmetric monoidal functor
extends uniquely up to isomorphism to a symmetric monoidal cocontinuous functor
taking a presheaf to the weighted colimit . Putting items 1. and 2. together, we may therefore describe universally up to equivalence as the free symmetric monoidally cocomplete category on a single generator.
In general, weighted colimits may be described by coend formulas; here
where denotes the tensoring of a set with an object , that is the coproduct of an -indexed set of copies of . The coend here indicates a coequalizer
where one of the parallel arrows involves right actions of symmetric groups on the , and the other involves left actions of on objects . In other words, the coend in this instance may be described as a sum of tensor products:
The aforementioned universal property of with its convolution product may be more explicitly described as follows: given a symmetric monoidally cocomplete category and an object therein, there exists up to isomorphism a unique symmetric monoidal cocontinuous functor which sends to . This functor takes a presheaf to the following object of :
For instance, when is the symmetric monoidally cocomplete category and is a set, this formula
is the value at of what Joyal calls the analytic functor associated to a species , proposed as the categorification of exponential generating functions. The fact that is symmetric monoidal (cocontinuous) means that there is a canonical isomorphism
In other words, behaves like a categorified version of Fourier transform, taking convolution products to ordinary (pointwise) products.
In detail: a species induces a symmetric monoidal cocontinuous functor
The -fold Day tensor power of is given (in the language of species) by the formula
where we sum over all ways of breaking up a finite set into blocks, some possibly empty. Thus we have an explicit description of the substitution product,
and it is clear from our discussion above that substitution is a monoidal product.
We are at last ready for the one-sentence definition:
A (-based) operad is a monoid in the monoidal category .
We can get different flavors of operad by considering different notions of monoidal category. For instance, for the theory of monoidal categories, the discrete category plays the role of the free (strict) monoidal category on one generator, and the free monoidally cocomplete category on one generator. Similarly, for braided monoidal categories, we have the braid category , and is the free braided monoidally cocomplete category on one generator. Again, for cartesian categories, we have (the opposite of finite sets and functions) as the free cartesian category on one generator, and is the free cartesian monoidally cocomplete category on one generator. In each of these cases we get a corresponding notion of operad by following the above treatment mutatis mutandis: nonpermutative operads, braided operads, cartesian operads (better known as Lawvere theories).
All of the above carries over to the enriched setting, where we work over a complete, cocomplete symmetric monoidal closed base category . Here ordinary categories (like ) are viewed as -enriched by a simple change of base: change from hom-sets to hom-objects by applying the change of base functor
that takes a set to the -fold coproduct , where is the monoidal unit of .
There are still other notions of operad; see for example the discussion of -operads under the entry multicategory for more details. See also the general framework by Hyland, Fiore, and others to be filled in.
In still other directions, there are for example notions of cyclic operad and modular operad. Anyone want to take these up?
…
this list of examples should eventually be collected in a table of contents on operad theory
generalizations:
For a discrete group, write for the category of objects of equipped with a -action. For symmetric monoidal this is again a symmetric monoidal category and the forgetful functor is symmetric monoidal.
The category of collections of is
Notice that both and are the trivial group.
So a -operad is a special -collection with extra structure relating its components. This gives an evident forgetful functor and its left adjoint, the free operad functor
This is for instance used to define the model structure on operads by transfer along this adjunction from a model struucture on .
The free operad functor may more explcitly be described as follows (for instance BerMor03 section 5.8)
Let be the core of the category of planar rooted trees. Write
for the -corolla (the tree with a single vertex, inputs and its unique output root)
for any tree with -ary root vertex let be the sub-trees such that .
Then every defines a functor by the inductive formula
Let moreover be the functor that sends a tree to the set of numbering of its incoming edges, and let be given by postcomposition with .
Then the free operad on a collection is the coend
Let be a cartesian monoidal category and the terminal collection, which is the terminal object in each degree, with, necessarily, trivial -action.
The free operad on this should be the -A-infinity operad it consists in degree of precisely -operations per -ary planar tree. So every planar -ary tree is regarded by the operad as one distinct operation to multiply elements, and freely adjoining to each tree a -action amounts to not dividing out any commutativity symmetry on these operations.
If the symmetric monoidal category that the operads under consideration are enriched in carries the structure of a monoidal model category, then under suitable conditions there is also the structure of a model category on the category of -operads. This is important for the notion of homotopy algebra over an operad, such as - and -algebras.
See
The definition is originally due to