Diogo Andrade
Back to notes

A Primer on Categories, Presheaves, and Simplicial Sets

Categories and posets

A category C\mathcal C consists of objects and, for each pair of objects x,yx,y, a set Hom⁡C(x,y)\operatorname{Hom}_{\mathcal C}(x,y) of morphisms. Composition is associative and each object xx has an identity idx\mathrm{id}_x.

A partially ordered set, or poset, is a set PP with a reflexive, antisymmetric, and transitive relation ≤\leq. A poset is itself a category. Its objects are the elements of PP, and there is one arrow x→yx\to y if x≤yx\leq y. Reflexivity supplies the identities and transitivity supplies composition.

The simplex category Δ\Delta is the category of finite nonempty ordinals [n]={0<1<⋯<n}[n]=\{0<1<\cdots<n\} and weakly increasing maps. Two families of maps do much of the work:

  • The face map δi:[n−1]→[n]\delta_i:[n-1]\to[n] misses ii and is strictly increasing.
  • The degeneracy map σi:[n]→[n−1]\sigma_i:[n]\to[n-1] repeats ii and is surjective.

For example, the face maps [0]→[1][0]\to[1] select the two endpoints. The degeneracy map [1]→[0][1]\to[0] sends both endpoints to the same point. Every map in Δ\Delta factors uniquely as a surjection onto its image followed by the inclusion of that image. In particular, each surjection is a composite of degeneracy maps.

Functors and natural transformations

A functor F:C→DF:\mathcal C\to\mathcal D assigns objects and morphisms while preserving identities and composition. Functors between posets are order-preserving maps. Another example comes from a group GG. Form the one-object category BGBG with GG as its endomorphisms. A functor BG→SetBG\to\mathbf{Set} is a left GG-set.

A natural transformation η:F⇒G\eta:F\Rightarrow G gives a morphism ηc:F(c)→G(c)\eta_c:F(c)\to G(c) for every object cc so that for each f:c→df:c\to d,

G(f)∘ηc=ηd∘F(f). G(f)\circ\eta_c=\eta_d\circ F(f).
Both sides go from F(c)F(c) to G(d)G(d). This is the naturality square written as an equation.

Presheaves, limits, and colimits

A presheaf on C\mathcal C is a functor X:Cop→SetX:\mathcal C^{\mathrm{op}}\to\mathbf{Set}. Each object cc determines a representable presheaf Hom⁡C(−,c)\operatorname{Hom}_{\mathcal C}(-,c). Its restriction map along f:x→yf:x\to y sends g:y→cg:y\to c to g∘fg\circ f.

The Yoneda lemma says that evaluating a natural transformation at idc\mathrm{id}_c gives a bijection

Nat⁡(Hom⁡C(−,c),X)≅X(c). \operatorname{Nat}(\operatorname{Hom}_{\mathcal C}(-,c),X)\cong X(c).
To see the inverse, take a∈X(c)a\in X(c). At an object dd, send each g:d→cg:d\to c to X(g)(a)X(g)(a). Naturality forces precisely this formula. Taking XX representable gives the fully faithful Yoneda embedding of C\mathcal C into its presheaf category.

Let F:J→CF:J\to\mathcal C be a diagram. A cone with apex cc is a family λj:c→F(j)\lambda_j:c\to F(j) compatible with the arrows in JJ. Its universal object, when it exists, represents the presheaf Cone⁡(−,F)\operatorname{Cone}(-,F):

Hom⁡C(c,lim⁡JF)≅Cone⁡(c,F). \operatorname{Hom}_{\mathcal C}(c,\lim_J F)\cong\operatorname{Cone}(c,F).
Equivalently, a limit cone is a terminal object in the category of cones. The colimit is the dual construction, using cocones and an initial object.

The category of elements of a presheaf XX has objects (c,a)(c,a) with a∈X(c)a\in X(c). An arrow (c,a)→(d,b)(c,a)\to(d,b) is an arrow f:c→df:c\to d for which X(f)(b)=aX(f)(b)=a. This construction lets us regard all the elements of a presheaf, at all objects of C\mathcal C, in a single category.

Simplicial sets

A simplicial set is a presheaf XX on Δ\Delta. Write Xn=X([n])X_n=X([n]). Applying XX to δi\delta_i gives a face operator di:Xn→Xn−1d_i:X_n\to X_{n-1}, and applying it to σi\sigma_i gives a degeneracy operator si:Xn−1→Xns_i:X_{n-1}\to X_n.

A simplex x∈Xnx\in X_n is degenerate if x=X(α)(y)x=X(\alpha)(y) for some surjection α:[n]→[m]\alpha:[n]\to[m] with m<nm<n and y∈Xmy\in X_m. Using the factorization of surjections in Δ\Delta, prove that this is equivalent to xx being in the image of a single sis_i.

The standard simplex Δn\Delta^n is the presheaf represented by [n][n], so that

(Δn)m=Hom⁡Δ([m],[n]). (\Delta^n)_m=\operatorname{Hom}_\Delta([m],[n]).
Yoneda identifies a map Δn→X\Delta^n\to X with an nn-simplex of XX. This gives a precise meaning to the idea of building XX by gluing together standard simplices.

Exercises

  1. For a covariant functor F:C→SetF:\mathcal C\to\mathbf{Set}, identify its category of elements with the comma category {∗}↓F\{\ast\}\downarrow F.
  2. Find a terminal object of the slice category C/c\mathcal C_{/c} and show that it is terminal.
  3. View Hom⁡C(−,−)\operatorname{Hom}_{\mathcal C}(-,-) as a functor Cop×C→Set\mathcal C^{\mathrm{op}}\times\mathcal C\to\mathbf{Set}. Describe the objects and arrows of its category of elements. Why is it called the twisted arrow category?
  4. Prove that the projection from the category of elements of a presheaf to C\mathcal C is a discrete right fibration. Formulate and prove the dual statement for a covariant functor.
  5. Show that limits and colimits of presheaves are computed objectwise.
  6. Show that XX is the colimit of the diagram of representables Hom⁡C(−,c)\operatorname{Hom}_{\mathcal C}(-,c) indexed by its category of elements. At an object dd, the maps into X(d)X(d) send (c,a,g:d→c)(c,a,g:d\to c) to X(g)(a)X(g)(a). Apply this to simplicial sets.

Adapted from the Lecture 1 preparatory notes for the Seminar on ∞-categories.