Natural isomorphisms #

For the most part, natural isomorphisms are just another sort of isomorphism.

We provide some special support for extracting components:

if α : F ≅ G, then a.app X : F.obj X ≅ G.obj X, and building natural isomorphisms from components:

NatIso.ofComponents
  (app : ∀ X : C, F.obj X ≅ G.obj X)
  (naturality : ∀ {X Y : C} (f : X ⟶ Y), F.map f ≫ (app Y).hom = (app X).hom ≫ G.map f) :
F ≅ G

only needing to check naturality in one direction.

Implementation #

Note that NatIso is a namespace without a corresponding definition; we put some declarations that are specifically about natural isomorphisms in the Iso namespace so that they are available using dot notation.

source

@[simp]

theorem CategoryTheory.Iso.app_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

(α.app X).hom = α.hom.app X

source

@[simp]

theorem CategoryTheory.Iso.app_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

(α.app X).inv = α.inv.app X

source

def CategoryTheory.Iso.app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

F.toPrefunctor.obj X ≅ G.toPrefunctor.obj X

The application of a natural isomorphism to an object. We put this definition in a different namespace, so that we can use α.app

Equations

α.app X = CategoryTheory.Iso.mk (α.hom.app X) (α.inv.app X)

Instances For

source

@[simp]

theorem CategoryTheory.Iso.hom_inv_id_app_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) {Z : D} (h : F.toPrefunctor.obj X ⟶ Z) :

CategoryTheory.CategoryStruct.comp (α.hom.app X) (CategoryTheory.CategoryStruct.comp (α.inv.app X) h) = h

source

@[simp]

theorem CategoryTheory.Iso.hom_inv_id_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

CategoryTheory.CategoryStruct.comp (α.hom.app X) (α.inv.app X) = CategoryTheory.CategoryStruct.id (F.toPrefunctor.obj X)

source

@[simp]

theorem CategoryTheory.Iso.inv_hom_id_app_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) {Z : D} (h : G.toPrefunctor.obj X ⟶ Z) :

CategoryTheory.CategoryStruct.comp (α.inv.app X) (CategoryTheory.CategoryStruct.comp (α.hom.app X) h) = h

source

@[simp]

theorem CategoryTheory.Iso.inv_hom_id_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

CategoryTheory.CategoryStruct.comp (α.inv.app X) (α.hom.app X) = CategoryTheory.CategoryStruct.id (G.toPrefunctor.obj X)

source

@[simp]

theorem CategoryTheory.NatIso.trans_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {H : CategoryTheory.Functor C D} (α : F ≅ G) (β : G ≅ H) (X : C) :

(α ≪≫ β).app X = α.app X ≪≫ β.app X

source

theorem CategoryTheory.NatIso.app_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

(α.app X).hom = α.hom.app X

source

theorem CategoryTheory.NatIso.app_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

(α.app X).inv = α.inv.app X

source

instance CategoryTheory.NatIso.hom_app_isIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

CategoryTheory.IsIso (α.hom.app X)

Equations

(_ : CategoryTheory.IsIso (α.hom.app X)) = (_ : CategoryTheory.IsIso (α.hom.app X))

source

instance CategoryTheory.NatIso.inv_app_isIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) (X : C) :

CategoryTheory.IsIso (α.inv.app X)

Equations

(_ : CategoryTheory.IsIso (α.inv.app X)) = (_ : CategoryTheory.IsIso (α.inv.app X))

Unfortunately we need a separate set of cancellation lemmas for components of natural isomorphisms, because the simp normal form is α.hom.app X, rather than α.app.hom X.

(With the later, the morphism would be visibly part of an isomorphism, so general lemmas about isomorphisms would apply.)

In the future, we should consider a redesign that changes this simp norm form, but for now it breaks too many proofs.

source

@[simp]

theorem CategoryTheory.NatIso.cancel_natIso_hom_left {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) {X : C} {Z : D} (g : G.toPrefunctor.obj X ⟶ Z) (g' : G.toPrefunctor.obj X ⟶ Z) :

CategoryTheory.CategoryStruct.comp (α.hom.app X) g = CategoryTheory.CategoryStruct.comp (α.hom.app X) g' ↔ g = g'

source

@[simp]

theorem CategoryTheory.NatIso.cancel_natIso_inv_left {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) {X : C} {Z : D} (g : F.toPrefunctor.obj X ⟶ Z) (g' : F.toPrefunctor.obj X ⟶ Z) :

CategoryTheory.CategoryStruct.comp (α.inv.app X) g = CategoryTheory.CategoryStruct.comp (α.inv.app X) g' ↔ g = g'

source

@[simp]

theorem CategoryTheory.NatIso.cancel_natIso_hom_right {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) {X : D} {Y : C} (f : X ⟶ F.toPrefunctor.obj Y) (f' : X ⟶ F.toPrefunctor.obj Y) :

CategoryTheory.CategoryStruct.comp f (α.hom.app Y) = CategoryTheory.CategoryStruct.comp f' (α.hom.app Y) ↔ f = f'

source

@[simp]

theorem CategoryTheory.NatIso.cancel_natIso_inv_right {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) {X : D} {Y : C} (f : X ⟶ G.toPrefunctor.obj Y) (f' : X ⟶ G.toPrefunctor.obj Y) :

CategoryTheory.CategoryStruct.comp f (α.inv.app Y) = CategoryTheory.CategoryStruct.comp f' (α.inv.app Y) ↔ f = f'

source

@[simp]

theorem CategoryTheory.NatIso.cancel_natIso_hom_right_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) {W : D} {X : D} {X' : D} {Y : C} (f : W ⟶ X) (g : X ⟶ F.toPrefunctor.obj Y) (f' : W ⟶ X') (g' : X' ⟶ F.toPrefunctor.obj Y) :

CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp g (α.hom.app Y)) = CategoryTheory.CategoryStruct.comp f' (CategoryTheory.CategoryStruct.comp g' (α.hom.app Y)) ↔ CategoryTheory.CategoryStruct.comp f g = CategoryTheory.CategoryStruct.comp f' g'

source

@[simp]

theorem CategoryTheory.NatIso.cancel_natIso_inv_right_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ≅ G) {W : D} {X : D} {X' : D} {Y : C} (f : W ⟶ X) (g : X ⟶ G.toPrefunctor.obj Y) (f' : W ⟶ X') (g' : X' ⟶ G.toPrefunctor.obj Y) :

CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp g (α.inv.app Y)) = CategoryTheory.CategoryStruct.comp f' (CategoryTheory.CategoryStruct.comp g' (α.inv.app Y)) ↔ CategoryTheory.CategoryStruct.comp f g = CategoryTheory.CategoryStruct.comp f' g'

source

@[simp]

theorem CategoryTheory.NatIso.inv_inv_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (e : F ≅ G) (X : C) :

CategoryTheory.inv (e.inv.app X) = e.hom.app X

source

theorem CategoryTheory.NatIso.naturality_1 {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {X : C} {Y : C} (α : F ≅ G) (f : X ⟶ Y) :

CategoryTheory.CategoryStruct.comp (α.inv.app X) (CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) (α.hom.app Y)) = G.toPrefunctor.map f

source

theorem CategoryTheory.NatIso.naturality_2 {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {X : C} {Y : C} (α : F ≅ G) (f : X ⟶ Y) :

CategoryTheory.CategoryStruct.comp (α.hom.app X) (CategoryTheory.CategoryStruct.comp (G.toPrefunctor.map f) (α.inv.app Y)) = F.toPrefunctor.map f

source

theorem CategoryTheory.NatIso.naturality_1' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {X : C} {Y : C} (α : F ⟶ G) (f : X ⟶ Y) :

∀ {x : CategoryTheory.IsIso (α.app X)}, CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (α.app X)) (CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) (α.app Y)) = G.toPrefunctor.map f

source

@[simp]

theorem CategoryTheory.NatIso.naturality_2'_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {X : C} {Y : C} (α : F ⟶ G) (f : X ⟶ Y) :

∀ {x : CategoryTheory.IsIso (α.app Y)} {Z : D} (h : F.toPrefunctor.obj Y ⟶ Z), CategoryTheory.CategoryStruct.comp (α.app X) (CategoryTheory.CategoryStruct.comp (G.toPrefunctor.map f) (CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (α.app Y)) h)) = CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) h

source

@[simp]

theorem CategoryTheory.NatIso.naturality_2' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {X : C} {Y : C} (α : F ⟶ G) (f : X ⟶ Y) :

∀ {x : CategoryTheory.IsIso (α.app Y)}, CategoryTheory.CategoryStruct.comp (α.app X) (CategoryTheory.CategoryStruct.comp (G.toPrefunctor.map f) (CategoryTheory.inv (α.app Y))) = F.toPrefunctor.map f

source

instance CategoryTheory.NatIso.isIso_app_of_isIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ⟶ G) [CategoryTheory.IsIso α] (X : C) :

CategoryTheory.IsIso (α.app X)

The components of a natural isomorphism are isomorphisms.

Equations

(_ : CategoryTheory.IsIso (α.app X)) = (_ : CategoryTheory.IsIso (α.app X))

source

@[simp]

theorem CategoryTheory.NatIso.isIso_inv_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ⟶ G) :

∀ {x : CategoryTheory.IsIso α} (X : C), (CategoryTheory.inv α).app X = CategoryTheory.inv (α.app X)

source

@[simp]

theorem CategoryTheory.NatIso.inv_map_inv_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] (F : CategoryTheory.Functor C (CategoryTheory.Functor D E)) {X : C} {Y : C} (e : X ≅ Y) (Z : D) :

CategoryTheory.inv ((F.toPrefunctor.map e.inv).app Z) = (F.toPrefunctor.map e.hom).app Z

source

@[simp]

theorem CategoryTheory.NatIso.ofComponents_inv_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (app : (X : C) → F.toPrefunctor.obj X ≅ G.toPrefunctor.obj X) (naturality : autoParam (∀ {X Y : C} (f : X ⟶ Y), CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) (app Y).hom = CategoryTheory.CategoryStruct.comp (app X).hom (G.toPrefunctor.map f)) _auto✝) (X : C) :

(CategoryTheory.NatIso.ofComponents app).inv.app X = (app X).inv

source

@[simp]

theorem CategoryTheory.NatIso.ofComponents_hom_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (app : (X : C) → F.toPrefunctor.obj X ≅ G.toPrefunctor.obj X) (naturality : autoParam (∀ {X Y : C} (f : X ⟶ Y), CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) (app Y).hom = CategoryTheory.CategoryStruct.comp (app X).hom (G.toPrefunctor.map f)) _auto✝) (X : C) :

(CategoryTheory.NatIso.ofComponents app).hom.app X = (app X).hom

source

def CategoryTheory.NatIso.ofComponents {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (app : (X : C) → F.toPrefunctor.obj X ≅ G.toPrefunctor.obj X) (naturality : autoParam (∀ {X Y : C} (f : X ⟶ Y), CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) (app Y).hom = CategoryTheory.CategoryStruct.comp (app X).hom (G.toPrefunctor.map f)) _auto✝) :

F ≅ G

Construct a natural isomorphism between functors by giving object level isomorphisms, and checking naturality only in the forward direction.

Equations

CategoryTheory.NatIso.ofComponents app = CategoryTheory.Iso.mk (CategoryTheory.NatTrans.mk fun (X : C) => (app X).hom) (CategoryTheory.NatTrans.mk fun (X : C) => (app X).inv)

Instances For

source

@[simp]

theorem CategoryTheory.NatIso.ofComponents.app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (app' : (X : C) → F.toPrefunctor.obj X ≅ G.toPrefunctor.obj X) (naturality : ∀ {X Y : C} (f : X ⟶ Y), CategoryTheory.CategoryStruct.comp (F.toPrefunctor.map f) (app' Y).hom = CategoryTheory.CategoryStruct.comp (app' X).hom (G.toPrefunctor.map f)) (X : C) :

(CategoryTheory.NatIso.ofComponents app').app X = app' X

source

theorem CategoryTheory.NatIso.isIso_of_isIso_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} (α : F ⟶ G) [∀ (X : C), CategoryTheory.IsIso (α.app X)] :

CategoryTheory.IsIso α

A natural transformation is an isomorphism if all its components are isomorphisms.

source

@[simp]

theorem CategoryTheory.NatIso.hcomp_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {H : CategoryTheory.Functor D E} {I : CategoryTheory.Functor D E} (α : F ≅ G) (β : H ≅ I) :

(CategoryTheory.NatIso.hcomp α β).inv = α.inv ◫ β.inv

source

@[simp]

theorem CategoryTheory.NatIso.hcomp_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {H : CategoryTheory.Functor D E} {I : CategoryTheory.Functor D E} (α : F ≅ G) (β : H ≅ I) :

(CategoryTheory.NatIso.hcomp α β).hom = α.hom ◫ β.hom

source

def CategoryTheory.NatIso.hcomp {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor C D} {H : CategoryTheory.Functor D E} {I : CategoryTheory.Functor D E} (α : F ≅ G) (β : H ≅ I) :

CategoryTheory.Functor.comp F H ≅ CategoryTheory.Functor.comp G I

Horizontal composition of natural isomorphisms.

Equations

CategoryTheory.NatIso.hcomp α β = CategoryTheory.Iso.mk (α.hom ◫ β.hom) (α.inv ◫ β.inv)

Instances For

source

theorem CategoryTheory.NatIso.isIso_map_iff {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F₁ : CategoryTheory.Functor C D} {F₂ : CategoryTheory.Functor C D} (e : F₁ ≅ F₂) {X : C} {Y : C} (f : X ⟶ Y) :

CategoryTheory.IsIso (F₁.toPrefunctor.map f) ↔ CategoryTheory.IsIso (F₂.toPrefunctor.map f)

source

@[simp]

theorem CategoryTheory.Functor.copyObj_obj {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (obj : C → D) (e : (X : C) → F.toPrefunctor.obj X ≅ obj X) :

∀ (a : C), (CategoryTheory.Functor.copyObj F obj e).toPrefunctor.obj a = obj a

source

def CategoryTheory.Functor.copyObj {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (obj : C → D) (e : (X : C) → F.toPrefunctor.obj X ≅ obj X) :

CategoryTheory.Functor C D

Constructor for a functor that is isomorphic to a given functor F : C ⥤ D, while being definitionally equal on objects to a given map obj : C → D such that for all X : C, we have an isomorphism F.obj X ≅ obj X.

Equations