category_theory.category.pairwise | 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

d82b8787

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

f4758115

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,9 +3,9 @@ Copyright (c) 2020 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 -/
-import Mathbin.Order.CompleteLattice
-import Mathbin.CategoryTheory.Category.Preorder
-import Mathbin.CategoryTheory.Limits.IsLimit
+import Order.CompleteLattice
+import CategoryTheory.Category.Preorder
+import CategoryTheory.Limits.IsLimit
 
 #align_import category_theory.category.pairwise from "leanprover-community/mathlib"@"f47581155c818e6361af4e4fda60d27d020c226b"

f4758115

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2020 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
-
-! This file was ported from Lean 3 source module category_theory.category.pairwise
-! leanprover-community/mathlib commit f47581155c818e6361af4e4fda60d27d020c226b
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Order.CompleteLattice
 import Mathbin.CategoryTheory.Category.Preorder
 import Mathbin.CategoryTheory.Limits.IsLimit
 
+#align_import category_theory.category.pairwise from "leanprover-community/mathlib"@"f47581155c818e6361af4e4fda60d27d020c226b"
+
 /-!
 # The category of "pairwise intersections".

f4758115

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -157,11 +157,13 @@ section
 -- but the appropriate structure has not been defined.
 variable [CompleteLattice α]
 
+#print CategoryTheory.Pairwise.coconeιApp /-
 /-- Auxiliary definition for `cocone`. -/
 def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ iSup U
   | single i => homOfLE (le_iSup U i)
   | pair i j => homOfLE inf_le_left ≫ homOfLE (le_iSup U i)
 #align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιApp
+-/
 
 #print CategoryTheory.Pairwise.cocone /-
 /-- Given a function `U : ι → α` for `[complete_lattice α]`,

f4758115

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -157,12 +157,6 @@ section
 -- but the appropriate structure has not been defined.
 variable [CompleteLattice α]
 
-/- warning: category_theory.pairwise.cocone_ι_app -> CategoryTheory.Pairwise.coconeιApp is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (iSup.{u1, succ u1} α (CompleteSemilatticeSup.toHasSup.{u1} α (CompleteLattice.toCompleteSemilatticeSup.{u1} α _inst_1)) ι U)
-but is expected to have type
-  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (iSup.{u1, succ u1} α (CompleteLattice.toSupSet.{u1} α _inst_1) ι U)
-Case conversion may be inaccurate. Consider using '#align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιAppₓ'. -/
 /-- Auxiliary definition for `cocone`. -/
 def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ iSup U
   | single i => homOfLE (le_iSup U i)

f4758115

bump to nightly-2023-05-14-08

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

d31da313

Diff

@@ -159,14 +159,14 @@ variable [CompleteLattice α]
 
 /- warning: category_theory.pairwise.cocone_ι_app -> CategoryTheory.Pairwise.coconeιApp is a dubious translation:
 lean 3 declaration is
-  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (supᵢ.{u1, succ u1} α (CompleteSemilatticeSup.toHasSup.{u1} α (CompleteLattice.toCompleteSemilatticeSup.{u1} α _inst_1)) ι U)
+  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (iSup.{u1, succ u1} α (CompleteSemilatticeSup.toHasSup.{u1} α (CompleteLattice.toCompleteSemilatticeSup.{u1} α _inst_1)) ι U)
 but is expected to have type
-  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (supᵢ.{u1, succ u1} α (CompleteLattice.toSupSet.{u1} α _inst_1) ι U)
+  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (iSup.{u1, succ u1} α (CompleteLattice.toSupSet.{u1} α _inst_1) ι U)
 Case conversion may be inaccurate. Consider using '#align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιAppₓ'. -/
 /-- Auxiliary definition for `cocone`. -/
-def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
-  | single i => homOfLE (le_supᵢ U i)
-  | pair i j => homOfLE inf_le_left ≫ homOfLE (le_supᵢ U i)
+def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ iSup U
+  | single i => homOfLE (le_iSup U i)
+  | pair i j => homOfLE inf_le_left ≫ homOfLE (le_iSup U i)
 #align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιApp
 
 #print CategoryTheory.Pairwise.cocone /-
@@ -175,7 +175,7 @@ def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
 -/
 @[simps]
 def cocone : Cocone (diagram U) where
-  pt := supᵢ U
+  pt := iSup U
   ι := { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone
 -/

f4758115

bump to nightly-2023-03-09-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/21e3562c5e12d846c7def5eff8cdbc520d7d4936

061741a1

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 
 ! This file was ported from Lean 3 source module category_theory.category.pairwise
-! leanprover-community/mathlib commit d82b87871d9a274884dff5263fa4f5d93bcce1d6
+! leanprover-community/mathlib commit f47581155c818e6361af4e4fda60d27d020c226b
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.CategoryTheory.Limits.IsLimit
 /-!
 # The category of "pairwise intersections".
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 Given `ι : Type v`, we build the diagram category `pairwise ι`
 with objects `single i` and `pair i j`, for `i j : ι`,
 whose only non-identity morphisms are

d82b8787

bump to nightly-2023-03-02-10

mathlib commit https://github.com/leanprover-community/mathlib/commit/195fcd60ff2bfe392543bceb0ec2adcdb472db4c

01978261

Diff

@@ -38,6 +38,7 @@ open CategoryTheory.Limits
 
 namespace CategoryTheory
 
+#print CategoryTheory.Pairwise /-
 /-- An inductive type representing either a single term of a type `ι`, or a pair of terms.
 We use this as the objects of a category to describe the sheaf condition.
 -/
@@ -45,15 +46,19 @@ inductive Pairwise (ι : Type v)
   | single : ι → Pairwise
   | pair : ι → ι → Pairwise
 #align category_theory.pairwise CategoryTheory.Pairwise
+-/
 
 variable {ι : Type v}
 
 namespace Pairwise
 
+#print CategoryTheory.Pairwise.pairwiseInhabited /-
 instance pairwiseInhabited [Inhabited ι] : Inhabited (Pairwise ι) :=
   ⟨single default⟩
 #align category_theory.pairwise.pairwise_inhabited CategoryTheory.Pairwise.pairwiseInhabited
+-/
 
+#print CategoryTheory.Pairwise.Hom /-
 /-- Morphisms in the category `pairwise ι`. The only non-identity morphisms are
 `left i j : single i ⟶ pair i j` and `right i j : single j ⟶ pair i j`.
 -/
@@ -63,20 +68,26 @@ inductive Hom : Pairwise ι → Pairwise ι → Type v
   | left : ∀ i j, hom (pair i j) (single i)
   | right : ∀ i j, hom (pair i j) (single j)
 #align category_theory.pairwise.hom CategoryTheory.Pairwise.Hom
+-/
 
 open Hom
 
+#print CategoryTheory.Pairwise.homInhabited /-
 instance homInhabited [Inhabited ι] : Inhabited (Hom (single (default : ι)) (single default)) :=
   ⟨id_single default⟩
 #align category_theory.pairwise.hom_inhabited CategoryTheory.Pairwise.homInhabited
+-/
 
+#print CategoryTheory.Pairwise.id /-
 /-- The identity morphism in `pairwise ι`.
 -/
 def id : ∀ o : Pairwise ι, Hom o o
   | single i => id_single i
   | pair i j => id_pair i j
 #align category_theory.pairwise.id CategoryTheory.Pairwise.id
+-/
 
+#print CategoryTheory.Pairwise.comp /-
 /-- Composition of morphisms in `pairwise ι`. -/
 def comp : ∀ {o₁ o₂ o₃ : Pairwise ι} (f : Hom o₁ o₂) (g : Hom o₂ o₃), Hom o₁ o₃
   | _, _, _, id_single i, g => g
@@ -84,6 +95,7 @@ def comp : ∀ {o₁ o₂ o₃ : Pairwise ι} (f : Hom o₁ o₂) (g : Hom o₂
   | _, _, _, left i j, id_single _ => left i j
   | _, _, _, right i j, id_single _ => right i j
 #align category_theory.pairwise.comp CategoryTheory.Pairwise.comp
+-/
 
 section
 
@@ -102,13 +114,16 @@ section
 
 variable [SemilatticeInf α]
 
+#print CategoryTheory.Pairwise.diagramObj /-
 /-- Auxiliary definition for `diagram`. -/
 @[simp]
 def diagramObj : Pairwise ι → α
   | single i => U i
   | pair i j => U i ⊓ U j
 #align category_theory.pairwise.diagram_obj CategoryTheory.Pairwise.diagramObj
+-/
 
+#print CategoryTheory.Pairwise.diagramMap /-
 /-- Auxiliary definition for `diagram`. -/
 @[simp]
 def diagramMap : ∀ {o₁ o₂ : Pairwise ι} (f : o₁ ⟶ o₂), diagramObj U o₁ ⟶ diagramObj U o₂
@@ -117,7 +132,9 @@ def diagramMap : ∀ {o₁ o₂ : Pairwise ι} (f : o₁ ⟶ o₂), diagramObj U
   | _, _, left i j => homOfLE inf_le_left
   | _, _, right i j => homOfLE inf_le_right
 #align category_theory.pairwise.diagram_map CategoryTheory.Pairwise.diagramMap
+-/
 
+#print CategoryTheory.Pairwise.diagram /-
 /-- Given a function `U : ι → α` for `[semilattice_inf α]`, we obtain a functor `pairwise ι ⥤ α`,
 sending `single i` to `U i` and `pair i j` to `U i ⊓ U j`,
 and the morphisms to the obvious inequalities.
@@ -127,6 +144,7 @@ def diagram : Pairwise ι ⥤ α where
   obj := diagramObj U
   map X Y f := diagramMap U f
 #align category_theory.pairwise.diagram CategoryTheory.Pairwise.diagram
+-/
 
 end
 
@@ -136,12 +154,19 @@ section
 -- but the appropriate structure has not been defined.
 variable [CompleteLattice α]
 
+/- warning: category_theory.pairwise.cocone_ι_app -> CategoryTheory.Pairwise.coconeιApp is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (supᵢ.{u1, succ u1} α (CompleteSemilatticeSup.toHasSup.{u1} α (CompleteLattice.toCompleteSemilatticeSup.{u1} α _inst_1)) ι U)
+but is expected to have type
+  forall {ι : Type.{u1}} {α : Type.{u1}} (U : ι -> α) [_inst_1 : CompleteLattice.{u1} α] (o : CategoryTheory.Pairwise.{u1} ι), Quiver.Hom.{succ u1, u1} α (CategoryTheory.CategoryStruct.toQuiver.{u1, u1} α (CategoryTheory.Category.toCategoryStruct.{u1, u1} α (Preorder.smallCategory.{u1} α (PartialOrder.toPreorder.{u1} α (CompleteSemilatticeInf.toPartialOrder.{u1} α (CompleteLattice.toCompleteSemilatticeInf.{u1} α _inst_1)))))) (CategoryTheory.Pairwise.diagramObj.{u1} ι α U (Lattice.toSemilatticeInf.{u1} α (CompleteLattice.toLattice.{u1} α _inst_1)) o) (supᵢ.{u1, succ u1} α (CompleteLattice.toSupSet.{u1} α _inst_1) ι U)
+Case conversion may be inaccurate. Consider using '#align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιAppₓ'. -/
 /-- Auxiliary definition for `cocone`. -/
 def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
   | single i => homOfLE (le_supᵢ U i)
   | pair i j => homOfLE inf_le_left ≫ homOfLE (le_supᵢ U i)
 #align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιApp
 
+#print CategoryTheory.Pairwise.cocone /-
 /-- Given a function `U : ι → α` for `[complete_lattice α]`,
 `supr U` provides a cocone over `diagram U`.
 -/
@@ -150,7 +175,9 @@ def cocone : Cocone (diagram U) where
   pt := supᵢ U
   ι := { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone
+-/
 
+#print CategoryTheory.Pairwise.coconeIsColimit /-
 /-- Given a function `U : ι → α` for `[complete_lattice α]`,
 `infi U` provides a limit cone over `diagram U`.
 -/
@@ -162,6 +189,7 @@ def coconeIsColimit : IsColimit (cocone U)
         rintro _ ⟨j, rfl⟩
         exact (s.ι.app (single j)).le)
 #align category_theory.pairwise.cocone_is_colimit CategoryTheory.Pairwise.coconeIsColimit
+-/
 
 end

d82b8787

bump to nightly-2023-02-28-22

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

1fb1623f

Diff

@@ -147,7 +147,7 @@ def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
 -/
 @[simps]
 def cocone : Cocone (diagram U) where
-  x := supᵢ U
+  pt := supᵢ U
   ι := { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone

d82b8787

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

d82b8787

chore: bump aesop; update syntax (#10955)

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

46974e92

Diff

@@ -89,7 +89,7 @@ open Lean Elab Tactic in
 def pairwiseCases : TacticM Unit := do
   evalTactic (← `(tactic| casesm* (_ : Pairwise _) ⟶ (_ : Pairwise _)))
 
-attribute [local aesop safe tactic (rule_sets [CategoryTheory])] pairwiseCases in
+attribute [local aesop safe tactic (rule_sets := [CategoryTheory])] pairwiseCases in
 instance : Category (Pairwise ι) where
   Hom := Hom
   id := id

d82b8787

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,16 +2,13 @@
 Copyright (c) 2020 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
-
-! This file was ported from Lean 3 source module category_theory.category.pairwise
-! leanprover-community/mathlib commit d82b87871d9a274884dff5263fa4f5d93bcce1d6
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Order.CompleteLattice
 import Mathlib.CategoryTheory.Category.Preorder
 import Mathlib.CategoryTheory.Limits.IsLimit
 
+#align_import category_theory.category.pairwise from "leanprover-community/mathlib"@"d82b87871d9a274884dff5263fa4f5d93bcce1d6"
+
 /-!
 # The category of "pairwise intersections".

d82b8787

chore: review of automation in category theory (#4793)

Clean up of automation in the category theory library. Leaving out unnecessary proof steps, or fields done by aesop_cat, and making more use of available autoparameters.

Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au>

5b958613

Diff

@@ -87,27 +87,16 @@ def comp : ∀ {o₁ o₂ o₃ : Pairwise ι} (_ : Hom o₁ o₂) (_ : Hom o₂
 
 section
 
--- porting note: aesop_cat does not support local attributes yet so that
--- proofs had to be provided for the Category structure on `Pairwise ι`
---attribute [local tidy] tactic.case_bash
+open Lean Elab Tactic in
+/-- A helper tactic for `aesop_cat` and `Pairwise`. -/
+def pairwiseCases : TacticM Unit := do
+  evalTactic (← `(tactic| casesm* (_ : Pairwise _) ⟶ (_ : Pairwise _)))
 
+attribute [local aesop safe tactic (rule_sets [CategoryTheory])] pairwiseCases in
 instance : Category (Pairwise ι) where
   Hom := Hom
   id := id
   comp f g := comp f g
-  assoc := fun f g h => by
-    cases f
-    . aesop_cat
-    . aesop_cat
-    all_goals {
-      cases g
-      aesop_cat }
-  comp_id := fun f => by
-    cases f
-    all_goals { aesop_cat }
-  id_comp := fun f => by
-    cases f
-    all_goals { aesop_cat }
 
 end
 
@@ -145,8 +134,6 @@ and the morphisms to the obvious inequalities.
 def diagram : Pairwise ι ⥤ α where
   obj := diagramObj U
   map := diagramMap U
-  map_id := fun _ => rfl
-  map_comp := fun _ _ => rfl
 #align category_theory.pairwise.diagram CategoryTheory.Pairwise.diagram
 
 end
@@ -169,8 +156,7 @@ def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ iSup U
 @[simps]
 def cocone : Cocone (diagram U) where
   pt := iSup U
-  ι :=
-    { app := coconeιApp U }
+  ι := { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone
 
 /-- Given a function `U : ι → α` for `[CompleteLattice α]`,

d82b8787

chore: fix upper/lowercase in comments (#4360)

Run a non-interactive version of fix-comments.py on all files.
Go through the diff and manually add/discard/edit chunks.

27d257fc

Diff

@@ -24,7 +24,7 @@ We use this later in describing (one formulation of) the sheaf condition.
 
 Given any function `U : ι → α`, where `α` is some complete lattice (e.g. `(opens X)ᵒᵖ`),
 we produce a functor `Pairwise ι ⥤ α` in the obvious way,
-and show that `supr U` provides a colimit cocone over this functor.
+and show that `iSup U` provides a colimit cocone over this functor.
 -/
 
 
@@ -135,7 +135,7 @@ def diagramMap : ∀ {o₁ o₂ : Pairwise ι} (_ : o₁ ⟶ o₂), diagramObj U
 
 -- Porting note: the fields map_id and map_comp were filled by hand, as generating them by `aesop`
 -- causes a PANIC.
-/-- Given a function `U : ι → α` for `[SemilatticeInf α]`, we obtain a functor `pairwise ι ⥤ α`,
+/-- Given a function `U : ι → α` for `[SemilatticeInf α]`, we obtain a functor `Pairwise ι ⥤ α`,
 sending `single i` to `U i` and `pair i j` to `U i ⊓ U j`,
 and the morphisms to the obvious inequalities.
 -/

d82b8787

chore: Rename to sSup/iSup (#3938)

As discussed on Zulip

Renames

supₛ → sSup
infₛ → sInf
supᵢ → iSup
infᵢ → iInf
bsupₛ → bsSup
binfₛ → bsInf
bsupᵢ → biSup
binfᵢ → biInf
csupₛ → csSup
cinfₛ → csInf
csupᵢ → ciSup
cinfᵢ → ciInf
unionₛ → sUnion
interₛ → sInter
unionᵢ → iUnion
interᵢ → iInter
bunionₛ → bsUnion
binterₛ → bsInter
bunionᵢ → biUnion
binterᵢ → biInter

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

d1eb6264

Diff

@@ -158,28 +158,28 @@ section
 variable [CompleteLattice α]
 
 /-- Auxiliary definition for `cocone`. -/
-def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
-  | single i => homOfLE (le_supᵢ U i)
-  | pair i _ => homOfLE inf_le_left ≫ homOfLE (le_supᵢ U i)
+def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ iSup U
+  | single i => homOfLE (le_iSup U i)
+  | pair i _ => homOfLE inf_le_left ≫ homOfLE (le_iSup U i)
 #align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιApp
 
 /-- Given a function `U : ι → α` for `[CompleteLattice α]`,
-`supᵢ U` provides a cocone over `diagram U`.
+`iSup U` provides a cocone over `diagram U`.
 -/
 @[simps]
 def cocone : Cocone (diagram U) where
-  pt := supᵢ U
+  pt := iSup U
   ι :=
     { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone
 
 /-- Given a function `U : ι → α` for `[CompleteLattice α]`,
-`infᵢ U` provides a limit cone over `diagram U`.
+`iInf U` provides a limit cone over `diagram U`.
 -/
 def coconeIsColimit : IsColimit (cocone U) where
   desc s := homOfLE
     (by
-      apply CompleteSemilatticeSup.supₛ_le
+      apply CompleteSemilatticeSup.sSup_le
       rintro _ ⟨j, rfl⟩
       exact (s.ι.app (single j)).le)
 #align category_theory.pairwise.cocone_is_colimit CategoryTheory.Pairwise.coconeIsColimit

d82b8787

chore: tidy various files (#3530)

8cf71b01

Diff

@@ -135,7 +135,7 @@ def diagramMap : ∀ {o₁ o₂ : Pairwise ι} (_ : o₁ ⟶ o₂), diagramObj U
 
 -- Porting note: the fields map_id and map_comp were filled by hand, as generating them by `aesop`
 -- causes a PANIC.
-/-- Given a function `U : ι → α` for `[semilattice_inf α]`, we obtain a functor `pairwise ι ⥤ α`,
+/-- Given a function `U : ι → α` for `[SemilatticeInf α]`, we obtain a functor `pairwise ι ⥤ α`,
 sending `single i` to `U i` and `pair i j` to `U i ⊓ U j`,
 and the morphisms to the obvious inequalities.
 -/
@@ -173,15 +173,15 @@ def cocone : Cocone (diagram U) where
     { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone
 
-/-- Given a function `U : ι → α` for `[complete_lattice α]`,
-`infi U` provides a limit cone over `diagram U`.
+/-- Given a function `U : ι → α` for `[CompleteLattice α]`,
+`infᵢ U` provides a limit cone over `diagram U`.
 -/
 def coconeIsColimit : IsColimit (cocone U) where
-    desc s := homOfLE
-      (by
-        apply CompleteSemilatticeSup.supₛ_le
-        rintro _ ⟨j, rfl⟩
-        exact (s.ι.app (single j)).le)
+  desc s := homOfLE
+    (by
+      apply CompleteSemilatticeSup.supₛ_le
+      rintro _ ⟨j, rfl⟩
+      exact (s.ι.app (single j)).le)
 #align category_theory.pairwise.cocone_is_colimit CategoryTheory.Pairwise.coconeIsColimit
 
 end

d82b8787

chore: avoid PANIC in linter at CategoryTheory/Category/Pairwise (#2704)

This is a temporary fix to the problem identified at:

https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/linter.20crash

Longer-term, we need to do three things:

Make sure that if a linter PANICs, this is reported as a linter failure.
Identify and avoid the PANIC while aesop is working.
(Probably identical to 2.) Identify the PANIC in the linter.

In the meantime I think it would be good to merge this as is, to restore CI reliability!

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

765b4033

Diff

@@ -133,12 +133,15 @@ def diagramMap : ∀ {o₁ o₂ : Pairwise ι} (_ : o₁ ⟶ o₂), diagramObj U
   | _, _, right _ _ => homOfLE inf_le_right
 #align category_theory.pairwise.diagram_map CategoryTheory.Pairwise.diagramMap
 
--- porting note: the fields map_id and map_comp were filled in order to avoid a PANIC error
+-- Porting note: the fields map_id and map_comp were filled by hand, as generating them by `aesop`
+-- causes a PANIC.
 /-- Given a function `U : ι → α` for `[semilattice_inf α]`, we obtain a functor `pairwise ι ⥤ α`,
 sending `single i` to `U i` and `pair i j` to `U i ⊓ U j`,
 and the morphisms to the obvious inequalities.
 -/
-@[simps]
+-- Porting note: We want `@[simps]` here, but this causes a PANIC in the linter.
+-- (Which, worryingly, does not cause a linter failure!)
+-- @[simps]
 def diagram : Pairwise ι ⥤ α where
   obj := diagramObj U
   map := diagramMap U
@@ -160,7 +163,6 @@ def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
   | pair i _ => homOfLE inf_le_left ≫ homOfLE (le_supᵢ U i)
 #align category_theory.pairwise.cocone_ι_app CategoryTheory.Pairwise.coconeιApp
 
--- porting note: the field ι.naturality was filled in order to avoid a PANIC error
 /-- Given a function `U : ι → α` for `[CompleteLattice α]`,
 `supᵢ U` provides a cocone over `diagram U`.
 -/
@@ -168,10 +170,7 @@ def coconeιApp : ∀ o : Pairwise ι, diagramObj U o ⟶ supᵢ U
 def cocone : Cocone (diagram U) where
   pt := supᵢ U
   ι :=
-    { app := coconeιApp U
-      naturality := fun X Y f => by
-        cases X
-        all_goals { rfl } }
+    { app := coconeιApp U }
 #align category_theory.pairwise.cocone CategoryTheory.Pairwise.cocone
 
 /-- Given a function `U : ι → α` for `[complete_lattice α]`,

d82b8787

feat: port CategoryTheory.Category.Pairwise (#2534)

591d4802

`category_theory.category.pairwise` ⟷ `Mathlib.CategoryTheory.Category.Pairwise`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Renames

Dependencies 97

category_theory.category.pairwise ⟷ Mathlib.CategoryTheory.Category.Pairwise

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Renames

Dependencies 97

`category_theory.category.pairwise` ⟷ `Mathlib.CategoryTheory.Category.Pairwise`