Extensions and lifts in bicategories

We introduce the concept of extensions and lifts within the bicategorical framework. These concepts are defined by commutative diagrams in the (1-)categorical context. Within the bicategorical framework, commutative diagrams are replaced by 2-morphisms. Depending on the orientation of the 2-morphisms, we define both left and right extensions (likewise for lifts). The use of left and right here is a common one in the theory of Kan extensions.

Implementation notes

We define extensions and lifts as objects in certain comma categories (StructuredArrow for left, and CostructuredArrow for right). See the file CategoryTheory.StructuredArrow for properties about these categories. We introduce some intuitive aliases. For example, LeftExtension.extension is an alias for Comma.right.

References

• https://ncatlab.org/nlab/show/lifts+and+extensions
• https://ncatlab.org/nlab/show/Kan+extension

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftExtension {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} (f : a ⟶ b) (g : a ⟶ c) : Type (max v w)

Triangle diagrams for (left) extensions.

  b
  △ \
  |   \ extension  △
f |     \          | unit
  |       ◿
  a - - - ▷ c
      g

Equations

• CategoryTheory.Bicategory.LeftExtension f g = CategoryTheory.StructuredArrow g (CategoryTheory.Bicategory.precomp c f)

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftExtension.extension {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) : b ⟶ c

The extension of g along f.

Equations

• t.extension = t.right

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftExtension.unit {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) : g ⟶ CategoryTheory.CategoryStruct.comp f t.extension

The 2-morphism filling the triangle diagram.

Equations

• t.unit = t.hom

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftExtension.mk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (h : b ⟶ c) (unit : g ⟶ CategoryTheory.CategoryStruct.comp f h) : CategoryTheory.Bicategory.LeftExtension f g

Construct a left extension from a 1-morphism and a 2-morphism.

Equations

• CategoryTheory.Bicategory.LeftExtension.mk h unit = CategoryTheory.StructuredArrow.mk unit

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftExtension.homMk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.LeftExtension f g} (η : s.extension ⟶ t.extension) (w : CategoryTheory.CategoryStruct.comp s.unit (CategoryTheory.Bicategory.whiskerLeft f η) = t.unit := by aesop_cat) : s ⟶ t

To construct a morphism between left extensions, we need a 2-morphism between the extensions, and to check that it is compatible with the units.

Equations

• CategoryTheory.Bicategory.LeftExtension.homMk η w = CategoryTheory.StructuredArrow.homMk η w

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.w {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.LeftExtension f g} (η : s ⟶ t) : CategoryTheory.CategoryStruct.comp s.unit (CategoryTheory.Bicategory.whiskerLeft f η.right) = t.unit

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.w_assoc {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.LeftExtension f g} (η : s ⟶ t) {Z : a ⟶ c} (h : CategoryTheory.CategoryStruct.comp f t.right ⟶ Z) : CategoryTheory.CategoryStruct.comp s.unit (CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft f η.right) h) = CategoryTheory.CategoryStruct.comp t.unit h

def CategoryTheory.Bicategory.LeftExtension.alongId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} (g : a ⟶ c) : CategoryTheory.Bicategory.LeftExtension (CategoryTheory.CategoryStruct.id a) g

The left extension along the identity.

Equations

• CategoryTheory.Bicategory.LeftExtension.alongId g = CategoryTheory.Bicategory.LeftExtension.mk g (CategoryTheory.Bicategory.leftUnitor g).inv

instance CategoryTheory.Bicategory.LeftExtension.instInhabitedId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} {g : a ⟶ c} : Inhabited (CategoryTheory.Bicategory.LeftExtension (CategoryTheory.CategoryStruct.id a) g)

Equations

• CategoryTheory.Bicategory.LeftExtension.instInhabitedId = { default := CategoryTheory.Bicategory.LeftExtension.alongId g }

def CategoryTheory.Bicategory.LeftExtension.ofCompId {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g (CategoryTheory.CategoryStruct.id c))) : CategoryTheory.Bicategory.LeftExtension f g

Construct a left extension of g : a ⟶ c from a left extension of g ≫ 𝟙 c.

Equations

• t.ofCompId = CategoryTheory.Bicategory.LeftExtension.mk t.extension (CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.rightUnitor g).inv t.unit)

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.ofCompId_hom {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g (CategoryTheory.CategoryStruct.id c))) : t.ofCompId.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.rightUnitor g).inv t.unit

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.ofCompId_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g (CategoryTheory.CategoryStruct.id c))) : t.ofCompId.right = t.extension

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.ofCompId_left_as {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g (CategoryTheory.CategoryStruct.id c))) : t.ofCompId.left.as = PUnit.unit

def CategoryTheory.Bicategory.LeftExtension.whisker {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) {x : B} (h : c ⟶ x) : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g h)

Whisker a 1-morphism to an extension.

  b
  △ \
  |   \ extension  △
f |     \          | unit
  |       ◿
  a - - - ▷ c - - - ▷ x
      g         h

Equations

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

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whisker_extension {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) {x : B} (h : c ⟶ x) : (t.whisker h).extension = CategoryTheory.CategoryStruct.comp t.extension h

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whisker_unit {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) {x : B} (h : c ⟶ x) : (t.whisker h).unit = CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight t.unit h) (CategoryTheory.Bicategory.associator f t.extension h).hom

def CategoryTheory.Bicategory.LeftExtension.whiskering {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {x : B} (h : c ⟶ x) : CategoryTheory.Functor (CategoryTheory.Bicategory.LeftExtension f g) (CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g h))

Whiskering a 1-morphism is a functor.

Equations

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

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whiskering_map {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {x : B} (h : c ⟶ x) {X✝ Y✝ : CategoryTheory.Bicategory.LeftExtension f g} (η : X✝ ⟶ Y✝) : (CategoryTheory.Bicategory.LeftExtension.whiskering h).map η = CategoryTheory.Bicategory.LeftExtension.homMk (CategoryTheory.Bicategory.whiskerRight η.right h) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whiskering_obj {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {x : B} (h : c ⟶ x) (t : CategoryTheory.Bicategory.LeftExtension f g) : (CategoryTheory.Bicategory.LeftExtension.whiskering h).obj t = t.whisker h

def CategoryTheory.Bicategory.LeftExtension.whiskerIdCancel {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (s : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g (CategoryTheory.CategoryStruct.id c))) {t : CategoryTheory.Bicategory.LeftExtension f g} (τ : s ⟶ t.whisker (CategoryTheory.CategoryStruct.id c)) : s.ofCompId ⟶ t

Define a morphism between left extensions by cancelling the whiskered identities.

Equations

• s.whiskerIdCancel τ = CategoryTheory.Bicategory.LeftExtension.homMk (CategoryTheory.CategoryStruct.comp τ.right (CategoryTheory.Bicategory.rightUnitor t.extension).hom) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whiskerIdCancel_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (s : CategoryTheory.Bicategory.LeftExtension f (CategoryTheory.CategoryStruct.comp g (CategoryTheory.CategoryStruct.id c))) {t : CategoryTheory.Bicategory.LeftExtension f g} (τ : s ⟶ t.whisker (CategoryTheory.CategoryStruct.id c)) : (s.whiskerIdCancel τ).right = CategoryTheory.CategoryStruct.comp τ.right (CategoryTheory.Bicategory.rightUnitor t.extension).hom

def CategoryTheory.Bicategory.LeftExtension.whiskerHom {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.LeftExtension f g} (i : s ⟶ t) {x : B} (h : c ⟶ x) : s.whisker h ⟶ t.whisker h

Construct a morphism between whiskered extensions.

Equations

• CategoryTheory.Bicategory.LeftExtension.whiskerHom i h = CategoryTheory.StructuredArrow.homMk (CategoryTheory.Bicategory.whiskerRight i.right h) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whiskerHom_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.LeftExtension f g} (i : s ⟶ t) {x : B} (h : c ⟶ x) : (CategoryTheory.Bicategory.LeftExtension.whiskerHom i h).right = CategoryTheory.Bicategory.whiskerRight i.right h

def CategoryTheory.Bicategory.LeftExtension.whiskerIso {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.LeftExtension f g} (i : s ≅ t) {x : B} (h : c ⟶ x) : s.whisker h ≅ t.whisker h

Construct an isomorphism between whiskered extensions.

Equations

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

def CategoryTheory.Bicategory.LeftExtension.whiskerOfCompIdIsoSelf {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) : (t.whisker (CategoryTheory.CategoryStruct.id c)).ofCompId ≅ t

The isomorphism between left extensions induced by a right unitor.

Equations

• t.whiskerOfCompIdIsoSelf = CategoryTheory.StructuredArrow.isoMk (CategoryTheory.Bicategory.rightUnitor t.extension) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whiskerOfCompIdIsoSelf_inv_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) : t.whiskerOfCompIdIsoSelf.inv.right = (CategoryTheory.Bicategory.rightUnitor t.extension).inv

@[simp]

theorem CategoryTheory.Bicategory.LeftExtension.whiskerOfCompIdIsoSelf_hom_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.LeftExtension f g) : t.whiskerOfCompIdIsoSelf.hom.right = (CategoryTheory.Bicategory.rightUnitor t.extension).hom

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftLift {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} (f : b ⟶ a) (g : c ⟶ a) : Type (max v w)

Triangle diagrams for (left) lifts.

            b
          ◹ |
   lift /   |      △
      /     | f    | unit
    /       ▽
  c - - - ▷ a
       g

Equations

• CategoryTheory.Bicategory.LeftLift f g = CategoryTheory.StructuredArrow g (CategoryTheory.Bicategory.postcomp c f)

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftLift.lift {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) : c ⟶ b

The lift of g along f.

Equations

• t.lift = t.right

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftLift.unit {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) : g ⟶ CategoryTheory.CategoryStruct.comp t.lift f

The 2-morphism filling the triangle diagram.

Equations

• t.unit = t.hom

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftLift.mk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (h : c ⟶ b) (unit : g ⟶ CategoryTheory.CategoryStruct.comp h f) : CategoryTheory.Bicategory.LeftLift f g

Construct a left lift from a 1-morphism and a 2-morphism.

Equations

• CategoryTheory.Bicategory.LeftLift.mk h unit = CategoryTheory.StructuredArrow.mk unit

@[reducible, inline]

abbrev CategoryTheory.Bicategory.LeftLift.homMk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.LeftLift f g} (η : s.lift ⟶ t.lift) (w : CategoryTheory.CategoryStruct.comp s.unit (CategoryTheory.Bicategory.whiskerRight η f) = t.unit := by aesop_cat) : s ⟶ t

To construct a morphism between left lifts, we need a 2-morphism between the lifts, and to check that it is compatible with the units.

Equations

• CategoryTheory.Bicategory.LeftLift.homMk η w = CategoryTheory.StructuredArrow.homMk η w

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.w {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.LeftLift f g} (h : s ⟶ t) : CategoryTheory.CategoryStruct.comp s.unit (CategoryTheory.Bicategory.whiskerRight h.right f) = t.unit

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.w_assoc {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.LeftLift f g} (h : s ⟶ t) {Z : c ⟶ a} (h✝ : CategoryTheory.CategoryStruct.comp t.right f ⟶ Z) : CategoryTheory.CategoryStruct.comp s.unit (CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight h.right f) h✝) = CategoryTheory.CategoryStruct.comp t.unit h✝

def CategoryTheory.Bicategory.LeftLift.alongId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} (g : c ⟶ a) : CategoryTheory.Bicategory.LeftLift (CategoryTheory.CategoryStruct.id a) g

The left lift along the identity.

Equations

• CategoryTheory.Bicategory.LeftLift.alongId g = CategoryTheory.Bicategory.LeftLift.mk g (CategoryTheory.Bicategory.rightUnitor g).inv

instance CategoryTheory.Bicategory.LeftLift.instInhabitedId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} {g : c ⟶ a} : Inhabited (CategoryTheory.Bicategory.LeftLift (CategoryTheory.CategoryStruct.id a) g)

Equations

• CategoryTheory.Bicategory.LeftLift.instInhabitedId = { default := CategoryTheory.Bicategory.LeftLift.alongId g }

def CategoryTheory.Bicategory.LeftLift.ofIdComp {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) g)) : CategoryTheory.Bicategory.LeftLift f g

Construct a left lift along g : c ⟶ a from a left lift along 𝟙 c ≫ g.

Equations

• t.ofIdComp = CategoryTheory.Bicategory.LeftLift.mk t.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.leftUnitor g).inv t.unit)

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.ofIdComp_hom {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) g)) : t.ofIdComp.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.leftUnitor g).inv t.unit

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.ofIdComp_left_as {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) g)) : t.ofIdComp.left.as = PUnit.unit

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.ofIdComp_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) g)) : t.ofIdComp.right = t.lift

def CategoryTheory.Bicategory.LeftLift.whisker {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) {x : B} (h : x ⟶ c) : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp h g)

Whisker a 1-morphism to a lift.

                    b
                  ◹ |
           lift /   |      △
              /     | f    | unit
            /       ▽
x - - - ▷ c - - - ▷ a
     h         g

Equations

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

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whisker_lift {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) {x : B} (h : x ⟶ c) : (t.whisker h).lift = CategoryTheory.CategoryStruct.comp h t.lift

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whisker_unit {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) {x : B} (h : x ⟶ c) : (t.whisker h).unit = CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft h t.unit) (CategoryTheory.Bicategory.associator h t.lift f).inv

def CategoryTheory.Bicategory.LeftLift.whiskering {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {x : B} (h : x ⟶ c) : CategoryTheory.Functor (CategoryTheory.Bicategory.LeftLift f g) (CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp h g))

Whiskering a 1-morphism is a functor.

Equations

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

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whiskering_map {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {x : B} (h : x ⟶ c) {X✝ Y✝ : CategoryTheory.Bicategory.LeftLift f g} (η : X✝ ⟶ Y✝) : (CategoryTheory.Bicategory.LeftLift.whiskering h).map η = CategoryTheory.Bicategory.LeftLift.homMk (CategoryTheory.Bicategory.whiskerLeft h η.right) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whiskering_obj {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {x : B} (h : x ⟶ c) (t : CategoryTheory.Bicategory.LeftLift f g) : (CategoryTheory.Bicategory.LeftLift.whiskering h).obj t = t.whisker h

def CategoryTheory.Bicategory.LeftLift.whiskerIdCancel {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (s : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) g)) {t : CategoryTheory.Bicategory.LeftLift f g} (τ : s ⟶ t.whisker (CategoryTheory.CategoryStruct.id c)) : s.ofIdComp ⟶ t

Define a morphism between left lifts by cancelling the whiskered identities.

Equations

• s.whiskerIdCancel τ = CategoryTheory.Bicategory.LeftLift.homMk (CategoryTheory.CategoryStruct.comp τ.right (CategoryTheory.Bicategory.leftUnitor t.lift).hom) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whiskerIdCancel_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (s : CategoryTheory.Bicategory.LeftLift f (CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id c) g)) {t : CategoryTheory.Bicategory.LeftLift f g} (τ : s ⟶ t.whisker (CategoryTheory.CategoryStruct.id c)) : (s.whiskerIdCancel τ).right = CategoryTheory.CategoryStruct.comp τ.right (CategoryTheory.Bicategory.leftUnitor t.lift).hom

def CategoryTheory.Bicategory.LeftLift.whiskerHom {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.LeftLift f g} (i : s ⟶ t) {x : B} (h : x ⟶ c) : s.whisker h ⟶ t.whisker h

Construct a morphism between whiskered lifts.

Equations

• CategoryTheory.Bicategory.LeftLift.whiskerHom i h = CategoryTheory.StructuredArrow.homMk (CategoryTheory.Bicategory.whiskerLeft h i.right) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whiskerHom_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.LeftLift f g} (i : s ⟶ t) {x : B} (h : x ⟶ c) : (CategoryTheory.Bicategory.LeftLift.whiskerHom i h).right = CategoryTheory.Bicategory.whiskerLeft h i.right

def CategoryTheory.Bicategory.LeftLift.whiskerIso {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.LeftLift f g} (i : s ≅ t) {x : B} (h : x ⟶ c) : s.whisker h ≅ t.whisker h

Construct an isomorphism between whiskered lifts.

Equations

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

def CategoryTheory.Bicategory.LeftLift.whiskerOfIdCompIsoSelf {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) : (t.whisker (CategoryTheory.CategoryStruct.id c)).ofIdComp ≅ t

The isomorphism between left lifts induced by a left unitor.

Equations

• t.whiskerOfIdCompIsoSelf = CategoryTheory.StructuredArrow.isoMk (CategoryTheory.Bicategory.leftUnitor t.lift) ⋯

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whiskerOfIdCompIsoSelf_hom_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) : t.whiskerOfIdCompIsoSelf.hom.right = (CategoryTheory.Bicategory.leftUnitor t.lift).hom

@[simp]

theorem CategoryTheory.Bicategory.LeftLift.whiskerOfIdCompIsoSelf_inv_right {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.LeftLift f g) : t.whiskerOfIdCompIsoSelf.inv.right = (CategoryTheory.Bicategory.leftUnitor t.lift).inv

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightExtension {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} (f : a ⟶ b) (g : a ⟶ c) : Type (max v w)

Triangle diagrams for (right) extensions.

  b
  △ \
  |   \ extension  | counit
f |     \          ▽
  |       ◿
  a - - - ▷ c
      g

Equations

• CategoryTheory.Bicategory.RightExtension f g = CategoryTheory.CostructuredArrow (CategoryTheory.Bicategory.precomp c f) g

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightExtension.extension {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.RightExtension f g) : b ⟶ c

The extension of g along f.

Equations

• t.extension = t.left

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightExtension.counit {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (t : CategoryTheory.Bicategory.RightExtension f g) : CategoryTheory.CategoryStruct.comp f t.extension ⟶ g

The 2-morphism filling the triangle diagram.

Equations

• t.counit = t.hom

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightExtension.mk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} (h : b ⟶ c) (counit : CategoryTheory.CategoryStruct.comp f h ⟶ g) : CategoryTheory.Bicategory.RightExtension f g

Construct a right extension from a 1-morphism and a 2-morphism.

Equations

• CategoryTheory.Bicategory.RightExtension.mk h counit = CategoryTheory.CostructuredArrow.mk counit

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightExtension.homMk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.RightExtension f g} (η : s.extension ⟶ t.extension) (w : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft f η) t.counit = s.counit) : s ⟶ t

To construct a morphism between right extensions, we need a 2-morphism between the extensions, and to check that it is compatible with the counits.

Equations

• CategoryTheory.Bicategory.RightExtension.homMk η w = CategoryTheory.CostructuredArrow.homMk η w

@[simp]

theorem CategoryTheory.Bicategory.RightExtension.w {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.RightExtension f g} (η : s ⟶ t) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft f η.left) t.counit = s.counit

@[simp]

theorem CategoryTheory.Bicategory.RightExtension.w_assoc {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : a ⟶ b} {g : a ⟶ c} {s t : CategoryTheory.Bicategory.RightExtension f g} (η : s ⟶ t) {Z : a ⟶ c} (h : g ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft f η.left) (CategoryTheory.CategoryStruct.comp t.counit h) = CategoryTheory.CategoryStruct.comp s.counit h

def CategoryTheory.Bicategory.RightExtension.alongId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} (g : a ⟶ c) : CategoryTheory.Bicategory.RightExtension (CategoryTheory.CategoryStruct.id a) g

The right extension along the identity.

Equations

• CategoryTheory.Bicategory.RightExtension.alongId g = CategoryTheory.Bicategory.RightExtension.mk g (CategoryTheory.Bicategory.leftUnitor g).hom

instance CategoryTheory.Bicategory.RightExtension.instInhabitedId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} {g : a ⟶ c} : Inhabited (CategoryTheory.Bicategory.RightExtension (CategoryTheory.CategoryStruct.id a) g)

Equations

• CategoryTheory.Bicategory.RightExtension.instInhabitedId = { default := CategoryTheory.Bicategory.RightExtension.alongId g }

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightLift {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} (f : b ⟶ a) (g : c ⟶ a) : Type (max v w)

Triangle diagrams for (right) lifts.

            b
          ◹ |
   lift /   |      | counit
      /     | f    ▽
    /       ▽
  c - - - ▷ a
       g

Equations

• CategoryTheory.Bicategory.RightLift f g = CategoryTheory.CostructuredArrow (CategoryTheory.Bicategory.postcomp c f) g

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightLift.lift {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.RightLift f g) : c ⟶ b

The lift of g along f.

Equations

• t.lift = t.left

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightLift.counit {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (t : CategoryTheory.Bicategory.RightLift f g) : CategoryTheory.CategoryStruct.comp t.lift f ⟶ g

The 2-morphism filling the triangle diagram.

Equations

• t.counit = t.hom

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightLift.mk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} (h : c ⟶ b) (counit : CategoryTheory.CategoryStruct.comp h f ⟶ g) : CategoryTheory.Bicategory.RightLift f g

Construct a right lift from a 1-morphism and a 2-morphism.

Equations

• CategoryTheory.Bicategory.RightLift.mk h counit = CategoryTheory.CostructuredArrow.mk counit

@[reducible, inline]

abbrev CategoryTheory.Bicategory.RightLift.homMk {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.RightLift f g} (η : s.lift ⟶ t.lift) (w : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight η f) t.counit = s.counit) : s ⟶ t

To construct a morphism between right lifts, we need a 2-morphism between the lifts, and to check that it is compatible with the counits.

Equations

• CategoryTheory.Bicategory.RightLift.homMk η w = CategoryTheory.CostructuredArrow.homMk η w

@[simp]

theorem CategoryTheory.Bicategory.RightLift.w {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.RightLift f g} (h : s ⟶ t) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight h.left f) t.counit = s.counit

@[simp]

theorem CategoryTheory.Bicategory.RightLift.w_assoc {B : Type u} [CategoryTheory.Bicategory B] {a b c : B} {f : b ⟶ a} {g : c ⟶ a} {s t : CategoryTheory.Bicategory.RightLift f g} (h : s ⟶ t) {Z : c ⟶ a} (h✝ : g ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerRight h.left f) (CategoryTheory.CategoryStruct.comp t.counit h✝) = CategoryTheory.CategoryStruct.comp s.counit h✝

def CategoryTheory.Bicategory.RightLift.alongId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} (g : c ⟶ a) : CategoryTheory.Bicategory.RightLift (CategoryTheory.CategoryStruct.id a) g

The right lift along the identity.

Equations

• CategoryTheory.Bicategory.RightLift.alongId g = CategoryTheory.Bicategory.RightLift.mk g (CategoryTheory.Bicategory.rightUnitor g).hom

instance CategoryTheory.Bicategory.RightLift.instInhabitedId {B : Type u} [CategoryTheory.Bicategory B] {a c : B} {g : c ⟶ a} : Inhabited (CategoryTheory.Bicategory.RightLift (CategoryTheory.CategoryStruct.id a) g)

Equations

• CategoryTheory.Bicategory.RightLift.instInhabitedId = { default := CategoryTheory.Bicategory.RightLift.alongId g }