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.
A dendroidal set is a presheaf on the tree category .
The category of dendroidal sets is the functor category
Some terminology and notation:
For a tree, write for the dendroidal set that it represents.
For a dendroidal set and a tress, the set (using the Yoneda lemma) is the set o -shaped dendrices in . One of its elements is called a -shaped dendrex, analogous to a simplex in a simplicial set.
Write for the tree consisting of a single edge. Let be the over category. This is canonically isomorphic to the simplex category
Moreover, the over-category of all dendroidal sets over is the category SSet of simplicial sets
The corresponding canonical functor
is a full and faithful functor and induces an adjunction
where is a full and faithful functor defined equivalently as
the left adjoint to ;
the left Kan extension of ;
the canonical functor .
A morphism of dendroidal sets exists only for itself a simplicial set, i.e. itself in the image of .
The dendroidal set that corresponds to the -simplex is to be visualized as the linear tree with -edges:
We think of each bullet as a unary operation – an ordinary morphism – from the object to the object .
Notice that this is hence Poincaré-dual to how one tends to visualize itself
and how one tends to visualize morphisms .
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
inner face maps – obtained by contracting an inner edge
outer face maps – obtained by
removing an outer input vertex
removing a vertex whose output is the root and which has precisely one inner incoming edge (which becomes the new root)
a corolla face – any one of the inclusions of the tree with no vertex into a tree with precisely one vertex
For and an inner edge (in the obvious sense), write for the tree obtained by contracting/discarding this inner edge. There is then a canonical inclusion
This is called an inner face map.
For example let
then
and the inclusion the the operad morphism that is the identity on the operation and which sends the trinary operation to the composite trinary operation
In contrast to that, outer edges are always removed together:
if is a vertex of such that all but one edge incident on it are outer, then denote by the tree obtained by discarding and all the outer edges indicent on it. There is then again a canonical inclusion
This is called an outer face map.
In the above example for we have
If the tree has precisely one vertex it is called a corolla. There are injections of the tree with no vertex into the corolla with inputs. All these are outer face maps.
The inner and outer face morphisms and are precisely the monomorphisms in the tree category .
Lemma 3.1 in MoeWei07.
The boundary of a tree is the union of all its face dendroidal sets
Compare to boundary of a simplex.
Analogously then to the notion of horn of a simplex, for an edge of the union
of dendroidal sets is the inner horn of at , and for an outer face the union
is the outer horn at .
We have the canonical boundary inclusions
and horn inclusions
A monomorphism of dendroidal sets is called normal if for any tree , any non-degenerate dendrex which does not belong to the image of has a trivial stabilizer .
A dendroidal set is normal if is a normal monomorphism.
For instance for any tree , the dendroidal set is normal.
This has nothing to do with the notion of normal monomorphism in a context with zero morphisms.
The class of morphisms in generated from the boundary inclusions under pushout and transfinite composition is precisely the class of normal monomorphisms.
This is prop 1.4 in CisMoer09.
The category of dendroidal sets carries the structure of a symmetric monoidal category, defined as follows:
in analogy to the nerve adjunction
between ordinary categories and simplicial sets, there is an adjunction
between operads and dendroidal sets.
The category carries the Boardman-Vogt tensor product? and the symmetric monoidal structure on is taken to be the unique one
that makes a symmetric monoidal functor;
such that for any two trees we have
With respect to this monoidal struucture is a closed monoidal category.
Using the fact that is a closed monoidal category with internal hom dendroidal sets for dendroidal sets and , and using the functor we obtain canonically the structure of an SSet-enriched category on with the hom-simplicial set between and being .
The category 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 is a right Quillen functor (with respect to the Joyal model structure on simplicial sets) this imples that is a Joyal-SSet enriched model category.
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