vote up 7 vote down
star
2

Is there a 'classification' of the endofunctors F: Δ --> Δ where Δ denotes the simplex category with objects [n] and the weakly monotone maps [m] --> [n] as morphisms (Actually, I don't know if 'simplex category' is the right name)?

For instance there is a shift functor S: Δ --> Δ defined by S([n])=[n+1] on objects and S(d): [m+1] --> [n+1] being d on [m] and mapping m+1 to n+1 for a morphism d: [m]-->[n]. Hence for a simplicial set X one gets a path-object XoS.

flag
2 
I think "simplex category" is a good name. Some people call it "the simplicial category" but one also often finds "a simplicial category" meaning "a category enriched over simplicial sets." Another unambiguous, though longer, name would be "the simplicial indexing category." – Mike Shulman Nov 2 at 6:09

2 Answers

vote up 3 vote down

I don't know such a classification, though I'm interested. Another standard endofunctor is op:Δ -> Δ which is the identity on objects but which relabels morphisms by reversing the sense of the ordering in each set [n].

Thus, if NC is the nerve of a category, op(NC) = NCop.

Edit: Here is a thought which might lead to a classification.

Given an endofunctor F: Δ->Δ, there is a restriction functor F*: S->S, where S=Psh(Δ, Set) = simplical sets. This has a left adjoint F#, which on representable presheaves is isomorphic to the original functor F. So F is determined by F#, which is determined by the value of F* on representables.

Write Kn = F*Δ[n].

Since F* preserves limits, we know that K0 = 1 (terminal object.) For all n, there is a monomorphism Δ[n] -> Δ[1]n (n-fold product), and we can use this to regard Kn as a subobject of (K1)n.

Finally, you can get Δ[n], for n>2, as an inverse limit of a diagram involving Δ[1], Δ[2], and/or products thereof.

Thus, the functor F is basically determined once you know the simplicial set K1 and the subobject K2 of (K1)2.

(More is true. In the above, what I'm really doing is using the fact that S is the classifying topos for linear orders. In other words, adjoint pairs G: S <==> E: H where E is a topos, and the left adjoint G preserves finite limits, correspond to "objects in E equipped with a linear order". In this case, E=S, and G=F*, the object of E with a linear order is K1, and the linear order is the "relation" K2 on K1. This fact discussed, for instance, in Mac Lane & Moerdijk, Sheaves in Geometry and Logic.)

link|flag
vote up 2 vote down

More examples:

  • the functor Δ → Δ sending a totally ordered set S to S ∐ S, where the elements in the left copy are all less than the elements in the right copy. Restriction along this functor is the "edgewise subdivision", e.g., it sends Δ2 to a complex with four nondegenerate 2-simplices whose geometric realization is homeomorphic to |Δ2|.

  • the functor Δ → Δ sending S to Sop ∐ S. Restriction along this functor sends the nerve of a category C to the nerve of the twisted arrow category of C.

I guess all the examples I know can be built out of objects of Δ, op, and the join Δ × Δ → Δ.

link|flag

Your Answer

Get an OpenID
or

Not the answer you're looking for? Browse other questions tagged or ask your own question.