Lifting properties and adjunction

In this file, we obtain Adjunction.HasLiftingProperty_iff, which states that when we have an adjunction adj : G ⊣ F between two functors G : C ⥤ D and F : D ⥤ C, then a morphism of the form G.map i has the left lifting property in D with respect to a morphism p if and only the morphism i has the left lifting property in C with respect to F.map p.

theorem CategoryTheory.CommSq.right_adjoint {C : Type u_1} {D : Type u_2} [Category.{u_4, u_1} C] [Category.{u_3, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : G.obj A ⟶ X} {v : G.obj B ⟶ Y} (sq : CommSq u (G.map i) p v) (adj : G ⊣ F) : CommSq ((adj.homEquiv A X) u) i (F.map p) ((adj.homEquiv B Y) v)

When we have an adjunction G ⊣ F, any commutative square where the left map is of the form G.map i and the right map is p has an "adjoint" commutative square whose left map is i and whose right map is F.map p.

def CategoryTheory.CommSq.rightAdjointLiftStructEquiv {C : Type u_1} {D : Type u_2} [Category.{u_3, u_1} C] [Category.{u_4, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : G.obj A ⟶ X} {v : G.obj B ⟶ Y} (sq : CommSq u (G.map i) p v) (adj : G ⊣ F) : sq.LiftStruct ≃ ⋯.LiftStruct

The liftings of a commutative are in bijection with the liftings of its (right) adjoint square.

Equations

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

theorem CategoryTheory.CommSq.right_adjoint_hasLift_iff {C : Type u_1} {D : Type u_2} [Category.{u_3, u_1} C] [Category.{u_4, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : G.obj A ⟶ X} {v : G.obj B ⟶ Y} (sq : CommSq u (G.map i) p v) (adj : G ⊣ F) : ⋯.HasLift ↔ sq.HasLift

A square has a lifting if and only if its (right) adjoint square has a lifting.

instance CategoryTheory.CommSq.instHasLift {C : Type u_1} {D : Type u_2} [Category.{u_4, u_1} C] [Category.{u_3, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : G.obj A ⟶ X} {v : G.obj B ⟶ Y} (sq : CommSq u (G.map i) p v) (adj : G ⊣ F) [sq.HasLift] : ⋯.HasLift

theorem CategoryTheory.CommSq.left_adjoint {C : Type u_1} {D : Type u_2} [Category.{u_3, u_1} C] [Category.{u_4, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : A ⟶ F.obj X} {v : B ⟶ F.obj Y} (sq : CommSq u i (F.map p) v) (adj : G ⊣ F) : CommSq ((adj.homEquiv A X).symm u) (G.map i) p ((adj.homEquiv B Y).symm v)

When we have an adjunction G ⊣ F, any commutative square where the left map is of the form i and the right map is F.map p has an "adjoint" commutative square whose left map is G.map i and whose right map is p.

def CategoryTheory.CommSq.leftAdjointLiftStructEquiv {C : Type u_1} {D : Type u_2} [Category.{u_3, u_1} C] [Category.{u_4, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : A ⟶ F.obj X} {v : B ⟶ F.obj Y} (sq : CommSq u i (F.map p) v) (adj : G ⊣ F) : sq.LiftStruct ≃ ⋯.LiftStruct

The liftings of a commutative are in bijection with the liftings of its (left) adjoint square.

Equations

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

theorem CategoryTheory.CommSq.left_adjoint_hasLift_iff {C : Type u_1} {D : Type u_2} [Category.{u_4, u_1} C] [Category.{u_3, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : A ⟶ F.obj X} {v : B ⟶ F.obj Y} (sq : CommSq u i (F.map p) v) (adj : G ⊣ F) : ⋯.HasLift ↔ sq.HasLift

A (left) adjoint square has a lifting if and only if the original square has a lifting.

instance CategoryTheory.CommSq.instHasLift_1 {C : Type u_1} {D : Type u_2} [Category.{u_3, u_1} C] [Category.{u_4, u_2} D] {G : Functor C D} {F : Functor D C} {A B : C} {X Y : D} {i : A ⟶ B} {p : X ⟶ Y} {u : A ⟶ F.obj X} {v : B ⟶ F.obj Y} (sq : CommSq u i (F.map p) v) (adj : G ⊣ F) [sq.HasLift] : ⋯.HasLift

theorem CategoryTheory.Adjunction.hasLiftingProperty_iff {C : Type u_1} {D : Type u_2} [Category.{u_3, u_1} C] [Category.{u_4, u_2} D] {G : Functor C D} {F : Functor D C} (adj : G ⊣ F) {A B : C} {X Y : D} (i : A ⟶ B) (p : X ⟶ Y) : HasLiftingProperty (G.map i) p ↔ HasLiftingProperty i (F.map p)