The category of elements of a functor Set is a category sitting over the domain category , such that the fiber over an object is the set .
This is a special case of the Grothendieck construction.
We may think of Set as the classifying space of “Set-bundles;” see generalized universal bundle. The category of elements of is, in this sense, the Set-bundle classified by . It comes equipped with a projection to which is a discrete fibration, and provides an equivalence between presheaves and discrete fibrations.
Forming a category of elements can be thought of as “unpacking” a concrete category. For example, consider a concrete category consisting of two objects and two non-trivial morphisms
The individual elements of are “unpacked” and become objects of the new category. The “unpacked” morphisms are inherited in the obvious way from morphisms of .
Note that an “unpacked” category of elements can be “repackaged”.
The generalization of the category of elements for functors landing in Cat, rather than just , is called the Grothendieck construction.
Given a functor , the category of elements or (or obvious variations) may be understood in any of these equivalent ways:
It is the category whose objects are pairs where is an object in and is an element in and morphisms are morphisms such that .
It is the pullback along of the universal Set-bundle
where is the forgetful functor from pointed sets to sets.
It is the comma category , where is the inclusion of the one-point set and is itself:
Its opposite is the comma category , where is the Yoneda embedding and is the functor which picks out itself:
is also often written with coend notation as , , or . This suggests the fact the set of objects of the category of elements is the disjoint union (sum) of all of the sets .
When is a concrete category and the functor is simply the forgetful functor, we can define a functor
This is intended to illustrate the concept that constructing a category of elements is like “unpacking” or “exploding” a category into its elements.
In the case that is the delooping groupoid of a group , a functor is a permutation representation of and its category of elements is the corresponding action groupoid .
category of elements