Diagonal functor

From HandWiki

In category theory, a branch of mathematics, the diagonal functor 𝒞𝒞×𝒞 is given by Δ(a)=a,a, which maps objects as well as morphisms. This functor can be employed to give a succinct alternate description of the product of objects within the category 𝒞: a product a×b is a universal arrow from Δ to a,b. The arrow comprises the projection maps. More generally, given a small index category 𝒥, one may construct the functor category 𝒞𝒥, the objects of which are called diagrams. For each object a in 𝒞, there is a constant diagram Δa:𝒥𝒞 that maps every object in 𝒥 to a and every morphism in 𝒥 to 1a. The diagonal functor Δ:𝒞𝒞𝒥 assigns to each object a of 𝒞 the diagram Δa, and to each morphism f:ab in 𝒞 the natural transformation η in 𝒞𝒥 (given for every object j of 𝒥 by ηj=f). Thus, for example, in the case that 𝒥 is a discrete category with two objects, the diagonal functor 𝒞𝒞×𝒞 is recovered.

Diagonal functors provide a way to define limits and colimits of diagrams. Given a diagram :𝒥𝒞, a natural transformation Δa (for some object a of 𝒞) is called a cone for . These cones and their factorizations correspond precisely to the objects and morphisms of the comma category (Δ), and a limit of is a terminal object in (Δ), i.e., a universal arrow Δ. Dually, a colimit of is an initial object in the comma category (Δ), i.e., a universal arrow Δ.

If every functor from 𝒥 to 𝒞 has a limit (which will be the case if 𝒞 is complete), then the operation of taking limits is itself a functor from 𝒞𝒥 to 𝒞. The limit functor is the right-adjoint of the diagonal functor. Similarly, the colimit functor (which exists if the category is cocomplete) is the left-adjoint of the diagonal functor. For example, the diagonal functor 𝒞𝒞×𝒞 described above is the left-adjoint of the binary product functor and the right-adjoint of the binary coproduct functor.

See also

References

  • Mac Lane, Saunders; Moerdijk, Ieke (1992). Sheaves in geometry and logic a first introduction to topos theory. New York: Springer-Verlag. pp. 20–23. ISBN 9780387977102.