category_theory.limits.shapes.equivalence

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

ea74dc9f

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

f4758115

bump to nightly-2024-04-14-09

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

f736ea6b

Diff

@@ -28,7 +28,8 @@ universe v₁ v₂ u₁ u₂
 variable {C : Type u₁} [Category.{v₁} C] {D : Type u₂} [Category.{v₂} D]
 
 #print CategoryTheory.hasInitial_of_equivalence /-
-theorem hasInitial_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasInitial C] : HasInitial D :=
+theorem hasInitial_of_equivalence (e : D ⥤ C) [CategoryTheory.Functor.IsEquivalence e]
+    [HasInitial C] : HasInitial D :=
   Adjunction.hasColimitsOfShape_of_equivalence e
 #align category_theory.has_initial_of_equivalence CategoryTheory.hasInitial_of_equivalence
 -/
@@ -40,7 +41,8 @@ theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D
 -/
 
 #print CategoryTheory.hasTerminal_of_equivalence /-
-theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal C] : HasTerminal D :=
+theorem hasTerminal_of_equivalence (e : D ⥤ C) [CategoryTheory.Functor.IsEquivalence e]
+    [HasTerminal C] : HasTerminal D :=
   Adjunction.hasLimitsOfShape_of_equivalence e
 #align category_theory.has_terminal_of_equivalence CategoryTheory.hasTerminal_of_equivalence
 -/

f4758115

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) Markus Himmel. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
 -/
-import Mathbin.CategoryTheory.Adjunction.Limits
-import Mathbin.CategoryTheory.Limits.Shapes.Terminal
+import CategoryTheory.Adjunction.Limits
+import CategoryTheory.Limits.Shapes.Terminal
 
 #align_import category_theory.limits.shapes.equivalence 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,15 +2,12 @@
 Copyright (c) Markus Himmel. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
-
-! This file was ported from Lean 3 source module category_theory.limits.shapes.equivalence
-! 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.CategoryTheory.Adjunction.Limits
 import Mathbin.CategoryTheory.Limits.Shapes.Terminal
 
+#align_import category_theory.limits.shapes.equivalence from "leanprover-community/mathlib"@"f47581155c818e6361af4e4fda60d27d020c226b"
+
 /-!
 # Transporting existence of specific limits across equivalences

f4758115

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -36,9 +36,11 @@ theorem hasInitial_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasInitial C]
 #align category_theory.has_initial_of_equivalence CategoryTheory.hasInitial_of_equivalence
 -/
 
+#print CategoryTheory.Equivalence.hasInitial_iff /-
 theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D :=
   ⟨fun h => has_initial_of_equivalence e.inverse, fun h => has_initial_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iff
+-/
 
 #print CategoryTheory.hasTerminal_of_equivalence /-
 theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal C] : HasTerminal D :=
@@ -46,9 +48,11 @@ theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal
 #align category_theory.has_terminal_of_equivalence CategoryTheory.hasTerminal_of_equivalence
 -/
 
+#print CategoryTheory.Equivalence.hasTerminal_iff /-
 theorem Equivalence.hasTerminal_iff (e : C ≌ D) : HasTerminal C ↔ HasTerminal D :=
   ⟨fun h => has_terminal_of_equivalence e.inverse, fun h => has_terminal_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_terminal_iff CategoryTheory.Equivalence.hasTerminal_iff
+-/
 
 end CategoryTheory

f4758115

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -36,12 +36,6 @@ theorem hasInitial_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasInitial C]
 #align category_theory.has_initial_of_equivalence CategoryTheory.hasInitial_of_equivalence
 -/
 
-/- warning: category_theory.equivalence.has_initial_iff -> CategoryTheory.Equivalence.hasInitial_iff is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C _inst_1 D _inst_2) -> (Iff (CategoryTheory.Limits.HasInitial.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasInitial.{u2, u4} D _inst_2))
-but is expected to have type
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C D _inst_1 _inst_2) -> (Iff (CategoryTheory.Limits.HasInitial.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasInitial.{u2, u4} D _inst_2))
-Case conversion may be inaccurate. Consider using '#align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iffₓ'. -/
 theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D :=
   ⟨fun h => has_initial_of_equivalence e.inverse, fun h => has_initial_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iff
@@ -52,12 +46,6 @@ theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal
 #align category_theory.has_terminal_of_equivalence CategoryTheory.hasTerminal_of_equivalence
 -/
 
-/- warning: category_theory.equivalence.has_terminal_iff -> CategoryTheory.Equivalence.hasTerminal_iff is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C _inst_1 D _inst_2) -> (Iff (CategoryTheory.Limits.HasTerminal.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasTerminal.{u2, u4} D _inst_2))
-but is expected to have type
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C D _inst_1 _inst_2) -> (Iff (CategoryTheory.Limits.HasTerminal.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasTerminal.{u2, u4} D _inst_2))
-Case conversion may be inaccurate. Consider using '#align category_theory.equivalence.has_terminal_iff CategoryTheory.Equivalence.hasTerminal_iffₓ'. -/
 theorem Equivalence.hasTerminal_iff (e : C ≌ D) : HasTerminal C ↔ HasTerminal D :=
   ⟨fun h => has_terminal_of_equivalence e.inverse, fun h => has_terminal_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_terminal_iff CategoryTheory.Equivalence.hasTerminal_iff

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: Markus Himmel
 
 ! This file was ported from Lean 3 source module category_theory.limits.shapes.equivalence
-! leanprover-community/mathlib commit ea74dc9f981009c33b9971f3389509a88c95cf07
+! leanprover-community/mathlib commit f47581155c818e6361af4e4fda60d27d020c226b
 ! 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.Limits.Shapes.Terminal
 /-!
 # Transporting existence of specific limits across equivalences
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 For now, we only treat the case of initial and terminal objects, but other special shapes can be
 added in the future.
 -/

ea74dc9f

bump to nightly-2023-03-07-16

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

a8442c3c

Diff

@@ -27,18 +27,34 @@ universe v₁ v₂ u₁ u₂
 
 variable {C : Type u₁} [Category.{v₁} C] {D : Type u₂} [Category.{v₂} D]
 
+#print CategoryTheory.hasInitial_of_equivalence /-
 theorem hasInitial_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasInitial C] : HasInitial D :=
   Adjunction.hasColimitsOfShape_of_equivalence e
 #align category_theory.has_initial_of_equivalence CategoryTheory.hasInitial_of_equivalence
+-/
 
+/- warning: category_theory.equivalence.has_initial_iff -> CategoryTheory.Equivalence.hasInitial_iff is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C _inst_1 D _inst_2) -> (Iff (CategoryTheory.Limits.HasInitial.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasInitial.{u2, u4} D _inst_2))
+but is expected to have type
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C D _inst_1 _inst_2) -> (Iff (CategoryTheory.Limits.HasInitial.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasInitial.{u2, u4} D _inst_2))
+Case conversion may be inaccurate. Consider using '#align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iffₓ'. -/
 theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D :=
   ⟨fun h => has_initial_of_equivalence e.inverse, fun h => has_initial_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iff
 
+#print CategoryTheory.hasTerminal_of_equivalence /-
 theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal C] : HasTerminal D :=
   Adjunction.hasLimitsOfShape_of_equivalence e
 #align category_theory.has_terminal_of_equivalence CategoryTheory.hasTerminal_of_equivalence
+-/
 
+/- warning: category_theory.equivalence.has_terminal_iff -> CategoryTheory.Equivalence.hasTerminal_iff is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C _inst_1 D _inst_2) -> (Iff (CategoryTheory.Limits.HasTerminal.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasTerminal.{u2, u4} D _inst_2))
+but is expected to have type
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D], (CategoryTheory.Equivalence.{u1, u2, u3, u4} C D _inst_1 _inst_2) -> (Iff (CategoryTheory.Limits.HasTerminal.{u1, u3} C _inst_1) (CategoryTheory.Limits.HasTerminal.{u2, u4} D _inst_2))
+Case conversion may be inaccurate. Consider using '#align category_theory.equivalence.has_terminal_iff CategoryTheory.Equivalence.hasTerminal_iffₓ'. -/
 theorem Equivalence.hasTerminal_iff (e : C ≌ D) : HasTerminal C ↔ HasTerminal D :=
   ⟨fun h => has_terminal_of_equivalence e.inverse, fun h => has_terminal_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_terminal_iff CategoryTheory.Equivalence.hasTerminal_iff

ea74dc9f

bump to nightly-2023-02-27-08

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

91d8c210

Diff

@@ -28,7 +28,7 @@ universe v₁ v₂ u₁ u₂
 variable {C : Type u₁} [Category.{v₁} C] {D : Type u₂} [Category.{v₂} D]
 
 theorem hasInitial_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasInitial C] : HasInitial D :=
-  Adjunction.hasColimitsOfShapeOfEquivalence e
+  Adjunction.hasColimitsOfShape_of_equivalence e
 #align category_theory.has_initial_of_equivalence CategoryTheory.hasInitial_of_equivalence
 
 theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D :=
@@ -36,7 +36,7 @@ theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D
 #align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iff
 
 theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal C] : HasTerminal D :=
-  Adjunction.hasLimitsOfShapeOfEquivalence e
+  Adjunction.hasLimitsOfShape_of_equivalence e
 #align category_theory.has_terminal_of_equivalence CategoryTheory.hasTerminal_of_equivalence
 
 theorem Equivalence.hasTerminal_iff (e : C ≌ D) : HasTerminal C ↔ HasTerminal D :=

ea74dc9f

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

ea74dc9f

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

@@ -24,7 +24,7 @@ universe v₁ v₂ u₁ u₂
 
 variable {C : Type u₁} [Category.{v₁} C] {D : Type u₂} [Category.{v₂} D]
 
-theorem hasInitial_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasInitial C] : HasInitial D :=
+theorem hasInitial_of_equivalence (e : D ⥤ C) [e.IsEquivalence] [HasInitial C] : HasInitial D :=
   Adjunction.hasColimitsOfShape_of_equivalence e
 #align category_theory.has_initial_of_equivalence CategoryTheory.hasInitial_of_equivalence
 
@@ -33,7 +33,7 @@ theorem Equivalence.hasInitial_iff (e : C ≌ D) : HasInitial C ↔ HasInitial D
     fun (_ : HasInitial D) => hasInitial_of_equivalence e.functor⟩
 #align category_theory.equivalence.has_initial_iff CategoryTheory.Equivalence.hasInitial_iff
 
-theorem hasTerminal_of_equivalence (e : D ⥤ C) [IsEquivalence e] [HasTerminal C] : HasTerminal D :=
+theorem hasTerminal_of_equivalence (e : D ⥤ C) [e.IsEquivalence] [HasTerminal C] : HasTerminal D :=
   Adjunction.hasLimitsOfShape_of_equivalence e
 #align category_theory.has_terminal_of_equivalence CategoryTheory.hasTerminal_of_equivalence

ea74dc9f

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) Markus Himmel. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
-
-! This file was ported from Lean 3 source module category_theory.limits.shapes.equivalence
-! leanprover-community/mathlib commit ea74dc9f981009c33b9971f3389509a88c95cf07
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.CategoryTheory.Adjunction.Limits
 import Mathlib.CategoryTheory.Limits.Shapes.Terminal
 
+#align_import category_theory.limits.shapes.equivalence from "leanprover-community/mathlib"@"ea74dc9f981009c33b9971f3389509a88c95cf07"
+
 /-!
 # Transporting existence of specific limits across equivalences

ea74dc9f

feat: port CategoryTheory.Limits.Shapes.Equivalence (#2694)

Co-authored-by: Johan Commelin <johan@commelin.net>

9393e75c

`category_theory.limits.shapes.equivalence` ⟷ `Mathlib.CategoryTheory.Limits.Shapes.Equivalence`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 86

category_theory.limits.shapes.equivalence ⟷ Mathlib.CategoryTheory.Limits.Shapes.Equivalence

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 86

`category_theory.limits.shapes.equivalence` ⟷ `Mathlib.CategoryTheory.Limits.Shapes.Equivalence`