Cospan & Span

We define a category WalkingCospan (resp. WalkingSpan), which is the index category for the given data for a pullback (resp. pushout) diagram. Convenience methods cospan f g and span f g construct functors from the walking (co)span, hitting the given morphisms.

References

• Stacks: Fibre products
• Stacks: Pushouts

@[reducible, inline]

abbrev CategoryTheory.Limits.WalkingCospan : Type

The type of objects for the diagram indexing a pullback, defined as a special case of WidePullbackShape.

Equations

• CategoryTheory.Limits.WalkingCospan = CategoryTheory.Limits.WidePullbackShape CategoryTheory.Limits.WalkingPair

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingCospan.left : WalkingCospan

The left point of the walking cospan.

Equations

• CategoryTheory.Limits.WalkingCospan.left = some CategoryTheory.Limits.WalkingPair.left

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingCospan.right : WalkingCospan

The right point of the walking cospan.

Equations

• CategoryTheory.Limits.WalkingCospan.right = some CategoryTheory.Limits.WalkingPair.right

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingCospan.one : WalkingCospan

The central point of the walking cospan.

Equations

• CategoryTheory.Limits.WalkingCospan.one = none

@[reducible, inline]

abbrev CategoryTheory.Limits.WalkingSpan : Type

The type of objects for the diagram indexing a pushout, defined as a special case of WidePushoutShape.

Equations

• CategoryTheory.Limits.WalkingSpan = CategoryTheory.Limits.WidePushoutShape CategoryTheory.Limits.WalkingPair

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingSpan.left : WalkingSpan

The left point of the walking span.

Equations

• CategoryTheory.Limits.WalkingSpan.left = some CategoryTheory.Limits.WalkingPair.left

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingSpan.right : WalkingSpan

The right point of the walking span.

Equations

• CategoryTheory.Limits.WalkingSpan.right = some CategoryTheory.Limits.WalkingPair.right

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingSpan.zero : WalkingSpan

The central point of the walking span.

Equations

• CategoryTheory.Limits.WalkingSpan.zero = none

@[reducible, inline]

abbrev CategoryTheory.Limits.WalkingCospan.Hom : WalkingCospan → WalkingCospan → Type

The type of arrows for the diagram indexing a pullback.

Equations

• CategoryTheory.Limits.WalkingCospan.Hom = CategoryTheory.Limits.WidePullbackShape.Hom

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingCospan.Hom.inl : left ⟶ one

The left arrow of the walking cospan.

Equations

• CategoryTheory.Limits.WalkingCospan.Hom.inl = CategoryTheory.Limits.WidePullbackShape.Hom.term CategoryTheory.Limits.WalkingPair.left

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingCospan.Hom.inr : right ⟶ one

The right arrow of the walking cospan.

Equations

• CategoryTheory.Limits.WalkingCospan.Hom.inr = CategoryTheory.Limits.WidePullbackShape.Hom.term CategoryTheory.Limits.WalkingPair.right

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingCospan.Hom.id (X : WalkingCospan) : X ⟶ X

The identity arrows of the walking cospan.

Equations

• CategoryTheory.Limits.WalkingCospan.Hom.id X = CategoryTheory.Limits.WidePullbackShape.Hom.id X

instance CategoryTheory.Limits.WalkingCospan.instSubsingletonHom (X Y : WalkingCospan) : Subsingleton (X ⟶ Y)

@[reducible, inline]

abbrev CategoryTheory.Limits.WalkingSpan.Hom : WalkingSpan → WalkingSpan → Type

The type of arrows for the diagram indexing a pushout.

Equations

• CategoryTheory.Limits.WalkingSpan.Hom = CategoryTheory.Limits.WidePushoutShape.Hom

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingSpan.Hom.fst : zero ⟶ left

The left arrow of the walking span.

Equations

• CategoryTheory.Limits.WalkingSpan.Hom.fst = CategoryTheory.Limits.WidePushoutShape.Hom.init CategoryTheory.Limits.WalkingPair.left

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingSpan.Hom.snd : zero ⟶ right

The right arrow of the walking span.

Equations

• CategoryTheory.Limits.WalkingSpan.Hom.snd = CategoryTheory.Limits.WidePushoutShape.Hom.init CategoryTheory.Limits.WalkingPair.right

@[reducible, match_pattern, inline]

abbrev CategoryTheory.Limits.WalkingSpan.Hom.id (X : WalkingSpan) : X ⟶ X

The identity arrows of the walking span.

Equations

• CategoryTheory.Limits.WalkingSpan.Hom.id X = CategoryTheory.Limits.WidePushoutShape.Hom.id X

instance CategoryTheory.Limits.WalkingSpan.instSubsingletonHom (X Y : WalkingSpan) : Subsingleton (X ⟶ Y)

def CategoryTheory.Limits.WalkingCospan.ext {C : Type u} [Category.{v, u} C] {F : Functor WalkingCospan C} {s t : Cone F} (i : s.pt ≅ t.pt) (w₁ : s.π.app left = CategoryStruct.comp i.hom (t.π.app left)) (w₂ : s.π.app right = CategoryStruct.comp i.hom (t.π.app right)) : s ≅ t

To construct an isomorphism of cones over the walking cospan, it suffices to construct an isomorphism of the cone points and check it commutes with the legs to left and right.

Equations

• CategoryTheory.Limits.WalkingCospan.ext i w₁ w₂ = CategoryTheory.Limits.Cones.ext i ⋯

def CategoryTheory.Limits.WalkingSpan.ext {C : Type u} [Category.{v, u} C] {F : Functor WalkingSpan C} {s t : Cocone F} (i : s.pt ≅ t.pt) (w₁ : CategoryStruct.comp (s.ι.app WalkingCospan.left) i.hom = t.ι.app WalkingCospan.left) (w₂ : CategoryStruct.comp (s.ι.app WalkingCospan.right) i.hom = t.ι.app WalkingCospan.right) : s ≅ t

To construct an isomorphism of cocones over the walking span, it suffices to construct an isomorphism of the cocone points and check it commutes with the legs from left and right.

Equations

• CategoryTheory.Limits.WalkingSpan.ext i w₁ w₂ = CategoryTheory.Limits.Cocones.ext i ⋯

def CategoryTheory.Limits.cospan {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : Functor WalkingCospan C

cospan f g is the functor from the walking cospan hitting f and g.

Equations

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

def CategoryTheory.Limits.span {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : Functor WalkingSpan C

span f g is the functor from the walking span hitting f and g.

Equations

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

@[simp]

theorem CategoryTheory.Limits.cospan_left {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospan f g).obj WalkingCospan.left = X

@[simp]

theorem CategoryTheory.Limits.span_left {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (span f g).obj WalkingSpan.left = Y

@[simp]

theorem CategoryTheory.Limits.cospan_right {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospan f g).obj WalkingCospan.right = Y

@[simp]

theorem CategoryTheory.Limits.span_right {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (span f g).obj WalkingSpan.right = Z

@[simp]

theorem CategoryTheory.Limits.cospan_one {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospan f g).obj WalkingCospan.one = Z

@[simp]

theorem CategoryTheory.Limits.span_zero {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (span f g).obj WalkingSpan.zero = X

@[simp]

theorem CategoryTheory.Limits.cospan_map_inl {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospan f g).map WalkingCospan.Hom.inl = f

@[simp]

theorem CategoryTheory.Limits.span_map_fst {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (span f g).map WalkingSpan.Hom.fst = f

@[simp]

theorem CategoryTheory.Limits.cospan_map_inr {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospan f g).map WalkingCospan.Hom.inr = g

@[simp]

theorem CategoryTheory.Limits.span_map_snd {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (span f g).map WalkingSpan.Hom.snd = g

theorem CategoryTheory.Limits.cospan_map_id {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) (w : WalkingCospan) : (cospan f g).map (WalkingCospan.Hom.id w) = CategoryStruct.id ((cospan f g).obj w)

theorem CategoryTheory.Limits.span_map_id {C : Type u} [Category.{v, u} C] {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) (w : WalkingSpan) : (span f g).map (WalkingSpan.Hom.id w) = CategoryStruct.id ((span f g).obj w)

def CategoryTheory.Limits.diagramIsoCospan {C : Type u} [Category.{v, u} C] (F : Functor WalkingCospan C) : F ≅ cospan (F.map WalkingCospan.Hom.inl) (F.map WalkingCospan.Hom.inr)

Every diagram indexing a pullback is naturally isomorphic (actually, equal) to a cospan

Equations

• CategoryTheory.Limits.diagramIsoCospan F = CategoryTheory.NatIso.ofComponents (fun (j : CategoryTheory.Limits.WalkingCospan) => CategoryTheory.eqToIso ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.diagramIsoCospan_hom_app {C : Type u} [Category.{v, u} C] (F : Functor WalkingCospan C) (X : WalkingCospan) : (diagramIsoCospan F).hom.app X = eqToHom ⋯

@[simp]

theorem CategoryTheory.Limits.diagramIsoCospan_inv_app {C : Type u} [Category.{v, u} C] (F : Functor WalkingCospan C) (X : WalkingCospan) : (diagramIsoCospan F).inv.app X = eqToHom ⋯

def CategoryTheory.Limits.diagramIsoSpan {C : Type u} [Category.{v, u} C] (F : Functor WalkingSpan C) : F ≅ span (F.map WalkingSpan.Hom.fst) (F.map WalkingSpan.Hom.snd)

Every diagram indexing a pushout is naturally isomorphic (actually, equal) to a span

Equations

• CategoryTheory.Limits.diagramIsoSpan F = CategoryTheory.NatIso.ofComponents (fun (j : CategoryTheory.Limits.WalkingSpan) => CategoryTheory.eqToIso ⋯) ⋯

@[simp]

theorem CategoryTheory.Limits.diagramIsoSpan_inv_app {C : Type u} [Category.{v, u} C] (F : Functor WalkingSpan C) (X : WalkingSpan) : (diagramIsoSpan F).inv.app X = eqToHom ⋯

@[simp]

theorem CategoryTheory.Limits.diagramIsoSpan_hom_app {C : Type u} [Category.{v, u} C] (F : Functor WalkingSpan C) (X : WalkingSpan) : (diagramIsoSpan F).hom.app X = eqToHom ⋯

def CategoryTheory.Limits.cospanCompIso {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospan f g).comp F ≅ cospan (F.map f) (F.map g)

A functor applied to a cospan is a cospan.

Equations

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

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_app_left {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).app WalkingCospan.left = Iso.refl (((cospan f g).comp F).obj WalkingCospan.left)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_app_right {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).app WalkingCospan.right = Iso.refl (((cospan f g).comp F).obj WalkingCospan.right)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_app_one {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).app WalkingCospan.one = Iso.refl (((cospan f g).comp F).obj WalkingCospan.one)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_hom_app_left {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).hom.app WalkingCospan.left = CategoryStruct.id (((cospan f g).comp F).obj WalkingCospan.left)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_hom_app_right {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).hom.app WalkingCospan.right = CategoryStruct.id (((cospan f g).comp F).obj WalkingCospan.right)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_hom_app_one {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).hom.app WalkingCospan.one = CategoryStruct.id (((cospan f g).comp F).obj WalkingCospan.one)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_inv_app_left {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).inv.app WalkingCospan.left = CategoryStruct.id ((cospan (F.map f) (F.map g)).obj WalkingCospan.left)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_inv_app_right {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).inv.app WalkingCospan.right = CategoryStruct.id ((cospan (F.map f) (F.map g)).obj WalkingCospan.right)

@[simp]

theorem CategoryTheory.Limits.cospanCompIso_inv_app_one {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) : (cospanCompIso F f g).inv.app WalkingCospan.one = CategoryStruct.id ((cospan (F.map f) (F.map g)).obj WalkingCospan.one)

def CategoryTheory.Limits.spanCompIso {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (span f g).comp F ≅ span (F.map f) (F.map g)

A functor applied to a span is a span.

Equations

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

@[simp]

theorem CategoryTheory.Limits.spanCompIso_app_left {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).app WalkingSpan.left = Iso.refl (((span f g).comp F).obj WalkingSpan.left)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_app_right {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).app WalkingSpan.right = Iso.refl (((span f g).comp F).obj WalkingSpan.right)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_app_zero {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).app WalkingSpan.zero = Iso.refl (((span f g).comp F).obj WalkingSpan.zero)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_hom_app_left {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).hom.app WalkingSpan.left = CategoryStruct.id (((span f g).comp F).obj WalkingSpan.left)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_hom_app_right {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).hom.app WalkingSpan.right = CategoryStruct.id (((span f g).comp F).obj WalkingSpan.right)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_hom_app_zero {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).hom.app WalkingSpan.zero = CategoryStruct.id (((span f g).comp F).obj WalkingSpan.zero)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_inv_app_left {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).inv.app WalkingSpan.left = CategoryStruct.id ((span (F.map f) (F.map g)).obj WalkingSpan.left)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_inv_app_right {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).inv.app WalkingSpan.right = CategoryStruct.id ((span (F.map f) (F.map g)).obj WalkingSpan.right)

@[simp]

theorem CategoryTheory.Limits.spanCompIso_inv_app_zero {C : Type u} [Category.{v, u} C] {D : Type u₂} [Category.{v₂, u₂} D] (F : Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : X ⟶ Z) : (spanCompIso F f g).inv.app WalkingSpan.zero = CategoryStruct.id ((span (F.map f) (F.map g)).obj WalkingSpan.zero)

def CategoryTheory.Limits.cospanExt {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : cospan f g ≅ cospan f' g'

Construct an isomorphism of cospans from components.

Equations

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

@[simp]

theorem CategoryTheory.Limits.cospanExt_app_left {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).app WalkingCospan.left = iX

@[simp]

theorem CategoryTheory.Limits.cospanExt_app_right {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).app WalkingCospan.right = iY

@[simp]

theorem CategoryTheory.Limits.cospanExt_app_one {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).app WalkingCospan.one = iZ

@[simp]

theorem CategoryTheory.Limits.cospanExt_hom_app_left {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).hom.app WalkingCospan.left = iX.hom

@[simp]

theorem CategoryTheory.Limits.cospanExt_hom_app_right {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).hom.app WalkingCospan.right = iY.hom

@[simp]

theorem CategoryTheory.Limits.cospanExt_hom_app_one {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).hom.app WalkingCospan.one = iZ.hom

@[simp]

theorem CategoryTheory.Limits.cospanExt_inv_app_left {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).inv.app WalkingCospan.left = iX.inv

@[simp]

theorem CategoryTheory.Limits.cospanExt_inv_app_right {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).inv.app WalkingCospan.right = iY.inv

@[simp]

theorem CategoryTheory.Limits.cospanExt_inv_app_one {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Z} {g : Y ⟶ Z} {f' : X' ⟶ Z'} {g' : Y' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iZ.hom) (wg : CategoryStruct.comp iY.hom g' = CategoryStruct.comp g iZ.hom) : (cospanExt iX iY iZ wf wg).inv.app WalkingCospan.one = iZ.inv

def CategoryTheory.Limits.spanExt {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : span f g ≅ span f' g'

Construct an isomorphism of spans from components.

Equations

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

@[simp]

theorem CategoryTheory.Limits.spanExt_app_left {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).app WalkingSpan.left = iY

@[simp]

theorem CategoryTheory.Limits.spanExt_app_right {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).app WalkingSpan.right = iZ

@[simp]

theorem CategoryTheory.Limits.spanExt_app_one {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).app WalkingSpan.zero = iX

@[simp]

theorem CategoryTheory.Limits.spanExt_hom_app_left {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).hom.app WalkingSpan.left = iY.hom

@[simp]

theorem CategoryTheory.Limits.spanExt_hom_app_right {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).hom.app WalkingSpan.right = iZ.hom

@[simp]

theorem CategoryTheory.Limits.spanExt_hom_app_zero {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).hom.app WalkingSpan.zero = iX.hom

@[simp]

theorem CategoryTheory.Limits.spanExt_inv_app_left {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).inv.app WalkingSpan.left = iY.inv

@[simp]

theorem CategoryTheory.Limits.spanExt_inv_app_right {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).inv.app WalkingSpan.right = iZ.inv

@[simp]

theorem CategoryTheory.Limits.spanExt_inv_app_zero {C : Type u} [Category.{v, u} C] {X Y Z X' Y' Z' : C} (iX : X ≅ X') (iY : Y ≅ Y') (iZ : Z ≅ Z') {f : X ⟶ Y} {g : X ⟶ Z} {f' : X' ⟶ Y'} {g' : X' ⟶ Z'} (wf : CategoryStruct.comp iX.hom f' = CategoryStruct.comp f iY.hom) (wg : CategoryStruct.comp iX.hom g' = CategoryStruct.comp g iZ.hom) : (spanExt iX iY iZ wf wg).inv.app WalkingSpan.zero = iX.inv