Anna Williams, 17 October 2025 Definition of natural transformation \begin{code} {-# OPTIONS --safe --without-K #-} open import MLTT.Spartan open import Categories.Pre open import Categories.Notation.Pre open import Categories.Notation.Functor open import Categories.Functor open import Categories.Functor-Composition module Categories.NaturalTransformation where \end{code} The definition of a natural transformation is in the usual way. For two functors, F : A → B and G : A → B. We have: * gamma : for every object, a : obj, there exists γ : hom (F a) (G a), and * a proof of naturality: for objects, a b : obj A, and homomorphism, f : hom a b, we have that G f ∘ gamma a = gamma b ∘ F f. \begin{code} record NaturalTransformation {A : Precategory 𝓤 𝓥} {B : Precategory 𝓦 𝓣} (F' G' : Functor A B) : (𝓤 ⊔ 𝓥 ⊔ 𝓣)̇ where constructor nat-trans open PrecategoryNotation A open PrecategoryNotation B open FunctorNotation F' renaming (functor-map to F ; fobj to Fobj) open FunctorNotation G' renaming (functor-map to G ; fobj to Gobj) field transf : (a : obj A) → hom (F {{Fobj}} a) (G {{Gobj}} a) private γ = transf field natural : {a b : obj A} (f : hom a b) → G f ◦ γ a = γ b ◦ F f \end{code} The identity natural transformation. \begin{code} id-natural-transformation : {A : Precategory 𝓤 𝓥} {B : Precategory 𝓦 𝓣} (F : Functor A B) → NaturalTransformation F F id-natural-transformation {_} {_} {_} {_} {A} {B} F' = nat-trans (λ _ → 𝒊𝒅) inter where open PrecategoryNotation A open PrecategoryNotation B open FunctorNotation F' renaming (functor-map to F) inter : {a b : obj A} (f : hom a b) → (F f) ◦ 𝒊𝒅 = 𝒊𝒅 ◦ F f inter f = (F f) ◦ 𝒊𝒅 =⟨ 𝒊𝒅-is-right-neutral (F f) ⟩ F f =⟨ (𝒊𝒅-is-left-neutral (F f))⁻¹ ⟩ 𝒊𝒅 ◦ F f ∎ \end{code} Natural transformation composition with a functor. \begin{code} module _ {A : Precategory 𝓤 𝓥} {B : Precategory 𝓦 𝓣} {C : Precategory 𝓤' 𝓥'} where open PrecategoryNotation A open PrecategoryNotation B open PrecategoryNotation C _·_ : {G H : Functor B C} → NaturalTransformation G H → (F : Functor A B) → NaturalTransformation (G F∘ F) (H F∘ F) _·_ {G'} {H'} N F' = nat-trans (μ ∘ F) nat-condition where open FunctorNotation F' renaming (functor-map to F) open FunctorNotation G' renaming (functor-map to G) open FunctorNotation H' renaming (functor-map to H) μ = NaturalTransformation.transf N naturality = NaturalTransformation.natural N nat-condition : {a b : obj A} (f : hom a b) → H (F f) ◦ μ (F a) = μ (F b) ◦ G (F f) nat-condition f = naturality (F f) _·'_ : {G H : Functor A B} → (F : Functor B C) → NaturalTransformation G H → NaturalTransformation (F F∘ G) (F F∘ H) _·'_ {G'} {H'} F' N = nat-trans (λ a → F (μ a)) nat-condition where open FunctorNotation F' renaming (functor-map to F) open FunctorNotation G' renaming (functor-map to G) open FunctorNotation H' renaming (functor-map to H) μ = NaturalTransformation.transf N naturality = NaturalTransformation.natural N nat-condition : {a b : obj A} (f : hom a b) → F (H f) ◦ F (μ a) = F (μ b) ◦ F (G f) nat-condition {a} {b} f = F (H f) ◦ F (μ a) =⟨ I ⟩ F (H f ◦ μ a) =⟨ II ⟩ F (μ b ◦ G f) =⟨ III ⟩ F (μ b) ◦ F (G f) ∎ where I = (distributivity (H f) (μ a))⁻¹ II = ap F (naturality f) III = distributivity (μ b) (G f) \end{code} Composition \begin{code} _N∘_ : {A : Precategory 𝓤 𝓥} {B : Precategory 𝓦 𝓣} → {F G H : Functor A B} → NaturalTransformation G H → NaturalTransformation F G → NaturalTransformation F H _N∘_ {_} {_} {_} {_} {A} {B} {F'} {G'} {H'} N M = nat-trans (λ a → (μ a) ◦ (ε a)) naturality where open PrecategoryNotation A open PrecategoryNotation B open FunctorNotation F' renaming (functor-map to F) open FunctorNotation G' renaming (functor-map to G) open FunctorNotation H' renaming (functor-map to H) μ = NaturalTransformation.transf N ε = NaturalTransformation.transf M natμ = NaturalTransformation.natural N natε = NaturalTransformation.natural M naturality : {a b : obj A} (f : hom a b) → H f ◦ (μ a ◦ ε a) = (μ b ◦ ε b) ◦ F f naturality {a} {b} f = H f ◦ (μ a ◦ ε a) =⟨ assoc _ _ _ ⟩ (H f ◦ μ a) ◦ ε a =⟨ ap (_◦ ε a) (natμ f) ⟩ (μ b ◦ G f) ◦ ε a =⟨ (assoc _ _ _)⁻¹ ⟩ μ b ◦ (G f ◦ ε a) =⟨ ap (μ b ◦_) (natε f) ⟩ μ b ◦ (ε b ◦ F f) =⟨ assoc _ _ _ ⟩ (μ b ◦ ε b) ◦ F f ∎ \end{code}