Loogle!
Result
Found 23 declarations mentioning CategoryTheory.Pseudofunctor.DescentData.hom.
- CategoryTheory.Pseudofunctor.DescentData.pullFunctorIso_hom_app_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat) {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {S' : C} {p : S' ⟶ S} {ι' : Type t'} {X' : ι' → C} {f' : (j : ι') → X' j ⟶ S'} {α : ι' → ι} {p' : (j : ι') → X' j ⟶ X (α j)} (w : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p' j) (f (α j)) = CategoryTheory.CategoryStruct.comp (f' j) p) {β : ι' → ι} {p'' : (j : ι') → X' j ⟶ X (β j)} (w' : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p'' j) (f (β j)) = CategoryTheory.CategoryStruct.comp (f' j) p) (X✝ : F.DescentData f) (i : ι') : ((CategoryTheory.Pseudofunctor.DescentData.pullFunctorIso F w w').hom.app X✝).hom i = X✝.hom (CategoryTheory.CategoryStruct.comp (p' i) (f (α i))) (p' i) (p'' i) ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData.pullFunctorIso_inv_app_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat) {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {S' : C} {p : S' ⟶ S} {ι' : Type t'} {X' : ι' → C} {f' : (j : ι') → X' j ⟶ S'} {α : ι' → ι} {p' : (j : ι') → X' j ⟶ X (α j)} (w : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p' j) (f (α j)) = CategoryTheory.CategoryStruct.comp (f' j) p) {β : ι' → ι} {p'' : (j : ι') → X' j ⟶ X (β j)} (w' : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p'' j) (f (β j)) = CategoryTheory.CategoryStruct.comp (f' j) p) (X✝ : F.DescentData f) (i : ι') : ((CategoryTheory.Pseudofunctor.DescentData.pullFunctorIso F w w').inv.app X✝).hom i = X✝.hom (CategoryTheory.CategoryStruct.comp (p' i) (f (α i))) (p'' i) (p' i) ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData.instIsIsoαCategoryObjLocallyDiscreteOppositeCatMkOpHom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (D : F.DescentData f) {Y : C} (q : Y ⟶ S) {i₁ i₂ : ι} (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) : CategoryTheory.IsIso (D.hom q f₁ f₂ hf₁ hf₂) - CategoryTheory.Pseudofunctor.DescentData.hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (self : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (_hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q := by cat_disch) (_hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q := by cat_disch) : (F.map f₁.op.toLoc).toFunctor.obj (self.obj i₁) ⟶ (F.map f₂.op.toLoc).toFunctor.obj (self.obj i₂) - CategoryTheory.Pseudofunctor.DescentData.pullHom_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (self : F.DescentData f) ⦃Y' Y : C⦄ (g : Y' ⟶ Y) (q : Y ⟶ S) (q' : Y' ⟶ S) (hq : CategoryTheory.CategoryStruct.comp g q = q') ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) (gf₁ : Y' ⟶ X i₁) (gf₂ : Y' ⟶ X i₂) (hgf₁ : CategoryTheory.CategoryStruct.comp g f₁ = gf₁) (hgf₂ : CategoryTheory.CategoryStruct.comp g f₂ = gf₂) : CategoryTheory.Pseudofunctor.LocallyDiscreteOpToCat.pullHom (self.hom q f₁ f₂ ⋯ ⋯) g gf₁ gf₂ ⋯ ⋯ = self.hom q' gf₁ gf₂ ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData.hom_self 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (self : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i : ι⦄ (g : Y ⟶ X i) (x✝ : CategoryTheory.CategoryStruct.comp g (f i) = q) : self.hom q g g ⋯ ⋯ = CategoryTheory.CategoryStruct.id ((F.map g.op.toLoc).toFunctor.obj (self.obj i)) - CategoryTheory.Pseudofunctor.DescentData.pullFunctorObj_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {S' : C} {p : S' ⟶ S} {ι' : Type t'} {X' : ι' → C} {f' : (j : ι') → X' j ⟶ S'} {α : ι' → ι} {p' : (j : ι') → X' j ⟶ X (α j)} (w : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p' j) (f (α j)) = CategoryTheory.CategoryStruct.comp (f' j) p) (D : F.DescentData f) (Y : C) (q : Y ⟶ S') (j₁ j₂ : ι') (f₁ : Y ⟶ X' j₁) (f₂ : Y ⟶ X' j₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f' j₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f' j₂) = q) : (CategoryTheory.Pseudofunctor.DescentData.pullFunctorObj w D).hom q f₁ f₂ hf₁ hf₂ = CategoryTheory.Pseudofunctor.DescentData.pullFunctorObjHom w D (CategoryTheory.CategoryStruct.comp f₁ (f' j₁)) f₁ f₂ ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData.iso_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (D : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (_hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q := by cat_disch) (_hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q := by cat_disch) : (D.iso q f₁ f₂ _hf₁ _hf₂).hom = D.hom q f₁ f₂ ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData.iso_inv 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (D : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (_hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q := by cat_disch) (_hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q := by cat_disch) : (D.iso q f₁ f₂ _hf₁ _hf₂).inv = D.hom q f₂ f₁ ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData.hom_comp 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (self : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ i₃ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (f₃ : Y ⟶ X i₃) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) (hf₃ : CategoryTheory.CategoryStruct.comp f₃ (f i₃) = q) : CategoryTheory.CategoryStruct.comp (self.hom q f₁ f₂ hf₁ hf₂) (self.hom q f₂ f₃ hf₂ hf₃) = self.hom q f₁ f₃ hf₁ hf₃ - CategoryTheory.Pseudofunctor.DescentData.hom_comp_assoc 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (self : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ i₃ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (f₃ : Y ⟶ X i₃) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) (hf₃ : CategoryTheory.CategoryStruct.comp f₃ (f i₃) = q) {Z : ↑(F.obj { as := Opposite.op Y })} (h : (F.map f₃.op.toLoc).toFunctor.obj (self.obj i₃) ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.hom q f₁ f₂ hf₁ hf₂) (CategoryTheory.CategoryStruct.comp (self.hom q f₂ f₃ hf₂ hf₃) h) = CategoryTheory.CategoryStruct.comp (self.hom q f₁ f₃ hf₁ hf₃) h - CategoryTheory.Pseudofunctor.DescentData.Hom.comm 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {D₁ D₂ : F.DescentData f} (self : D₁.Hom D₂) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) : CategoryTheory.CategoryStruct.comp ((F.map f₁.op.toLoc).toFunctor.map (self.hom i₁)) (D₂.hom q f₁ f₂ ⋯ ⋯) = CategoryTheory.CategoryStruct.comp (D₁.hom q f₁ f₂ ⋯ ⋯) ((F.map f₂.op.toLoc).toFunctor.map (self.hom i₂)) - CategoryTheory.Pseudofunctor.DescentData.Hom.mk 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {D₁ D₂ : F.DescentData f} (hom : (i : ι) → D₁.obj i ⟶ D₂.obj i) (comm : ∀ ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q), CategoryTheory.CategoryStruct.comp ((F.map f₁.op.toLoc).toFunctor.map (hom i₁)) (D₂.hom q f₁ f₂ ⋯ ⋯) = CategoryTheory.CategoryStruct.comp (D₁.hom q f₁ f₂ ⋯ ⋯) ((F.map f₂.op.toLoc).toFunctor.map (hom i₂)) := by cat_disch) : D₁.Hom D₂ - CategoryTheory.Pseudofunctor.DescentData.isoMk 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {D₁ D₂ : F.DescentData f} (e : (i : ι) → D₁.obj i ≅ D₂.obj i) (comm : ∀ ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q), CategoryTheory.CategoryStruct.comp ((F.map f₁.op.toLoc).toFunctor.map (e i₁).hom) (D₂.hom q f₁ f₂ ⋯ ⋯) = CategoryTheory.CategoryStruct.comp (D₁.hom q f₁ f₂ ⋯ ⋯) ((F.map f₂.op.toLoc).toFunctor.map (e i₂).hom) := by cat_disch) : D₁ ≅ D₂ - CategoryTheory.Pseudofunctor.DescentData.isoMk_hom_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {D₁ D₂ : F.DescentData f} (e : (i : ι) → D₁.obj i ≅ D₂.obj i) (comm : ∀ ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q), CategoryTheory.CategoryStruct.comp ((F.map f₁.op.toLoc).toFunctor.map (e i₁).hom) (D₂.hom q f₁ f₂ ⋯ ⋯) = CategoryTheory.CategoryStruct.comp (D₁.hom q f₁ f₂ ⋯ ⋯) ((F.map f₂.op.toLoc).toFunctor.map (e i₂).hom) := by cat_disch) (i : ι) : (CategoryTheory.Pseudofunctor.DescentData.isoMk e comm).hom.hom i = (e i).hom - CategoryTheory.Pseudofunctor.DescentData.isoMk_inv_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {D₁ D₂ : F.DescentData f} (e : (i : ι) → D₁.obj i ≅ D₂.obj i) (comm : ∀ ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q), CategoryTheory.CategoryStruct.comp ((F.map f₁.op.toLoc).toFunctor.map (e i₁).hom) (D₂.hom q f₁ f₂ ⋯ ⋯) = CategoryTheory.CategoryStruct.comp (D₁.hom q f₁ f₂ ⋯ ⋯) ((F.map f₂.op.toLoc).toFunctor.map (e i₂).hom) := by cat_disch) (i : ι) : (CategoryTheory.Pseudofunctor.DescentData.isoMk e comm).inv.hom i = (e i).inv - CategoryTheory.Pseudofunctor.DescentData.Hom.comm_assoc 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {D₁ D₂ : F.DescentData f} (self : D₁.Hom D₂) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) {Z : ↑(F.obj { as := Opposite.op Y })} (h : (F.map f₂.op.toLoc).toFunctor.obj (D₂.obj i₂) ⟶ Z) : CategoryTheory.CategoryStruct.comp ((F.map f₁.op.toLoc).toFunctor.map (self.hom i₁)) (CategoryTheory.CategoryStruct.comp (D₂.hom q f₁ f₂ ⋯ ⋯) h) = CategoryTheory.CategoryStruct.comp (D₁.hom q f₁ f₂ ⋯ ⋯) (CategoryTheory.CategoryStruct.comp ((F.map f₂.op.toLoc).toFunctor.map (self.hom i₂)) h) - CategoryTheory.Pseudofunctor.DescentData.ofObj_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (M : ↑(F.obj { as := Opposite.op S })) (Y : C) (q : Y ⟶ S) (i₁ i₂ : ι) (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q) : (CategoryTheory.Pseudofunctor.DescentData.ofObj M).hom q f₁ f₂ hf₁ hf₂ = CategoryTheory.CategoryStruct.comp ((F.mapComp' (f i₁).op.toLoc f₁.op.toLoc q.op.toLoc ⋯).inv.toNatTrans.app M) ((F.mapComp' (f i₂).op.toLoc f₂.op.toLoc q.op.toLoc ⋯).hom.toNatTrans.app M) - CategoryTheory.Pseudofunctor.DescentData.pullFunctorObjHom_eq 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {S' : C} {p : S' ⟶ S} {ι' : Type t'} {X' : ι' → C} {f' : (j : ι') → X' j ⟶ S'} {α : ι' → ι} {p' : (j : ι') → X' j ⟶ X (α j)} (w : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p' j) (f (α j)) = CategoryTheory.CategoryStruct.comp (f' j) p) (D : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S') ⦃j₁ j₂ : ι'⦄ (f₁ : Y ⟶ X' j₁) (f₂ : Y ⟶ X' j₂) (q' : Y ⟶ S) (f₁' : Y ⟶ X (α j₁)) (f₂' : Y ⟶ X (α j₂)) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f' j₁) = q := by cat_disch) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f' j₂) = q := by cat_disch) (hq' : CategoryTheory.CategoryStruct.comp q p = q' := by cat_disch) (hf₁' : CategoryTheory.CategoryStruct.comp f₁ (p' j₁) = f₁' := by cat_disch) (hf₂' : CategoryTheory.CategoryStruct.comp f₂ (p' j₂) = f₂' := by cat_disch) : CategoryTheory.Pseudofunctor.DescentData.pullFunctorObjHom w D q f₁ f₂ ⋯ ⋯ = CategoryTheory.CategoryStruct.comp ((F.mapComp' (p' j₁).op.toLoc f₁.op.toLoc f₁'.op.toLoc ⋯).inv.toNatTrans.app (D.obj (α j₁))) (CategoryTheory.CategoryStruct.comp (D.hom q' f₁' f₂' ⋯ ⋯) ((F.mapComp' (p' j₂).op.toLoc f₂.op.toLoc f₂'.op.toLoc ⋯).hom.toNatTrans.app (D.obj (α j₂)))) - CategoryTheory.Pseudofunctor.DescentData.pullFunctorObjHom_eq_assoc 📋 Mathlib.CategoryTheory.Sites.Descent.DescentData
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {S' : C} {p : S' ⟶ S} {ι' : Type t'} {X' : ι' → C} {f' : (j : ι') → X' j ⟶ S'} {α : ι' → ι} {p' : (j : ι') → X' j ⟶ X (α j)} (w : ∀ (j : ι'), CategoryTheory.CategoryStruct.comp (p' j) (f (α j)) = CategoryTheory.CategoryStruct.comp (f' j) p) (D : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S') ⦃j₁ j₂ : ι'⦄ (f₁ : Y ⟶ X' j₁) (f₂ : Y ⟶ X' j₂) (q' : Y ⟶ S) (f₁' : Y ⟶ X (α j₁)) (f₂' : Y ⟶ X (α j₂)) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f' j₁) = q := by cat_disch) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f' j₂) = q := by cat_disch) (hq' : CategoryTheory.CategoryStruct.comp q p = q' := by cat_disch) (hf₁' : CategoryTheory.CategoryStruct.comp f₁ (p' j₁) = f₁' := by cat_disch) (hf₂' : CategoryTheory.CategoryStruct.comp f₂ (p' j₂) = f₂' := by cat_disch) {Z : ↑(F.obj { as := Opposite.op Y })} (h : (F.map f₂.op.toLoc).toFunctor.obj ((F.map (p' j₂).op.toLoc).toFunctor.obj (D.obj (α j₂))) ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Pseudofunctor.DescentData.pullFunctorObjHom w D q f₁ f₂ ⋯ ⋯) h = CategoryTheory.CategoryStruct.comp ((F.mapComp' (p' j₁).op.toLoc f₁.op.toLoc f₁'.op.toLoc ⋯).inv.toNatTrans.app (D.obj (α j₁))) (CategoryTheory.CategoryStruct.comp (D.hom q' f₁' f₂' ⋯ ⋯) (CategoryTheory.CategoryStruct.comp ((F.mapComp' (p' j₂).op.toLoc f₂.op.toLoc f₂'.op.toLoc ⋯).hom.toNatTrans.app (D.obj (α j₂))) h)) - CategoryTheory.Pseudofunctor.DescentData'.descentData_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} {sq : (i j : ι) → CategoryTheory.Limits.ChosenPullback (f i) (f j)} {sq₃ : (i₁ i₂ i₃ : ι) → CategoryTheory.Limits.ChosenPullback₃ (sq i₁ i₂) (sq i₂ i₃) (sq i₁ i₃)} (D : F.DescentData' sq sq₃) (x✝ : C) (x✝¹ : x✝ ⟶ S) (x✝² x✝³ : ι) (x✝⁴ : x✝ ⟶ X x✝²) (x✝⁵ : x✝ ⟶ X x✝³) (x✝⁶ : CategoryTheory.CategoryStruct.comp x✝⁴ (f x✝²) = x✝¹) (x✝⁷ : CategoryTheory.CategoryStruct.comp x✝⁵ (f x✝³) = x✝¹) : D.descentData.hom x✝¹ x✝⁴ x✝⁵ x✝⁶ x✝⁷ = CategoryTheory.Pseudofunctor.DescentData'.pullHom' D.hom (CategoryTheory.CategoryStruct.comp x✝⁴ (f x✝²)) x✝⁴ x✝⁵ ⋯ ⋯ - CategoryTheory.Pseudofunctor.DescentData'.pullHom'_ofDescentData_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (sq : (i j : ι) → CategoryTheory.Limits.ChosenPullback (f i) (f j)) (sq₃ : (i₁ i₂ i₃ : ι) → CategoryTheory.Limits.ChosenPullback₃ (sq i₁ i₂) (sq i₂ i₃) (sq i₁ i₃)) (D : F.DescentData f) ⦃Y : C⦄ (q : Y ⟶ S) ⦃i₁ i₂ : ι⦄ (f₁ : Y ⟶ X i₁) (f₂ : Y ⟶ X i₂) (hf₁ : CategoryTheory.CategoryStruct.comp f₁ (f i₁) = q := by cat_disch) (hf₂ : CategoryTheory.CategoryStruct.comp f₂ (f i₂) = q := by cat_disch) : CategoryTheory.Pseudofunctor.DescentData'.pullHom' (CategoryTheory.Pseudofunctor.DescentData'.ofDescentData sq sq₃ D).hom q f₁ f₂ hf₁ hf₂ = D.hom q f₁ f₂ hf₁ hf₂ - CategoryTheory.Pseudofunctor.DescentData'.ofDescentData_hom 📋 Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cᵒᵖ) CategoryTheory.Cat} {ι : Type t} {S : C} {X : ι → C} {f : (i : ι) → X i ⟶ S} (sq : (i j : ι) → CategoryTheory.Limits.ChosenPullback (f i) (f j)) (sq₃ : (i₁ i₂ i₃ : ι) → CategoryTheory.Limits.ChosenPullback₃ (sq i₁ i₂) (sq i₂ i₃) (sq i₁ i₃)) (D : F.DescentData f) (i₁ i₂ : ι) : (CategoryTheory.Pseudofunctor.DescentData'.ofDescentData sq sq₃ D).hom i₁ i₂ = D.hom (sq i₁ i₂).p (sq i₁ i₂).p₁ (sq i₁ i₂).p₂ ⋯ ⋯
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