category_theory.limits.comma | Mathlib porting status

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

70fd9563

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

69c6a5a1

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -3,11 +3,11 @@ Copyright (c) 2021 Bhavik Mehta. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
 -/
-import CategoryTheory.Arrow
+import CategoryTheory.Comma.Arrow
 import CategoryTheory.Limits.Constructions.EpiMono
 import CategoryTheory.Limits.Creates
 import CategoryTheory.Limits.Unit
-import CategoryTheory.StructuredArrow
+import CategoryTheory.Comma.StructuredArrow
 
 #align_import category_theory.limits.comma from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"

69c6a5a1

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,11 +3,11 @@ Copyright (c) 2021 Bhavik Mehta. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
 -/
-import Mathbin.CategoryTheory.Arrow
-import Mathbin.CategoryTheory.Limits.Constructions.EpiMono
-import Mathbin.CategoryTheory.Limits.Creates
-import Mathbin.CategoryTheory.Limits.Unit
-import Mathbin.CategoryTheory.StructuredArrow
+import CategoryTheory.Arrow
+import CategoryTheory.Limits.Constructions.EpiMono
+import CategoryTheory.Limits.Creates
+import CategoryTheory.Limits.Unit
+import CategoryTheory.StructuredArrow
 
 #align_import category_theory.limits.comma from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"

69c6a5a1

bump to nightly-2023-08-31-06

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

8d006b5f

Diff

@@ -168,10 +168,10 @@ instance hasLimitsOfShape [HasLimitsOfShape J A] [HasLimitsOfShape J B]
 #align category_theory.comma.has_limits_of_shape CategoryTheory.Comma.hasLimitsOfShape
 -/
 
-#print CategoryTheory.Comma.hasLimits /-
-instance hasLimits [HasLimits A] [HasLimits B] [PreservesLimits R] : HasLimits (Comma L R) :=
+#print CategoryTheory.Comma.hasLimitsOfSize /-
+instance hasLimitsOfSize [HasLimits A] [HasLimits B] [PreservesLimits R] : HasLimits (Comma L R) :=
   ⟨inferInstance⟩
-#align category_theory.comma.has_limits CategoryTheory.Comma.hasLimits
+#align category_theory.comma.has_limits CategoryTheory.Comma.hasLimitsOfSize
 -/
 
 #print CategoryTheory.Comma.hasColimit /-
@@ -187,11 +187,11 @@ instance hasColimitsOfShape [HasColimitsOfShape J A] [HasColimitsOfShape J B]
 #align category_theory.comma.has_colimits_of_shape CategoryTheory.Comma.hasColimitsOfShape
 -/
 
-#print CategoryTheory.Comma.hasColimits /-
-instance hasColimits [HasColimits A] [HasColimits B] [PreservesColimits L] :
+#print CategoryTheory.Comma.hasColimitsOfSize /-
+instance hasColimitsOfSize [HasColimits A] [HasColimits B] [PreservesColimits L] :
     HasColimits (Comma L R) :=
   ⟨inferInstance⟩
-#align category_theory.comma.has_colimits CategoryTheory.Comma.hasColimits
+#align category_theory.comma.has_colimits CategoryTheory.Comma.hasColimitsOfSize
 -/
 
 end Comma
@@ -253,10 +253,10 @@ instance hasLimitsOfShape [HasLimitsOfShape J A] [PreservesLimitsOfShape J G] :
 #align category_theory.structured_arrow.has_limits_of_shape CategoryTheory.StructuredArrow.hasLimitsOfShape
 -/
 
-#print CategoryTheory.StructuredArrow.hasLimits /-
-instance hasLimits [HasLimits A] [PreservesLimits G] : HasLimits (StructuredArrow X G) :=
+#print CategoryTheory.StructuredArrow.hasLimitsOfSize /-
+instance hasLimitsOfSize [HasLimits A] [PreservesLimits G] : HasLimits (StructuredArrow X G) :=
   ⟨inferInstance⟩
-#align category_theory.structured_arrow.has_limits CategoryTheory.StructuredArrow.hasLimits
+#align category_theory.structured_arrow.has_limits CategoryTheory.StructuredArrow.hasLimitsOfSize
 -/
 
 #print CategoryTheory.StructuredArrow.createsLimit /-
@@ -275,10 +275,10 @@ noncomputable instance createsLimitsOfShape [PreservesLimitsOfShape J G] :
 #align category_theory.structured_arrow.creates_limits_of_shape CategoryTheory.StructuredArrow.createsLimitsOfShape
 -/
 
-#print CategoryTheory.StructuredArrow.createsLimits /-
-noncomputable instance createsLimits [PreservesLimits G] : CreatesLimits (proj X G : _) :=
+#print CategoryTheory.StructuredArrow.createsLimitsOfSize /-
+noncomputable instance createsLimitsOfSize [PreservesLimits G] : CreatesLimits (proj X G : _) :=
   ⟨⟩
-#align category_theory.structured_arrow.creates_limits CategoryTheory.StructuredArrow.createsLimits
+#align category_theory.structured_arrow.creates_limits CategoryTheory.StructuredArrow.createsLimitsOfSize
 -/
 
 #print CategoryTheory.StructuredArrow.mono_right_of_mono /-
@@ -314,10 +314,11 @@ instance hasColimitsOfShape [HasColimitsOfShape J A] [PreservesColimitsOfShape J
 #align category_theory.costructured_arrow.has_colimits_of_shape CategoryTheory.CostructuredArrow.hasColimitsOfShape
 -/
 
-#print CategoryTheory.CostructuredArrow.hasColimits /-
-instance hasColimits [HasColimits A] [PreservesColimits G] : HasColimits (CostructuredArrow G X) :=
+#print CategoryTheory.CostructuredArrow.hasColimitsOfSize /-
+instance hasColimitsOfSize [HasColimits A] [PreservesColimits G] :
+    HasColimits (CostructuredArrow G X) :=
   ⟨inferInstance⟩
-#align category_theory.costructured_arrow.has_colimits CategoryTheory.CostructuredArrow.hasColimits
+#align category_theory.costructured_arrow.has_colimits CategoryTheory.CostructuredArrow.hasColimitsOfSize
 -/
 
 #print CategoryTheory.CostructuredArrow.createsColimit /-
@@ -336,10 +337,11 @@ noncomputable instance createsColimitsOfShape [PreservesColimitsOfShape J G] :
 #align category_theory.costructured_arrow.creates_colimits_of_shape CategoryTheory.CostructuredArrow.createsColimitsOfShape
 -/
 
-#print CategoryTheory.CostructuredArrow.createsColimits /-
-noncomputable instance createsColimits [PreservesColimits G] : CreatesColimits (proj G X : _) :=
+#print CategoryTheory.CostructuredArrow.createsColimitsOfSize /-
+noncomputable instance createsColimitsOfSize [PreservesColimits G] :
+    CreatesColimits (proj G X : _) :=
   ⟨⟩
-#align category_theory.costructured_arrow.creates_colimits CategoryTheory.CostructuredArrow.createsColimits
+#align category_theory.costructured_arrow.creates_colimits CategoryTheory.CostructuredArrow.createsColimitsOfSize
 -/
 
 #print CategoryTheory.CostructuredArrow.epi_left_of_epi /-

69c6a5a1

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,11 +2,6 @@
 Copyright (c) 2021 Bhavik Mehta. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
-
-! This file was ported from Lean 3 source module category_theory.limits.comma
-! leanprover-community/mathlib commit 69c6a5a12d8a2b159f20933e60115a4f2de62b58
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.CategoryTheory.Arrow
 import Mathbin.CategoryTheory.Limits.Constructions.EpiMono
@@ -14,6 +9,8 @@ import Mathbin.CategoryTheory.Limits.Creates
 import Mathbin.CategoryTheory.Limits.Unit
 import Mathbin.CategoryTheory.StructuredArrow
 
+#align_import category_theory.limits.comma from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"
+
 /-!
 # Limits and colimits in comma categories

69c6a5a1

bump to nightly-2023-06-13-09

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

395b4fcf

Diff

@@ -266,8 +266,8 @@ instance hasLimits [HasLimits A] [PreservesLimits G] : HasLimits (StructuredArro
 noncomputable instance createsLimit [i : PreservesLimit (F ⋙ proj X G) G] :
     CreatesLimit F (proj X G) :=
   createsLimitOfReflectsIso fun c t =>
-    { liftedCone := @Comma.coneOfPreserves _ _ _ _ _ i pUnitCone t
-      makesLimit := Comma.coneOfPreservesIsLimit _ pUnitConeIsLimit _
+    { liftedCone := @Comma.coneOfPreserves _ _ _ _ _ i punitCone t
+      makesLimit := Comma.coneOfPreservesIsLimit _ punitConeIsLimit _
       validLift := Cones.ext (Iso.refl _) fun j => (id_comp _).symm }
 #align category_theory.structured_arrow.creates_limit CategoryTheory.StructuredArrow.createsLimit
 -/
@@ -327,8 +327,8 @@ instance hasColimits [HasColimits A] [PreservesColimits G] : HasColimits (Costru
 noncomputable instance createsColimit [i : PreservesColimit (F ⋙ proj G X) G] :
     CreatesColimit F (proj G X) :=
   createsColimitOfReflectsIso fun c t =>
-    { liftedCocone := @Comma.coconeOfPreserves _ _ _ _ _ i t pUnitCocone
-      makesColimit := Comma.coconeOfPreservesIsColimit _ _ pUnitCoconeIsColimit
+    { liftedCocone := @Comma.coconeOfPreserves _ _ _ _ _ i t punitCocone
+      makesColimit := Comma.coconeOfPreservesIsColimit _ _ punitCoconeIsColimit
       validLift := Cocones.ext (Iso.refl _) fun j => comp_id _ }
 #align category_theory.costructured_arrow.creates_colimit CategoryTheory.CostructuredArrow.createsColimit
 -/

69c6a5a1

bump to nightly-2023-03-14-02

mathlib commit https://github.com/leanprover-community/mathlib/commit/2196ab363eb097c008d4497125e0dde23fb36db2

d4b38a42

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
 
 ! This file was ported from Lean 3 source module category_theory.limits.comma
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
+! leanprover-community/mathlib commit 69c6a5a12d8a2b159f20933e60115a4f2de62b58
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -17,6 +17,9 @@ import Mathbin.CategoryTheory.StructuredArrow
 /-!
 # Limits and colimits in comma categories
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We build limits in the comma category `comma L R` provided that the two source categories have
 limits and `R` preserves them.
 This is used to construct limits in the arrow category, structured arrow category and under

70fd9563

bump to nightly-2023-03-10-20

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

b97840f4

Diff

@@ -46,13 +46,16 @@ variable {L : A ⥤ T} {R : B ⥤ T}
 
 variable (F : J ⥤ Comma L R)
 
+#print CategoryTheory.Comma.limitAuxiliaryCone /-
 /-- (Implementation). An auxiliary cone which is useful in order to construct limits
 in the comma category. -/
 @[simps]
 def limitAuxiliaryCone (c₁ : Cone (F ⋙ fst L R)) : Cone ((F ⋙ snd L R) ⋙ R) :=
   (Cones.postcompose (whiskerLeft F (Comma.natTrans L R) : _)).obj (L.mapCone c₁)
 #align category_theory.comma.limit_auxiliary_cone CategoryTheory.Comma.limitAuxiliaryCone
+-/
 
+#print CategoryTheory.Comma.coneOfPreserves /-
 /-- If `R` preserves the appropriate limit, then given a cone for `F ⋙ fst L R : J ⥤ L` and a
 limit cone for `F ⋙ snd L R : J ⥤ R` we can build a cone for `F` which will turn out to be a limit
 cone.
@@ -72,7 +75,9 @@ def coneOfPreserves [PreservesLimit (F ⋙ snd L R) R] (c₁ : Cone (F ⋙ fst L
           w' := ((isLimitOfPreserves R t₂).fac (limitAuxiliaryCone F c₁) j).symm }
       naturality' := fun j₁ j₂ t => by ext <;> dsimp <;> simp [← c₁.w t, ← c₂.w t] }
 #align category_theory.comma.cone_of_preserves CategoryTheory.Comma.coneOfPreserves
+-/
 
+#print CategoryTheory.Comma.coneOfPreservesIsLimit /-
 /-- Provided that `R` preserves the appropriate limit, then the cone in `cone_of_preserves` is a
 limit. -/
 def coneOfPreservesIsLimit [PreservesLimit (F ⋙ snd L R) R] {c₁ : Cone (F ⋙ fst L R)}
@@ -93,14 +98,18 @@ def coneOfPreservesIsLimit [PreservesLimit (F ⋙ snd L R) R] {c₁ : Cone (F 
     CommaMorphism.ext _ _ (t₁.uniq ((fst L R).mapCone s) _ fun j => by simp [← w])
       (t₂.uniq ((snd L R).mapCone s) _ fun j => by simp [← w])
 #align category_theory.comma.cone_of_preserves_is_limit CategoryTheory.Comma.coneOfPreservesIsLimit
+-/
 
+#print CategoryTheory.Comma.colimitAuxiliaryCocone /-
 /-- (Implementation). An auxiliary cocone which is useful in order to construct colimits
 in the comma category. -/
 @[simps]
 def colimitAuxiliaryCocone (c₂ : Cocone (F ⋙ snd L R)) : Cocone ((F ⋙ fst L R) ⋙ L) :=
   (Cocones.precompose (whiskerLeft F (Comma.natTrans L R) : _)).obj (R.mapCocone c₂)
 #align category_theory.comma.colimit_auxiliary_cocone CategoryTheory.Comma.colimitAuxiliaryCocone
+-/
 
+#print CategoryTheory.Comma.coconeOfPreserves /-
 /--
 If `L` preserves the appropriate colimit, then given a colimit cocone for `F ⋙ fst L R : J ⥤ L` and
 a cocone for `F ⋙ snd L R : J ⥤ R` we can build a cocone for `F` which will turn out to be a
@@ -121,7 +130,9 @@ def coconeOfPreserves [PreservesColimit (F ⋙ fst L R) L] {c₁ : Cocone (F ⋙
           w' := (isColimitOfPreserves L t₁).fac (colimitAuxiliaryCocone _ c₂) j }
       naturality' := fun j₁ j₂ t => by ext <;> dsimp <;> simp [← c₁.w t, ← c₂.w t] }
 #align category_theory.comma.cocone_of_preserves CategoryTheory.Comma.coconeOfPreserves
+-/
 
+#print CategoryTheory.Comma.coconeOfPreservesIsColimit /-
 /-- Provided that `L` preserves the appropriate colimit, then the cocone in `cocone_of_preserves` is
 a colimit. -/
 def coconeOfPreservesIsColimit [PreservesColimit (F ⋙ fst L R) L] {c₁ : Cocone (F ⋙ fst L R)}
@@ -142,61 +153,86 @@ def coconeOfPreservesIsColimit [PreservesColimit (F ⋙ fst L R) L] {c₁ : Coco
     CommaMorphism.ext _ _ (t₁.uniq ((fst L R).mapCocone s) _ (by simp [← w]))
       (t₂.uniq ((snd L R).mapCocone s) _ (by simp [← w]))
 #align category_theory.comma.cocone_of_preserves_is_colimit CategoryTheory.Comma.coconeOfPreservesIsColimit
+-/
 
+#print CategoryTheory.Comma.hasLimit /-
 instance hasLimit (F : J ⥤ Comma L R) [HasLimit (F ⋙ fst L R)] [HasLimit (F ⋙ snd L R)]
     [PreservesLimit (F ⋙ snd L R) R] : HasLimit F :=
   HasLimit.mk ⟨_, coneOfPreservesIsLimit _ (limit.isLimit _) (limit.isLimit _)⟩
 #align category_theory.comma.has_limit CategoryTheory.Comma.hasLimit
+-/
 
+#print CategoryTheory.Comma.hasLimitsOfShape /-
 instance hasLimitsOfShape [HasLimitsOfShape J A] [HasLimitsOfShape J B]
     [PreservesLimitsOfShape J R] : HasLimitsOfShape J (Comma L R) where
 #align category_theory.comma.has_limits_of_shape CategoryTheory.Comma.hasLimitsOfShape
+-/
 
+#print CategoryTheory.Comma.hasLimits /-
 instance hasLimits [HasLimits A] [HasLimits B] [PreservesLimits R] : HasLimits (Comma L R) :=
   ⟨inferInstance⟩
 #align category_theory.comma.has_limits CategoryTheory.Comma.hasLimits
+-/
 
+#print CategoryTheory.Comma.hasColimit /-
 instance hasColimit (F : J ⥤ Comma L R) [HasColimit (F ⋙ fst L R)] [HasColimit (F ⋙ snd L R)]
     [PreservesColimit (F ⋙ fst L R) L] : HasColimit F :=
   HasColimit.mk ⟨_, coconeOfPreservesIsColimit _ (colimit.isColimit _) (colimit.isColimit _)⟩
 #align category_theory.comma.has_colimit CategoryTheory.Comma.hasColimit
+-/
 
+#print CategoryTheory.Comma.hasColimitsOfShape /-
 instance hasColimitsOfShape [HasColimitsOfShape J A] [HasColimitsOfShape J B]
     [PreservesColimitsOfShape J L] : HasColimitsOfShape J (Comma L R) where
 #align category_theory.comma.has_colimits_of_shape CategoryTheory.Comma.hasColimitsOfShape
+-/
 
+#print CategoryTheory.Comma.hasColimits /-
 instance hasColimits [HasColimits A] [HasColimits B] [PreservesColimits L] :
     HasColimits (Comma L R) :=
   ⟨inferInstance⟩
 #align category_theory.comma.has_colimits CategoryTheory.Comma.hasColimits
+-/
 
 end Comma
 
 namespace Arrow
 
+#print CategoryTheory.Arrow.hasLimit /-
 instance hasLimit (F : J ⥤ Arrow T) [i₁ : HasLimit (F ⋙ leftFunc)] [i₂ : HasLimit (F ⋙ rightFunc)] :
     HasLimit F :=
   @Comma.hasLimit _ _ _ _ _ i₁ i₂ _
 #align category_theory.arrow.has_limit CategoryTheory.Arrow.hasLimit
+-/
 
+#print CategoryTheory.Arrow.hasLimitsOfShape /-
 instance hasLimitsOfShape [HasLimitsOfShape J T] : HasLimitsOfShape J (Arrow T) where
 #align category_theory.arrow.has_limits_of_shape CategoryTheory.Arrow.hasLimitsOfShape
+-/
 
+#print CategoryTheory.Arrow.hasLimits /-
 instance hasLimits [HasLimits T] : HasLimits (Arrow T) :=
   ⟨inferInstance⟩
 #align category_theory.arrow.has_limits CategoryTheory.Arrow.hasLimits
+-/
 
+#print CategoryTheory.Arrow.hasColimit /-
 instance hasColimit (F : J ⥤ Arrow T) [i₁ : HasColimit (F ⋙ leftFunc)]
     [i₂ : HasColimit (F ⋙ rightFunc)] : HasColimit F :=
   @Comma.hasColimit _ _ _ _ _ i₁ i₂ _
 #align category_theory.arrow.has_colimit CategoryTheory.Arrow.hasColimit
+-/
 
+#print CategoryTheory.Arrow.hasColimitsOfShape /-
 instance hasColimitsOfShape [HasColimitsOfShape J T] : HasColimitsOfShape J (Arrow T) where
 #align category_theory.arrow.has_colimits_of_shape CategoryTheory.Arrow.hasColimitsOfShape
+-/
 
+#print CategoryTheory.Arrow.hasColimits /-
 instance hasColimits [HasColimits T] : HasColimits (Arrow T) :=
   ⟨inferInstance⟩
 #align category_theory.arrow.has_colimits CategoryTheory.Arrow.hasColimits
+-/
 
 end Arrow
 
@@ -204,19 +240,26 @@ namespace StructuredArrow
 
 variable {X : T} {G : A ⥤ T} (F : J ⥤ StructuredArrow X G)
 
+#print CategoryTheory.StructuredArrow.hasLimit /-
 instance hasLimit [i₁ : HasLimit (F ⋙ proj X G)] [i₂ : PreservesLimit (F ⋙ proj X G) G] :
     HasLimit F :=
   @Comma.hasLimit _ _ _ _ _ _ i₁ i₂
 #align category_theory.structured_arrow.has_limit CategoryTheory.StructuredArrow.hasLimit
+-/
 
+#print CategoryTheory.StructuredArrow.hasLimitsOfShape /-
 instance hasLimitsOfShape [HasLimitsOfShape J A] [PreservesLimitsOfShape J G] :
     HasLimitsOfShape J (StructuredArrow X G) where
 #align category_theory.structured_arrow.has_limits_of_shape CategoryTheory.StructuredArrow.hasLimitsOfShape
+-/
 
+#print CategoryTheory.StructuredArrow.hasLimits /-
 instance hasLimits [HasLimits A] [PreservesLimits G] : HasLimits (StructuredArrow X G) :=
   ⟨inferInstance⟩
 #align category_theory.structured_arrow.has_limits CategoryTheory.StructuredArrow.hasLimits
+-/
 
+#print CategoryTheory.StructuredArrow.createsLimit /-
 noncomputable instance createsLimit [i : PreservesLimit (F ⋙ proj X G) G] :
     CreatesLimit F (proj X G) :=
   createsLimitOfReflectsIso fun c t =>
@@ -224,24 +267,33 @@ noncomputable instance createsLimit [i : PreservesLimit (F ⋙ proj X G) G] :
       makesLimit := Comma.coneOfPreservesIsLimit _ pUnitConeIsLimit _
       validLift := Cones.ext (Iso.refl _) fun j => (id_comp _).symm }
 #align category_theory.structured_arrow.creates_limit CategoryTheory.StructuredArrow.createsLimit
+-/
 
+#print CategoryTheory.StructuredArrow.createsLimitsOfShape /-
 noncomputable instance createsLimitsOfShape [PreservesLimitsOfShape J G] :
     CreatesLimitsOfShape J (proj X G) where
 #align category_theory.structured_arrow.creates_limits_of_shape CategoryTheory.StructuredArrow.createsLimitsOfShape
+-/
 
+#print CategoryTheory.StructuredArrow.createsLimits /-
 noncomputable instance createsLimits [PreservesLimits G] : CreatesLimits (proj X G : _) :=
   ⟨⟩
 #align category_theory.structured_arrow.creates_limits CategoryTheory.StructuredArrow.createsLimits
+-/
 
+#print CategoryTheory.StructuredArrow.mono_right_of_mono /-
 instance mono_right_of_mono [HasPullbacks A] [PreservesLimitsOfShape WalkingCospan G]
     {Y Z : StructuredArrow X G} (f : Y ⟶ Z) [Mono f] : Mono f.right :=
   show Mono ((proj X G).map f) from inferInstance
 #align category_theory.structured_arrow.mono_right_of_mono CategoryTheory.StructuredArrow.mono_right_of_mono
+-/
 
+#print CategoryTheory.StructuredArrow.mono_iff_mono_right /-
 theorem mono_iff_mono_right [HasPullbacks A] [PreservesLimitsOfShape WalkingCospan G]
     {Y Z : StructuredArrow X G} (f : Y ⟶ Z) : Mono f ↔ Mono f.right :=
   ⟨fun h => inferInstance, fun h => mono_of_mono_right f⟩
 #align category_theory.structured_arrow.mono_iff_mono_right CategoryTheory.StructuredArrow.mono_iff_mono_right
+-/
 
 end StructuredArrow
 
@@ -249,19 +301,26 @@ namespace CostructuredArrow
 
 variable {G : A ⥤ T} {X : T} (F : J ⥤ CostructuredArrow G X)
 
+#print CategoryTheory.CostructuredArrow.hasColimit /-
 instance hasColimit [i₁ : HasColimit (F ⋙ proj G X)] [i₂ : PreservesColimit (F ⋙ proj G X) G] :
     HasColimit F :=
   @Comma.hasColimit _ _ _ _ _ i₁ _ i₂
 #align category_theory.costructured_arrow.has_colimit CategoryTheory.CostructuredArrow.hasColimit
+-/
 
+#print CategoryTheory.CostructuredArrow.hasColimitsOfShape /-
 instance hasColimitsOfShape [HasColimitsOfShape J A] [PreservesColimitsOfShape J G] :
     HasColimitsOfShape J (CostructuredArrow G X) where
 #align category_theory.costructured_arrow.has_colimits_of_shape CategoryTheory.CostructuredArrow.hasColimitsOfShape
+-/
 
+#print CategoryTheory.CostructuredArrow.hasColimits /-
 instance hasColimits [HasColimits A] [PreservesColimits G] : HasColimits (CostructuredArrow G X) :=
   ⟨inferInstance⟩
 #align category_theory.costructured_arrow.has_colimits CategoryTheory.CostructuredArrow.hasColimits
+-/
 
+#print CategoryTheory.CostructuredArrow.createsColimit /-
 noncomputable instance createsColimit [i : PreservesColimit (F ⋙ proj G X) G] :
     CreatesColimit F (proj G X) :=
   createsColimitOfReflectsIso fun c t =>
@@ -269,24 +328,33 @@ noncomputable instance createsColimit [i : PreservesColimit (F ⋙ proj G X) G]
       makesColimit := Comma.coconeOfPreservesIsColimit _ _ pUnitCoconeIsColimit
       validLift := Cocones.ext (Iso.refl _) fun j => comp_id _ }
 #align category_theory.costructured_arrow.creates_colimit CategoryTheory.CostructuredArrow.createsColimit
+-/
 
+#print CategoryTheory.CostructuredArrow.createsColimitsOfShape /-
 noncomputable instance createsColimitsOfShape [PreservesColimitsOfShape J G] :
     CreatesColimitsOfShape J (proj G X) where
 #align category_theory.costructured_arrow.creates_colimits_of_shape CategoryTheory.CostructuredArrow.createsColimitsOfShape
+-/
 
+#print CategoryTheory.CostructuredArrow.createsColimits /-
 noncomputable instance createsColimits [PreservesColimits G] : CreatesColimits (proj G X : _) :=
   ⟨⟩
 #align category_theory.costructured_arrow.creates_colimits CategoryTheory.CostructuredArrow.createsColimits
+-/
 
+#print CategoryTheory.CostructuredArrow.epi_left_of_epi /-
 instance epi_left_of_epi [HasPushouts A] [PreservesColimitsOfShape WalkingSpan G]
     {Y Z : CostructuredArrow G X} (f : Y ⟶ Z) [Epi f] : Epi f.left :=
   show Epi ((proj G X).map f) from inferInstance
 #align category_theory.costructured_arrow.epi_left_of_epi CategoryTheory.CostructuredArrow.epi_left_of_epi
+-/
 
+#print CategoryTheory.CostructuredArrow.epi_iff_epi_left /-
 theorem epi_iff_epi_left [HasPushouts A] [PreservesColimitsOfShape WalkingSpan G]
     {Y Z : CostructuredArrow G X} (f : Y ⟶ Z) : Epi f ↔ Epi f.left :=
   ⟨fun h => inferInstance, fun h => epi_of_epi_left f⟩
 #align category_theory.costructured_arrow.epi_iff_epi_left CategoryTheory.CostructuredArrow.epi_iff_epi_left
+-/
 
 end CostructuredArrow

70fd9563

bump to nightly-2023-03-04-12

mathlib commit https://github.com/leanprover-community/mathlib/commit/62e8311c791f02c47451bf14aa2501048e7c2f33

726b2da6

Diff

@@ -220,8 +220,8 @@ instance hasLimits [HasLimits A] [PreservesLimits G] : HasLimits (StructuredArro
 noncomputable instance createsLimit [i : PreservesLimit (F ⋙ proj X G) G] :
     CreatesLimit F (proj X G) :=
   createsLimitOfReflectsIso fun c t =>
-    { liftedCone := @Comma.coneOfPreserves _ _ _ _ _ i punitCone t
-      makesLimit := Comma.coneOfPreservesIsLimit _ punitConeIsLimit _
+    { liftedCone := @Comma.coneOfPreserves _ _ _ _ _ i pUnitCone t
+      makesLimit := Comma.coneOfPreservesIsLimit _ pUnitConeIsLimit _
       validLift := Cones.ext (Iso.refl _) fun j => (id_comp _).symm }
 #align category_theory.structured_arrow.creates_limit CategoryTheory.StructuredArrow.createsLimit
 
@@ -265,8 +265,8 @@ instance hasColimits [HasColimits A] [PreservesColimits G] : HasColimits (Costru
 noncomputable instance createsColimit [i : PreservesColimit (F ⋙ proj G X) G] :
     CreatesColimit F (proj G X) :=
   createsColimitOfReflectsIso fun c t =>
-    { liftedCocone := @Comma.coconeOfPreserves _ _ _ _ _ i t punitCocone
-      makesColimit := Comma.coconeOfPreservesIsColimit _ _ punitCoconeIsColimit
+    { liftedCocone := @Comma.coconeOfPreserves _ _ _ _ _ i t pUnitCocone
+      makesColimit := Comma.coconeOfPreservesIsColimit _ _ pUnitCoconeIsColimit
       validLift := Cocones.ext (Iso.refl _) fun j => comp_id _ }
 #align category_theory.costructured_arrow.creates_colimit CategoryTheory.CostructuredArrow.createsColimit

70fd9563

bump to nightly-2023-02-28-22

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

1fb1623f

Diff

@@ -61,9 +61,9 @@ cone.
 def coneOfPreserves [PreservesLimit (F ⋙ snd L R) R] (c₁ : Cone (F ⋙ fst L R))
     {c₂ : Cone (F ⋙ snd L R)} (t₂ : IsLimit c₂) : Cone F
     where
-  x :=
-    { left := c₁.x
-      right := c₂.x
+  pt :=
+    { left := c₁.pt
+      right := c₂.pt
       Hom := (isLimitOfPreserves R t₂).lift (limitAuxiliaryCone _ c₁) }
   π :=
     { app := fun j =>
@@ -110,9 +110,9 @@ colimit cocone.
 def coconeOfPreserves [PreservesColimit (F ⋙ fst L R) L] {c₁ : Cocone (F ⋙ fst L R)}
     (t₁ : IsColimit c₁) (c₂ : Cocone (F ⋙ snd L R)) : Cocone F
     where
-  x :=
-    { left := c₁.x
-      right := c₂.x
+  pt :=
+    { left := c₁.pt
+      right := c₂.pt
       Hom := (isColimitOfPreserves L t₁).desc (colimitAuxiliaryCocone _ c₂) }
   ι :=
     { app := fun j =>

70fd9563

bump to nightly-2023-02-27-08

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

91d8c210

Diff

@@ -89,7 +89,7 @@ def coneOfPreservesIsLimit [PreservesLimit (F ⋙ snd L R) R] {c₁ : Cone (F 
             limit_auxiliary_cone_π_app, ← L.map_comp_assoc, t₁.fac, R.map_cone_π_app, ← R.map_comp,
             t₂.fac]
           exact (s.π.app j).w }
-  uniq' s m w :=
+  uniq s m w :=
     CommaMorphism.ext _ _ (t₁.uniq ((fst L R).mapCone s) _ fun j => by simp [← w])
       (t₂.uniq ((snd L R).mapCone s) _ fun j => by simp [← w])
 #align category_theory.comma.cone_of_preserves_is_limit CategoryTheory.Comma.coneOfPreservesIsLimit
@@ -138,7 +138,7 @@ def coconeOfPreservesIsColimit [PreservesColimit (F ⋙ fst L R) L] {c₁ : Coco
             colimit_auxiliary_cocone_ι_app, assoc, ← R.map_comp, t₂.fac, L.map_cocone_ι_app, ←
             L.map_comp_assoc, t₁.fac]
           exact (s.ι.app j).w }
-  uniq' s m w :=
+  uniq s m w :=
     CommaMorphism.ext _ _ (t₁.uniq ((fst L R).mapCocone s) _ (by simp [← w]))
       (t₂.uniq ((snd L R).mapCocone s) _ (by simp [← w]))
 #align category_theory.comma.cocone_of_preserves_is_colimit CategoryTheory.Comma.coconeOfPreservesIsColimit

70fd9563

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

70fd9563

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

@@ -30,17 +30,13 @@ open Category Limits
 universe w' w v₁ v₂ v₃ u₁ u₂ u₃
 
 variable {J : Type w} [Category.{w'} J]
-
 variable {A : Type u₁} [Category.{v₁} A]
-
 variable {B : Type u₂} [Category.{v₂} B]
-
 variable {T : Type u₃} [Category.{v₃} T]
 
 namespace Comma
 
 variable {L : A ⥤ T} {R : B ⥤ T}
-
 variable (F : J ⥤ Comma L R)
 
 /-- (Implementation). An auxiliary cone which is useful in order to construct limits

70fd9563

refactor: create folder CategoryTheory/Comma (#10108)

38cd7278

Diff

@@ -3,11 +3,11 @@ Copyright (c) 2021 Bhavik Mehta. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
 -/
-import Mathlib.CategoryTheory.Arrow
+import Mathlib.CategoryTheory.Comma.Arrow
+import Mathlib.CategoryTheory.Comma.StructuredArrow
 import Mathlib.CategoryTheory.Limits.Constructions.EpiMono
 import Mathlib.CategoryTheory.Limits.Creates
 import Mathlib.CategoryTheory.Limits.Unit
-import Mathlib.CategoryTheory.StructuredArrow
 
 #align_import category_theory.limits.comma from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"

70fd9563

refactor: move morphisms in StructuredArrow to a lower universe (#6397)

This PR changes the definition

abbrev fromPUnit (X : C) : Discrete PUnit.{v + 1} ⥤ C :=
  (Functor.const _).obj X

abbrev fromPUnit (X : C) : Discrete PUnit.{w + 1} ⥤ C :=
  (Functor.const _).obj X

and then redefines

def StructuredArrow (S : D) (T : C ⥤ D) :=
  Comma (Functor.fromPUnit S) T

def StructuredArrow (S : D) (T : C ⥤ D) :=
  Comma (Functor.fromPUnit.{0} S) T

The effect of this is that given {C : Type u₁} [Category.{v₁} C] {D : Type u₂} [Category.{v₂} D] (S : D) (T : C ⥤ D), the morphisms of StructuredArrow S T no longer live in max v₁ v₂, but in v₁, as they should. Thus, this PR is basically a better version of #6388.

My guess for why we used to have the larger universe is that back in the day, the universes for limits were much more restricted, so stating the results of Limits/Comma.lean was not possible if the morphisms of StructuredArrow live in v₁. Luckily, by now it is possible to state everything correctly, and this PR adjusts Limits/Comma.lean and Limits/Over.lean accordingly.

7499ee49

Diff

@@ -27,15 +27,15 @@ namespace CategoryTheory
 
 open Category Limits
 
-universe w' w v u₁ u₂ u₃
+universe w' w v₁ v₂ v₃ u₁ u₂ u₃
 
 variable {J : Type w} [Category.{w'} J]
 
-variable {A : Type u₁} [Category.{v} A]
+variable {A : Type u₁} [Category.{v₁} A]
 
-variable {B : Type u₂} [Category.{v} B]
+variable {B : Type u₂} [Category.{v₂} B]
 
-variable {T : Type u₃} [Category.{v} T]
+variable {T : Type u₃} [Category.{v₃} T]
 
 namespace Comma
 
@@ -153,9 +153,10 @@ instance hasLimitsOfShape [HasLimitsOfShape J A] [HasLimitsOfShape J B]
     [PreservesLimitsOfShape J R] : HasLimitsOfShape J (Comma L R) where
 #align category_theory.comma.has_limits_of_shape CategoryTheory.Comma.hasLimitsOfShape
 
-instance hasLimits [HasLimits A] [HasLimits B] [PreservesLimits R] : HasLimits (Comma L R) :=
+instance hasLimitsOfSize [HasLimitsOfSize.{w, w'} A] [HasLimitsOfSize.{w, w'} B]
+    [PreservesLimitsOfSize.{w, w'} R] : HasLimitsOfSize.{w, w'} (Comma L R) :=
   ⟨fun _ _ => inferInstance⟩
-#align category_theory.comma.has_limits CategoryTheory.Comma.hasLimits
+#align category_theory.comma.has_limits CategoryTheory.Comma.hasLimitsOfSize
 
 instance hasColimit (F : J ⥤ Comma L R) [HasColimit (F ⋙ fst L R)] [HasColimit (F ⋙ snd L R)]
     [PreservesColimit (F ⋙ fst L R) L] : HasColimit F :=
@@ -166,10 +167,10 @@ instance hasColimitsOfShape [HasColimitsOfShape J A] [HasColimitsOfShape J B]
     [PreservesColimitsOfShape J L] : HasColimitsOfShape J (Comma L R) where
 #align category_theory.comma.has_colimits_of_shape CategoryTheory.Comma.hasColimitsOfShape
 
-instance hasColimits [HasColimits A] [HasColimits B] [PreservesColimits L] :
-    HasColimits (Comma L R) :=
+instance hasColimitsOfSize [HasColimitsOfSize.{w, w'} A] [HasColimitsOfSize.{w, w'} B]
+    [PreservesColimitsOfSize.{w, w'} L] : HasColimitsOfSize.{w, w'} (Comma L R) :=
   ⟨fun _ _ => inferInstance⟩
-#align category_theory.comma.has_colimits CategoryTheory.Comma.hasColimits
+#align category_theory.comma.has_colimits CategoryTheory.Comma.hasColimitsOfSize
 
 end Comma
 
@@ -220,9 +221,10 @@ instance hasLimitsOfShape [HasLimitsOfShape J A] [PreservesLimitsOfShape J G] :
     HasLimitsOfShape J (StructuredArrow X G) where
 #align category_theory.structured_arrow.has_limits_of_shape CategoryTheory.StructuredArrow.hasLimitsOfShape
 
-instance hasLimits [HasLimits A] [PreservesLimits G] : HasLimits (StructuredArrow X G) :=
+instance hasLimitsOfSize [HasLimitsOfSize.{w, w'} A] [PreservesLimitsOfSize.{w, w'} G] :
+    HasLimitsOfSize.{w, w'} (StructuredArrow X G) :=
   ⟨fun J hJ => by infer_instance⟩
-#align category_theory.structured_arrow.has_limits CategoryTheory.StructuredArrow.hasLimits
+#align category_theory.structured_arrow.has_limits CategoryTheory.StructuredArrow.hasLimitsOfSize
 
 noncomputable instance createsLimit [i : PreservesLimit (F ⋙ proj X G) G] :
     CreatesLimit F (proj X G) :=
@@ -237,8 +239,9 @@ noncomputable instance createsLimitsOfShape [PreservesLimitsOfShape J G] :
     CreatesLimitsOfShape J (proj X G) where
 #align category_theory.structured_arrow.creates_limits_of_shape CategoryTheory.StructuredArrow.createsLimitsOfShape
 
-noncomputable instance createsLimits [PreservesLimits G] : CreatesLimits (proj X G : _) where
-#align category_theory.structured_arrow.creates_limits CategoryTheory.StructuredArrow.createsLimits
+noncomputable instance createsLimitsOfSize [PreservesLimitsOfSize.{w, w'} G] :
+    CreatesLimitsOfSize.{w, w'} (proj X G : _) where
+#align category_theory.structured_arrow.creates_limits CategoryTheory.StructuredArrow.createsLimitsOfSize
 
 instance mono_right_of_mono [HasPullbacks A] [PreservesLimitsOfShape WalkingCospan G]
     {Y Z : StructuredArrow X G} (f : Y ⟶ Z) [Mono f] : Mono f.right :=
@@ -267,9 +270,10 @@ instance hasColimitsOfShape [HasColimitsOfShape J A] [PreservesColimitsOfShape J
     HasColimitsOfShape J (CostructuredArrow G X) where
 #align category_theory.costructured_arrow.has_colimits_of_shape CategoryTheory.CostructuredArrow.hasColimitsOfShape
 
-instance hasColimits [HasColimits A] [PreservesColimits G] : HasColimits (CostructuredArrow G X) :=
+instance hasColimitsOfSize [HasColimitsOfSize.{w, w'} A] [PreservesColimitsOfSize.{w, w'} G] :
+    HasColimitsOfSize.{w, w'} (CostructuredArrow G X) :=
   ⟨fun _ _ => inferInstance⟩
-#align category_theory.costructured_arrow.has_colimits CategoryTheory.CostructuredArrow.hasColimits
+#align category_theory.costructured_arrow.has_colimits CategoryTheory.CostructuredArrow.hasColimitsOfSize
 
 noncomputable instance createsColimit [i : PreservesColimit (F ⋙ proj G X) G] :
     CreatesColimit F (proj G X) :=
@@ -284,8 +288,9 @@ noncomputable instance createsColimitsOfShape [PreservesColimitsOfShape J G] :
     CreatesColimitsOfShape J (proj G X) where
 #align category_theory.costructured_arrow.creates_colimits_of_shape CategoryTheory.CostructuredArrow.createsColimitsOfShape
 
-noncomputable instance createsColimits [PreservesColimits G] : CreatesColimits (proj G X : _) where
-#align category_theory.costructured_arrow.creates_colimits CategoryTheory.CostructuredArrow.createsColimits
+noncomputable instance createsColimitsOfSize [PreservesColimitsOfSize.{w, w'} G] :
+    CreatesColimitsOfSize.{w, w'} (proj G X : _) where
+#align category_theory.costructured_arrow.creates_colimits CategoryTheory.CostructuredArrow.createsColimitsOfSize
 
 instance epi_left_of_epi [HasPushouts A] [PreservesColimitsOfShape WalkingSpan G]
     {Y Z : CostructuredArrow G X} (f : Y ⟶ Z) [Epi f] : Epi f.left :=

70fd9563

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,11 +2,6 @@
 Copyright (c) 2021 Bhavik Mehta. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
-
-! This file was ported from Lean 3 source module category_theory.limits.comma
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.CategoryTheory.Arrow
 import Mathlib.CategoryTheory.Limits.Constructions.EpiMono
@@ -14,6 +9,8 @@ import Mathlib.CategoryTheory.Limits.Creates
 import Mathlib.CategoryTheory.Limits.Unit
 import Mathlib.CategoryTheory.StructuredArrow
 
+#align_import category_theory.limits.comma from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"
+
 /-!
 # Limits and colimits in comma categories

70fd9563

chore: cleanup whitespace (#5988)

Grepping for [^ .:{-] [^ :] and reviewing the results. Once I started I couldn't stop. :-)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

12343aa5

Diff

@@ -131,7 +131,7 @@ def coconeOfPreserves [PreservesColimit (F ⋙ fst L R) L] {c₁ : Cocone (F ⋙
 a colimit. -/
 def coconeOfPreservesIsColimit [PreservesColimit (F ⋙ fst L R) L] {c₁ : Cocone (F ⋙ fst L R)}
     (t₁ : IsColimit c₁) {c₂ : Cocone (F ⋙ snd L R)} (t₂ : IsColimit c₂) :
-    IsColimit (coconeOfPreserves F t₁ c₂)  where
+    IsColimit (coconeOfPreserves F t₁ c₂) where
   desc s :=
     { left := t₁.desc ((fst L R).mapCocone s)
       right := t₂.desc ((snd L R).mapCocone s)

70fd9563

chore: tidy various files (#4997)

95de1dee

Diff

@@ -72,8 +72,8 @@ def coneOfPreserves [PreservesLimit (F ⋙ snd L R) R] (c₁ : Cone (F ⋙ fst L
           w := ((isLimitOfPreserves R t₂).fac (limitAuxiliaryCone F c₁) j).symm }
       naturality := fun j₁ j₂ t => by
         ext
-        . simp [← c₁.w t]
-        . simp [← c₂.w t] }
+        · simp [← c₁.w t]
+        · simp [← c₂.w t] }
 #align category_theory.comma.cone_of_preserves CategoryTheory.Comma.coneOfPreserves
 
 /-- Provided that `R` preserves the appropriate limit, then the cone in `coneOfPreserves` is a
@@ -92,8 +92,8 @@ def coneOfPreservesIsLimit [PreservesLimit (F ⋙ snd L R) R] {c₁ : Cone (F 
           exact (s.π.app j).w }
   uniq s m w := by
     apply CommaMorphism.ext
-    . exact t₁.uniq ((fst L R).mapCone s) _ (fun j => by simp [← w])
-    . exact t₂.uniq ((snd L R).mapCone s) _ (fun j => by simp [← w])
+    · exact t₁.uniq ((fst L R).mapCone s) _ (fun j => by simp [← w])
+    · exact t₂.uniq ((snd L R).mapCone s) _ (fun j => by simp [← w])
 #align category_theory.comma.cone_of_preserves_is_limit CategoryTheory.Comma.coneOfPreservesIsLimit
 
 /-- (Implementation). An auxiliary cocone which is useful in order to construct colimits
@@ -123,8 +123,8 @@ def coconeOfPreserves [PreservesColimit (F ⋙ fst L R) L] {c₁ : Cocone (F ⋙
           w := (isColimitOfPreserves L t₁).fac (colimitAuxiliaryCocone _ c₂) j }
       naturality := fun j₁ j₂ t => by
         ext
-        . simp [← c₁.w t]
-        . simp [← c₂.w t] }
+        · simp [← c₁.w t]
+        · simp [← c₂.w t] }
 #align category_theory.comma.cocone_of_preserves CategoryTheory.Comma.coconeOfPreserves
 
 /-- Provided that `L` preserves the appropriate colimit, then the cocone in `coconeOfPreserves` is
@@ -143,8 +143,8 @@ def coconeOfPreservesIsColimit [PreservesColimit (F ⋙ fst L R) L] {c₁ : Coco
           exact (s.ι.app j).w }
   uniq s m w := by
     apply CommaMorphism.ext
-    . exact t₁.uniq ((fst L R).mapCocone s) _ (fun j => by simp [← w])
-    . exact t₂.uniq ((snd L R).mapCocone s) _ (fun j => by simp [← w])
+    · exact t₁.uniq ((fst L R).mapCocone s) _ (fun j => by simp [← w])
+    · exact t₂.uniq ((snd L R).mapCocone s) _ (fun j => by simp [← w])
 #align category_theory.comma.cocone_of_preserves_is_colimit CategoryTheory.Comma.coconeOfPreservesIsColimit
 
 instance hasLimit (F : J ⥤ Comma L R) [HasLimit (F ⋙ fst L R)] [HasLimit (F ⋙ snd L R)]
@@ -231,8 +231,8 @@ noncomputable instance createsLimit [i : PreservesLimit (F ⋙ proj X G) G] :
     CreatesLimit F (proj X G) :=
   letI : PreservesLimit (F ⋙ Comma.snd (Functor.fromPUnit X) G) G := i
   createsLimitOfReflectsIso fun _ t =>
-    { liftedCone := Comma.coneOfPreserves F pUnitCone t
-      makesLimit := Comma.coneOfPreservesIsLimit _ pUnitConeIsLimit _
+    { liftedCone := Comma.coneOfPreserves F punitCone t
+      makesLimit := Comma.coneOfPreservesIsLimit _ punitConeIsLimit _
       validLift := Cones.ext (Iso.refl _) fun _ => (id_comp _).symm }
 #align category_theory.structured_arrow.creates_limit CategoryTheory.StructuredArrow.createsLimit
 
@@ -278,8 +278,8 @@ noncomputable instance createsColimit [i : PreservesColimit (F ⋙ proj G X) G]
     CreatesColimit F (proj G X) :=
   letI : PreservesColimit (F ⋙ Comma.fst G (Functor.fromPUnit X)) G := i
   createsColimitOfReflectsIso fun _ t =>
-    { liftedCocone := Comma.coconeOfPreserves F t pUnitCocone
-      makesColimit := Comma.coconeOfPreservesIsColimit _ _ pUnitCoconeIsColimit
+    { liftedCocone := Comma.coconeOfPreserves F t punitCocone
+      makesColimit := Comma.coconeOfPreservesIsColimit _ _ punitCoconeIsColimit
       validLift := Cocones.ext (Iso.refl _) fun _ => comp_id _ }
 #align category_theory.costructured_arrow.creates_colimit CategoryTheory.CostructuredArrow.createsColimit

70fd9563

chore: bye-bye, solo bys! (#3825)

This PR puts, with one exception, every single remaining by that lies all by itself on its own line to the previous line, thus matching the current behaviour of start-port.sh. The exception is when the by begins the second or later argument to a tuple or anonymous constructor; see https://github.com/leanprover-community/mathlib4/pull/3825#discussion_r1186702599.

Essentially this is s/\n *by$/ by/g, but with manual editing to satisfy the linter's max-100-char-line requirement. The Python style linter is also modified to catch these "isolated bys".

14167e48

Diff

@@ -136,8 +136,7 @@ def coconeOfPreservesIsColimit [PreservesColimit (F ⋙ fst L R) L] {c₁ : Coco
     { left := t₁.desc ((fst L R).mapCocone s)
       right := t₂.desc ((snd L R).mapCocone s)
       w :=
-        (isColimitOfPreserves L t₁).hom_ext fun j =>
-          by
+        (isColimitOfPreserves L t₁).hom_ext fun j => by
           rw [coconeOfPreserves_pt_hom, (isColimitOfPreserves L t₁).fac_assoc,
             colimitAuxiliaryCocone_ι_app, assoc, ← R.map_comp, t₂.fac, L.mapCocone_ι_app, ←
             L.map_comp_assoc, t₁.fac]

70fd9563

chore: fix #align lines (#3640)

This PR fixes two things:

Most align statements for definitions and theorems and instances that are separated by two newlines from the relevant declaration (s/\n\n#align/\n#align). This is often seen in the mathport output after ending calc blocks.
All remaining more-than-one-line #align statements. (This was needed for a script I wrote for #3630.)

2b42dc7c

Diff

@@ -242,7 +242,6 @@ noncomputable instance createsLimitsOfShape [PreservesLimitsOfShape J G] :
 #align category_theory.structured_arrow.creates_limits_of_shape CategoryTheory.StructuredArrow.createsLimitsOfShape
 
 noncomputable instance createsLimits [PreservesLimits G] : CreatesLimits (proj X G : _) where
-
 #align category_theory.structured_arrow.creates_limits CategoryTheory.StructuredArrow.createsLimits
 
 instance mono_right_of_mono [HasPullbacks A] [PreservesLimitsOfShape WalkingCospan G]

70fd9563

feat: port CategoryTheory.Limits.Comma (#2776)

e26fd77f

`category_theory.limits.comma` ⟷ `Mathlib.CategoryTheory.Limits.Comma`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 115

category_theory.limits.comma ⟷ Mathlib.CategoryTheory.Limits.Comma

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 115

`category_theory.limits.comma` ⟷ `Mathlib.CategoryTheory.Limits.Comma`