Loogle!
Result
Found 133 declarations mentioning CategoryTheory.Adjunction.homEquiv.
- CategoryTheory.Adjunction.homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) (Y : D) : (F.obj X ⟶ Y) ≃ (X ⟶ G.obj Y) - CategoryTheory.Adjunction.mk'_homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : CategoryTheory.Adjunction.CoreHomEquivUnitCounit F G) : (CategoryTheory.Adjunction.mk' adj).homEquiv = adj.homEquiv - CategoryTheory.Adjunction.mkOfHomEquiv_homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : CategoryTheory.Adjunction.CoreHomEquiv F G) : (CategoryTheory.Adjunction.mkOfHomEquiv adj).homEquiv = adj.homEquiv - CategoryTheory.Adjunction.corepresentableBy_homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) {Y✝ : D} : (adj.corepresentableBy X).homEquiv = adj.homEquiv X Y✝ - CategoryTheory.Adjunction.representableBy_homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (Y : D) {X✝ : C} : (adj.representableBy Y).homEquiv = (adj.homEquiv X✝ Y).symm - CategoryTheory.Adjunction.comp_homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} {H : CategoryTheory.Functor D E} {I : CategoryTheory.Functor E D} (adj₁ : F ⊣ G) (adj₂ : H ⊣ I) : (adj₁.comp adj₂).homEquiv = fun x x_1 => (adj₂.homEquiv (F.obj x) x_1).trans (adj₁.homEquiv x (I.obj x_1)) - CategoryTheory.Adjunction.homEquiv_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) (Y : D) (f : F.obj X ⟶ Y) : (adj.homEquiv X Y) f = CategoryTheory.CategoryStruct.comp (adj.unit.app X) (G.map f) - CategoryTheory.Adjunction.homEquiv_unit 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) (Y : D) (f : F.obj X ⟶ Y) : (adj.homEquiv X Y) f = CategoryTheory.CategoryStruct.comp (adj.unit.app X) (G.map f) - CategoryTheory.Adjunction.homEquiv_counit 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) (Y : D) (g : X ⟶ G.obj Y) : (adj.homEquiv X Y).symm g = CategoryTheory.CategoryStruct.comp (F.map g) (adj.counit.app Y) - CategoryTheory.Adjunction.homEquiv_symm_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) (Y : D) (g : X ⟶ G.obj Y) : (adj.homEquiv X Y).symm g = CategoryTheory.CategoryStruct.comp (F.map g) (adj.counit.app Y) - CategoryTheory.Adjunction.homEquiv_id 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) : (adj.homEquiv X (F.obj X)) (CategoryTheory.CategoryStruct.id (F.obj X)) = adj.unit.app X - CategoryTheory.Adjunction.homEquiv_symm_id 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : D) : (adj.homEquiv (G.obj X) X).symm (CategoryTheory.CategoryStruct.id (G.obj X)) = adj.counit.app X - CategoryTheory.Adjunction.homEquiv_symm_unit 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : C) : (adj.homEquiv X (F.obj X)).symm (adj.unit.app X) = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.Adjunction.homEquiv_naturality_left 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y : D} (f : X' ⟶ X) (g : F.obj X ⟶ Y) : (adj.homEquiv X' Y) (CategoryTheory.CategoryStruct.comp (F.map f) g) = CategoryTheory.CategoryStruct.comp f ((adj.homEquiv X Y) g) - CategoryTheory.Adjunction.homEquiv_naturality_right 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X : C} {Y Y' : D} (f : F.obj X ⟶ Y) (g : Y ⟶ Y') : (adj.homEquiv X Y') (CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X Y) f) (G.map g) - CategoryTheory.Adjunction.eq_homEquiv_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {A : C} {B : D} (f : F.obj A ⟶ B) (g : A ⟶ G.obj B) : g = (adj.homEquiv A B) f ↔ (adj.homEquiv A B).symm g = f - CategoryTheory.Adjunction.homEquiv_apply_eq 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {A : C} {B : D} (f : F.obj A ⟶ B) (g : A ⟶ G.obj B) : (adj.homEquiv A B) f = g ↔ f = (adj.homEquiv A B).symm g - CategoryTheory.Adjunction.homEquiv_ofNatIsoLeft_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G : CategoryTheory.Functor C D} {H : CategoryTheory.Functor D C} (adj : F ⊣ H) (iso : F ≅ G) {X : C} {Y : D} (f : G.obj X ⟶ Y) : ((adj.ofNatIsoLeft iso).homEquiv X Y) f = (adj.homEquiv X Y) (CategoryTheory.CategoryStruct.comp (iso.hom.app X) f) - CategoryTheory.Adjunction.homEquiv_ofNatIsoRight_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G H : CategoryTheory.Functor D C} (adj : F ⊣ G) (iso : G ≅ H) {X : C} {Y : D} (f : F.obj X ⟶ Y) : ((adj.ofNatIsoRight iso).homEquiv X Y) f = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X Y) f) (iso.hom.app Y) - CategoryTheory.Adjunction.homEquiv_naturality_left_symm 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y : D} (f : X' ⟶ X) (g : X ⟶ G.obj Y) : (adj.homEquiv X' Y).symm (CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.CategoryStruct.comp (F.map f) ((adj.homEquiv X Y).symm g) - CategoryTheory.Adjunction.homEquiv_naturality_right_symm 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X : C} {Y Y' : D} (f : X ⟶ G.obj Y) (g : Y ⟶ Y') : (adj.homEquiv X Y').symm (CategoryTheory.CategoryStruct.comp f (G.map g)) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X Y).symm f) g - CategoryTheory.Adjunction.homEquiv_ofNatIsoLeft_symm_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G : CategoryTheory.Functor C D} {H : CategoryTheory.Functor D C} (adj : F ⊣ H) (iso : F ≅ G) {X : C} {Y : D} (f : X ⟶ H.obj Y) : ((adj.ofNatIsoLeft iso).homEquiv X Y).symm f = CategoryTheory.CategoryStruct.comp (iso.inv.app X) ((adj.homEquiv X Y).symm f) - CategoryTheory.Adjunction.homEquiv_ofNatIsoRight_symm_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G H : CategoryTheory.Functor D C} (adj : F ⊣ G) (iso : G ≅ H) {X : C} {Y : D} (f : X ⟶ H.obj Y) : ((adj.ofNatIsoRight iso).homEquiv X Y).symm f = (adj.homEquiv X Y).symm (CategoryTheory.CategoryStruct.comp f (iso.inv.app Y)) - CategoryTheory.Adjunction.homEquiv_naturality_left_square 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y Y' : D} (f : X' ⟶ X) (g : F.obj X ⟶ Y') (h : F.obj X' ⟶ Y) (k : Y ⟶ Y') (w : CategoryTheory.CategoryStruct.comp (F.map f) g = CategoryTheory.CategoryStruct.comp h k) : CategoryTheory.CategoryStruct.comp f ((adj.homEquiv X Y') g) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X' Y) h) (G.map k) - CategoryTheory.Adjunction.homEquiv_naturality_left_square_iff 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y Y' : D} (f : X' ⟶ X) (g : F.obj X ⟶ Y') (h : F.obj X' ⟶ Y) (k : Y ⟶ Y') : CategoryTheory.CategoryStruct.comp f ((adj.homEquiv X Y') g) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X' Y) h) (G.map k) ↔ CategoryTheory.CategoryStruct.comp (F.map f) g = CategoryTheory.CategoryStruct.comp h k - CategoryTheory.Adjunction.homEquiv_naturality_left_square_assoc 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y Y' : D} (f : X' ⟶ X) (g : F.obj X ⟶ Y') (h : F.obj X' ⟶ Y) (k : Y ⟶ Y') (w : CategoryTheory.CategoryStruct.comp (F.map f) g = CategoryTheory.CategoryStruct.comp h k) {Z : C} (h✝ : G.obj Y' ⟶ Z) : CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp ((adj.homEquiv X Y') g) h✝) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X' Y) h) (CategoryTheory.CategoryStruct.comp (G.map k) h✝) - CategoryTheory.Adjunction.homEquiv_naturality_right_square 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y Y' : D} (f : X' ⟶ X) (g : X ⟶ G.obj Y') (h : X' ⟶ G.obj Y) (k : Y ⟶ Y') (w : CategoryTheory.CategoryStruct.comp f g = CategoryTheory.CategoryStruct.comp h (G.map k)) : CategoryTheory.CategoryStruct.comp (F.map f) ((adj.homEquiv X Y').symm g) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X' Y).symm h) k - CategoryTheory.Adjunction.homEquiv_naturality_right_square_iff 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y Y' : D} (f : X' ⟶ X) (g : X ⟶ G.obj Y') (h : X' ⟶ G.obj Y) (k : Y ⟶ Y') : CategoryTheory.CategoryStruct.comp (F.map f) ((adj.homEquiv X Y').symm g) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X' Y).symm h) k ↔ CategoryTheory.CategoryStruct.comp f g = CategoryTheory.CategoryStruct.comp h (G.map k) - CategoryTheory.Adjunction.homEquiv_naturality_right_square_assoc 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) {X' X : C} {Y Y' : D} (f : X' ⟶ X) (g : X ⟶ G.obj Y') (h : X' ⟶ G.obj Y) (k : Y ⟶ Y') (w : CategoryTheory.CategoryStruct.comp f g = CategoryTheory.CategoryStruct.comp h (G.map k)) {Z : D} (h✝ : Y' ⟶ Z) : CategoryTheory.CategoryStruct.comp (F.map f) (CategoryTheory.CategoryStruct.comp ((adj.homEquiv X Y').symm g) h✝) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv X' Y).symm h) (CategoryTheory.CategoryStruct.comp k h✝) - CategoryTheory.CommSq.right_adjoint 📋 Mathlib.CategoryTheory.LiftingProperties.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {G : CategoryTheory.Functor C D} {F : CategoryTheory.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 : CategoryTheory.CommSq u (G.map i) p v) (adj : G ⊣ F) : CategoryTheory.CommSq ((adj.homEquiv A X) u) i (F.map p) ((adj.homEquiv B Y) v) - CategoryTheory.CommSq.instHasLiftRightAdjoin 📋 Mathlib.CategoryTheory.LiftingProperties.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {G : CategoryTheory.Functor C D} {F : CategoryTheory.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 : CategoryTheory.CommSq u (G.map i) p v) (adj : G ⊣ F) [sq.HasLift] : ⋯.HasLift - CategoryTheory.CommSq.rightAdjointLiftStructEquiv 📋 Mathlib.CategoryTheory.LiftingProperties.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {G : CategoryTheory.Functor C D} {F : CategoryTheory.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 : CategoryTheory.CommSq u (G.map i) p v) (adj : G ⊣ F) : sq.LiftStruct ≃ ⋯.LiftStruct - CategoryTheory.CommSq.right_adjoint_hasLift_iff 📋 Mathlib.CategoryTheory.LiftingProperties.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {G : CategoryTheory.Functor C D} {F : CategoryTheory.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 : CategoryTheory.CommSq u (G.map i) p v) (adj : G ⊣ F) : ⋯.HasLift ↔ sq.HasLift - CategoryTheory.Adjunction.instMonoCoeEquivHomObjHomEquivOfReflectsMonomorphisms 📋 Mathlib.CategoryTheory.Functor.EpiMono
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {F : CategoryTheory.Functor C D} {F' : CategoryTheory.Functor D C} (adj : F ⊣ F') {X : C} {Y : D} (f : F.obj X ⟶ Y) [hf : CategoryTheory.Mono f] [F.ReflectsMonomorphisms] : CategoryTheory.Mono ((adj.homEquiv X Y) f) - CategoryTheory.Limits.isLimitConeOfAdj_lift 📋 Mathlib.CategoryTheory.Limits.HasLimits
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {L : CategoryTheory.Functor (CategoryTheory.Functor J C) C} (adj : CategoryTheory.Functor.const J ⊣ L) (F : CategoryTheory.Functor J C) (s : CategoryTheory.Limits.Cone F) : (CategoryTheory.Limits.isLimitConeOfAdj adj F).lift s = (adj.homEquiv s.pt F) s.π - CategoryTheory.Adjunction.rightAdjointLaxMonoidal_ε 📋 Mathlib.CategoryTheory.Monoidal.Functor
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.MonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.MonoidalCategory D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.OplaxMonoidal] : CategoryTheory.Functor.LaxMonoidal.ε G = (adj.homEquiv (CategoryTheory.MonoidalCategoryStruct.tensorUnit C) (CategoryTheory.MonoidalCategoryStruct.tensorUnit D)) (CategoryTheory.Functor.OplaxMonoidal.η F) - CategoryTheory.Adjunction.leftAdjointOplaxMonoidal_η 📋 Mathlib.CategoryTheory.Monoidal.Functor
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.MonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.MonoidalCategory D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [G.LaxMonoidal] : CategoryTheory.Functor.OplaxMonoidal.η F = (adj.homEquiv (CategoryTheory.MonoidalCategoryStruct.tensorUnit C) (CategoryTheory.MonoidalCategoryStruct.tensorUnit D)).symm (CategoryTheory.Functor.LaxMonoidal.ε G) - CategoryTheory.Adjunction.rightAdjointLaxMonoidal_μ 📋 Mathlib.CategoryTheory.Monoidal.Functor
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.MonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.MonoidalCategory D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.OplaxMonoidal] (X Y : D) : CategoryTheory.Functor.LaxMonoidal.μ G X Y = (adj.homEquiv (CategoryTheory.MonoidalCategoryStruct.tensorObj (G.obj X) (G.obj Y)) (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OplaxMonoidal.δ F (G.obj X) (G.obj Y)) (CategoryTheory.MonoidalCategoryStruct.tensorHom (adj.counit.app X) (adj.counit.app Y))) - CategoryTheory.Adjunction.leftAdjointOplaxMonoidal_δ 📋 Mathlib.CategoryTheory.Monoidal.Functor
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.MonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.MonoidalCategory D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [G.LaxMonoidal] (X Y : C) : CategoryTheory.Functor.OplaxMonoidal.δ F X Y = (adj.homEquiv (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y) (CategoryTheory.MonoidalCategoryStruct.tensorObj (F.obj X) (F.obj Y))).symm (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom (adj.unit.app X) (adj.unit.app Y)) (CategoryTheory.Functor.LaxMonoidal.μ G (F.obj X) (F.obj Y))) - ModuleCat.homEquiv_extendScalarsId 📋 Mathlib.Algebra.Category.ModuleCat.ChangeOfRings
{R : Type u₁} [CommRing R] (M : ModuleCat R) : ((ModuleCat.extendRestrictScalarsAdj (RingHom.id R)).homEquiv M ((CategoryTheory.Functor.id (ModuleCat R)).obj M)) ((ModuleCat.extendScalarsId R).hom.app M) = (ModuleCat.restrictScalarsId R).inv.app M - ModuleCat.extendRestrictScalarsAdj_homEquiv_apply 📋 Mathlib.Algebra.Category.ModuleCat.ChangeOfRings
{R : Type u₁} {S : Type u₂} [CommRing R] [CommRing S] {f : R →+* S} {M : ModuleCat R} {N : ModuleCat S} (φ : (ModuleCat.extendScalars f).obj M ⟶ N) (m : ↑M) : (CategoryTheory.ConcreteCategory.hom (((ModuleCat.extendRestrictScalarsAdj f).homEquiv M N) φ)) m = (CategoryTheory.ConcreteCategory.hom φ) (1 ⊗ₜ[R] m) - ModuleCat.homEquiv_extendScalarsComp 📋 Mathlib.Algebra.Category.ModuleCat.ChangeOfRings
{R₁ R₂ R₃ : Type u₁} [CommRing R₁] [CommRing R₂] [CommRing R₃] (f₁₂ : R₁ →+* R₂) (f₂₃ : R₂ →+* R₃) (M : ModuleCat R₁) : ((ModuleCat.extendRestrictScalarsAdj (f₂₃.comp f₁₂)).homEquiv M (((ModuleCat.extendScalars f₁₂).comp (ModuleCat.extendScalars f₂₃)).obj M)) ((ModuleCat.extendScalarsComp f₁₂ f₂₃).hom.app M) = CategoryTheory.CategoryStruct.comp ((ModuleCat.extendRestrictScalarsAdj f₁₂).unit.app M) (CategoryTheory.CategoryStruct.comp ((ModuleCat.restrictScalars f₁₂).map ((ModuleCat.extendRestrictScalarsAdj f₂₃).unit.app (ModuleCat.ExtendScalars.obj' f₁₂ M))) ((ModuleCat.restrictScalarsComp f₁₂ f₂₃).inv.app ((ModuleCat.extendScalars f₂₃).obj (ModuleCat.ExtendScalars.obj' f₁₂ M)))) - CategoryTheory.Adjunction.homEquiv_leftAdjointUniq_hom_app 📋 Mathlib.CategoryTheory.Adjunction.Unique
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {F F' : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj1 : F ⊣ G) (adj2 : F' ⊣ G) (x : C) : (adj1.homEquiv x (F'.obj x)) ((adj1.leftAdjointUniq adj2).hom.app x) = adj2.unit.app x - CategoryTheory.Adjunction.homEquiv_symm_rightAdjointUniq_hom_app 📋 Mathlib.CategoryTheory.Adjunction.Unique
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {F : CategoryTheory.Functor C D} {G G' : CategoryTheory.Functor D C} (adj1 : F ⊣ G) (adj2 : F ⊣ G') (x : D) : (adj2.homEquiv (G.obj x) x).symm ((adj1.rightAdjointUniq adj2).hom.app x) = adj1.counit.app x - CategoryTheory.WithTerminal.isLimitEquiv_symm_apply_lift 📋 Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} {K : CategoryTheory.Functor J (CategoryTheory.Over X)} {t : CategoryTheory.Limits.Cone K} (t✝ : CategoryTheory.Limits.IsLimit t) (s : CategoryTheory.Limits.Cone (CategoryTheory.WithTerminal.liftFromOver.obj K)) : (CategoryTheory.WithTerminal.isLimitEquiv.symm t✝).lift s = ((CategoryTheory.WithTerminal.coneEquiv.symm.toAdjunction.homEquiv s t) (t✝.liftConeMorphism (CategoryTheory.WithTerminal.coneEquiv.inverse.obj s))).hom - CategoryTheory.ParametrizedAdjunction.homEquiv_eq 📋 Mathlib.CategoryTheory.Adjunction.Parametrized
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {G : CategoryTheory.Functor C₁ᵒᵖ (CategoryTheory.Functor C₃ C₂)} (adj₂ : F ⊣₂ G) {X₁ : C₁} {X₂ : C₂} {X₃ : C₃} : adj₂.homEquiv = (adj₂.adj X₁).homEquiv X₂ X₃ - CategoryTheory.ParametrizedAdjunction.mk' 📋 Mathlib.CategoryTheory.Adjunction.Parametrized
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {G : CategoryTheory.Functor C₁ᵒᵖ (CategoryTheory.Functor C₃ C₂)} (adj : (X₁ : C₁) → F.obj X₁ ⊣ G.obj (Opposite.op X₁)) (h : ∀ {X₁ Y₁ : C₁} (f : X₁ ⟶ Y₁) {X₂ : C₂} {X₃ : C₃} (g : (F.obj Y₁).obj X₂ ⟶ X₃), ((adj X₁).homEquiv X₂ X₃) (CategoryTheory.CategoryStruct.comp ((F.map f).app X₂) g) = CategoryTheory.CategoryStruct.comp (((adj Y₁).homEquiv X₂ X₃) g) ((G.map f.op).app X₃) := by cat_disch) : F ⊣₂ G - CategoryTheory.ParametrizedAdjunction.mk'_adj 📋 Mathlib.CategoryTheory.Adjunction.Parametrized
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {G : CategoryTheory.Functor C₁ᵒᵖ (CategoryTheory.Functor C₃ C₂)} (adj : (X₁ : C₁) → F.obj X₁ ⊣ G.obj (Opposite.op X₁)) (h : ∀ {X₁ Y₁ : C₁} (f : X₁ ⟶ Y₁) {X₂ : C₂} {X₃ : C₃} (g : (F.obj Y₁).obj X₂ ⟶ X₃), ((adj X₁).homEquiv X₂ X₃) (CategoryTheory.CategoryStruct.comp ((F.map f).app X₂) g) = CategoryTheory.CategoryStruct.comp (((adj Y₁).homEquiv X₂ X₃) g) ((G.map f.op).app X₃) := by cat_disch) (X₁ : C₁) : (CategoryTheory.ParametrizedAdjunction.mk' adj h).adj X₁ = adj X₁ - CategoryTheory.MonoidalClosed.homEquiv_apply_eq 📋 Mathlib.CategoryTheory.Monoidal.Closed.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] {A X Y : C} [CategoryTheory.Closed A] (f : CategoryTheory.MonoidalCategoryStruct.tensorObj A Y ⟶ X) : ((CategoryTheory.ihom.adjunction A).homEquiv Y X) f = CategoryTheory.MonoidalClosed.curry f - CategoryTheory.MonoidalClosed.homEquiv_symm_apply_eq 📋 Mathlib.CategoryTheory.Monoidal.Closed.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] {A X Y : C} [CategoryTheory.Closed A] (f : Y ⟶ A ⟹ X) : ((CategoryTheory.ihom.adjunction A).homEquiv Y X).symm f = CategoryTheory.MonoidalClosed.uncurry f - CategoryTheory.MonoidalClosed.ofEquiv_curry_def 📋 Mathlib.CategoryTheory.Monoidal.Closed.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.MonoidalCategory D] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Monoidal] [F.IsEquivalence] [CategoryTheory.MonoidalClosed D] {X Y Z : C} (f : CategoryTheory.MonoidalCategoryStruct.tensorObj X Y ⟶ Z) : CategoryTheory.MonoidalClosed.curry f = (adj.homEquiv Y (F.obj X ⟹ F.obj Z)) (CategoryTheory.MonoidalClosed.curry ((adj.toEquivalence.symm.toAdjunction.homEquiv (CategoryTheory.MonoidalCategoryStruct.tensorObj (F.obj X) (F.obj Y)) Z) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.Monoidal.commTensorLeft F X).compInverseIso.hom.app Y) f))) - CategoryTheory.MonoidalClosed.ofEquiv_uncurry_def 📋 Mathlib.CategoryTheory.Monoidal.Closed.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.MonoidalCategory D] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Monoidal] [F.IsEquivalence] [CategoryTheory.MonoidalClosed D] {X Y Z : C} (f : Y ⟶ X ⟹ Z) : CategoryTheory.MonoidalClosed.uncurry f = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.Monoidal.commTensorLeft F X).compInverseIso.inv.app Y) ((adj.toEquivalence.symm.toAdjunction.homEquiv ((F.comp (CategoryTheory.MonoidalCategory.tensorLeft (F.obj X))).obj Y) Z).symm (CategoryTheory.MonoidalClosed.uncurry ((adj.homEquiv Y (F.obj X ⟹ adj.toEquivalence.symm.inverse.obj Z)).symm f))) - CategoryTheory.Adjunction.restrictFullyFaithful_homEquiv_apply 📋 Mathlib.CategoryTheory.Adjunction.Restrict
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {C' : Type u₃} [CategoryTheory.Category.{v₃, u₃} C'] {D' : Type u₄} [CategoryTheory.Category.{v₄, u₄} D'] {iC : CategoryTheory.Functor C C'} {iD : CategoryTheory.Functor D D'} {L' : CategoryTheory.Functor C' D'} {R' : CategoryTheory.Functor D' C'} (adj : L' ⊣ R') (hiC : iC.FullyFaithful) (hiD : iD.FullyFaithful) {L : CategoryTheory.Functor C D} {R : CategoryTheory.Functor D C} (comm1 : iC.comp L' ≅ L.comp iD) (comm2 : iD.comp R' ≅ R.comp iC) {X : C} {Y : D} (f : L.obj X ⟶ Y) : ((adj.restrictFullyFaithful hiC hiD comm1 comm2).homEquiv X Y) f = hiC.preimage (CategoryTheory.CategoryStruct.comp (adj.unit.app (iC.obj X)) (CategoryTheory.CategoryStruct.comp (R'.map (comm1.hom.app X)) (CategoryTheory.CategoryStruct.comp (R'.map (iD.map f)) (comm2.hom.app Y)))) - CategoryTheory.Functor.isIso_ranAdjunction_homEquiv_iff 📋 Mathlib.CategoryTheory.Functor.KanExtension.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (L : CategoryTheory.Functor C D) {H : Type u_3} [CategoryTheory.Category.{v_3, u_3} H] [∀ (F : CategoryTheory.Functor C H), L.HasRightKanExtension F] {F : CategoryTheory.Functor C H} {G : CategoryTheory.Functor D H} (α : L.comp G ⟶ F) : CategoryTheory.IsIso (((L.ranAdjunction H).homEquiv G F) α) ↔ G.IsRightKanExtension α - CategoryTheory.Functor.isIso_lanAdjunction_homEquiv_symm_iff 📋 Mathlib.CategoryTheory.Functor.KanExtension.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (L : CategoryTheory.Functor C D) {H : Type u_3} [CategoryTheory.Category.{v_3, u_3} H] [∀ (F : CategoryTheory.Functor C H), L.HasLeftKanExtension F] {F : CategoryTheory.Functor C H} {G : CategoryTheory.Functor D H} (α : F ⟶ L.comp G) : CategoryTheory.IsIso (((L.lanAdjunction H).homEquiv F G).symm α) ↔ G.IsLeftKanExtension α - CategoryTheory.Presheaf.uliftYonedaAdjunction_homEquiv_app 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {ℰ : Type u₂} [CategoryTheory.Category.{v₂, u₂} ℰ] {A : CategoryTheory.Functor C ℰ} [CategoryTheory.uliftYoneda.{max w v₂, v₁, u₁}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cᵒᵖ (Type (max w v₁ v₂))) ℰ) (α : A ⟶ CategoryTheory.uliftYoneda.{max w v₂, v₁, u₁}.comp L) [L.IsLeftKanExtension α] {P : CategoryTheory.Functor Cᵒᵖ (Type (max w v₁ v₂))} {Y : ℰ} (f : L.obj P ⟶ Y) {Z : Cᵒᵖ} (z : P.obj Z) : (CategoryTheory.ConcreteCategory.hom ((((CategoryTheory.Presheaf.uliftYonedaAdjunction L α).homEquiv P Y) f).app Z)) z = { down := CategoryTheory.CategoryStruct.comp (α.app (Opposite.unop Z)) (CategoryTheory.CategoryStruct.comp (L.map (CategoryTheory.uliftYonedaEquiv.symm z)) f) } - ModuleCat.adj_homEquiv 📋 Mathlib.Algebra.Category.ModuleCat.Adjunctions
(R : Type u) [Ring R] (X : Type u) (M : ModuleCat R) : (ModuleCat.adj R).homEquiv X M = ModuleCat.freeHomEquiv - CategoryTheory.Comonad.ComonadicityInternal.comparisonRightAdjointHomEquiv_symm_apply_f 📋 Mathlib.CategoryTheory.Monad.Comonadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (A : adj.toComonad.Coalgebra) (B : C) [CategoryTheory.Limits.HasEqualizer (G.map A.a) (adj.unit.app (G.obj A.A))] (f : B ⟶ CategoryTheory.Comonad.ComonadicityInternal.comparisonRightAdjointObj adj A) : ((CategoryTheory.Comonad.ComonadicityInternal.comparisonRightAdjointHomEquiv adj A B).symm f).f = (adj.homEquiv B A.A).symm (CategoryTheory.CategoryStruct.comp f (CategoryTheory.Limits.equalizer.ι (G.map A.a) (adj.unit.app (G.1 A.A)))) - CategoryTheory.Comonad.ComonadicityInternal.comparisonRightAdjointHomEquiv_apply 📋 Mathlib.CategoryTheory.Monad.Comonadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (A : adj.toComonad.Coalgebra) (B : C) [CategoryTheory.Limits.HasEqualizer (G.map A.a) (adj.unit.app (G.obj A.A))] (f : (CategoryTheory.Comonad.comparison adj).obj B ⟶ A) : (CategoryTheory.Comonad.ComonadicityInternal.comparisonRightAdjointHomEquiv adj A B) f = CategoryTheory.Limits.equalizer.lift ((adj.homEquiv B A.A) f.f) ⋯ - CategoryTheory.Comonad.ComonadicityInternal.comparisonAdjunction_counit_f_aux 📋 Mathlib.CategoryTheory.Monad.Comonadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} {adj : F ⊣ G} [∀ (A : adj.toComonad.Coalgebra), CategoryTheory.Limits.HasEqualizer (G.map A.a) (adj.unit.app (G.obj A.A))] (A : adj.toComonad.Coalgebra) : ((CategoryTheory.Comonad.ComonadicityInternal.comparisonAdjunction adj).counit.app A).f = (adj.homEquiv (CategoryTheory.Limits.equalizer (G.map A.a) (adj.unit.app (G.obj A.A))) A.A).symm (CategoryTheory.Limits.equalizer.ι (G.map A.a) (adj.unit.app (G.obj A.A))) - CategoryTheory.Quiv.adj_homEquiv 📋 Mathlib.CategoryTheory.Category.Quiv
{V C : Type u} [Quiver V] [CategoryTheory.Category.{max u v, u} C] : CategoryTheory.Quiv.adj.homEquiv (CategoryTheory.Quiv.of V) (CategoryTheory.Cat.of C) = (CategoryTheory.Cat.Hom.equivFunctor (CategoryTheory.Cat.of (CategoryTheory.Paths V)) (CategoryTheory.Cat.of C)).trans CategoryTheory.Quiv.pathsEquiv - PresheafOfModules.colimitAdjunction_homEquiv 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.ColimitFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.IsCofiltered C] [CategoryTheory.InitiallySmall C] {R : CategoryTheory.Functor Cᵒᵖ RingCat} {cR : CategoryTheory.Limits.Cocone R} (hcR : CategoryTheory.Limits.IsColimit cR) (F : PresheafOfModules R) (G : ModuleCat ↑cR.pt) : (PresheafOfModules.colimitAdjunction hcR).homEquiv F G = ↑(PresheafOfModules.ModuleColimit.homEquiv hcR (CategoryTheory.Limits.colimit.isColimit F.presheaf)) - PresheafOfModules.colimitAdjunction_homEquiv_symm_apply 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.ColimitFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.IsCofiltered C] [CategoryTheory.InitiallySmall C] {R : CategoryTheory.Functor Cᵒᵖ RingCat} {cR : CategoryTheory.Limits.Cocone R} (hcR : CategoryTheory.Limits.IsColimit cR) {F : PresheafOfModules R} {G : ModuleCat ↑cR.pt} (β : F ⟶ (PresheafOfModules.constFunctor cR).obj G) {X : Cᵒᵖ} (m : ↑(F.obj X)) : (CategoryTheory.ConcreteCategory.hom (((PresheafOfModules.colimitAdjunction hcR).homEquiv F G).symm β)) (PresheafOfModules.ModuleColimit.ιM m) = (CategoryTheory.ConcreteCategory.hom (β.app X)) m - PresheafOfModules.freeAdjunction_homEquiv 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.Free
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {R : CategoryTheory.Functor Cᵒᵖ RingCat} (F : CategoryTheory.Functor Cᵒᵖ (Type u)) (G : PresheafOfModules R) : (PresheafOfModules.freeAdjunction R).homEquiv F G = PresheafOfModules.freeHomEquiv - PresheafOfModules.sheafificationAdjunction_homEquiv_apply 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.Sheafification
{C : Type u'} [CategoryTheory.Category.{v', u'} C] {J : CategoryTheory.GrothendieckTopology C} {R₀ : CategoryTheory.Functor Cᵒᵖ RingCat} {R : CategoryTheory.Sheaf J RingCat} (α : R₀ ⟶ R.obj) [CategoryTheory.Presheaf.IsLocallyInjective J α] [CategoryTheory.Presheaf.IsLocallySurjective J α] [J.WEqualsLocallyBijective AddCommGrpCat] [CategoryTheory.HasWeakSheafify J AddCommGrpCat] {P : PresheafOfModules R₀} {F : SheafOfModules R} (f : (PresheafOfModules.sheafification α).obj P ⟶ F) : ((PresheafOfModules.sheafificationAdjunction α).homEquiv P F) f = (PresheafOfModules.sheafificationHomEquiv α) f - PresheafOfModules.toPresheaf_map_sheafificationHomEquiv 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.Sheafification
{C : Type u'} [CategoryTheory.Category.{v', u'} C] {J : CategoryTheory.GrothendieckTopology C} {R₀ : CategoryTheory.Functor Cᵒᵖ RingCat} {R : CategoryTheory.Sheaf J RingCat} (α : R₀ ⟶ R.obj) [CategoryTheory.Presheaf.IsLocallyInjective J α] [CategoryTheory.Presheaf.IsLocallySurjective J α] [J.WEqualsLocallyBijective AddCommGrpCat] [CategoryTheory.HasWeakSheafify J AddCommGrpCat] {P : PresheafOfModules R₀} {F : SheafOfModules R} (f : (PresheafOfModules.sheafification α).obj P ⟶ F) : (PresheafOfModules.toPresheaf R₀).map ((PresheafOfModules.sheafificationHomEquiv α) f) = ((CategoryTheory.sheafificationAdjunction J AddCommGrpCat).homEquiv P.presheaf ((SheafOfModules.toSheaf R).obj F)) ((SheafOfModules.toSheaf R).map f) - PresheafOfModules.toSheaf_map_sheafificationHomEquiv_symm 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.Sheafification
{C : Type u'} [CategoryTheory.Category.{v', u'} C] {J : CategoryTheory.GrothendieckTopology C} {R₀ : CategoryTheory.Functor Cᵒᵖ RingCat} {R : CategoryTheory.Sheaf J RingCat} (α : R₀ ⟶ R.obj) [CategoryTheory.Presheaf.IsLocallyInjective J α] [CategoryTheory.Presheaf.IsLocallySurjective J α] [J.WEqualsLocallyBijective AddCommGrpCat] [CategoryTheory.HasWeakSheafify J AddCommGrpCat] {P : PresheafOfModules R₀} {F : SheafOfModules R} (g : P ⟶ (PresheafOfModules.restrictScalars α).obj ((SheafOfModules.forget R).obj F)) : (SheafOfModules.toSheaf R).map ((PresheafOfModules.sheafificationHomEquiv α).symm g) = ((CategoryTheory.sheafificationAdjunction J AddCommGrpCat).homEquiv P.presheaf ((SheafOfModules.toSheaf R).obj F)).symm ((PresheafOfModules.toPresheaf R₀).map g) - CategoryTheory.Functor.sheafAdjunctionCocontinuous_homEquiv_apply_hom 📋 Mathlib.CategoryTheory.Sites.CoverLifting
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (A : Type w) [CategoryTheory.Category.{w', w} A] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) [G.IsCocontinuous J K] [∀ (F : CategoryTheory.Functor Cᵒᵖ A), G.op.HasPointwiseRightKanExtension F] [G.IsContinuous J K] {F : CategoryTheory.Sheaf K A} {H : CategoryTheory.Sheaf J A} (f : (G.sheafPushforwardContinuous A J K).obj F ⟶ H) : (((G.sheafAdjunctionCocontinuous A J K).homEquiv F H) f).hom = ((G.op.ranAdjunction A).homEquiv F.obj H.obj) f.hom - CategoryTheory.Functor.sheafAdjunctionCocontinuous_homEquiv_apply_val 📋 Mathlib.CategoryTheory.Sites.CoverLifting
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (A : Type w) [CategoryTheory.Category.{w', w} A] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) [G.IsCocontinuous J K] [∀ (F : CategoryTheory.Functor Cᵒᵖ A), G.op.HasPointwiseRightKanExtension F] [G.IsContinuous J K] {F : CategoryTheory.Sheaf K A} {H : CategoryTheory.Sheaf J A} (f : (G.sheafPushforwardContinuous A J K).obj F ⟶ H) : (((G.sheafAdjunctionCocontinuous A J K).homEquiv F H) f).hom = ((G.op.ranAdjunction A).homEquiv F.obj H.obj) f.hom - SheafOfModules.pullbackPushforwardAdjunction_homEquiv_pullbackObjUnitToUnit 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.PullbackFree
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : CategoryTheory.GrothendieckTopology C} {K : CategoryTheory.GrothendieckTopology D} {F : CategoryTheory.Functor C D} {S : CategoryTheory.Sheaf J RingCat} {R : CategoryTheory.Sheaf K RingCat} [F.IsContinuous J K] (φ : S ⟶ (F.sheafPushforwardContinuous RingCat J K).obj R) [(SheafOfModules.pushforward φ).IsRightAdjoint] : ((SheafOfModules.pullbackPushforwardAdjunction φ).homEquiv (SheafOfModules.unit S) (SheafOfModules.unit R)) (SheafOfModules.pullbackObjUnitToUnit φ) = SheafOfModules.unitToPushforwardObjUnit φ - SheafOfModules.pullbackPushforwardAdjunction_homEquiv_symm_unitToPushforwardObjUnit 📋 Mathlib.Algebra.Category.ModuleCat.Sheaf.PullbackFree
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : CategoryTheory.GrothendieckTopology C} {K : CategoryTheory.GrothendieckTopology D} {F : CategoryTheory.Functor C D} {S : CategoryTheory.Sheaf J RingCat} {R : CategoryTheory.Sheaf K RingCat} [F.IsContinuous J K] (φ : S ⟶ (F.sheafPushforwardContinuous RingCat J K).obj R) [(SheafOfModules.pushforward φ).IsRightAdjoint] : ((SheafOfModules.pullbackPushforwardAdjunction φ).homEquiv (SheafOfModules.unit S) (SheafOfModules.unit R)).symm (SheafOfModules.unitToPushforwardObjUnit φ) = SheafOfModules.pullbackObjUnitToUnit φ - CategoryTheory.TwoSquare.ranBaseChange_app 📋 Mathlib.CategoryTheory.GuitartExact.KanExtension
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} {C₄ : Type u₄} {D : Type u₅} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] [CategoryTheory.Category.{v₄, u₄} C₄] [CategoryTheory.Category.{v₅, u₅} D] {T : CategoryTheory.Functor C₁ C₂} {L : CategoryTheory.Functor C₁ C₃} {R : CategoryTheory.Functor C₂ C₄} {B : CategoryTheory.Functor C₃ C₄} (w : CategoryTheory.TwoSquare T L R B) [∀ (F : CategoryTheory.Functor C₁ D), T.HasRightKanExtension F] [∀ (F : CategoryTheory.Functor C₃ D), B.HasRightKanExtension F] (F : CategoryTheory.Functor C₃ D) : w.ranBaseChange.app F = ((T.ranAdjunction D).homEquiv ((B.ran.comp ((CategoryTheory.Functor.whiskeringLeft C₂ C₄ D).obj R)).obj F) (((CategoryTheory.Functor.whiskeringLeft C₁ C₃ D).obj L).obj F)) (CategoryTheory.CostructuredArrow.hom ((CategoryTheory.Functor.RightExtension.mk (B.ran.obj F) (B.ranCounit.app F)).compTwoSquare w)) - CategoryTheory.TwoSquare.lanBaseChange_app 📋 Mathlib.CategoryTheory.GuitartExact.KanExtension
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} {C₄ : Type u₄} {D : Type u₅} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] [CategoryTheory.Category.{v₄, u₄} C₄] [CategoryTheory.Category.{v₅, u₅} D] {T : CategoryTheory.Functor C₁ C₂} {L : CategoryTheory.Functor C₁ C₃} {R : CategoryTheory.Functor C₂ C₄} {B : CategoryTheory.Functor C₃ C₄} (w : CategoryTheory.TwoSquare T L R B) [∀ (F : CategoryTheory.Functor C₁ D), L.HasLeftKanExtension F] [∀ (F : CategoryTheory.Functor C₂ D), R.HasLeftKanExtension F] (F : CategoryTheory.Functor C₂ D) : w.lanBaseChange.app F = ((L.lanAdjunction D).homEquiv (((CategoryTheory.Functor.whiskeringLeft C₁ C₂ D).obj T).obj F) ((R.lan.comp ((CategoryTheory.Functor.whiskeringLeft C₃ C₄ D).obj B)).obj F)).symm (CategoryTheory.StructuredArrow.hom ((CategoryTheory.Functor.LeftExtension.mk (R.lan.obj F) (R.lanUnit.app F)).compTwoSquare w)) - AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction_homEquiv_apply 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.LocallyRingedSpace} {R : CommRingCatᵒᵖ} (f : AlgebraicGeometry.LocallyRingedSpace.Γ.rightOp.obj X ⟶ R) : (AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction.homEquiv X R) f = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.identityToΓSpec.app X) (AlgebraicGeometry.Spec.locallyRingedSpaceMap f.unop) - AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction_homEquiv_apply' 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.LocallyRingedSpace} {R : Type u} [CommRing R] (f : CommRingCat.of R ⟶ AlgebraicGeometry.LocallyRingedSpace.Γ.obj (Opposite.op X)) : (AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction.homEquiv X (Opposite.op (CommRingCat.of R))) (Opposite.op f) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.identityToΓSpec.app X) (AlgebraicGeometry.Spec.locallyRingedSpaceMap f) - AlgebraicGeometry.ΓSpec.adjunction_homEquiv_apply 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.Scheme} {R : CommRingCatᵒᵖ} (f : Opposite.op (AlgebraicGeometry.Scheme.Γ.obj (Opposite.op X)) ⟶ R) : (AlgebraicGeometry.ΓSpec.adjunction.homEquiv X R) f = { toLRSHom' := (AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction.homEquiv X.toLocallyRingedSpace R) f } - AlgebraicGeometry.ΓSpec.adjunction_homEquiv_symm_apply 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.Scheme} {R : CommRingCatᵒᵖ} (f : X ⟶ AlgebraicGeometry.Scheme.Spec.obj R) : (AlgebraicGeometry.ΓSpec.adjunction.homEquiv X R).symm f = (AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction.homEquiv X.toLocallyRingedSpace R).symm (AlgebraicGeometry.Scheme.Hom.toLRSHom f) - AlgebraicGeometry.ΓSpecIso_inv_ΓSpec_adjunction_homEquiv 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.Scheme} {B : CommRingCat} (φ : B ⟶ X.presheaf.obj (Opposite.op ⊤)) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.ΓSpecIso B).inv (AlgebraicGeometry.Scheme.Hom.appTop ((AlgebraicGeometry.ΓSpec.adjunction.homEquiv X (Opposite.op B)) φ.op)) = φ - AlgebraicGeometry.ΓSpec_adjunction_homEquiv_eq 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.Scheme} {B : CommRingCat} (φ : B ⟶ X.presheaf.obj (Opposite.op ⊤)) : AlgebraicGeometry.Scheme.Hom.appTop ((AlgebraicGeometry.ΓSpec.adjunction.homEquiv X (Opposite.op B)) φ.op) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.ΓSpecIso B).hom φ - AlgebraicGeometry.ΓSpec.toOpen_comp_locallyRingedSpaceAdjunction_homEquiv_app 📋 Mathlib.AlgebraicGeometry.GammaSpecAdjunction
{X : AlgebraicGeometry.LocallyRingedSpace} {R : Type u} [CommRing R] (f : AlgebraicGeometry.LocallyRingedSpace.Γ.rightOp.obj X ⟶ Opposite.op (CommRingCat.of R)) (U : (TopologicalSpace.Opens ↑↑(AlgebraicGeometry.Spec.toLocallyRingedSpace.obj (Opposite.op (CommRingCat.of R))).toPresheafedSpace)ᵒᵖ) : CategoryTheory.CategoryStruct.comp (CommRingCat.ofHom (algebraMap R ((AlgebraicGeometry.structureSheafInType ↑(Opposite.unop (Opposite.op (CommRingCat.of R))) ↑(Opposite.unop (Opposite.op (CommRingCat.of R)))).obj.obj U))) (((AlgebraicGeometry.ΓSpec.locallyRingedSpaceAdjunction.homEquiv X (Opposite.op (CommRingCat.of R))) f).c.app U) = CategoryTheory.CategoryStruct.comp f.unop (X.presheaf.map (CategoryTheory.homOfLE ⋯).op) - CategoryTheory.Adjunction.homAddEquiv_zero 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) : (adj.homEquiv X Y) 0 = 0 - CategoryTheory.Adjunction.homAddEquiv_symm_zero 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) : (adj.homEquiv X Y).symm 0 = 0 - CategoryTheory.Adjunction.homAddEquiv_neg 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f : F.obj X ⟶ Y) : (adj.homEquiv X Y) (-f) = -(adj.homEquiv X Y) f - CategoryTheory.Adjunction.homAddEquiv_symm_neg 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f : X ⟶ G.obj Y) : (adj.homEquiv X Y).symm (-f) = -(adj.homEquiv X Y).symm f - CategoryTheory.Adjunction.homAddEquiv_sub 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f f' : F.obj X ⟶ Y) : (adj.homEquiv X Y) (f - f') = (adj.homEquiv X Y) f - (adj.homEquiv X Y) f' - CategoryTheory.Adjunction.homAddEquiv_apply 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f : F.obj X ⟶ Y) : (adj.homAddEquiv X Y) f = (adj.homEquiv X Y) f - CategoryTheory.Adjunction.homAddEquiv_add 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f f' : F.obj X ⟶ Y) : (adj.homEquiv X Y) (f + f') = (adj.homEquiv X Y) f + (adj.homEquiv X Y) f' - CategoryTheory.Adjunction.homAddEquiv_symm_sub 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f f' : X ⟶ G.obj Y) : (adj.homEquiv X Y).symm (f - f') = (adj.homEquiv X Y).symm f - (adj.homEquiv X Y).symm f' - CategoryTheory.Adjunction.homAddEquiv_symm_add 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f f' : X ⟶ G.obj Y) : (adj.homEquiv X Y).symm (f + f') = (adj.homEquiv X Y).symm f + (adj.homEquiv X Y).symm f' - CategoryTheory.Adjunction.homAddEquiv_symm_apply 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : C) (Y : D) (f : X ⟶ G.obj Y) : (adj.homAddEquiv X Y).symm f = (adj.homEquiv X Y).symm f - CategoryTheory.Adjunction.compPreadditiveYonedaIso_inv_app_app_apply 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : Cᵒᵖ) (Y : D) (a : ULift.{max v₁ v₂, v₂} (F.obj (Opposite.unop X) ⟶ Y)) : (CategoryTheory.ConcreteCategory.hom ((adj.compPreadditiveYonedaIso.inv.app Y).app X)) a = { down := (adj.homEquiv (Opposite.unop X) Y) (AddEquiv.ulift a) } - CategoryTheory.Adjunction.compPreadditiveYonedaIso_hom_app_app_apply 📋 Mathlib.CategoryTheory.Adjunction.Additive
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) [F.Additive] (X : Cᵒᵖ) (Y : D) (a : ULift.{max v₁ v₂, v₁} (Opposite.unop X ⟶ G.obj Y)) : (CategoryTheory.ConcreteCategory.hom ((adj.compPreadditiveYonedaIso.hom.app Y).app X)) a = { down := (adj.homEquiv (Opposite.unop X) Y).symm (AddEquiv.ulift a) } - CategoryTheory.GrothendieckTopology.Point.skyscraperPresheafAdjunction_homEquiv_apply 📋 Mathlib.CategoryTheory.Sites.Point.Skyscraper
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasProducts A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] {P : CategoryTheory.Functor Cᵒᵖ A} {M : A} (f : Φ.presheafFiber.obj P ⟶ M) : (Φ.skyscraperPresheafAdjunction.homEquiv P M) f = Φ.skyscraperPresheafHomEquiv f - CategoryTheory.GrothendieckTopology.Point.skyscraperPresheafAdjunction_homEquiv_symm_apply 📋 Mathlib.CategoryTheory.Sites.Point.Skyscraper
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasProducts A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] {P : CategoryTheory.Functor Cᵒᵖ A} {M : A} (f : P ⟶ Φ.skyscraperPresheaf M) : (Φ.skyscraperPresheafAdjunction.homEquiv P M).symm f = Φ.skyscraperPresheafHomEquiv.symm f - CategoryTheory.GrothendieckTopology.Point.skyscraperSheafAdjunction_homEquiv_apply_hom 📋 Mathlib.CategoryTheory.Sites.Point.Skyscraper
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasProducts A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] {F : CategoryTheory.Sheaf J A} {M : A} (f : Φ.presheafFiber.obj F.obj ⟶ M) : ((Φ.skyscraperSheafAdjunction.homEquiv F M) f).hom = Φ.skyscraperPresheafHomEquiv f - CategoryTheory.GrothendieckTopology.Point.skyscraperSheafAdjunction_homEquiv_apply_val 📋 Mathlib.CategoryTheory.Sites.Point.Skyscraper
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasProducts A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] {F : CategoryTheory.Sheaf J A} {M : A} (f : Φ.presheafFiber.obj F.obj ⟶ M) : ((Φ.skyscraperSheafAdjunction.homEquiv F M) f).hom = Φ.skyscraperPresheafHomEquiv f - CategoryTheory.GrothendieckTopology.Point.skyscraperSheafAdjunction_homEquiv_symm_apply 📋 Mathlib.CategoryTheory.Sites.Point.Skyscraper
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasProducts A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] {F : CategoryTheory.Sheaf J A} {M : A} (f : F ⟶ Φ.skyscraperSheaf M) : (Φ.skyscraperSheafAdjunction.homEquiv F M).symm f = Φ.skyscraperPresheafHomEquiv.symm f.hom - CategoryTheory.ReflQuiv.adj_homEquiv 📋 Mathlib.CategoryTheory.Category.ReflQuiv
(V : Type u) [CategoryTheory.ReflQuiver V] (C : Type u) [CategoryTheory.Category.{max u v, u} C] : CategoryTheory.ReflQuiv.adj.homEquiv (CategoryTheory.ReflQuiv.of V) (CategoryTheory.Cat.of C) = (CategoryTheory.Cat.Hom.equivFunctor (CategoryTheory.Cat.freeRefl.obj (CategoryTheory.ReflQuiv.of V)) (CategoryTheory.Cat.of C)).trans CategoryTheory.ReflQuiv.adj.homEquiv - sSetTopAdj_homEquiv_stdSimplex_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.TopAdj
{X : TopCat} (f : SSet.toTop.obj (SSet.stdSimplex.obj { len := 0 }) ⟶ X) : (sSetTopAdj.homEquiv (SSet.stdSimplex.obj { len := 0 }) X) f = SSet.const (TopCat.toSSetObj₀Equiv.symm ((CategoryTheory.ConcreteCategory.hom f) default)) - CategoryTheory.LiftLeftAdjoint.constructLeftAdjointEquiv_apply 📋 Mathlib.CategoryTheory.Adjunction.Lifting.Left
{A : Type u₁} {B : Type u₂} {C : Type u₃} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Category.{v₂, u₂} B] [CategoryTheory.Category.{v₃, u₃} C] {U : CategoryTheory.Functor B C} {F : CategoryTheory.Functor C B} (R : CategoryTheory.Functor A B) (F' : CategoryTheory.Functor C A) (adj₁ : F ⊣ U) (adj₂ : F' ⊣ R.comp U) [CategoryTheory.Limits.HasReflexiveCoequalizers A] (h : (X : B) → CategoryTheory.RegularEpi (adj₁.counit.app X)) (Y : A) (X : B) (a✝ : CategoryTheory.LiftLeftAdjoint.constructLeftAdjointObj R F' adj₁ adj₂ X ⟶ Y) : (CategoryTheory.LiftLeftAdjoint.constructLeftAdjointEquiv R F' adj₁ adj₂ h Y X) a✝ = (CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.LiftLeftAdjoint.counitCoequalises adj₁ h X) (R.obj Y)).symm ⟨(adj₁.homEquiv (U.obj X) (R.obj Y)).symm ((adj₂.homEquiv (U.obj X) Y) ↑((CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Limits.parallelPair (F'.map (U.map (adj₁.counit.app X))) (CategoryTheory.LiftLeftAdjoint.otherMap R F' adj₁ adj₂ X))) Y) a✝)), ⋯⟩ - CategoryTheory.LiftLeftAdjoint.constructLeftAdjointEquiv_symm_apply 📋 Mathlib.CategoryTheory.Adjunction.Lifting.Left
{A : Type u₁} {B : Type u₂} {C : Type u₃} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Category.{v₂, u₂} B] [CategoryTheory.Category.{v₃, u₃} C] {U : CategoryTheory.Functor B C} {F : CategoryTheory.Functor C B} (R : CategoryTheory.Functor A B) (F' : CategoryTheory.Functor C A) (adj₁ : F ⊣ U) (adj₂ : F' ⊣ R.comp U) [CategoryTheory.Limits.HasReflexiveCoequalizers A] (h : (X : B) → CategoryTheory.RegularEpi (adj₁.counit.app X)) (Y : A) (X : B) (a✝ : X ⟶ R.obj Y) : (CategoryTheory.LiftLeftAdjoint.constructLeftAdjointEquiv R F' adj₁ adj₂ h Y X).symm a✝ = (CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Limits.parallelPair (F'.map (U.map (adj₁.counit.app X))) (CategoryTheory.LiftLeftAdjoint.otherMap R F' adj₁ adj₂ X))) Y).symm ⟨(adj₂.homEquiv (U.obj X) Y).symm ((adj₁.homEquiv (U.obj X) (R.obj Y)) ↑((CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.LiftLeftAdjoint.counitCoequalises adj₁ h X) (R.obj Y)) a✝)), ⋯⟩ - CategoryTheory.LiftRightAdjoint.constructRightAdjointEquiv_apply 📋 Mathlib.CategoryTheory.Adjunction.Lifting.Right
{A : Type u₁} {B : Type u₂} {C : Type u₃} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Category.{v₂, u₂} B] [CategoryTheory.Category.{v₃, u₃} C] {U : CategoryTheory.Functor A B} {F : CategoryTheory.Functor B A} (L : CategoryTheory.Functor C B) (U' : CategoryTheory.Functor A C) (adj₁ : F ⊣ U) (adj₂ : L.comp F ⊣ U') [CategoryTheory.Limits.HasCoreflexiveEqualizers C] (h : (X : B) → CategoryTheory.RegularMono (adj₁.unit.app X)) (Y : C) (X : B) (a✝ : Y ⟶ CategoryTheory.LiftRightAdjoint.constructRightAdjointObj L U' adj₁ adj₂ X) : (CategoryTheory.LiftRightAdjoint.constructRightAdjointEquiv L U' adj₁ adj₂ h Y X) a✝ = (CategoryTheory.Limits.Fork.IsLimit.homIso (CategoryTheory.LiftRightAdjoint.unitEqualises adj₁ h X) (L.obj Y)).symm ⟨(adj₁.homEquiv (L.obj Y) (F.obj X)) ((adj₂.homEquiv Y (F.obj X)).symm ↑((CategoryTheory.Limits.Fork.IsLimit.homIso (CategoryTheory.Limits.limit.isLimit (CategoryTheory.Limits.parallelPair (U'.map (F.map (adj₁.unit.app X))) (CategoryTheory.LiftRightAdjoint.otherMap L U' adj₁ adj₂ X))) Y) a✝)), ⋯⟩ - CategoryTheory.LiftRightAdjoint.constructRightAdjointEquiv_symm_apply 📋 Mathlib.CategoryTheory.Adjunction.Lifting.Right
{A : Type u₁} {B : Type u₂} {C : Type u₃} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Category.{v₂, u₂} B] [CategoryTheory.Category.{v₃, u₃} C] {U : CategoryTheory.Functor A B} {F : CategoryTheory.Functor B A} (L : CategoryTheory.Functor C B) (U' : CategoryTheory.Functor A C) (adj₁ : F ⊣ U) (adj₂ : L.comp F ⊣ U') [CategoryTheory.Limits.HasCoreflexiveEqualizers C] (h : (X : B) → CategoryTheory.RegularMono (adj₁.unit.app X)) (Y : C) (X : B) (a✝ : L.obj Y ⟶ X) : (CategoryTheory.LiftRightAdjoint.constructRightAdjointEquiv L U' adj₁ adj₂ h Y X).symm a✝ = (CategoryTheory.Limits.Fork.IsLimit.homIso (CategoryTheory.Limits.limit.isLimit (CategoryTheory.Limits.parallelPair (U'.map (F.map (adj₁.unit.app X))) (CategoryTheory.LiftRightAdjoint.otherMap L U' adj₁ adj₂ X))) Y).symm ⟨(adj₂.homEquiv Y (F.obj X)) ((adj₁.homEquiv (L.obj Y) (F.obj X)).symm ↑((CategoryTheory.Limits.Fork.IsLimit.homIso (CategoryTheory.LiftRightAdjoint.unitEqualises adj₁ h X) (L.obj Y)) a✝)), ⋯⟩ - CategoryTheory.Endofunctor.Adjunction.Algebra.toCoalgebraOf_map_f 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) {X✝ Y✝ : CategoryTheory.Endofunctor.Algebra F} (f : X✝ ⟶ Y✝) : ((CategoryTheory.Endofunctor.Adjunction.Algebra.toCoalgebraOf adj).map f).f = f.f - CategoryTheory.Endofunctor.Adjunction.Coalgebra.toAlgebraOf_map_f 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) {X✝ Y✝ : CategoryTheory.Endofunctor.Coalgebra G} (f : X✝ ⟶ Y✝) : ((CategoryTheory.Endofunctor.Adjunction.Coalgebra.toAlgebraOf adj).map f).f = f.f - CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv_functor_map_f 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) {X✝ Y✝ : CategoryTheory.Endofunctor.Algebra F} (f : X✝ ⟶ Y✝) : ((CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv adj).functor.map f).f = f.f - CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv_inverse_map_f 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) {X✝ Y✝ : CategoryTheory.Endofunctor.Coalgebra G} (f : X✝ ⟶ Y✝) : ((CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv adj).inverse.map f).f = f.f - CategoryTheory.Endofunctor.Adjunction.Algebra.toCoalgebraOf_obj_str 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) (A : CategoryTheory.Endofunctor.Algebra F) : ((CategoryTheory.Endofunctor.Adjunction.Algebra.toCoalgebraOf adj).obj A).str = (adj.homEquiv A.a A.a) A.str - CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv_functor_obj_str 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) (A : CategoryTheory.Endofunctor.Algebra F) : ((CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv adj).functor.obj A).str = (adj.homEquiv A.a A.a) A.str - CategoryTheory.Endofunctor.Adjunction.Coalgebra.toAlgebraOf_obj_str 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) (V : CategoryTheory.Endofunctor.Coalgebra G) : ((CategoryTheory.Endofunctor.Adjunction.Coalgebra.toAlgebraOf adj).obj V).str = (adj.homEquiv V.V V.V).symm V.str - CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv_inverse_obj_str 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) (V : CategoryTheory.Endofunctor.Coalgebra G) : ((CategoryTheory.Endofunctor.Adjunction.algebraCoalgebraEquiv adj).inverse.obj V).str = (adj.homEquiv V.V V.V).symm V.str - CategoryTheory.Endofunctor.Adjunction.Algebra.homEquiv_naturality_str 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) (A₁ A₂ : CategoryTheory.Endofunctor.Algebra F) (f : A₁ ⟶ A₂) : CategoryTheory.CategoryStruct.comp ((adj.homEquiv A₁.a A₁.a) A₁.str) (G.map f.f) = CategoryTheory.CategoryStruct.comp f.f ((adj.homEquiv A₂.a A₂.a) A₂.str) - CategoryTheory.Endofunctor.Adjunction.Coalgebra.homEquiv_naturality_str_symm 📋 Mathlib.CategoryTheory.Endofunctor.Algebra
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C C} (adj : F ⊣ G) (V₁ V₂ : CategoryTheory.Endofunctor.Coalgebra G) (f : V₁ ⟶ V₂) : CategoryTheory.CategoryStruct.comp (F.map f.f) ((adj.homEquiv V₂.V V₂.V).symm V₂.str) = CategoryTheory.CategoryStruct.comp ((adj.homEquiv V₁.V V₁.V).symm V₁.str) f.f - CategoryTheory.Grpd.freeForgetAdjunction_homEquiv_apply 📋 Mathlib.CategoryTheory.Groupoid.FreeGroupoidOfCategory
{C : Type u} [CategoryTheory.Category.{u, u} C] {D : Type u} [CategoryTheory.Groupoid D] (F : CategoryTheory.Functor (CategoryTheory.FreeGroupoid C) D) : ((CategoryTheory.Grpd.freeForgetAdjunction.homEquiv (CategoryTheory.Cat.of C) (CategoryTheory.Grpd.of D)) F).toFunctor = (CategoryTheory.FreeGroupoid.of C).comp F - CategoryTheory.Grpd.freeForgetAdjunction_homEquiv_symm_apply 📋 Mathlib.CategoryTheory.Groupoid.FreeGroupoidOfCategory
{C : Type u} [CategoryTheory.Category.{u, u} C] {D : Type u} [CategoryTheory.Groupoid D] (F : CategoryTheory.Functor C D) : (CategoryTheory.Grpd.freeForgetAdjunction.homEquiv (CategoryTheory.Cat.of C) (CategoryTheory.Grpd.of D)).symm F.toCatHom = (CategoryTheory.FreeGroupoid.map F).comp (CategoryTheory.FreeGroupoid.lift (CategoryTheory.Functor.id D)) - CategoryTheory.ExponentiableMorphism.homEquiv_apply_eq 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.ExponentiableMorphism
{C : Type u} [CategoryTheory.Category.{v, u} C] {I J : C} {f : I ⟶ J} [CategoryTheory.ChosenPullbacksAlong f] [CategoryTheory.ExponentiableMorphism f] {X : CategoryTheory.Over I} {A : CategoryTheory.Over J} (u : (CategoryTheory.ChosenPullbacksAlong.pullback f).obj A ⟶ X) : ((CategoryTheory.ExponentiableMorphism.pullbackPushforwardAdj f).homEquiv A X) u = CategoryTheory.ExponentiableMorphism.pushforwardCurry u - CategoryTheory.ExponentiableMorphism.homEquiv_symm_apply_eq 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.ExponentiableMorphism
{C : Type u} [CategoryTheory.Category.{v, u} C] {I J : C} {f : I ⟶ J} [CategoryTheory.ChosenPullbacksAlong f] [CategoryTheory.ExponentiableMorphism f] {X : CategoryTheory.Over I} {A : CategoryTheory.Over J} (v : A ⟶ (CategoryTheory.ExponentiableMorphism.pushforward f).obj X) : ((CategoryTheory.ExponentiableMorphism.pullbackPushforwardAdj f).homEquiv A X).symm v = CategoryTheory.ExponentiableMorphism.pushforwardUncurry v - CategoryTheory.forgetAdjToOver.homEquiv_symm 📋 Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X : C} (Z : CategoryTheory.Over X) (A : C) (f : Z ⟶ (CategoryTheory.toOver X).obj A) : ((CategoryTheory.forgetAdjToOver X).homEquiv Z A).symm f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left f) (CategoryTheory.SemiCartesianMonoidalCategory.fst A X) - CategoryTheory.Monad.MonadicityInternal.comparisonAdjunction_unit_f_aux 📋 Mathlib.CategoryTheory.Monad.Monadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {G : CategoryTheory.Functor D C} {F : CategoryTheory.Functor C D} {adj : F ⊣ G} [∀ (A : adj.toMonad.Algebra), CategoryTheory.Limits.HasCoequalizer (F.map A.a) (adj.counit.app (F.obj A.A))] (A : adj.toMonad.Algebra) : ((CategoryTheory.Monad.MonadicityInternal.comparisonAdjunction adj).unit.app A).f = (adj.homEquiv A.A (CategoryTheory.Limits.coequalizer (F.map A.a) (adj.counit.app (F.obj A.A)))) (CategoryTheory.Limits.coequalizer.π (F.map A.a) (adj.counit.app (F.obj A.A))) - CategoryTheory.Monad.MonadicityInternal.comparisonLeftAdjointHomEquiv_apply_f 📋 Mathlib.CategoryTheory.Monad.Monadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {G : CategoryTheory.Functor D C} {F : CategoryTheory.Functor C D} (adj : F ⊣ G) (A : adj.toMonad.Algebra) (B : D) [CategoryTheory.Limits.HasCoequalizer (F.map A.a) (adj.counit.app (F.obj A.A))] (a✝ : CategoryTheory.Monad.MonadicityInternal.comparisonLeftAdjointObj adj A ⟶ B) : ((CategoryTheory.Monad.MonadicityInternal.comparisonLeftAdjointHomEquiv adj A B) a✝).f = ↑(((CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Limits.parallelPair (F.map A.a) (adj.counit.app (F.obj A.A)))) B).trans ((adj.homEquiv A.A B).subtypeEquiv ⋯)) a✝) - CategoryTheory.Monad.MonadicityInternal.comparisonLeftAdjointHomEquiv_symm_apply 📋 Mathlib.CategoryTheory.Monad.Monadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {G : CategoryTheory.Functor D C} {F : CategoryTheory.Functor C D} (adj : F ⊣ G) (A : adj.toMonad.Algebra) (B : D) [CategoryTheory.Limits.HasCoequalizer (F.map A.a) (adj.counit.app (F.obj A.A))] (a✝ : A ⟶ (CategoryTheory.Monad.comparison adj).obj B) : (CategoryTheory.Monad.MonadicityInternal.comparisonLeftAdjointHomEquiv adj A B).symm a✝ = (((adj.homEquiv A.A B).symm.subtypeEquiv ⋯).trans (CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Limits.parallelPair (F.map A.a) (adj.counit.app (F.obj A.A)))) B).symm) ({ toFun := fun f => ⟨f.f, ⋯⟩, invFun := fun g => { f := ↑g, h := ⋯ }, left_inv := ⋯, right_inv := ⋯ } a✝) - CategoryTheory.Monad.MonadicityInternal.comparisonAdjunction_counit 📋 Mathlib.CategoryTheory.Monad.Monadicity
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₁, u₂} D] {G : CategoryTheory.Functor D C} {F : CategoryTheory.Functor C D} (adj : F ⊣ G) [∀ (A : adj.toMonad.Algebra), CategoryTheory.Limits.HasCoequalizer (F.map A.a) (adj.counit.app (F.obj A.A))] : (CategoryTheory.Monad.MonadicityInternal.comparisonAdjunction adj).counit = { app := fun Y => (((adj.homEquiv (G.obj Y) Y).symm.subtypeEquiv ⋯).trans (CategoryTheory.Limits.Cofork.IsColimit.homIso (CategoryTheory.Limits.colimit.isColimit (CategoryTheory.Limits.parallelPair (F.map (G.map (adj.counit.app Y))) (adj.counit.app (F.obj (G.obj Y))))) Y).symm) ({ toFun := fun f => ⟨f.f, ⋯⟩, invFun := fun g => { f := ↑g, h := ⋯ }, left_inv := ⋯, right_inv := ⋯ } (CategoryTheory.CategoryStruct.id ((CategoryTheory.Monad.comparison adj).obj Y))), naturality := ⋯ } - LightCondensed.ihomPoints_symm_apply 📋 Mathlib.Condensed.Light.InternallyProjective
(R : Type u) [CommRing R] (A B : LightCondMod R) (S : LightProfinite) (x : CategoryTheory.MonoidalCategoryStruct.tensorObj A ((LightCondensed.free R).obj S.toCondensed) ⟶ B) : (LightCondensed.ihomPoints R A B S).symm x = (CategoryTheory.coherentTopology LightProfinite).yonedaEquiv (((LightCondensed.freeForgetAdjunction R).homEquiv ((CategoryTheory.coherentTopology LightProfinite).yoneda.obj S) (A ⟹ B)) (CategoryTheory.MonoidalClosed.curry x)) - LightCondensed.ihomPoints_apply 📋 Mathlib.Condensed.Light.InternallyProjective
(R : Type u) [CommRing R] (A B : LightCondMod R) (S : LightProfinite) (x : ↑((A ⟹ B).obj.obj (Opposite.op S))) : (LightCondensed.ihomPoints R A B S) x = CategoryTheory.MonoidalClosed.uncurry (((LightCondensed.freeForgetAdjunction R).homEquiv ((CategoryTheory.coherentTopology LightProfinite).yoneda.obj S) (A ⟹ B)).symm ((CategoryTheory.coherentTopology LightProfinite).yonedaEquiv.symm x)) - Rep.homEquiv_def 📋 Mathlib.RepresentationTheory.Rep.Basic
{k : Type u} [CommRing k] {G : Type v} [Group G] (A B C : Rep.{u, u, v} k G) : (CategoryTheory.ihom.adjunction A).homEquiv B C = A.tensorHomEquiv B C - Rep.invariantsAdjunction_homEquiv_apply_hom 📋 Mathlib.RepresentationTheory.Invariants
(k : Type u) (G : Type v) [CommRing k] [Group G] {X : ModuleCat k} {Y : Rep.{u_1, u, v} k G} (f : (Rep.trivialFunctor k G).obj X ⟶ Y) : ModuleCat.Hom.hom (((Rep.invariantsAdjunction k G).homEquiv X Y) f) = LinearMap.codRestrict Y.ρ.invariants (Rep.Hom.hom f).toLinearMap ⋯ - Rep.invariantsAdjunction_homEquiv_symm_apply_hom 📋 Mathlib.RepresentationTheory.Invariants
(k : Type u) (G : Type v) [CommRing k] [Group G] {X : ModuleCat k} {Y : Rep.{u_1, u, v} k G} (f : X ⟶ (Rep.invariantsFunctor k G).obj Y) : (Rep.Hom.hom (((Rep.invariantsAdjunction k G).homEquiv X Y).symm f)).toLinearMap = Y.ρ.invariants.subtype ∘ₗ ModuleCat.Hom.hom f - Rep.coinvariantsAdjunction_homEquiv_symm_apply_hom 📋 Mathlib.RepresentationTheory.Coinvariants
(k : Type u) (G : Type v) [CommRing k] [Monoid G] {X : Rep.{w, u, v} k G} {Y : ModuleCat k} (f : X ⟶ (Rep.trivialFunctor k G).obj Y) : ((Rep.coinvariantsAdjunction k G).homEquiv X Y).symm f = Rep.desc f - Rep.coinvariantsAdjunction_homEquiv_apply_hom 📋 Mathlib.RepresentationTheory.Coinvariants
(k : Type u) (G : Type v) [CommRing k] [Monoid G] {X : Rep.{w, u, v} k G} {Y : ModuleCat k} (f : (Rep.coinvariantsFunctor k G).obj X ⟶ Y) : (Rep.Hom.hom (((Rep.coinvariantsAdjunction k G).homEquiv X Y) f)).toLinearMap = ModuleCat.Hom.hom (CategoryTheory.CategoryStruct.comp ((Rep.coinvariantsMk k G).app X) f) - Rep.coindResAdjunction_homEquiv_apply 📋 Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel ⇑(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k ↥S) {B : Rep.{max (max u v) w, u, v} k G} (f : Rep.coind.{u, v, v, max (max u v) w} S.subtype A ⟶ B) : ((Rep.coindResAdjunction k S).homEquiv A B) f = (Rep.indResHomEquiv S.subtype A B) (CategoryTheory.CategoryStruct.comp A.indCoindIso.hom f) - Rep.resIndAdjunction_homEquiv_apply 📋 Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel ⇑(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k ↥S) {B : Rep.{max w u v, u, v} k G} (f : Rep.res S.subtype B ⟶ A) : ((Rep.resIndAdjunction k S).homEquiv B A) f = CategoryTheory.CategoryStruct.comp ((Rep.resCoindHomEquiv.{max w u v, u, v, v} S.subtype B A) f) A.indCoindIso.inv - Rep.coindResAdjunction_homEquiv_symm_apply 📋 Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel ⇑(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k ↥S) {B : Rep.{max (max u v) w, u, v} k G} (f : A ⟶ Rep.res S.subtype B) : ((Rep.coindResAdjunction k S).homEquiv A B).symm f = CategoryTheory.CategoryStruct.comp A.indCoindIso.inv ((Rep.indResHomEquiv S.subtype A B).symm f) - Rep.resIndAdjunction_homEquiv_symm_apply 📋 Mathlib.RepresentationTheory.FiniteIndex
{k : Type u} {G : Type v} [CommRing k] [Group G] {S : Subgroup G} [DecidableRel ⇑(QuotientGroup.rightRel S)] [S.FiniteIndex] (A : Rep.{max w u v, u, v} k ↥S) {B : Rep.{max w u v, u, v} k G} (f : B ⟶ (Rep.indFunctor k S.subtype).obj A) : ((Rep.resIndAdjunction k S).homEquiv B A).symm f = (Rep.resCoindHomEquiv.{max w u v, u, v, v} S.subtype B A).symm (CategoryTheory.CategoryStruct.comp f A.indCoindIso.hom)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59