Cones and cocones

We define Cone F, a cone over a functor F, and F.cones : Cᵒᵖ ⥤ Type, the functor associating to X the cones over F with cone point X.

A cone c is defined by specifying its cone point c.pt and a natural transformation c.π from the constant c.pt valued functor to F.

We provide c.w f : c.π.app j ≫ F.map f = c.π.app j' for any f : j ⟶ j' as a wrapper for c.π.naturality f avoiding unneeded identity morphisms.

We define c.extend f, where c : cone F and f : Y ⟶ c.pt for some other Y, which replaces the cone point by Y and inserts f into each of the components of the cone. Similarly we have c.whisker F producing a Cone (E ⋙ F)

We define morphisms of cones, and the category of cones.

We define Cone.postcompose α : cone F ⥤ cone G for α a natural transformation F ⟶ G.

And, of course, we dualise all this to cocones as well.

For more results about the category of cones, see cone_category.lean.

def CategoryTheory.Functor.cones {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Functor Cᵒᵖ (Type (max u₁ v₃))

If F : J ⥤ C then F.cones is the functor assigning to an object X : C the type of natural transformations from the constant functor with value X to F. An object representing this functor is a limit of F.

Equations

• F.cones = (CategoryTheory.Functor.const J).op.comp (CategoryTheory.yoneda.obj F)

@[simp]

theorem CategoryTheory.Functor.cones_map_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) (a✝ : (yoneda.obj F).obj ((const J).op.obj X✝)) (X : J) : (F.cones.map f a✝).app X = CategoryStruct.comp f.unop (a✝.app X)

@[simp]

theorem CategoryTheory.Functor.cones_obj {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (X : Cᵒᵖ) : F.cones.obj X = ((const J).obj (Opposite.unop X) ⟶ F)

def CategoryTheory.Functor.cocones {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Functor C (Type (max u₁ v₃))

If F : J ⥤ C then F.cocones is the functor assigning to an object (X : C) the type of natural transformations from F to the constant functor with value X. An object corepresenting this functor is a colimit of F.

Equations

• F.cocones = (CategoryTheory.Functor.const J).comp (CategoryTheory.coyoneda.obj (Opposite.op F))

@[simp]

theorem CategoryTheory.Functor.cocones_obj {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (X : C) : F.cocones.obj X = (F ⟶ (const J).obj X)

@[simp]

theorem CategoryTheory.Functor.cocones_map_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) (a✝ : (coyoneda.obj (Opposite.op F)).obj ((const J).obj X✝)) (X : J) : (F.cocones.map f a✝).app X = CategoryStruct.comp (a✝.app X) f

def CategoryTheory.cones (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] : Functor (Functor J C) (Functor Cᵒᵖ (Type (max u₁ v₃)))

Functorially associated to each functor J ⥤ C, we have the C-presheaf consisting of cones with a given cone point.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.cones_map_app_app (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] {X✝ Y✝ : Functor J C} (f : X✝ ⟶ Y✝) (X : Cᵒᵖ) (a✝ : (yoneda.obj X✝).obj ((Functor.const J).op.obj X)) (X✝¹ : J) : (((cones J C).map f).app X a✝).app X✝¹ = CategoryStruct.comp (a✝.app X✝¹) (f.app X✝¹)

@[simp]

theorem CategoryTheory.cones_obj_obj (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] (F : Functor J C) (X : Cᵒᵖ) : ((cones J C).obj F).obj X = ((Functor.const J).obj (Opposite.unop X) ⟶ F)

@[simp]

theorem CategoryTheory.cones_obj_map_app (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] (F : Functor J C) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) (a✝ : (yoneda.obj F).obj ((Functor.const J).op.obj X✝)) (X : J) : (((cones J C).obj F).map f a✝).app X = CategoryStruct.comp f.unop (a✝.app X)

def CategoryTheory.cocones (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] : Functor (Functor J C)ᵒᵖ (Functor C (Type (max u₁ v₃)))

Contravariantly associated to each functor J ⥤ C, we have the C-copresheaf consisting of cocones with a given cocone point.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.cocones_obj_map_app (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] (F : (Functor J C)ᵒᵖ) {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) (a✝ : (coyoneda.obj (Opposite.op (Opposite.unop F))).obj ((Functor.const J).obj X✝)) (X : J) : (((cocones J C).obj F).map f a✝).app X = CategoryStruct.comp (a✝.app X) f

@[simp]

theorem CategoryTheory.cocones_obj_obj (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] (F : (Functor J C)ᵒᵖ) (X : C) : ((cocones J C).obj F).obj X = (Opposite.unop F ⟶ (Functor.const J).obj X)

@[simp]

theorem CategoryTheory.cocones_map_app_app (J : Type u₁) [Category.{v₁, u₁} J] (C : Type u₃) [Category.{v₃, u₃} C] {X✝ Y✝ : (Functor J C)ᵒᵖ} (f : X✝ ⟶ Y✝) (X : C) (a✝ : (coyoneda.obj X✝).obj ((Functor.const J).obj X)) (X✝¹ : J) : (((cocones J C).map f).app X a✝).app X✝¹ = CategoryStruct.comp (f.unop.app X✝¹) (a✝.app X✝¹)

structure CategoryTheory.Limits.Cone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Type (max (max u₁ u₃) v₃)

A c : Cone F is:

• an object c.pt and
• a natural transformation c.π : c.pt ⟶ F from the constant c.pt functor to F.

Example: if J is a category coming from a poset then the data required to make a term of type Cone F is morphisms πⱼ : c.pt ⟶ F j for all j : J and, for all i ≤ j in J, morphisms πᵢⱼ : F i ⟶ F j such that πᵢ ≫ πᵢⱼ = πᵢ.

Cone F is equivalent, via cone.equiv below, to Σ X, F.cones.obj X.

• pt : C

  An object of C

• π : (Functor.const J).obj self.pt ⟶ F

  A natural transformation from the constant functor at X to F

instance CategoryTheory.Limits.inhabitedCone {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor (Discrete PUnit.{u_1 + 1}) C) : Inhabited (Cone F)

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cone.w {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) {j j' : J} (f : j ⟶ j') : CategoryStruct.comp (c.π.app j) (F.map f) = c.π.app j'

@[simp]

theorem CategoryTheory.Limits.Cone.w_assoc {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) {j j' : J} (f : j ⟶ j') {Z : C} (h : F.obj j' ⟶ Z) : CategoryStruct.comp (c.π.app j) (CategoryStruct.comp (F.map f) h) = CategoryStruct.comp (c.π.app j') h

structure CategoryTheory.Limits.Cocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Type (max (max u₁ u₃) v₃)

A c : Cocone F is

• an object c.pt and
• a natural transformation c.ι : F ⟶ c.pt from F to the constant c.pt functor.

For example, if the source J of F is a partially ordered set, then to give c : Cocone F is to give a collection of morphisms ιⱼ : F j ⟶ c.pt and, for all j ≤ k in J, morphisms ιⱼₖ : F j ⟶ F k such that Fⱼₖ ≫ Fₖ = Fⱼ for all j ≤ k.

Cocone F is equivalent, via Cone.equiv below, to Σ X, F.cocones.obj X.

• pt : C

  An object of C

• ι : F ⟶ (Functor.const J).obj self.pt

  A natural transformation from F to the constant functor at pt

instance CategoryTheory.Limits.inhabitedCocone {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor (Discrete PUnit.{u_1 + 1}) C) : Inhabited (Cocone F)

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.Limits.Cocone.w {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) {j j' : J} (f : j ⟶ j') : CategoryStruct.comp (F.map f) (c.ι.app j') = c.ι.app j

@[simp]

theorem CategoryTheory.Limits.Cocone.w_assoc {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) {j j' : J} (f : j ⟶ j') {Z : C} (h : ((Functor.const J).obj c.pt).obj j' ⟶ Z) : CategoryStruct.comp (F.map f) (CategoryStruct.comp (c.ι.app j') h) = CategoryStruct.comp (c.ι.app j) h

def CategoryTheory.Limits.Cone.equiv {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Cone F ≅ (X : Cᵒᵖ) × F.cones.obj X

The isomorphism between a cone on F and an element of the functor F.cones.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cone.equiv_inv_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (c : (X : Cᵒᵖ) × F.cones.obj X) : ((equiv F).inv c).pt = Opposite.unop c.fst

@[simp]

theorem CategoryTheory.Limits.Cone.equiv_hom_snd {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (c : Cone F) : ((equiv F).hom c).snd = c.π

@[simp]

theorem CategoryTheory.Limits.Cone.equiv_hom_fst {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (c : Cone F) : ((equiv F).hom c).fst = Opposite.op c.pt

@[simp]

theorem CategoryTheory.Limits.Cone.equiv_inv_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (c : (X : Cᵒᵖ) × F.cones.obj X) : ((equiv F).inv c).π = c.snd

def CategoryTheory.Limits.Cone.extensions {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : (yoneda.obj c.pt).comp uliftFunctor.{u₁, v₃} ⟶ F.cones

A map to the vertex of a cone naturally induces a cone by composition.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cone.extensions_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) (x✝ : Cᵒᵖ) (f : ((yoneda.obj c.pt).comp uliftFunctor.{u₁, v₃}).obj x✝) : c.extensions.app x✝ f = CategoryStruct.comp ((Functor.const J).map f.down) c.π

def CategoryTheory.Limits.Cone.extend {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) {X : C} (f : X ⟶ c.pt) : Cone F

A map to the vertex of a cone induces a cone by composition.

Equations

• c.extend f = { pt := X, π := c.extensions.app (Opposite.op X) { down := f } }

@[simp]

theorem CategoryTheory.Limits.Cone.extend_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) {X : C} (f : X ⟶ c.pt) : (c.extend f).π = c.extensions.app (Opposite.op X) { down := f }

@[simp]

theorem CategoryTheory.Limits.Cone.extend_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) {X : C} (f : X ⟶ c.pt) : (c.extend f).pt = X

def CategoryTheory.Limits.Cone.whisker {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cone F) : Cone (E.comp F)

Whisker a cone by precomposition of a functor.

Equations

• CategoryTheory.Limits.Cone.whisker E c = { pt := c.pt, π := CategoryTheory.whiskerLeft E c.π }

@[simp]

theorem CategoryTheory.Limits.Cone.whisker_π {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cone F) : (whisker E c).π = whiskerLeft E c.π

@[simp]

theorem CategoryTheory.Limits.Cone.whisker_pt {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cone F) : (whisker E c).pt = c.pt

def CategoryTheory.Limits.Cocone.equiv {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Cocone F ≅ (X : C) × F.cocones.obj X

The isomorphism between a cocone on F and an element of the functor F.cocones.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.Limits.Cocone.extensions {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : (coyoneda.obj (Opposite.op c.pt)).comp uliftFunctor.{u₁, v₃} ⟶ F.cocones

A map from the vertex of a cocone naturally induces a cocone by composition.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocone.extensions_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) (x✝ : C) (f : ((coyoneda.obj (Opposite.op c.pt)).comp uliftFunctor.{u₁, v₃}).obj x✝) : c.extensions.app x✝ f = CategoryStruct.comp c.ι ((Functor.const J).map f.down)

def CategoryTheory.Limits.Cocone.extend {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) {Y : C} (f : c.pt ⟶ Y) : Cocone F

A map from the vertex of a cocone induces a cocone by composition.

Equations

• c.extend f = { pt := Y, ι := c.extensions.app Y { down := f } }

@[simp]

theorem CategoryTheory.Limits.Cocone.extend_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) {Y : C} (f : c.pt ⟶ Y) : (c.extend f).pt = Y

@[simp]

theorem CategoryTheory.Limits.Cocone.extend_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) {Y : C} (f : c.pt ⟶ Y) : (c.extend f).ι = c.extensions.app Y { down := f }

def CategoryTheory.Limits.Cocone.whisker {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cocone F) : Cocone (E.comp F)

Whisker a cocone by precomposition of a functor. See whiskering for a functorial version.

Equations

• CategoryTheory.Limits.Cocone.whisker E c = { pt := c.pt, ι := CategoryTheory.whiskerLeft E c.ι }

@[simp]

theorem CategoryTheory.Limits.Cocone.whisker_pt {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cocone F) : (whisker E c).pt = c.pt

@[simp]

theorem CategoryTheory.Limits.Cocone.whisker_ι {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cocone F) : (whisker E c).ι = whiskerLeft E c.ι

structure CategoryTheory.Limits.ConeMorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (A B : Cone F) : Type v₃

A cone morphism between two cones for the same diagram is a morphism of the cone points which commutes with the cone legs.

• hom : A.pt ⟶ B.pt

  A morphism between the two vertex objects of the cones

• w (j : J) : CategoryStruct.comp self.hom (B.π.app j) = A.π.app j

  The triangle consisting of the two natural transformations and hom commutes

@[simp]

theorem CategoryTheory.Limits.ConeMorphism.w_assoc {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {A B : Cone F} (self : ConeMorphism A B) (j : J) {Z : C} (h : F.obj j ⟶ Z) : CategoryStruct.comp self.hom (CategoryStruct.comp (B.π.app j) h) = CategoryStruct.comp (A.π.app j) h

instance CategoryTheory.Limits.inhabitedConeMorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (A : Cone F) : Inhabited (ConeMorphism A A)

Equations

• CategoryTheory.Limits.inhabitedConeMorphism A = { default := { hom := CategoryTheory.CategoryStruct.id A.pt, w := ⋯ } }

instance CategoryTheory.Limits.Cone.category {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} : Category.{v₃, max (max u₃ u₁) v₃} (Cone F)

The category of cones on a given diagram.

Equations

• CategoryTheory.Limits.Cone.category = CategoryTheory.Category.mk ⋯ ⋯ ⋯

@[simp]

theorem CategoryTheory.Limits.Cone.category_comp_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {X✝ Y✝ Z✝ : Cone F} (f : X✝ ⟶ Y✝) (g : Y✝ ⟶ Z✝) : (CategoryStruct.comp f g).hom = CategoryStruct.comp f.hom g.hom

@[simp]

theorem CategoryTheory.Limits.Cone.category_id_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (B : Cone F) : (CategoryStruct.id B).hom = CategoryStruct.id B.pt

theorem CategoryTheory.Limits.ConeMorphism.ext {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cone F} (f g : c ⟶ c') (w : f.hom = g.hom) : f = g

def CategoryTheory.Limits.Cones.ext {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cone F} (φ : c.pt ≅ c'.pt) (w : ∀ (j : J), c.π.app j = CategoryStruct.comp φ.hom (c'.π.app j) := by aesop_cat) : c ≅ c'

To give an isomorphism between cones, it suffices to give an isomorphism between their vertices which commutes with the cone maps.

Equations

• CategoryTheory.Limits.Cones.ext φ w = { hom := { hom := φ.hom, w := ⋯ }, inv := { hom := φ.inv, w := ⋯ }, hom_inv_id := ⋯, inv_hom_id := ⋯ }

@[simp]

theorem CategoryTheory.Limits.Cones.ext_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cone F} (φ : c.pt ≅ c'.pt) (w : ∀ (j : J), c.π.app j = CategoryStruct.comp φ.hom (c'.π.app j) := by aesop_cat) : (ext φ w).inv.hom = φ.inv

@[simp]

theorem CategoryTheory.Limits.Cones.ext_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cone F} (φ : c.pt ≅ c'.pt) (w : ∀ (j : J), c.π.app j = CategoryStruct.comp φ.hom (c'.π.app j) := by aesop_cat) : (ext φ w).hom.hom = φ.hom

def CategoryTheory.Limits.Cones.eta {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : c ≅ { pt := c.pt, π := c.π }

Eta rule for cones.

Equations

• CategoryTheory.Limits.Cones.eta c = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl c.pt) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.eta_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : (eta c).hom.hom = CategoryStruct.id c.pt

@[simp]

theorem CategoryTheory.Limits.Cones.eta_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : (eta c).inv.hom = CategoryStruct.id c.pt

theorem CategoryTheory.Limits.Cones.cone_iso_of_hom_iso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {K : Functor J C} {c d : Cone K} (f : c ⟶ d) [i : IsIso f.hom] : IsIso f

Given a cone morphism whose object part is an isomorphism, produce an isomorphism of cones.

def CategoryTheory.Limits.Cones.extend {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X : C} (f : X ⟶ s.pt) : s.extend f ⟶ s

There is a morphism from an extended cone to the original cone.

Equations

• CategoryTheory.Limits.Cones.extend s f = { hom := f, w := ⋯ }

@[simp]

theorem CategoryTheory.Limits.Cones.extend_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X : C} (f : X ⟶ s.pt) : (extend s f).hom = f

def CategoryTheory.Limits.Cones.extendId {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) : s.extend (CategoryStruct.id s.pt) ≅ s

Extending a cone by the identity does nothing.

Equations

• CategoryTheory.Limits.Cones.extendId s = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (s.extend (CategoryTheory.CategoryStruct.id s.pt)).pt) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.extendId_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) : (extendId s).inv.hom = CategoryStruct.id s.pt

@[simp]

theorem CategoryTheory.Limits.Cones.extendId_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) : (extendId s).hom.hom = CategoryStruct.id s.pt

def CategoryTheory.Limits.Cones.extendComp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X Y : C} (f : X ⟶ Y) (g : Y ⟶ s.pt) : s.extend (CategoryStruct.comp f g) ≅ (s.extend g).extend f

Extending a cone by a composition is the same as extending the cone twice.

Equations

• CategoryTheory.Limits.Cones.extendComp s f g = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (s.extend (CategoryTheory.CategoryStruct.comp f g)).pt) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.extendComp_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X Y : C} (f : X ⟶ Y) (g : Y ⟶ s.pt) : (extendComp s f g).inv.hom = CategoryStruct.id X

@[simp]

theorem CategoryTheory.Limits.Cones.extendComp_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X Y : C} (f : X ⟶ Y) (g : Y ⟶ s.pt) : (extendComp s f g).hom.hom = CategoryStruct.id X

def CategoryTheory.Limits.Cones.extendIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X : C} (f : X ≅ s.pt) : s.extend f.hom ≅ s

A cone extended by an isomorphism is isomorphic to the original cone.

Equations

• CategoryTheory.Limits.Cones.extendIso s f = { hom := { hom := f.hom, w := ⋯ }, inv := { hom := f.inv, w := ⋯ }, hom_inv_id := ⋯, inv_hom_id := ⋯ }

@[simp]

theorem CategoryTheory.Limits.Cones.extendIso_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X : C} (f : X ≅ s.pt) : (extendIso s f).inv.hom = f.inv

@[simp]

theorem CategoryTheory.Limits.Cones.extendIso_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cone F) {X : C} (f : X ≅ s.pt) : (extendIso s f).hom.hom = f.hom

instance CategoryTheory.Limits.Cones.instIsIsoConeExtend {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {s : Cone F} {X : C} (f : X ⟶ s.pt) [IsIso f] : IsIso (extend s f)

def CategoryTheory.Limits.Cones.postcompose {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ⟶ G) : Functor (Cone F) (Cone G)

Functorially postcompose a cone for F by a natural transformation F ⟶ G to give a cone for G.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.postcompose_obj_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ⟶ G) (c : Cone F) : ((postcompose α).obj c).pt = c.pt

@[simp]

theorem CategoryTheory.Limits.Cones.postcompose_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ⟶ G) {X✝ Y✝ : Cone F} (f : X✝ ⟶ Y✝) : ((postcompose α).map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.Cones.postcompose_obj_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ⟶ G) (c : Cone F) : ((postcompose α).obj c).π = CategoryStruct.comp c.π α

def CategoryTheory.Limits.Cones.postcomposeComp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G H : Functor J C} (α : F ⟶ G) (β : G ⟶ H) : postcompose (CategoryStruct.comp α β) ≅ (postcompose α).comp (postcompose β)

Postcomposing a cone by the composite natural transformation α ≫ β is the same as postcomposing by α and then by β.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeComp_hom_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G H : Functor J C} (α : F ⟶ G) (β : G ⟶ H) (X : Cone F) : ((postcomposeComp α β).hom.app X).hom = CategoryStruct.id X.pt

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeComp_inv_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G H : Functor J C} (α : F ⟶ G) (β : G ⟶ H) (X : Cone F) : ((postcomposeComp α β).inv.app X).hom = CategoryStruct.id X.pt

def CategoryTheory.Limits.Cones.postcomposeId {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} : postcompose (CategoryStruct.id F) ≅ Functor.id (Cone F)

Postcomposing by the identity does not change the cone up to isomorphism.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeId_inv_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (X : Cone F) : (postcomposeId.inv.app X).hom = CategoryStruct.id X.pt

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeId_hom_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (X : Cone F) : (postcomposeId.hom.app X).hom = CategoryStruct.id X.pt

def CategoryTheory.Limits.Cones.postcomposeEquivalence {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ≅ G) : Cone F ≌ Cone G

If F and G are naturally isomorphic functors, then they have equivalent categories of cones.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeEquivalence_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ≅ G) : (postcomposeEquivalence α).unitIso = NatIso.ofComponents (fun (s : Cone F) => ext (Iso.refl ((Functor.id (Cone F)).obj s).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeEquivalence_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ≅ G) : (postcomposeEquivalence α).counitIso = NatIso.ofComponents (fun (s : Cone G) => ext (Iso.refl (((postcompose α.inv).comp (postcompose α.hom)).obj s).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeEquivalence_inverse {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ≅ G) : (postcomposeEquivalence α).inverse = postcompose α.inv

@[simp]

theorem CategoryTheory.Limits.Cones.postcomposeEquivalence_functor {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : F ≅ G) : (postcomposeEquivalence α).functor = postcompose α.hom

def CategoryTheory.Limits.Cones.whiskering {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) : Functor (Cone F) (Cone (E.comp F))

Whiskering on the left by E : K ⥤ J gives a functor from Cone F to Cone (E ⋙ F).

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.whiskering_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) {X✝ Y✝ : Cone F} (f : X✝ ⟶ Y✝) : ((whiskering E).map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.Cones.whiskering_obj {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cone F) : (whiskering E).obj c = Cone.whisker E c

def CategoryTheory.Limits.Cones.whiskeringEquivalence {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : Cone F ≌ Cone (e.functor.comp F)

Whiskering by an equivalence gives an equivalence between categories of cones.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.whiskeringEquivalence_inverse {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).inverse = (whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom)

@[simp]

theorem CategoryTheory.Limits.Cones.whiskeringEquivalence_functor {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).functor = whiskering e.functor

@[simp]

theorem CategoryTheory.Limits.Cones.whiskeringEquivalence_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).counitIso = NatIso.ofComponents (fun (s : Cone (e.functor.comp F)) => ext (Iso.refl ((((whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom)).comp (whiskering e.functor)).obj s).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.whiskeringEquivalence_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).unitIso = NatIso.ofComponents (fun (s : Cone F) => ext (Iso.refl ((Functor.id (Cone F)).obj s).pt) ⋯) ⋯

def CategoryTheory.Limits.Cones.equivalenceOfReindexing {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) : Cone F ≌ Cone G

The categories of cones over F and G are equivalent if F and G are naturally isomorphic (possibly after changing the indexing category by an equivalence).

Equations

• CategoryTheory.Limits.Cones.equivalenceOfReindexing e α = (CategoryTheory.Limits.Cones.whiskeringEquivalence e).trans (CategoryTheory.Limits.Cones.postcomposeEquivalence α)

@[simp]

theorem CategoryTheory.Limits.Cones.equivalenceOfReindexing_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) : (equivalenceOfReindexing e α).unitIso = NatIso.ofComponents (fun (s : Cone F) => ext (Iso.refl s.pt) ⋯) ⋯ ≪≫ isoWhiskerRight ((whiskering e.functor).rightUnitor.symm ≪≫ isoWhiskerLeft (whiskering e.functor) (NatIso.ofComponents (fun (s : Cone (e.functor.comp F)) => ext (Iso.refl s.pt) ⋯) ⋯) ≪≫ ((whiskering e.functor).associator (postcompose α.hom) (postcompose α.inv)).symm) ((whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom)) ≪≫ ((whiskering e.functor).comp (postcompose α.hom)).associator (postcompose α.inv) ((whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom))

@[simp]

theorem CategoryTheory.Limits.Cones.equivalenceOfReindexing_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) : (equivalenceOfReindexing e α).counitIso = (((postcompose α.inv).comp ((whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom))).associator (whiskering e.functor) (postcompose α.hom)).symm ≪≫ isoWhiskerRight ((postcompose α.inv).associator ((whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom)) (whiskering e.functor) ≪≫ isoWhiskerLeft (postcompose α.inv) (NatIso.ofComponents (fun (s : Cone (e.functor.comp F)) => ext (Iso.refl s.pt) ⋯) ⋯) ≪≫ (postcompose α.inv).rightUnitor) (postcompose α.hom) ≪≫ NatIso.ofComponents (fun (s : Cone G) => ext (Iso.refl s.pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.equivalenceOfReindexing_inverse {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) : (equivalenceOfReindexing e α).inverse = (postcompose α.inv).comp ((whiskering e.inverse).comp (postcompose (e.invFunIdAssoc F).hom))

@[simp]

theorem CategoryTheory.Limits.Cones.equivalenceOfReindexing_functor {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) : (equivalenceOfReindexing e α).functor = (whiskering e.functor).comp (postcompose α.hom)

def CategoryTheory.Limits.Cones.forget {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Functor (Cone F) C

Forget the cone structure and obtain just the cone point.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.forget_map {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) {X✝ Y✝ : Cone F} (f : X✝ ⟶ Y✝) : (forget F).map f = f.hom

@[simp]

theorem CategoryTheory.Limits.Cones.forget_obj {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (t : Cone F) : (forget F).obj t = t.pt

def CategoryTheory.Limits.Cones.functoriality {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) : Functor (Cone F) (Cone (F.comp G))

A functor G : C ⥤ D sends cones over F to cones over F ⋙ G functorially.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.functoriality_obj_π_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) (A : Cone F) (j : J) : ((functoriality F G).obj A).π.app j = G.map (A.π.app j)

@[simp]

theorem CategoryTheory.Limits.Cones.functoriality_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) {X✝ Y✝ : Cone F} (f : X✝ ⟶ Y✝) : ((functoriality F G).map f).hom = G.map f.hom

@[simp]

theorem CategoryTheory.Limits.Cones.functoriality_obj_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) (A : Cone F) : ((functoriality F G).obj A).pt = G.obj A.pt

def CategoryTheory.Limits.Cones.functorialityCompFunctoriality {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] (F : Functor J C) (G : Functor C D) (H : Functor D E) : (functoriality F G).comp (functoriality (F.comp G) H) ≅ functoriality F (G.comp H)

Functoriality is functorial.

Equations

• One or more equations did not get rendered due to their size.

instance CategoryTheory.Limits.Cones.functoriality_full {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) [G.Full] [G.Faithful] : (functoriality F G).Full

instance CategoryTheory.Limits.Cones.functoriality_faithful {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) [G.Faithful] : (functoriality F G).Faithful

def CategoryTheory.Limits.Cones.functorialityEquivalence {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : Cone F ≌ Cone (F.comp e.functor)

If e : C ≌ D is an equivalence of categories, then functoriality F e.functor induces an equivalence between cones over F and cones over F ⋙ e.functor.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cones.functorialityEquivalence_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).counitIso = NatIso.ofComponents (fun (c : Cone (F.comp e.functor)) => ext (e.counitIso.app c.pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.functorialityEquivalence_functor {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).functor = functoriality F e.functor

@[simp]

theorem CategoryTheory.Limits.Cones.functorialityEquivalence_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).unitIso = NatIso.ofComponents (fun (c : Cone F) => ext (e.unitIso.app ((Functor.id (Cone F)).obj c).1) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cones.functorialityEquivalence_inverse {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).inverse = (functoriality (F.comp e.functor) e.inverse).comp (postcomposeEquivalence (F.associator e.functor e.inverse ≪≫ isoWhiskerLeft F e.unitIso.symm ≪≫ F.rightUnitor)).functor

instance CategoryTheory.Limits.Cones.reflects_cone_isomorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor C D) [F.ReflectsIsomorphisms] (K : Functor J C) : (functoriality K F).ReflectsIsomorphisms

If F reflects isomorphisms, then Cones.functoriality F reflects isomorphisms as well.

structure CategoryTheory.Limits.CoconeMorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (A B : Cocone F) : Type v₃

A cocone morphism between two cocones for the same diagram is a morphism of the cocone points which commutes with the cocone legs.

• hom : A.pt ⟶ B.pt

  A morphism between the (co)vertex objects in C

• w (j : J) : CategoryStruct.comp (A.ι.app j) self.hom = B.ι.app j

  The triangle made from the two natural transformations and hom commutes

instance CategoryTheory.Limits.inhabitedCoconeMorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (A : Cocone F) : Inhabited (CoconeMorphism A A)

Equations

• CategoryTheory.Limits.inhabitedCoconeMorphism A = { default := { hom := CategoryTheory.CategoryStruct.id A.pt, w := ⋯ } }

@[simp]

theorem CategoryTheory.Limits.CoconeMorphism.w_assoc {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {A B : Cocone F} (self : CoconeMorphism A B) (j : J) {Z : C} (h : B.pt ⟶ Z) : CategoryStruct.comp (A.ι.app j) (CategoryStruct.comp self.hom h) = CategoryStruct.comp (B.ι.app j) h

instance CategoryTheory.Limits.Cocone.category {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} : Category.{v₃, max (max u₃ u₁) v₃} (Cocone F)

Equations

• CategoryTheory.Limits.Cocone.category = CategoryTheory.Category.mk ⋯ ⋯ ⋯

@[simp]

theorem CategoryTheory.Limits.Cocone.category_comp_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {X✝ Y✝ Z✝ : Cocone F} (f : X✝ ⟶ Y✝) (g : Y✝ ⟶ Z✝) : (CategoryStruct.comp f g).hom = CategoryStruct.comp f.hom g.hom

@[simp]

theorem CategoryTheory.Limits.Cocone.category_id_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (B : Cocone F) : (CategoryStruct.id B).hom = CategoryStruct.id B.pt

theorem CategoryTheory.Limits.CoconeMorphism.ext {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cocone F} (f g : c ⟶ c') (w : f.hom = g.hom) : f = g

def CategoryTheory.Limits.Cocones.ext {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cocone F} (φ : c.pt ≅ c'.pt) (w : ∀ (j : J), CategoryStruct.comp (c.ι.app j) φ.hom = c'.ι.app j := by aesop_cat) : c ≅ c'

To give an isomorphism between cocones, it suffices to give an isomorphism between their vertices which commutes with the cocone maps.

Equations

• CategoryTheory.Limits.Cocones.ext φ w = { hom := { hom := φ.hom, w := ⋯ }, inv := { hom := φ.inv, w := ⋯ }, hom_inv_id := ⋯, inv_hom_id := ⋯ }

@[simp]

theorem CategoryTheory.Limits.Cocones.ext_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cocone F} (φ : c.pt ≅ c'.pt) (w : ∀ (j : J), CategoryStruct.comp (c.ι.app j) φ.hom = c'.ι.app j := by aesop_cat) : (ext φ w).inv.hom = φ.inv

@[simp]

theorem CategoryTheory.Limits.Cocones.ext_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {c c' : Cocone F} (φ : c.pt ≅ c'.pt) (w : ∀ (j : J), CategoryStruct.comp (c.ι.app j) φ.hom = c'.ι.app j := by aesop_cat) : (ext φ w).hom.hom = φ.hom

def CategoryTheory.Limits.Cocones.eta {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : c ≅ { pt := c.pt, ι := c.ι }

Eta rule for cocones.

Equations

• CategoryTheory.Limits.Cocones.eta c = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl c.pt) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.eta_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : (eta c).inv.hom = CategoryStruct.id c.pt

@[simp]

theorem CategoryTheory.Limits.Cocones.eta_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : (eta c).hom.hom = CategoryStruct.id c.pt

theorem CategoryTheory.Limits.Cocones.cocone_iso_of_hom_iso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {K : Functor J C} {c d : Cocone K} (f : c ⟶ d) [i : IsIso f.hom] : IsIso f

Given a cocone morphism whose object part is an isomorphism, produce an isomorphism of cocones.

def CategoryTheory.Limits.Cocones.extend {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X : C} (f : s.pt ⟶ X) : s ⟶ s.extend f

There is a morphism from a cocone to its extension.

Equations

• CategoryTheory.Limits.Cocones.extend s f = { hom := f, w := ⋯ }

@[simp]

theorem CategoryTheory.Limits.Cocones.extend_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X : C} (f : s.pt ⟶ X) : (extend s f).hom = f

def CategoryTheory.Limits.Cocones.extendId {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) : s ≅ s.extend (CategoryStruct.id s.pt)

Extending a cocone by the identity does nothing.

Equations

• CategoryTheory.Limits.Cocones.extendId s = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl s.pt) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.extendId_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) : (extendId s).hom.hom = CategoryStruct.id s.pt

@[simp]

theorem CategoryTheory.Limits.Cocones.extendId_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) : (extendId s).inv.hom = CategoryStruct.id s.pt

def CategoryTheory.Limits.Cocones.extendComp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X Y : C} (f : s.pt ⟶ X) (g : X ⟶ Y) : s.extend (CategoryStruct.comp f g) ≅ (s.extend f).extend g

Extending a cocone by a composition is the same as extending the cone twice.

Equations

• CategoryTheory.Limits.Cocones.extendComp s f g = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl (s.extend (CategoryTheory.CategoryStruct.comp f g)).pt) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.extendComp_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X Y : C} (f : s.pt ⟶ X) (g : X ⟶ Y) : (extendComp s f g).hom.hom = CategoryStruct.id Y

@[simp]

theorem CategoryTheory.Limits.Cocones.extendComp_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X Y : C} (f : s.pt ⟶ X) (g : X ⟶ Y) : (extendComp s f g).inv.hom = CategoryStruct.id Y

def CategoryTheory.Limits.Cocones.extendIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X : C} (f : s.pt ≅ X) : s ≅ s.extend f.hom

A cocone extended by an isomorphism is isomorphic to the original cone.

Equations

• CategoryTheory.Limits.Cocones.extendIso s f = { hom := { hom := f.hom, w := ⋯ }, inv := { hom := f.inv, w := ⋯ }, hom_inv_id := ⋯, inv_hom_id := ⋯ }

@[simp]

theorem CategoryTheory.Limits.Cocones.extendIso_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X : C} (f : s.pt ≅ X) : (extendIso s f).hom.hom = f.hom

@[simp]

theorem CategoryTheory.Limits.Cocones.extendIso_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (s : Cocone F) {X : C} (f : s.pt ≅ X) : (extendIso s f).inv.hom = f.inv

instance CategoryTheory.Limits.Cocones.instIsIsoCoconeExtend {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {s : Cocone F} {X : C} (f : s.pt ⟶ X) [IsIso f] : IsIso (extend s f)

def CategoryTheory.Limits.Cocones.precompose {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ⟶ F) : Functor (Cocone F) (Cocone G)

Functorially precompose a cocone for F by a natural transformation G ⟶ F to give a cocone for G.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.precompose_obj_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ⟶ F) (c : Cocone F) : ((precompose α).obj c).pt = c.pt

@[simp]

theorem CategoryTheory.Limits.Cocones.precompose_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ⟶ F) {X✝ Y✝ : Cocone F} (f : X✝ ⟶ Y✝) : ((precompose α).map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.Cocones.precompose_obj_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ⟶ F) (c : Cocone F) : ((precompose α).obj c).ι = CategoryStruct.comp α c.ι

def CategoryTheory.Limits.Cocones.precomposeComp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G H : Functor J C} (α : F ⟶ G) (β : G ⟶ H) : precompose (CategoryStruct.comp α β) ≅ (precompose β).comp (precompose α)

Precomposing a cocone by the composite natural transformation α ≫ β is the same as precomposing by β and then by α.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.Limits.Cocones.precomposeId {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} : precompose (CategoryStruct.id F) ≅ Functor.id (Cocone F)

Precomposing by the identity does not change the cocone up to isomorphism.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.Limits.Cocones.precomposeEquivalence {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ≅ F) : Cocone F ≌ Cocone G

If F and G are naturally isomorphic functors, then they have equivalent categories of cocones.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.precomposeEquivalence_inverse {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ≅ F) : (precomposeEquivalence α).inverse = precompose α.inv

@[simp]

theorem CategoryTheory.Limits.Cocones.precomposeEquivalence_functor {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ≅ F) : (precomposeEquivalence α).functor = precompose α.hom

@[simp]

theorem CategoryTheory.Limits.Cocones.precomposeEquivalence_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ≅ F) : (precomposeEquivalence α).counitIso = NatIso.ofComponents (fun (s : Cocone G) => ext (Iso.refl (((precompose α.inv).comp (precompose α.hom)).obj s).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.precomposeEquivalence_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F G : Functor J C} (α : G ≅ F) : (precomposeEquivalence α).unitIso = NatIso.ofComponents (fun (s : Cocone F) => ext (Iso.refl ((Functor.id (Cocone F)).obj s).pt) ⋯) ⋯

def CategoryTheory.Limits.Cocones.whiskering {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) : Functor (Cocone F) (Cocone (E.comp F))

Whiskering on the left by E : K ⥤ J gives a functor from Cocone F to Cocone (E ⋙ F).

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.whiskering_obj {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) (c : Cocone F) : (whiskering E).obj c = Cocone.whisker E c

@[simp]

theorem CategoryTheory.Limits.Cocones.whiskering_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (E : Functor K J) {X✝ Y✝ : Cocone F} (f : X✝ ⟶ Y✝) : ((whiskering E).map f).hom = f.hom

def CategoryTheory.Limits.Cocones.whiskeringEquivalence {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : Cocone F ≌ Cocone (e.functor.comp F)

Whiskering by an equivalence gives an equivalence between categories of cones.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.whiskeringEquivalence_functor {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).functor = whiskering e.functor

@[simp]

theorem CategoryTheory.Limits.Cocones.whiskeringEquivalence_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).counitIso = NatIso.ofComponents (fun (s : Cocone (e.functor.comp F)) => ext (Iso.refl ((((whiskering e.inverse).comp (precompose (CategoryStruct.comp F.leftUnitor.inv (CategoryStruct.comp (whiskerRight e.counitIso.inv F) (e.inverse.associator e.functor F).inv)))).comp (whiskering e.functor)).obj s).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.whiskeringEquivalence_inverse {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).inverse = (whiskering e.inverse).comp (precompose (CategoryStruct.comp F.leftUnitor.inv (CategoryStruct.comp (whiskerRight e.counitIso.inv F) (e.inverse.associator e.functor F).inv)))

@[simp]

theorem CategoryTheory.Limits.Cocones.whiskeringEquivalence_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (e : K ≌ J) : (whiskeringEquivalence e).unitIso = NatIso.ofComponents (fun (s : Cocone F) => ext (Iso.refl ((Functor.id (Cocone F)).obj s).pt) ⋯) ⋯

def CategoryTheory.Limits.Cocones.equivalenceOfReindexing {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) : Cocone F ≌ Cocone G

The categories of cocones over F and G are equivalent if F and G are naturally isomorphic (possibly after changing the indexing category by an equivalence).

Equations

• CategoryTheory.Limits.Cocones.equivalenceOfReindexing e α = (CategoryTheory.Limits.Cocones.whiskeringEquivalence e).trans (CategoryTheory.Limits.Cocones.precomposeEquivalence α.symm)

@[simp]

theorem CategoryTheory.Limits.Cocones.equivalenceOfReindexing_functor_obj {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} {G : Functor K C} (e : K ≌ J) (α : e.functor.comp F ≅ G) (X : Cocone F) : (equivalenceOfReindexing e α).functor.obj X = (precompose α.inv).obj (Cocone.whisker e.functor X)

def CategoryTheory.Limits.Cocones.forget {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Functor (Cocone F) C

Forget the cocone structure and obtain just the cocone point.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.forget_map {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) {X✝ Y✝ : Cocone F} (f : X✝ ⟶ Y✝) : (forget F).map f = f.hom

@[simp]

theorem CategoryTheory.Limits.Cocones.forget_obj {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (t : Cocone F) : (forget F).obj t = t.pt

def CategoryTheory.Limits.Cocones.functoriality {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) : Functor (Cocone F) (Cocone (F.comp G))

A functor G : C ⥤ D sends cocones over F to cocones over F ⋙ G functorially.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.functoriality_obj_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) (A : Cocone F) : ((functoriality F G).obj A).pt = G.obj A.pt

@[simp]

theorem CategoryTheory.Limits.Cocones.functoriality_obj_ι_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) (A : Cocone F) (j : J) : ((functoriality F G).obj A).ι.app j = G.map (A.ι.app j)

@[simp]

theorem CategoryTheory.Limits.Cocones.functoriality_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) {X✝ Y✝ : Cocone F} (f : X✝ ⟶ Y✝) : ((functoriality F G).map f).hom = G.map f.hom

def CategoryTheory.Limits.Cocones.functorialityCompFunctoriality {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] (F : Functor J C) (G : Functor C D) (H : Functor D E) : (functoriality F G).comp (functoriality (F.comp G) H) ≅ functoriality F (G.comp H)

Functoriality is functorial.

Equations

• One or more equations did not get rendered due to their size.

instance CategoryTheory.Limits.Cocones.functoriality_full {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) [G.Full] [G.Faithful] : (functoriality F G).Full

instance CategoryTheory.Limits.Cocones.functoriality_faithful {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (G : Functor C D) [G.Faithful] : (functoriality F G).Faithful

def CategoryTheory.Limits.Cocones.functorialityEquivalence {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : Cocone F ≌ Cocone (F.comp e.functor)

If e : C ≌ D is an equivalence of categories, then functoriality F e.functor induces an equivalence between cocones over F and cocones over F ⋙ e.functor.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.Cocones.functorialityEquivalence_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).unitIso = NatIso.ofComponents (fun (c : Cocone F) => ext (e.unitIso.app ((Functor.id (Cocone F)).obj c).1) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.functorialityEquivalence_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).counitIso = NatIso.ofComponents (fun (c : Cocone (F.comp e.functor)) => ext (e.counitIso.app c.pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.Cocones.functorialityEquivalence_inverse {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).inverse = (functoriality (F.comp e.functor) e.inverse).comp (precomposeEquivalence (F.associator e.functor e.inverse ≪≫ isoWhiskerLeft F e.unitIso.symm ≪≫ F.rightUnitor).symm).functor

@[simp]

theorem CategoryTheory.Limits.Cocones.functorialityEquivalence_functor {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor J C) (e : C ≌ D) : (functorialityEquivalence F e).functor = functoriality F e.functor

instance CategoryTheory.Limits.Cocones.reflects_cocone_isomorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (F : Functor C D) [F.ReflectsIsomorphisms] (K : Functor J C) : (functoriality K F).ReflectsIsomorphisms

If F reflects isomorphisms, then Cocones.functoriality F reflects isomorphisms as well.

def CategoryTheory.Functor.mapCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} (c : Limits.Cone F) : Limits.Cone (F.comp H)

The image of a cone in C under a functor G : C ⥤ D is a cone in D.

Equations

• H.mapCone c = (CategoryTheory.Limits.Cones.functoriality F H).obj c

@[simp]

theorem CategoryTheory.Functor.mapCone_π_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} (c : Limits.Cone F) (j : J) : (H.mapCone c).π.app j = H.map (c.π.app j)

@[simp]

theorem CategoryTheory.Functor.mapCone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} (c : Limits.Cone F) : (H.mapCone c).pt = H.obj c.pt

noncomputable def CategoryTheory.Functor.mapConeMapCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] {F : Functor J C} {H : Functor C D} {H' : Functor D E} (c : Limits.Cone F) : H'.mapCone (H.mapCone c) ≅ (H.comp H').mapCone c

The construction mapCone respects functor composition.

Equations

• CategoryTheory.Functor.mapConeMapCone c = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (H'.mapCone (H.mapCone c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapConeMapCone_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] {F : Functor J C} {H : Functor C D} {H' : Functor D E} (c : Limits.Cone F) : (mapConeMapCone c).inv.hom = CategoryStruct.id (H'.obj (H.obj c.pt))

@[simp]

theorem CategoryTheory.Functor.mapConeMapCone_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] {F : Functor J C} {H : Functor C D} {H' : Functor D E} (c : Limits.Cone F) : (mapConeMapCone c).hom.hom = CategoryStruct.id (H'.obj (H.obj c.pt))

def CategoryTheory.Functor.mapCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} (c : Limits.Cocone F) : Limits.Cocone (F.comp H)

The image of a cocone in C under a functor G : C ⥤ D is a cocone in D.

Equations

• H.mapCocone c = (CategoryTheory.Limits.Cocones.functoriality F H).obj c

@[simp]

theorem CategoryTheory.Functor.mapCocone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} (c : Limits.Cocone F) : (H.mapCocone c).pt = H.obj c.pt

@[simp]

theorem CategoryTheory.Functor.mapCocone_ι_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} (c : Limits.Cocone F) (j : J) : (H.mapCocone c).ι.app j = H.map (c.ι.app j)

noncomputable def CategoryTheory.Functor.mapCoconeMapCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] {F : Functor J C} {H : Functor C D} {H' : Functor D E} (c : Limits.Cocone F) : H'.mapCocone (H.mapCocone c) ≅ (H.comp H').mapCocone c

The construction mapCocone respects functor composition.

Equations

• CategoryTheory.Functor.mapCoconeMapCocone c = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl (H'.mapCocone (H.mapCocone c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapCoconeMapCocone_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] {F : Functor J C} {H : Functor C D} {H' : Functor D E} (c : Limits.Cocone F) : (mapCoconeMapCocone c).hom.hom = CategoryStruct.id (H'.obj (H.obj c.pt))

@[simp]

theorem CategoryTheory.Functor.mapCoconeMapCocone_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {E : Type u₅} [Category.{v₅, u₅} E] {F : Functor J C} {H : Functor C D} {H' : Functor D E} (c : Limits.Cocone F) : (mapCoconeMapCocone c).inv.hom = CategoryStruct.id (H'.obj (H.obj c.pt))

def CategoryTheory.Functor.mapConeMorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {c c' : Limits.Cone F} (f : c ⟶ c') : H.mapCone c ⟶ H.mapCone c'

Given a cone morphism c ⟶ c', construct a cone morphism on the mapped cones functorially.

Equations

• H.mapConeMorphism f = (CategoryTheory.Limits.Cones.functoriality F H).map f

def CategoryTheory.Functor.mapCoconeMorphism {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {c c' : Limits.Cocone F} (f : c ⟶ c') : H.mapCocone c ⟶ H.mapCocone c'

Given a cocone morphism c ⟶ c', construct a cocone morphism on the mapped cocones functorially.

Equations

• H.mapCoconeMorphism f = (CategoryTheory.Limits.Cocones.functoriality F H).map f

noncomputable def CategoryTheory.Functor.mapConeInv {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} [H.IsEquivalence] (c : Limits.Cone (F.comp H)) : Limits.Cone F

If H is an equivalence, we invert H.mapCone and get a cone for F from a cone for F ⋙ H.

Equations

• H.mapConeInv c = (CategoryTheory.Limits.Cones.functorialityEquivalence F H.asEquivalence).inverse.obj c

noncomputable def CategoryTheory.Functor.mapConeMapConeInv {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J D} (H : Functor D C) [H.IsEquivalence] (c : Limits.Cone (F.comp H)) : H.mapCone (H.mapConeInv c) ≅ c

mapCone is the left inverse to mapConeInv.

Equations

• CategoryTheory.Functor.mapConeMapConeInv H c = (CategoryTheory.Limits.Cones.functorialityEquivalence F H.asEquivalence).counitIso.app c

noncomputable def CategoryTheory.Functor.mapConeInvMapCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J D} (H : Functor D C) [H.IsEquivalence] (c : Limits.Cone F) : H.mapConeInv (H.mapCone c) ≅ c

MapCone is the right inverse to mapConeInv.

Equations

• CategoryTheory.Functor.mapConeInvMapCone H c = (CategoryTheory.Limits.Cones.functorialityEquivalence F H.asEquivalence).unitIso.symm.app c

noncomputable def CategoryTheory.Functor.mapCoconeInv {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} [H.IsEquivalence] (c : Limits.Cocone (F.comp H)) : Limits.Cocone F

If H is an equivalence, we invert H.mapCone and get a cone for F from a cone for F ⋙ H.

Equations

• H.mapCoconeInv c = (CategoryTheory.Limits.Cocones.functorialityEquivalence F H.asEquivalence).inverse.obj c

noncomputable def CategoryTheory.Functor.mapCoconeMapCoconeInv {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J D} (H : Functor D C) [H.IsEquivalence] (c : Limits.Cocone (F.comp H)) : H.mapCocone (H.mapCoconeInv c) ≅ c

mapCocone is the left inverse to mapCoconeInv.

Equations

• CategoryTheory.Functor.mapCoconeMapCoconeInv H c = (CategoryTheory.Limits.Cocones.functorialityEquivalence F H.asEquivalence).counitIso.app c

noncomputable def CategoryTheory.Functor.mapCoconeInvMapCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J D} (H : Functor D C) [H.IsEquivalence] (c : Limits.Cocone F) : H.mapCoconeInv (H.mapCocone c) ≅ c

mapCocone is the right inverse to mapCoconeInv.

Equations

• CategoryTheory.Functor.mapCoconeInvMapCocone H c = (CategoryTheory.Limits.Cocones.functorialityEquivalence F H.asEquivalence).unitIso.symm.app c

def CategoryTheory.Functor.functorialityCompPostcompose {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') : (Limits.Cones.functoriality F H).comp (Limits.Cones.postcompose (whiskerLeft F α.hom)) ≅ Limits.Cones.functoriality F H'

functoriality F _ ⋙ postcompose (whisker_left F _) simplifies to functoriality F _.

Equations

• CategoryTheory.Functor.functorialityCompPostcompose α = CategoryTheory.NatIso.ofComponents (fun (c : CategoryTheory.Limits.Cone F) => CategoryTheory.Limits.Cones.ext (α.app c.pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.functorialityCompPostcompose_inv_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (X : Limits.Cone F) : ((functorialityCompPostcompose α).inv.app X).hom = α.inv.app X.pt

@[simp]

theorem CategoryTheory.Functor.functorialityCompPostcompose_hom_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (X : Limits.Cone F) : ((functorialityCompPostcompose α).hom.app X).hom = α.hom.app X.pt

def CategoryTheory.Functor.postcomposeWhiskerLeftMapCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (c : Limits.Cone F) : (Limits.Cones.postcompose (whiskerLeft F α.hom)).obj (H.mapCone c) ≅ H'.mapCone c

For F : J ⥤ C, given a cone c : Cone F, and a natural isomorphism α : H ≅ H' for functors H H' : C ⥤ D, the postcomposition of the cone H.mapCone using the isomorphism α is isomorphic to the cone H'.mapCone.

Equations

• CategoryTheory.Functor.postcomposeWhiskerLeftMapCone α c = (CategoryTheory.Functor.functorialityCompPostcompose α).app c

@[simp]

theorem CategoryTheory.Functor.postcomposeWhiskerLeftMapCone_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (c : Limits.Cone F) : (postcomposeWhiskerLeftMapCone α c).inv.hom = α.inv.app c.pt

@[simp]

theorem CategoryTheory.Functor.postcomposeWhiskerLeftMapCone_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (c : Limits.Cone F) : (postcomposeWhiskerLeftMapCone α c).hom.hom = α.hom.app c.pt

def CategoryTheory.Functor.mapConePostcompose {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ⟶ G} {c : Limits.Cone F} : H.mapCone ((Limits.Cones.postcompose α).obj c) ≅ (Limits.Cones.postcompose (whiskerRight α H)).obj (H.mapCone c)

mapCone commutes with postcompose. In particular, for F : J ⥤ C, given a cone c : Cone F, a natural transformation α : F ⟶ G and a functor H : C ⥤ D, we have two obvious ways of producing a cone over G ⋙ H, and they are both isomorphic.

Equations

• H.mapConePostcompose = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (H.mapCone ((CategoryTheory.Limits.Cones.postcompose α).obj c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapConePostcompose_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ⟶ G} {c : Limits.Cone F} : H.mapConePostcompose.inv.hom = CategoryStruct.id (H.obj c.pt)

@[simp]

theorem CategoryTheory.Functor.mapConePostcompose_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ⟶ G} {c : Limits.Cone F} : H.mapConePostcompose.hom.hom = CategoryStruct.id (H.obj c.pt)

def CategoryTheory.Functor.mapConePostcomposeEquivalenceFunctor {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ≅ G} {c : Limits.Cone F} : H.mapCone ((Limits.Cones.postcomposeEquivalence α).functor.obj c) ≅ (Limits.Cones.postcomposeEquivalence (isoWhiskerRight α H)).functor.obj (H.mapCone c)

mapCone commutes with postcomposeEquivalence

Equations

• H.mapConePostcomposeEquivalenceFunctor = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (H.mapCone ((CategoryTheory.Limits.Cones.postcomposeEquivalence α).functor.obj c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapConePostcomposeEquivalenceFunctor_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ≅ G} {c : Limits.Cone F} : H.mapConePostcomposeEquivalenceFunctor.hom.hom = CategoryStruct.id (H.obj c.pt)

@[simp]

theorem CategoryTheory.Functor.mapConePostcomposeEquivalenceFunctor_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ≅ G} {c : Limits.Cone F} : H.mapConePostcomposeEquivalenceFunctor.inv.hom = CategoryStruct.id (H.obj c.pt)

def CategoryTheory.Functor.functorialityCompPrecompose {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') : (Limits.Cocones.functoriality F H).comp (Limits.Cocones.precompose (whiskerLeft F α.inv)) ≅ Limits.Cocones.functoriality F H'

functoriality F _ ⋙ precompose (whiskerLeft F _) simplifies to functoriality F _.

Equations

• CategoryTheory.Functor.functorialityCompPrecompose α = CategoryTheory.NatIso.ofComponents (fun (c : CategoryTheory.Limits.Cocone F) => CategoryTheory.Limits.Cocones.ext (α.app c.pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.functorialityCompPrecompose_inv_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (X : Limits.Cocone F) : ((functorialityCompPrecompose α).inv.app X).hom = α.inv.app X.pt

@[simp]

theorem CategoryTheory.Functor.functorialityCompPrecompose_hom_app_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (X : Limits.Cocone F) : ((functorialityCompPrecompose α).hom.app X).hom = α.hom.app X.pt

def CategoryTheory.Functor.precomposeWhiskerLeftMapCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (c : Limits.Cocone F) : (Limits.Cocones.precompose (whiskerLeft F α.inv)).obj (H.mapCocone c) ≅ H'.mapCocone c

For F : J ⥤ C, given a cocone c : Cocone F, and a natural isomorphism α : H ≅ H' for functors H H' : C ⥤ D, the precomposition of the cocone H.mapCocone using the isomorphism α is isomorphic to the cocone H'.mapCocone.

Equations

• CategoryTheory.Functor.precomposeWhiskerLeftMapCocone α c = (CategoryTheory.Functor.functorialityCompPrecompose α).app c

@[simp]

theorem CategoryTheory.Functor.precomposeWhiskerLeftMapCocone_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (c : Limits.Cocone F) : (precomposeWhiskerLeftMapCocone α c).inv.hom = α.inv.app c.pt

@[simp]

theorem CategoryTheory.Functor.precomposeWhiskerLeftMapCocone_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} {H H' : Functor C D} (α : H ≅ H') (c : Limits.Cocone F) : (precomposeWhiskerLeftMapCocone α c).hom.hom = α.hom.app c.pt

def CategoryTheory.Functor.mapCoconePrecompose {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ⟶ G} {c : Limits.Cocone G} : H.mapCocone ((Limits.Cocones.precompose α).obj c) ≅ (Limits.Cocones.precompose (whiskerRight α H)).obj (H.mapCocone c)

map_cocone commutes with precompose. In particular, for F : J ⥤ C, given a cocone c : Cocone F, a natural transformation α : F ⟶ G and a functor H : C ⥤ D, we have two obvious ways of producing a cocone over G ⋙ H, and they are both isomorphic.

Equations

• H.mapCoconePrecompose = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl (H.mapCocone ((CategoryTheory.Limits.Cocones.precompose α).obj c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapCoconePrecompose_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ⟶ G} {c : Limits.Cocone G} : H.mapCoconePrecompose.hom.hom = CategoryStruct.id (H.obj c.pt)

@[simp]

theorem CategoryTheory.Functor.mapCoconePrecompose_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ⟶ G} {c : Limits.Cocone G} : H.mapCoconePrecompose.inv.hom = CategoryStruct.id (H.obj c.pt)

def CategoryTheory.Functor.mapCoconePrecomposeEquivalenceFunctor {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ≅ G} {c : Limits.Cocone G} : H.mapCocone ((Limits.Cocones.precomposeEquivalence α).functor.obj c) ≅ (Limits.Cocones.precomposeEquivalence (isoWhiskerRight α H)).functor.obj (H.mapCocone c)

mapCocone commutes with precomposeEquivalence

Equations

• H.mapCoconePrecomposeEquivalenceFunctor = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl (H.mapCocone ((CategoryTheory.Limits.Cocones.precomposeEquivalence α).functor.obj c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapCoconePrecomposeEquivalenceFunctor_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ≅ G} {c : Limits.Cocone G} : H.mapCoconePrecomposeEquivalenceFunctor.inv.hom = CategoryStruct.id (H.obj c.pt)

@[simp]

theorem CategoryTheory.Functor.mapCoconePrecomposeEquivalenceFunctor_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F G : Functor J C} {α : F ≅ G} {c : Limits.Cocone G} : H.mapCoconePrecomposeEquivalenceFunctor.hom.hom = CategoryStruct.id (H.obj c.pt)

def CategoryTheory.Functor.mapConeWhisker {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {E : Functor K J} {c : Limits.Cone F} : H.mapCone (Limits.Cone.whisker E c) ≅ Limits.Cone.whisker E (H.mapCone c)

mapCone commutes with whisker

Equations

• H.mapConeWhisker = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (H.mapCone (CategoryTheory.Limits.Cone.whisker E c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapConeWhisker_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {E : Functor K J} {c : Limits.Cone F} : H.mapConeWhisker.hom.hom = CategoryStruct.id (H.obj c.pt)

@[simp]

theorem CategoryTheory.Functor.mapConeWhisker_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {E : Functor K J} {c : Limits.Cone F} : H.mapConeWhisker.inv.hom = CategoryStruct.id (H.obj c.pt)

def CategoryTheory.Functor.mapCoconeWhisker {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {E : Functor K J} {c : Limits.Cocone F} : H.mapCocone (Limits.Cocone.whisker E c) ≅ Limits.Cocone.whisker E (H.mapCocone c)

mapCocone commutes with whisker

Equations

• H.mapCoconeWhisker = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl (H.mapCocone (CategoryTheory.Limits.Cocone.whisker E c)).pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapCoconeWhisker_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {E : Functor K J} {c : Limits.Cocone F} : H.mapCoconeWhisker.hom.hom = CategoryStruct.id (H.obj c.pt)

@[simp]

theorem CategoryTheory.Functor.mapCoconeWhisker_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {K : Type u₂} [Category.{v₂, u₂} K] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] (H : Functor C D) {F : Functor J C} {E : Functor K J} {c : Limits.Cocone F} : H.mapCoconeWhisker.inv.hom = CategoryStruct.id (H.obj c.pt)

def CategoryTheory.Limits.Cocone.op {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : Cone F.op

Change a Cocone F into a Cone F.op.

Equations

• c.op = { pt := Opposite.op c.pt, π := CategoryTheory.NatTrans.op c.ι }

@[simp]

theorem CategoryTheory.Limits.Cocone.op_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : c.op.pt = Opposite.op c.pt

@[simp]

theorem CategoryTheory.Limits.Cocone.op_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F) : c.op.π = NatTrans.op c.ι

def CategoryTheory.Limits.Cone.op {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : Cocone F.op

Change a Cone F into a Cocone F.op.

Equations

• c.op = { pt := Opposite.op c.pt, ι := CategoryTheory.NatTrans.op c.π }

@[simp]

theorem CategoryTheory.Limits.Cone.op_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : c.op.ι = NatTrans.op c.π

@[simp]

theorem CategoryTheory.Limits.Cone.op_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F) : c.op.pt = Opposite.op c.pt

def CategoryTheory.Limits.Cocone.unop {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F.op) : Cone F

Change a Cocone F.op into a Cone F.

Equations

• c.unop = { pt := Opposite.unop c.pt, π := CategoryTheory.NatTrans.removeOp c.ι }

@[simp]

theorem CategoryTheory.Limits.Cocone.unop_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F.op) : c.unop.pt = Opposite.unop c.pt

@[simp]

theorem CategoryTheory.Limits.Cocone.unop_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cocone F.op) : c.unop.π = NatTrans.removeOp c.ι

def CategoryTheory.Limits.Cone.unop {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F.op) : Cocone F

Change a Cone F.op into a Cocone F.

Equations

• c.unop = { pt := Opposite.unop c.pt, ι := CategoryTheory.NatTrans.removeOp c.π }

@[simp]

theorem CategoryTheory.Limits.Cone.unop_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F.op) : c.unop.ι = NatTrans.removeOp c.π

@[simp]

theorem CategoryTheory.Limits.Cone.unop_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J C} (c : Cone F.op) : c.unop.pt = Opposite.unop c.pt

def CategoryTheory.Limits.coconeEquivalenceOpConeOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : Cocone F ≌ (Cone F.op)ᵒᵖ

The category of cocones on F is equivalent to the opposite category of the category of cones on the opposite of F.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Limits.coconeEquivalenceOpConeOp_counitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : (coconeEquivalenceOpConeOp F).counitIso = NatIso.ofComponents (fun (c : (Cone F.op)ᵒᵖ) => Opposite.rec' (fun (X : Cone F.op) => (Cones.ext (Iso.refl X.pt) ⋯).op) c) ⋯

@[simp]

theorem CategoryTheory.Limits.coconeEquivalenceOpConeOp_unitIso {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) : (coconeEquivalenceOpConeOp F).unitIso = NatIso.ofComponents (fun (c : Cocone F) => Cocones.ext (Iso.refl ((Functor.id (Cocone F)).obj c).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.coconeEquivalenceOpConeOp_inverse_obj {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (c : (Cone F.op)ᵒᵖ) : (coconeEquivalenceOpConeOp F).inverse.obj c = (Opposite.unop c).unop

@[simp]

theorem CategoryTheory.Limits.coconeEquivalenceOpConeOp_functor_map {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) {X Y : Cocone F} (f : X ⟶ Y) : (coconeEquivalenceOpConeOp F).functor.map f = Quiver.Hom.op { hom := f.hom.op, w := ⋯ }

@[simp]

theorem CategoryTheory.Limits.coconeEquivalenceOpConeOp_inverse_map_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) {X Y : (Cone F.op)ᵒᵖ} (f : X ⟶ Y) : ((coconeEquivalenceOpConeOp F).inverse.map f).hom = f.unop.hom.unop

@[simp]

theorem CategoryTheory.Limits.coconeEquivalenceOpConeOp_functor_obj {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] (F : Functor J C) (c : Cocone F) : (coconeEquivalenceOpConeOp F).functor.obj c = Opposite.op c.op

def CategoryTheory.Limits.coneOfCoconeLeftOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cocone F.leftOp) : Cone F

Change a cocone on F.leftOp : Jᵒᵖ ⥤ C to a cocone on F : J ⥤ Cᵒᵖ.

Equations

• CategoryTheory.Limits.coneOfCoconeLeftOp c = { pt := Opposite.op c.pt, π := CategoryTheory.NatTrans.removeLeftOp c.ι }

@[simp]

theorem CategoryTheory.Limits.coneOfCoconeLeftOp_π_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cocone F.leftOp) (X : J) : (coneOfCoconeLeftOp c).π.app X = (c.ι.app (Opposite.op X)).op

@[simp]

theorem CategoryTheory.Limits.coneOfCoconeLeftOp_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cocone F.leftOp) : (coneOfCoconeLeftOp c).pt = Opposite.op c.pt

def CategoryTheory.Limits.coconeLeftOpOfCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cone F) : Cocone F.leftOp

Change a cone on F : J ⥤ Cᵒᵖ to a cocone on F.leftOp : Jᵒᵖ ⥤ C.

Equations

• CategoryTheory.Limits.coconeLeftOpOfCone c = { pt := Opposite.unop c.pt, ι := CategoryTheory.NatTrans.leftOp c.π }

@[simp]

theorem CategoryTheory.Limits.coconeLeftOpOfCone_ι_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cone F) (X : Jᵒᵖ) : (coconeLeftOpOfCone c).ι.app X = (c.π.app (Opposite.unop X)).unop

@[simp]

theorem CategoryTheory.Limits.coconeLeftOpOfCone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cone F) : (coconeLeftOpOfCone c).pt = Opposite.unop c.pt

def CategoryTheory.Limits.coconeOfConeLeftOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cone F.leftOp) : Cocone F

Change a cone on F.leftOp : Jᵒᵖ ⥤ C to a cocone on F : J ⥤ Cᵒᵖ.

Equations

• CategoryTheory.Limits.coconeOfConeLeftOp c = { pt := Opposite.op c.pt, ι := CategoryTheory.NatTrans.removeLeftOp c.π }

@[simp]

theorem CategoryTheory.Limits.coconeOfConeLeftOp_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cone F.leftOp) : (coconeOfConeLeftOp c).pt = Opposite.op c.pt

@[simp]

theorem CategoryTheory.Limits.coconeOfConeLeftOp_ι_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cone F.leftOp) (j : J) : (coconeOfConeLeftOp c).ι.app j = (c.π.app (Opposite.op j)).op

def CategoryTheory.Limits.coneLeftOpOfCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cocone F) : Cone F.leftOp

Change a cocone on F : J ⥤ Cᵒᵖ to a cone on F.leftOp : Jᵒᵖ ⥤ C.

Equations

• CategoryTheory.Limits.coneLeftOpOfCocone c = { pt := Opposite.unop c.pt, π := CategoryTheory.NatTrans.leftOp c.ι }

@[simp]

theorem CategoryTheory.Limits.coneLeftOpOfCocone_π_app {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cocone F) (X : Jᵒᵖ) : (coneLeftOpOfCocone c).π.app X = (c.ι.app (Opposite.unop X)).unop

@[simp]

theorem CategoryTheory.Limits.coneLeftOpOfCocone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor J Cᵒᵖ} (c : Cocone F) : (coneLeftOpOfCocone c).pt = Opposite.unop c.pt

def CategoryTheory.Limits.coneOfCoconeRightOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cocone F.rightOp) : Cone F

Change a cocone on F.rightOp : J ⥤ Cᵒᵖ to a cone on F : Jᵒᵖ ⥤ C.

Equations

• CategoryTheory.Limits.coneOfCoconeRightOp c = { pt := Opposite.unop c.pt, π := CategoryTheory.NatTrans.removeRightOp c.ι }

@[simp]

theorem CategoryTheory.Limits.coneOfCoconeRightOp_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cocone F.rightOp) : (coneOfCoconeRightOp c).pt = Opposite.unop c.pt

@[simp]

theorem CategoryTheory.Limits.coneOfCoconeRightOp_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cocone F.rightOp) : (coneOfCoconeRightOp c).π = NatTrans.removeRightOp c.ι

def CategoryTheory.Limits.coconeRightOpOfCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cone F) : Cocone F.rightOp

Change a cone on F : Jᵒᵖ ⥤ C to a cocone on F.rightOp : Jᵒᵖ ⥤ C.

Equations

• CategoryTheory.Limits.coconeRightOpOfCone c = { pt := Opposite.op c.pt, ι := CategoryTheory.NatTrans.rightOp c.π }

@[simp]

theorem CategoryTheory.Limits.coconeRightOpOfCone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cone F) : (coconeRightOpOfCone c).pt = Opposite.op c.pt

@[simp]

theorem CategoryTheory.Limits.coconeRightOpOfCone_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cone F) : (coconeRightOpOfCone c).ι = NatTrans.rightOp c.π

def CategoryTheory.Limits.coconeOfConeRightOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cone F.rightOp) : Cocone F

Change a cone on F.rightOp : J ⥤ Cᵒᵖ to a cocone on F : Jᵒᵖ ⥤ C.

Equations

• CategoryTheory.Limits.coconeOfConeRightOp c = { pt := Opposite.unop c.pt, ι := CategoryTheory.NatTrans.removeRightOp c.π }

@[simp]

theorem CategoryTheory.Limits.coconeOfConeRightOp_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cone F.rightOp) : (coconeOfConeRightOp c).ι = NatTrans.removeRightOp c.π

@[simp]

theorem CategoryTheory.Limits.coconeOfConeRightOp_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cone F.rightOp) : (coconeOfConeRightOp c).pt = Opposite.unop c.pt

def CategoryTheory.Limits.coneRightOpOfCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cocone F) : Cone F.rightOp

Change a cocone on F : Jᵒᵖ ⥤ C to a cone on F.rightOp : J ⥤ Cᵒᵖ.

Equations

• CategoryTheory.Limits.coneRightOpOfCocone c = { pt := Opposite.op c.pt, π := CategoryTheory.NatTrans.rightOp c.ι }

@[simp]

theorem CategoryTheory.Limits.coneRightOpOfCocone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cocone F) : (coneRightOpOfCocone c).pt = Opposite.op c.pt

@[simp]

theorem CategoryTheory.Limits.coneRightOpOfCocone_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ C} (c : Cocone F) : (coneRightOpOfCocone c).π = NatTrans.rightOp c.ι

def CategoryTheory.Limits.coneOfCoconeUnop {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cocone F.unop) : Cone F

Change a cocone on F.unop : J ⥤ C into a cone on F : Jᵒᵖ ⥤ Cᵒᵖ.

Equations

• CategoryTheory.Limits.coneOfCoconeUnop c = { pt := Opposite.op c.pt, π := CategoryTheory.NatTrans.removeUnop c.ι }

@[simp]

theorem CategoryTheory.Limits.coneOfCoconeUnop_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cocone F.unop) : (coneOfCoconeUnop c).π = NatTrans.removeUnop c.ι

@[simp]

theorem CategoryTheory.Limits.coneOfCoconeUnop_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cocone F.unop) : (coneOfCoconeUnop c).pt = Opposite.op c.pt

def CategoryTheory.Limits.coconeUnopOfCone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cone F) : Cocone F.unop

Change a cone on F : Jᵒᵖ ⥤ Cᵒᵖ into a cocone on F.unop : J ⥤ C.

Equations

• CategoryTheory.Limits.coconeUnopOfCone c = { pt := Opposite.unop c.pt, ι := CategoryTheory.NatTrans.unop c.π }

@[simp]

theorem CategoryTheory.Limits.coconeUnopOfCone_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cone F) : (coconeUnopOfCone c).ι = NatTrans.unop c.π

@[simp]

theorem CategoryTheory.Limits.coconeUnopOfCone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cone F) : (coconeUnopOfCone c).pt = Opposite.unop c.pt

def CategoryTheory.Limits.coconeOfConeUnop {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cone F.unop) : Cocone F

Change a cone on F.unop : J ⥤ C into a cocone on F : Jᵒᵖ ⥤ Cᵒᵖ.

Equations

• CategoryTheory.Limits.coconeOfConeUnop c = { pt := Opposite.op c.pt, ι := CategoryTheory.NatTrans.removeUnop c.π }

@[simp]

theorem CategoryTheory.Limits.coconeOfConeUnop_ι {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cone F.unop) : (coconeOfConeUnop c).ι = NatTrans.removeUnop c.π

@[simp]

theorem CategoryTheory.Limits.coconeOfConeUnop_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cone F.unop) : (coconeOfConeUnop c).pt = Opposite.op c.pt

def CategoryTheory.Limits.coneUnopOfCocone {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cocone F) : Cone F.unop

Change a cocone on F : Jᵒᵖ ⥤ Cᵒᵖ into a cone on F.unop : J ⥤ C.

Equations

• CategoryTheory.Limits.coneUnopOfCocone c = { pt := Opposite.unop c.pt, π := CategoryTheory.NatTrans.unop c.ι }

@[simp]

theorem CategoryTheory.Limits.coneUnopOfCocone_pt {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cocone F) : (coneUnopOfCocone c).pt = Opposite.unop c.pt

@[simp]

theorem CategoryTheory.Limits.coneUnopOfCocone_π {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {F : Functor Jᵒᵖ Cᵒᵖ} (c : Cocone F) : (coneUnopOfCocone c).π = NatTrans.unop c.ι

def CategoryTheory.Functor.mapConeOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} (G : Functor C D) (t : Limits.Cone F) : (G.mapCone t).op ≅ G.op.mapCocone t.op

The opposite cocone of the image of a cone is the image of the opposite cocone.

Equations

• CategoryTheory.Functor.mapConeOp G t = CategoryTheory.Limits.Cocones.ext (CategoryTheory.Iso.refl (G.mapCone t).op.pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapConeOp_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} (G : Functor C D) (t : Limits.Cone F) : (mapConeOp G t).inv.hom = CategoryStruct.id (Opposite.op (G.obj t.pt))

@[simp]

theorem CategoryTheory.Functor.mapConeOp_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} (G : Functor C D) (t : Limits.Cone F) : (mapConeOp G t).hom.hom = CategoryStruct.id (Opposite.op (G.obj t.pt))

def CategoryTheory.Functor.mapCoconeOp {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} (G : Functor C D) {t : Limits.Cocone F} : (G.mapCocone t).op ≅ G.op.mapCone t.op

The opposite cone of the image of a cocone is the image of the opposite cone.

Equations

• CategoryTheory.Functor.mapCoconeOp G = CategoryTheory.Limits.Cones.ext (CategoryTheory.Iso.refl (G.mapCocone t).op.pt) ⋯

@[simp]

theorem CategoryTheory.Functor.mapCoconeOp_inv_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} (G : Functor C D) {t : Limits.Cocone F} : (mapCoconeOp G).inv.hom = CategoryStruct.id (Opposite.op (G.obj t.pt))

@[simp]

theorem CategoryTheory.Functor.mapCoconeOp_hom_hom {J : Type u₁} [Category.{v₁, u₁} J] {C : Type u₃} [Category.{v₃, u₃} C] {D : Type u₄} [Category.{v₄, u₄} D] {F : Functor J C} (G : Functor C D) {t : Limits.Cocone F} : (mapCoconeOp G).hom.hom = CategoryStruct.id (Opposite.op (G.obj t.pt))