Blog Archive

Sunday, August 16, 2026

The Grothendieck Construction for Cat-Valued Functors

 

Let

F:CCat

be a strict functor. One may think of F as a family of categories varying over C: for every object cC there is a category F(c), and for every morphism

f:cd

there is a functor

F(f):F(c)F(d).

The Grothendieck construction packages these categories and the transport between them into a single category, denoted by

CF.

An object of CF is a pair

(c,x),xObF(c).

The interesting part is the morphisms. A morphism

(c,x)(d,y)

consists of a morphism

f:cd

in C, together with a morphism

α:F(f)(x)y

in F(d). We write such a morphism as

(f,α):(c,x)(d,y).

Equivalently,

HomCF((c,x),(d,y))=f:cdHomF(d)(F(f)x,y).

This should be compared with the category of elements of a functor

F:CSet.

If a set is regarded as a discrete category, then a morphism

F(f)xy

exists if and only if

F(f)x=y.

Thus the ordinary category of elements is simply the special case of the Grothendieck construction in which every fibre is discrete.

The composition law is where the categorical nature of the fibres becomes visible. Suppose that we have

(c,x)(f,α)(d,y)(g,β)(e,z).

The types of the two fibre morphisms are

α:F(f)xyin F(d),

and

β:F(g)yzin F(e).

In particular, the expression

βα

does not make sense. The two morphisms do not even lie in the same category, and the target of α is y, whereas the source of β is F(g)y.

However, since

F(g):F(d)F(e)

is a functor, we may apply it to α. This gives

F(g)(α):F(g)F(f)xF(g)y.

Now the types match:

F(g)F(f)xF(g)(α)F(g)yβz.

Since F is strict,

F(g)F(f)=F(gf),

and therefore

F(gf)xF(g)(α)F(g)yβz.

Hence the composite is

(g,β)(f,α)=(gf,βF(g)(α)).

In this sense the composition formula is almost forced by type checking.

There is also a useful way to decompose every morphism. Given

(f,α):(c,x)(d,y),

we may factor it as

(c,x)(f,id)(d,F(f)x)(idd,α)(d,y).

The first morphism moves along the base category, while the second stays inside the fibre F(d). It is therefore natural to call them horizontal and vertical morphisms.

Suppose now that

α:uv

is a morphism in F(d) and

g:de.

We can first move vertically and then transport along g:

(d,u)(id,α)(d,v)(g,id)(e,F(g)v).

Alternatively, we may first transport u and then apply the transported morphism

F(g)(α):F(g)uF(g)v.

Thus

(d,u)(g,id)(e,F(g)u)(id,F(g)(α))(e,F(g)v).

The two composites agree. Symbolically, a vertical morphism can be moved past a horizontal transport, provided that it is replaced by its image under F(g):

VHHV.

This explains the composition law geometrically. Two morphisms, each written in horizontal-vertical form, initially give

HVHV.

The middle VH may be exchanged to obtain

HHVV,

after which the two horizontal morphisms and the two vertical morphisms can be composed:

HVHVHHVVHV.

The formula

(g,β)(f,α)=(gf,βF(g)(α))

is exactly the algebraic expression of this rewriting.

A number of familiar constructions arise in this way.

If a group G acts on a set X, the action is a functor

BGSetCat.

The objects of the Grothendieck construction are the elements of X, and

Hom(x,y)={gGgx=y}.

Thus the Grothendieck construction is the action groupoid

X//G.

If G acts by order automorphisms on a poset P, regarded as a category, then a morphism from x to y consists of a group element g together with a morphism

gxy

in P. Since morphisms in a poset correspond to inequalities,

Hom(x,y)={gGgxy}.

This gives the transporter category associated to the G-poset P.

Another important example is the semidirect product. Suppose that G acts on a group H by automorphisms,

φ:GAut(H).

Regard G and H as one-object categories BG and BH. The action determines a functor

F:BGCat,F()=BH.

The Grothendieck construction again has only one object. Its endomorphisms may be identified with pairs

(h,g)H×G.

The general composition formula becomes

(h,g)(h,g)=(hφg(h),gg),

up to the convention used for ordering the two components. This is precisely the multiplication law of the semidirect product. Hence

BGBHB(HφG).

From this point of view, the twisting term

φg(h)

is simply the transported fibre morphism

F(g)(h).

There is one point in the preceding discussion where strictness was essential. In defining composition we used the equality

F(g)F(f)=F(gf).

For a pseudofunctor this equality is replaced by a specified natural isomorphism

μg,f:F(g)F(f)F(gf).

Suppose again that

(c,x)(f,α)(d,y)(g,β)(e,z).

We still obtain

F(g)(α):F(g)F(f)xF(g)y

and hence

βF(g)(α):F(g)F(f)xz.

But the fibre component of a morphism lying over

gf:ce

must have source

F(gf)x.

Since F(g)F(f)x and F(gf)x are no longer literally equal, we insert the coherence isomorphism:

F(gf)xμg,f,x1F(g)F(f)xF(g)(α)F(g)yβz.

Thus the composition becomes

(g,β)(f,α)=(gf,βF(g)(α)μg,f,x1).

Similarly, the strict equality

F(idc)=IdF(c)

must be replaced by a unit isomorphism. The coherence axioms of a pseudofunctor ensure that the resulting composition is associative and unital.

Thus the passage from strict functors to pseudofunctors amounts to replacing equalities of transport by coherent natural isomorphisms:

strict equalitiescoherent isomorphisms.

Finally, the Grothendieck construction comes with a natural projection

p:CFC,

defined by

(c,x)c

and

(f,α)f.

For a covariant functor

F:CCat,

this projection is naturally an opfibration. Conversely, after choosing suitable opcartesian lifts, an opfibration over C determines a pseudofunctor from C to Cat.

This is the Grothendieck correspondence:

pseudofunctors CCatopfibrations over C.

 

Popular Posts