nLab
dendroidal set

Contents

Idea

Dendroidal sets are to operads and (∞,1)-operads as simplicial sets are to categories and (∞,1)-categories.

A dendroidal set is something that consists of trees in the way a simplicial set consists of simplices.

Definition

A dendroidal set is a presheaf on the tree category Ω.

The category of dendroidal sets is the functor category

dSet=[Ω op,Set].dSet = [\Omega^{op}, Set] \,.

Some terminology and notation:

  • For TΩ a tree, write Ω[T]:=Ω(,T) for the dendroidal set that it represents.

  • For X a dendroidal set and T a tress, the set dSet(T,X)X(T) (using the Yoneda lemma) is the set o T-shaped dendrices in X. One of its elements is called a T-shaped dendrex, analogous to a simplex in a simplicial set.

Relation to simplicial sets

Write 0 for the tree consisting of a single edge. Let Ω/0 be the over category. This is canonically isomorphic to the simplex category

Ω/0Δ.\Omega/0 \simeq \Delta \,.

Moreover, the over-category of all dendroidal sets over η:=Ω[0] is the category SSet of simplicial sets

SSetdSet/Ω[0].SSet \simeq dSet/\Omega[0] \,.

The corresponding canonical functor

i:Δ=Ω/0Ωi : \Delta = \Omega/0 \to \Omega

is a full and faithful functor and induces an adjunction

i *:SSet::dSet:i *,i_* : SSet : \stackrel{\leftarrow}{\to} : dSet : i^* \,,

where i * is a full and faithful functor defined equivalently as

A morphism Xi *Y of dendroidal sets exists only for X itself a simplicial set, i.e. X itself in the image of i *.

The dendroidal set i([n]) that corresponds to the n-simplex is to be visualized as the linear tree with (n+1)-edges:

i([n])=(012n).i([n]) = \left( \stackrel{0}{\to} \bullet \stackrel{1}{\to} \bullet \stackrel{2}{\to} \cdots \bullet \stackrel{n}{\to} \right) \,.

We think of each bullet as a unary operation – an ordinary morphismnn+1 from the object n to the object (n+1).

Notice that this is hence Poincaré-dual to how one tends to visualize [n] itself

[n]=(012n)[n] = (0 \to 1 \to 2 \to \cdots \to n)

and how one tends to visualize morphisms n(n+1).

Faces of trees and dendroidal sets

The face maps on trees, regarded as dendroidal sets, are morphisms that generalize the face maps in the simplex category Δ. Defining them in Ω requires a few case distinctions:

there are

  1. inner face maps – obtained by contracting an inner edge

  2. outer face maps – obtained by

    1. removing an outer input vertex

    2. removing a vertex whose output is the root and which has precisely one inner incoming edge (which becomes the new root)

    3. a corolla face – any one of the inclusions of the tree with no vertex into a tree with precisely one vertex

Inner faces

For TΩ and e an inner edge (in the obvious sense), write T/e for the tree obtained by contracting/discarding this inner edge. There is then a canonical inclusion

e:T/eT.\partial_e : T/e \to T \,.

This is called an inner face map.

For example let

T=( v e )T = \left( \array{ \searrow && \swarrow \\ & v \\ \searrow & & \searrow^e \\ & \bullet &\to& \bullet &\to& \\ \nearrow } \right)

then

T/e=( )T/e = \left( \array{ \searrow && \searrow& & \swarrow \\ & \bullet &\to& \bullet &\to& \\ \nearrow } \right)

and the inclusion T/eT the the operad morphism that is the identity on the operation and which sends the trinary operation to the composite trinary operation e

Outer face maps

In contrast to that, outer edges are always removed together:

if v is a vertex of T such that all but one edge incident on it are outer, then denote by T/v the tree obtained by discarding v and all the outer edges indicent on it. There is then again a canonical inclusion

v:T/vT.\partial_v : T/v \to T \,.

This is called an outer face map.

In the above example for T we have

T/v=( e )T/v = \left( \array{ \searrow & & \searrow^e \\ & \bullet &\to& \bullet &\to& \\ \nearrow } \right)

Corolla faces

If the tree has precisely one vertex it is called a corolla. There are n+1 injections of the tree with no vertex into the corolla with n inputs. All these are outer face maps.

* .| \hookrightarrow \array{ \searrow && \swarrow \\ & {*} \\ & \downarrow } \,.

Properties

Lemma (face maps are the monomorphisms)

The inner and outer face morphisms e and v are precisely the monomorphisms in the tree category Ω.

Proof

Lemma 3.1 in MoeWei07.

The boundary of a tree is the union of all its face dendroidal sets

Ω[T]= eEdges(T)Ω[ eT] vVertices(T)Ω[ vT].\partial \Omega[T] = \cup_{e \in Edges(T)} \Omega[\partial_e T] \cup_{v \in Vertices(T)} \Omega[\partial_v T] \,.

Compare to boundary of a simplex.

Analogously then to the notion of horn of a simplex, for d an edge of T the union

Λ eΩ[T]= edEdges(T)Ω[ eT] vVertices(T)Ω[ vT]\Lambda^e \Omega[T] = \cup_{e \neq d \in Edges(T)} \Omega[\partial_e T] \cup_{v \in Vertices(T)} \Omega[\partial_v T]

of dendroidal sets is the inner horn of T at e, and for w an outer face the union

Λ wΩ[T]= edEdges(T)Ω[ eT] vwVertices(T)Ω[ vT]\Lambda^w \Omega[T] = \cup_{e \neq d \in Edges(T)} \Omega[\partial_e T] \cup_{v \neq w \in Vertices(T)} \Omega[\partial_v T]

is the outer horn at w.

We have the canonical boundary inclusions

Ω[T]Ω[T]\partial \Omega[T] \to \Omega[T]

and horn inclusions

Λ αΩ[T]Ω[T].\Lambda^\alpha \Omega[T] \to \Omega[T] \,.
Definition

A monomorphism XY of dendroidal sets is called normal if for any tree T, any non-degenerate dendrex yY(T) which does not belong to the image of X(T) has a trivial stabilizer Aut(T) yAut(T).

A dendroidal set X is normal if X is a normal monomorphism.

For instance for any tree T, the dendroidal set Ω[T] is normal.

Remark

This has nothing to do with the notion of normal monomorphism in a context with zero morphisms.

Proposition

The class of morphisms in dSet generated from the boundary inclusions under pushout and transfinite composition is precisely the class of normal monomorphisms.

Proof

This is prop 1.4 in CisMoer09.

Structure on dSet

Closed symmetric monoidal structure

The category dSet of dendroidal sets carries the structure of a symmetric monoidal category, defined as follows:

in analogy to the nerve adjunction

τ:SSetCat:N\tau : SSet \stackrel{\leftarrow}{\to} Cat : N

between ordinary categories and simplicial sets, there is an adjunction

τ d:dSetOperad:N d\tau_d : dSet \stackrel{\leftarrow}{\to} Operad : N_d

between operads and dendroidal sets.

The category Operad carries the Boardman-Vogt tensor product? BV and the symmetric monoidal structure on dSet is taken to be the unique one

  • that makes τ d a symmetric monoidal functor;

  • such that for any two trees T,S we have

    Ω[T]Ω[S]=N d(T BVS).\Omega[T] \otimes \Omega[S] = N_d(T \otimes_{BV} S) \,.

With respect to this monoidal struucture dSet is a closed monoidal category.

SSet-enriched structure

Using the fact that dSet is a closed monoidal category with internal hom dendroidal sets [C,D] for dendroidal sets C and D, and using the functor i *:dSetSSet we obtain canonically the structure of an SSet-enriched category on dSet with the hom-simplicial set between C and D being i *[C,D].

Model category structure

The category dSet also carries the Cisinski-Moerdijk model structure on dendroidal sets. With this model structure it forms a monoidal model category. Together with the fact that i *:dSetSSet is a right Quillen functor (with respect to the Joyal model structure on simplicial sets) this imples that dSet is a Joyal-SSet enriched model category.

References

A good survey of the theory as developed currently is

An expanded and polished version has meanwhile been written up by Javier Guitiérrez and should appear in print soon. An electronic copy is probably available on request.

The PhD thesis that gave the original definition of dendroidal sets is:

The publication derived from that:

A discussion of inner Kan complexes (see also model structure on dendroidal sets):

Here two blog entries with some summaries and pointers to the literature