Operad

Generalization of associativity properties

In mathematics, an operad is a structure that consists of abstract operations, each one having a fixed finite number of inputs (arguments) and one output, as well as a specification of how to compose these operations. Given an operad  O {\displaystyle O} , one defines an algebra over  O {\displaystyle O} to be a set together with concrete operations on this set which behave just like the abstract operations of  O {\displaystyle O} . For instance, there is a Lie operad L {\displaystyle L} such that the algebras over  L {\displaystyle L} are precisely the Lie algebras; in a sense  L {\displaystyle L} abstractly encodes the operations that are common to all Lie algebras. An operad is to its algebras as a group is to its group representations.

## History

[edit]

Operads originate in algebraic topology; they were introduced to characterize iterated loop spaces by J. Michael Boardman and Rainer M. Vogt in 1968[1][2] and by J. Peter May in 1972.[3]

Martin Markl, Steve Shnider, and Jim Stasheff write in their book on operads:[4]

"The name operad and the formal definition appear first in the early 1970's in J. Peter May's "The Geometry of Iterated Loop Spaces", but a year or more earlier, Boardman and Vogt described the same concept under the name categories of operators in standard form, inspired by PROPs and PACTs of Adams and Mac Lane. In fact, there is an abundance of prehistory. Weibel [Wei] points out that the concept first arose a century ago in A.N. Whitehead's "A Treatise on Universal Algebra", published in 1898."

The word "operad" was created by May as a portmanteau of "operations" and "monad" (and also because his mother was an opera singer).[5]

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.[6][7] Operads have since found many applications, such as in deformation quantization of Poisson manifolds, the Deligne conjecture,[8] or graph homology in the work of Maxim Kontsevich and Thomas Willwacher.

## Intuition

[edit]

Suppose  X {\displaystyle X} is a set and for  n ∈ N {\displaystyle n\in \mathbb {N} } we define

P ( n ) := { f : X n -> X } {\displaystyle P(n):=\\{f\colon X^{n}\to X\\}} ,

the set of all functions from the cartesian product of  n {\displaystyle n} copies of  X {\displaystyle X} to  X {\displaystyle X} .

We can compose these functions: given  f ∈ P ( n ) {\displaystyle f\in P(n)} ,  f 1 ∈ P ( k 1 ) , … , f n ∈ P ( k n ) {\displaystyle f_{1}\in P(k_{1}),\ldots ,f_{n}\in P(k_{n})} , the function

f ∘ ( f 1 , … , f n ) ∈ P ( k 1 + ⋯ + k n ) {\displaystyle f\circ (f_{1},\ldots ,f_{n})\in P(k_{1}+\cdots +k_{n})}

is defined as follows: given  k 1 + ⋯ + k n {\displaystyle k_{1}+\cdots +k_{n}} arguments from  X {\displaystyle X} , we divide them into  n {\displaystyle n} blocks, the first one having  k 1 {\displaystyle k_{1}} arguments, the second one  k 2 {\displaystyle k_{2}} arguments, etc., and then apply  f 1 {\displaystyle f_{1}} to the first block,  f 2 {\displaystyle f_{2}} to the second block, etc. We then apply  f {\displaystyle f} to the list of  n {\displaystyle n} values obtained from  X {\displaystyle X} in such a way.

We can also permute arguments, i.e. we have a right action ∗ {\displaystyle *} of the symmetric group S n {\displaystyle S_{n}} on  P ( n ) {\displaystyle P(n)} , defined by

( f ∗ s ) ( x 1 , … , x n ) = f ( x s − 1 ( 1 ) , … , x s − 1 ( n ) ) {\displaystyle (f*s)(x_{1},\ldots ,x_{n})=f(x_{s^{-1}(1)},\ldots ,x_{s^{-1}(n)})}

for  f ∈ P ( n ) {\displaystyle f\in P(n)} ,  s ∈ S n {\displaystyle s\in S_{n}} and  x 1 , … , x n ∈ X {\displaystyle x_{1},\ldots ,x_{n}\in X} .

The definition of a symmetric operad given below captures the essential properties of these two operations  ∘ {\displaystyle \circ } and  ∗ {\displaystyle *} .

## Definition

[edit]

### Non-symmetric operad

[edit]

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

* a sequence  ( P ( n ) ) n ∈ N {\displaystyle (P(n))_{n\in \mathbb {N} }} of sets, whose elements are called  n {\displaystyle n} -ary operations,
* an element  1 {\displaystyle 1} in  P ( 1 ) {\displaystyle P(1)} called the identity,
* for all positive integers  n {\displaystyle n} ,  k 1 , … , k n {\textstyle k_{1},\ldots ,k_{n}} , a composition function

∘ : P ( n ) × P ( k 1 ) × ⋯ × P ( k n ) -> P ( k 1 + ⋯ + k n ) ( θ , θ 1 , … , θ n ) ↦ θ ∘ ( θ 1 , … , θ n ) , {\displaystyle {\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:  θ ∘ ( 1 , … , 1 ) = θ = 1 ∘ θ {\displaystyle \theta \circ (1,\ldots ,1)=\theta =1\circ \theta }
* associativity:

θ ∘ ( θ 1 ∘ ( θ 1 , 1 , … , θ 1 , k 1 ) , … , θ n ∘ ( θ n , 1 , … , θ n , k n ) ) = ( θ ∘ ( θ 1 , … , θ n ) ) ∘ ( θ 1 , 1 , … , θ 1 , k 1 , … , θ n , 1 , … , θ n , k n ) {\displaystyle {\begin{aligned}&\theta \circ {\Big (}\theta _{1}\circ (\theta _{1,1},\ldots ,\theta _{1,k_{1}}),\ldots ,\theta _{n}\circ (\theta _{n,1},\ldots ,\theta _{n,k_{n}}){\Big )}\\\={}&{\Big (}\theta \circ (\theta _{1},\ldots ,\theta _{n}){\Big )}\circ (\theta _{1,1},\ldots ,\theta _{1,k_{1}},\ldots ,\theta _{n,1},\ldots ,\theta _{n,k_{n}})\end{aligned}}}

### Symmetric operad

[edit]

A symmetric operad (often just called operad) is a non-symmetric operad  P {\displaystyle P} as above, together with a right action of the symmetric group S n {\displaystyle S_{n}} on  P ( n ) {\displaystyle P(n)} for  n ∈ N {\displaystyle n\in \mathbb {N} } , denoted by  ∗ {\displaystyle *} and satisfying

* equivariance: given a permutation  t ∈ S n {\displaystyle t\in S_{n}} ,

( θ ∗ t ) ∘ ( θ 1 , … , θ n ) = ( θ ∘ ( θ t − 1 ( 1 ) , … , θ t − 1 ( n ) ) ) ∗ t ′ {\displaystyle (\theta *t)\circ (\theta _{1},\ldots ,\theta _{n})=(\theta \circ (\theta _{t^{-1}(1)},\ldots ,\theta _{t^{-1}(n)}))*t'}
(where  t ′ {\displaystyle t'} on the right hand side refers to the element of  S k 1 + ⋯ + k n {\displaystyle S_{k_{1}+\dots +k_{n}}} that acts on the set  { 1 , 2 , … , k 1 + ⋯ + k n } {\displaystyle \\{1,2,\dots ,k_{1}+\dots +k_{n}\\}} by breaking it into  n {\displaystyle n} blocks, the first of size  k 1 {\displaystyle k_{1}} , the second of size  k 2 {\displaystyle k_{2}} , through the  n {\displaystyle n} th block of size  k n {\displaystyle k_{n}} , and then permutes these  n {\displaystyle n} blocks by  t {\displaystyle t} , keeping each block intact)
and given  n {\displaystyle n} permutations  s i ∈ S k i {\displaystyle s_{i}\in S_{k_{i}}} ,

θ ∘ ( θ 1 ∗ s 1 , … , θ n ∗ s n ) = ( θ ∘ ( θ 1 , … , θ n ) ) ∗ ( s 1 , … , s n ) {\displaystyle \theta \circ (\theta _{1}*s_{1},\ldots ,\theta _{n}*s_{n})=(\theta \circ (\theta _{1},\ldots ,\theta _{n}))*(s_{1},\ldots ,s_{n})}
(where  ( s 1 , … , s n ) {\displaystyle (s_{1},\ldots ,s_{n})} denotes the element of  S k 1 + ⋯ + k n {\displaystyle S_{k_{1}+\dots +k_{n}}} that permutes the first of these blocks by  s 1 {\displaystyle s_{1}} , the second by  s 2 {\displaystyle s_{2}} , etc., and keeps their overall order intact).

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

### Morphisms

[edit]

A morphism of operads  f : P -> Q {\displaystyle f:P\to Q} consists of a sequence

( f n : P ( n ) -> Q ( n ) ) n ∈ N {\displaystyle (f_{n}:P(n)\to Q(n))_{n\in \mathbb {N} }}

that:

* preserves the identity:  f ( 1 ) = 1 {\displaystyle f(1)=1}
* preserves composition: for every n-ary operation  θ {\displaystyle \theta } and operations  θ 1 , … , θ n {\displaystyle \theta _{1},\ldots ,\theta _{n}} ,

f ( θ ∘ ( θ 1 , … , θ n ) ) = f ( θ ) ∘ ( f ( θ 1 ) , … , f ( θ n ) ) {\displaystyle 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 {\displaystyle f(x*s)=f(x)*s} .

Operads therefore form a category denoted by  O p e r {\displaystyle {\mathsf {Oper}}} .

### In other categories

[edit]

So far operads have only been considered in the category of sets. More generally, it is possible to define operads in any symmetric monoidal category C . In that case, each  P ( n ) {\displaystyle P(n)} is an object of C, the composition  ∘ {\displaystyle \circ } is a morphism  P ( n ) ⊗ P ( k 1 ) ⊗ ⋯ ⊗ P ( k n ) -> P ( k 1 + ⋯ + k n ) {\displaystyle P(n)\otimes P(k_{1})\otimes \cdots \otimes P(k_{n})\to P(k_{1}+\cdots +k_{n})} in C (where  ⊗ {\displaystyle \otimes } denotes the tensor product of the monoidal category), and the actions of the symmetric group elements are given by isomorphisms in C.

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

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

### Algebraist definition

[edit]

Given a commutative ring R we consider the category  R - M o d {\displaystyle R{\text{-}}{\mathsf {Mod}}} of modules over R. An operad over R can be defined as a monoid object ( T , γ , η ) {\displaystyle (T,\gamma ,\eta )} in the monoidal category of endofunctors on  R - M o d {\displaystyle R{\text{-}}{\mathsf {Mod}}} (it is a monad) satisfying some finiteness condition.[note 1]

For example, a monoid object in the category of "polynomial endofunctors" on  R - M o d {\displaystyle R{\text{-}}{\mathsf {Mod}}} is an operad.[8] Similarly, a symmetric operad can be defined as a monoid object in the category of  S {\displaystyle \mathbb {S} } -objects, where  S {\displaystyle \mathbb {S} } means a symmetric group.[9] 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 rings as monoid objects in the monoidal category of endofunctors on  Set {\displaystyle {\textbf {Set}}} that commute with filtered colimits.[10] This is a generalization of a ring since each ordinary ring R defines a monad  Σ R : Set -> Set {\displaystyle \Sigma _{R}:{\textbf {Set}}\to {\textbf {Set}}} that sends a set X to the underlying set of the free R-module  R ( X ) {\displaystyle R^{(X)}} generated by X.

## Understanding the axioms

[edit]

### Associativity axiom

[edit]

"Associativity" means that composition of operations is associative (the function  ∘ {\displaystyle \circ } is associative), analogous to the axiom in category theory that  f ∘ ( g ∘ h ) = ( f ∘ g ) ∘ h {\displaystyle 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, suppose  θ {\displaystyle \theta } is a binary operation which is written as  θ ( a , b ) {\displaystyle \theta (a,b)} or  ( a b ) {\displaystyle (ab)} ( θ {\displaystyle \theta } is not necessarily associative). Then what is commonly written  ( ( a b ) c ) {\displaystyle ((ab)c)} is unambiguously written operadically as  θ ∘ ( θ , 1 ) {\displaystyle \theta \circ (\theta ,1)} . This sends  ( a , b , c ) {\displaystyle (a,b,c)} to  ( a b , c ) {\displaystyle (ab,c)} (apply  θ {\displaystyle \theta } on the first two, and the identity on the third), and then the  θ {\displaystyle \theta } on the left "multiplies"  a b {\displaystyle ab} by  c {\displaystyle c} . This is clearer when depicted as a tree:

which yields a 3-ary operation:

However, the expression  ( ( ( a b ) c ) d ) {\displaystyle (((ab)c)d)} is a priori ambiguous: it could mean  θ ∘ ( ( θ , 1 ) ∘ ( ( θ , 1 ) , 1 ) ) {\displaystyle \theta \circ ((\theta ,1)\circ ((\theta ,1),1))} , if the inner compositions are performed first, or it could mean  ( θ ∘ ( θ , 1 ) ) ∘ ( ( θ , 1 ) , 1 ) {\displaystyle (\theta \circ (\theta ,1))\circ ((\theta ,1),1)} , if the outer compositions are performed first (operations are read from right to left). Writing  x = θ , y = ( θ , 1 ) , z = ( ( θ , 1 ) , 1 ) {\displaystyle x=\theta ,y=(\theta ,1),z=((\theta ,1),1)} , this is  x ∘ ( y ∘ z ) {\displaystyle x\circ (y\circ z)} versus  ( x ∘ y ) ∘ z {\displaystyle (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  ( a b ) c d {\displaystyle (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:

θ ( a b ) c ⋅ d ∘ ( ( θ a b ⋅ c , 1 d ) ∘ ( ( θ a ⋅ b , 1 c ) , 1 d ) ) {\displaystyle \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  a b c d {\displaystyle 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  ( ( ( a b ) c ) d ) {\displaystyle (((ab)c)d)} is unambiguous.

### Identity axiom

[edit]

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. In category theory,  θ ∘ 1 = θ = 1 ∘ θ {\displaystyle \theta \circ 1=\theta =1\circ \theta } is part of the definition of a category.

## Examples

[edit]

### Endomorphism operad in sets and operad algebras

[edit]

The most basic operads are the ones given in the section on "Intuition", above. For any set  X {\displaystyle X} , we obtain the endomorphism operad  E n d X {\displaystyle {\mathcal {End}}_{X}} consisting of all functions  X n -> X {\displaystyle X^{n}\to X} . These operads are important because they serve to define operad algebras. If  O {\displaystyle {\mathcal {O}}} is an operad, an operad algebra over  O {\displaystyle {\mathcal {O}}} is given by a set  X {\displaystyle X} and an operad morphism  O -> E n d X {\displaystyle {\mathcal {O}}\to {\mathcal {End}}_{X}} . Intuitively, such a morphism turns each "abstract" operation of  O ( n ) {\displaystyle {\mathcal {O}}(n)} into a "concrete"  n {\displaystyle n} -ary operation on the set  X {\displaystyle X} . An operad algebra over  O {\displaystyle {\mathcal {O}}} thus consists of a set  X {\displaystyle X} together with concrete operations on  X {\displaystyle X} that follow the rules abstractely specified by the operad  O {\displaystyle {\mathcal {O}}} .

### Endomorphism operad in vector spaces and operad algebras

[edit]

If k is a field, we can consider the category of finite-dimensional vector spaces over k; this becomes a monoidal category using the ordinary tensor product over k. We can then define endomorphism operads in this category, as follows. Let V be a finite-dimensional vector space The endomorphism operad E n d V = { E n d V ( n ) } {\displaystyle {\mathcal {End}}_{V}=\\{{\mathcal {End}}_{V}(n)\\}} of V consists of[11]

1. E n d V ( n ) {\displaystyle {\mathcal {End}}_{V}(n)} = the space of linear maps  V ⊗ n -> V {\displaystyle V^{\otimes n}\to V} ,
2. (composition) given  f ∈ E n d V ( n ) {\displaystyle f\in {\mathcal {End}}_{V}(n)} ,  g 1 ∈ E n d V ( k 1 ) {\displaystyle g_{1}\in {\mathcal {End}}_{V}(k_{1})} , ...,  g n ∈ E n d V ( k n ) {\displaystyle g_{n}\in {\mathcal {End}}_{V}(k_{n})} , their composition is given by the map  V ⊗ k 1 ⊗ ⋯ ⊗ V ⊗ k n ⟶ g 1 ⊗ ⋯ ⊗ g n V ⊗ n -> f V {\displaystyle V^{\otimes k_{1}}\otimes \cdots \otimes V^{\otimes k_{n}}\ {\overset {g_{1}\otimes \cdots \otimes g_{n}}{\longrightarrow }}\ V^{\otimes n}\ {\overset {f}{\to }}\ V} ,
3. (identity) The identity element in  E n d V ( 1 ) {\displaystyle {\mathcal {End}}_{V}(1)} is the identity map  id V {\displaystyle \operatorname {id} _{V}} ,
4. (symmetric group action)  S n {\displaystyle S_{n}} operates on  E n d V ( n ) {\displaystyle {\mathcal {End}}_{V}(n)} by permuting the components of the tensors in  V ⊗ n {\displaystyle V^{\otimes n}} .

If  O {\displaystyle {\mathcal {O}}} is an operad, a k-linear operad algebra over  O {\displaystyle {\mathcal {O}}} is given by a finite-dimensional vector space V over k and an operad morphism  O -> E n d V {\displaystyle {\mathcal {O}}\to {\mathcal {End}}_{V}} ; this amounts to specifying concrete multilinear operations on V that behave like the operations of  O {\displaystyle {\mathcal {O}}} . (Notice the analogy between operads&operad algebras and rings&modules: a module over a ring R is given by an abelian group M together with a ring homomorphism  R -> End ⁡ ( M ) {\displaystyle 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

[edit]

Operadic composition in the little 2-disks operad, explained in the text.

The little 2-disks operad is a topological operad where  P ( n ) {\displaystyle P(n)} consists of ordered lists of n disjoint disks inside the unit disk of  R 2 {\displaystyle \mathbb {R} ^{2}} centered at the origin. The symmetric group acts on such configurations by permuting the list of little disks. The operadic composition for little disks is illustrated in the accompanying figure to the right, where an element  θ ∈ P ( 3 ) {\displaystyle \theta \in P(3)} is composed with an element  ( θ 1 , θ 2 , θ 3 ) ∈ P ( 2 ) × P ( 3 ) × P ( 4 ) {\displaystyle (\theta _{1},\theta _{2},\theta _{3})\in P(2)\times P(3)\times P(4)} to yield the element  θ ∘ ( θ 1 , θ 2 , θ 3 ) ∈ P ( 9 ) {\displaystyle \theta \circ (\theta _{1},\theta _{2},\theta _{3})\in P(9)} obtained by shrinking the configuration of  θ i {\displaystyle \theta _{i}} and inserting it into the i-th disk of  θ {\displaystyle \theta } , for  i = 1 , 2 , 3 {\displaystyle i=1,2,3} .

Analogously, one can define the little n-disks operad by considering configurations of disjoint n-balls inside the unit ball of  R n {\displaystyle \mathbb {R} ^{n}} .[12]

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.[13] Later it was generalized by May[14] to the little convex bodies operad, and "little disks" is a case of "folklore" derived from the "little convex bodies".[15]

### Rooted trees

[edit]

In graph theory, rooted trees form a natural operad. Here,  P ( n ) {\displaystyle P(n)} is the set of all rooted trees with n leaves, where the leaves are numbered from 1 to n. The group  S n {\displaystyle S_{n}} operates on this set by permuting the leaf labels. Operadic composition  T ∘ ( S 1 , … , S n ) {\displaystyle T\circ (S_{1},\ldots ,S_{n})} is given by replacing the i-th leaf of  T {\displaystyle T} by the root of the i-th tree  S i {\displaystyle S_{i}} , for  i = 1 , … , n {\displaystyle i=1,\ldots ,n} , thus attaching the n trees to  T {\displaystyle T} and forming a larger tree, whose root is taken to be the same as the root of  T {\displaystyle T} and whose leaves are numbered in order.

### Swiss-cheese operad

[edit]

The Swiss-cheese operad.

The Swiss-cheese operad is a two-colored[definition needed] topological operad defined in terms of configurations of disjoint n-dimensional disks inside a unit n-semidisk and n-dimensional semidisks, centered at the base of the unit semidisk and sitting inside of it. The operadic composition comes from gluing configurations of "little" disks inside the unit disk into the "little" disks in another unit semidisk and configurations of "little" disks and semidisks inside the unit semidisk into the other unit semidisk.

The Swiss-cheese operad was defined by Alexander A. Voronov.[16] It was used by Maxim Kontsevich to formulate a Swiss-cheese version of Deligne's conjecture on Hochschild cohomology.[17] Kontsevich's conjecture was proven partly by Po Hu, Igor Kriz, and Alexander A. Voronov[18] and then fully by Justin Thomas.[19]

### Associative operad

[edit]

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.

For example, the associative operad is a symmetric operad generated by a binary operation  ψ {\displaystyle \psi } , subject only to the condition that

ψ ∘ ( ψ , 1 ) = ψ ∘ ( 1 , ψ ) . {\displaystyle \psi \circ (\psi ,1)=\psi \circ (1,\psi ).}

This condition corresponds to associativity of the binary operation  ψ {\displaystyle \psi } ; writing  ψ ( a , b ) {\displaystyle \psi (a,b)} multiplicatively, the above condition is  ( a b ) c = a ( b c ) {\displaystyle (ab)c=a(bc)} . This associativity of the operation should not be confused with associativity of composition which holds in any operad; see the axiom of associativity, above.

In the associative operad, each  P ( n ) {\displaystyle P(n)} is given by the symmetric group S n {\displaystyle S_{n}} , on which  S n {\displaystyle S_{n}} acts by right multiplication. The composite  σ ∘ ( τ 1 , … , τ n ) {\displaystyle \sigma \circ (\tau _{1},\dots ,\tau _{n})} permutes its inputs in blocks according to  σ {\displaystyle \sigma } , and within blocks according to the appropriate  τ i {\displaystyle \tau _{i}} .

The algebras over the associative operad are precisely the semigroups: sets together with a single binary associative operation. The k-linear algebras over the associative operad are precisely the associative k-algebras.

### Terminal symmetric operad

[edit]

The terminal symmetric operad is the operad which has a single n-ary operation for each n, with each  S n {\displaystyle S_{n}} acting trivially. The algebras over this operad are the commutative semigroups; the k-linear algebras are the commutative associative k-algebras.

### Operads from the braid groups

[edit]

Similarly, there is a non- Σ {\displaystyle \Sigma } operad for which each  P ( n ) {\displaystyle P(n)} is given by the Artin braid group B n {\displaystyle B_{n}} . Moreover, this non- Σ {\displaystyle \Sigma } operad has the structure of a braided operad, which generalizes the notion of an operad from symmetric to braid groups.

### Linear algebra

[edit]

In linear algebra, real vector spaces can be considered to be algebras over the operad  R ∞ {\displaystyle \mathbb {R} ^{\infty }} of all linear combinations [citation needed]. This operad is defined by  R ∞ ( n ) = R n {\displaystyle \mathbb {R} ^{\infty }(n)=\mathbb {R} ^{n}} for  n ∈ N {\displaystyle n\in \mathbb {N} } , with the obvious action of  S n {\displaystyle S_{n}} permuting components, and composition  x -> ∘ ( y 1 -> , … , y n -> ) {\displaystyle {\vec {x}}\circ ({\vec {y_{1}}},\ldots ,{\vec {y_{n}}})} given by the concatentation of the vectors  x ( 1 ) y 1 -> , … , x ( n ) y n -> {\displaystyle x^{(1)}{\vec {y_{1}}},\ldots ,x^{(n)}{\vec {y_{n}}}} , where  x -> = ( x ( 1 ) , … , x ( n ) ) ∈ R n {\displaystyle {\vec {x}}=(x^{(1)},\ldots ,x^{(n)})\in \mathbb {R} ^{n}} . The vector  x -> = ( 2 , 3 , − 5 , 0 , … ) {\displaystyle {\vec {x}}=(2,3,-5,0,\dots )} for instance represents the operation of forming a linear combination with coefficients 2,3,-5,0,...

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.

Similarly, affine combinations, conical combinations, and convex combinations can be considered to correspond to the sub-operads where the terms of the vector  x -> {\displaystyle {\vec {x}}} 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  R n {\displaystyle \mathbb {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.

### Commutative-ring operad and Lie operad

[edit]

The commutative-ring operad is an operad whose algebras are the commutative rings. It is defined by  P ( n ) = Z [ x 1 , … , x n ] {\displaystyle P(n)=\mathbb {Z} [x_{1},\ldots ,x_{n}]} , with the obvious action of  S n {\displaystyle S_{n}} and operadic composition given by substituting polynomials (with renumbered variables) for variables. A similar operad can be defined whose algebras are the associative, commutative algebras over some fixed base field. The Koszul-dual of this operad is the Lie operad (whose algebras are the Lie algebras), and vice versa.

## Free Operads

[edit]

Typical algebraic constructions (e.g., free algebra construction) can be extended to operads. Let  S e t S n {\displaystyle \mathbf {Set} ^{S_{n}}} denote the category whose objects are sets on which the group  S n {\displaystyle S_{n}} acts. Then there is a forgetful functor O p e r -> ∏ n ∈ N S e t S n {\displaystyle {\mathsf {Oper}}\to \prod _{n\in \mathbb {N} }\mathbf {Set} ^{S_{n}}} , which simply forgets the operadic composition. It is possible to construct a left adjoint Γ : ∏ n ∈ N S e t S n -> O p e r {\displaystyle \Gamma :\prod _{n\in \mathbb {N} }\mathbf {Set} ^{S_{n}}\to {\mathsf {Oper}}} to this forgetful functor (this is the usual definition of free functor). Given a collection of operations E,  Γ ( E ) {\displaystyle \Gamma (E)} is the free operad on E.

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  O {\displaystyle {\mathcal {O}}} , we mean writing  O {\displaystyle {\mathcal {O}}} as a quotient of a free operad  F = Γ ( E ) {\displaystyle {\mathcal {F}}=\Gamma (E)} where E describes generators of  O {\displaystyle {\mathcal {O}}} and the kernel of the epimorphism  F -> O {\displaystyle {\mathcal {F}}\to {\mathcal {O}}} describes the relations.

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

## Clones

[edit]

Clones are the special case of operads that are also closed under identifying arguments together ("reusing" some data). Clones can be equivalently defined as operads that are also a minion (or clonoid).

## Operads in homotopy theory

[edit]

This section needs expansion. You can help by adding to it. (December 2018)

|

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.

## Higher-order operad

[edit]

This section needs expansion. You can help by adding to it. (June 2025)

|

In algebra, a higher-order operad is a higher-dimensional generalization of an operad.[21][22]

## See also

[edit]

* PRO (category theory)
* Algebra over an operad
* Higher-order operad
* E∞-operad
* Pseudoalgebra
* Multicategory
* Opetope

## Notes

[edit]

1. ^ ”finiteness" refers to the fact that only a finite number of inputs are allowed in the definition of an operad. For example, the condition is satisfied if one can write

T ( V ) = ⨁ n = 1 ∞ T n ⊗ V ⊗ n {\displaystyle T(V)=\bigoplus _{n=1}^{\infty }T_{n}\otimes V^{\otimes n}} ,
γ ( V ) : T n ⊗ T i 1 ⊗ ⋯ ⊗ T i n -> T i 1 + ⋯ + i n {\displaystyle \gamma (V):T_{n}\otimes T_{i_{1}}\otimes \cdots \otimes T_{i_{n}}\to T_{i_{1}+\dots +i_{n}}} .

### Citations

[edit]

1. ^ Boardman, J. M.; Vogt, R. M. (1 November 1968). "Homotopy-everything $H$-spaces". Bulletin of the American Mathematical Society. 74 (6): 1117–1123\. doi:10.1090/S0002-9904-1968-12070-1. ISSN 0002-9904.
2. ^ Boardman, J. M.; Vogt, R. M. (1973). Homotopy Invariant Algebraic Structures on Topological Spaces. Lecture Notes in Mathematics. Vol. 347\. doi:10.1007/bfb0068547. ISBN 978-3-540-06479-4. ISSN 0075-8434.
3. ^ May, J. P. (1972). The Geometry of Iterated Loop Spaces. Lecture Notes in Mathematics. Vol. 271\. CiteSeerX 10.1.1.146.3172. doi:10.1007/bfb0067491. ISBN 978-3-540-05904-2. ISSN 0075-8434.
4. ^ "Operads in Algebra, Topology and Physics": Martin Markl, Steve Shnider, Jim Stasheff, Mathematical Surveys and Monographs, Volume: 96; 2002
5. ^ May, J. Peter. "Operads, Algebras, and Modules" (PDF). math.uchicago.edu. p. 2. Retrieved 28 September 2018.
6. ^ Ginzburg, Victor; Kapranov, Mikhail (1994). "Koszul duality for operads". Duke Mathematical Journal. 76 (1): 203–272\. doi:10.1215/S0012-7094-94-07608-4. ISSN 0012-7094. MR 1301191. S2CID 115166937. Zbl 0855.18006 - via Project Euclid.
7. ^ Loday, Jean-Louis (1996). "La renaissance des opérades". www.numdam.org. Séminaire Nicolas Bourbaki. MR 1423619. Zbl 0866.18007. Retrieved 27 September 2018.
8. ^ a b Kontsevich, Maxim; Soibelman, Yan (26 January 2000). "Deformations of algebras over operads and Deligne's conjecture". arXiv:math/0001151.
9. ^ Jones, J. D. S.; Getzler, Ezra (8 March 1994). "Operads, homotopy algebra and iterated integrals for double loop spaces". arXiv:hep-th/9403055.
10. ^ N. Durov, New approach to Arakelov geometry, University of Bonn, PhD thesis, 2007; arXiv:0704.2030.
11. ^ Markl, Martin (2006). "Operads and PROPs". Handbook of Algebra. 5 (1): 87–140\. arXiv:math/0601129. doi:10.1016/S1570-7954(07)05002-4. ISBN 9780444531018. S2CID 3239126. Example 2
12. ^ Giovanni Giachetta, Luigi Mangiarotti, Gennadi Sardanashvily (2005) Geometric and Algebraic Topological Methods in Quantum Mechanics, ISBN 981-256-129-3, pp. 474,475
13. ^ Greenlees, J. P. C. (2002). Axiomatic, Enriched and Motivic Homotopy Theory. Proceedings of the NATO Advanced Study Institute on Axiomatic, Enriched and Motivic Homotopy Theory. Cambridge, United Kingdom: Springer Science & Business Media. pp. 154–156\. ISBN 978-1-4020-1834-3.
14. ^ May, J. P. (1977). "Infinite loop space theory". Bull. Amer. Math. Soc. 83 (4): 456–494\. doi:10.1090/s0002-9904-1977-14318-8.
15. ^ Stasheff, Jim (1998). "Grafting Boardman's Cherry Trees to Quantum Field Theory". arXiv:math/9803156.
16. ^ Voronov, Alexander A. (1999). The Swiss-cheese operad. Contemporary Mathematics. Baltimore, Maryland, United States: AMS. pp. 365–373\. ISBN 978-0-8218-7829-3.
17. ^ Kontsevich, Maxim (1999). "Operads and Motives in Deformation Quantization". Lett. Math. Phys. 48: 35–72\. arXiv:math/9904055. Bibcode:1999math......4055K. doi:10.1023/A:1007555725247. S2CID 16838440.
18. ^ Hu, Po; Kriz, Igor; Voronov, Alexander A. (2006). "On Kontsevich's Hochschild cohomology conjecture". Compositio Mathematica. 142 (1): 143–168\. arXiv:math/0309369. doi:10.1112/S0010437X05001521.
19. ^ Thomas, Justin (2016). "Kontsevich's Swiss cheese conjecture". Geom. Topol. 20 (1): 1–48\. arXiv:1011.1635. doi:10.2140/gt.2016.20.1. S2CID 119320246.
20. ^ Markl, Martin (2006). "Operads and PROPs". Handbook of Algebra. 5: 87–140\. doi:10.1016/S1570-7954(07)05002-4. ISBN 9780444531018. S2CID 3239126. Definition 37
21. ^ Heuts, Gijs; Hinich, Vladimir; Moerdijk, Ieke (2016). "On the equivalence between Lurie's model and the dendroidal model for infinity-operads". Advances in Mathematics. 302: 869–1043\. arXiv:1305.3658. doi:10.1016/j.aim.2016.07.021. S2CID 119254588.
22. ^ Leinster 2004, Part II. NB: in the reference, a higher-order operad is called a generalized operad. harvnb error: no target: CITEREFLeinster2004 (help)

## References

[edit]

* Tom Leinster (2004). Higher Operads, Higher Categories. Cambridge University Press. arXiv:math/0305049. Bibcode:2004hohc.book.....L. ISBN 978-0-521-53215-0.
* Martin Markl, Steve Shnider, Jim Stasheff (2002). Operads in Algebra, Topology and Physics. American Mathematical Society. ISBN 978-0-8218-4362-8.`{{cite book}}`: CS1 maint: multiple names: authors list (link)
* Markl, Martin (June 2006). "Operads and PROPs". arXiv:math/0601129.
* Stasheff, Jim (June–July 2004). "What Is...an Operad?" (PDF). Notices of the American Mathematical Society. 51 (6): 630–631. Retrieved 17 January 2008.
* Loday, Jean-Louis; Vallette, Bruno (2012), Algebraic Operads (PDF), Grundlehren der Mathematischen Wissenschaften, vol. 346, Berlin, New York: Springer-Verlag, ISBN 978-3-642-30361-6
* Zinbiel, Guillaume W. (2012), "Encyclopedia of types of algebras 2010", in Bai, Chengming; Guo, Li; Loday, Jean-Louis (eds.), Operads and universal algebra, Nankai Series in Pure, Applied Mathematics and Theoretical Physics, vol. 9, pp. 217–298, arXiv:1101.0267, Bibcode:2011arXiv1101.0267Z, ISBN 9789814365116
* Fresse, Benoit (17 May 2017), Homotopy of Operads and Grothendieck-Teichmüller Groups, Mathematical Surveys and Monographs, American Mathematical Society, ISBN 978-1-4704-3480-9, MR 3643404, Zbl 1373.55014
* Miguel A. Mendéz (2015). Set Operads in Combinatorics and Computer Science. SpringerBriefs in Mathematics. ISBN 978-3-319-11712-6.
* Samuele Giraudo (2018). Nonsymmetric Operads in Combinatorics. Springer International Publishing. ISBN 978-3-030-02073-6.

## External links

[edit]

* operad at the nLab
* https://golem.ph.utexas.edu/category/2011/05/an_operadic_introduction_to_en.html