Lesson plan
Diagonal functor
In category theory, a branch of mathematics, the diagonal functor \mathcal{C} \rightarrow \mathcal{C} \times \mathcal{C} is 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, given a small index category \mathcal{J} , one may construct the functor category \mathcal{C}^\mathcal{J} , the objects of which are called diagrams. For each object a in \mathcal{C} , there is a constant diagram \Delta_a : \mathcal{J} \to \mathcal{C} that maps every object in \mathcal{J} to a and every morphism in \mathcal{J} to 1_a . The diagonal functor \Delta : \mathcal{C} \rightarrow \mathcal{C}^\mathcal{J} assigns to each object a of \mathcal{C} the diagram \Delta_a , and to each morphism f: a \rightarrow b in \mathcal{C} the natural transformation \eta in \mathcal{C}^\mathcal{J} (given for every object j of \mathcal{J} by \eta_j = f ). Thus, for example, 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 diagrams.…
Article summary
In category theory, a branch of mathematics, the diagonal functor \mathcal{C} \rightarrow \mathcal{C} \times \mathcal{C} is 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, given a small index category \mathcal{J} , one may construct the functor category \mathcal{C}^\mathcal{J} , the objects of which are called diagrams. For each object a in \mathcal{C} , there is a constant diagram \Delta_a : \mathcal{J} \to \mathcal{C} that maps every object in \mathcal{J} to a and every morphism in \mathcal{J} to 1_a . The diagonal functor \Delta : \mathcal{C} \rightarrow \mathcal{C}^\mathcal{J} assigns to each object a of \mathcal{C} the diagram \Delta_a , and to each morphism f: a \rightarrow b in \mathcal{C} the natural transformation \eta in \mathcal{C}^\mathcal{J} (given for every object j of \mathcal{J} by \eta_j = f ). Thus, for example, 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 diagrams.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.