category_theory.monad.products | 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

d6814c58

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

86d1873c

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -3,7 +3,7 @@ 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.Over
+import CategoryTheory.Comma.Over
 import CategoryTheory.Monad.Algebra
 import CategoryTheory.Limits.Shapes.BinaryProducts

86d1873c

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) 2021 Bhavik Mehta. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Bhavik Mehta
 -/
-import Mathbin.CategoryTheory.Over
-import Mathbin.CategoryTheory.Monad.Algebra
-import Mathbin.CategoryTheory.Limits.Shapes.BinaryProducts
+import CategoryTheory.Over
+import CategoryTheory.Monad.Algebra
+import CategoryTheory.Limits.Shapes.BinaryProducts
 
 #align_import category_theory.monad.products from "leanprover-community/mathlib"@"86d1873c01a723aba6788f0b9051ae3d23b4c1c3"

86d1873c

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) 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.monad.products
-! leanprover-community/mathlib commit 86d1873c01a723aba6788f0b9051ae3d23b4c1c3
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.CategoryTheory.Over
 import Mathbin.CategoryTheory.Monad.Algebra
 import Mathbin.CategoryTheory.Limits.Shapes.BinaryProducts
 
+#align_import category_theory.monad.products from "leanprover-community/mathlib"@"86d1873c01a723aba6788f0b9051ae3d23b4c1c3"
+
 /-!
 # Algebras for the coproduct monad

86d1873c

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -82,6 +82,7 @@ def overToCoalgebra : Over X ⥤ Coalgebra (prodComonad X)
 #align category_theory.over_to_coalgebra CategoryTheory.overToCoalgebra
 -/
 
+#print CategoryTheory.coalgebraEquivOver /-
 /-- The equivalence from coalgebras for the product comonad to the over category. -/
 @[simps]
 def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X
@@ -96,6 +97,7 @@ def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X
       fun A₁ A₂ f => by ext; simp
   counitIso := NatIso.ofComponents (fun f => Over.isoMk (Iso.refl _)) fun f g k => by tidy
 #align category_theory.coalgebra_equiv_over CategoryTheory.coalgebraEquivOver
+-/
 
 end
 
@@ -141,6 +143,7 @@ def underToAlgebra : Under X ⥤ Monad.Algebra (coprodMonad X)
 #align category_theory.under_to_algebra CategoryTheory.underToAlgebra
 -/
 
+#print CategoryTheory.algebraEquivUnder /-
 /-- The equivalence from algebras for the coproduct monad to the under category.
 -/
 @[simps]
@@ -157,6 +160,7 @@ def algebraEquivUnder : Monad.Algebra (coprodMonad X) ≌ Under X
   counitIso :=
     NatIso.ofComponents (fun f => Under.isoMk (Iso.refl _) (by tidy)) fun f g k => by tidy
 #align category_theory.algebra_equiv_under CategoryTheory.algebraEquivUnder
+-/
 
 end

86d1873c

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -82,12 +82,6 @@ def overToCoalgebra : Over X ⥤ Coalgebra (prodComonad X)
 #align category_theory.over_to_coalgebra CategoryTheory.overToCoalgebra
 -/
 
-/- warning: category_theory.coalgebra_equiv_over -> CategoryTheory.coalgebraEquivOver is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryProducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Comonad.Coalgebra.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Comonad.Coalgebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Over.{u1, u2} C _inst_1 X) (CategoryTheory.Over.category.{u2, u1} C _inst_1 X)
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryProducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Comonad.Coalgebra.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Over.{u1, u2} C _inst_1 X) (CategoryTheory.Comonad.Coalgebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.instCategoryOver.{u1, u2} C _inst_1 X)
-Case conversion may be inaccurate. Consider using '#align category_theory.coalgebra_equiv_over CategoryTheory.coalgebraEquivOverₓ'. -/
 /-- The equivalence from coalgebras for the product comonad to the over category. -/
 @[simps]
 def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X
@@ -147,12 +141,6 @@ def underToAlgebra : Under X ⥤ Monad.Algebra (coprodMonad X)
 #align category_theory.under_to_algebra CategoryTheory.underToAlgebra
 -/
 
-/- warning: category_theory.algebra_equiv_under -> CategoryTheory.algebraEquivUnder is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryCoproducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Monad.Algebra.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Monad.Algebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Under.{u1, u2} C _inst_1 X) (CategoryTheory.Under.category.{u2, u1} C _inst_1 X)
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryCoproducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Monad.Algebra.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Under.{u1, u2} C _inst_1 X) (CategoryTheory.Monad.Algebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.instCategoryUnder.{u1, u2} C _inst_1 X)
-Case conversion may be inaccurate. Consider using '#align category_theory.algebra_equiv_under CategoryTheory.algebraEquivUnderₓ'. -/
 /-- The equivalence from algebras for the coproduct monad to the under category.
 -/
 @[simps]

86d1873c

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -64,12 +64,7 @@ category.
 def coalgebraToOver : Coalgebra (prodComonad X) ⥤ Over X
     where
   obj A := Over.mk (A.a ≫ Limits.prod.fst)
-  map A₁ A₂ f :=
-    Over.homMk f.f
-      (by
-        rw [over.mk_hom, ← f.h_assoc]
-        dsimp
-        simp)
+  map A₁ A₂ f := Over.homMk f.f (by rw [over.mk_hom, ← f.h_assoc]; dsimp; simp)
 #align category_theory.coalgebra_to_over CategoryTheory.coalgebraToOver
 -/
 
@@ -103,16 +98,8 @@ def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X
     NatIso.ofComponents
       (fun A =>
         Coalgebra.isoMk (Iso.refl _)
-          (prod.hom_ext
-            (by
-              dsimp
-              simp)
-            (by
-              dsimp
-              simpa using A.counit)))
-      fun A₁ A₂ f => by
-      ext
-      simp
+          (prod.hom_ext (by dsimp; simp) (by dsimp; simpa using A.counit)))
+      fun A₁ A₂ f => by ext; simp
   counitIso := NatIso.ofComponents (fun f => Over.isoMk (Iso.refl _)) fun f g k => by tidy
 #align category_theory.coalgebra_equiv_over CategoryTheory.coalgebraEquivOver
 
@@ -142,12 +129,7 @@ category.
 def algebraToUnder : Monad.Algebra (coprodMonad X) ⥤ Under X
     where
   obj A := Under.mk (coprod.inl ≫ A.a)
-  map A₁ A₂ f :=
-    Under.homMk f.f
-      (by
-        rw [under.mk_hom, assoc, ← f.h]
-        dsimp
-        simp)
+  map A₁ A₂ f := Under.homMk f.f (by rw [under.mk_hom, assoc, ← f.h]; dsimp; simp)
 #align category_theory.algebra_to_under CategoryTheory.algebraToUnder
 -/
 
@@ -182,13 +164,8 @@ def algebraEquivUnder : Monad.Algebra (coprodMonad X) ≌ Under X
     NatIso.ofComponents
       (fun A =>
         Monad.Algebra.isoMk (Iso.refl _)
-          (coprod.hom_ext (by tidy)
-            (by
-              dsimp
-              simpa using A.unit.symm)))
-      fun A₁ A₂ f => by
-      ext
-      simp
+          (coprod.hom_ext (by tidy) (by dsimp; simpa using A.unit.symm)))
+      fun A₁ A₂ f => by ext; simp
   counitIso :=
     NatIso.ofComponents (fun f => Under.isoMk (Iso.refl _) (by tidy)) fun f g k => by tidy
 #align category_theory.algebra_equiv_under CategoryTheory.algebraEquivUnder

86d1873c

bump to nightly-2023-04-22-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/52932b3a083d4142e78a15dc928084a22fea9ba0

21a90077

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.monad.products
-! leanprover-community/mathlib commit d6814c584384ddf2825ff038e868451a7c956f31
+! leanprover-community/mathlib commit 86d1873c01a723aba6788f0b9051ae3d23b4c1c3
 ! 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.Shapes.BinaryProducts
 /-!
 # Algebras for the coproduct monad
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 The functor `Y ↦ X ⨿ Y` forms a monad, whose category of monads is equivalent to the under category
 of `X`. Similarly, `Y ↦ X ⨯ Y` forms a comonad, whose category of comonads is equivalent to the
 over category of `X`.

d6814c58

bump to nightly-2023-04-20-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/730c6d4cab72b9d84fcfb9e95e8796e9cd8f40ba

61a5184d

Diff

@@ -43,6 +43,7 @@ open Comonad
 
 variable [HasBinaryProducts C]
 
+#print CategoryTheory.prodComonad /-
 /-- `X ⨯ -` has a comonad structure. This is sometimes called the writer comonad. -/
 @[simps]
 def prodComonad : Comonad C where
@@ -50,7 +51,9 @@ def prodComonad : Comonad C where
   ε' := { app := fun Y => Limits.prod.snd }
   δ' := { app := fun Y => prod.lift Limits.prod.fst (𝟙 _) }
 #align category_theory.prod_comonad CategoryTheory.prodComonad
+-/
 
+#print CategoryTheory.coalgebraToOver /-
 /-- The forward direction of the equivalence from coalgebras for the product comonad to the over
 category.
 -/
@@ -65,7 +68,9 @@ def coalgebraToOver : Coalgebra (prodComonad X) ⥤ Over X
         dsimp
         simp)
 #align category_theory.coalgebra_to_over CategoryTheory.coalgebraToOver
+-/
 
+#print CategoryTheory.overToCoalgebra /-
 /-- The backward direction of the equivalence from coalgebras for the product comonad to the over
 category.
 -/
@@ -77,7 +82,14 @@ def overToCoalgebra : Over X ⥤ Coalgebra (prodComonad X)
       a := prod.lift f.Hom (𝟙 _) }
   map f₁ f₂ g := { f := g.left }
 #align category_theory.over_to_coalgebra CategoryTheory.overToCoalgebra
+-/
 
+/- warning: category_theory.coalgebra_equiv_over -> CategoryTheory.coalgebraEquivOver is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryProducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Comonad.Coalgebra.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Comonad.Coalgebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Over.{u1, u2} C _inst_1 X) (CategoryTheory.Over.category.{u2, u1} C _inst_1 X)
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryProducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Comonad.Coalgebra.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Over.{u1, u2} C _inst_1 X) (CategoryTheory.Comonad.Coalgebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.prodComonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.instCategoryOver.{u1, u2} C _inst_1 X)
+Case conversion may be inaccurate. Consider using '#align category_theory.coalgebra_equiv_over CategoryTheory.coalgebraEquivOverₓ'. -/
 /-- The equivalence from coalgebras for the product comonad to the over category. -/
 @[simps]
 def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X
@@ -109,6 +121,7 @@ open _Root_.Monad
 
 variable [HasBinaryCoproducts C]
 
+#print CategoryTheory.coprodMonad /-
 /-- `X ⨿ -` has a monad structure. This is sometimes called the either monad. -/
 @[simps]
 def coprodMonad : Monad C where
@@ -116,7 +129,9 @@ def coprodMonad : Monad C where
   η' := { app := fun Y => coprod.inr }
   μ' := { app := fun Y => coprod.desc coprod.inl (𝟙 _) }
 #align category_theory.coprod_monad CategoryTheory.coprodMonad
+-/
 
+#print CategoryTheory.algebraToUnder /-
 /-- The forward direction of the equivalence from algebras for the coproduct monad to the under
 category.
 -/
@@ -131,7 +146,9 @@ def algebraToUnder : Monad.Algebra (coprodMonad X) ⥤ Under X
         dsimp
         simp)
 #align category_theory.algebra_to_under CategoryTheory.algebraToUnder
+-/
 
+#print CategoryTheory.underToAlgebra /-
 /-- The backward direction of the equivalence from algebras for the coproduct monad to the under
 category.
 -/
@@ -143,7 +160,14 @@ def underToAlgebra : Under X ⥤ Monad.Algebra (coprodMonad X)
       a := coprod.desc f.Hom (𝟙 _) }
   map f₁ f₂ g := { f := g.right }
 #align category_theory.under_to_algebra CategoryTheory.underToAlgebra
+-/
 
+/- warning: category_theory.algebra_equiv_under -> CategoryTheory.algebraEquivUnder is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryCoproducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Monad.Algebra.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Monad.Algebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Under.{u1, u2} C _inst_1 X) (CategoryTheory.Under.category.{u2, u1} C _inst_1 X)
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (X : C) [_inst_2 : CategoryTheory.Limits.HasBinaryCoproducts.{u1, u2} C _inst_1], CategoryTheory.Equivalence.{u1, u1, max u2 u1, max u2 u1} (CategoryTheory.Monad.Algebra.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.Under.{u1, u2} C _inst_1 X) (CategoryTheory.Monad.Algebra.eilenbergMoore.{u1, u2} C _inst_1 (CategoryTheory.coprodMonad.{u1, u2} C _inst_1 X _inst_2)) (CategoryTheory.instCategoryUnder.{u1, u2} C _inst_1 X)
+Case conversion may be inaccurate. Consider using '#align category_theory.algebra_equiv_under CategoryTheory.algebraEquivUnderₓ'. -/
 /-- The equivalence from algebras for the coproduct monad to the under category.
 -/
 @[simps]

d6814c58

bump to nightly-2023-04-20-00

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

d6678ca6

Diff

@@ -73,7 +73,7 @@ category.
 def overToCoalgebra : Over X ⥤ Coalgebra (prodComonad X)
     where
   obj f :=
-    { a := f.left
+    { A := f.left
       a := prod.lift f.Hom (𝟙 _) }
   map f₁ f₂ g := { f := g.left }
 #align category_theory.over_to_coalgebra CategoryTheory.overToCoalgebra
@@ -139,7 +139,7 @@ category.
 def underToAlgebra : Under X ⥤ Monad.Algebra (coprodMonad X)
     where
   obj f :=
-    { a := f.right
+    { A := f.right
       a := coprod.desc f.Hom (𝟙 _) }
   map f₁ f₂ g := { f := g.right }
 #align category_theory.under_to_algebra CategoryTheory.underToAlgebra

d6814c58

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

d6814c58

refactor: create folder CategoryTheory/Comma (#10108)

38cd7278

Diff

@@ -3,9 +3,9 @@ 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.Over
-import Mathlib.CategoryTheory.Monad.Algebra
+import Mathlib.CategoryTheory.Comma.Over
 import Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts
+import Mathlib.CategoryTheory.Monad.Algebra
 
 #align_import category_theory.monad.products from "leanprover-community/mathlib"@"d6814c584384ddf2825ff038e868451a7c956f31"

d6814c58

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) 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.monad.products
-! leanprover-community/mathlib commit d6814c584384ddf2825ff038e868451a7c956f31
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.CategoryTheory.Over
 import Mathlib.CategoryTheory.Monad.Algebra
 import Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts
 
+#align_import category_theory.monad.products from "leanprover-community/mathlib"@"d6814c584384ddf2825ff038e868451a7c956f31"
+
 /-!
 # Algebras for the coproduct monad

d6814c58

feat: more consistent use of ext, and updating porting notes. (#5242)

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

dbae2f17

Diff

@@ -81,14 +81,7 @@ def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X where
   functor := coalgebraToOver X
   inverse := overToCoalgebra X
   unitIso := NatIso.ofComponents fun A =>
-    Coalgebra.isoMk (Iso.refl _)
-      (prod.hom_ext
-        (by
-          dsimp
-          simp)
-        (by
-          dsimp
-          simpa using A.counit))
+    Coalgebra.isoMk (Iso.refl _) (prod.hom_ext (by simp) (by simpa using A.counit))
   counitIso := NatIso.ofComponents fun f => Over.isoMk (Iso.refl _)
 #align category_theory.coalgebra_equiv_over CategoryTheory.coalgebraEquivOver
 
@@ -139,13 +132,8 @@ def underToAlgebra : Under X ⥤ Monad.Algebra (coprodMonad X) where
 def algebraEquivUnder : Monad.Algebra (coprodMonad X) ≌ Under X where
   functor := algebraToUnder X
   inverse := underToAlgebra X
-  unitIso := NatIso.ofComponents
-    fun A =>
-      Monad.Algebra.isoMk (Iso.refl _)
-        (coprod.hom_ext (by aesop_cat)
-          (by
-            dsimp
-            simpa using A.unit.symm))
+  unitIso := NatIso.ofComponents fun A =>
+    Monad.Algebra.isoMk (Iso.refl _) (coprod.hom_ext (by simp) (by simpa using A.unit.symm))
   counitIso :=
     NatIso.ofComponents fun f => Under.isoMk (Iso.refl _)
 #align category_theory.algebra_equiv_under CategoryTheory.algebraEquivUnder

d6814c58

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

@@ -80,21 +80,16 @@ def overToCoalgebra : Over X ⥤ Coalgebra (prodComonad X) where
 def coalgebraEquivOver : Coalgebra (prodComonad X) ≌ Over X where
   functor := coalgebraToOver X
   inverse := overToCoalgebra X
-  unitIso :=
-    NatIso.ofComponents
-      (fun A =>
-        Coalgebra.isoMk (Iso.refl _)
-          (prod.hom_ext
-            (by
-              dsimp
-              simp)
-            (by
-              dsimp
-              simpa using A.counit)))
-      fun f => by
-        ext
-        simp
-  counitIso := NatIso.ofComponents (fun f => Over.isoMk (Iso.refl _)) fun k => by aesop_cat
+  unitIso := NatIso.ofComponents fun A =>
+    Coalgebra.isoMk (Iso.refl _)
+      (prod.hom_ext
+        (by
+          dsimp
+          simp)
+        (by
+          dsimp
+          simpa using A.counit))
+  counitIso := NatIso.ofComponents fun f => Over.isoMk (Iso.refl _)
 #align category_theory.coalgebra_equiv_over CategoryTheory.coalgebraEquivOver
 
 end
@@ -144,19 +139,15 @@ def underToAlgebra : Under X ⥤ Monad.Algebra (coprodMonad X) where
 def algebraEquivUnder : Monad.Algebra (coprodMonad X) ≌ Under X where
   functor := algebraToUnder X
   inverse := underToAlgebra X
-  unitIso :=
-    NatIso.ofComponents
-      (fun A =>
-        Monad.Algebra.isoMk (Iso.refl _)
-          (coprod.hom_ext (by aesop_cat)
-            (by
-              dsimp
-              simpa using A.unit.symm)))
-      fun f => by
-        ext
-        simp
+  unitIso := NatIso.ofComponents
+    fun A =>
+      Monad.Algebra.isoMk (Iso.refl _)
+        (coprod.hom_ext (by aesop_cat)
+          (by
+            dsimp
+            simpa using A.unit.symm))
   counitIso :=
-    NatIso.ofComponents (fun f => Under.isoMk (Iso.refl _) (by aesop_cat)) fun k => by aesop_cat
+    NatIso.ofComponents fun f => Under.isoMk (Iso.refl _)
 #align category_theory.algebra_equiv_under CategoryTheory.algebraEquivUnder
 
 end

d6814c58

feat: port CategoryTheory.Monad.Products (#3553)

4bea27d7

`category_theory.monad.products` ⟷ `Mathlib.CategoryTheory.Monad.Products`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 110

category_theory.monad.products ⟷ Mathlib.CategoryTheory.Monad.Products

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 110

`category_theory.monad.products` ⟷ `Mathlib.CategoryTheory.Monad.Products`