# Operad

In mathematics, an operad is concerned with prototypical algebras that model properties such as commutativity or anticommutativity as well as various amounts of associativity. Operads generalize the various associativity properties already observed in algebras and coalgebras such as Lie algebras or Poisson algebras by modeling computational trees within the algebra. Algebras are to operads as group representations are to groups. An operad can be seen as a set of operations, each one having a fixed finite number of inputs (arguments) and one output, which can be composed one with others. They form a category-theoretic analog of universal algebra.[dubious ]

## History

Operads originate in algebraic topology from the study of iterated loop spaces by J. Michael Boardman and Rainer M. Vogt, and J. Peter May. The word "operad" was created by May as a portmanteau of "operations" and "monad" (and also because his mother was an opera singer). Interest in operads was considerably renewed in the early 90s when, based on early insights of Maxim Kontsevich, Victor Ginzburg and Mikhail Kapranov discovered that some duality phenomena in rational homotopy theory could be explained using Koszul duality of operads. Operads have since found many applications, such as in deformation quantization of Poisson manifolds, the Deligne conjecture, or graph homology in the work of Maxim Kontsevich and Thomas Willwacher.

## Definition

### Non-symmetric operad

A non-symmetric operad (sometimes called an operad without permutations, or a non-$\Sigma$  or plain operad) consists of the following:

• a sequence $(P(n))_{n\in \mathbb {N} }$  of sets, whose elements are called $n$ -ary operations,
• an element $1$  in $P(1)$  called the identity,
• for all positive integers $n$ , ${\textstyle k_{1},\ldots ,k_{n}}$ , a composition function
{\begin{aligned}\circ :P(n)\times P(k_{1})\times \cdots \times P(k_{n})&\to P(k_{1}+\cdots +k_{n})\\(\theta ,\theta _{1},\ldots ,\theta _{n})&\mapsto \theta \circ (\theta _{1},\ldots ,\theta _{n}),\end{aligned}}

satisfying the following coherence axioms:

• identity: $\theta \circ (1,\ldots ,1)=\theta =1\circ \theta$
• associativity:
{\begin{aligned}&\theta \circ (\theta _{1}\circ (\theta _{1,1},\ldots ,\theta _{1,k_{1}}),\ldots ,\theta _{n}\circ (\theta _{n,1},\ldots ,\theta _{n,k_{n}}))\\={}&(\theta \circ (\theta _{1},\ldots ,\theta _{n}))\circ (\theta _{1,1},\ldots ,\theta _{1,k_{1}},\ldots ,\theta _{n,1},\ldots ,\theta _{n,k_{n}})\end{aligned}}

(the number of arguments corresponds to the arities of the operations).

### Symmetric operad

A symmetric operad (often just called operad) is a non-symmetric operad $P$  as above, together with a right action of the symmetric group $\Sigma _{n}$  on $P(n)$ , satisfying the above associative and identity axioms, as well as

• equivariance: given permutations $s_{i}\in \Sigma _{k_{i}},t\in \Sigma _{n}$ ,
{\begin{aligned}&(\theta *t)\circ (\theta _{t_{1}},\ldots ,\theta _{t_{n}})=(\theta \circ (\theta _{1},\ldots ,\theta _{n}))*t;\\[2pt]&\theta \circ (\theta _{1}*s_{1},\ldots ,\theta _{n}*s_{n})=(\theta \circ (\theta _{1},\ldots ,\theta _{n}))*(s_{1},\ldots ,s_{n})\end{aligned}}

(where by abuse of notation, $t$  on the right hand side of the first equivariance relation is the element of $\Sigma _{k_{1}+\dots +k_{n}}$  that acts on the set $\{1,2,\dots ,k_{1}+\dots +k_{n}\}$  by breaking it into $n$  blocks, the first of size $k_{1}$ , the second of size $k_{2}$ , through the $n$ th block of size $k_{n}$ , and then permutes these $n$  blocks by $t$ ).

The permutation actions in this definition are vital to most applications, including the original application to loop spaces.

### Morphisms

A morphism of operads $f:P\to Q$  consists of a sequence

$(f_{n}:P(n)\to Q(n))_{n\in \mathbb {N} }$

which:

• preserves the identity: $f(1)=1$
• preserves composition: for every n-ary operation $\theta$  and operations $\theta _{1},\ldots ,\theta _{n}$ ,
$f(\theta \circ (\theta _{1},\ldots ,\theta _{n}))=f(\theta )\circ (f(\theta _{1}),\ldots ,f(\theta _{n}))$
• preserves the permutation actions: $f(x*s)=f(x)*s$ .

Operads therefore form a category denoted by ${\mathsf {Oper}}$ .

### In other categories

So far only operads have been considered in the category of sets. It is actually possible to define operads in any symmetric monoidal category (or, for non-symmetric operads, any monoidal category).

A common example would be given by the category of topological spaces, with the monoidal product given by the cartesian product. In this case, a topological operad is given by a sequence of spaces (instead of sets) $\{P(n)\}_{n\geq 0}$ . The structure maps of the operad (the composition and the actions of the symmetric groups) must then be assumed to be continuous. The result is called a topological operad. Similarly, in the definition of a morphism, it would be necessary to assume that the maps involved are continuous.

Other common settings to define operads include, for example, module over a ring, chain complexes, groupoids (or even the category of categories itself), coalgebras, etc.

### Algebraist definition

By definition, an associative algebra over a commutative ring R is a monoid object in the monoidal category $R-{\mathsf {Mod}}$  of modules over R. This definition can be extended to give a definition of an operad: namely, an operad over R is a monoid object $(T,\gamma ,\eta )$  in the monoidal category of endofunctors on $R-{\mathsf {Mod}}$  (it is a monad) satisfying some finiteness condition.[note 1]

For example, a monoid object in the category of polynomial functors is an operad. Similarly, a symmetric operad can be defined as a monoid object in the category of $\mathbb {S}$ -objects. A monoid object in the category of combinatorial species is an operad in finite sets.

An operad in the above sense is sometimes thought of as a generalized ring. For example, Nikolai Durov defines his generalized ring as a monoid object in the monoidal category of endofuctors that commutes with filtered colimit. It is a generalization of a ring since each ordinary ring R defines a monad $\Sigma _{R}:{\textbf {Set}}\to {\textbf {Set}}$  that sends a set X to the free R-module $R^{(X)}$  generated by X.

## Understanding the axioms

### Associativity axiom

"Associativity" means that composition of operations is associative (the function $\circ$  is associative), analogous to the axiom in category theory that $f\circ (g\circ h)=(f\circ g)\circ h$ ; it does not mean that the operations themselves are associative as operations. Compare with the associative operad, below.

Associativity in operad theory means that expressions can be written involving operations without ambiguity from the omitted compositions, just as associativity for operations allows products to be written without ambiguity from the omitted parentheses.

For instance, if $\theta$  is a binary operation, which is written as $\theta (a,b)$  or $(ab)$ . So that $\theta$  may or may not be associative.

Then what is commonly written $((ab)c)$  is unambiguously written operadically as $\theta \circ (\theta ,1)$  . This sends $(a,b,c)$  to $(ab,c)$  (apply $\theta$  on the first two, and the identity on the third), and then the $\theta$  on the left "multiplies" $ab$  by $c$ . This is clearer when depicted as a tree:

which yields a 3-ary operation:

However, the expression $(((ab)c)d)$  is a priori ambiguous: it could mean $\theta \circ ((\theta ,1)\circ ((\theta ,1),1))$ , if the inner compositions are performed first, or it could mean $(\theta \circ (\theta ,1))\circ ((\theta ,1),1)$ , if the outer compositions are performed first (operations are read from right to left). Writing $x=\theta ,y=(\theta ,1),z=((\theta ,1),1)$ , this is $x\circ (y\circ z)$  versus $(x\circ y)\circ z$ . That is, the tree is missing "vertical parentheses":

If the top two rows of operations are composed first (puts an upward parenthesis at the $(ab)c\ \ d$  line; does the inner composition first), the following results:

which then evaluates unambiguously to yield a 4-ary operation. As an annotated expression:

$\theta _{(ab)c\cdot d}\circ ((\theta _{ab\cdot c},1_{d})\circ ((\theta _{a\cdot b},1_{c}),1_{d}))$

If the bottom two rows of operations are composed first (puts a downward parenthesis at the $ab\quad c\ \ d$  line; does the outer composition first), following results:

which then evaluates unambiguously to yield a 4-ary operation:

The operad axiom of associativity is that these yield the same result, and thus that the expression $(((ab)c)d)$  is unambiguous.

### Identity axiom

The identity axiom (for a binary operation) can be visualized in a tree as:

meaning that the three operations obtained are equal: pre- or post- composing with the identity makes no difference. As for categories, $1\circ 1=1$  is a corollary of the identity axiom.

## Examples

### Endomorphism operad

Let V be a finite-dimensional vector space over a field k. Then the endomorphism operad ${\mathcal {End}}_{V}=\{{\mathcal {End}}_{V}(n)\}$  of V consists of

1. ${\mathcal {End}}_{V}(n)$  = the space of linear maps $V^{\otimes n}\to V$ ,
2. (composition) $\gamma (f,g_{1},\dots ,g_{n}):V^{\otimes i_{1}}\otimes \cdots \otimes V^{\otimes i_{n}}{\overset {g_{1}\otimes \cdots \otimes g_{n}}{\to }}V^{\otimes n}{\overset {f}{\to }}V$ ,
3. (identity) $\eta :k\to {\mathcal {End}}_{V}(1),\,1\mapsto \operatorname {id} _{V},$
4. (symmetric group action) $(\gamma (f,g_{1},\dots ,g_{n}))*\sigma =f\circ g_{\sigma ^{-1}(1)}\otimes \dots \otimes g_{\sigma ^{-1}(n)},\,\sigma \in \Sigma _{n}.$

If ${\mathcal {O}}$  is another operad, each operad morphism ${\mathcal {O}}\to {\mathcal {End}}$  is called an operad algebra (notice this is analogous to the fact that each R-module structure on an abelian group M amounts to a ring homomorphism $R\to \operatorname {End} (M)$ .)

Depending on applications, variations of the above are possible: for example, in algebraic topology, instead of vector spaces and tensor products between them, one uses (reasonable) topological spaces and cartesian products between them.

### "Little something" operads

A little discs operad or, little balls operad or, more specifically, the little n-discs operad is a topological operad defined in terms of configurations of disjoint n-dimensional discs inside a unit n-disc centered in the origin of Rn. The operadic composition for little 2-discs is illustrated in the figure.[clarification needed]

Originally the little n-cubes operad or the little intervals operad (initially called little n-cubes PROPs) was defined by Michael Boardman and Rainer Vogt in a similar way, in terms of configurations of disjoint axis-aligned n-dimensional hypercubes (n-dimensional intervals) inside the unit hypercube. Later it was generalized by May to little convex bodies operad, and "little discs" is a case of "folklore" derived from the "little convex bodies".

### Associative operad

Another class of examples of operads are those capturing the structures of algebraic structures, such as associative algebras, commutative algebras and Lie algebras. Each of these can be exhibited as a finitely presented operad, in each of these three generated by binary operations.

Thus, the associative operad is generated by a binary operation $\psi$ , subject to the condition that

$\psi \circ (\psi ,1)=\psi \circ (1,\psi ).$

This condition does correspond to associativity of the binary operation $\psi$ ; writing $\psi (a,b)$  multiplicatively, the above condition is $(ab)c=a(bc)$ . This associativity of the operation should not be confused with associativity of composition; see the axiom of associativity, above.

This operad is terminal in the category of non-symmetric operads, as it has exactly one n-ary operation for each n, corresponding to the unambiguous product of n terms: $x_{1}\dotsb x_{n}$ . For this reason, it is sometimes written as 1 by category theorists (by analogy with the one-point set, which is terminal in the category of sets).

### Terminal symmetric operad

The terminal symmetric operad is the operad whose algebras are commutative monoids, which also has one n-ary operation for each n, with each $S_{n}$  acting trivially; this triviality corresponds to commutativity, and whose n-ary operation is the unambiguous product of n-terms, where order does not matter:

$x_{1}\dotsb x_{n}=x_{\sigma (1)}\dotsb x_{\sigma (n)}$

for any permutation $\sigma \in S_{n}$ .

### Operads from the symmetric and braid groups

There is an operad for which each $P(n)$  is given by the symmetric group $S_{n}$ . The composite $\sigma \circ (\tau _{1},\dots ,\tau _{n})$  permutes its inputs in blocks according to $\sigma$ , and within blocks according to the appropriate $\tau _{i}$ . Similarly, there is a non-$\Sigma$  operad for which each $P(n)$  is given by the Artin braid group $B_{n}$ . Moreover, this non-$\Sigma$  operad has the structure of a braided operad, which generalizes the notion of an operad from symmetric to braid groups.

### Linear algebra

In linear algebra, vector spaces can be considered to be algebras over the operad $\mathbf {R} ^{\infty }$  (the infinite direct sum, so only finitely many terms are non-zero; this corresponds to only taking finite sums), which parametrizes linear combinations: the vector $(2,3,-5,0,\dots )$  for instance corresponds to the linear combination

$2v_{1}+3v_{2}-5v_{3}+0v_{4}+\cdots .$

Similarly, affine combinations, conical combinations, and convex combinations can be considered to correspond to the sub-operads where the terms sum to 1, the terms are all non-negative, or both, respectively. Graphically, these are the infinite affine hyperplane, the infinite hyper-octant, and the infinite simplex. This formalizes what is meant by $\mathbf {R} ^{n}$  being or the standard simplex being model spaces, and such observations as that every bounded convex polytope is the image of a simplex. Here suboperads correspond to more restricted operations and thus more general theories.

This point of view formalizes the notion that linear combinations are the most general sort of operation on a vector space – saying that a vector space is an algebra over the operad of linear combinations is precisely the statement that all possible algebraic operations in a vector space are linear combinations. The basic operations of vector addition and scalar multiplication are a generating set for the operad of all linear combinations, while the linear combinations operad canonically encodes all possible operations on a vector space.

### Commutative-ring operad

The commutative-ring operad is an operad whose algebras are commutative rings (perhaps over some base field). The Koszul-dual of it is the Lie operad and conversely.

## Constructs

Typical algebraic constructions (e.g., free algebra construction) can be extended to operads. Let C denote a module category used in the definition of an operad; e.g., it can be the category of $\mathbb {S}$ -modules for symmetric operads.

### Free operad

There is the forgetful functor ${\mathsf {Oper}}\to {\textbf {C}}$ . The free operad functor $\Gamma :{\textbf {C}}\to {\mathsf {Oper}}$  is defined as a left adjoint to the forgetful functor (this is the usual definition of free functor). Like a group or a ring, the free construction allows to express an operad in terms of generators and relations. By a free representation of an operad ${\mathcal {O}}$ , we mean writing ${\mathcal {O}}$  as a quotient of a free operad ${\mathcal {F}}=\Gamma (E)$  generated by a module E: then E is the generator of ${\mathcal {O}}$  and kernel of ${\mathcal {F}}\to {\mathcal {O}}$  is the relation.

A (symmetric) operad ${\mathcal {O}}=\{{\mathcal {O}}(n)\}$  is called quadratic if it has a free presentation such that $E={\mathcal {O}}(2)$  is the generator and the relation is contained in $\Gamma (E)(3)$ .

## Operads in homotopy theory

In Stasheff (2004), Stasheff writes:

Operads are particularly important and useful in categories with a good notion of “homotopy”, where they play a key role in organizing hierarchies of higher homotopies.