Multi-(co)equalizers

A multiequalizer is an equalizer of two morphisms between two products. Since both products and equalizers are limits, such an object is again a limit. This file provides the diagram whose limit is indeed such an object. In fact, it is well-known that any limit can be obtained as a multiequalizer. The dual construction (multicoequalizers) is also provided.

Projects

Prove that a multiequalizer can be identified with an equalizer between products (and analogously for multicoequalizers).

Prove that the limit of any diagram is a multiequalizer (and similarly for colimits).

structure CategoryTheory.Limits.MulticospanShape : Type (max (w + 1) (w' + 1))

The shape of a multiequalizer diagram. It involves two types L and R, and two maps R → L.

• L : Type w

  the left type

• R : Type w'

  the right type

• fst : self.R → self.L

  the first map R → L

• snd : self.R → self.L

  the second map R → L

def CategoryTheory.Limits.MulticospanShape.prod (ι : Type w) : MulticospanShape

Given a type ι, this is the shape of multiequalizer diagrams corresponding to situations where we want to equalize two families of maps U i ⟶ V ⟨i, j⟩ and U j ⟶ V ⟨i, j⟩ with i : ι and j : ι.

@[simp]

theorem CategoryTheory.Limits.MulticospanShape.prod_snd (ι : Type w) (self : ι × ι) : (prod ι).snd self = self.2

@[simp]

theorem CategoryTheory.Limits.MulticospanShape.prod_fst (ι : Type w) (self : ι × ι) : (prod ι).fst self = self.1

@[simp]

theorem CategoryTheory.Limits.MulticospanShape.prod_L (ι : Type w) : (prod ι).L = ι

@[simp]

theorem CategoryTheory.Limits.MulticospanShape.prod_R (ι : Type w) : (prod ι).R = (ι × ι)

structure CategoryTheory.Limits.MultispanShape : Type (max (w + 1) (w' + 1))

The shape of a multicoequalizer diagram. It involves two types L and R, and two maps L → R.

• L : Type w

  the left type

• R : Type w'

  the right type

• fst : self.L → self.R

  the first map L → R

• snd : self.L → self.R

  the second map L → R

def CategoryTheory.Limits.MultispanShape.prod (ι : Type w) : MultispanShape

Given a type ι, this is the shape of multicoequalizer diagrams corresponding to situations where we want to coequalize two families of maps V ⟨i, j⟩ ⟶ U i and V ⟨i, j⟩ ⟶ U j with i : ι and j : ι.

@[simp]

theorem CategoryTheory.Limits.MultispanShape.prod_snd (ι : Type w) (self : ι × ι) : (prod ι).snd self = self.2

@[simp]

theorem CategoryTheory.Limits.MultispanShape.prod_fst (ι : Type w) (self : ι × ι) : (prod ι).fst self = self.1

@[simp]

theorem CategoryTheory.Limits.MultispanShape.prod_R (ι : Type w) : (prod ι).R = ι

@[simp]

theorem CategoryTheory.Limits.MultispanShape.prod_L (ι : Type w) : (prod ι).L = (ι × ι)

def CategoryTheory.Limits.MultispanShape.ofLinearOrder (ι : Type w) [LinearOrder ι] : MultispanShape

Given a linearly ordered type ι, this is the shape of multicoequalizer diagrams corresponding to situations where we want to coequalize two families of maps V ⟨i, j⟩ ⟶ U i and V ⟨i, j⟩ ⟶ U j with i < j.

@[simp]

theorem CategoryTheory.Limits.MultispanShape.ofLinearOrder_R (ι : Type w) [LinearOrder ι] : (ofLinearOrder ι).R = ι

@[simp]

theorem CategoryTheory.Limits.MultispanShape.ofLinearOrder_snd (ι : Type w) [LinearOrder ι] (x : ↑{x : ι × ι | x.1 < x.2}) : (ofLinearOrder ι).snd x = (↑x).2

@[simp]

theorem CategoryTheory.Limits.MultispanShape.ofLinearOrder_fst (ι : Type w) [LinearOrder ι] (x : ↑{x : ι × ι | x.1 < x.2}) : (ofLinearOrder ι).fst x = (↑x).1

@[simp]

theorem CategoryTheory.Limits.MultispanShape.ofLinearOrder_L (ι : Type w) [LinearOrder ι] : (ofLinearOrder ι).L = ↑{x : ι × ι | x.1 < x.2}

inductive CategoryTheory.Limits.WalkingMulticospan (J : MulticospanShape) : Type (max w w')

The type underlying the multiequalizer diagram.

• left {J : MulticospanShape} : J.L → WalkingMulticospan J
• right {J : MulticospanShape} : J.R → WalkingMulticospan J

inductive CategoryTheory.Limits.WalkingMultispan (J : MultispanShape) : Type (max w w')

The type underlying the multiecoqualizer diagram.

• left {J : MultispanShape} : J.L → WalkingMultispan J
• right {J : MultispanShape} : J.R → WalkingMultispan J

instance CategoryTheory.Limits.WalkingMulticospan.instInhabitedOfL {J : MulticospanShape} [Inhabited J.L] : Inhabited (WalkingMulticospan J)

inductive CategoryTheory.Limits.WalkingMulticospan.Hom {J : MulticospanShape} : WalkingMulticospan J → WalkingMulticospan J → Type (max w w')

Morphisms for WalkingMulticospan.

• id {J : MulticospanShape} (A : WalkingMulticospan J) : A.Hom A
• fst {J : MulticospanShape} (b : J.R) : (left (J.fst b)).Hom (right b)
• snd {J : MulticospanShape} (b : J.R) : (left (J.snd b)).Hom (right b)

instance CategoryTheory.Limits.WalkingMulticospan.instInhabitedHom {J : MulticospanShape} {a : WalkingMulticospan J} : Inhabited (a.Hom a)

def CategoryTheory.Limits.WalkingMulticospan.Hom.comp {J : MulticospanShape} {A B C : WalkingMulticospan J} : A.Hom B → B.Hom C → A.Hom C

Composition of morphisms for WalkingMulticospan.

instance CategoryTheory.Limits.WalkingMulticospan.instSmallCategory {J : MulticospanShape} : SmallCategory (WalkingMulticospan J)

@[simp]

theorem CategoryTheory.Limits.WalkingMulticospan.Hom.id_eq_id {J : MulticospanShape} (X : WalkingMulticospan J) : id X = CategoryStruct.id X

@[simp]

theorem CategoryTheory.Limits.WalkingMulticospan.Hom.comp_eq_comp {J : MulticospanShape} {X Y Z : WalkingMulticospan J} (f : X ⟶ Y) (g : Y ⟶ Z) : comp f g = CategoryStruct.comp f g

instance CategoryTheory.Limits.WalkingMultispan.instInhabitedOfL {J : MultispanShape} [Inhabited J.L] : Inhabited (WalkingMultispan J)

inductive CategoryTheory.Limits.WalkingMultispan.Hom {J : MultispanShape} : WalkingMultispan J → WalkingMultispan J → Type (max w w')

Morphisms for WalkingMultispan.

• id {J : MultispanShape} (A : WalkingMultispan J) : A.Hom A
• fst {J : MultispanShape} (a : J.L) : (left a).Hom (right (J.fst a))
• snd {J : MultispanShape} (a : J.L) : (left a).Hom (right (J.snd a))

instance CategoryTheory.Limits.WalkingMultispan.instInhabitedHom {J : MultispanShape} {a : WalkingMultispan J} : Inhabited (a.Hom a)

def CategoryTheory.Limits.WalkingMultispan.Hom.comp {J : MultispanShape} {A B C : WalkingMultispan J} : A.Hom B → B.Hom C → A.Hom C

Composition of morphisms for WalkingMultispan.

instance CategoryTheory.Limits.WalkingMultispan.instSmallCategory {J : MultispanShape} : SmallCategory (WalkingMultispan J)

@[simp]

theorem CategoryTheory.Limits.WalkingMultispan.Hom.id_eq_id {J : MultispanShape} (X : WalkingMultispan J) : id X = CategoryStruct.id X

@[simp]

theorem CategoryTheory.Limits.WalkingMultispan.Hom.comp_eq_comp {J : MultispanShape} {X Y Z : WalkingMultispan J} (f : X ⟶ Y) (g : Y ⟶ Z) : comp f g = CategoryStruct.comp f g

structure CategoryTheory.Limits.MulticospanIndex (J : MulticospanShape) (C : Type u) [Category.{v, u} C] : Type (max (max (max u v) w) w')

This is a structure encapsulating the data necessary to define a Multicospan.

• left : J.L → C

  Left map, from J.L to C

• right : J.R → C

  Right map, from J.R to C

• fst (b : J.R) : self.left (J.fst b) ⟶ self.right b

  A family of maps from left (J.fst b) to right b

• snd (b : J.R) : self.left (J.snd b) ⟶ self.right b

  A family of maps from left (J.snd b) to right b

structure CategoryTheory.Limits.MultispanIndex (J : MultispanShape) (C : Type u) [Category.{v, u} C] : Type (max (max (max u v) w) w')

This is a structure encapsulating the data necessary to define a Multispan.

• left : J.L → C

  Left map, from J.L to C

• right : J.R → C

  Right map, from J.R to C

• fst (a : J.L) : self.left a ⟶ self.right (J.fst a)

  A family of maps from left a to right (J.fst a)

• snd (a : J.L) : self.left a ⟶ self.right (J.snd a)

  A family of maps from left a to right (J.snd a)

def CategoryTheory.Limits.MulticospanIndex.multicospan {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) : Functor (WalkingMulticospan J) C

The multicospan associated to I : MulticospanIndex.

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.multicospan_obj {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) (x : WalkingMulticospan J) : I.multicospan.obj x = match x with | WalkingMulticospan.left a => I.left a | WalkingMulticospan.right b => I.right b

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.multicospan_map {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) {x y : WalkingMulticospan J} (f : x ⟶ y) : I.multicospan.map f = match x, y, f with | x, .(x), WalkingMulticospan.Hom.id .(x) => CategoryStruct.id (match x with | WalkingMulticospan.left a => I.left a | WalkingMulticospan.right b => I.right b) | .(WalkingMulticospan.left (J.fst b)), .(WalkingMulticospan.right b), WalkingMulticospan.Hom.fst b => I.fst b | .(WalkingMulticospan.left (J.snd b)), .(WalkingMulticospan.right b), WalkingMulticospan.Hom.snd b => I.snd b

noncomputable def CategoryTheory.Limits.MulticospanIndex.fstPiMap {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : ∏ᶜ I.left ⟶ ∏ᶜ I.right

The induced map ∏ᶜ I.left ⟶ ∏ᶜ I.right via I.fst.

noncomputable def CategoryTheory.Limits.MulticospanIndex.sndPiMap {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : ∏ᶜ I.left ⟶ ∏ᶜ I.right

The induced map ∏ᶜ I.left ⟶ ∏ᶜ I.right via I.snd.

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.fstPiMap_π {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (b : J.R) : CategoryStruct.comp I.fstPiMap (Pi.π I.right b) = CategoryStruct.comp (Pi.π I.left (J.fst b)) (I.fst b)

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.fstPiMap_π_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (b : J.R) {Z : C} (h : I.right b ⟶ Z) : CategoryStruct.comp I.fstPiMap (CategoryStruct.comp (Pi.π I.right b) h) = CategoryStruct.comp (Pi.π I.left (J.fst b)) (CategoryStruct.comp (I.fst b) h)

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.sndPiMap_π {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (b : J.R) : CategoryStruct.comp I.sndPiMap (Pi.π I.right b) = CategoryStruct.comp (Pi.π I.left (J.snd b)) (I.snd b)

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.sndPiMap_π_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (b : J.R) {Z : C} (h : I.right b ⟶ Z) : CategoryStruct.comp I.sndPiMap (CategoryStruct.comp (Pi.π I.right b) h) = CategoryStruct.comp (Pi.π I.left (J.snd b)) (CategoryStruct.comp (I.snd b) h)

noncomputable def CategoryTheory.Limits.MulticospanIndex.parallelPairDiagram {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : Functor WalkingParallelPair C

Taking the multiequalizer over the multicospan index is equivalent to taking the equalizer over the two morphisms ∏ᶜ I.left ⇉ ∏ᶜ I.right. This is the diagram of the latter.

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.parallelPairDiagram_obj {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (x : WalkingParallelPair) : I.parallelPairDiagram.obj x = match x with | WalkingParallelPair.zero => ∏ᶜ I.left | WalkingParallelPair.one => ∏ᶜ I.right

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.parallelPairDiagram_map {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] {X✝ Y✝ : WalkingParallelPair} (h : X✝ ⟶ Y✝) : I.parallelPairDiagram.map h = match X✝, Y✝, h with | x, .(x), WalkingParallelPairHom.id .(x) => CategoryStruct.id (match x with | WalkingParallelPair.zero => ∏ᶜ I.left | WalkingParallelPair.one => ∏ᶜ I.right) | .(WalkingParallelPair.zero), .(WalkingParallelPair.one), WalkingParallelPairHom.left => I.fstPiMap | .(WalkingParallelPair.zero), .(WalkingParallelPair.one), WalkingParallelPairHom.right => I.sndPiMap

def CategoryTheory.Limits.MultispanIndex.multispan {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) : Functor (WalkingMultispan J) C

The multispan associated to I : MultispanIndex.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multispan_obj_left {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (a : J.L) : I.multispan.obj (WalkingMultispan.left a) = I.left a

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multispan_obj_right {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (b : J.R) : I.multispan.obj (WalkingMultispan.right b) = I.right b

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multispan_map_fst {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (a : J.L) : I.multispan.map (WalkingMultispan.Hom.fst a) = I.fst a

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multispan_map_snd {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (a : J.L) : I.multispan.map (WalkingMultispan.Hom.snd a) = I.snd a

noncomputable def CategoryTheory.Limits.MultispanIndex.fstSigmaMap {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : ∐ I.left ⟶ ∐ I.right

The induced map ∐ I.left ⟶ ∐ I.right via I.fst.

noncomputable def CategoryTheory.Limits.MultispanIndex.sndSigmaMap {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : ∐ I.left ⟶ ∐ I.right

The induced map ∐ I.left ⟶ ∐ I.right via I.snd.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.ι_fstSigmaMap {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (b : J.L) : CategoryStruct.comp (Sigma.ι I.left b) I.fstSigmaMap = CategoryStruct.comp (I.fst b) (Sigma.ι I.right (J.fst b))

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.ι_fstSigmaMap_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (b : J.L) {Z : C} (h : ∐ I.right ⟶ Z) : CategoryStruct.comp (Sigma.ι I.left b) (CategoryStruct.comp I.fstSigmaMap h) = CategoryStruct.comp (I.fst b) (CategoryStruct.comp (Sigma.ι I.right (J.fst b)) h)

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.ι_sndSigmaMap {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (b : J.L) : CategoryStruct.comp (Sigma.ι I.left b) I.sndSigmaMap = CategoryStruct.comp (I.snd b) (Sigma.ι I.right (J.snd b))

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.ι_sndSigmaMap_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (b : J.L) {Z : C} (h : ∐ I.right ⟶ Z) : CategoryStruct.comp (Sigma.ι I.left b) (CategoryStruct.comp I.sndSigmaMap h) = CategoryStruct.comp (I.snd b) (CategoryStruct.comp (Sigma.ι I.right (J.snd b)) h)

@[reducible, inline]

noncomputable abbrev CategoryTheory.Limits.MultispanIndex.parallelPairDiagram {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : Functor WalkingParallelPair C

Taking the multicoequalizer over the multispan index is equivalent to taking the coequalizer over the two morphisms ∐ I.left ⇉ ∐ I.right. This is the diagram of the latter.

@[reducible, inline]

abbrev CategoryTheory.Limits.Multifork {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) : Type (max (max (max w w') u) v)

A multifork is a cone over a multicospan.

@[reducible, inline]

abbrev CategoryTheory.Limits.Multicofork {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) : Type (max (max (max w w') u) v)

A multicofork is a cocone over a multispan.

def CategoryTheory.Limits.Multifork.ι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (a : J.L) : K.pt ⟶ I.left a

The maps from the cone point of a multifork to the objects on the left.

@[simp]

theorem CategoryTheory.Limits.Multifork.app_left_eq_ι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (a : J.L) : K.π.app (WalkingMulticospan.left a) = K.ι a

@[simp]

theorem CategoryTheory.Limits.Multifork.app_right_eq_ι_comp_fst {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (b : J.R) : K.π.app (WalkingMulticospan.right b) = CategoryStruct.comp (K.ι (J.fst b)) (I.fst b)

theorem CategoryTheory.Limits.Multifork.app_right_eq_ι_comp_snd {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (b : J.R) : K.π.app (WalkingMulticospan.right b) = CategoryStruct.comp (K.ι (J.snd b)) (I.snd b)

theorem CategoryTheory.Limits.Multifork.app_right_eq_ι_comp_snd_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (b : J.R) {Z : C} (h : I.multicospan.obj (WalkingMulticospan.right b) ⟶ Z) : CategoryStruct.comp (K.π.app (WalkingMulticospan.right b)) h = CategoryStruct.comp (K.ι (J.snd b)) (CategoryStruct.comp (I.snd b) h)

@[simp]

theorem CategoryTheory.Limits.Multifork.hom_comp_ι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K₁ K₂ : Multifork I) (f : K₁ ⟶ K₂) (j : J.L) : CategoryStruct.comp f.hom (K₂.ι j) = K₁.ι j

@[simp]

theorem CategoryTheory.Limits.Multifork.hom_comp_ι_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K₁ K₂ : Multifork I) (f : K₁ ⟶ K₂) (j : J.L) {Z : C} (h : I.left j ⟶ Z) : CategoryStruct.comp f.hom (CategoryStruct.comp (K₂.ι j) h) = CategoryStruct.comp (K₁.ι j) h

def CategoryTheory.Limits.Multifork.ofι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) (P : C) (ι : (a : J.L) → P ⟶ I.left a) (w : ∀ (b : J.R), CategoryStruct.comp (ι (J.fst b)) (I.fst b) = CategoryStruct.comp (ι (J.snd b)) (I.snd b)) : Multifork I

Construct a multifork using a collection ι of morphisms.

@[simp]

theorem CategoryTheory.Limits.Multifork.ofι_pt {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) (P : C) (ι : (a : J.L) → P ⟶ I.left a) (w : ∀ (b : J.R), CategoryStruct.comp (ι (J.fst b)) (I.fst b) = CategoryStruct.comp (ι (J.snd b)) (I.snd b)) : (ofι I P ι w).pt = P

@[simp]

theorem CategoryTheory.Limits.Multifork.ofι_π_app {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) (P : C) (ι : (a : J.L) → P ⟶ I.left a) (w : ∀ (b : J.R), CategoryStruct.comp (ι (J.fst b)) (I.fst b) = CategoryStruct.comp (ι (J.snd b)) (I.snd b)) (x : WalkingMulticospan J) : (ofι I P ι w).π.app x = match x with | WalkingMulticospan.left a => ι a | WalkingMulticospan.right b => CategoryStruct.comp (ι (J.fst b)) (I.fst b)

@[simp]

theorem CategoryTheory.Limits.Multifork.condition {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (b : J.R) : CategoryStruct.comp (K.ι (J.fst b)) (I.fst b) = CategoryStruct.comp (K.ι (J.snd b)) (I.snd b)

@[simp]

theorem CategoryTheory.Limits.Multifork.condition_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (b : J.R) {Z : C} (h : I.right b ⟶ Z) : CategoryStruct.comp (K.ι (J.fst b)) (CategoryStruct.comp (I.fst b) h) = CategoryStruct.comp (K.ι (J.snd b)) (CategoryStruct.comp (I.snd b) h)

def CategoryTheory.Limits.Multifork.IsLimit.mk {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (lift : (E : Multifork I) → E.pt ⟶ K.pt) (fac : ∀ (E : Multifork I) (i : J.L), CategoryStruct.comp (lift E) (K.ι i) = E.ι i) (uniq : ∀ (E : Multifork I) (m : E.pt ⟶ K.pt), (∀ (i : J.L), CategoryStruct.comp m (K.ι i) = E.ι i) → m = lift E) : IsLimit K

This definition provides a convenient way to show that a multifork is a limit.

@[simp]

theorem CategoryTheory.Limits.Multifork.IsLimit.mk_lift {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) (lift : (E : Multifork I) → E.pt ⟶ K.pt) (fac : ∀ (E : Multifork I) (i : J.L), CategoryStruct.comp (lift E) (K.ι i) = E.ι i) (uniq : ∀ (E : Multifork I) (m : E.pt ⟶ K.pt), (∀ (i : J.L), CategoryStruct.comp m (K.ι i) = E.ι i) → m = lift E) (E : Multifork I) : (mk K lift fac uniq).lift E = lift E

theorem CategoryTheory.Limits.Multifork.IsLimit.hom_ext {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} {K : Multifork I} (hK : IsLimit K) {T : C} {f g : T ⟶ K.pt} (h : ∀ (a : J.L), CategoryStruct.comp f (K.ι a) = CategoryStruct.comp g (K.ι a)) : f = g

def CategoryTheory.Limits.Multifork.IsLimit.lift {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} {K : Multifork I} (hK : IsLimit K) {T : C} (k : (a : J.L) → T ⟶ I.left a) (hk : ∀ (b : J.R), CategoryStruct.comp (k (J.fst b)) (I.fst b) = CategoryStruct.comp (k (J.snd b)) (I.snd b)) : T ⟶ K.pt

Constructor for morphisms to the point of a limit multifork.

@[simp]

theorem CategoryTheory.Limits.Multifork.IsLimit.fac {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} {K : Multifork I} (hK : IsLimit K) {T : C} (k : (a : J.L) → T ⟶ I.left a) (hk : ∀ (b : J.R), CategoryStruct.comp (k (J.fst b)) (I.fst b) = CategoryStruct.comp (k (J.snd b)) (I.snd b)) (a : J.L) : CategoryStruct.comp (lift hK k hk) (K.ι a) = k a

@[simp]

theorem CategoryTheory.Limits.Multifork.IsLimit.fac_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} {K : Multifork I} (hK : IsLimit K) {T : C} (k : (a : J.L) → T ⟶ I.left a) (hk : ∀ (b : J.R), CategoryStruct.comp (k (J.fst b)) (I.fst b) = CategoryStruct.comp (k (J.snd b)) (I.snd b)) (a : J.L) {Z : C} (h : I.left a ⟶ Z) : CategoryStruct.comp (lift hK k hk) (CategoryStruct.comp (K.ι a) h) = CategoryStruct.comp (k a) h

@[simp]

theorem CategoryTheory.Limits.Multifork.pi_condition {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) [HasProduct I.left] [HasProduct I.right] : CategoryStruct.comp (Pi.lift K.ι) I.fstPiMap = CategoryStruct.comp (Pi.lift K.ι) I.sndPiMap

@[simp]

theorem CategoryTheory.Limits.Multifork.pi_condition_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) [HasProduct I.left] [HasProduct I.right] {Z : C} (h : ∏ᶜ I.right ⟶ Z) : CategoryStruct.comp (Pi.lift K.ι) (CategoryStruct.comp I.fstPiMap h) = CategoryStruct.comp (Pi.lift K.ι) (CategoryStruct.comp I.sndPiMap h)

noncomputable def CategoryTheory.Limits.Multifork.toPiFork {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} [HasProduct I.left] [HasProduct I.right] (K : Multifork I) : Fork I.fstPiMap I.sndPiMap

Given a multifork, we may obtain a fork over ∏ᶜ I.left ⇉ ∏ᶜ I.right.

@[simp]

theorem CategoryTheory.Limits.Multifork.toPiFork_pt {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} [HasProduct I.left] [HasProduct I.right] (K : Multifork I) : K.toPiFork.pt = K.pt

@[simp]

theorem CategoryTheory.Limits.Multifork.toPiFork_π_app_zero {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) [HasProduct I.left] [HasProduct I.right] : K.toPiFork.ι = Pi.lift K.ι

@[simp]

theorem CategoryTheory.Limits.Multifork.toPiFork_π_app_one {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} (K : Multifork I) [HasProduct I.left] [HasProduct I.right] : K.toPiFork.π.app WalkingParallelPair.one = CategoryStruct.comp (Pi.lift K.ι) I.fstPiMap

noncomputable def CategoryTheory.Limits.Multifork.ofPiFork {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (c : Fork I.fstPiMap I.sndPiMap) : Multifork I

Given a fork over ∏ᶜ I.left ⇉ ∏ᶜ I.right, we may obtain a multifork.

@[simp]

theorem CategoryTheory.Limits.Multifork.ofPiFork_pt {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (c : Fork I.fstPiMap I.sndPiMap) : (ofPiFork I c).pt = c.pt

@[simp]

theorem CategoryTheory.Limits.Multifork.ofPiFork_π_app_left {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (c : Fork I.fstPiMap I.sndPiMap) (a : J.L) : (ofPiFork I c).ι a = CategoryStruct.comp c.ι (Pi.π I.left a)

@[simp]

theorem CategoryTheory.Limits.Multifork.ofPiFork_π_app_right {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (c : Fork I.fstPiMap I.sndPiMap) (a : J.R) : (ofPiFork I c).π.app (WalkingMulticospan.right a) = CategoryStruct.comp c.ι (CategoryStruct.comp I.fstPiMap (Pi.π I.right a))

noncomputable def CategoryTheory.Limits.MulticospanIndex.toPiForkFunctor {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : Functor (Multifork I) (Fork I.fstPiMap I.sndPiMap)

Multifork.toPiFork as a functor.

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.toPiForkFunctor_map_hom {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] {K₁ K₂ : Multifork I} (f : K₁ ⟶ K₂) : (I.toPiForkFunctor.map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.toPiForkFunctor_obj {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (K : Multifork I) : I.toPiForkFunctor.obj K = K.toPiFork

noncomputable def CategoryTheory.Limits.MulticospanIndex.ofPiForkFunctor {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : Functor (Fork I.fstPiMap I.sndPiMap) (Multifork I)

Multifork.ofPiFork as a functor.

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.ofPiForkFunctor_map_hom {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] {K₁ K₂ : Fork I.fstPiMap I.sndPiMap} (f : K₁ ⟶ K₂) : (I.ofPiForkFunctor.map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.ofPiForkFunctor_obj {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] (c : Fork I.fstPiMap I.sndPiMap) : I.ofPiForkFunctor.obj c = Multifork.ofPiFork I c

noncomputable def CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiFork {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : Multifork I ≌ Fork I.fstPiMap I.sndPiMap

The category of multiforks is equivalent to the category of forks over ∏ᶜ I.left ⇉ ∏ᶜ I.right. It then follows from CategoryTheory.IsLimit.ofPreservesConeTerminal (or reflects) that it preserves and reflects limit cones.

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiFork_functor {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : I.multiforkEquivPiFork.functor = I.toPiForkFunctor

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiFork_counitIso {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : I.multiforkEquivPiFork.counitIso = NatIso.ofComponents (fun (K : Fork I.fstPiMap I.sndPiMap) => Fork.ext (Iso.refl ((I.ofPiForkFunctor.comp I.toPiForkFunctor).obj K).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiFork_inverse {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : I.multiforkEquivPiFork.inverse = I.ofPiForkFunctor

@[simp]

theorem CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiFork_unitIso {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasProduct I.left] [HasProduct I.right] : I.multiforkEquivPiFork.unitIso = NatIso.ofComponents (fun (K : Multifork I) => Cones.ext (Iso.refl ((Functor.id (Multifork I)).obj K).pt) ⋯) ⋯

def CategoryTheory.Limits.Multicofork.π {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (b : J.R) : I.right b ⟶ K.pt

The maps to the cocone point of a multicofork from the objects on the right.

@[simp]

theorem CategoryTheory.Limits.Multicofork.π_eq_app_right {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (b : J.R) : K.ι.app (WalkingMultispan.right b) = K.π b

@[simp]

theorem CategoryTheory.Limits.Multicofork.fst_app_right {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (a : J.L) : K.ι.app (WalkingMultispan.left a) = CategoryStruct.comp (I.fst a) (K.π (J.fst a))

theorem CategoryTheory.Limits.Multicofork.snd_app_right {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (a : J.L) : K.ι.app (WalkingMultispan.left a) = CategoryStruct.comp (I.snd a) (K.π (J.snd a))

theorem CategoryTheory.Limits.Multicofork.snd_app_right_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (a : J.L) {Z : C} (h : ((Functor.const (WalkingMultispan J)).obj K.pt).obj (WalkingMultispan.left a) ⟶ Z) : CategoryStruct.comp (K.ι.app (WalkingMultispan.left a)) h = CategoryStruct.comp (I.snd a) (CategoryStruct.comp (K.π (J.snd a)) h)

@[simp]

theorem CategoryTheory.Limits.Multicofork.π_comp_hom {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K₁ K₂ : Multicofork I) (f : K₁ ⟶ K₂) (b : J.R) : CategoryStruct.comp (K₁.π b) f.hom = K₂.π b

@[simp]

theorem CategoryTheory.Limits.Multicofork.π_comp_hom_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K₁ K₂ : Multicofork I) (f : K₁ ⟶ K₂) (b : J.R) {Z : C} (h : K₂.pt ⟶ Z) : CategoryStruct.comp (K₁.π b) (CategoryStruct.comp f.hom h) = CategoryStruct.comp (K₂.π b) h

def CategoryTheory.Limits.Multicofork.ofπ {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (P : C) (π : (b : J.R) → I.right b ⟶ P) (w : ∀ (a : J.L), CategoryStruct.comp (I.fst a) (π (J.fst a)) = CategoryStruct.comp (I.snd a) (π (J.snd a))) : Multicofork I

Construct a multicofork using a collection π of morphisms.

@[simp]

theorem CategoryTheory.Limits.Multicofork.ofπ_pt {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (P : C) (π : (b : J.R) → I.right b ⟶ P) (w : ∀ (a : J.L), CategoryStruct.comp (I.fst a) (π (J.fst a)) = CategoryStruct.comp (I.snd a) (π (J.snd a))) : (ofπ I P π w).pt = P

@[simp]

theorem CategoryTheory.Limits.Multicofork.ofπ_ι_app {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) (P : C) (π : (b : J.R) → I.right b ⟶ P) (w : ∀ (a : J.L), CategoryStruct.comp (I.fst a) (π (J.fst a)) = CategoryStruct.comp (I.snd a) (π (J.snd a))) (x : WalkingMultispan J) : (ofπ I P π w).ι.app x = match x with | WalkingMultispan.left a => CategoryStruct.comp (I.fst a) (π (J.fst a)) | WalkingMultispan.right a => π a

@[simp]

theorem CategoryTheory.Limits.Multicofork.condition {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (a : J.L) : CategoryStruct.comp (I.fst a) (K.π (J.fst a)) = CategoryStruct.comp (I.snd a) (K.π (J.snd a))

@[simp]

theorem CategoryTheory.Limits.Multicofork.condition_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (a : J.L) {Z : C} (h : K.pt ⟶ Z) : CategoryStruct.comp (I.fst a) (CategoryStruct.comp (K.π (J.fst a)) h) = CategoryStruct.comp (I.snd a) (CategoryStruct.comp (K.π (J.snd a)) h)

def CategoryTheory.Limits.Multicofork.IsColimit.mk {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (desc : (E : Multicofork I) → K.pt ⟶ E.pt) (fac : ∀ (E : Multicofork I) (i : J.R), CategoryStruct.comp (K.π i) (desc E) = E.π i) (uniq : ∀ (E : Multicofork I) (m : K.pt ⟶ E.pt), (∀ (i : J.R), CategoryStruct.comp (K.π i) m = E.π i) → m = desc E) : IsColimit K

This definition provides a convenient way to show that a multicofork is a colimit.

@[simp]

theorem CategoryTheory.Limits.Multicofork.IsColimit.mk_desc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) (desc : (E : Multicofork I) → K.pt ⟶ E.pt) (fac : ∀ (E : Multicofork I) (i : J.R), CategoryStruct.comp (K.π i) (desc E) = E.π i) (uniq : ∀ (E : Multicofork I) (m : K.pt ⟶ E.pt), (∀ (i : J.R), CategoryStruct.comp (K.π i) m = E.π i) → m = desc E) (E : Multicofork I) : (mk K desc fac uniq).desc E = desc E

theorem CategoryTheory.Limits.Multicofork.IsColimit.hom_ext {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K : Multicofork I} (hK : IsColimit K) {T : C} {f g : K.pt ⟶ T} (h : ∀ (a : J.R), CategoryStruct.comp (K.π a) f = CategoryStruct.comp (K.π a) g) : f = g

def CategoryTheory.Limits.Multicofork.IsColimit.desc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K : Multicofork I} (hK : IsColimit K) {T : C} (k : (a : J.R) → I.right a ⟶ T) (hk : ∀ (b : J.L), CategoryStruct.comp (I.fst b) (k (J.fst b)) = CategoryStruct.comp (I.snd b) (k (J.snd b))) : K.pt ⟶ T

Constructor for morphisms from the point of a colimit multicofork.

@[simp]

theorem CategoryTheory.Limits.Multicofork.IsColimit.fac {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K : Multicofork I} (hK : IsColimit K) {T : C} (k : (a : J.R) → I.right a ⟶ T) (hk : ∀ (b : J.L), CategoryStruct.comp (I.fst b) (k (J.fst b)) = CategoryStruct.comp (I.snd b) (k (J.snd b))) (a : J.R) : CategoryStruct.comp (K.π a) (desc hK k hk) = k a

@[simp]

theorem CategoryTheory.Limits.Multicofork.IsColimit.fac_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K : Multicofork I} (hK : IsColimit K) {T : C} (k : (a : J.R) → I.right a ⟶ T) (hk : ∀ (b : J.L), CategoryStruct.comp (I.fst b) (k (J.fst b)) = CategoryStruct.comp (I.snd b) (k (J.snd b))) (a : J.R) {Z : C} (h : T ⟶ Z) : CategoryStruct.comp (K.π a) (CategoryStruct.comp (desc hK k hk) h) = CategoryStruct.comp (k a) h

@[simp]

theorem CategoryTheory.Limits.Multicofork.sigma_condition {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) [HasCoproduct I.left] [HasCoproduct I.right] : CategoryStruct.comp I.fstSigmaMap (Sigma.desc K.π) = CategoryStruct.comp I.sndSigmaMap (Sigma.desc K.π)

@[simp]

theorem CategoryTheory.Limits.Multicofork.sigma_condition_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) [HasCoproduct I.left] [HasCoproduct I.right] {Z : C} (h : K.pt ⟶ Z) : CategoryStruct.comp I.fstSigmaMap (CategoryStruct.comp (Sigma.desc K.π) h) = CategoryStruct.comp I.sndSigmaMap (CategoryStruct.comp (Sigma.desc K.π) h)

noncomputable def CategoryTheory.Limits.Multicofork.toSigmaCofork {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} [HasCoproduct I.left] [HasCoproduct I.right] (K : Multicofork I) : Cofork I.fstSigmaMap I.sndSigmaMap

Given a multicofork, we may obtain a cofork over ∐ I.left ⇉ ∐ I.right.

@[simp]

theorem CategoryTheory.Limits.Multicofork.toSigmaCofork_pt {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} [HasCoproduct I.left] [HasCoproduct I.right] (K : Multicofork I) : K.toSigmaCofork.pt = K.pt

@[simp]

theorem CategoryTheory.Limits.Multicofork.toSigmaCofork_π {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} (K : Multicofork I) [HasCoproduct I.left] [HasCoproduct I.right] : K.toSigmaCofork.π = Sigma.desc K.π

noncomputable def CategoryTheory.Limits.Multicofork.ofSigmaCofork {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (c : Cofork I.fstSigmaMap I.sndSigmaMap) : Multicofork I

Given a cofork over ∐ I.left ⇉ ∐ I.right, we may obtain a multicofork.

@[simp]

theorem CategoryTheory.Limits.Multicofork.ofSigmaCofork_pt {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (c : Cofork I.fstSigmaMap I.sndSigmaMap) : (ofSigmaCofork I c).pt = c.pt

@[simp]

theorem CategoryTheory.Limits.Multicofork.ofSigmaCofork_ι_app_left {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (c : Cofork I.fstSigmaMap I.sndSigmaMap) (a : J.L) : (ofSigmaCofork I c).ι.app (WalkingMultispan.left a) = CategoryStruct.comp (Sigma.ι I.left a) (CategoryStruct.comp I.fstSigmaMap c.π)

theorem CategoryTheory.Limits.Multicofork.ofSigmaCofork_ι_app_right {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (c : Cofork I.fstSigmaMap I.sndSigmaMap) (b : J.R) : (ofSigmaCofork I c).ι.app (WalkingMultispan.right b) = CategoryStruct.comp (Sigma.ι I.right b) c.π

@[simp]

theorem CategoryTheory.Limits.Multicofork.ofSigmaCofork_ι_app_right' {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (c : Cofork I.fstSigmaMap I.sndSigmaMap) (b : J.R) : (ofSigmaCofork I c).π b = CategoryStruct.comp (Sigma.ι I.right b) c.π

def CategoryTheory.Limits.Multicofork.ext {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K K' : Multicofork I} (e : K.pt ≅ K'.pt) (h : ∀ (i : J.R), CategoryStruct.comp (K.π i) e.hom = K'.π i := by cat_disch) : K ≅ K'

Constructor for isomorphisms between multicoforks.

@[simp]

theorem CategoryTheory.Limits.Multicofork.ext_hom_hom {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K K' : Multicofork I} (e : K.pt ≅ K'.pt) (h : ∀ (i : J.R), CategoryStruct.comp (K.π i) e.hom = K'.π i := by cat_disch) : (ext e h).hom.hom = e.hom

@[simp]

theorem CategoryTheory.Limits.Multicofork.ext_inv_hom {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} {K K' : Multicofork I} (e : K.pt ≅ K'.pt) (h : ∀ (i : J.R), CategoryStruct.comp (K.π i) e.hom = K'.π i := by cat_disch) : (ext e h).inv.hom = e.inv

noncomputable def CategoryTheory.Limits.MultispanIndex.toSigmaCoforkFunctor {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : Functor (Multicofork I) (Cofork I.fstSigmaMap I.sndSigmaMap)

Multicofork.toSigmaCofork as a functor.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toSigmaCoforkFunctor_map_hom {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] {K₁ K₂ : Multicofork I} (f : K₁ ⟶ K₂) : (I.toSigmaCoforkFunctor.map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toSigmaCoforkFunctor_obj {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (K : Multicofork I) : I.toSigmaCoforkFunctor.obj K = K.toSigmaCofork

noncomputable def CategoryTheory.Limits.MultispanIndex.ofSigmaCoforkFunctor {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : Functor (Cofork I.fstSigmaMap I.sndSigmaMap) (Multicofork I)

Multicofork.ofSigmaCofork as a functor.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.ofSigmaCoforkFunctor_map_hom {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] {K₁ K₂ : Cofork I.fstSigmaMap I.sndSigmaMap} (f : K₁ ⟶ K₂) : (I.ofSigmaCoforkFunctor.map f).hom = f.hom

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.ofSigmaCoforkFunctor_obj {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] (c : Cofork I.fstSigmaMap I.sndSigmaMap) : I.ofSigmaCoforkFunctor.obj c = Multicofork.ofSigmaCofork I c

noncomputable def CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : Multicofork I ≌ Cofork I.fstSigmaMap I.sndSigmaMap

The category of multicoforks is equivalent to the category of coforks over ∐ I.left ⇉ ∐ I.right. It then follows from CategoryTheory.IsColimit.ofPreservesCoconeInitial (or reflects) that it preserves and reflects colimit cocones.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_unitIso {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : I.multicoforkEquivSigmaCofork.unitIso = NatIso.ofComponents (fun (K : Multicofork I) => Cocones.ext (Iso.refl ((Functor.id (Multicofork I)).obj K).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_counitIso {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : I.multicoforkEquivSigmaCofork.counitIso = NatIso.ofComponents (fun (K : Cofork I.fstSigmaMap I.sndSigmaMap) => Cofork.ext (Iso.refl ((I.ofSigmaCoforkFunctor.comp I.toSigmaCoforkFunctor).obj K).pt) ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_inverse {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : I.multicoforkEquivSigmaCofork.inverse = I.ofSigmaCoforkFunctor

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCofork_functor {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasCoproduct I.left] [HasCoproduct I.right] : I.multicoforkEquivSigmaCofork.functor = I.toSigmaCoforkFunctor

@[reducible, inline]

abbrev CategoryTheory.Limits.HasMultiequalizer {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) : Prop

For I : MulticospanIndex J C, we say that it has a multiequalizer if the associated multicospan has a limit.

@[reducible, inline]

abbrev CategoryTheory.Limits.multiequalizer {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] : C

The multiequalizer of I : MulticospanIndex J C.

@[reducible, inline]

abbrev CategoryTheory.Limits.HasMulticoequalizer {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) : Prop

For I : MultispanIndex J C, we say that it has a multicoequalizer if the associated multicospan has a limit.

@[reducible, inline]

abbrev CategoryTheory.Limits.multicoequalizer {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] : C

The multiecoqualizer of I : MultispanIndex J C.

@[reducible, inline]

abbrev CategoryTheory.Limits.Multiequalizer.ι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (a : J.L) : multiequalizer I ⟶ I.left a

The canonical map from the multiequalizer to the objects on the left.

@[reducible, inline]

abbrev CategoryTheory.Limits.Multiequalizer.multifork {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] : Multifork I

The multifork associated to the multiequalizer.

@[simp]

theorem CategoryTheory.Limits.Multiequalizer.multifork_ι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (a : J.L) : (multifork I).ι a = ι I a

@[simp]

theorem CategoryTheory.Limits.Multiequalizer.multifork_π_app_left {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (a : J.L) : (multifork I).π.app (WalkingMulticospan.left a) = ι I a

theorem CategoryTheory.Limits.Multiequalizer.condition {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (b : J.R) : CategoryStruct.comp (ι I (J.fst b)) (I.fst b) = CategoryStruct.comp (ι I (J.snd b)) (I.snd b)

theorem CategoryTheory.Limits.Multiequalizer.condition_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (b : J.R) {Z : C} (h : I.right b ⟶ Z) : CategoryStruct.comp (ι I (J.fst b)) (CategoryStruct.comp (I.fst b) h) = CategoryStruct.comp (ι I (J.snd b)) (CategoryStruct.comp (I.snd b) h)

@[reducible, inline]

abbrev CategoryTheory.Limits.Multiequalizer.lift {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (W : C) (k : (a : J.L) → W ⟶ I.left a) (h : ∀ (b : J.R), CategoryStruct.comp (k (J.fst b)) (I.fst b) = CategoryStruct.comp (k (J.snd b)) (I.snd b)) : W ⟶ multiequalizer I

Construct a morphism to the multiequalizer from its universal property.

theorem CategoryTheory.Limits.Multiequalizer.lift_ι {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (W : C) (k : (a : J.L) → W ⟶ I.left a) (h : ∀ (b : J.R), CategoryStruct.comp (k (J.fst b)) (I.fst b) = CategoryStruct.comp (k (J.snd b)) (I.snd b)) (a : J.L) : CategoryStruct.comp (lift I W k h) (ι I a) = k a

theorem CategoryTheory.Limits.Multiequalizer.lift_ι_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] (W : C) (k : (a : J.L) → W ⟶ I.left a) (h : ∀ (b : J.R), CategoryStruct.comp (k (J.fst b)) (I.fst b) = CategoryStruct.comp (k (J.snd b)) (I.snd b)) (a : J.L) {Z : C} (h✝ : I.left a ⟶ Z) : CategoryStruct.comp (lift I W k h) (CategoryStruct.comp (ι I a) h✝) = CategoryStruct.comp (k a) h✝

theorem CategoryTheory.Limits.Multiequalizer.hom_ext {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] {W : C} (i j : W ⟶ multiequalizer I) (h : ∀ (a : J.L), CategoryStruct.comp i (ι I a) = CategoryStruct.comp j (ι I a)) : i = j

theorem CategoryTheory.Limits.Multiequalizer.hom_ext_iff {C : Type u} [Category.{v, u} C] {J : MulticospanShape} {I : MulticospanIndex J C} [HasMultiequalizer I] {W : C} {i j : W ⟶ multiequalizer I} : i = j ↔ ∀ (a : J.L), CategoryStruct.comp i (ι I a) = CategoryStruct.comp j (ι I a)

instance CategoryTheory.Limits.Multiequalizer.instHasEqualizerFstPiMapSndPiMap {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] [HasProduct I.left] [HasProduct I.right] : HasEqualizer I.fstPiMap I.sndPiMap

def CategoryTheory.Limits.Multiequalizer.isoEqualizer {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] [HasProduct I.left] [HasProduct I.right] : multiequalizer I ≅ equalizer I.fstPiMap I.sndPiMap

The multiequalizer is isomorphic to the equalizer of ∏ᶜ I.left ⇉ ∏ᶜ I.right.

def CategoryTheory.Limits.Multiequalizer.ιPi {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] [HasProduct I.left] [HasProduct I.right] : multiequalizer I ⟶ ∏ᶜ I.left

The canonical injection multiequalizer I ⟶ ∏ᶜ I.left.

@[simp]

theorem CategoryTheory.Limits.Multiequalizer.ιPi_π {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] [HasProduct I.left] [HasProduct I.right] (a : J.L) : CategoryStruct.comp (ιPi I) (Pi.π I.left a) = ι I a

@[simp]

theorem CategoryTheory.Limits.Multiequalizer.ιPi_π_assoc {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] [HasProduct I.left] [HasProduct I.right] (a : J.L) {Z : C} (h : I.left a ⟶ Z) : CategoryStruct.comp (ιPi I) (CategoryStruct.comp (Pi.π I.left a) h) = CategoryStruct.comp (ι I a) h

instance CategoryTheory.Limits.Multiequalizer.instMonoιPi {C : Type u} [Category.{v, u} C] {J : MulticospanShape} (I : MulticospanIndex J C) [HasMultiequalizer I] [HasProduct I.left] [HasProduct I.right] : Mono (ιPi I)

@[reducible, inline]

abbrev CategoryTheory.Limits.Multicoequalizer.π {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (b : J.R) : I.right b ⟶ multicoequalizer I

The canonical map from the multiequalizer to the objects on the left.

@[reducible, inline]

abbrev CategoryTheory.Limits.Multicoequalizer.multicofork {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] : Multicofork I

The multicofork associated to the multicoequalizer.

@[simp]

theorem CategoryTheory.Limits.Multicoequalizer.multicofork_π {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (b : J.R) : (multicofork I).π b = π I b

theorem CategoryTheory.Limits.Multicoequalizer.multicofork_ι_app_right {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (b : J.R) : (multicofork I).ι.app (WalkingMultispan.right b) = π I b

@[simp]

theorem CategoryTheory.Limits.Multicoequalizer.multicofork_ι_app_right' {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (b : J.R) : colimit.ι I.multispan (WalkingMultispan.right b) = π I b

theorem CategoryTheory.Limits.Multicoequalizer.condition {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (a : J.L) : CategoryStruct.comp (I.fst a) (π I (J.fst a)) = CategoryStruct.comp (I.snd a) (π I (J.snd a))

theorem CategoryTheory.Limits.Multicoequalizer.condition_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (a : J.L) {Z : C} (h : multicoequalizer I ⟶ Z) : CategoryStruct.comp (I.fst a) (CategoryStruct.comp (π I (J.fst a)) h) = CategoryStruct.comp (I.snd a) (CategoryStruct.comp (π I (J.snd a)) h)

@[reducible, inline]

abbrev CategoryTheory.Limits.Multicoequalizer.desc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (W : C) (k : (b : J.R) → I.right b ⟶ W) (h : ∀ (a : J.L), CategoryStruct.comp (I.fst a) (k (J.fst a)) = CategoryStruct.comp (I.snd a) (k (J.snd a))) : multicoequalizer I ⟶ W

Construct a morphism from the multicoequalizer from its universal property.

theorem CategoryTheory.Limits.Multicoequalizer.π_desc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (W : C) (k : (b : J.R) → I.right b ⟶ W) (h : ∀ (a : J.L), CategoryStruct.comp (I.fst a) (k (J.fst a)) = CategoryStruct.comp (I.snd a) (k (J.snd a))) (b : J.R) : CategoryStruct.comp (π I b) (desc I W k h) = k b

theorem CategoryTheory.Limits.Multicoequalizer.π_desc_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] (W : C) (k : (b : J.R) → I.right b ⟶ W) (h : ∀ (a : J.L), CategoryStruct.comp (I.fst a) (k (J.fst a)) = CategoryStruct.comp (I.snd a) (k (J.snd a))) (b : J.R) {Z : C} (h✝ : W ⟶ Z) : CategoryStruct.comp (π I b) (CategoryStruct.comp (desc I W k h) h✝) = CategoryStruct.comp (k b) h✝

theorem CategoryTheory.Limits.Multicoequalizer.hom_ext {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] {W : C} (i j : multicoequalizer I ⟶ W) (h : ∀ (b : J.R), CategoryStruct.comp (π I b) i = CategoryStruct.comp (π I b) j) : i = j

theorem CategoryTheory.Limits.Multicoequalizer.hom_ext_iff {C : Type u} [Category.{v, u} C] {J : MultispanShape} {I : MultispanIndex J C} [HasMulticoequalizer I] {W : C} {i j : multicoequalizer I ⟶ W} : i = j ↔ ∀ (b : J.R), CategoryStruct.comp (π I b) i = CategoryStruct.comp (π I b) j

instance CategoryTheory.Limits.Multicoequalizer.instHasCoequalizerFstSigmaMapSndSigmaMap {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] [HasCoproduct I.left] [HasCoproduct I.right] : HasCoequalizer I.fstSigmaMap I.sndSigmaMap

def CategoryTheory.Limits.Multicoequalizer.isoCoequalizer {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] [HasCoproduct I.left] [HasCoproduct I.right] : multicoequalizer I ≅ coequalizer I.fstSigmaMap I.sndSigmaMap

The multicoequalizer is isomorphic to the coequalizer of ∐ I.left ⇉ ∐ I.right.

def CategoryTheory.Limits.Multicoequalizer.sigmaπ {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] [HasCoproduct I.left] [HasCoproduct I.right] : ∐ I.right ⟶ multicoequalizer I

The canonical projection ∐ I.right ⟶ multicoequalizer I.

@[simp]

theorem CategoryTheory.Limits.Multicoequalizer.ι_sigmaπ {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] [HasCoproduct I.left] [HasCoproduct I.right] (b : J.R) : CategoryStruct.comp (Sigma.ι I.right b) (sigmaπ I) = π I b

@[simp]

theorem CategoryTheory.Limits.Multicoequalizer.ι_sigmaπ_assoc {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] [HasCoproduct I.left] [HasCoproduct I.right] (b : J.R) {Z : C} (h : multicoequalizer I ⟶ Z) : CategoryStruct.comp (Sigma.ι I.right b) (CategoryStruct.comp (sigmaπ I) h) = CategoryStruct.comp (π I b) h

instance CategoryTheory.Limits.Multicoequalizer.instEpiSigmaπ {C : Type u} [Category.{v, u} C] {J : MultispanShape} (I : MultispanIndex J C) [HasMulticoequalizer I] [HasCoproduct I.left] [HasCoproduct I.right] : Epi (sigmaπ I)

def CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder (ι : Type w) [LinearOrder ι] : Functor (WalkingMultispan (MultispanShape.ofLinearOrder ι)) (WalkingMultispan (MultispanShape.prod ι))

The inclusion functor WalkingMultispan (.ofLinearOrder ι) ⥤ WalkingMultispan (.prod ι).

@[simp]

theorem CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder_map (ι : Type w) [LinearOrder ι] {x y : WalkingMultispan (MultispanShape.ofLinearOrder ι)} (f : x ⟶ y) : (inclusionOfLinearOrder ι).map f = match x, y, f with | x, .(x), Hom.id .(x) => CategoryStruct.id (match x with | left a => left ↑a | right b => right b) | .(left b), .(right ((MultispanShape.ofLinearOrder ι).fst b)), Hom.fst b => Hom.fst ↑b | .(left b), .(right ((MultispanShape.ofLinearOrder ι).snd b)), Hom.snd b => Hom.snd ↑b

@[simp]

theorem CategoryTheory.Limits.WalkingMultispan.inclusionOfLinearOrder_obj (ι : Type w) [LinearOrder ι] (x : WalkingMultispan (MultispanShape.ofLinearOrder ι)) : (inclusionOfLinearOrder ι).obj x = match x with | left a => left ↑a | right b => right b

structure CategoryTheory.Limits.MultispanIndex.SymmStruct {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) : Type (max v w)

Structure expressing a symmetry of I : MultispanIndex (.prod ι) C which allows to compare the corresponding multicoequalizer to the multicoequalizer of I.toLinearOrder.

• iso (i j : ι) : I.left (i, j) ≅ I.left (j, i)

  the symmetry isomorphism

• iso_hom_fst (i j : ι) : CategoryStruct.comp (self.iso i j).hom (I.fst (j, i)) = I.snd (i, j)
• iso_hom_snd (i j : ι) : CategoryStruct.comp (self.iso i j).hom (I.snd (j, i)) = I.fst (i, j)
• fst_eq_snd (i : ι) : I.fst (i, i) = I.snd (i, i)

theorem CategoryTheory.Limits.MultispanIndex.SymmStruct.iso_hom_snd_assoc {C : Type u} [Category.{v, u} C] {ι : Type w} {I : MultispanIndex (MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) {Z : C} (h : I.right ((MultispanShape.prod ι).snd (j, i)) ⟶ Z) : CategoryStruct.comp (self.iso i j).hom (CategoryStruct.comp (I.snd (j, i)) h) = CategoryStruct.comp (I.fst (i, j)) h

theorem CategoryTheory.Limits.MultispanIndex.SymmStruct.iso_hom_fst_assoc {C : Type u} [Category.{v, u} C] {ι : Type w} {I : MultispanIndex (MultispanShape.prod ι) C} (self : I.SymmStruct) (i j : ι) {Z : C} (h : I.right ((MultispanShape.prod ι).fst (j, i)) ⟶ Z) : CategoryStruct.comp (self.iso i j).hom (CategoryStruct.comp (I.fst (j, i)) h) = CategoryStruct.comp (I.snd (i, j)) h

def CategoryTheory.Limits.MultispanIndex.toLinearOrder {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] : MultispanIndex (MultispanShape.ofLinearOrder ι) C

The multispan index for MultispanShape.ofLinearOrder ι deduced from a multispan index for MultispanShape.prod ι when ι is linearly ordered.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toLinearOrder_left {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] (j : (MultispanShape.ofLinearOrder ι).L) : I.toLinearOrder.left j = I.left ↑j

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toLinearOrder_fst {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] (j : (MultispanShape.ofLinearOrder ι).L) : I.toLinearOrder.fst j = I.fst ↑j

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toLinearOrder_right {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] (i : (MultispanShape.ofLinearOrder ι).R) : I.toLinearOrder.right i = I.right i

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toLinearOrder_snd {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] (j : (MultispanShape.ofLinearOrder ι).L) : I.toLinearOrder.snd j = I.snd ↑j

def CategoryTheory.Limits.MultispanIndex.toLinearOrderMultispanIso {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] : (WalkingMultispan.inclusionOfLinearOrder ι).comp I.multispan ≅ I.toLinearOrder.multispan

Given a linearly ordered type ι and I : MultispanIndex (.prod ι) C, this is the isomorphism of functors between WalkingMultispan.inclusionOfLinearOrder ι ⋙ I.multispan and I.toLinearOrder.multispan.

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toLinearOrderMultispanIso_inv_app {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] (X : WalkingMultispan (MultispanShape.ofLinearOrder ι)) : I.toLinearOrderMultispanIso.inv.app X = (match X with | WalkingMultispan.left a => Iso.refl (I.left ↑a) | WalkingMultispan.right a => Iso.refl (I.right a)).inv

@[simp]

theorem CategoryTheory.Limits.MultispanIndex.toLinearOrderMultispanIso_hom_app {C : Type u} [Category.{v, u} C] {ι : Type w} (I : MultispanIndex (MultispanShape.prod ι) C) [LinearOrder ι] (X : WalkingMultispan (MultispanShape.ofLinearOrder ι)) : I.toLinearOrderMultispanIso.hom.app X = (match X with | WalkingMultispan.left a => Iso.refl (I.left ↑a) | WalkingMultispan.right a => Iso.refl (I.right a)).hom

def CategoryTheory.Limits.Multicofork.toLinearOrder {C : Type u} [Category.{v, u} C] {ι : Type w} [LinearOrder ι] {I : MultispanIndex (MultispanShape.prod ι) C} (c : Multicofork I) : Multicofork I.toLinearOrder

The multicofork for I.toLinearOrder deduced from a multicofork for I : MultispanIndex (.prod ι) C when ι is linearly ordered.

def CategoryTheory.Limits.Multicofork.ofLinearOrder {C : Type u} [Category.{v, u} C] {ι : Type w} [LinearOrder ι] {I : MultispanIndex (MultispanShape.prod ι) C} (c : Multicofork I.toLinearOrder) (h : I.SymmStruct) : Multicofork I

The multicofork for I : MultispanIndex (.prod ι) C deduced from a multicofork for I.toLinearOrder when ι is linearly ordered and I is symmetric.

def CategoryTheory.Limits.Multicofork.isColimitToLinearOrder {C : Type u} [Category.{v, u} C] {ι : Type w} [LinearOrder ι] {I : MultispanIndex (MultispanShape.prod ι) C} (c : Multicofork I) (hc : IsColimit c) (h : I.SymmStruct) : IsColimit c.toLinearOrder

If ι is a linearly ordered type, I : MultispanIndex (.prod ι) C, and c a colimit multicofork for I, then c.toLinearOrder is a colimit multicofork for I.toLinearOrder.