Theorems · Theorem · category theory

TopCat.Sheaf.existsUnique_gluing

∀ {C : Type u_1} [inst : CategoryTheory.Category.{v_1, u_1} C] {FC : C → C → Type u_2} {CC : C → Type u_3}
  [inst_1 : (X Y : C) → FunLike (FC X Y) (CC X) (CC Y)] [inst_2 : CategoryTheory.ConcreteCategory C FC]
  [CategoryTheory.Limits.HasLimitsOfSize.{x, x, v_1, u_1} C] [(CategoryTheory.forget C).ReflectsIsomorphisms]
  [CategoryTheory.Limits.PreservesLimitsOfSize.{x, x, v_1, u_3, u_1, u_3 + 1} (CategoryTheory.forget C)] {X : TopCat}
  (F : TopCat.Sheaf C X) {ι : Type u_4} (U : ι → TopologicalSpace.Opens ↑X)
  (sf : (i : ι) → CategoryTheory.ToType (F.obj.obj (Opposite.op (U i)))),
  TopCat.Presheaf.IsCompatible F.obj U sf → ∃! s, TopCat.Presheaf.IsGluing F.obj U sf s

A more convenient way of obtaining a unique gluing of sections for a sheaf.

Defined in

Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing

Cited by

5 results in Mathlib

Foundations

Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryFunLikeCategoryTheory.ConcreteCategoryCategoryTheory.Limits.HasLimitsOfSizeCategoryTheory.Functor.ReflectsIsomorphismsCategoryTheory.Limits.PreservesLimitsOfSize