natural transformation and functor category [tt-001M]
natural transformation and functor category [tt-001M]
definition 1. natural transformation [leinster2016basic, 1.3.1] [tt-001E]
Given categories and functors
definition 1. natural transformation [leinster2016basic, 1.3.1] [tt-001E]
definition 2. pasting diagram [nakahira2023diagrammatic, table 1.1] [tt-003W]
definition 2. pasting diagram [nakahira2023diagrammatic, table 1.1] [tt-003W]
A pasting diagram represents categories as points (0-dimensional), arrows \(\to \) (1-dimensional), natural transformations as surfaces with level-2 arrows \(\Rightarrow \) (0-dimensional).
For example:
It's dual to a corresponding string diagram
definition 3. Nat [kostecki2011introduction, 4.4] [tt-001N]
The collection of natural transformations from functors \(\mathscr {F}\) to \(\mathscr {G}\) is denoted \(\operatorname {Nat}(\mathscr {F}, \mathscr {G})\).
definition 3. Nat [kostecki2011introduction, 4.4] [tt-001N]
notation 4. string diagrams: functor and natural transformation [marsden2014category, sec. 2] [tt-001G]
notation 4. string diagrams: functor and natural transformation [marsden2014category, sec. 2] [tt-001G]
In string diagrams,
- A functor \(\mathscr {F} : {\cal C} \to {\cal D}\) can be represented as an edge, commonly referred to as a wire:
- Functors compose from left to right:
- A natural transformation \(\alpha : \mathscr {F} \to \mathscr {F}'\) can be represented as a dot on the wire from top to bottem (the opposite direction of [marsden2014category], but the same as [sterling2023models]), connecting the two functors :
- Natural transformations (for the same pair of categories) compose vertically from top to bottem:
- Natural transformations (from different pairs of categories) compose horizontally from left to right:
- The two ways of composing natural transformations are related by the interchange law:
i.e. \[(\alpha \mathbin {\bullet } \alpha ') \mathbin {\bullet } (\beta \mathbin {\bullet } \beta ') = (\alpha \mathbin {\bullet } \beta ) \mathbin {\bullet } (\alpha ' \mathbin {\bullet } \beta ')\]
The naturality in natural transformations is equivalent to the following equality:
where \(X\) and \(X'\) are objects in \({\cal C}\), understood as functors from the terminal category \(\mathit {1}\) to \({\cal C}\).
👉
Since a string diagrams is composed from top to bottem, left to right, we can read
as \[(X \mathbin {\bullet } \mathscr {F}) \mathbin {\bullet } (\alpha _X) \mathbin {\bullet } (f \mathbin {\bullet } \mathscr {G})=(X' \mathbin {\bullet } \mathscr {G}) \quad {\large =} \quad (X \mathbin {\bullet } \mathscr {F}) \mathbin {\bullet } (f \mathbin {\bullet } \mathscr {F}) \mathbin {\bullet } (\alpha '_X)=(X' \mathbin {\bullet } \mathscr {G})\] where each pair of parentheses corresponds to an overlay in the string diagram, or with the notation in the opposite direction that is more familiar to most: \[\mathscr {G}(f) \circ \alpha _X \circ \mathscr {F}(X) = \mathscr {G}(X') \quad {\large =} \quad \alpha '_X \circ \mathscr {F}(f) \circ \mathscr {F}(X) = \mathscr {G}(X')\] Note that we read the wire from \(\mathscr {F}\) to \(\mathscr {G}\) as \(\mathscr {F}\) before the natural transformation, but as \(\mathscr {G}\) after the transformation.
Effectively naturality says that the natural transformation and function \(f\) “slide past each other”, and so we can draw them as two parallel wires to illustrate this.
definition 5. functor category [leinster2016basic, 1.3.6] [tt-001F]
definition 5. functor category [leinster2016basic, 1.3.6] [tt-001F]
The functor category from \({\cal C}\) to \({\cal D}\), denoted \([{\cal C}, {\cal D}]\) or \({\cal D}^{{\cal C}}\), is a category whose objects are functors from \({\cal C}\) to \({\cal D}\) and whose arrows are natural transformations between them, where composition is given by
and the identity is given by
remark 6. indexed, labelled [kostecki2011introduction, 4.5] [tt-001P]
remark 6. indexed, labelled [kostecki2011introduction, 4.5] [tt-001P]
One can think of a functor category \([{\cal C}, {\cal D}]\) or \({\cal D}^{{\cal C}}\) as a category of diagrams in \(D\) indexed (or labelled) by the objects from \({\cal C}\).
This particularly makes sense in a diagram.
definition 7. natural isomorphism [kostecki2011introduction, 4.2] [tt-001H]
definition 7. natural isomorphism [kostecki2011introduction, 4.2] [tt-001H]
A natural transformation \(\sigma : \mathscr {F} \to \mathscr {G}\) between functors \(\mathscr {F}: {\cal C} \to {\cal D}\) and \(\mathscr {G} : {\cal C} \to {\cal D}\) is called a natural isomorphism or a natural equivalence, denoted \(\sigma : \mathscr {F} \cong \mathscr {G}\), if each component \(\sigma _X : \mathscr {F}(X) \to \mathscr {G}(X)\) is an isomorphism in \({\cal D}\), i.e. \(\mathscr {F}(X) \underset {\sigma _X}{\cong } \mathscr {G}(X)\).
We call \(\mathscr {F}\) and \(\mathscr {G}\) naturally isomorphic to each other.
We also say that \(\mathscr {F}(X) \cong \mathscr {G}(X)\) naturally in \(X\) [leinster2016basic, 1.3.12].
Diagramatically,
lemma 8. natural isomorphism [leinster2016basic, 1.3.10] [tt-001I]
lemma 8. natural isomorphism [leinster2016basic, 1.3.10] [tt-001I]
A natural isomorphism between functors from categories \({\cal C}\) and \({\cal D}\) is an isomorphism in the functor category \([{\cal C}, {\cal D}]\).
definition 9. isomorphism of categories [kostecki2011introduction, 4.3] [tt-001J]
definition 9. isomorphism of categories [kostecki2011introduction, 4.3] [tt-001J]
The cateories \({\cal C}\) and \({\cal D}\) are called isomorphic, denoted \({\cal C} \cong {\cal D}\), iff there exists functors
such that \[\mathit {1}_{{\cal C}}=\mathscr {F} \mathbin {\bullet } \mathscr {G}\] and \[\mathit {1}_{{\cal D}}=\mathscr {G} \mathbin {\bullet } \mathscr {F} \]
definition 10. equivalence of categories [kostecki2011introduction, 4.3] [tt-001K]
definition 10. equivalence of categories [kostecki2011introduction, 4.3] [tt-001K]
The categories \({\cal C}\) and \({\cal D}\) are called equivalent, denoted \({\cal C} \simeq {\cal D}\), iff there exist functors
together with natural isomorphisms
\[\mathit {1}_{{\cal C}} \cong \mathscr {F} \mathbin {\bullet } \mathscr {G}\] and \[\mathscr {G} \mathbin {\bullet } \mathscr {F} \cong \mathit {1}_{{\cal D}} \]