# Diagonal functor

(Redirected from Diagonal mapping)

In category theory, for any object $a$ in any category $\mathcal{C}$ where the product $a\times a$ exists, there exists the diagonal morphism

$\delta_a : a \rightarrow a \times a$

satisfying

$\pi_k \circ \delta_a = id_a$ for $k \in \{ 1,2 \}$,

where $\pi_k$ is the canonical projection morphism to the $k$-th component. The existence of this morphism is a consequence of the universal property which characterizes the product (up to isomorphism). The restriction to binary products here is for ease of notation; diagonal morphisms exist similarly for arbitrary products. The image of a diagonal morphism in the category of sets, as a subset of the Cartesian product, is a relation on the domain, namely equality.

For concrete categories, the diagonal morphism can be simply described by its action on elements $x$ of the object $a$. Namely, $\delta_a(x) = \langle x,x \rangle$, the ordered pair formed from $x$. The reason for the name is that the image of such a diagonal morphism is diagonal (whenever it makes sense), for example the image of the diagonal morphism $\mathbb{R} \rightarrow \mathbb{R}^2$ on the real line is given by the line which is a graph of the equation $y=x$. The diagonal morphism into the infinite product $X^\infty$ may provide an injection into the space of sequences valued in $X$; each element maps to the constant sequence at that element. However, most notions of sequence spaces have convergence restrictions which the image of the diagonal map will fail to satisfy.

In particular, the category of small categories has products, and so one finds the diagonal functor $\mathcal{C} \rightarrow \mathcal{C} \times \mathcal{C}$ given by $\Delta(a) = \langle a,a \rangle$, 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 $\mathcal{C}$: a product $a \times b$ is a universal arrow from $\Delta$ to $\langle a,b \rangle$. The arrow comprises the projection maps.

More generally, in any functor category $\mathcal{C}^\mathcal{J}$ (here $\mathcal{J}$ should be thought of as a small index category), for each object $a$ in $\mathcal{C}$, there is a constant functor with fixed object $a$: $\Delta(a) \in \mathcal{C}^\mathcal{J}$. The diagonal functor $\Delta : \mathcal{C} \rightarrow \mathcal{C}^\mathcal{J}$ assigns to each object of $\mathcal{C}$ the functor $\Delta(a)$, and to each morphism $f: a \rightarrow b$ in $\mathcal{C}$ the obvious natural transformation $\eta$ in $\mathcal{C}^\mathcal{J}$ (given by $\eta_j = f$). In the case that $\mathcal{J}$ is a discrete category with two objects, the diagonal functor $\mathcal{C} \rightarrow \mathcal{C} \times \mathcal{C}$ is recovered.

Diagonal functors provide a way to define limits and colimits of functors. The limit of any functor $\mathcal{F} : \mathcal{J} \rightarrow \mathcal{C}$ is a universal arrow from $\Delta$ to $\mathcal{F}$ and a colimit is a universal arrow $F \rightarrow \Delta$. If every functor from $\mathcal{J}$ to $\mathcal{C}$ has a limit (which will be the case if $\mathcal{C}$ is complete), then the operation of taking limits is itself a functor from $\mathcal{C}^\mathcal{J}$ to $\mathcal{C}$. 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 $\mathcal{C} \rightarrow \mathcal{C} \times \mathcal{C}$ described above is the left-adjoint of the binary product functor and the right-adjoint of the binary coproduct functor.