Density theorem (category theory)

From testwiki
Jump to navigation Jump to search

In category theory, a branch of mathematics, the density theorem states that every presheaf of sets is a colimit of representable presheaves in a canonical way.[1]

For example, by definition, a simplicial set is a presheaf on the simplex category Δ and a representable simplicial set is exactly of the form Δn=Hom⁡(−,[n]) (called the standard n-simplex) so the theorem says: for each simplicial set X,

X≃lim→Δn

where the colim runs over an index category determined by X.

Statement

Let F be a presheaf on a category C; i.e., an object of the functor category C^=𝐅𝐜𝐭(Cop,𝐒𝐞𝐭). For an index category over which a colimit will run, let I be the category of elements of F: it is the category where

  1. an object is a pair (U,x) consisting of an object U in C and an element x∈F(U),
  2. a morphism (U,x)→(V,y) consists of a morphism u:U→V in C such that (Fu)(y)=x.

It comes with the forgetful functor p:I→C.

Then F is the colimit of the diagram (i.e., a functor)

I→pC→C^

where the second arrow is the Yoneda embedding: U↦hU=Hom⁡(−,U).

Proof

Let f denote the above diagram. To show the colimit of f is F, we need to show: for every presheaf G on C, there is a natural bijection:

HomC^(F,G)≃Hom⁡(f,ΔG)

where ΔG is the constant functor with value G and Hom on the right means the set of natural transformations. This is because the universal property of a colimit amounts to saying lim→− is the left adjoint to the diagonal functor Δ−.

For this end, let α:f→ΔG be a natural transformation. It is a family of morphisms indexed by the objects in I:

αU,x:f(U,x)=hU→ΔG(U,x)=G

that satisfies the property: for each morphism (U,x)→(V,y),u:U→V in I, αV,y∘hu=αU,x (since f((U,x)→(V,y))=hu.)

The Yoneda lemma says there is a natural bijection G(U)≃Hom⁡(hU,G). Under this bijection, αU,x corresponds to a unique element gU,x∈G(U). We have:

(Gu)(gV,y)=gU,x

because, according to the Yoneda lemma, Gu:G(V)→G(U) corresponds to −∘hu:Hom⁡(hV,G)→Hom⁡(hU,G).

Now, for each object U in C, let θU:F(U)→G(U) be the function given by θU(x)=gU,x. This determines the natural transformation θ:F→G; indeed, for each morphism (U,x)→(V,y),u:U→V in I, we have:

(Gu∘θV)(y)=(Gu)(gV,y)=gU,x=(θU∘Fu)(y),

since (Fu)(y)=x. Clearly, the construction α↦θ is reversible. Hence, α↦θ is the requisite natural bijection.

Notes

Template:Reflist

References