Loogle!
Result
Found 81 declarations mentioning CategoryTheory.IsGrothendieckAbelian.
- CategoryTheory.IsGrothendieckAbelian 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] : Prop - CategoryTheory.IsGrothendieckAbelian.hasColimits 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C - CategoryTheory.IsGrothendieckAbelian.hasFilteredColimitsOfSize 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Abelian C} [self : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.Limits.HasFilteredColimitsOfSize.{w, w, v, u} C - CategoryTheory.IsGrothendieckAbelian.hasLimits 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.Limits.HasLimitsOfSize.{w, w, v, u} C - CategoryTheory.IsGrothendieckAbelian.hasSeparator 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Abelian C} [self : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.HasSeparator C - CategoryTheory.IsGrothendieckAbelian.locallySmall 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Abelian C} [self : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.IsGrothendieckAbelian.ab5OfSize 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Abelian C} [self : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.AB5OfSize.{w, w, v, u} C - CategoryTheory.IsGrothendieckAbelian.wellPowered 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.WellPowered.{w, v, u} C - CategoryTheory.IsGrothendieckAbelian.of_equivalence 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Abelian C] [CategoryTheory.Abelian D] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (α : C ≌ D) : CategoryTheory.IsGrothendieckAbelian.{w, v₂, u₂} D - CategoryTheory.ShrinkHoms.isGrothendieckAbelian 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.IsGrothendieckAbelian.{w, w, u} (CategoryTheory.ShrinkHoms.{u} C) - CategoryTheory.IsGrothendieckAbelian.ab4OfSize 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.AB4OfSize.{w, v, u} C - CategoryTheory.IsGrothendieckAbelian.mk 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] (locallySmall : CategoryTheory.LocallySmall.{w, v, u} C := by infer_instance) (hasFilteredColimitsOfSize : CategoryTheory.Limits.HasFilteredColimitsOfSize.{w, w, v, u} C := by infer_instance) (ab5OfSize : CategoryTheory.AB5OfSize.{w, w, v, u} C := by infer_instance) (hasSeparator : CategoryTheory.HasSeparator C := by infer_instance) : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C - instIsGrothendieckAbelianAddCommGrpCat 📋 Mathlib.Algebra.Category.Grp.AB
: CategoryTheory.IsGrothendieckAbelian.{u, u, u + 1} AddCommGrpCat - instIsGrothendieckAbelianModuleCat 📋 Mathlib.Algebra.Category.ModuleCat.AB
(R : Type u) [Ring R] : CategoryTheory.IsGrothendieckAbelian.{u, u, u + 1} (ModuleCat R) - HomologicalComplex.isGrothendieckAbelian 📋 Mathlib.Algebra.Homology.GrothendieckAbelian
(C : Type u) [CategoryTheory.Category.{v, u} C] {ι : Type t} (c : ComplexShape ι) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] [c.HasNoLoop] [Small.{w, t} ι] : CategoryTheory.IsGrothendieckAbelian.{w, max t v, max (max t u) v} (HomologicalComplex C c) - PresheafOfModules.instIsGrothendieckAbelian 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.PresheafOfModules
{C : Type u} [CategoryTheory.SmallCategory C] (R : CategoryTheory.Functor Cᵒᵖ RingCat) : CategoryTheory.IsGrothendieckAbelian.{u, u, u + 1} (PresheafOfModules R) - SheafOfModules.instIsGrothendieckAbelian 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.SheafOfModules
{C : Type u} [CategoryTheory.SmallCategory C] {J : CategoryTheory.GrothendieckTopology C} (R : CategoryTheory.Sheaf J RingCat) : CategoryTheory.IsGrothendieckAbelian.{u, u, u + 1} (SheafOfModules R) - AlgebraicGeometry.Scheme.Modules.instIsGrothendieckAbelian 📋 Mathlib.AlgebraicGeometry.Modules.Sheaf
{X : AlgebraicGeometry.Scheme} : CategoryTheory.IsGrothendieckAbelian.{u, u, u + 1} X.Modules - CategoryTheory.Sheaf.instIsGrothendieckAbelian 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.Sheaf
{C : Type v} [CategoryTheory.SmallCategory C] (J : CategoryTheory.GrothendieckTopology C) (A : Type u₁) [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Abelian A] [CategoryTheory.IsGrothendieckAbelian.{v, v₁, u₁} A] [CategoryTheory.HasSheafify J A] : CategoryTheory.IsGrothendieckAbelian.{v, max v v₁, max (max (max u₁ v) v₁) v} (CategoryTheory.Sheaf J A) - CategoryTheory.Sheaf.isGrothendieckAbelian_of_essentiallySmall 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.Sheaf
{C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] [CategoryTheory.EssentiallySmall.{v, v₂, u₂} C] (J : CategoryTheory.GrothendieckTopology C) (A : Type u₁) [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Abelian A] [CategoryTheory.IsGrothendieckAbelian.{v, v₁, u₁} A] [∀ (X : Cᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X (CategoryTheory.equivSmallModel C).inverse.op) A] [CategoryTheory.HasSheafify ((CategoryTheory.equivSmallModel C).inverse.inducedTopology J) A] : CategoryTheory.IsGrothendieckAbelian.{v, max u₂ v₁, max (max (max u₁ u₂) v₁) v₂} (CategoryTheory.Sheaf J A) - AlgebraicGeometry.Scheme.isGrothendieckAbelian_sheaf_affineEtaleTopology 📋 Mathlib.AlgebraicGeometry.Sites.AffineEtale
(S : AlgebraicGeometry.Scheme) (A : Type u') [CategoryTheory.Category.{u, u'} A] {FA : A → A → Type u_1} {CD : A → Type u} [(X Y : A) → FunLike (FA X Y) (CD X) (CD Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [(CategoryTheory.forget A).ReflectsIsomorphisms] [CategoryTheory.Limits.PreservesFilteredColimitsOfSize.{u, u, u, u, u', u + 1} (CategoryTheory.forget A)] [CategoryTheory.Abelian A] [CategoryTheory.IsGrothendieckAbelian.{u, u, u'} A] : CategoryTheory.IsGrothendieckAbelian.{u, u + 1, max (max u' (u + 1)) u} (CategoryTheory.Sheaf (AlgebraicGeometry.Scheme.AffineEtale.topology S) A) - AlgebraicGeometry.Scheme.isGrothendieckAbelian_sheaf_smallEtaleTopology 📋 Mathlib.AlgebraicGeometry.Sites.AffineEtale
(S : AlgebraicGeometry.Scheme) (A : Type u') [CategoryTheory.Category.{u, u'} A] {FA : A → A → Type u_1} {CD : A → Type u} [(X Y : A) → FunLike (FA X Y) (CD X) (CD Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [(CategoryTheory.forget A).ReflectsIsomorphisms] [CategoryTheory.Limits.PreservesFilteredColimitsOfSize.{u, u, u, u, u', u + 1} (CategoryTheory.forget A)] [CategoryTheory.Abelian A] [CategoryTheory.IsGrothendieckAbelian.{u, u, u'} A] : CategoryTheory.IsGrothendieckAbelian.{u, u + 1, max (max u' (u + 1)) u} (CategoryTheory.Sheaf S.smallEtaleTopology A) - CategoryTheory.IsGrothendieckAbelian.isColimitMapCoconeOfSubobjectMkEqISup 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] (c : CategoryTheory.Limits.Cocone (F.comp (CategoryTheory.MonoOver.forget X))) [CategoryTheory.Mono c.pt.hom] (h : CategoryTheory.Subobject.mk c.pt.hom = ⨆ j, CategoryTheory.Subobject.mk (F.obj j).obj.hom) : CategoryTheory.Limits.IsColimit ((CategoryTheory.Over.forget X).mapCocone c) - CategoryTheory.IsGrothendieckAbelian.mono_of_isColimit_monoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] {c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))} (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) : CategoryTheory.Mono f - CategoryTheory.IsGrothendieckAbelian.exists_isIso_of_functor_from_monoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))) (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) (h : CategoryTheory.Epi f) : ∃ j, CategoryTheory.IsIso (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.subobjectMk_of_isColimit_eq_iSup 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] {c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))} (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) : CategoryTheory.Subobject.mk f = ⨆ j, CategoryTheory.Subobject.mk (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.preservesColimit_coyoneda_obj_of_mono 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (Y : CategoryTheory.Functor J C) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) [∀ (j j' : J) (φ : j ⟶ j'), CategoryTheory.Mono (Y.map φ)] : CategoryTheory.Limits.PreservesColimit Y (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) [∀ (j j' : J) (φ : j ⟶ j'), CategoryTheory.Mono (Y.map φ)] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (z : X ⟶ c.pt) : ∃ j₀ y, z = CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (j₀ : J) (y₁ y₂ : X ⟶ Y.obj j₀) (hy : CategoryTheory.CategoryStruct.comp y₁ (c.ι.app j₀) = CategoryTheory.CategoryStruct.comp y₂ (c.ι.app j₀)) : ∃ j φ, CategoryTheory.CategoryStruct.comp y₁ (Y.map φ) = CategoryTheory.CategoryStruct.comp y₂ (Y.map φ) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀ 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) {j₀ : J} (y : X ⟶ Y.obj j₀) (hy : CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) = 0) : ∃ j φ, CategoryTheory.CategoryStruct.comp y (Y.map φ) = 0 - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.f 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (z : X ⟶ c.pt) : CategoryTheory.Limits.colimit (CategoryTheory.Limits.pullback c.ι ((CategoryTheory.Functor.const J).map z)) ⟶ X - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.epi_f 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) (z : X ⟶ c.pt) [CategoryTheory.IsFiltered J] : CategoryTheory.Epi (CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.f z) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.isIso_f 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) (z : X ⟶ c.pt) [CategoryTheory.IsFiltered J] : CategoryTheory.IsIso (CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.f z) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.f 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {j₀ : J} (y : X ⟶ Y.obj j₀) : CategoryTheory.Limits.colimit (CategoryTheory.Limits.kernel (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.g y)) ⟶ X - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.epi_f 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {j₀ : J} {y : X ⟶ Y.obj j₀} (hy : CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) = 0) [CategoryTheory.IsFiltered J] : CategoryTheory.Epi (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.f y) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.hf 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (z : X ⟶ c.pt) (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι (CategoryTheory.Limits.pullback c.ι ((CategoryTheory.Functor.const J).map z)) j) (CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.f z) = (CategoryTheory.Limits.pullback.snd c.ι ((CategoryTheory.Functor.const J).map z)).app j - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.hf 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {j₀ : J} (y : X ⟶ Y.obj j₀) (j : CategoryTheory.Under j₀) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι (CategoryTheory.Limits.kernel (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.g y)) j) (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.f y) = (CategoryTheory.Limits.kernel.ι (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀.g y)).app j - CategoryTheory.IsGrothendieckAbelian.instIsStableUnderTransfiniteCompositionMonomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Monomorphisms
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).IsStableUnderTransfiniteComposition - CategoryTheory.IsGrothendieckAbelian.enoughInjectives 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.EnoughInjectives C - CategoryTheory.IsGrothendieckAbelian.instHasSmallObjectArgumentGeneratingMonomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G).HasSmallObjectArgument - CategoryTheory.IsGrothendieckAbelian.instHasFunctorialFactorizationMonomorphismsRlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : (CategoryTheory.MorphismProperty.monomorphisms C).HasFunctorialFactorization (CategoryTheory.MorphismProperty.monomorphisms C).rlp - CategoryTheory.IsGrothendieckAbelian.llp_rlp_monomorphisms 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (hG : CategoryTheory.IsSeparator G) : (CategoryTheory.MorphismProperty.monomorphisms C).rlp.llp = CategoryTheory.MorphismProperty.monomorphisms C - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms_rlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (hG : CategoryTheory.IsSeparator G) : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G).rlp = (CategoryTheory.MorphismProperty.monomorphisms C).rlp - CategoryTheory.IsGrothendieckAbelian.monoMapFactorizationDataRlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : (CategoryTheory.MorphismProperty.monomorphisms C).MapFactorizationData (CategoryTheory.MorphismProperty.monomorphisms C).rlp f - CategoryTheory.IsGrothendieckAbelian.instMonoIMonomorphismsRlpMonoMapFactorizationDataRlp 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.Mono (CategoryTheory.IsGrothendieckAbelian.monoMapFactorizationDataRlp f).i - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functor 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] : CategoryTheory.Functor J C - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.instIsWellOrderContinuousFunctor 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functor hG A₀ J).IsWellOrderContinuous - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] : CategoryTheory.Functor J (CategoryTheory.MonoOver X) - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.exists_transfiniteCompositionOfShape 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {A : C} (f : A ⟶ X) [CategoryTheory.Mono f] : ∃ J x x_1 x_2, ∃ (x_3 : WellFoundedLT J), Nonempty ((CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G).pushouts.TransfiniteCompositionOfShape J f) - CategoryTheory.IsGrothendieckAbelian.instInjectiveZMonomorphismsRlpMonoMapFactorizationDataRlpOfNatHom 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} : CategoryTheory.Injective (CategoryTheory.IsGrothendieckAbelian.monoMapFactorizationDataRlp 0).Z - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.top_mem_range 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] (hJ : HasCardinalLT (CategoryTheory.Subobject X) (Cardinal.mk J)) : ∃ j, transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j A₀ = ⊤ - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.exists_ordinal 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) : ∃ o j, transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j A₀ = ⊤ - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver_obj 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] (j : J) : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver hG A₀ J).obj j = CategoryTheory.MonoOver.mk (transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j A₀).arrow - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.transfiniteCompositionOfShapeOfEqTop 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {A : C} {f : A ⟶ X} [CategoryTheory.Mono f] {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {j : J} (hj : transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j (CategoryTheory.Subobject.mk f) = ⊤) : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G).pushouts.TransfiniteCompositionOfShape (↑(Set.Iic j)) f - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.transfiniteCompositionOfShapeMapFromBot 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] (j : J) : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms G).pushouts.TransfiniteCompositionOfShape (↑(Set.Iic j)) ((CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functor hG A₀ J).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver_map 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {j j' : J} (f : j ⟶ j') : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver hG A₀ J).map f = CategoryTheory.MonoOver.homMk ((transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j A₀).ofLE (transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j' A₀) ⋯) ⋯ - CategoryTheory.IsGrothendieckAbelian.hasExt 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.HasExt
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.HasExt C - AlgebraicGeometry.Scheme.instIsGrothendieckAbelianSheafProEtTopologyAb 📋 Mathlib.AlgebraicGeometry.Sites.ElladicCohomology
(X : AlgebraicGeometry.Scheme) : CategoryTheory.IsGrothendieckAbelian.{u + 1, u + 1, u + 2} (CategoryTheory.Sheaf (AlgebraicGeometry.Scheme.ProEt.topology X) Ab) - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.EmbeddingRing 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] : Type v - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.instRingEmbeddingRing 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] : Ring (CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.EmbeddingRing F) - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.embedding 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] : CategoryTheory.Functor Cᵒᵖ (ModuleCat (CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.EmbeddingRing F)) - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.preservesFiniteColimits_embedding 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] : CategoryTheory.Limits.PreservesFiniteColimits (CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.embedding F) - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.preservesFiniteLimits_embedding 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] : CategoryTheory.Limits.PreservesFiniteLimits (CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.embedding F) - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.faithful_embedding 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] [Nonempty D] : (CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.embedding F).Faithful - CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.full_embedding 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type v} [CategoryTheory.SmallCategory D] (F : CategoryTheory.Functor D Cᵒᵖ) [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] [Nonempty D] [F.Full] : (F.comp (CategoryTheory.Abelian.IsGrothendieckAbelian.OppositeModuleEmbedding.embedding F)).Full - CategoryTheory.Limits.isGrothendieckAbelian_ind 📋 Mathlib.CategoryTheory.Abelian.GrothendieckAxioms.Indization
{C : Type u} [CategoryTheory.SmallCategory C] [CategoryTheory.Abelian C] : CategoryTheory.IsGrothendieckAbelian.{u, u, u + 1} (CategoryTheory.Ind C) - CategoryTheory.IsGrothendieckAbelian.instHasCoseparator 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Coseparator
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.HasCoseparator C - CategoryTheory.IsGrothendieckAbelian.tensorObj 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] (G : C) : CategoryTheory.Functor (ModuleCat (CategoryTheory.End G)ᵐᵒᵖ) C - CategoryTheory.IsGrothendieckAbelian.instIsLeftAdjointModuleCatMulOppositeEndTensorObj 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G : C} : (CategoryTheory.IsGrothendieckAbelian.tensorObj G).IsLeftAdjoint - CategoryTheory.IsGrothendieckAbelian.instIsRightAdjointModuleCatMulOppositeEndPreadditiveCoyonedaObj 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G : C} : (CategoryTheory.preadditiveCoyonedaObj G).IsRightAdjoint - CategoryTheory.IsGrothendieckAbelian.GabrielPopescu.preservesFiniteLimits 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] (G : C) (hG : CategoryTheory.IsSeparator G) : CategoryTheory.Limits.PreservesFiniteLimits (CategoryTheory.IsGrothendieckAbelian.tensorObj G) - CategoryTheory.IsGrothendieckAbelian.GabrielPopescu.full 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] (G : C) (hG : CategoryTheory.IsSeparator G) : (CategoryTheory.preadditiveCoyonedaObj G).Full - CategoryTheory.IsGrothendieckAbelian.GabrielPopescu.preservesInjectiveObjects 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] (G : C) (hG : CategoryTheory.IsSeparator G) : (CategoryTheory.preadditiveCoyonedaObj G).PreservesInjectiveObjects - CategoryTheory.IsGrothendieckAbelian.tensorObjPreadditiveCoyonedaObjAdjunction 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] (G : C) : CategoryTheory.IsGrothendieckAbelian.tensorObj G ⊣ CategoryTheory.preadditiveCoyonedaObj G - CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G A : C} {M : ModuleCat (CategoryTheory.End G)ᵐᵒᵖ} (g : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ A)) : (∐ fun x => G) ⟶ A - CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.exists_d_comp_eq_d 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G : C} (hG : CategoryTheory.IsSeparator G) {A : C} (B : C) [CategoryTheory.Injective B] {M : ModuleCat (CategoryTheory.End G)ᵐᵒᵖ} (g : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ A)) (hg : CategoryTheory.Mono g) (f : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ B)) : ∃ l, CategoryTheory.CategoryStruct.comp (CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d g) l = CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d f - CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.ι_d 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G A : C} {M : ModuleCat (CategoryTheory.End G)ᵐᵒᵖ} (g : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ A)) (m : ↑M) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun x => G) m) (CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d g) = (ModuleCat.Hom.hom g) m - CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.ι_d_assoc 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G A : C} {M : ModuleCat (CategoryTheory.End G)ᵐᵒᵖ} (g : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ A)) (m : ↑M) {Z : C} (h : A ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Sigma.ι (fun x => G) m) (CategoryTheory.CategoryStruct.comp (CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d g) h) = CategoryTheory.CategoryStruct.comp ((ModuleCat.Hom.hom g) m) h - CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.kernel_ι_d_comp_d 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ModuleEmbedding.GabrielPopescu
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{v, v, u} C] {G : C} (hG : CategoryTheory.IsSeparator G) {A B : C} {M : ModuleCat (CategoryTheory.End G)ᵐᵒᵖ} (g : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ A)) (hg : CategoryTheory.Mono g) (f : M ⟶ ModuleCat.of (CategoryTheory.End G)ᵐᵒᵖ (G ⟶ B)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.kernel.ι (CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d g)) (CategoryTheory.IsGrothendieckAbelian.GabrielPopescuAux.d f) = 0 - LightCondensed.instIsGrothendieckAbelianLightCondMod 📋 Mathlib.Condensed.Light.AB
{R : Type u} [Ring R] : CategoryTheory.IsGrothendieckAbelian.{u, u + 1, u + 1} (LightCondMod R) - TopCat.Sheaf.instIsGrothendieckAbelian 📋 Mathlib.Topology.Sheaves.Abelian
{X : TopCat} {D : Type u_1} [CategoryTheory.Category.{u, u_1} D] [CategoryTheory.Abelian D] [CategoryTheory.IsGrothendieckAbelian.{u, u, u_1} D] [CategoryTheory.HasSheafify (Opens.grothendieckTopology ↑X) D] : CategoryTheory.IsGrothendieckAbelian.{u, u, max u_1 u} (TopCat.Sheaf D X)
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 ce5dd8c