Loogle!
Result
Found 149 declarations mentioning CategoryTheory.GlueData.U.
- CategoryTheory.GlueData.U 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) : self.J → C - CategoryTheory.GlueData.sigmaOpens 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasCoproduct D.U] : C - CategoryTheory.GlueData.diagram_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) : D.diagram.right = D.U - CategoryTheory.GlueData.f_id 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i : self.J) : CategoryTheory.IsIso (self.f i i) - CategoryTheory.GlueData.ι 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i : D.J) : D.U i ⟶ D.glued - CategoryTheory.GlueData.f 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j : self.J) : self.V (i, j) ⟶ self.U i - CategoryTheory.GlueData.f_mono 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j : self.J) : CategoryTheory.Mono (self.f i j) - CategoryTheory.GlueData.vPullbackCone 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) : CategoryTheory.Limits.PullbackCone (D.ι i) (D.ι j) - CategoryTheory.GlueData.f_hasPullback 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j k : self.J) : CategoryTheory.Limits.HasPullback (self.f i j) (self.f i k) - CategoryTheory.GlueData.π 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.HasColimits C] : D.sigmaOpens ⟶ D.glued - CategoryTheory.GlueData.π_epi 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.HasColimits C] : CategoryTheory.Epi D.π - CategoryTheory.GlueData.mapGlueData 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : CategoryTheory.GlueData C' - CategoryTheory.GlueData.mapGlueData_J 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : (D.mapGlueData F).J = D.J - CategoryTheory.GlueData.mapGlueData_U 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.mapGlueData F).U i = F.obj (D.U i) - CategoryTheory.GlueData.mapGlueData_V 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.mapGlueData F).V i = F.obj (D.V i) - CategoryTheory.GlueData.t' 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j k : self.J) : CategoryTheory.Limits.pullback (self.f i j) (self.f i k) ⟶ CategoryTheory.Limits.pullback (self.f j k) (self.f j i) - CategoryTheory.GlueData.t'_isIso 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j k : D.J) : CategoryTheory.IsIso (D.t' i j k) - CategoryTheory.GlueData.diagram_snd 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j : D.J) : D.diagram.snd (i, j) = CategoryTheory.CategoryStruct.comp (D.t i j) (D.f j i) - CategoryTheory.GlueData.hasColimit_mapGlueData_diagram 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : CategoryTheory.Limits.HasMulticoequalizer (D.mapGlueData F).diagram - CategoryTheory.GlueData.gluedIso 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : F.obj D.glued ≅ (D.mapGlueData F).glued - CategoryTheory.GlueData.diagramIso 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] : D.diagram.multispan.comp F ≅ (D.mapGlueData F).diagram.multispan - CategoryTheory.GlueData.mapGlueData_f 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i j : D.J) : (D.mapGlueData F).f i j = F.map (D.f i j) - CategoryTheory.GlueData.glue_condition 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) : CategoryTheory.CategoryStruct.comp (D.t i j) (CategoryTheory.CategoryStruct.comp (D.f j i) (D.ι j)) = CategoryTheory.CategoryStruct.comp (D.f i j) (D.ι i) - CategoryTheory.GlueData.mapGlueData_t 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i j : D.J) : (D.mapGlueData F).t i j = F.map (D.t i j) - CategoryTheory.GlueData.instHasPullbackMapF 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i j k : D.J) : CategoryTheory.Limits.HasPullback (F.map (D.f i j)) (F.map (D.f i k)) - CategoryTheory.GlueData.ι_gluedIso_inv 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : CategoryTheory.CategoryStruct.comp ((D.mapGlueData F).ι i) (D.gluedIso F).inv = F.map (D.ι i) - CategoryTheory.GlueData.ι_gluedIso_hom 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : CategoryTheory.CategoryStruct.comp (F.map (D.ι i)) (D.gluedIso F).hom = (D.mapGlueData F).ι i - CategoryTheory.GlueData.ι_jointly_surjective 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (F : CategoryTheory.Functor C (Type v)) [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (x : F.obj D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (F.map (D.ι i))) y = x - CategoryTheory.GlueData.diagramIso_app_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.diagramIso F).app (CategoryTheory.Limits.WalkingMultispan.right i) = CategoryTheory.Iso.refl ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.right i)) - CategoryTheory.GlueData.vPullbackConeIsLimitOfMap 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i j : D.J) [CategoryTheory.Limits.ReflectsLimit (CategoryTheory.Limits.cospan (D.ι i) (D.ι j)) F] (hc : CategoryTheory.Limits.IsLimit ((D.mapGlueData F).vPullbackCone i j)) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - CategoryTheory.GlueData.diagramIso_app_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.diagramIso F).app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.Iso.refl ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.left i)) - CategoryTheory.GlueData.t'_iij 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j : D.J) : D.t' i i j = (CategoryTheory.Limits.pullbackSymmetry (D.f i i) (D.f i j)).hom - CategoryTheory.GlueData.ι_gluedIso_inv_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) {Z : C'} (h : F.obj D.glued ⟶ Z) : CategoryTheory.CategoryStruct.comp ((D.mapGlueData F).ι i) (CategoryTheory.CategoryStruct.comp (D.gluedIso F).inv h) = CategoryTheory.CategoryStruct.comp (F.map (D.ι i)) h - CategoryTheory.GlueData.ι_gluedIso_hom_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [CategoryTheory.Limits.HasMulticoequalizer D.diagram] [CategoryTheory.Limits.PreservesColimit D.diagram.multispan F] [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) {Z : C'} (h : (D.mapGlueData F).glued ⟶ Z) : CategoryTheory.CategoryStruct.comp (F.map (D.ι i)) (CategoryTheory.CategoryStruct.comp (D.gluedIso F).hom h) = CategoryTheory.CategoryStruct.comp ((D.mapGlueData F).ι i) h - CategoryTheory.GlueData.diagramIso_inv_app_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.diagramIso F).inv.app (CategoryTheory.Limits.WalkingMultispan.right i) = CategoryTheory.CategoryStruct.id ((D.mapGlueData F).diagram.multispan.obj (CategoryTheory.Limits.WalkingMultispan.right i)) - CategoryTheory.GlueData.types_ι_jointly_surjective 📋 Mathlib.CategoryTheory.GlueData
(D : CategoryTheory.GlueData (Type v)) (x : D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i)) y = x - CategoryTheory.GlueData.diagramIso_hom_app_right 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J) : (D.diagramIso F).hom.app (CategoryTheory.Limits.WalkingMultispan.right i) = CategoryTheory.CategoryStruct.id ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.right i)) - CategoryTheory.GlueData.diagramIso_inv_app_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.diagramIso F).inv.app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.CategoryStruct.id ((D.mapGlueData F).diagram.multispan.obj (CategoryTheory.Limits.WalkingMultispan.left i)) - CategoryTheory.GlueData.diagramIso_hom_app_left 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i : D.J × D.J) : (D.diagramIso F).hom.app (CategoryTheory.Limits.WalkingMultispan.left i) = CategoryTheory.CategoryStruct.id ((D.diagram.multispan.comp F).obj (CategoryTheory.Limits.WalkingMultispan.left i)) - CategoryTheory.GlueData.t_fac 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j k : self.J) : CategoryTheory.CategoryStruct.comp (self.t' i j k) (CategoryTheory.Limits.pullback.snd (self.f j k) (self.f j i)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (self.f i j) (self.f i k)) (self.t i j) - CategoryTheory.GlueData.cocycle_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j k : self.J) {Z : C} (h : CategoryTheory.Limits.pullback (self.f i j) (self.f i k) ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.t' i j k) (CategoryTheory.CategoryStruct.comp (self.t' j k i) (CategoryTheory.CategoryStruct.comp (self.t' k i j) h)) = h - CategoryTheory.GlueData.t_fac_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j k : self.J) {Z : C} (h : self.V (j, i) ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.t' i j k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (self.f j k) (self.f j i)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (self.f i j) (self.f i k)) (CategoryTheory.CategoryStruct.comp (self.t i j) h) - CategoryTheory.GlueData.cocycle 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (self : CategoryTheory.GlueData C) (i j k : self.J) : CategoryTheory.CategoryStruct.comp (self.t' i j k) (CategoryTheory.CategoryStruct.comp (self.t' j k i) (self.t' k i j)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Limits.pullback (self.f i j) (self.f i k)) - CategoryTheory.GlueData.glue_condition_apply 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) [CategoryTheory.Limits.HasMulticoequalizer D.diagram] (i j : D.J) {F : C → C → Type uF} {carrier : C → Type w} {instFunLike : (X Y : C) → FunLike (F X Y) (carrier X) (carrier Y)} [inst : CategoryTheory.ConcreteCategory C F] (x : carrier (D.V (i, j))) : (CategoryTheory.ConcreteCategory.hom (D.ι j)) ((CategoryTheory.ConcreteCategory.hom (D.f j i)) ((CategoryTheory.ConcreteCategory.hom (D.t i j)) x)) = (CategoryTheory.ConcreteCategory.hom (D.ι i)) ((CategoryTheory.ConcreteCategory.hom (D.f i j)) x) - CategoryTheory.GlueData.t'_iji 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j : D.J) : D.t' i j i = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f i j) (D.f i i)) (CategoryTheory.CategoryStruct.comp (D.t i j) (CategoryTheory.inv (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j i)))) - CategoryTheory.GlueData.types_π_surjective 📋 Mathlib.CategoryTheory.GlueData
(D : CategoryTheory.GlueData (Type u_1)) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom D.π) - CategoryTheory.GlueData.t'_jii 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j : D.J) : D.t' j i i = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j i)) (CategoryTheory.CategoryStruct.comp (D.t j i) (CategoryTheory.inv (CategoryTheory.Limits.pullback.snd (D.f i i) (D.f i j)))) - CategoryTheory.GlueData.t'_comp_eq_pullbackSymmetry_assoc 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j k : D.J) {Z : C} (h : CategoryTheory.Limits.pullback (D.f i j) (D.f i k) ⟶ Z) : CategoryTheory.CategoryStruct.comp (D.t' j k i) (CategoryTheory.CategoryStruct.comp (D.t' k i j) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackSymmetry (D.f j k) (D.f j i)).hom (CategoryTheory.CategoryStruct.comp (D.t' j i k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackSymmetry (D.f i k) (D.f i j)).hom h)) - CategoryTheory.GlueData.t'_comp_eq_pullbackSymmetry 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j k : D.J) : CategoryTheory.CategoryStruct.comp (D.t' j k i) (D.t' k i j) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackSymmetry (D.f j k) (D.f j i)).hom (CategoryTheory.CategoryStruct.comp (D.t' j i k) (CategoryTheory.Limits.pullbackSymmetry (D.f i k) (D.f i j)).hom) - CategoryTheory.GlueData.t'_inv 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] (D : CategoryTheory.GlueData C) (i j k : D.J) : CategoryTheory.CategoryStruct.comp (D.t' i j k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullbackSymmetry (D.f j k) (D.f j i)).hom (CategoryTheory.CategoryStruct.comp (D.t' j i k) (CategoryTheory.Limits.pullbackSymmetry (D.f i k) (D.f i j)).hom)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Limits.pullback (D.f i j) (D.f i k)) - CategoryTheory.GlueData.mapGlueData_t' 📋 Mathlib.CategoryTheory.GlueData
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {C' : Type u₂} [CategoryTheory.Category.{v, u₂} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C') [∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F] (i j k : D.J) : (D.mapGlueData F).t' i j k = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.PreservesPullback.iso F (D.f i j) (D.f i k)).inv (CategoryTheory.CategoryStruct.comp (F.map (D.t' i j k)) (CategoryTheory.Limits.PreservesPullback.iso F (D.f j k) (D.f j i)).hom) - TopCat.GlueData.rel_equiv 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) : Equivalence D.Rel - TopCat.GlueData.Rel 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (a b : (i : D.J) × ↑(D.U i)) : Prop - TopCat.GlueData.ι_mono 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) : CategoryTheory.Mono (D.ι i) - TopCat.GlueData.mk 📋 Mathlib.Topology.Gluing
(toGlueData : CategoryTheory.GlueData TopCat) (f_open : ∀ (i j : toGlueData.J), Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (toGlueData.f i j))) : TopCat.GlueData - TopCat.GlueData.f_open 📋 Mathlib.Topology.Gluing
(self : TopCat.GlueData) (i j : self.J) : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (self.f i j)) - TopCat.GlueData.ι_fromOpenSubsetsGlue 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) (i : J) : CategoryTheory.CategoryStruct.comp ((TopCat.GlueData.ofOpenSubsets U).ι i) (TopCat.GlueData.fromOpenSubsetsGlue U) = (U i).inclusion' - TopCat.GlueData.ι_injective 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) : Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) - TopCat.GlueData.ι_isOpenEmbedding 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) - TopCat.GlueData.ι_jointly_surjective 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (x : ↑D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i)) y = x - TopCat.GlueData.open_image_open 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i : D.J) (U : TopologicalSpace.Opens ↑(D.U i)) : IsOpen (⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) '' ↑U) - TopCat.GlueData.isOpen_iff 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (U : Set ↑D.glued) : IsOpen U ↔ ∀ (i : D.J), IsOpen (⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) ⁻¹' U) - TopCat.GlueData.π_surjective 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom D.π) - TopCat.GlueData.ι_eq_iff_rel 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) (x : ↑(D.U i)) (y : ↑(D.U j)) : (CategoryTheory.ConcreteCategory.hom (D.ι i)) x = (CategoryTheory.ConcreteCategory.hom (D.ι j)) y ↔ D.Rel ⟨i, x⟩ ⟨j, y⟩ - TopCat.GlueData.preimage_range 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) : ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) ⁻¹' Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) = Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.f j i)) - TopCat.GlueData.preimage_image_eq_image 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) (U : Set ↑(D.U i)) : ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) ⁻¹' ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) '' U = ⇑(CategoryTheory.ConcreteCategory.hom (D.f j i)) '' ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))) ⁻¹' U - TopCat.GlueData.preimage_image_eq_image' 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) (U : Set ↑(D.U i)) : ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) ⁻¹' ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) '' U = ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (D.t i j) (D.f j i))) '' ⇑(CategoryTheory.ConcreteCategory.hom (D.f i j)) ⁻¹' U - TopCat.GlueData.ι_fromOpenSubsetsGlue_apply 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) (i : J) (x : ↑((TopCat.GlueData.ofOpenSubsets U).U i)) : (CategoryTheory.ConcreteCategory.hom (TopCat.GlueData.fromOpenSubsetsGlue U)) ((CategoryTheory.ConcreteCategory.hom ((TopCat.GlueData.ofOpenSubsets U).ι i)) x) = (CategoryTheory.ConcreteCategory.hom (U i).inclusion') x - TopCat.GlueData.image_inter 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) (i j : D.J) : Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i)) ∩ Set.range ⇑(CategoryTheory.ConcreteCategory.hom (D.ι j)) = Set.range ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp (D.f i j) (D.ι i))) - TopCat.GlueData.eqvGen_of_π_eq 📋 Mathlib.Topology.Gluing
(D : TopCat.GlueData) {x y : ↑(∐ D.U)} (h : (CategoryTheory.ConcreteCategory.hom D.π) x = (CategoryTheory.ConcreteCategory.hom D.π) y) : Relation.EqvGen (Function.Coequalizer.Rel ⇑(CategoryTheory.ConcreteCategory.hom D.diagram.fstSigmaMap) ⇑(CategoryTheory.ConcreteCategory.hom D.diagram.sndSigmaMap)) x y - TopCat.GlueData.ofOpenSubsets_toGlueData_U 📋 Mathlib.Topology.Gluing
{α : Type u} [TopologicalSpace α] {J : Type u} (U : J → TopologicalSpace.Opens α) (a✝ : { J := J, U := fun i => (TopologicalSpace.Opens.toTopCat (TopCat.of α)).obj (U i), V := fun x j => (TopologicalSpace.Opens.map (U x).inclusion').obj (U j), t := fun i j => TopCat.ofHom { toFun := fun x => ⟨⟨↑↑x, ⋯⟩, ⋯⟩, continuous_toFun := ⋯ }, V_id := ⋯, t_id := ⋯, t_inter := ⋯, cocycle := ⋯ }.J) : (TopCat.GlueData.ofOpenSubsets U).U a✝ = (TopologicalSpace.Opens.toTopCat (TopCat.of α)).obj (U a✝) - AlgebraicGeometry.LocallyRingedSpace.GlueData.mk 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(toGlueData : CategoryTheory.GlueData AlgebraicGeometry.LocallyRingedSpace) (f_open : ∀ (i j : toGlueData.J), AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (toGlueData.f i j)) : AlgebraicGeometry.LocallyRingedSpace.GlueData - AlgebraicGeometry.LocallyRingedSpace.GlueData.f_open 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(self : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i j : self.J) : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (self.f i j) - AlgebraicGeometry.PresheafedSpace.GlueData.mk 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (toGlueData : CategoryTheory.GlueData (AlgebraicGeometry.PresheafedSpace C)) (f_open : ∀ (i j : toGlueData.J), AlgebraicGeometry.PresheafedSpace.IsOpenImmersion (toGlueData.f i j)) : AlgebraicGeometry.PresheafedSpace.GlueData C - AlgebraicGeometry.SheafedSpace.GlueData.mk 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (toGlueData : CategoryTheory.GlueData (AlgebraicGeometry.SheafedSpace C)) (f_open : ∀ (i j : toGlueData.J), AlgebraicGeometry.SheafedSpace.IsOpenImmersion (toGlueData.f i j)) : AlgebraicGeometry.SheafedSpace.GlueData C - AlgebraicGeometry.LocallyRingedSpace.GlueData.instPreservesLimitSheafedSpaceCommRingCatWalkingCospanCospanFForgetToSheafedSpace 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i j k : D.J) : CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) AlgebraicGeometry.LocallyRingedSpace.forgetToSheafedSpace - AlgebraicGeometry.PresheafedSpace.GlueData.f_open 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (self : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j : self.J) : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion (self.f i j) - AlgebraicGeometry.SheafedSpace.GlueData.f_open 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (self : AlgebraicGeometry.SheafedSpace.GlueData C) (i j : self.J) : AlgebraicGeometry.SheafedSpace.IsOpenImmersion (self.f i j) - AlgebraicGeometry.PresheafedSpace.GlueData.diagramOverOpen 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.prod D.J))ᵒᵖ C - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_isOpenImmersion 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i : D.J) : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (D.ι i) - AlgebraicGeometry.LocallyRingedSpace.GlueData.vPullbackConeIsLimit 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.PresheafedSpace.GlueData.componentwise_diagram_π_isIso 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.IsIso (D.diagramOverOpenπ U i) - AlgebraicGeometry.PresheafedSpace.GlueData.diagramOverOpenπ 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) (j : D.J) : CategoryTheory.Limits.limit (D.diagramOverOpen U) ⟶ (D.diagramOverOpen U).obj (Opposite.op (CategoryTheory.Limits.WalkingMultispan.right j)) - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvAppπApp 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) (j : CategoryTheory.Limits.WalkingMultispan (CategoryTheory.Limits.MultispanShape.prod D.J)) : (D.U i).presheaf.obj (Opposite.op U) ⟶ (D.diagramOverOpen U).obj (Opposite.op j) - AlgebraicGeometry.SheafedSpace.GlueData.ιIsOpenImmersion 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : AlgebraicGeometry.SheafedSpace.IsOpenImmersion (D.ι i) - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvApp 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : (D.U i).presheaf.obj (Opposite.op U) ⟶ CategoryTheory.Limits.limit (D.diagramOverOpen U) - AlgebraicGeometry.PresheafedSpace.GlueData.ιIsOpenImmersion 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion (D.ι i) - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_jointly_surjective 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (x : ↑D.glued.toTopCat) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i).base) y = x - AlgebraicGeometry.SheafedSpace.GlueData.vPullbackConeIsLimit 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_isoSheafedSpace_inv 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toSheafedSpaceGlueData.ι i) D.isoSheafedSpace.inv = AlgebraicGeometry.LocallyRingedSpace.Hom.toShHom (D.ι i) - AlgebraicGeometry.PresheafedSpace.GlueData.vPullbackConeIsLimit 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.PresheafedSpace.GlueData.π_ιInvApp_eq_id 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.CategoryStruct.comp (D.diagramOverOpenπ U i) (CategoryTheory.CategoryStruct.comp (D.ιInvAppπEqMap U) (D.ιInvApp U)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Limits.limit (D.diagramOverOpen U)) - AlgebraicGeometry.PresheafedSpace.GlueData.π_ιInvApp_π 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.CategoryStruct.comp (D.diagramOverOpenπ U i) (CategoryTheory.CategoryStruct.comp (D.ιInvAppπEqMap U) (CategoryTheory.CategoryStruct.comp (D.ιInvApp U) (D.diagramOverOpenπ U j))) = D.diagramOverOpenπ U j - AlgebraicGeometry.LocallyRingedSpace.GlueData.ι_isoSheafedSpace_inv_assoc 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
(D : AlgebraicGeometry.LocallyRingedSpace.GlueData) (i : D.J) {Z : AlgebraicGeometry.SheafedSpace CommRingCat} (h : D.glued.toSheafedSpace ⟶ Z) : CategoryTheory.CategoryStruct.comp ((D.mapGlueData AlgebraicGeometry.LocallyRingedSpace.forgetToSheafedSpace).ι i) (CategoryTheory.CategoryStruct.comp D.isoSheafedSpace.inv h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.LocallyRingedSpace.Hom.toShHom (D.ι i)) h - AlgebraicGeometry.SheafedSpace.GlueData.ι_jointly_surjective 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (x : ↑↑D.glued.toPresheafedSpace) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i).hom.base) y = x - AlgebraicGeometry.SheafedSpace.GlueData.ι_isoPresheafedSpace_inv 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.SheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toPresheafedSpaceGlueData.ι i) D.isoPresheafedSpace.inv = (D.ι i).hom - AlgebraicGeometry.PresheafedSpace.GlueData.ι_isOpenEmbedding 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i : D.J) : Topology.IsOpenEmbedding ⇑(CategoryTheory.ConcreteCategory.hom (D.ι i).base) - AlgebraicGeometry.PresheafedSpace.GlueData.ι_jointly_surjective 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (x : ↑↑D.glued) : ∃ i y, (CategoryTheory.ConcreteCategory.hom (D.ι i).base) y = x - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvAppπEqMap 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : (D.U i).presheaf.obj (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.Limits.colimit.ι D.diagram.multispan (Opposite.unop (Opposite.op (CategoryTheory.Limits.WalkingMultispan.right i)))).base).obj (⋯.functor.obj U))) ⟶ (D.U i).presheaf.obj (Opposite.op U) - AlgebraicGeometry.PresheafedSpace.GlueData.pullback_base 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j k : D.J) (S : Set ↑↑(D.V (i, j))) : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k)).base) '' ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.pullback.fst (D.f i j) (D.f i k)).base) ⁻¹' S = ⇑(CategoryTheory.ConcreteCategory.hom (D.f i k).base) ⁻¹' ⇑(CategoryTheory.ConcreteCategory.hom (D.f i j).base) '' S - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : (D.U i).presheaf.obj (Opposite.op U) ⟶ (D.U j).presheaf.obj (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U))) - AlgebraicGeometry.PresheafedSpace.GlueData.ι_image_preimage_eq 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : (TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U) = (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (D.f j i)).obj ((TopologicalSpace.Opens.map (D.t j i).base).obj ((TopologicalSpace.Opens.map (D.f i j).base).obj U)) - AlgebraicGeometry.PresheafedSpace.GlueData.ιInvApp_π 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] {i : D.J} (U : TopologicalSpace.Opens ↑↑(D.U i)) : ∃ (eq : Opposite.op U = Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.Limits.colimit.ι D.diagram.multispan (Opposite.unop (Opposite.op (CategoryTheory.Limits.WalkingMultispan.right i)))).base).obj (⋯.functor.obj U))), CategoryTheory.CategoryStruct.comp (D.ιInvApp U) (D.diagramOverOpenπ U i) = (D.U i).presheaf.map (CategoryTheory.eqToHom eq) - AlgebraicGeometry.PresheafedSpace.GlueData.f_invApp_f_app_assoc 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.V (i, j))) {Z : C} (h : ((TopCat.Presheaf.pushforward C (D.f i k).base).obj (D.V (i, k)).presheaf).obj (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (D.f i j)).obj U)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (D.f i j) U) (CategoryTheory.CategoryStruct.comp ((D.f i k).c.app (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (D.f i j)).obj U))) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Limits.pullback.fst (D.f i j) (D.f i k)).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k)) ((TopologicalSpace.Opens.map (CategoryTheory.Limits.pullback.fst (D.f i j) (D.f i k)).base).1 U)) (CategoryTheory.CategoryStruct.comp ((D.V (i, k)).presheaf.map (CategoryTheory.eqToHom ⋯)) h)) - AlgebraicGeometry.PresheafedSpace.GlueData.f_invApp_f_app 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.V (i, j))) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (D.f i j) U) ((D.f i k).c.app (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (D.f i j)).obj U))) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Limits.pullback.fst (D.f i j) (D.f i k)).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.Limits.pullback.fst (D.f i j) (D.f i k)).base).1 (Opposite.unop (Opposite.op U)))))) ((D.V (i, k)).presheaf.map (CategoryTheory.eqToHom ⋯))) - AlgebraicGeometry.PresheafedSpace.GlueData.snd_invApp_t_app' 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(CategoryTheory.Limits.pullback (D.f i j) (D.f i k))) : ∃ (eq : (TopologicalSpace.Opens.map (D.t k i).base).op.obj (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k))).obj U)) = Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.fst (D.f k i) (D.f k j))).obj (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (D.t' k i j).base).1 (Opposite.unop (Opposite.op U))))))), CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k)) U) (CategoryTheory.CategoryStruct.comp ((D.t k i).c.app (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k))).obj U))) ((D.V (k, i)).presheaf.map (CategoryTheory.eqToHom eq))) = CategoryTheory.CategoryStruct.comp ((D.t' k i j).c.app (Opposite.op U)) (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.fst (D.f k i) (D.f k j)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (D.t' k i j).base).1 (Opposite.unop (Opposite.op U)))))) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap_app' 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : ∃ (eq : Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k))).obj (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) = (TopologicalSpace.Opens.map (D.f j k).base).op.obj (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))), CategoryTheory.CategoryStruct.comp (D.opensImagePreimageMap i j U) ((D.f j k).c.app (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) ((D.V (j, k)).presheaf.map (CategoryTheory.eqToHom eq))) - AlgebraicGeometry.PresheafedSpace.GlueData.snd_invApp_t_app_assoc 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(CategoryTheory.Limits.pullback (D.f i j) (D.f i k))) {Z : C} (h : ((TopCat.Presheaf.pushforward C (D.t k i).base).obj (D.V (k, i)).presheaf).obj (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k))).obj U)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k)) U) (CategoryTheory.CategoryStruct.comp ((D.t k i).c.app (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k))).obj U))) h) = CategoryTheory.CategoryStruct.comp ((D.t' k i j).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.fst (D.f k i) (D.f k j)) ((TopologicalSpace.Opens.map (D.t' k i j).base).1 U)) (CategoryTheory.CategoryStruct.comp ((D.V (k, i)).presheaf.map (CategoryTheory.eqToHom ⋯)) h)) - AlgebraicGeometry.PresheafedSpace.GlueData.snd_invApp_t_app 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(CategoryTheory.Limits.pullback (D.f i j) (D.f i k))) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k)) U) ((D.t k i).c.app (Opposite.op ((AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.opensFunctor (CategoryTheory.Limits.pullback.snd (D.f i j) (D.f i k))).obj U))) = CategoryTheory.CategoryStruct.comp ((D.t' k i j).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.fst (D.f k i) (D.f k j)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (D.t' k i j).base).1 (Opposite.unop (Opposite.op U)))))) ((D.V (k, i)).presheaf.map (CategoryTheory.eqToHom ⋯))) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap_app 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) : CategoryTheory.CategoryStruct.comp (D.opensImagePreimageMap i j U) ((D.f j k).c.app (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) ((D.V (j, k)).presheaf.map (CategoryTheory.eqToHom ⋯))) - AlgebraicGeometry.PresheafedSpace.GlueData.opensImagePreimageMap_app_assoc 📋 Mathlib.Geometry.RingedSpace.PresheafedSpace.Gluing
{C : Type u} [CategoryTheory.Category.{v, u} C] (D : AlgebraicGeometry.PresheafedSpace.GlueData C) [CategoryTheory.Limits.HasLimits C] (i j k : D.J) (U : TopologicalSpace.Opens ↑↑(D.U i)) {X' : C} (f' : ((TopCat.Presheaf.pushforward C (D.f j k).base).obj (D.V (j, k)).presheaf).obj (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U))) ⟶ X') : CategoryTheory.CategoryStruct.comp (D.opensImagePreimageMap i j U) (CategoryTheory.CategoryStruct.comp ((D.f j k).c.app (Opposite.op ((TopologicalSpace.Opens.map (D.ι j).base).obj (⋯.functor.obj U)))) f') = CategoryTheory.CategoryStruct.comp ((CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).c.app (Opposite.op U)) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.PresheafedSpace.IsOpenImmersion.invApp (CategoryTheory.Limits.pullback.snd (D.f j i) (D.f j k)) (Opposite.unop (Opposite.op ((TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (D.f j i) (D.f j k)) (CategoryTheory.CategoryStruct.comp (D.t j i) (D.f i j))).base).1 (Opposite.unop (Opposite.op U)))))) (CategoryTheory.CategoryStruct.comp ((D.V (j, k)).presheaf.map (CategoryTheory.eqToHom ⋯)) f')) - AlgebraicGeometry.Scheme.GlueData.ι 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : D.U i ⟶ D.glued - AlgebraicGeometry.Scheme.GlueData.ι_isOpenImmersion 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : AlgebraicGeometry.IsOpenImmersion (D.ι i) - AlgebraicGeometry.Scheme.GlueData.openCover_X 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (a✝ : D.J) : D.openCover.X a✝ = D.U a✝ - AlgebraicGeometry.Scheme.GlueData.vPullbackCone 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : CategoryTheory.Limits.PullbackCone (D.ι i) (D.ι j) - AlgebraicGeometry.Scheme.Cover.gluedCover_U 📋 Mathlib.AlgebraicGeometry.Gluing
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (i : 𝒰.I₀) : (AlgebraicGeometry.Scheme.Cover.gluedCover 𝒰).U i = 𝒰.X i - AlgebraicGeometry.Scheme.GlueData.mk 📋 Mathlib.AlgebraicGeometry.Gluing
(toGlueData : CategoryTheory.GlueData AlgebraicGeometry.Scheme) (f_open : ∀ (i j : toGlueData.J), AlgebraicGeometry.IsOpenImmersion (toGlueData.f i j)) : AlgebraicGeometry.Scheme.GlueData - AlgebraicGeometry.Scheme.GlueData.openCover_f 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : D.openCover.f i = D.ι i - AlgebraicGeometry.Scheme.GlueData.f_open 📋 Mathlib.AlgebraicGeometry.Gluing
(self : AlgebraicGeometry.Scheme.GlueData) (i j : self.J) : AlgebraicGeometry.IsOpenImmersion (self.f i j) - AlgebraicGeometry.Scheme.GlueData.vPullbackConeIsLimit 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : CategoryTheory.Limits.IsLimit (D.vPullbackCone i j) - AlgebraicGeometry.Scheme.GlueData.instIsOpenImmersionFLocallyRingedSpaceToLocallyRingedSpaceGlueData 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (D.toLocallyRingedSpaceGlueData.f i j) - AlgebraicGeometry.Scheme.GlueData.Rel 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (a b : (i : D.J) × ↥(D.U i)) : Prop - AlgebraicGeometry.Scheme.Cover.ι_fromGlued 📋 Mathlib.AlgebraicGeometry.Gluing
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (x : 𝒰.I₀) : CategoryTheory.CategoryStruct.comp ((AlgebraicGeometry.Scheme.Cover.gluedCover 𝒰).ι x) (AlgebraicGeometry.Scheme.Cover.fromGlued 𝒰) = 𝒰.f x - AlgebraicGeometry.Scheme.GlueData.instIsOpenImmersionCommRingCatFSheafedSpaceToSheafedSpaceGlueDataToLocallyRingedSpaceGlueData 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : AlgebraicGeometry.SheafedSpace.IsOpenImmersion (D.toLocallyRingedSpaceGlueData.toSheafedSpaceGlueData.f i j) - AlgebraicGeometry.Scheme.GlueData.instIsOpenImmersionCommRingCatFPresheafedSpaceToPresheafedSpaceGlueDataToSheafedSpaceGlueDataToLocallyRingedSpaceGlueData 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : AlgebraicGeometry.PresheafedSpace.IsOpenImmersion (D.toLocallyRingedSpaceGlueData.toSheafedSpaceGlueData.toPresheafedSpaceGlueData.f i j) - AlgebraicGeometry.Scheme.Cover.ι_fromGlued_assoc 📋 Mathlib.AlgebraicGeometry.Gluing
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (x : 𝒰.I₀) {Z : AlgebraicGeometry.Scheme} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp ((AlgebraicGeometry.Scheme.Cover.gluedCover 𝒰).ι x) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Cover.fromGlued 𝒰) h) = CategoryTheory.CategoryStruct.comp (𝒰.f x) h - AlgebraicGeometry.Scheme.GlueData.instIsOpenImmersionιLocallyRingedSpaceToLocallyRingedSpaceGlueData 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : AlgebraicGeometry.LocallyRingedSpace.IsOpenImmersion (D.toLocallyRingedSpaceGlueData.ι i) - AlgebraicGeometry.Scheme.GlueData.glue_condition 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) : CategoryTheory.CategoryStruct.comp (D.t i j) (CategoryTheory.CategoryStruct.comp (D.f j i) (D.ι j)) = CategoryTheory.CategoryStruct.comp (D.f i j) (D.ι i) - AlgebraicGeometry.Scheme.GlueData.glue_condition_assoc 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) {Z : AlgebraicGeometry.Scheme} (h : D.glued ⟶ Z) : CategoryTheory.CategoryStruct.comp (D.t i j) (CategoryTheory.CategoryStruct.comp (D.f j i) (CategoryTheory.CategoryStruct.comp (D.ι j) h)) = CategoryTheory.CategoryStruct.comp (D.f i j) (CategoryTheory.CategoryStruct.comp (D.ι i) h) - AlgebraicGeometry.Scheme.GlueData.ι_isoLocallyRingedSpace_inv 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toLocallyRingedSpaceGlueData.ι i) D.isoLocallyRingedSpace.inv = AlgebraicGeometry.Scheme.Hom.toLRSHom (D.ι i) - AlgebraicGeometry.Scheme.GlueData.ι_jointly_surjective 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (x : ↥D.glued) : ∃ i y, (D.ι i) y = x - AlgebraicGeometry.Scheme.GlueData.isOpen_iff 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (U : Set ↥D.glued) : IsOpen U ↔ ∀ (i : D.J), IsOpen (⇑(D.ι i) ⁻¹' U) - AlgebraicGeometry.Scheme.GlueData.ι_isoCarrier_inv 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : CategoryTheory.CategoryStruct.comp (D.toLocallyRingedSpaceGlueData.toSheafedSpaceGlueData.toPresheafedSpaceGlueData.toTopGlueData.ι i) D.isoCarrier.inv = (D.ι i).base - AlgebraicGeometry.Scheme.GlueData.ι_eq_iff 📋 Mathlib.AlgebraicGeometry.Gluing
(D : AlgebraicGeometry.Scheme.GlueData) (i j : D.J) (x : ↥(D.U i)) (y : ↥(D.U j)) : (D.ι i) x = (D.ι j) y ↔ D.Rel ⟨i, x⟩ ⟨j, y⟩ - AlgebraicGeometry.Scheme.Pullback.gluing_U 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i : 𝒰.I₀) : (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).U i = CategoryTheory.Limits.pullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g - AlgebraicGeometry.Scheme.Pullback.gluing_ι 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (j : 𝒰.I₀) : (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j = CategoryTheory.Limits.Multicoequalizer.π (AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).diagram j - AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i j : 𝒰.I₀) : CategoryTheory.Limits.pullback (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) ((AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j) ⟶ AlgebraicGeometry.Scheme.Pullback.v 𝒰 f g j i - AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV_fst 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i j : 𝒰.I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV 𝒰 f g i j) (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f j) f) g) (𝒰.f j)) (𝒰.f i)) = CategoryTheory.Limits.pullback.snd (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) ((AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j) - AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV_fst_assoc 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i j : 𝒰.I₀) {Z✝ : AlgebraicGeometry.Scheme} (h : CategoryTheory.Limits.pullback (CategoryTheory.CategoryStruct.comp (𝒰.f j) f) g ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV 𝒰 f g i j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f j) f) g) (𝒰.f j)) (𝒰.f i)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) ((AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j)) h - AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV_snd 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i j : 𝒰.I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV 𝒰 f g i j) (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f j) f) g) (𝒰.f j)) (𝒰.f i)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) ((AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j)) (CategoryTheory.Limits.pullback.snd (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) - AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV_snd_assoc 📋 Mathlib.AlgebraicGeometry.Pullbacks
{X Y Z : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (f : X ⟶ Z) (g : Y ⟶ Z) [∀ (i : 𝒰.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) g] (i j : 𝒰.I₀) {Z✝ : AlgebraicGeometry.Scheme} (h : 𝒰.X i ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Pullback.pullbackFstιToV 𝒰 f g i j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp (𝒰.f j) f) g) (𝒰.f j)) (𝒰.f i)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.Limits.pullback.fst (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) ((AlgebraicGeometry.Scheme.Pullback.gluing 𝒰 f g).ι j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (AlgebraicGeometry.Scheme.Pullback.p1 𝒰 f g) (𝒰.f i)) h) - AlgebraicGeometry.Scheme.IdealSheafData.glueData_U 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.glueData.U U = I.glueDataObj U - AlgebraicGeometry.Scheme.GlueData.oneHypercover_X 📋 Mathlib.AlgebraicGeometry.GluingOneHypercover
(D : AlgebraicGeometry.Scheme.GlueData) (a✝ : D.J) : D.oneHypercover.X a✝ = D.U a✝ - AlgebraicGeometry.Scheme.GlueData.oneHypercover_f 📋 Mathlib.AlgebraicGeometry.GluingOneHypercover
(D : AlgebraicGeometry.Scheme.GlueData) (i : D.J) : D.oneHypercover.f i = D.ι i - AlgebraicGeometry.Scheme.GlueData.oneHypercover_p₁ 📋 Mathlib.AlgebraicGeometry.GluingOneHypercover
(D : AlgebraicGeometry.Scheme.GlueData) (i₁ i₂ : D.J) (x✝ : PUnit.{u + 1}) : D.oneHypercover.p₁ x✝ = D.f i₁ i₂ - AlgebraicGeometry.Scheme.GlueData.oneHypercover_p₂ 📋 Mathlib.AlgebraicGeometry.GluingOneHypercover
(D : AlgebraicGeometry.Scheme.GlueData) (i₁ i₂ : D.J) (x✝ : PUnit.{u + 1}) : D.oneHypercover.p₂ x✝ = CategoryTheory.CategoryStruct.comp (D.t i₁ i₂) (D.f i₂ i₁) - AlgebraicGeometry.Scheme.GlueData.sheafValGluedMk 📋 Mathlib.AlgebraicGeometry.GluingOneHypercover
(D : AlgebraicGeometry.Scheme.GlueData) {F : CategoryTheory.Sheaf AlgebraicGeometry.Scheme.zariskiTopology (Type v)} (s : (j : D.J) → F.obj.obj (Opposite.op (D.U j))) (h : ∀ (i j : D.J), (CategoryTheory.ConcreteCategory.hom (F.obj.map (D.f i j).op)) (s i) = (CategoryTheory.ConcreteCategory.hom (F.obj.map (CategoryTheory.CategoryStruct.comp (D.f j i).op (D.t i j).op))) (s j)) : F.obj.obj (Opposite.op D.glued) - AlgebraicGeometry.Scheme.GlueData.sheafValGluedMk_val 📋 Mathlib.AlgebraicGeometry.GluingOneHypercover
(D : AlgebraicGeometry.Scheme.GlueData) {F : CategoryTheory.Sheaf AlgebraicGeometry.Scheme.zariskiTopology (Type v)} (s : (j : D.J) → F.obj.obj (Opposite.op (D.U j))) (h : ∀ (i j : D.J), (CategoryTheory.ConcreteCategory.hom (F.obj.map (D.f i j).op)) (s i) = (CategoryTheory.ConcreteCategory.hom (F.obj.map (CategoryTheory.CategoryStruct.comp (D.f j i).op (D.t i j).op))) (s j)) (j : D.J) : (CategoryTheory.ConcreteCategory.hom (F.obj.map (D.ι j).op)) (D.sheafValGluedMk s h) = s j - AlgebraicGeometry.Scheme.LocalRepresentability.glueData_U 📋 Mathlib.AlgebraicGeometry.Sites.Representability
{F : CategoryTheory.Sheaf AlgebraicGeometry.Scheme.zariskiTopology (Type u)} {ι : Type u} {X : ι → AlgebraicGeometry.Scheme} {f : (i : ι) → CategoryTheory.yoneda.obj (X i) ⟶ F.obj} (hf : ∀ (i : ι), AlgebraicGeometry.IsOpenImmersion.presheaf (f i)) (a✝ : ι) : (AlgebraicGeometry.Scheme.LocalRepresentability.glueData hf).U a✝ = X a✝
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