nLab
(infinity,1)-operad

higher category theory

Definitions

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical models

Edit this sidebar


higher algebra

Ingredients

Contents

Edit this sidebar

Contents

Idea

The notion of (,1)-operad is to that of (∞,1)-category as operad is to category.

So, roughly, an (,1)-operad is an algebraic structure that has for each given type of input and one type of output an ∞-groupoid of operations that take these inputs to that output.

Definitions

Two models for (,1)-operads exist to date, one by CisinskiMoerdijkWeiss, the other by Lurie.

The first one models (,1)-operads as dendroidal sets in close analogy to (in fact as a generalization of how) simplicial sets model (∞,1)-categories.

The second models the (∞,1)-category version of a category of operators of an operad.

In terms of dendroidal sets

Here simplicial sets are generalized to dendroidal sets. The theory of (,1)-operads is then formulated in terms of dendroidal sets in close analogy to how the theory of (∞,1)-categories is formulated in terms of simplicial sets.

There is a model structure on dendroidal sets whose fibrant objest are the quasi-operads in direct analogy to the notion of quasi-category.

Here are two blog entries on talks on this stuff:

In terms of (,1)-categories of operators

Every operad A encodes and is encoded by its category of operators C A. In the approach to (,1)-operators described below, the notion of category of operators is generalized to an (∞,1)-category of operators.

In this approach an (,1)-operad C is regarded as an (∞,1)-category C – the unary part of the (,1)-operad to be described– with extra structure that determines (∞,1)-functors C ×nC.

This and the conditions on these are encoded in requiring that C is an (,1)-functor C Γ over Segal's category? Γ of pointed finite sets, satisfying some conditions.

In particular, any symmetric monoidal (∞,1)-category yields an example of an (,1)-operad in this sense. In fact, symmetric monoidal (,1)-categories can be defined as (,1)-operads such that the functor C Γ is a coCartesian fibration. (For the moment, see monoidal (infinity,1)-category for more comments and references on higher operads in this context.)

This is the approach described in (the new version of !)

Model for (,1)-categories of operators

There is a model category that presents the (∞,1)-category (,1)Cat Oper of (,1)-categories of operations.

Proposition

There exists a

model category 𝒫Op (,1)

  • whose underlying category has

    • objects are marked simplicial set S equipped with a morphism SN(FinSet *) such that marked edges map to inert morphisms in FinSet * (those for which the preimage of te marked point contains just the marked point)

    • morphisms are morphisms of marked simplicial sets ST such that the triangle

      S T N(FinSet *)\array{ S &&\to&& T \\ & \searrow && \swarrow \\ && N(FinSet_*) }

      commutes;

  • which is canonically an SSet-enriched category;

  • and whose model structure is given by

    • cofibrations are those morphisms whose underlying morphisms of simplicial sets ate cofibrations, hence monomorphisms

    • weak equivalences are those morphisms ST such that for all AN(FinSet *) that are (,1)-categories of operations by the above definition, the morphism of SSet-hom objects

      𝒫Op (T,A)𝒫Op (S,A)\mathcal{P}Op_\infty(T,A) \to \mathcal{P}Op_\infty(S,A)

      is a homotopy equivalence of simplicial sets.

    • an object is fibrant if and only if it is an (,1)-category of operations, by the above definition.

Proof

This is prop 1.8 4 in

Relation between the two definitions

At the time of this writing there is no discussion in “the literature” of the relation between the definition of (,1)-operads in terms of dendroidal sets (Cisinski, Moerdijk, Weiss) and (,1)-categories of operators (Lurie). The following are some tentative observations. - Urs

There is an obvious way to regard a tree as an (,1)-category of operators:

Definition

(dendroidal (,1)-category of operators)

Let

ω:ΩOpC ()Cat/FinSet *N𝒫Op (,1)\omega : \Omega \hookrightarrow Op \stackrel{C_{(-)}}{\to} Cat/FinSet_* \stackrel{N}{\to} \mathcal{P}Op_{(\infty,1)}

be the dendroidal object given by the following composition:

  • ΩOp is the functor from the tree category Ω to the category of symmetric colored operads (over Set) that sends a tree to the operad freely generated from it;

  • OpC ()Cat/FinSet * sends an operad to its category of operators;

  • Cat/FinSet *N𝒫Op (,1) takes the nerve of this category, regarded as a marked simplicial set over N(FinSet *), whose marked edges are the inert morphisms in the category of operations.

Following the general pattern of nerve and realization, we get:

Definition

(dendroidal nerve of Lurie--operad)

The functor

N d:=Hom 𝒫Op (,1)(ω(),):𝒫Op (,1)dSetN_d := Hom_{\mathcal{P}Op_{(\infty,1)}}(\omega(-), -): \mathcal{P}Op_{(\infty,1)} \to dSet

that sends a marked simplicial set AN(FinSet *) to the dendroidal set which sends a tree T to the set of morphisms of ω(T) into A

N d(A):THom 𝒫Op (,1)(ω(T),A)N_d(A) : T \mapsto Hom_{\mathcal{P}Op_{(\infty,1)}}(\omega(T), A)

is the dendroidal nerve of A.

One expects that N d induces a Quillen adjunction and indeed a Quillen equivalence between the above model category structure on 𝒫Op (,1) and the model structure on dendroidal sets. The following is as far as I think I can prove aspects of this. -Urs.

Proposition

The dendroidal nerve functor has the following properties:

  • it is the right adjoint of a SSet-enriched adjunction

    C ():dSet𝒫Op (,1):N dC_{(-)} : dSet \stackrel{\leftarrow}{\to} \mathcal{P}Op_{(\infty,1)} : N_d
  • it sends fibrant objects to fibrant objects

    i.e. it sends (,1)-categories of operations to (,1)-operads in their incarnation as “quasi-operads”;

  • it sends objects π:AN(FinSet *) that come from grouplike symmetric monoidal ∞-groupoids to fully Kan dendroidal sets (that have the extension property with respect to all horns)

  • it sends objects π:AN(FinSet *) that come from symmetric monoidal (∞,1)-categories to dendroidal sets that have the extension property with respect to at least one outer horn Λ vT for vT an n-corolla, for all n.

  • its left adjoint sends cofibrations to cofibrations and acyclic cofibrations with cofibrant domain to acyclic cofibrations.

Proof

respect for fibrant objects. If AN(FinSet *) is fibrant, then in particual A is a weak Kan complex hence has the extension property with respect to all inner horn inclusions of simplices. We need to show that this implies that N d(A) has the extension property with respect to all inner horn inclusions of trees.

By an (at the moment unpublished) result by Moerdijk, right lifting property with respect to inner horn inclusions of trees is equivalend to right lifting property with respect to inclusions of spines of trees: the union over all the corollas in a tree.

For this the extension property means that if we find a collection {C k iN d(A)}=Sp(T) of corollas in N d(A) that match at some inputs and output, then these can be composed to an image TN d(A) of the corresponding tree T in N d(A).

An image of T in N d(A) is an image of ω(T) in A. In the category of operators ω(A) every tree may be represented as the composite of a sequence of morphisms each of which consists of precisely one of the corollas C k i in parallel to identity morphisms. This way gluing the tree from the corollas is a matter of composing a sequence of edges in A. But this is guaranteed to be possible if A is a weak Kan complex.

symmetric monoidal product and outer horn lifting

As described at cartesian morphism, an edge f:Δ 1A in A is coCartesian if for all diagrams

Δ 0,1 f Λ 0 n A Δ n N(FinSet *)\array{ \Delta^{0,1} \\ \downarrow & \searrow^f \\ \Lambda^n_0 &\to & A \\ \downarrow && \downarrow \\ \Delta^n &\to& N(FinSet_*) }

of 0-horn lifting problems where the first edge of the horn is f itself, there exists a lift

Δ 0,1 f Λ 0 n A Δ n N(FinSet *).\array{ \Delta^{0,1} \\ \downarrow & \searrow^f \\ \Lambda^n_0 &\to & A \\ \downarrow &\nearrow & \downarrow \\ \Delta^n &\to& N(FinSet_*) } \,.

For f the parallel application of an n-corolla with a collection of identity morphisms this implies that any outer horn Λ vTN d(A) for which the vertex v:C nN d(A) maps to f, the dendroidal set N d(A) has the extension property with respect to the inclusion Λ dTT.

the left adjoint and its respect for cofibrations

By general nonsense the left adjoint to N d is given by the coend

C ():dSet𝒫Op (,1)C_{(-)} : dSet \to \mathcal{P}Op_{(\infty,1)}
C P= TΩω(T)P(T),C_P = \int^{T \in \Omega} \omega(T) \cdot P(T) \,,

where in the integrand we have the tautological tensoring of 𝒫Op (,1) over Set.

Notice that ω:Ω𝒫Op (,1) is an SSet-enriched functor for the ordinary category Ω regarded as a simplicially enriched category by the canonical embedding SetSSet. Therefore this adjunction FN d is defined entirely in SSet-enriched category theory and hence is a simplicial adjunction.

The model structure on dendroidal sets has a set of generating cofibrations given by the boundary inclusions of trees. Ω[T]Ω[T]. Tese evidenly map to monomorphisms of underlying simplicial sets under F, hence to cofibrations.

For f:PQ an acyclic cofibration with cofibrant domain, we need to check that C f:C XC Y is a weak equivalence in 𝒫Op (,1). This is by definition the case if for every fibrant object A the morphism

𝒫Op (,1)(C Y,A)𝒫Op (,1)(C X,A)\mathcal{P}Op_{(\infty,1)}(C_Y,A) \to \mathcal{P}Op_{(\infty,1)}(C_X,A)

is a weak equivalence in the standard model structure on simplicial sets. By the simplicial adjunction FN d this is equivalent to

dSet(f,N d(A)):dSet(Y,N d(A))dSet(X,N d(A))dSet(f,N_d(A)) : dSet(Y,N_d(A)) \to dSet(X,N_d(A))

being a weak equivalence. By the above N d(A) is fibrant. By section 8.4 of the lecture notes on dendroidal sets cited at model structure on dendroidal sets a morphism between cofibrant dendroidal sets is a weak equivalence precisely if homming it into any fibrant dendroidal set produces an equivalence of homotopy categories.

Since f is a weak equivalence between cofibrant objects by assumption, it follows that indeed dSet(f,N d(A)) is a weak equivalence for all fibrant A.

(AHM, or does it? there is a prob here, but I need to run now…)

Hence C f is a weak equivalence.