Loogle!
Result
Found 77 declarations mentioning CategoryTheory.Limits.PreservesFilteredColimits.
- CategoryTheory.Limits.PreservesFilteredColimits 📋 Mathlib.CategoryTheory.Limits.Preserves.Filtered
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : Prop - AddMonCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget AddMonCat) - MonCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget MonCat) - AddCommMonCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget AddCommMonCat) - CommMonCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget CommMonCat) - AddCommMonCat.FilteredColimits.forget₂AddMonPreservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ AddCommMonCat AddMonCat) - CommMonCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ CommMonCat MonCat) - AddGrpCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget AddGrpCat) - GrpCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget GrpCat) - AddCommGrpCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget AddCommGrpCat) - CommGrpCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget CommGrpCat) - AddGrpCat.FilteredColimits.forget₂AddMon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ AddGrpCat AddMonCat) - GrpCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ GrpCat MonCat) - AddCommGrpCat.FilteredColimits.forget₂AddGroup_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - CommGrpCat.FilteredColimits.forget₂Group_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ CommGrpCat GrpCat) - SemiRingCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget SemiRingCat) - CommSemiRingCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget CommSemiRingCat) - RingCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget RingCat) - CommRingCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget CommRingCat) - CommSemiRingCat.FilteredColimits.forget₂SemiRing_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ CommSemiRingCat SemiRingCat) - RingCat.FilteredColimits.forget₂SemiRing_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ RingCat SemiRingCat) - SemiRingCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ SemiRingCat MonCat) - CommRingCat.FilteredColimits.forget₂Ring_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ CommRingCat RingCat) - RingCat.FilteredColimits.instPreservesFilteredColimitsAddCommGrpCatForget₂RingHomCarrierAddMonoidHomCarrier 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ RingCat AddCommGrpCat) - instPreservesFilteredColimitsAlgCatForgetAlgHomCarrier 📋 Mathlib.Algebra.Category.AlgCat.FilteredColimits
{R : Type u} [CommRing R] : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget (AlgCat R)) - instPreservesFilteredColimitsAlgCatRingCatForget₂AlgHomCarrierRingHomCarrier 📋 Mathlib.Algebra.Category.AlgCat.FilteredColimits
{R : Type u} [CommRing R] : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ (AlgCat R) RingCat) - ModuleCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.ModuleCat.FilteredColimits
{R : Type u} [Ring R] : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget (ModuleCat R)) - ModuleCat.FilteredColimits.forget₂AddCommGroup_preservesFilteredColimits 📋 Mathlib.Algebra.Category.ModuleCat.FilteredColimits
{R : Type u} [Ring R] : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ (ModuleCat R) AddCommGrpCat) - CategoryTheory.lan_flat_of_flat 📋 Mathlib.CategoryTheory.Functor.Flat
{C D : Type u₁} [CategoryTheory.SmallCategory C] [CategoryTheory.SmallCategory D] (E : Type u₂) [CategoryTheory.Category.{u₁, u₂} E] {FE : E → E → Type u_1} {CE : E → Type u₁} [(X Y : E) → FunLike (FE X Y) (CE X) (CE Y)] [CategoryTheory.ConcreteCategory E FE] [CategoryTheory.Limits.HasLimits E] [CategoryTheory.Limits.HasColimits E] [CategoryTheory.Limits.ReflectsLimits (CategoryTheory.forget E)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget E)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget E)] (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] : CategoryTheory.RepresentablyFlat F.op.lan - CategoryTheory.lan_preservesFiniteLimits_of_flat 📋 Mathlib.CategoryTheory.Functor.Flat
{C D : Type u₁} [CategoryTheory.SmallCategory C] [CategoryTheory.SmallCategory D] (E : Type u₂) [CategoryTheory.Category.{u₁, u₂} E] {FE : E → E → Type u_1} {CE : E → Type u₁} [(X Y : E) → FunLike (FE X Y) (CE X) (CE Y)] [CategoryTheory.ConcreteCategory E FE] [CategoryTheory.Limits.HasLimits E] [CategoryTheory.Limits.HasColimits E] [CategoryTheory.Limits.ReflectsLimits (CategoryTheory.forget E)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget E)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget E)] (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] : CategoryTheory.Limits.PreservesFiniteLimits F.op.lan - CategoryTheory.lan_preservesFiniteLimits_of_preservesFiniteLimits 📋 Mathlib.CategoryTheory.Functor.Flat
{C D : Type u₁} [CategoryTheory.SmallCategory C] [CategoryTheory.SmallCategory D] (E : Type u₂) [CategoryTheory.Category.{u₁, u₂} E] {FE : E → E → Type u_1} {CE : E → Type u₁} [(X Y : E) → FunLike (FE X Y) (CE X) (CE Y)] [CategoryTheory.ConcreteCategory E FE] [CategoryTheory.Limits.HasLimits E] [CategoryTheory.Limits.HasColimits E] [CategoryTheory.Limits.ReflectsLimits (CategoryTheory.forget E)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget E)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget E)] [CategoryTheory.Limits.HasFiniteLimits C] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesFiniteLimits F] : CategoryTheory.Limits.PreservesFiniteLimits F.op.lan - TopCat.Presheaf.stalkFunctor_preserves_mono 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] (x : ↑X) : ((TopCat.Sheaf.forget C X).comp (TopCat.Presheaf.stalkFunctor C x)).PreservesMonomorphisms - TopCat.Presheaf.exists_germ_eq 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (F : TopCat.Presheaf C X) {x : ↑X} (t : CategoryTheory.ToType (F.stalk x)) : ∃ U, ∃ (m : x ∈ U), ∃ s, (CategoryTheory.ConcreteCategory.hom (F.germ U x m)) s = t - TopCat.Presheaf.germ_exist 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (F : TopCat.Presheaf C X) {x : ↑X} (t : CategoryTheory.ToType (F.stalk x)) : ∃ U, ∃ (m : x ∈ U), ∃ s, (CategoryTheory.ConcreteCategory.hom (F.germ U x m)) s = t - TopCat.Presheaf.exists_mem_germ_eq_of_isBasis 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] {B : Set (TopologicalSpace.Opens ↑X)} (hB : TopologicalSpace.Opens.IsBasis B) (F : TopCat.Presheaf C X) (x : ↑X) (t : CategoryTheory.ToType (F.stalk x)) : ∃ U, ∃ (m : x ∈ U) (_ : U ∈ B), ∃ s, (CategoryTheory.ConcreteCategory.hom (F.germ U x m)) s = t - TopCat.Presheaf.exists_le_germ_eq 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (F : TopCat.Presheaf C X) {x : ↑X} (t : CategoryTheory.ToType (F.stalk x)) {V : TopologicalSpace.Opens ↑X} (hV : x ∈ V) : ∃ U ≤ V, ∃ (m : x ∈ U), ∃ s, (CategoryTheory.ConcreteCategory.hom (F.germ U x m)) s = t - TopCat.Presheaf.isIso_of_stalkFunctor_map_iso 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) [∀ (x : ↑X), CategoryTheory.IsIso ((TopCat.Presheaf.stalkFunctor C x).map f.hom)] : CategoryTheory.IsIso f - TopCat.Presheaf.mono_of_stalk_mono 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) [∀ (x : ↑X), CategoryTheory.Mono ((TopCat.Presheaf.stalkFunctor C x).map f.hom)] : CategoryTheory.Mono f - TopCat.Presheaf.stalk_mono_of_mono 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) [CategoryTheory.Mono f] (x : ↑X) : CategoryTheory.Mono ((TopCat.Presheaf.stalkFunctor C x).map f.hom) - TopCat.Presheaf.isIso_iff_stalkFunctor_map_iso 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) : CategoryTheory.IsIso f ↔ ∀ (x : ↑X), CategoryTheory.IsIso ((TopCat.Presheaf.stalkFunctor C x).map f.hom) - TopCat.Presheaf.mono_iff_stalk_mono 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) : CategoryTheory.Mono f ↔ ∀ (x : ↑X), CategoryTheory.Mono ((TopCat.Presheaf.stalkFunctor C x).map f.hom) - TopCat.Presheaf.stalkFunctor_map_injective_of_app_injective 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] {F G : TopCat.Presheaf C X} {f : F ⟶ G} (h : ∀ (U : TopologicalSpace.Opens ↑X), Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op U)))) (x : ↑X) : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map f)) - TopCat.Presheaf.stalkFunctor_map_injective_of_isBasis 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] {B : Set (TopologicalSpace.Opens ↑X)} (hB : TopologicalSpace.Opens.IsBasis B) {F G : TopCat.Presheaf C X} {α : F ⟶ G} (hα : ∀ U ∈ B, Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (α.app (Opposite.op U)))) (x : ↑X) : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map α)) - TopCat.Presheaf.section_ext 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] (F : TopCat.Sheaf C X) (U : TopologicalSpace.Opens ↑X) (s t : CategoryTheory.ToType (F.obj.obj (Opposite.op U))) (h : ∀ (x : ↑X) (hx : x ∈ U), (CategoryTheory.ConcreteCategory.hom (F.presheaf.germ U x hx)) s = (CategoryTheory.ConcreteCategory.hom (F.presheaf.germ U x hx)) t) : s = t - TopCat.Presheaf.app_isIso_of_stalkFunctor_map_iso 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) (U : TopologicalSpace.Opens ↑X) [∀ (x : ↥U), CategoryTheory.IsIso ((TopCat.Presheaf.stalkFunctor C ↑x).map f.hom)] : CategoryTheory.IsIso (f.hom.app (Opposite.op U)) - TopCat.Presheaf.germ_eq 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (F : TopCat.Presheaf C X) {U V : TopologicalSpace.Opens ↑X} (x : ↑X) (mU : x ∈ U) (mV : x ∈ V) (s : CategoryTheory.ToType (F.obj (Opposite.op U))) (t : CategoryTheory.ToType (F.obj (Opposite.op V))) (h : (CategoryTheory.ConcreteCategory.hom (F.germ U x mU)) s = (CategoryTheory.ConcreteCategory.hom (F.germ V x mV)) t) : ∃ W, ∃ (_ : x ∈ W), ∃ iU iV, (CategoryTheory.ConcreteCategory.hom (F.map iU.op)) s = (CategoryTheory.ConcreteCategory.hom (F.map iV.op)) t - TopCat.Presheaf.germ_eq_of_isBasis 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] {B : Set (TopologicalSpace.Opens ↑X)} (hB : TopologicalSpace.Opens.IsBasis B) (F : TopCat.Presheaf C X) {U V : TopologicalSpace.Opens ↑X} (x : ↑X) (mU : x ∈ U) (mV : x ∈ V) {s : CategoryTheory.ToType (F.obj (Opposite.op U))} {t : CategoryTheory.ToType (F.obj (Opposite.op V))} (h : (CategoryTheory.ConcreteCategory.hom (F.germ U x mU)) s = (CategoryTheory.ConcreteCategory.hom (F.germ V x mV)) t) : ∃ W, ∃ (_ : x ∈ W) (_ : W ∈ B) (hWU : W ≤ U) (hWV : W ≤ V), (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE hWU).op)) s = (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE hWV).op)) t - TopCat.Presheaf.app_injective_iff_stalkFunctor_map_injective 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F : TopCat.Sheaf C X} {G : TopCat.Presheaf C X} (f : F.obj ⟶ G) : (∀ (x : ↑X), Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map f))) ↔ ∀ (U : TopologicalSpace.Opens ↑X), Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op U))) - TopCat.Presheaf.app_injective_of_stalkFunctor_map_injective 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F : TopCat.Sheaf C X} {G : TopCat.Presheaf C X} (f : F.obj ⟶ G) (U : TopologicalSpace.Opens ↑X) (h : ∀ x ∈ U, Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map f))) : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op U))) - TopCat.Presheaf.app_bijective_of_stalkFunctor_map_bijective 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) (U : TopologicalSpace.Opens ↑X) (h : ∀ x ∈ U, Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map f.hom))) : Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op U))) - TopCat.Presheaf.app_surjective_of_stalkFunctor_map_bijective 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) (U : TopologicalSpace.Opens ↑X) (h : ∀ x ∈ U, Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map f.hom))) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op U))) - TopCat.Presheaf.app_surjective_of_injective_of_locally_surjective 📋 Mathlib.Topology.Sheaves.Stalks
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimits C] {X : TopCat} {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {F G : TopCat.Sheaf C X} (f : F ⟶ G) (U : TopologicalSpace.Opens ↑X) (hinj : ∀ x ∈ U, Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map f.hom))) (hsurj : ∀ (t : CC (G.obj.obj (Opposite.op U))), ∀ x ∈ U, ∃ V, ∃ (_ : x ∈ V), ∃ iVU s, (CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op V))) s = (CategoryTheory.ConcreteCategory.hom (G.obj.map iVU.op)) t) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (f.hom.app (Opposite.op U))) - CategoryTheory.Functor.isFinitelyAccessible_iff_preservesFilteredColimits 📋 Mathlib.CategoryTheory.Presentable.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] {F : CategoryTheory.Functor C D} : F.IsFinitelyAccessible ↔ CategoryTheory.Limits.PreservesFilteredColimits F - CategoryTheory.isFinitelyPresentable_iff_preservesFilteredColimits 📋 Mathlib.CategoryTheory.Presentable.Finite
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} : CategoryTheory.IsFinitelyPresentable X ↔ CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.coyoneda.obj (Opposite.op X)) - CommRingCat.preservesFilteredColimits_coyoneda 📋 Mathlib.Algebra.Category.Ring.FinitePresentation
(R : CommRingCat) (S : CategoryTheory.Under R) (hS : (CommRingCat.Hom.hom S.hom).FinitePresentation) : CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.coyoneda.obj (Opposite.op S)) - CategoryTheory.Functor.SmallCategories.instPreservesFiniteLimitsSheafSheafPullbackOfRepresentablyFlat 📋 Mathlib.CategoryTheory.Sites.Pullback
{C : Type v₁} [CategoryTheory.SmallCategory C] {D : Type v₁} [CategoryTheory.SmallCategory D] (G : CategoryTheory.Functor C D) (A : Type u₁) [CategoryTheory.Category.{v₁, u₁} A] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) {FA : A → A → Type u_1} {CA : A → Type v₁} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] [G.IsContinuous J K] [CategoryTheory.RepresentablyFlat G] : CategoryTheory.Limits.PreservesFiniteLimits (G.sheafPullback A J K) - TopCat.Sheaf.pullback 📋 Mathlib.Topology.Sheaves.Functors
{X Y : TopCat} (A : Type u_1) [CategoryTheory.Category.{w, u_1} A] {FA : A → A → Type u_2} {CA : A → Type w} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] (f : X ⟶ Y) : CategoryTheory.Functor (TopCat.Sheaf A Y) (TopCat.Sheaf A X) - TopCat.Sheaf.instIsRightAdjointPushforward 📋 Mathlib.Topology.Sheaves.Functors
{X Y : TopCat} (f : X ⟶ Y) (A : Type u_1) [CategoryTheory.Category.{w, u_1} A] {FA : A → A → Type u_2} {CA : A → Type w} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] : (TopCat.Sheaf.pushforward A f).IsRightAdjoint - TopCat.Sheaf.instIsLeftAdjointPullback 📋 Mathlib.Topology.Sheaves.Functors
{X Y : TopCat} (f : X ⟶ Y) (A : Type u_1) [CategoryTheory.Category.{w, u_1} A] {FA : A → A → Type u_2} {CA : A → Type w} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] : (TopCat.Sheaf.pullback A f).IsLeftAdjoint - TopCat.Sheaf.pullbackPushforwardAdjunction 📋 Mathlib.Topology.Sheaves.Functors
{X Y : TopCat} (A : Type u_1) [CategoryTheory.Category.{w, u_1} A] {FA : A → A → Type u_2} {CA : A → Type w} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] (f : X ⟶ Y) : TopCat.Sheaf.pullback A f ⊣ TopCat.Sheaf.pushforward A f - Topology.IsOpenEmbedding.sheafPullbackIso 📋 Mathlib.Topology.Sheaves.Functors
{X Y : TopCat} (A : Type u_1) [CategoryTheory.Category.{w, u_1} A] {f : X ⟶ Y} (hf : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom f)) {FA : A → A → Type u_2} {CA : A → Type w} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] : TopCat.Sheaf.pullback A f ≅ Topology.IsOpenEmbedding.sheafPullback A hf - TopCat.Sheaf.pullbackIso 📋 Mathlib.Topology.Sheaves.Functors
{X Y : TopCat} (A : Type u_1) [CategoryTheory.Category.{w, u_1} A] {FA : A → A → Type u_2} {CA : A → Type w} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.HasColimits A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] (f : X ⟶ Y) : TopCat.Sheaf.pullback A f ≅ (TopCat.Sheaf.forget A Y).comp ((TopCat.Presheaf.pullback A f).comp (CategoryTheory.presheafToSheaf (Opens.grothendieckTopology ↑X) A)) - AlgebraicGeometry.SheafedSpace.epi_of_base_surjective_of_stalk_mono 📋 Mathlib.Geometry.RingedSpace.SheafedSpace
{C : Type u} [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {X Y : AlgebraicGeometry.SheafedSpace C} (f : X ⟶ Y) (h₁ : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f.hom.base)) (h₂ : ∀ (x : ↑↑X.toPresheafedSpace), CategoryTheory.Mono (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f.hom x)) : CategoryTheory.Epi f - AlgebraicGeometry.SheafedSpace.mono_of_base_injective_of_stalk_epi 📋 Mathlib.Geometry.RingedSpace.SheafedSpace
{C : Type u} [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {X Y : AlgebraicGeometry.SheafedSpace C} (f : X ⟶ Y) (h₁ : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom f.hom.base)) (h₂ : ∀ (x : ↑↑X.toPresheafedSpace), CategoryTheory.Epi (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f.hom x)) : CategoryTheory.Mono f - AlgebraicGeometry.SheafedSpace.hom_stalk_ext 📋 Mathlib.Geometry.RingedSpace.SheafedSpace
{C : Type u} [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [(CategoryTheory.forget C).ReflectsIsomorphisms] {X Y : AlgebraicGeometry.SheafedSpace C} (f g : X ⟶ Y) (h : f.hom.base = g.hom.base) (h' : ∀ (x : ↑↑X.toPresheafedSpace), AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f.hom x = CategoryTheory.CategoryStruct.comp (Y.presheaf.stalkCongr ⋯).hom (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap g.hom x)) : f = g - AlgebraicGeometry.SheafedSpace.IsOpenImmersion.of_stalk_iso 📋 Mathlib.Geometry.RingedSpace.OpenImmersion
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimits C] [CategoryTheory.Limits.HasColimits C] {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [(CategoryTheory.forget C).ReflectsIsomorphisms] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] {X Y : AlgebraicGeometry.SheafedSpace C} (f : X ⟶ Y) (hf : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom f.hom.base)) [H : ∀ (x : ↑↑X.toPresheafedSpace), CategoryTheory.IsIso (AlgebraicGeometry.PresheafedSpace.Hom.stalkMap f.hom x)] : AlgebraicGeometry.SheafedSpace.IsOpenImmersion f - LightProfinite.hasSheafify 📋 Mathlib.Condensed.Light.Instances
(A : Type u') [CategoryTheory.Category.{u, u'} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.HasColimits A] {FA : A → A → Type v} {CA : A → Type u} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] : CategoryTheory.HasSheafify (CategoryTheory.coherentTopology LightProfinite) A - LightProfinite.instWEqualsLocallyBijectiveCoherentTopology 📋 Mathlib.Condensed.Light.Instances
(A : Type u') [CategoryTheory.Category.{u, u'} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Limits.HasColimits A] {FA : A → A → Type v} {CA : A → Type u} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget A)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget A)] [(CategoryTheory.forget A).ReflectsIsomorphisms] : (CategoryTheory.coherentTopology LightProfinite).WEqualsLocallyBijective A - TopCat.Sheaf.instPreservesFiniteLimitsCompPresheafForgetStalkFunctor 📋 Mathlib.Topology.Sheaves.Abelian
{C : Type v} [CategoryTheory.Category.{u, v} C] [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.HasLimits C] {FC : C → C → Type u_1} {CC : C → Type u} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Abelian C] {X : TopCat} (p₀ : ↑X) : CategoryTheory.Limits.PreservesFiniteLimits ((TopCat.Sheaf.forget C X).comp (TopCat.Presheaf.stalkFunctor C p₀)) - TopCat.Sheaf.isZero_iff_stalkFunctor_obj_isZero 📋 Mathlib.Topology.Sheaves.Abelian
{C : Type v} [CategoryTheory.Category.{u, v} C] [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.HasLimits C] {FC : C → C → Type u_1} {CC : C → Type u} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Abelian C] {X : TopCat} (F : TopCat.Sheaf C X) : CategoryTheory.Limits.IsZero F ↔ ∀ (x : ↑X), CategoryTheory.Limits.IsZero (((TopCat.Sheaf.forget C X).comp (TopCat.Presheaf.stalkFunctor C x)).obj F) - TopCat.Sheaf.exact_iff_stalkFunctor_map_exact 📋 Mathlib.Topology.Sheaves.Abelian
{C : Type v} [CategoryTheory.Category.{u, v} C] [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.HasLimits C] {FC : C → C → Type u_1} {CC : C → Type u} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [instCC : CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] [CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget C)] [CategoryTheory.Abelian C] {X : TopCat} (S : CategoryTheory.ShortComplex (TopCat.Sheaf C X)) : S.Exact ↔ ∀ (x : ↑X), (S.map ((TopCat.Sheaf.forget C X).comp (TopCat.Presheaf.stalkFunctor C x))).Exact - TopCat.Presheaf.EtaleSpace.continuous_base 📋 Mathlib.Topology.Sheaves.EtaleSpace
{X : TopCat} {C : Type u} [CategoryTheory.Category.{v, u} C] {CC : C → Type v} {FC : C → C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] (F : TopCat.Presheaf C X) [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] : Continuous TopCat.Presheaf.EtaleSpace.base - TopCat.Presheaf.EtaleSpace.isCoveringMap_base 📋 Mathlib.Topology.Sheaves.EtaleSpace
{X : TopCat} {C : Type u} [CategoryTheory.Category.{v, u} C] {CC : C → Type v} {FC : C → C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] {F : TopCat.Presheaf C X} [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (hF_bij : ∀ (x : ↑X), ∃ U, x ∈ U ∧ ∀ (y : ↑X) (hyU : y ∈ U), Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom (F.germ U y hyU))) : IsCoveringMap TopCat.Presheaf.EtaleSpace.base - TopCat.Presheaf.EtaleSpace.exists_section_of_tendsto 📋 Mathlib.Topology.Sheaves.EtaleSpace
{X : TopCat} {C : Type u} [CategoryTheory.Category.{v, u} C] {CC : C → Type v} {FC : C → C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] {F : TopCat.Presheaf C X} [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] {α : Type u_1} {l : Filter α} {g : α → F.EtaleSpace} {g₀ : F.EtaleSpace} (h : Filter.Tendsto g l (nhds g₀)) : ∃ U, g₀.base ∈ U ∧ ∃ f, ∀ᶠ (a : α) in l, ∃ (ha : (g a).base ∈ U), (g a).germ = (CategoryTheory.ConcreteCategory.hom (F.germ U (g a).base ha)) f - TopCat.Presheaf.EtaleSpace.homeomorph 📋 Mathlib.Topology.Sheaves.EtaleSpace
{X : TopCat} {C : Type u} [CategoryTheory.Category.{v, u} C] {CC : C → Type v} {FC : C → C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] {F : TopCat.Presheaf C X} [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (U : TopologicalSpace.Opens ↑X) (hF_bij : ∀ (x : ↑X) (hx : x ∈ U), Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom (F.germ U x hx))) (x : ↑X) (hx : x ∈ U) : ↑(TopCat.Presheaf.EtaleSpace.base ⁻¹' ↑U) ≃ₜ ↥U × WithDiscreteTopology (CategoryTheory.ToType (F.stalk x)) - TopCat.Presheaf.EtaleSpace.homeomorph_apply_fst 📋 Mathlib.Topology.Sheaves.EtaleSpace
{X : TopCat} {C : Type u} [CategoryTheory.Category.{v, u} C] {CC : C → Type v} {FC : C → C → Type w} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] [CategoryTheory.Limits.HasColimits C] {F : TopCat.Presheaf C X} [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (U : TopologicalSpace.Opens ↑X) (hF_bij : ∀ (x : ↑X) (hx : x ∈ U), Function.Bijective ⇑(CategoryTheory.ConcreteCategory.hom (F.germ U x hx))) (x : ↑X) (hx : x ∈ U) (s : ↑(TopCat.Presheaf.EtaleSpace.base ⁻¹' ↑U)) : ((TopCat.Presheaf.EtaleSpace.homeomorph U hF_bij x hx) s).1 = ⟨(↑s).base, ⋯⟩ - TopCat.Presheaf.locally_surjective_iff_surjective_on_stalks 📋 Mathlib.Topology.Sheaves.LocallySurjective
{C : Type u} [CategoryTheory.Category.{v, u} C] {FC : C → C → Type u_1} {CC : C → Type v} [(X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory C FC] {X : TopCat} {ℱ 𝒢 : TopCat.Presheaf C X} [CategoryTheory.Limits.HasColimits C] [CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget C)] (T : ℱ ⟶ 𝒢) : TopCat.Presheaf.IsLocallySurjective T ↔ ∀ (x : ↑X), Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom ((TopCat.Presheaf.stalkFunctor C x).map T))
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