algebra.category.Group.adjunctions | 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

ecef6862

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

1b089e3b

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) 2019 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison, Johannes Hölzl
 -/
-import Algebra.Category.Group.Basic
+import Algebra.Category.GroupCat.Basic
 import GroupTheory.FreeAbelianGroup
 
 #align_import algebra.category.Group.adjunctions from "leanprover-community/mathlib"@"1b089e3bdc3ce6b39cd472543474a0a137128c6c"

1b089e3b

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) 2019 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison, Johannes Hölzl
 -/
-import Mathbin.Algebra.Category.Group.Basic
-import Mathbin.GroupTheory.FreeAbelianGroup
+import Algebra.Category.Group.Basic
+import GroupTheory.FreeAbelianGroup
 
 #align_import algebra.category.Group.adjunctions from "leanprover-community/mathlib"@"1b089e3bdc3ce6b39cd472543474a0a137128c6c"

1b089e3b

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) 2019 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison, Johannes Hölzl
-
-! This file was ported from Lean 3 source module algebra.category.Group.adjunctions
-! leanprover-community/mathlib commit 1b089e3bdc3ce6b39cd472543474a0a137128c6c
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.Category.Group.Basic
 import Mathbin.GroupTheory.FreeAbelianGroup
 
+#align_import algebra.category.Group.adjunctions from "leanprover-community/mathlib"@"1b089e3bdc3ce6b39cd472543474a0a137128c6c"
+
 /-!
 # Adjunctions regarding the category of (abelian) groups

1b089e3b

bump to nightly-2023-06-23-03

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

2dc54ce1

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison, Johannes Hölzl
 
 ! This file was ported from Lean 3 source module algebra.category.Group.adjunctions
-! leanprover-community/mathlib commit ecef68622cf98f6d42c459e5b5a079aeecdd9842
+! leanprover-community/mathlib commit 1b089e3bdc3ce6b39cd472543474a0a137128c6c
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.GroupTheory.FreeAbelianGroup
 /-!
 # Adjunctions regarding the category of (abelian) groups
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file contains construction of basic adjunctions concerning the category of groups and the
 category of abelian groups.

ecef6862

bump to nightly-2023-06-21-03

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

78c41114

Diff

@@ -46,6 +46,7 @@ namespace AddCommGroupCat
 
 open scoped Classical
 
+#print AddCommGroupCat.free /-
 /-- The free functor `Type u ⥤ AddCommGroup` sending a type `X` to the
 free abelian group with generators `x : X`.
 -/
@@ -56,18 +57,24 @@ def free : Type u ⥤ AddCommGroupCat
   map_id' X := AddMonoidHom.ext FreeAbelianGroup.map_id_apply
   map_comp' X Y Z f g := AddMonoidHom.ext FreeAbelianGroup.map_comp_apply
 #align AddCommGroup.free AddCommGroupCat.free
+-/
 
+#print AddCommGroupCat.free_obj_coe /-
 @[simp]
 theorem free_obj_coe {α : Type u} : (free.obj α : Type u) = FreeAbelianGroup α :=
   rfl
 #align AddCommGroup.free_obj_coe AddCommGroupCat.free_obj_coe
+-/
 
+#print AddCommGroupCat.free_map_coe /-
 @[simp]
 theorem free_map_coe {α β : Type u} {f : α → β} (x : FreeAbelianGroup α) :
     (free.map f) x = f <$> x :=
   rfl
 #align AddCommGroup.free_map_coe AddCommGroupCat.free_map_coe
+-/
 
+#print AddCommGroupCat.adj /-
 /-- The free-forgetful adjunction for abelian groups.
 -/
 def adj : free ⊣ forget AddCommGroupCat.{u} :=
@@ -75,6 +82,7 @@ def adj : free ⊣ forget AddCommGroupCat.{u} :=
     { homEquiv := fun X G => FreeAbelianGroup.lift.symm
       homEquiv_naturality_left_symm := by intros; ext; rfl }
 #align AddCommGroup.adj AddCommGroupCat.adj
+-/
 
 instance : IsRightAdjoint (forget AddCommGroupCat.{u}) :=
   ⟨_, adj⟩
@@ -91,6 +99,7 @@ end AddCommGroupCat
 
 namespace GroupCat
 
+#print GroupCat.free /-
 /-- The free functor `Type u ⥤ Group` sending a type `X` to the free group with generators `x : X`.
 -/
 def free : Type u ⥤ GroupCat where
@@ -99,7 +108,9 @@ def free : Type u ⥤ GroupCat where
   map_id' := by intros; ext1; rfl
   map_comp' := by intros; ext1; rfl
 #align Group.free GroupCat.free
+-/
 
+#print GroupCat.adj /-
 /-- The free-forgetful adjunction for groups.
 -/
 def adj : free ⊣ forget GroupCat.{u} :=
@@ -107,6 +118,7 @@ def adj : free ⊣ forget GroupCat.{u} :=
     { homEquiv := fun X G => FreeGroup.lift.symm
       homEquiv_naturality_left_symm := fun X Y G f g => by ext1; rfl }
 #align Group.adj GroupCat.adj
+-/
 
 instance : IsRightAdjoint (forget GroupCat.{u}) :=
   ⟨_, adj⟩
@@ -115,6 +127,7 @@ end GroupCat
 
 section Abelianization
 
+#print abelianize /-
 /-- The abelianization functor `Group ⥤ CommGroup` sending a group `G` to its abelianization `Gᵃᵇ`.
  -/
 def abelianize : GroupCat.{u} ⥤ CommGroupCat.{u}
@@ -130,16 +143,20 @@ def abelianize : GroupCat.{u} ⥤ CommGroupCat.{u}
   map_id' := by intros; simp only [MonoidHom.mk_coe, coe_id]; ext1; rfl
   map_comp' := by intros; simp only [coe_comp]; ext1; rfl
 #align abelianize abelianize
+-/
 
+#print abelianizeAdj /-
 /-- The abelianization-forgetful adjuction from `Group` to `CommGroup`.-/
 def abelianizeAdj : abelianize ⊣ forget₂ CommGroupCat.{u} GroupCat.{u} :=
   Adjunction.mkOfHomEquiv
     { homEquiv := fun G A => Abelianization.lift.symm
       homEquiv_naturality_left_symm := fun G H A f g => by ext1; rfl }
 #align abelianize_adj abelianizeAdj
+-/
 
 end Abelianization
 
+#print MonCat.units /-
 /-- The functor taking a monoid to its subgroup of units. -/
 @[simps]
 def MonCat.units : MonCat.{u} ⥤ GroupCat.{u}
@@ -149,7 +166,9 @@ def MonCat.units : MonCat.{u} ⥤ GroupCat.{u}
   map_id' X := MonoidHom.ext fun x => Units.ext rfl
   map_comp' X Y Z f g := MonoidHom.ext fun x => Units.ext rfl
 #align Mon.units MonCat.units
+-/
 
+#print GroupCat.forget₂MonAdj /-
 /-- The forgetful-units adjunction between `Group` and `Mon`. -/
 def GroupCat.forget₂MonAdj : forget₂ GroupCat MonCat ⊣ MonCat.units.{u}
     where
@@ -167,10 +186,12 @@ def GroupCat.forget₂MonAdj : forget₂ GroupCat MonCat ⊣ MonCat.units.{u}
   homEquiv_unit X Y f := MonoidHom.ext fun _ => Units.ext rfl
   homEquiv_counit X Y f := MonoidHom.ext fun _ => rfl
 #align Group.forget₂_Mon_adj GroupCat.forget₂MonAdj
+-/
 
 instance : IsRightAdjoint MonCat.units.{u} :=
   ⟨_, GroupCat.forget₂MonAdj⟩
 
+#print CommMonCat.units /-
 /-- The functor taking a monoid to its subgroup of units. -/
 @[simps]
 def CommMonCat.units : CommMonCat.{u} ⥤ CommGroupCat.{u}
@@ -180,7 +201,9 @@ def CommMonCat.units : CommMonCat.{u} ⥤ CommGroupCat.{u}
   map_id' X := MonoidHom.ext fun x => Units.ext rfl
   map_comp' X Y Z f g := MonoidHom.ext fun x => Units.ext rfl
 #align CommMon.units CommMonCat.units
+-/
 
+#print CommGroupCat.forget₂CommMonAdj /-
 /-- The forgetful-units adjunction between `CommGroup` and `CommMon`. -/
 def CommGroupCat.forget₂CommMonAdj : forget₂ CommGroupCat CommMonCat ⊣ CommMonCat.units.{u}
     where
@@ -198,6 +221,7 @@ def CommGroupCat.forget₂CommMonAdj : forget₂ CommGroupCat CommMonCat ⊣ Com
   homEquiv_unit X Y f := MonoidHom.ext fun _ => Units.ext rfl
   homEquiv_counit X Y f := MonoidHom.ext fun _ => rfl
 #align CommGroup.forget₂_CommMon_adj CommGroupCat.forget₂CommMonAdj
+-/
 
 instance : IsRightAdjoint CommMonCat.units.{u} :=
   ⟨_, CommGroupCat.forget₂CommMonAdj⟩

ecef6862

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -73,7 +73,7 @@ theorem free_map_coe {α β : Type u} {f : α → β} (x : FreeAbelianGroup α)
 def adj : free ⊣ forget AddCommGroupCat.{u} :=
   Adjunction.mkOfHomEquiv
     { homEquiv := fun X G => FreeAbelianGroup.lift.symm
-      homEquiv_naturality_left_symm := by intros ; ext; rfl }
+      homEquiv_naturality_left_symm := by intros; ext; rfl }
 #align AddCommGroup.adj AddCommGroupCat.adj
 
 instance : IsRightAdjoint (forget AddCommGroupCat.{u}) :=
@@ -96,8 +96,8 @@ namespace GroupCat
 def free : Type u ⥤ GroupCat where
   obj α := of (FreeGroup α)
   map X Y := FreeGroup.map
-  map_id' := by intros ; ext1; rfl
-  map_comp' := by intros ; ext1; rfl
+  map_id' := by intros; ext1; rfl
+  map_comp' := by intros; ext1; rfl
 #align Group.free GroupCat.free
 
 /-- The free-forgetful adjunction for groups.
@@ -127,8 +127,8 @@ def abelianize : GroupCat.{u} ⥤ CommGroupCat.{u}
       { toFun := fun x => Abelianization.of (f x)
         map_one' := by simp
         map_mul' := by simp }
-  map_id' := by intros ; simp only [MonoidHom.mk_coe, coe_id]; ext1; rfl
-  map_comp' := by intros ; simp only [coe_comp]; ext1; rfl
+  map_id' := by intros; simp only [MonoidHom.mk_coe, coe_id]; ext1; rfl
+  map_comp' := by intros; simp only [coe_comp]; ext1; rfl
 #align abelianize abelianize
 
 /-- The abelianization-forgetful adjuction from `Group` to `CommGroup`.-/

ecef6862

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -44,7 +44,7 @@ open CategoryTheory
 
 namespace AddCommGroupCat
 
-open Classical
+open scoped Classical
 
 /-- The free functor `Type u ⥤ AddCommGroup` sending a type `X` to the
 free abelian group with generators `x : X`.

ecef6862

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -73,10 +73,7 @@ theorem free_map_coe {α β : Type u} {f : α → β} (x : FreeAbelianGroup α)
 def adj : free ⊣ forget AddCommGroupCat.{u} :=
   Adjunction.mkOfHomEquiv
     { homEquiv := fun X G => FreeAbelianGroup.lift.symm
-      homEquiv_naturality_left_symm := by
-        intros
-        ext
-        rfl }
+      homEquiv_naturality_left_symm := by intros ; ext; rfl }
 #align AddCommGroup.adj AddCommGroupCat.adj
 
 instance : IsRightAdjoint (forget AddCommGroupCat.{u}) :=
@@ -99,14 +96,8 @@ namespace GroupCat
 def free : Type u ⥤ GroupCat where
   obj α := of (FreeGroup α)
   map X Y := FreeGroup.map
-  map_id' := by
-    intros
-    ext1
-    rfl
-  map_comp' := by
-    intros
-    ext1
-    rfl
+  map_id' := by intros ; ext1; rfl
+  map_comp' := by intros ; ext1; rfl
 #align Group.free GroupCat.free
 
 /-- The free-forgetful adjunction for groups.
@@ -114,10 +105,7 @@ def free : Type u ⥤ GroupCat where
 def adj : free ⊣ forget GroupCat.{u} :=
   Adjunction.mkOfHomEquiv
     { homEquiv := fun X G => FreeGroup.lift.symm
-      homEquiv_naturality_left_symm := fun X Y G f g =>
-        by
-        ext1
-        rfl }
+      homEquiv_naturality_left_symm := fun X Y G f g => by ext1; rfl }
 #align Group.adj GroupCat.adj
 
 instance : IsRightAdjoint (forget GroupCat.{u}) :=
@@ -139,26 +127,15 @@ def abelianize : GroupCat.{u} ⥤ CommGroupCat.{u}
       { toFun := fun x => Abelianization.of (f x)
         map_one' := by simp
         map_mul' := by simp }
-  map_id' := by
-    intros
-    simp only [MonoidHom.mk_coe, coe_id]
-    ext1
-    rfl
-  map_comp' := by
-    intros
-    simp only [coe_comp]
-    ext1
-    rfl
+  map_id' := by intros ; simp only [MonoidHom.mk_coe, coe_id]; ext1; rfl
+  map_comp' := by intros ; simp only [coe_comp]; ext1; rfl
 #align abelianize abelianize
 
 /-- The abelianization-forgetful adjuction from `Group` to `CommGroup`.-/
 def abelianizeAdj : abelianize ⊣ forget₂ CommGroupCat.{u} GroupCat.{u} :=
   Adjunction.mkOfHomEquiv
     { homEquiv := fun G A => Abelianization.lift.symm
-      homEquiv_naturality_left_symm := fun G H A f g =>
-        by
-        ext1
-        rfl }
+      homEquiv_naturality_left_symm := fun G H A f g => by ext1; rfl }
 #align abelianize_adj abelianizeAdj
 
 end Abelianization

ecef6862

bump to nightly-2023-03-21-14

mathlib commit https://github.com/leanprover-community/mathlib/commit/290a7ba01fbcab1b64757bdaa270d28f4dcede35

4b782568

Diff

@@ -165,16 +165,16 @@ end Abelianization
 
 /-- The functor taking a monoid to its subgroup of units. -/
 @[simps]
-def Mon.units : Mon.{u} ⥤ GroupCat.{u}
+def MonCat.units : MonCat.{u} ⥤ GroupCat.{u}
     where
   obj R := GroupCat.of Rˣ
   map R S f := GroupCat.ofHom <| Units.map f
   map_id' X := MonoidHom.ext fun x => Units.ext rfl
   map_comp' X Y Z f g := MonoidHom.ext fun x => Units.ext rfl
-#align Mon.units Mon.units
+#align Mon.units MonCat.units
 
 /-- The forgetful-units adjunction between `Group` and `Mon`. -/
-def GroupCat.forget₂MonAdj : forget₂ GroupCat Mon ⊣ Mon.units.{u}
+def GroupCat.forget₂MonAdj : forget₂ GroupCat MonCat ⊣ MonCat.units.{u}
     where
   homEquiv X Y :=
     { toFun := fun f => MonoidHom.toHomUnits f
@@ -191,21 +191,21 @@ def GroupCat.forget₂MonAdj : forget₂ GroupCat Mon ⊣ Mon.units.{u}
   homEquiv_counit X Y f := MonoidHom.ext fun _ => rfl
 #align Group.forget₂_Mon_adj GroupCat.forget₂MonAdj
 
-instance : IsRightAdjoint Mon.units.{u} :=
+instance : IsRightAdjoint MonCat.units.{u} :=
   ⟨_, GroupCat.forget₂MonAdj⟩
 
 /-- The functor taking a monoid to its subgroup of units. -/
 @[simps]
-def CommMon.units : CommMon.{u} ⥤ CommGroupCat.{u}
+def CommMonCat.units : CommMonCat.{u} ⥤ CommGroupCat.{u}
     where
   obj R := CommGroupCat.of Rˣ
   map R S f := CommGroupCat.ofHom <| Units.map f
   map_id' X := MonoidHom.ext fun x => Units.ext rfl
   map_comp' X Y Z f g := MonoidHom.ext fun x => Units.ext rfl
-#align CommMon.units CommMon.units
+#align CommMon.units CommMonCat.units
 
 /-- The forgetful-units adjunction between `CommGroup` and `CommMon`. -/
-def CommGroupCat.forget₂CommMonAdj : forget₂ CommGroupCat CommMon ⊣ CommMon.units.{u}
+def CommGroupCat.forget₂CommMonAdj : forget₂ CommGroupCat CommMonCat ⊣ CommMonCat.units.{u}
     where
   homEquiv X Y :=
     { toFun := fun f => MonoidHom.toHomUnits f
@@ -222,6 +222,6 @@ def CommGroupCat.forget₂CommMonAdj : forget₂ CommGroupCat CommMon ⊣ CommMo
   homEquiv_counit X Y f := MonoidHom.ext fun _ => rfl
 #align CommGroup.forget₂_CommMon_adj CommGroupCat.forget₂CommMonAdj
 
-instance : IsRightAdjoint CommMon.units.{u} :=
+instance : IsRightAdjoint CommMonCat.units.{u} :=
   ⟨_, CommGroupCat.forget₂CommMonAdj⟩

ecef6862

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

ecef6862

style: replace '.-/' by '. -/' (#11938)

Purely automatic replacement. If this is in any way controversial; I'm happy to just close this PR.

3556ded2

Diff

@@ -153,7 +153,7 @@ def abelianize : GroupCat.{u} ⥤ CommGroupCat.{u} where
     apply (Equiv.apply_eq_iff_eq_symm_apply Abelianization.lift).mpr; rfl
 #align abelianize abelianize
 
-/-- The abelianization-forgetful adjuction from `Group` to `CommGroup`.-/
+/-- The abelianization-forgetful adjuction from `Group` to `CommGroup`. -/
 def abelianizeAdj : abelianize ⊣ forget₂ CommGroupCat.{u} GroupCat.{u} :=
   Adjunction.mkOfHomEquiv
     { homEquiv := fun G A => Abelianization.lift.symm

ecef6862

doc(Algebra,AlgebraicGeometry): remove mathlib3 names in doc comments (#11955)

Mostly automatic, with a few manual corrections.

11516514

Diff

@@ -17,19 +17,19 @@ category of abelian groups.
 
 ## Main definitions
 
-* `AddCommGroup.free`: constructs the functor associating to a type `X` the free abelian group with
-  generators `x : X`.
-* `Group.free`: constructs the functor associating to a type `X` the free group with
+* `AddCommGroupCat.free`: constructs the functor associating to a type `X` the free abelian group
+  with generators `x : X`.
+* `GroupCat.free`: constructs the functor associating to a type `X` the free group with
   generators `x : X`.
 * `abelianize`: constructs the functor which associates to a group `G` its abelianization `Gᵃᵇ`.
 
 ## Main statements
 
-* `AddCommGroup.adj`: proves that `AddCommGroup.free` is the left adjoint of the forgetful functor
-  from abelian groups to types.
-* `Group.adj`: proves that `Group.free` is the left adjoint of the forgetful functor from groups to
-  types.
-* `abelianize_adj`: proves that `abelianize` is left adjoint to the forgetful functor from
+* `AddCommGroupCat.adj`: proves that `AddCommGroupCat.free` is the left adjoint
+  of the forgetful functor from abelian groups to types.
+* `GroupCat.adj`: proves that `GroupCat.free` is the left adjoint of the forgetful functor
+  from groups to types.
+* `abelianizeAdj`: proves that `abelianize` is left adjoint to the forgetful functor from
   abelian groups to groups.
 -/
 
@@ -179,7 +179,7 @@ def MonCat.units : MonCat.{u} ⥤ GroupCat.{u} where
   map_comp _ _ := MonoidHom.ext fun _ => Units.ext rfl
 #align Mon.units MonCat.units
 
-/-- The forgetful-units adjunction between `Group` and `Mon`. -/
+/-- The forgetful-units adjunction between `GroupCat` and `MonCat`. -/
 def GroupCat.forget₂MonAdj : forget₂ GroupCat MonCat ⊣ MonCat.units.{u} where
   homEquiv X Y :=
     { toFun := fun f => MonoidHom.toHomUnits f
@@ -208,7 +208,7 @@ def CommMonCat.units : CommMonCat.{u} ⥤ CommGroupCat.{u} where
   map_comp _ _ := MonoidHom.ext fun _ => Units.ext rfl
 #align CommMon.units CommMonCat.units
 
-/-- The forgetful-units adjunction between `CommGroup` and `CommMon`. -/
+/-- The forgetful-units adjunction between `CommGroupCat` and `CommMonCat`. -/
 def CommGroupCat.forget₂CommMonAdj : forget₂ CommGroupCat CommMonCat ⊣ CommMonCat.units.{u} where
   homEquiv X Y :=
     { toFun := fun f => MonoidHom.toHomUnits f

ecef6862

chore(*): rename FunLike to DFunLike (#9785)

This prepares for the introduction of a non-dependent synonym of FunLike, which helps a lot with keeping #8386 readable.

This is entirely search-and-replace in 680197f combined with manual fixes in 4145626, e900597 and b8428f8. The commands that generated this change:

sed -i 's/\bFunLike\b/DFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\btoFunLike\b/toDFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/import Mathlib.Data.DFunLike/import Mathlib.Data.FunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\bHom_FunLike\b/Hom_DFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean     
sed -i 's/\binstFunLike\b/instDFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\bfunLike\b/instDFunLike/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean
sed -i 's/\btoo many metavariables to apply `fun_like.has_coe_to_fun`/too many metavariables to apply `DFunLike.hasCoeToFun`/g' {Archive,Counterexamples,Mathlib,test}/**/*.lean

Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>

82656743

Diff

@@ -91,7 +91,7 @@ the monomorphisms in `AddCommGroup` are just the injective functions.
 -/
 -- Porting note: had to elaborate instance of Mono rather than just using `apply_instance`.
 example {G H : AddCommGroupCat.{u}} (f : G ⟶ H) [Mono f] : Function.Injective f :=
-  (mono_iff_injective (FunLike.coe f)).mp (Functor.map_mono (forget AddCommGroupCat) f)
+  (mono_iff_injective (DFunLike.coe f)).mp (Functor.map_mono (forget AddCommGroupCat) f)
 
 
 end AddCommGroupCat

ecef6862

chore: space after ← (#8178)

Co-authored-by: Moritz Firsching <firsching@google.com>

5fb9beab

Diff

@@ -105,10 +105,10 @@ def free : Type u ⥤ GroupCat where
   map := FreeGroup.map
   map_id := by
     -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
-    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
+    intros; ext1; erw [← FreeGroup.map.unique] <;> intros <;> rfl
   map_comp := by
     -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
-    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
+    intros; ext1; erw [← FreeGroup.map.unique] <;> intros <;> rfl
 #align Group.free GroupCat.free
 
 /-- The free-forgetful adjunction for groups.

ecef6862

Revert "chore: revert #7703 (#7710)"

This reverts commit f3695eb2.

ab56fa28

Diff

@@ -60,7 +60,9 @@ theorem free_obj_coe {α : Type u} : (free.obj α : Type u) = FreeAbelianGroup 
   rfl
 #align AddCommGroup.free_obj_coe AddCommGroupCat.free_obj_coe
 
-@[simp]
+-- This currently can't be a `simp` lemma,
+-- because `free_obj_coe` will simplify implicit arguments in the LHS.
+-- (The `simpNF` linter will, correctly, complain.)
 theorem free_map_coe {α β : Type u} {f : α → β} (x : FreeAbelianGroup α) :
     (free.map f) x = f <$> x :=
   rfl
@@ -102,9 +104,11 @@ def free : Type u ⥤ GroupCat where
   obj α := of (FreeGroup α)
   map := FreeGroup.map
   map_id := by
-    intros; ext1; rw [←FreeGroup.map.unique]; intros; rfl
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
   map_comp := by
-    intros; ext1; rw [←FreeGroup.map.unique]; intros; rfl
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
 #align Group.free GroupCat.free
 
 /-- The free-forgetful adjunction for groups.

ecef6862

chore: revert #7703 (#7710)

This reverts commit 26eb2b0a.

f3695eb2

Diff

@@ -60,9 +60,7 @@ theorem free_obj_coe {α : Type u} : (free.obj α : Type u) = FreeAbelianGroup 
   rfl
 #align AddCommGroup.free_obj_coe AddCommGroupCat.free_obj_coe
 
--- This currently can't be a `simp` lemma,
--- because `free_obj_coe` will simplify implicit arguments in the LHS.
--- (The `simpNF` linter will, correctly, complain.)
+@[simp]
 theorem free_map_coe {α β : Type u} {f : α → β} (x : FreeAbelianGroup α) :
     (free.map f) x = f <$> x :=
   rfl
@@ -104,11 +102,9 @@ def free : Type u ⥤ GroupCat where
   obj α := of (FreeGroup α)
   map := FreeGroup.map
   map_id := by
-    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
-    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
+    intros; ext1; rw [←FreeGroup.map.unique]; intros; rfl
   map_comp := by
-    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
-    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
+    intros; ext1; rw [←FreeGroup.map.unique]; intros; rfl
 #align Group.free GroupCat.free
 
 /-- The free-forgetful adjunction for groups.

ecef6862

chore: bump toolchain to v4.2.0-rc2 (#7703)

This includes all the changes from #7606.

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

26eb2b0a

Diff

@@ -60,7 +60,9 @@ theorem free_obj_coe {α : Type u} : (free.obj α : Type u) = FreeAbelianGroup 
   rfl
 #align AddCommGroup.free_obj_coe AddCommGroupCat.free_obj_coe
 
-@[simp]
+-- This currently can't be a `simp` lemma,
+-- because `free_obj_coe` will simplify implicit arguments in the LHS.
+-- (The `simpNF` linter will, correctly, complain.)
 theorem free_map_coe {α β : Type u} {f : α → β} (x : FreeAbelianGroup α) :
     (free.map f) x = f <$> x :=
   rfl
@@ -102,9 +104,11 @@ def free : Type u ⥤ GroupCat where
   obj α := of (FreeGroup α)
   map := FreeGroup.map
   map_id := by
-    intros; ext1; rw [←FreeGroup.map.unique]; intros; rfl
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
   map_comp := by
-    intros; ext1; rw [←FreeGroup.map.unique]; intros; rfl
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    intros; ext1; erw [←FreeGroup.map.unique] <;> intros <;> rfl
 #align Group.free GroupCat.free
 
 /-- The free-forgetful adjunction for groups.

ecef6862

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) 2019 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison, Johannes Hölzl
-
-! This file was ported from Lean 3 source module algebra.category.Group.adjunctions
-! leanprover-community/mathlib commit ecef68622cf98f6d42c459e5b5a079aeecdd9842
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.Category.GroupCat.Basic
 import Mathlib.GroupTheory.FreeAbelianGroup
 
+#align_import algebra.category.Group.adjunctions from "leanprover-community/mathlib"@"ecef68622cf98f6d42c459e5b5a079aeecdd9842"
+
 
 /-!
 # Adjunctions regarding the category of (abelian) groups

ecef6862

feat: port Algebra.Category.GroupCat.Adjunctions (#5292)

Co-authored-by: Kevin Buzzard <k.buzzard@imperial.ac.uk>

b5be6245

`algebra.category.Group.adjunctions` ⟷ `Mathlib.Algebra.Category.GroupCat.Adjunctions`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 425

algebra.category.Group.adjunctions ⟷ Mathlib.Algebra.Category.GroupCat.Adjunctions

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 425

`algebra.category.Group.adjunctions` ⟷ `Mathlib.Algebra.Category.GroupCat.Adjunctions`