category_theory.limits.bicones | 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

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Andrew Yang
 -/
 import CategoryTheory.Limits.Cones
-import CategoryTheory.FinCategory
+import CategoryTheory.FinCategory.Basic
 
 #align_import category_theory.limits.bicones 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,8 +3,8 @@ 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.Limits.Cones
-import Mathbin.CategoryTheory.FinCategory
+import CategoryTheory.Limits.Cones
+import CategoryTheory.FinCategory
 
 #align_import category_theory.limits.bicones from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"

69c6a5a1

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 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.limits.bicones
-! 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.Limits.Cones
 import Mathbin.CategoryTheory.FinCategory
 
+#align_import category_theory.limits.bicones from "leanprover-community/mathlib"@"69c6a5a12d8a2b159f20933e60115a4f2de62b58"
+
 /-!
 # Bicones

69c6a5a1

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -35,7 +35,7 @@ noncomputable section
 
 open CategoryTheory.Limits
 
-open Classical
+open scoped Classical
 
 namespace CategoryTheory

69c6a5a1

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -60,9 +60,7 @@ instance : Inhabited (Bicone J) :=
 instance finBicone [Fintype J] : Fintype (Bicone J)
     where
   elems := [Bicone.left, Bicone.right].toFinset ∪ Finset.image Bicone.diagram (Fintype.elems J)
-  complete j := by
-    cases j <;> simp
-    exact Fintype.complete j
+  complete j := by cases j <;> simp; exact Fintype.complete j
 #align category_theory.fin_bicone CategoryTheory.finBicone
 -/
 
@@ -95,15 +93,10 @@ instance biconeCategoryStruct : CategoryStruct (Bicone J)
   Hom := BiconeHom J
   id j := Bicone.casesOn j BiconeHom.left_id BiconeHom.right_id fun k => BiconeHom.diagram (𝟙 k)
   comp X Y Z f g := by
-    cases f
-    exact g
-    exact g
-    cases g
-    exact bicone_hom.left g_k
-    cases g
-    exact bicone_hom.right g_k
-    cases g
-    exact bicone_hom.diagram (f_f ≫ g_f)
+    cases f; exact g; exact g
+    cases g; exact bicone_hom.left g_k
+    cases g; exact bicone_hom.right g_k
+    cases g; exact bicone_hom.diagram (f_f ≫ g_f)
 #align category_theory.bicone_category_struct CategoryTheory.biconeCategoryStruct
 -/
 
@@ -130,9 +123,7 @@ def biconeMk {C : Type u₁} [Category.{v₁} C] {F : J ⥤ C} (c₁ c₂ : Cone
     where
   obj X := Bicone.casesOn X c₁.pt c₂.pt fun j => F.obj j
   map X Y f := by
-    cases f
-    exact 𝟙 _
-    exact 𝟙 _
+    cases f; exact 𝟙 _; exact 𝟙 _
     exact c₁.π.app f_1
     exact c₂.π.app f_1
     exact F.map f_f
@@ -141,12 +132,9 @@ def biconeMk {C : Type u₁} [Category.{v₁} C] {F : J ⥤ C} (c₁ c₂ : Cone
     cases f
     exact (category.id_comp _).symm
     exact (category.id_comp _).symm
-    cases g
-    exact (category.id_comp _).symm.trans (c₁.π.naturality g_f : _)
-    cases g
-    exact (category.id_comp _).symm.trans (c₂.π.naturality g_f : _)
-    cases g
-    exact F.map_comp _ _
+    cases g; exact (category.id_comp _).symm.trans (c₁.π.naturality g_f : _)
+    cases g; exact (category.id_comp _).symm.trans (c₂.π.naturality g_f : _)
+    cases g; exact F.map_comp _ _
 #align category_theory.bicone_mk CategoryTheory.biconeMk
 -/
 
@@ -156,30 +144,22 @@ instance finBiconeHom [FinCategory J] (j k : Bicone J) : Fintype (j ⟶ k) :=
   cases j <;> cases k
   exact
     { elems := {bicone_hom.left_id}
-      complete := fun f => by
-        cases f
-        simp }
+      complete := fun f => by cases f; simp }
   exact
     { elems := ∅
       complete := fun f => by cases f }
   exact
     { elems := {bicone_hom.left k}
-      complete := fun f => by
-        cases f
-        simp }
+      complete := fun f => by cases f; simp }
   exact
     { elems := ∅
       complete := fun f => by cases f }
   exact
     { elems := {bicone_hom.right_id}
-      complete := fun f => by
-        cases f
-        simp }
+      complete := fun f => by cases f; simp }
   exact
     { elems := {bicone_hom.right k}
-      complete := fun f => by
-        cases f
-        simp }
+      complete := fun f => by cases f; simp }
   exact
     { elems := ∅
       complete := fun f => by cases f }
@@ -188,10 +168,7 @@ instance finBiconeHom [FinCategory J] (j k : Bicone J) : Fintype (j ⟶ k) :=
       complete := fun f => by cases f }
   exact
     { elems := Finset.image bicone_hom.diagram (Fintype.elems (j ⟶ k))
-      complete := fun f => by
-        cases f
-        simp only [Finset.mem_image]
-        use f_f
+      complete := fun f => by cases f; simp only [Finset.mem_image]; use f_f;
         simpa using Fintype.complete _ }
 #align category_theory.fin_bicone_hom CategoryTheory.finBiconeHom
 -/

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: Andrew Yang
 
 ! This file was ported from Lean 3 source module category_theory.limits.bicones
-! 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.
 -/
@@ -14,6 +14,9 @@ import Mathbin.CategoryTheory.FinCategory
 /-!
 # Bicones
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 Given a category `J`, a walking `bicone J` is a category whose objects are the objects of `J` and
 two extra vertices `bicone.left` and `bicone.right`. The morphisms are the morphisms of `J` and
 `left ⟶ j`, `right ⟶ j` for each `j : J` such that `⬝ ⟶ j` and `⬝ ⟶ k` commutes with each

70fd9563

bump to nightly-2023-03-11-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/3180fab693e2cee3bff62675571264cb8778b212

cd44fb92

Diff

@@ -40,6 +40,7 @@ section Bicone
 
 variable (J : Type u₁)
 
+#print CategoryTheory.Bicone /-
 /-- Given a category `J`, construct a walking `bicone J` by adjoining two elements. -/
 inductive Bicone
   | left : bicone
@@ -47,10 +48,12 @@ inductive Bicone
   | diagram (val : J) : bicone
   deriving DecidableEq
 #align category_theory.bicone CategoryTheory.Bicone
+-/
 
 instance : Inhabited (Bicone J) :=
   ⟨Bicone.left⟩
 
+#print CategoryTheory.finBicone /-
 instance finBicone [Fintype J] : Fintype (Bicone J)
     where
   elems := [Bicone.left, Bicone.right].toFinset ∪ Finset.image Bicone.diagram (Fintype.elems J)
@@ -58,9 +61,11 @@ instance finBicone [Fintype J] : Fintype (Bicone J)
     cases j <;> simp
     exact Fintype.complete j
 #align category_theory.fin_bicone CategoryTheory.finBicone
+-/
 
 variable [Category.{v₁} J]
 
+#print CategoryTheory.BiconeHom /-
 /-- The homs for a walking `bicone J`. -/
 inductive BiconeHom : Bicone J → Bicone J → Type max u₁ v₁
   | left_id : bicone_hom Bicone.left Bicone.left
@@ -69,14 +74,18 @@ inductive BiconeHom : Bicone J → Bicone J → Type max u₁ v₁
   | right (j : J) : bicone_hom Bicone.right (Bicone.diagram j)
   | diagram {j k : J} (f : j ⟶ k) : bicone_hom (Bicone.diagram j) (Bicone.diagram k)
 #align category_theory.bicone_hom CategoryTheory.BiconeHom
+-/
 
 instance : Inhabited (BiconeHom J Bicone.left Bicone.left) :=
   ⟨BiconeHom.left_id⟩
 
+#print CategoryTheory.BiconeHom.decidableEq /-
 instance BiconeHom.decidableEq {j k : Bicone J} : DecidableEq (BiconeHom J j k) := fun f g => by
   cases f <;> cases g <;> simp <;> infer_instance
 #align category_theory.bicone_hom.decidable_eq CategoryTheory.BiconeHom.decidableEq
+-/
 
+#print CategoryTheory.biconeCategoryStruct /-
 @[simps]
 instance biconeCategoryStruct : CategoryStruct (Bicone J)
     where
@@ -93,13 +102,16 @@ instance biconeCategoryStruct : CategoryStruct (Bicone J)
     cases g
     exact bicone_hom.diagram (f_f ≫ g_f)
 #align category_theory.bicone_category_struct CategoryTheory.biconeCategoryStruct
+-/
 
+#print CategoryTheory.biconeCategory /-
 instance biconeCategory : Category (Bicone J)
     where
   id_comp' X Y f := by cases f <;> simp
   comp_id' X Y f := by cases f <;> simp
   assoc' W X Y Z f g h := by cases f <;> cases g <;> cases h <;> simp
 #align category_theory.bicone_category CategoryTheory.biconeCategory
+-/
 
 end Bicone
 
@@ -107,6 +119,7 @@ section SmallCategory
 
 variable (J : Type v₁) [SmallCategory J]
 
+#print CategoryTheory.biconeMk /-
 /-- Given a diagram `F : J ⥤ C` and two `cone F`s, we can join them into a diagram `bicone J ⥤ C`.
 -/
 @[simps]
@@ -132,7 +145,9 @@ def biconeMk {C : Type u₁} [Category.{v₁} C] {F : J ⥤ C} (c₁ c₂ : Cone
     cases g
     exact F.map_comp _ _
 #align category_theory.bicone_mk CategoryTheory.biconeMk
+-/
 
+#print CategoryTheory.finBiconeHom /-
 instance finBiconeHom [FinCategory J] (j k : Bicone J) : Fintype (j ⟶ k) :=
   by
   cases j <;> cases k
@@ -176,13 +191,18 @@ instance finBiconeHom [FinCategory J] (j k : Bicone J) : Fintype (j ⟶ k) :=
         use f_f
         simpa using Fintype.complete _ }
 #align category_theory.fin_bicone_hom CategoryTheory.finBiconeHom
+-/
 
+#print CategoryTheory.biconeSmallCategory /-
 instance biconeSmallCategory : SmallCategory (Bicone J) :=
   CategoryTheory.biconeCategory J
 #align category_theory.bicone_small_category CategoryTheory.biconeSmallCategory
+-/
 
+#print CategoryTheory.biconeFinCategory /-
 instance biconeFinCategory [FinCategory J] : FinCategory (Bicone J) where
 #align category_theory.bicone_fin_category CategoryTheory.biconeFinCategory
+-/
 
 end SmallCategory

70fd9563

bump to nightly-2023-02-28-22

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

1fb1623f

Diff

@@ -112,7 +112,7 @@ variable (J : Type v₁) [SmallCategory J]
 @[simps]
 def biconeMk {C : Type u₁} [Category.{v₁} C] {F : J ⥤ C} (c₁ c₂ : Cone F) : Bicone J ⥤ C
     where
-  obj X := Bicone.casesOn X c₁.x c₂.x fun j => F.obj j
+  obj X := Bicone.casesOn X c₁.pt c₂.pt fun j => F.obj j
   map X Y f := by
     cases f
     exact 𝟙 _

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: scope open Classical (#11199)

We remove all but one open Classicals, instead preferring to use open scoped Classical. The only real side-effect this led to is moving a couple declarations to use Exists.choose instead of Classical.choose.

The first few commits are explicitly labelled regex replaces for ease of review.

c747be0a

Diff

@@ -29,7 +29,7 @@ noncomputable section
 
 open CategoryTheory.Limits
 
-open Classical
+open scoped Classical
 
 namespace CategoryTheory

70fd9563

chore: split CategoryTheory.FinCategory (#9923)

Minor clean up of imports, getting ready to minimize the heartbeats variation observed/reduced in #9732.

This has the effect of slightly (although not enough) delaying the import of positivity (which in turn imports the kitchen sink) into the category theory development.

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

9405a732

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Andrew Yang
 -/
 import Mathlib.CategoryTheory.Limits.Cones
-import Mathlib.CategoryTheory.FinCategory
+import Mathlib.CategoryTheory.FinCategory.Basic
 
 #align_import category_theory.limits.bicones from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"

70fd9563

refactor(Data/Matrix): Eliminate ⬝ notation in favor of HMul (#6487)

The main difficulty here is that * has a slightly difference precedence to ⬝. notably around smul and neg.

The other annoyance is that ↑U ⬝ A ⬝ ↑U⁻¹ : Matrix m m 𝔸 now has to be written U.val * A * (U⁻¹).val in order to typecheck.

A downside of this change to consider: if you have a goal of A * (B * C) = (A * B) * C, mul_assoc now gives the illusion of matching, when in fact Matrix.mul_assoc is needed. Previously the distinct symbol made it easy to avoid this mistake.

On the flipside, there is now no need to rewrite by Matrix.mul_eq_mul all the time (indeed, the lemma is now removed).

38c07226

Diff

@@ -13,7 +13,7 @@ import Mathlib.CategoryTheory.FinCategory
 
 Given a category `J`, a walking `Bicone J` is a category whose objects are the objects of `J` and
 two extra vertices `Bicone.left` and `Bicone.right`. The morphisms are the morphisms of `J` and
-`left ⟶ j`, `right ⟶ j` for each `j : J` such that `⬝ ⟶ j` and `⬝ ⟶ k` commutes with each
+`left ⟶ j`, `right ⟶ j` for each `j : J` such that `(· ⟶ j)` and `(· ⟶ k)` commutes with each
 `f : j ⟶ k`.
 
 Given a diagram `F : J ⥤ C` and two `Cone F`s, we can join them into a diagram `Bicone J ⥤ C` via

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,15 +2,12 @@
 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.limits.bicones
-! 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.Limits.Cones
 import Mathlib.CategoryTheory.FinCategory
 
+#align_import category_theory.limits.bicones from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"
+
 /-!
 # Bicones

70fd9563

chore: fix focusing dots (#5708)

This PR is the result of running

find . -type f -name "*.lean" -exec sed -i -E 's/^( +)\. /\1· /' {} \;
find . -type f -name "*.lean" -exec sed -i -E 'N;s/^( +·)\n +(.*)$/\1 \2/;P;D' {} \;

which firstly replaces . focusing dots with · and secondly removes isolated instances of such dots, unifying them with the following line. A new rule is placed in the style linter to verify this.

cb02d09e

Diff

@@ -84,13 +84,13 @@ instance biconeCategoryStruct : CategoryStruct (Bicone J)
   id j := Bicone.casesOn j BiconeHom.left_id BiconeHom.right_id fun k => BiconeHom.diagram (𝟙 k)
   comp f g := by
     rcases f with (_ | _ | _ | _ | f)
-    . exact g
-    . exact g
-    . cases g
+    · exact g
+    · exact g
+    · cases g
       apply BiconeHom.left
-    . cases g
+    · cases g
       apply BiconeHom.right
-    . rcases g with (_|_|_|_|g)
+    · rcases g with (_|_|_|_|g)
       exact BiconeHom.diagram (f ≫ g)
 #align category_theory.bicone_category_struct CategoryTheory.biconeCategoryStruct
 
@@ -115,51 +115,51 @@ def biconeMk {C : Type u₁} [Category.{v₁} C] {F : J ⥤ C} (c₁ c₂ : Cone
   obj X := Bicone.casesOn X c₁.pt c₂.pt fun j => F.obj j
   map f := by
     rcases f with (_|_|_|_|f)
-    . exact 𝟙 _
-    . exact 𝟙 _
-    . exact c₁.π.app _
-    . exact c₂.π.app _
-    . exact F.map f
+    · exact 𝟙 _
+    · exact 𝟙 _
+    · exact c₁.π.app _
+    · exact c₂.π.app _
+    · exact F.map f
   map_id X := by cases X <;> simp
   map_comp f g := by
     rcases f with (_|_|_|_|_)
-    . exact (Category.id_comp _).symm
-    . exact (Category.id_comp _).symm
-    . cases g
+    · exact (Category.id_comp _).symm
+    · exact (Category.id_comp _).symm
+    · cases g
       exact (Category.id_comp _).symm.trans (c₁.π.naturality _)
-    . cases g
+    · cases g
       exact (Category.id_comp _).symm.trans (c₂.π.naturality _)
-    . cases g
+    · cases g
       apply F.map_comp
 #align category_theory.bicone_mk CategoryTheory.biconeMk
 
 instance finBiconeHom [FinCategory J] (j k : Bicone J) : Fintype (j ⟶ k) := by
   cases j <;> cases k
-  . exact
+  · exact
       { elems := {BiconeHom.left_id}
         complete := fun f => by cases f; simp }
-  . exact
+  · exact
     { elems := ∅
       complete := fun f => by cases f }
-  . exact
+  · exact
     { elems := {BiconeHom.left _}
       complete := fun f => by cases f; simp }
-  . exact
+  · exact
     { elems := ∅
       complete := fun f => by cases f }
-  . exact
+  · exact
       { elems := {BiconeHom.right_id}
         complete := fun f => by cases f; simp }
-  . exact
+  · exact
     { elems := {BiconeHom.right _}
       complete := fun f => by cases f; simp }
-  . exact
+  · exact
     { elems := ∅
       complete := fun f => by cases f }
-  . exact
+  · exact
     { elems := ∅
       complete := fun f => by cases f }
-  . exact
+  · exact
     { elems := Finset.image BiconeHom.diagram Fintype.elems
       complete := fun f => by
         rcases f with (_|_|_|_|f)

70fd9563

feat: port CategoryTheory.Limits.Bicones (#2775)

6fbfb8a1

`category_theory.limits.bicones` ⟷ `Mathlib.CategoryTheory.Limits.Bicones`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 210

category_theory.limits.bicones ⟷ Mathlib.CategoryTheory.Limits.Bicones

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 210

`category_theory.limits.bicones` ⟷ `Mathlib.CategoryTheory.Limits.Bicones`