category_theory.sites.induced_topology

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

ba43124c

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

2ed2c631

bump to nightly-2024-04-14-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

f736ea6b

Diff

@@ -61,7 +61,8 @@ def LocallyCoverDense (K : GrothendieckTopology D) (G : C ⥤ D) : Prop :=
 
 namespace LocallyCoverDense
 
-variable [Full G] [Faithful G] (Hld : LocallyCoverDense K G)
+variable [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G]
+  (Hld : LocallyCoverDense K G)
 
 #print CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback /-
 theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
@@ -124,7 +125,7 @@ theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K
 end LocallyCoverDense
 
 #print CategoryTheory.Functor.locallyCoverDense_of_isCoverDense /-
-theorem Functor.locallyCoverDense_of_isCoverDense [Full G]
+theorem Functor.locallyCoverDense_of_isCoverDense [CategoryTheory.Functor.Full G]
     (H : CategoryTheory.Functor.IsCoverDense K G) : LocallyCoverDense K G :=
   by
   intro X T
@@ -140,8 +141,9 @@ theorem Functor.locallyCoverDense_of_isCoverDense [Full G]
 #print CategoryTheory.Functor.inducedTopologyOfIsCoverDense /-
 /-- Given a fully faithful cover-dense functor `G : C ⥤ (D, K)`, we may induce a topology on `C`.
 -/
-abbrev Functor.inducedTopologyOfIsCoverDense [Full G] [Faithful G]
-    (H : CategoryTheory.Functor.IsCoverDense K G) : GrothendieckTopology C :=
+abbrev Functor.inducedTopologyOfIsCoverDense [CategoryTheory.Functor.Full G]
+    [CategoryTheory.Functor.Faithful G] (H : CategoryTheory.Functor.IsCoverDense K G) :
+    GrothendieckTopology C :=
   H.LocallyCoverDense.inducedTopology
 #align category_theory.cover_dense.induced_topology CategoryTheory.Functor.inducedTopologyOfIsCoverDense
 -/
@@ -178,9 +180,9 @@ variable (A : Type u) [Category.{v} A]
 This is known as the comparison lemma. It requires that the sites are small and the value category
 is complete.
 -/
-noncomputable def Functor.sheafInducedTopologyEquivOfIsCoverDense [Full G] [Faithful G]
-    (H : CategoryTheory.Functor.IsCoverDense K G) [HasLimits A] :
-    Sheaf H.inducedTopology A ≌ Sheaf K A :=
+noncomputable def Functor.sheafInducedTopologyEquivOfIsCoverDense [CategoryTheory.Functor.Full G]
+    [CategoryTheory.Functor.Faithful G] (H : CategoryTheory.Functor.IsCoverDense K G)
+    [HasLimits A] : Sheaf H.inducedTopology A ≌ Sheaf K A :=
   H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopology_coverPreserving
     H.LocallyCoverDense.inducedTopology_isCocontinuous
 #align category_theory.cover_dense.Sheaf_equiv CategoryTheory.Functor.sheafInducedTopologyEquivOfIsCoverDense

2ed2c631

bump to nightly-2023-11-29-11

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

049e2cad

Diff

@@ -106,11 +106,12 @@ def inducedTopology : GrothendieckTopology C
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 -/
 
-#print CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting /-
+#print CategoryTheory.LocallyCoverDense.inducedTopology_isCocontinuous /-
 /-- `G` is cover-lifting wrt the induced topology. -/
-theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
+theorem inducedTopology_isCocontinuous :
+    CategoryTheory.Functor.IsCocontinuous Hld.inducedTopology K G :=
   ⟨fun _ S hS => Hld ⟨S, hS⟩⟩
-#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
+#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_isCocontinuous
 -/
 
 #print CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving /-
@@ -122,8 +123,9 @@ theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K
 
 end LocallyCoverDense
 
-#print CategoryTheory.CoverDense.locallyCoverDense /-
-theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCoverDense K G :=
+#print CategoryTheory.Functor.locallyCoverDense_of_isCoverDense /-
+theorem Functor.locallyCoverDense_of_isCoverDense [Full G]
+    (H : CategoryTheory.Functor.IsCoverDense K G) : LocallyCoverDense K G :=
   by
   intro X T
   refine' K.superset_covering _ (K.bind_covering T.property fun Y f Hf => H.is_cover Y)
@@ -132,16 +134,16 @@ theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCove
   constructor
   simpa using T.val.downward_closed hf f'
   simp
-#align category_theory.cover_dense.locally_cover_dense CategoryTheory.CoverDense.locallyCoverDense
+#align category_theory.cover_dense.locally_cover_dense CategoryTheory.Functor.locallyCoverDense_of_isCoverDense
 -/
 
-#print CategoryTheory.CoverDense.inducedTopology /-
+#print CategoryTheory.Functor.inducedTopologyOfIsCoverDense /-
 /-- Given a fully faithful cover-dense functor `G : C ⥤ (D, K)`, we may induce a topology on `C`.
 -/
-abbrev CoverDense.inducedTopology [Full G] [Faithful G] (H : CoverDense K G) :
-    GrothendieckTopology C :=
+abbrev Functor.inducedTopologyOfIsCoverDense [Full G] [Faithful G]
+    (H : CategoryTheory.Functor.IsCoverDense K G) : GrothendieckTopology C :=
   H.LocallyCoverDense.inducedTopology
-#align category_theory.cover_dense.induced_topology CategoryTheory.CoverDense.inducedTopology
+#align category_theory.cover_dense.induced_topology CategoryTheory.Functor.inducedTopologyOfIsCoverDense
 -/
 
 variable (J)
@@ -170,17 +172,18 @@ variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 
 variable (A : Type u) [Category.{v} A]
 
-#print CategoryTheory.CoverDense.sheafEquiv /-
+#print CategoryTheory.Functor.sheafInducedTopologyEquivOfIsCoverDense /-
 /-- Cover-dense functors induces an equivalence of categories of sheaves.
 
 This is known as the comparison lemma. It requires that the sites are small and the value category
 is complete.
 -/
-noncomputable def CoverDense.sheafEquiv [Full G] [Faithful G] (H : CoverDense K G) [HasLimits A] :
+noncomputable def Functor.sheafInducedTopologyEquivOfIsCoverDense [Full G] [Faithful G]
+    (H : CategoryTheory.Functor.IsCoverDense K G) [HasLimits A] :
     Sheaf H.inducedTopology A ≌ Sheaf K A :=
   H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopology_coverPreserving
-    H.LocallyCoverDense.inducedTopology_coverLifting
-#align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquiv
+    H.LocallyCoverDense.inducedTopology_isCocontinuous
+#align category_theory.cover_dense.Sheaf_equiv CategoryTheory.Functor.sheafInducedTopologyEquivOfIsCoverDense
 -/
 
 end SmallSite

2ed2c631

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2021 Andrew Yang. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Andrew Yang
 -/
-import Mathbin.CategoryTheory.Sites.DenseSubsite
+import CategoryTheory.Sites.DenseSubsite
 
 #align_import category_theory.sites.induced_topology from "leanprover-community/mathlib"@"2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe"

2ed2c631

bump to nightly-2023-08-02-01

mathlib commit https://github.com/leanprover-community/mathlib/commit/63721b2c3eba6c325ecf8ae8cca27155a4f6306f

7aca3f15

Diff

@@ -102,7 +102,7 @@ def inducedTopology : GrothendieckTopology C
     apply K.pullback_stable i
     refine' K.superset_covering _ (H' hg)
     rintro W _ ⟨Z', g', i', hg, rfl⟩
-    use ⟨Z', g' ≫ g, i', hg, by simp⟩
+    use⟨Z', g' ≫ g, i', hg, by simp⟩
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 -/

2ed2c631

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2021 Andrew Yang. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Andrew Yang
-
-! This file was ported from Lean 3 source module category_theory.sites.induced_topology
-! leanprover-community/mathlib commit 2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.CategoryTheory.Sites.DenseSubsite
 
+#align_import category_theory.sites.induced_topology from "leanprover-community/mathlib"@"2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe"
+
 /-!
 # Induced Topology

2ed2c631

bump to nightly-2023-06-20-01

mathlib commit https://github.com/leanprover-community/mathlib/commit/2a0ce625dbb0ffbc7d1316597de0b25c1ec75303

9b351f8c

Diff

@@ -154,7 +154,7 @@ theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget
   by
   intro Y T
   convert T.property
-  ext (Z f)
+  ext Z f
   constructor
   · rintro ⟨_, _, g', hg, rfl⟩
     exact T.val.downward_closed hg g'

2ed2c631

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -66,8 +66,7 @@ namespace LocallyCoverDense
 
 variable [Full G] [Faithful G] (Hld : LocallyCoverDense K G)
 
-include Hld
-
+#print CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback /-
 theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
     K _ (S.functorPushforward G) ↔ ∃ T : K (G.obj X), T.val.functorPullback G = S :=
   by
@@ -77,6 +76,7 @@ theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
   · rintro ⟨T, rfl⟩
     exact Hld T
 #align category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback
+-/
 
 #print CategoryTheory.LocallyCoverDense.inducedTopology /-
 /-- If a functor `G : C ⥤ (D, K)` is fully faithful and locally dense,
@@ -109,18 +109,23 @@ def inducedTopology : GrothendieckTopology C
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 -/
 
+#print CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting /-
 /-- `G` is cover-lifting wrt the induced topology. -/
 theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
   ⟨fun _ S hS => Hld ⟨S, hS⟩⟩
 #align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
+-/
 
+#print CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving /-
 /-- `G` is cover-preserving wrt the induced topology. -/
 theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
   ⟨fun _ S hS => hS⟩
 #align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving
+-/
 
 end LocallyCoverDense
 
+#print CategoryTheory.CoverDense.locallyCoverDense /-
 theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCoverDense K G :=
   by
   intro X T
@@ -131,6 +136,7 @@ theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCove
   simpa using T.val.downward_closed hf f'
   simp
 #align category_theory.cover_dense.locally_cover_dense CategoryTheory.CoverDense.locallyCoverDense
+-/
 
 #print CategoryTheory.CoverDense.inducedTopology /-
 /-- Given a fully faithful cover-dense functor `G : C ⥤ (D, K)`, we may induce a topology on `C`.
@@ -143,6 +149,7 @@ abbrev CoverDense.inducedTopology [Full G] [Faithful G] (H : CoverDense K G) :
 
 variable (J)
 
+#print CategoryTheory.over_forget_locallyCoverDense /-
 theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget X) :=
   by
   intro Y T
@@ -154,6 +161,7 @@ theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget
   · intro hf
     exact ⟨over.mk (f ≫ Y.hom), over.hom_mk f, 𝟙 _, hf, (category.id_comp _).symm⟩
 #align category_theory.over_forget_locally_cover_dense CategoryTheory.over_forget_locallyCoverDense
+-/
 
 end
 
@@ -165,6 +173,7 @@ variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 
 variable (A : Type u) [Category.{v} A]
 
+#print CategoryTheory.CoverDense.sheafEquiv /-
 /-- Cover-dense functors induces an equivalence of categories of sheaves.
 
 This is known as the comparison lemma. It requires that the sites are small and the value category
@@ -175,6 +184,7 @@ noncomputable def CoverDense.sheafEquiv [Full G] [Faithful G] (H : CoverDense K
   H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopology_coverPreserving
     H.LocallyCoverDense.inducedTopology_coverLifting
 #align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquiv
+-/
 
 end SmallSite

2ed2c631

bump to nightly-2023-05-28-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

ba5d8b97

Diff

@@ -68,9 +68,6 @@ variable [Full G] [Faithful G] (Hld : LocallyCoverDense K G)
 
 include Hld
 
-/- warning: category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback -> CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullbackₓ'. -/
 theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
     K _ (S.functorPushforward G) ↔ ∃ T : K (G.obj X), T.val.functorPullback G = S :=
   by
@@ -112,23 +109,11 @@ def inducedTopology : GrothendieckTopology C
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 -/
 
-/- warning: category_theory.locally_cover_dense.induced_topology_cover_lifting -> CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G), CategoryTheory.CoverLifting.{u1, u2, u3, u4} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u1, u2, u3, u4} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
-but is expected to have type
-  forall {C : Type.{u4}} [_inst_1 : CategoryTheory.Category.{u3, u4} C] {D : Type.{u2}} [_inst_2 : CategoryTheory.Category.{u1, u2} D] {G : CategoryTheory.Functor.{u3, u1, u4, u2} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u1, u2} D _inst_2} [_inst_4 : CategoryTheory.Full.{u3, u1, u4, u2} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u3, u1, u4, u2} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u4, u3, u2, u1} C _inst_1 D _inst_2 K G), CategoryTheory.CoverLifting.{u4, u3, u2, u1} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u4, u3, u2, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
-Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLiftingₓ'. -/
 /-- `G` is cover-lifting wrt the induced topology. -/
 theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
   ⟨fun _ S hS => Hld ⟨S, hS⟩⟩
 #align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
 
-/- warning: category_theory.locally_cover_dense.induced_topology_cover_preserving -> CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G), CategoryTheory.CoverPreserving.{u2, u4, u1, u3} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u1, u2, u3, u4} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u4, u2} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.Category.{u3, u1} D] {G : CategoryTheory.Functor.{u4, u3, u2, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u3, u1} D _inst_2} [_inst_4 : CategoryTheory.Full.{u4, u3, u2, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u4, u3, u2, u1} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u2, u4, u1, u3} C _inst_1 D _inst_2 K G), CategoryTheory.CoverPreserving.{u4, u3, u2, u1} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u2, u4, u1, u3} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
-Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopology_coverPreservingₓ'. -/
 /-- `G` is cover-preserving wrt the induced topology. -/
 theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
   ⟨fun _ S hS => hS⟩
@@ -136,12 +121,6 @@ theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K
 
 end LocallyCoverDense
 
-/- warning: category_theory.cover_dense.locally_cover_dense -> CategoryTheory.CoverDense.locallyCoverDense is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G], (CategoryTheory.CoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G) -> (CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G)
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u4, u2} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.Category.{u3, u1} D] {G : CategoryTheory.Functor.{u4, u3, u2, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u3, u1} D _inst_2} [_inst_4 : CategoryTheory.Full.{u4, u3, u2, u1} C _inst_1 D _inst_2 G], (CategoryTheory.CoverDense.{u2, u4, u1, u3} C _inst_1 D _inst_2 K G) -> (CategoryTheory.LocallyCoverDense.{u2, u4, u1, u3} C _inst_1 D _inst_2 K G)
-Case conversion may be inaccurate. Consider using '#align category_theory.cover_dense.locally_cover_dense CategoryTheory.CoverDense.locallyCoverDenseₓ'. -/
 theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCoverDense K G :=
   by
   intro X T
@@ -164,12 +143,6 @@ abbrev CoverDense.inducedTopology [Full G] [Faithful G] (H : CoverDense K G) :
 
 variable (J)
 
-/- warning: category_theory.over_forget_locally_cover_dense -> CategoryTheory.over_forget_locallyCoverDense is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] (J : CategoryTheory.GrothendieckTopology.{u2, u1} C _inst_1) (X : C), CategoryTheory.LocallyCoverDense.{max u1 u2, u2, u1, u2} (CategoryTheory.Over.{u2, u1} C _inst_1 X) (CategoryTheory.commaCategory.{u2, u2, u2, u1, u2, u1} C _inst_1 (CategoryTheory.Discrete.{u2} PUnit.{succ u2}) (CategoryTheory.discreteCategory.{u2} PUnit.{succ u2}) C _inst_1 (CategoryTheory.Functor.id.{u2, u1} C _inst_1) (CategoryTheory.Functor.fromPUnit.{u2, u1} C _inst_1 X)) C _inst_1 J (CategoryTheory.Over.forget.{u2, u1} C _inst_1 X)
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (J : CategoryTheory.GrothendieckTopology.{u1, u2} C _inst_1) (X : C), CategoryTheory.LocallyCoverDense.{max u2 u1, u1, u2, u1} (CategoryTheory.Over.{u1, u2} C _inst_1 X) (CategoryTheory.instCategoryOver.{u1, u2} C _inst_1 X) C _inst_1 J (CategoryTheory.Over.forget.{u1, u2} C _inst_1 X)
-Case conversion may be inaccurate. Consider using '#align category_theory.over_forget_locally_cover_dense CategoryTheory.over_forget_locallyCoverDenseₓ'. -/
 theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget X) :=
   by
   intro Y T
@@ -192,12 +165,6 @@ variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 
 variable (A : Type u) [Category.{v} A]
 
-/- warning: category_theory.cover_dense.Sheaf_equiv -> CategoryTheory.CoverDense.sheafEquiv is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.SmallCategory.{u1} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.SmallCategory.{u1} D] {G : CategoryTheory.Functor.{u1, u1, u1, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u1, u1} D _inst_2} (A : Type.{u2}) [_inst_3 : CategoryTheory.Category.{u1, u2} A] [_inst_4 : CategoryTheory.Full.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] (H : CategoryTheory.CoverDense.{u1, u1, u1, u1} C _inst_1 D _inst_2 K G) [_inst_6 : CategoryTheory.Limits.HasLimits.{u1, u2} A _inst_3], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Sheaf.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.CategoryTheory.category.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.{u1, u1, u1, u2} D _inst_2 K A _inst_3) (CategoryTheory.Sheaf.CategoryTheory.category.{u1, u1, u1, u2} D _inst_2 K A _inst_3)
-but is expected to have type
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.SmallCategory.{u1} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.SmallCategory.{u1} D] {G : CategoryTheory.Functor.{u1, u1, u1, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u1, u1} D _inst_2} (A : Type.{u2}) [_inst_3 : CategoryTheory.Category.{u1, u2} A] [_inst_4 : CategoryTheory.Full.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] (H : CategoryTheory.CoverDense.{u1, u1, u1, u1} C _inst_1 D _inst_2 K G) [_inst_6 : CategoryTheory.Limits.HasLimits.{u1, u2} A _inst_3], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Sheaf.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.{u1, u1, u1, u2} D _inst_2 K A _inst_3) (CategoryTheory.Sheaf.instCategorySheaf.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.instCategorySheaf.{u1, u1, u1, u2} D _inst_2 K A _inst_3)
-Case conversion may be inaccurate. Consider using '#align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquivₓ'. -/
 /-- Cover-dense functors induces an equivalence of categories of sheaves.
 
 This is known as the comparison lemma. It requires that the sites are small and the value category

2ed2c631

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -89,10 +89,7 @@ then the set `{ T ∩ mor(C) | T ∈ K }` is a grothendieck topology of `C`.
 def inducedTopology : GrothendieckTopology C
     where
   sieves X S := K _ (S.functorPushforward G)
-  top_mem' X := by
-    change K _ _
-    rw [sieve.functor_pushforward_top]
-    exact K.top_mem _
+  top_mem' X := by change K _ _; rw [sieve.functor_pushforward_top]; exact K.top_mem _
   pullback_stable' X Y S f hS :=
     by
     have : S.pullback f = ((S.functor_pushforward G).pullback (G.map f)).functorPullback G :=

2ed2c631

bump to nightly-2023-05-28-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6c6011cf

Diff

@@ -69,10 +69,7 @@ variable [Full G] [Faithful G] (Hld : LocallyCoverDense K G)
 include Hld
 
 /- warning: category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback -> CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u2, u4, u1, u3} C _inst_1 D _inst_2 G], (CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G) -> (forall {X : C} (S : CategoryTheory.Sieve.{u2, u1} C _inst_1 X), Iff (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X) (CategoryTheory.Sieve.functorPushforward.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X S)) (Exists.{succ (max u3 u4)} (coeSort.{succ (max u3 u4), succ (succ (max u3 u4))} (Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) Type.{max u3 u4} (Set.hasCoeToSort.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (fun (T : coeSort.{succ (max u3 u4), succ (succ (max u3 u4))} (Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) Type.{max u3 u4} (Set.hasCoeToSort.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) => Eq.{max (succ u1) (succ u2)} (CategoryTheory.Sieve.{u2, u1} C _inst_1 X) (CategoryTheory.Sieve.functorPullback.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X (Subtype.val.{succ (max u3 u4)} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X)) (fun (x : CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X)) => Membership.Mem.{max u3 u4, max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X)) (Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (Set.hasMem.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) x (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) T)) S)))
-but is expected to have type
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u4, u3} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.Category.{u2, u1} D] {G : CategoryTheory.Functor.{u4, u2, u3, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u2, u1} D _inst_2} [_inst_4 : CategoryTheory.Full.{u4, u2, u3, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u4, u2, u3, u1} C _inst_1 D _inst_2 G], (CategoryTheory.LocallyCoverDense.{u3, u4, u1, u2} C _inst_1 D _inst_2 K G) -> (forall {X : C} (S : CategoryTheory.Sieve.{u4, u3} C _inst_1 X), Iff (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X) (CategoryTheory.Sieve.functorPushforward.{u4, u2, u3, u1} C _inst_1 D _inst_2 G X S)) (Exists.{max (succ u1) (succ u2)} (Set.Elem.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) (fun (T : Set.Elem.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) => Eq.{max (succ u3) (succ u4)} (CategoryTheory.Sieve.{u4, u3} C _inst_1 X) (CategoryTheory.Sieve.functorPullback.{u4, u2, u3, u1} C _inst_1 D _inst_2 G X (Subtype.val.{max (succ u1) (succ u2)} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (fun (x : CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) => Membership.mem.{max u1 u2, max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (Set.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) (Set.instMembershipSet.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) x (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) T)) S)))
+<too large>
 Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullbackₓ'. -/
 theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
     K _ (S.functorPushforward G) ↔ ∃ T : K (G.obj X), T.val.functorPullback G = S :=

2ed2c631

bump to nightly-2023-05-18-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/c89fe2d59ae06402c3f55f978016d1ada444f57e

b46e9d53

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Andrew Yang
 
 ! This file was ported from Lean 3 source module category_theory.sites.induced_topology
-! leanprover-community/mathlib commit ba43124c37cfe0009bbfc57505f9503ae0e8c1af
+! leanprover-community/mathlib commit 2ed2c6310e6f1c5562bdf6bfbda55ebbf6891abe
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.CategoryTheory.Sites.DenseSubsite
 /-!
 # Induced Topology
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We say that a functor `G : C ⥤ (D, K)` is locally dense if for each covering sieve `T` in `D` of
 some `X : C`, `T ∩ mor(C)` generates a covering sieve of `X` in `D`. A locally dense fully faithful
 functor then induces a topology on `C` via `{ T ∩ mor(C) | T ∈ K }`. Note that this is equal to

ba43124c

bump to nightly-2023-05-15-12

mathlib commit https://github.com/leanprover-community/mathlib/commit/7ad820c4997738e2f542f8a20f32911f52020e26

f3ad2973

Diff

@@ -49,6 +49,7 @@ variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 
 variable (A : Type v) [Category.{u} A]
 
+#print CategoryTheory.LocallyCoverDense /-
 -- variables (A) [full G] [faithful G]
 /-- We say that a functor `C ⥤ D` into a site is "locally dense" if
 for each covering sieve `T` in `D`, `T ∩ mor(C)` generates a covering sieve in `D`.
@@ -56,6 +57,7 @@ for each covering sieve `T` in `D`, `T ∩ mor(C)` generates a covering sieve in
 def LocallyCoverDense (K : GrothendieckTopology D) (G : C ⥤ D) : Prop :=
   ∀ ⦃X⦄ (T : K (G.obj X)), (T.val.functorPullback G).functorPushforward G ∈ K (G.obj X)
 #align category_theory.locally_cover_dense CategoryTheory.LocallyCoverDense
+-/
 
 namespace LocallyCoverDense
 
@@ -63,6 +65,12 @@ variable [Full G] [Faithful G] (Hld : LocallyCoverDense K G)
 
 include Hld
 
+/- warning: category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback -> CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u2, u4, u1, u3} C _inst_1 D _inst_2 G], (CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G) -> (forall {X : C} (S : CategoryTheory.Sieve.{u2, u1} C _inst_1 X), Iff (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X) (CategoryTheory.Sieve.functorPushforward.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X S)) (Exists.{succ (max u3 u4)} (coeSort.{succ (max u3 u4), succ (succ (max u3 u4))} (Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) Type.{max u3 u4} (Set.hasCoeToSort.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (fun (T : coeSort.{succ (max u3 u4), succ (succ (max u3 u4))} (Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) Type.{max u3 u4} (Set.hasCoeToSort.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) => Eq.{max (succ u1) (succ u2)} (CategoryTheory.Sieve.{u2, u1} C _inst_1 X) (CategoryTheory.Sieve.functorPullback.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X (Subtype.val.{succ (max u3 u4)} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X)) (fun (x : CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X)) => Membership.Mem.{max u3 u4, max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X)) (Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) (Set.hasMem.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) x (coeFn.{max (succ u3) (succ u4), max (succ u3) (succ (max u3 u4))} (CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) (fun (_x : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2) => forall (X : D), Set.{max u3 u4} (CategoryTheory.Sieve.{u4, u3} D _inst_2 X)) (CategoryTheory.GrothendieckTopology.hasCoeToFun.{u4, u3} D _inst_2) K (CategoryTheory.Functor.obj.{u2, u4, u1, u3} C _inst_1 D _inst_2 G X))) T)) S)))
+but is expected to have type
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u4, u3} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.Category.{u2, u1} D] {G : CategoryTheory.Functor.{u4, u2, u3, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u2, u1} D _inst_2} [_inst_4 : CategoryTheory.Full.{u4, u2, u3, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u4, u2, u3, u1} C _inst_1 D _inst_2 G], (CategoryTheory.LocallyCoverDense.{u3, u4, u1, u2} C _inst_1 D _inst_2 K G) -> (forall {X : C} (S : CategoryTheory.Sieve.{u4, u3} C _inst_1 X), Iff (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X) (CategoryTheory.Sieve.functorPushforward.{u4, u2, u3, u1} C _inst_1 D _inst_2 G X S)) (Exists.{max (succ u1) (succ u2)} (Set.Elem.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) (fun (T : Set.Elem.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) => Eq.{max (succ u3) (succ u4)} (CategoryTheory.Sieve.{u4, u3} C _inst_1 X) (CategoryTheory.Sieve.functorPullback.{u4, u2, u3, u1} C _inst_1 D _inst_2 G X (Subtype.val.{max (succ u1) (succ u2)} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (fun (x : CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) => Membership.mem.{max u1 u2, max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X)) (Set.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) (Set.instMembershipSet.{max u1 u2} (CategoryTheory.Sieve.{u2, u1} D _inst_2 (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) x (CategoryTheory.GrothendieckTopology.sieves.{u2, u1} D _inst_2 K (Prefunctor.obj.{succ u4, succ u2, u3, u1} C (CategoryTheory.CategoryStruct.toQuiver.{u4, u3} C (CategoryTheory.Category.toCategoryStruct.{u4, u3} C _inst_1)) D (CategoryTheory.CategoryStruct.toQuiver.{u2, u1} D (CategoryTheory.Category.toCategoryStruct.{u2, u1} D _inst_2)) (CategoryTheory.Functor.toPrefunctor.{u4, u2, u3, u1} C _inst_1 D _inst_2 G) X))) T)) S)))
+Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullbackₓ'. -/
 theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
     K _ (S.functorPushforward G) ↔ ∃ T : K (G.obj X), T.val.functorPullback G = S :=
   by
@@ -73,6 +81,7 @@ theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
     exact Hld T
 #align category_theory.locally_cover_dense.pushforward_cover_iff_cover_pullback CategoryTheory.LocallyCoverDense.pushforward_cover_iff_cover_pullback
 
+#print CategoryTheory.LocallyCoverDense.inducedTopology /-
 /-- If a functor `G : C ⥤ (D, K)` is fully faithful and locally dense,
 then the set `{ T ∩ mor(C) | T ∈ K }` is a grothendieck topology of `C`.
 -/
@@ -104,12 +113,25 @@ def inducedTopology : GrothendieckTopology C
     rintro W _ ⟨Z', g', i', hg, rfl⟩
     use ⟨Z', g' ≫ g, i', hg, by simp⟩
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
+-/
 
+/- warning: category_theory.locally_cover_dense.induced_topology_cover_lifting -> CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G), CategoryTheory.CoverLifting.{u1, u2, u3, u4} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u1, u2, u3, u4} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
+but is expected to have type
+  forall {C : Type.{u4}} [_inst_1 : CategoryTheory.Category.{u3, u4} C] {D : Type.{u2}} [_inst_2 : CategoryTheory.Category.{u1, u2} D] {G : CategoryTheory.Functor.{u3, u1, u4, u2} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u1, u2} D _inst_2} [_inst_4 : CategoryTheory.Full.{u3, u1, u4, u2} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u3, u1, u4, u2} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u4, u3, u2, u1} C _inst_1 D _inst_2 K G), CategoryTheory.CoverLifting.{u4, u3, u2, u1} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u4, u3, u2, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
+Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLiftingₓ'. -/
 /-- `G` is cover-lifting wrt the induced topology. -/
 theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
   ⟨fun _ S hS => Hld ⟨S, hS⟩⟩
 #align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
 
+/- warning: category_theory.locally_cover_dense.induced_topology_cover_preserving -> CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u2, u4, u1, u3} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G), CategoryTheory.CoverPreserving.{u2, u4, u1, u3} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u1, u2, u3, u4} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u4, u2} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.Category.{u3, u1} D] {G : CategoryTheory.Functor.{u4, u3, u2, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u3, u1} D _inst_2} [_inst_4 : CategoryTheory.Full.{u4, u3, u2, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u4, u3, u2, u1} C _inst_1 D _inst_2 G] (Hld : CategoryTheory.LocallyCoverDense.{u2, u4, u1, u3} C _inst_1 D _inst_2 K G), CategoryTheory.CoverPreserving.{u4, u3, u2, u1} C _inst_1 D _inst_2 (CategoryTheory.LocallyCoverDense.inducedTopology.{u2, u4, u1, u3} C _inst_1 D _inst_2 G K _inst_4 _inst_5 Hld) K G
+Case conversion may be inaccurate. Consider using '#align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopology_coverPreservingₓ'. -/
 /-- `G` is cover-preserving wrt the induced topology. -/
 theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
   ⟨fun _ S hS => hS⟩
@@ -117,6 +139,12 @@ theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K
 
 end LocallyCoverDense
 
+/- warning: category_theory.cover_dense.locally_cover_dense -> CategoryTheory.CoverDense.locallyCoverDense is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] {D : Type.{u3}} [_inst_2 : CategoryTheory.Category.{u4, u3} D] {G : CategoryTheory.Functor.{u2, u4, u1, u3} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u4, u3} D _inst_2} [_inst_4 : CategoryTheory.Full.{u2, u4, u1, u3} C _inst_1 D _inst_2 G], (CategoryTheory.CoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G) -> (CategoryTheory.LocallyCoverDense.{u1, u2, u3, u4} C _inst_1 D _inst_2 K G)
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u4, u2} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.Category.{u3, u1} D] {G : CategoryTheory.Functor.{u4, u3, u2, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u3, u1} D _inst_2} [_inst_4 : CategoryTheory.Full.{u4, u3, u2, u1} C _inst_1 D _inst_2 G], (CategoryTheory.CoverDense.{u2, u4, u1, u3} C _inst_1 D _inst_2 K G) -> (CategoryTheory.LocallyCoverDense.{u2, u4, u1, u3} C _inst_1 D _inst_2 K G)
+Case conversion may be inaccurate. Consider using '#align category_theory.cover_dense.locally_cover_dense CategoryTheory.CoverDense.locallyCoverDenseₓ'. -/
 theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCoverDense K G :=
   by
   intro X T
@@ -128,15 +156,23 @@ theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCove
   simp
 #align category_theory.cover_dense.locally_cover_dense CategoryTheory.CoverDense.locallyCoverDense
 
+#print CategoryTheory.CoverDense.inducedTopology /-
 /-- Given a fully faithful cover-dense functor `G : C ⥤ (D, K)`, we may induce a topology on `C`.
 -/
 abbrev CoverDense.inducedTopology [Full G] [Faithful G] (H : CoverDense K G) :
     GrothendieckTopology C :=
   H.LocallyCoverDense.inducedTopology
 #align category_theory.cover_dense.induced_topology CategoryTheory.CoverDense.inducedTopology
+-/
 
 variable (J)
 
+/- warning: category_theory.over_forget_locally_cover_dense -> CategoryTheory.over_forget_locallyCoverDense is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.Category.{u2, u1} C] (J : CategoryTheory.GrothendieckTopology.{u2, u1} C _inst_1) (X : C), CategoryTheory.LocallyCoverDense.{max u1 u2, u2, u1, u2} (CategoryTheory.Over.{u2, u1} C _inst_1 X) (CategoryTheory.commaCategory.{u2, u2, u2, u1, u2, u1} C _inst_1 (CategoryTheory.Discrete.{u2} PUnit.{succ u2}) (CategoryTheory.discreteCategory.{u2} PUnit.{succ u2}) C _inst_1 (CategoryTheory.Functor.id.{u2, u1} C _inst_1) (CategoryTheory.Functor.fromPUnit.{u2, u1} C _inst_1 X)) C _inst_1 J (CategoryTheory.Over.forget.{u2, u1} C _inst_1 X)
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (J : CategoryTheory.GrothendieckTopology.{u1, u2} C _inst_1) (X : C), CategoryTheory.LocallyCoverDense.{max u2 u1, u1, u2, u1} (CategoryTheory.Over.{u1, u2} C _inst_1 X) (CategoryTheory.instCategoryOver.{u1, u2} C _inst_1 X) C _inst_1 J (CategoryTheory.Over.forget.{u1, u2} C _inst_1 X)
+Case conversion may be inaccurate. Consider using '#align category_theory.over_forget_locally_cover_dense CategoryTheory.over_forget_locallyCoverDenseₓ'. -/
 theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget X) :=
   by
   intro Y T
@@ -159,6 +195,12 @@ variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 
 variable (A : Type u) [Category.{v} A]
 
+/- warning: category_theory.cover_dense.Sheaf_equiv -> CategoryTheory.CoverDense.sheafEquiv is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.SmallCategory.{u1} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.SmallCategory.{u1} D] {G : CategoryTheory.Functor.{u1, u1, u1, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u1, u1} D _inst_2} (A : Type.{u2}) [_inst_3 : CategoryTheory.Category.{u1, u2} A] [_inst_4 : CategoryTheory.Full.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] (H : CategoryTheory.CoverDense.{u1, u1, u1, u1} C _inst_1 D _inst_2 K G) [_inst_6 : CategoryTheory.Limits.HasLimits.{u1, u2} A _inst_3], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Sheaf.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.CategoryTheory.category.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.{u1, u1, u1, u2} D _inst_2 K A _inst_3) (CategoryTheory.Sheaf.CategoryTheory.category.{u1, u1, u1, u2} D _inst_2 K A _inst_3)
+but is expected to have type
+  forall {C : Type.{u1}} [_inst_1 : CategoryTheory.SmallCategory.{u1} C] {D : Type.{u1}} [_inst_2 : CategoryTheory.SmallCategory.{u1} D] {G : CategoryTheory.Functor.{u1, u1, u1, u1} C _inst_1 D _inst_2} {K : CategoryTheory.GrothendieckTopology.{u1, u1} D _inst_2} (A : Type.{u2}) [_inst_3 : CategoryTheory.Category.{u1, u2} A] [_inst_4 : CategoryTheory.Full.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] [_inst_5 : CategoryTheory.Faithful.{u1, u1, u1, u1} C _inst_1 D _inst_2 G] (H : CategoryTheory.CoverDense.{u1, u1, u1, u1} C _inst_1 D _inst_2 K G) [_inst_6 : CategoryTheory.Limits.HasLimits.{u1, u2} A _inst_3], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Sheaf.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.{u1, u1, u1, u2} D _inst_2 K A _inst_3) (CategoryTheory.Sheaf.instCategorySheaf.{u1, u1, u1, u2} C _inst_1 (CategoryTheory.CoverDense.inducedTopology.{u1, u1, u1, u1} C _inst_1 D _inst_2 G K _inst_4 _inst_5 H) A _inst_3) (CategoryTheory.Sheaf.instCategorySheaf.{u1, u1, u1, u2} D _inst_2 K A _inst_3)
+Case conversion may be inaccurate. Consider using '#align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquivₓ'. -/
 /-- Cover-dense functors induces an equivalence of categories of sheaves.
 
 This is known as the comparison lemma. It requires that the sites are small and the value category

ba43124c

bump to nightly-2023-05-12-00

mathlib commit https://github.com/leanprover-community/mathlib/commit/28b2a92f2996d28e580450863c130955de0ed398

dd5825e1

Diff

@@ -106,9 +106,9 @@ def inducedTopology : GrothendieckTopology C
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 
 /-- `G` is cover-lifting wrt the induced topology. -/
-theorem inducedTopologyCoverLifting : CoverLifting Hld.inducedTopology K G :=
+theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
   ⟨fun _ S hS => Hld ⟨S, hS⟩⟩
-#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopologyCoverLifting
+#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
 
 /-- `G` is cover-preserving wrt the induced topology. -/
 theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
@@ -167,7 +167,7 @@ is complete.
 noncomputable def CoverDense.sheafEquiv [Full G] [Faithful G] (H : CoverDense K G) [HasLimits A] :
     Sheaf H.inducedTopology A ≌ Sheaf K A :=
   H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopology_coverPreserving
-    H.LocallyCoverDense.inducedTopologyCoverLifting
+    H.LocallyCoverDense.inducedTopology_coverLifting
 #align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquiv
 
 end SmallSite

ba43124c

bump to nightly-2023-05-11-02

mathlib commit https://github.com/leanprover-community/mathlib/commit/28b2a92f2996d28e580450863c130955de0ed398

1eda273d

Diff

@@ -111,9 +111,9 @@ theorem inducedTopologyCoverLifting : CoverLifting Hld.inducedTopology K G :=
 #align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopologyCoverLifting
 
 /-- `G` is cover-preserving wrt the induced topology. -/
-theorem inducedTopologyCoverPreserving : CoverPreserving Hld.inducedTopology K G :=
+theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
   ⟨fun _ S hS => hS⟩
-#align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopologyCoverPreserving
+#align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving
 
 end LocallyCoverDense
 
@@ -166,7 +166,7 @@ is complete.
 -/
 noncomputable def CoverDense.sheafEquiv [Full G] [Faithful G] (H : CoverDense K G) [HasLimits A] :
     Sheaf H.inducedTopology A ≌ Sheaf K A :=
-  H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopologyCoverPreserving
+  H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopology_coverPreserving
     H.LocallyCoverDense.inducedTopologyCoverLifting
 #align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquiv

ba43124c

bump to nightly-2023-03-07-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/3b267e70a936eebb21ab546f49a8df34dd300b25

a8442c3c

Diff

@@ -106,14 +106,14 @@ def inducedTopology : GrothendieckTopology C
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 
 /-- `G` is cover-lifting wrt the induced topology. -/
-theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
+theorem inducedTopologyCoverLifting : CoverLifting Hld.inducedTopology K G :=
   ⟨fun _ S hS => Hld ⟨S, hS⟩⟩
-#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
+#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopologyCoverLifting
 
 /-- `G` is cover-preserving wrt the induced topology. -/
-theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
+theorem inducedTopologyCoverPreserving : CoverPreserving Hld.inducedTopology K G :=
   ⟨fun _ S hS => hS⟩
-#align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopology_coverPreserving
+#align category_theory.locally_cover_dense.induced_topology_cover_preserving CategoryTheory.LocallyCoverDense.inducedTopologyCoverPreserving
 
 end LocallyCoverDense
 
@@ -166,8 +166,8 @@ is complete.
 -/
 noncomputable def CoverDense.sheafEquiv [Full G] [Faithful G] (H : CoverDense K G) [HasLimits A] :
     Sheaf H.inducedTopology A ≌ Sheaf K A :=
-  H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopology_coverPreserving
-    H.LocallyCoverDense.inducedTopology_coverLifting
+  H.sheafEquivOfCoverPreservingCoverLifting H.LocallyCoverDense.inducedTopologyCoverPreserving
+    H.LocallyCoverDense.inducedTopologyCoverLifting
 #align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquiv
 
 end SmallSite

ba43124c

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

ba43124c

chore(CategoryTheory): move Full, Faithful, EssSurj, IsEquivalence and ReflectsIsomorphisms to the Functor namespace (#11985)

These notions on functors are now Functor.Full, Functor.Faithful, Functor.EssSurj, Functor.IsEquivalence, Functor.ReflectsIsomorphisms. Deprecated aliases are introduced for the previous names.

65b7affc

Diff

@@ -54,7 +54,7 @@ def LocallyCoverDense (K : GrothendieckTopology D) (G : C ⥤ D) : Prop :=
 
 namespace LocallyCoverDense
 
-variable [Full G] [Faithful G] (Hld : LocallyCoverDense K G)
+variable [G.Full] [G.Faithful] (Hld : LocallyCoverDense K G)
 
 theorem pushforward_cover_iff_cover_pullback {X : C} (S : Sieve X) :
     K _ (S.functorPushforward G) ↔ ∃ T : K (G.obj X), T.val.functorPullback G = S := by
@@ -149,12 +149,12 @@ variable {C : Type v} [SmallCategory C] {D : Type v} [SmallCategory D] {G : C 
 variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 variable (A : Type u) [Category.{v} A]
 
-instance [Full G] [Faithful G] [G.IsCoverDense K]  :
+instance [G.Full] [G.Faithful] [G.IsCoverDense K]  :
     Functor.IsContinuous G (G.inducedTopologyOfIsCoverDense K) K := by
   apply Functor.IsCoverDense.isContinuous
   exact (G.locallyCoverDense_of_isCoverDense K).inducedTopology_coverPreserving
 
-instance [Full G] [Faithful G] [G.IsCoverDense K]  :
+instance [G.Full] [G.Faithful] [G.IsCoverDense K]  :
     Functor.IsCocontinuous G (G.inducedTopologyOfIsCoverDense K) K :=
   (G.locallyCoverDense_of_isCoverDense K).inducedTopology_isCocontinuous

ba43124c

chore(*): remove empty lines between variable statements (#11418)

Empty lines were removed by executing the following Python script twice

import os
import re


# Loop through each file in the repository
for dir_path, dirs, files in os.walk('.'):
  for filename in files:
    if filename.endswith('.lean'):
      file_path = os.path.join(dir_path, filename)

      # Open the file and read its contents
      with open(file_path, 'r') as file:
        content = file.read()

      # Use a regular expression to replace sequences of "variable" lines separated by empty lines
      # with sequences without empty lines
      modified_content = re.sub(r'(variable.*\n)\n(variable(?! .* in))', r'\1\2', content)

      # Write the modified content back to the file
      with open(file_path, 'w') as file:
        file.write(modified_content)

75c86f04

Diff

@@ -41,9 +41,7 @@ open Limits Opposite Presieve
 section
 
 variable {C : Type*} [Category C] {D : Type*} [Category D] {G : C ⥤ D}
-
 variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
-
 variable (A : Type v) [Category.{u} A]
 
 -- variables (A) [full G] [faithful G]
@@ -148,9 +146,7 @@ end
 section SmallSite
 
 variable {C : Type v} [SmallCategory C] {D : Type v} [SmallCategory D] {G : C ⥤ D}
-
 variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
-
 variable (A : Type u) [Category.{v} A]
 
 instance [Full G] [Faithful G] [G.IsCoverDense K]  :

ba43124c

refactor(CategoryTheory/Sites): continuous functors (#8408)

This PR introduces the typeclass Functor.IsContinuous which says that the precomposition with a functor preserves the sheaf condition for Grothendieck topologies. It slightly refactors the previous main theorem about CoverPreserving and CompatiblePreserving functors: it now states that such functors are continuous. The pushforward functor for a continuous functor is defined under the Functor.IsContinuous assumption rather than the combination of both CoverPreserving and CompatiblePreserving. The property CoverLifting is renamed IsCocontinuous and it is made a class. The property IsCoverDense is also made a class.

Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>

83613d27

Diff

@@ -51,7 +51,7 @@ variable (A : Type v) [Category.{u} A]
 for each covering sieve `T` in `D`, `T ∩ mor(C)` generates a covering sieve in `D`.
 -/
 def LocallyCoverDense (K : GrothendieckTopology D) (G : C ⥤ D) : Prop :=
-  ∀ ⦃X⦄ (T : K (G.obj X)), (T.val.functorPullback G).functorPushforward G ∈ K (G.obj X)
+  ∀ ⦃X : C⦄ (T : K (G.obj X)), (T.val.functorPullback G).functorPushforward G ∈ K (G.obj X)
 #align category_theory.locally_cover_dense CategoryTheory.LocallyCoverDense
 
 namespace LocallyCoverDense
@@ -98,9 +98,9 @@ def inducedTopology : GrothendieckTopology C where
 #align category_theory.locally_cover_dense.induced_topology CategoryTheory.LocallyCoverDense.inducedTopology
 
 /-- `G` is cover-lifting wrt the induced topology. -/
-theorem inducedTopology_coverLifting : CoverLifting Hld.inducedTopology K G :=
+theorem inducedTopology_isCocontinuous : G.IsCocontinuous Hld.inducedTopology K :=
   ⟨@fun _ S hS => Hld ⟨S, hS⟩⟩
-#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_coverLifting
+#align category_theory.locally_cover_dense.induced_topology_cover_lifting CategoryTheory.LocallyCoverDense.inducedTopology_isCocontinuous
 
 /-- `G` is cover-preserving wrt the induced topology. -/
 theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K G :=
@@ -109,22 +109,26 @@ theorem inducedTopology_coverPreserving : CoverPreserving Hld.inducedTopology K
 
 end LocallyCoverDense
 
-theorem CoverDense.locallyCoverDense [Full G] (H : CoverDense K G) : LocallyCoverDense K G := by
+variable (G K)
+
+theorem Functor.locallyCoverDense_of_isCoverDense [Full G] [G.IsCoverDense K] :
+    LocallyCoverDense K G := by
   intro X T
-  refine' K.superset_covering _ (K.bind_covering T.property fun Y f _ => H.is_cover Y)
+  refine' K.superset_covering _ (K.bind_covering T.property
+    fun Y f _ => G.is_cover_of_isCoverDense _ Y)
   rintro Y _ ⟨Z, _, f, hf, ⟨W, g, f', rfl : _ = _⟩, rfl⟩
   use W; use G.preimage (f' ≫ f); use g
   constructor
   simpa using T.val.downward_closed hf f'
   simp
-#align category_theory.cover_dense.locally_cover_dense CategoryTheory.CoverDense.locallyCoverDense
+#align category_theory.cover_dense.locally_cover_dense CategoryTheory.Functor.locallyCoverDense_of_isCoverDense
 
 /-- Given a fully faithful cover-dense functor `G : C ⥤ (D, K)`, we may induce a topology on `C`.
 -/
-abbrev CoverDense.inducedTopology [Full G] [Faithful G] (H : CoverDense K G) :
+abbrev Functor.inducedTopologyOfIsCoverDense [Full G] [Faithful G] [G.IsCoverDense K] :
     GrothendieckTopology C :=
-  H.locallyCoverDense.inducedTopology
-#align category_theory.cover_dense.induced_topology CategoryTheory.CoverDense.inducedTopology
+  (G.locallyCoverDense_of_isCoverDense K).inducedTopology
+#align category_theory.cover_dense.induced_topology CategoryTheory.Functor.inducedTopologyOfIsCoverDense
 
 variable (J)
 
@@ -149,17 +153,27 @@ variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}
 
 variable (A : Type u) [Category.{v} A]
 
+instance [Full G] [Faithful G] [G.IsCoverDense K]  :
+    Functor.IsContinuous G (G.inducedTopologyOfIsCoverDense K) K := by
+  apply Functor.IsCoverDense.isContinuous
+  exact (G.locallyCoverDense_of_isCoverDense K).inducedTopology_coverPreserving
+
+instance [Full G] [Faithful G] [G.IsCoverDense K]  :
+    Functor.IsCocontinuous G (G.inducedTopologyOfIsCoverDense K) K :=
+  (G.locallyCoverDense_of_isCoverDense K).inducedTopology_isCocontinuous
+
 /-- Cover-dense functors induces an equivalence of categories of sheaves.
 
 This is known as the comparison lemma. It requires that the sites are small and the value category
 is complete.
 -/
-noncomputable def CoverDense.sheafEquiv [Full G] [Faithful G] (H : CoverDense K G) [HasLimits A] :
-    Sheaf H.inducedTopology A ≌ Sheaf K A :=
-  H.sheafEquivOfCoverPreservingCoverLifting H.locallyCoverDense.inducedTopology_coverPreserving
-    H.locallyCoverDense.inducedTopology_coverLifting
+noncomputable def Functor.sheafInducedTopologyEquivOfIsCoverDense [Full G] [Faithful G]
+    [G.IsCoverDense K] [HasLimits A] :
+    Sheaf (G.inducedTopologyOfIsCoverDense K) A ≌ Sheaf K A :=
+  Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting G
+    (G.inducedTopologyOfIsCoverDense K) K A
 set_option linter.uppercaseLean3 false in
-#align category_theory.cover_dense.Sheaf_equiv CategoryTheory.CoverDense.sheafEquiv
+#align category_theory.cover_dense.Sheaf_equiv CategoryTheory.Functor.sheafInducedTopologyEquivOfIsCoverDense
 
 end SmallSite

ba43124c

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -40,7 +40,7 @@ open Limits Opposite Presieve
 
 section
 
-variable {C : Type _} [Category C] {D : Type _} [Category D] {G : C ⥤ D}
+variable {C : Type*} [Category C] {D : Type*} [Category D] {G : C ⥤ D}
 
 variable {J : GrothendieckTopology C} {K : GrothendieckTopology D}

ba43124c

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2021 Andrew Yang. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Andrew Yang
-
-! This file was ported from Lean 3 source module category_theory.sites.induced_topology
-! leanprover-community/mathlib commit ba43124c37cfe0009bbfc57505f9503ae0e8c1af
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.CategoryTheory.Sites.DenseSubsite
 
+#align_import category_theory.sites.induced_topology from "leanprover-community/mathlib"@"ba43124c37cfe0009bbfc57505f9503ae0e8c1af"
+
 /-!
 # Induced Topology

ba43124c

chore: bump Std4 (#5219)

Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au> Co-authored-by: Mario Carneiro <di.gama@gmail.com>

59c36da5

Diff

@@ -134,8 +134,7 @@ variable (J)
 theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget X) := by
   intro Y T
   convert T.property
-  ext Z
-  intro f
+  ext Z f
   constructor
   · rintro ⟨_, _, g', hg, rfl⟩
     exact T.val.downward_closed hg g'

ba43124c

chore: bump to nightly-2023-05-31 (#4530)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Mario Carneiro <di.gama@gmail.com> Co-authored-by: Floris van Doorn <fpvdoorn@gmail.com> Co-authored-by: Jeremy Tan Jie Rui <reddeloostw@gmail.com> Co-authored-by: Alex J Best <alex.j.best@gmail.com>

01da6a3c

Diff

@@ -134,7 +134,7 @@ variable (J)
 theorem over_forget_locallyCoverDense (X : C) : LocallyCoverDense J (Over.forget X) := by
   intro Y T
   convert T.property
-  ext (Z f)
+  ext Z
   intro f
   constructor
   · rintro ⟨_, _, g', hg, rfl⟩

ba43124c

feat: port CategoryTheory.Sites.InducedTopology (#3995)

Co-authored-by: Moritz Firsching <firsching@google.com>

9bf37f69

`category_theory.sites.induced_topology` ⟷ `Mathlib.CategoryTheory.Sites.InducedTopology`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3 + 338

category_theory.sites.induced_topology ⟷ Mathlib.CategoryTheory.Sites.InducedTopology

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3 + 338

`category_theory.sites.induced_topology` ⟷ `Mathlib.CategoryTheory.Sites.InducedTopology`