algebraic_topology.fundamental_groupoid.induced_maps

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

e5470580

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

1a51edf1

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) 2022 Praneeth Kolichala. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Praneeth Kolichala
 -/
-import Mathbin.Topology.Homotopy.Equiv
-import Mathbin.CategoryTheory.Equivalence
-import Mathbin.AlgebraicTopology.FundamentalGroupoid.Product
+import Topology.Homotopy.Equiv
+import CategoryTheory.Equivalence
+import AlgebraicTopology.FundamentalGroupoid.Product
 
 #align_import algebraic_topology.fundamental_groupoid.induced_maps from "leanprover-community/mathlib"@"1a51edf13debfcbe223fa06b1cb353b9ed9751cc"

1a51edf1

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) 2022 Praneeth Kolichala. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Praneeth Kolichala
-
-! This file was ported from Lean 3 source module algebraic_topology.fundamental_groupoid.induced_maps
-! leanprover-community/mathlib commit 1a51edf13debfcbe223fa06b1cb353b9ed9751cc
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Topology.Homotopy.Equiv
 import Mathbin.CategoryTheory.Equivalence
 import Mathbin.AlgebraicTopology.FundamentalGroupoid.Product
 
+#align_import algebraic_topology.fundamental_groupoid.induced_maps from "leanprover-community/mathlib"@"1a51edf13debfcbe223fa06b1cb353b9ed9751cc"
+
 /-!
 # Homotopic maps induce naturally isomorphic functors

1a51edf1

bump to nightly-2023-07-09-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/1a51edf13debfcbe223fa06b1cb353b9ed9751cc

e0217a15

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Praneeth Kolichala
 
 ! This file was ported from Lean 3 source module algebraic_topology.fundamental_groupoid.induced_maps
-! leanprover-community/mathlib commit e5470580a62bf043e10976760edfe73c913eb71e
+! leanprover-community/mathlib commit 1a51edf13debfcbe223fa06b1cb353b9ed9751cc
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.AlgebraicTopology.FundamentalGroupoid.Product
 /-!
 # Homotopic maps induce naturally isomorphic functors
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 ## Main definitions
 
   - `fundamental_groupoid_functor.homotopic_maps_nat_iso H` The natural isomorphism

e5470580

bump to nightly-2023-07-07-15

mathlib commit https://github.com/leanprover-community/mathlib/commit/8905e5ed90859939681a725b00f6063e65096d95

b75f01fb

Diff

@@ -49,13 +49,16 @@ open scoped unitInterval
 
 namespace unitInterval
 
+#print unitInterval.path01 /-
 /-- The path 0 ⟶ 1 in I -/
 def path01 : Path (0 : I) 1 where
   toFun := id
   source' := rfl
   target' := rfl
 #align unit_interval.path01 unitInterval.path01
+-/
 
+#print unitInterval.upath01 /-
 /-- The path 0 ⟶ 1 in ulift I -/
 def upath01 : Path (ULift.up 0 : ULift.{u} I) (ULift.up 1)
     where
@@ -63,13 +66,16 @@ def upath01 : Path (ULift.up 0 : ULift.{u} I) (ULift.up 1)
   source' := rfl
   target' := rfl
 #align unit_interval.upath01 unitInterval.upath01
+-/
 
 attribute [local instance] Path.Homotopic.setoid
 
+#print unitInterval.uhpath01 /-
 /-- The homotopy path class of 0 → 1 in `ulift I` -/
 def uhpath01 : @fromTop (TopCat.of <| ULift.{u} I) (ULift.up (0 : I)) ⟶ fromTop (ULift.up 1) :=
   ⟦upath01⟧
 #align unit_interval.uhpath01 unitInterval.uhpath01
+-/
 
 end unitInterval
 
@@ -81,33 +87,41 @@ attribute [local instance] Path.Homotopic.setoid
 
 section Casts
 
+#print ContinuousMap.Homotopy.hcast /-
 /-- Abbreviation for `eq_to_hom` that accepts points in a topological space -/
 abbrev hcast {X : TopCat} {x₀ x₁ : X} (hx : x₀ = x₁) : fromTop x₀ ⟶ fromTop x₁ :=
   eqToHom hx
 #align continuous_map.homotopy.hcast ContinuousMap.Homotopy.hcast
+-/
 
+#print ContinuousMap.Homotopy.hcast_def /-
 @[simp]
 theorem hcast_def {X : TopCat} {x₀ x₁ : X} (hx₀ : x₀ = x₁) : hcast hx₀ = eqToHom hx₀ :=
   rfl
 #align continuous_map.homotopy.hcast_def ContinuousMap.Homotopy.hcast_def
+-/
 
 variable {X₁ X₂ Y : TopCat.{u}} {f : C(X₁, Y)} {g : C(X₂, Y)} {x₀ x₁ : X₁} {x₂ x₃ : X₂}
   {p : Path x₀ x₁} {q : Path x₂ x₃} (hfg : ∀ t, f (p t) = g (q t))
 
+#print ContinuousMap.Homotopy.heq_path_of_eq_image /-
 /-- If `f(p(t) = g(q(t))` for two paths `p` and `q`, then the induced path homotopy classes
 `f(p)` and `g(p)` are the same as well, despite having a priori different types -/
-theorem hEq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) := by
+theorem heq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) := by
   simp only [map_eq, ← Path.Homotopic.map_lift]; apply Path.Homotopic.hpath_hext; exact hfg
-#align continuous_map.homotopy.heq_path_of_eq_image ContinuousMap.Homotopy.hEq_path_of_eq_image
+#align continuous_map.homotopy.heq_path_of_eq_image ContinuousMap.Homotopy.heq_path_of_eq_image
+-/
 
 private theorem start_path : f x₀ = g x₂ := by convert hfg 0 <;> simp only [Path.source]
 
 private theorem end_path : f x₁ = g x₃ := by convert hfg 1 <;> simp only [Path.target]
 
+#print ContinuousMap.Homotopy.eq_path_of_eq_image /-
 theorem eq_path_of_eq_image :
     (πₘ f).map ⟦p⟧ = hcast (start_path hfg) ≫ (πₘ g).map ⟦q⟧ ≫ hcast (end_path hfg).symm := by
   rw [functor.conj_eq_to_hom_iff_heq]; exact heq_path_of_eq_image hfg
 #align continuous_map.homotopy.eq_path_of_eq_image ContinuousMap.Homotopy.eq_path_of_eq_image
+-/
 
 end Casts
 
@@ -138,17 +152,22 @@ many of the paths do not have defeq starting/ending points, so we end up needing
 -/
 
 
+#print ContinuousMap.Homotopy.uliftMap /-
 /-- Interpret a homotopy `H : C(I × X, Y) as a map C(ulift I × X, Y) -/
 def uliftMap : C(TopCat.of (ULift.{u} I × X), Y) :=
   ⟨fun x => H (x.1.down, x.2),
     H.Continuous.comp ((continuous_induced_dom.comp continuous_fst).prod_mk continuous_snd)⟩
 #align continuous_map.homotopy.ulift_map ContinuousMap.Homotopy.uliftMap
+-/
 
+#print ContinuousMap.Homotopy.ulift_apply /-
 @[simp]
-theorem uLift_apply (i : ULift.{u} I) (x : X) : H.uliftMap (i, x) = H (i.down, x) :=
+theorem ulift_apply (i : ULift.{u} I) (x : X) : H.uliftMap (i, x) = H (i.down, x) :=
   rfl
-#align continuous_map.homotopy.ulift_apply ContinuousMap.Homotopy.uLift_apply
+#align continuous_map.homotopy.ulift_apply ContinuousMap.Homotopy.ulift_apply
+-/
 
+#print ContinuousMap.Homotopy.prodToProdTopI /-
 /-- An abbreviation for `prod_to_prod_Top`, with some types already in place to help the
  typechecker. In particular, the first path should be on the ulifted unit interval. -/
 abbrev prodToProdTopI {a₁ a₂ : TopCat.of (ULift I)} {b₁ b₂ : X} (p₁ : fromTop a₁ ⟶ fromTop a₂)
@@ -156,17 +175,23 @@ abbrev prodToProdTopI {a₁ a₂ : TopCat.of (ULift I)} {b₁ b₂ : X} (p₁ :
   @CategoryTheory.Functor.map _ _ _ _ (prodToProdTop (TopCat.of <| ULift I) X) (a₁, b₁) (a₂, b₂)
     (p₁, p₂)
 #align continuous_map.homotopy.prod_to_prod_Top_I ContinuousMap.Homotopy.prodToProdTopI
+-/
 
+#print ContinuousMap.Homotopy.diagonalPath /-
 /-- The diagonal path `d` of a homotopy `H` on a path `p` -/
 def diagonalPath : fromTop (H (0, x₀)) ⟶ fromTop (H (1, x₁)) :=
   (πₘ H.uliftMap).map (prodToProdTopI uhpath01 p)
 #align continuous_map.homotopy.diagonal_path ContinuousMap.Homotopy.diagonalPath
+-/
 
+#print ContinuousMap.Homotopy.diagonalPath' /-
 /-- The diagonal path, but starting from `f x₀` and going to `g x₁` -/
 def diagonalPath' : fromTop (f x₀) ⟶ fromTop (g x₁) :=
   hcast (H.apply_zero x₀).symm ≫ H.diagonalPath p ≫ hcast (H.apply_one x₁)
 #align continuous_map.homotopy.diagonal_path' ContinuousMap.Homotopy.diagonalPath'
+-/
 
+#print ContinuousMap.Homotopy.apply_zero_path /-
 /-- Proof that `f(p) = H(0 ⟶ 0, p)`, with the appropriate casts -/
 theorem apply_zero_path :
     (πₘ f).map p =
@@ -178,7 +203,9 @@ theorem apply_zero_path :
   apply @eq_path_of_eq_image _ _ _ _ H.ulift_map _ _ _ _ _ ((Path.refl (ULift.up _)).Prod p')
   simp
 #align continuous_map.homotopy.apply_zero_path ContinuousMap.Homotopy.apply_zero_path
+-/
 
+#print ContinuousMap.Homotopy.apply_one_path /-
 /-- Proof that `g(p) = H(1 ⟶ 1, p)`, with the appropriate casts -/
 theorem apply_one_path :
     (πₘ g).map p =
@@ -190,7 +217,9 @@ theorem apply_one_path :
   apply @eq_path_of_eq_image _ _ _ _ H.ulift_map _ _ _ _ _ ((Path.refl (ULift.up _)).Prod p')
   simp
 #align continuous_map.homotopy.apply_one_path ContinuousMap.Homotopy.apply_one_path
+-/
 
+#print ContinuousMap.Homotopy.evalAt_eq /-
 /-- Proof that `H.eval_at x = H(0 ⟶ 1, x ⟶ x)`, with the appropriate casts -/
 theorem evalAt_eq (x : X) :
     ⟦H.evalAt x⟧ =
@@ -203,7 +232,9 @@ theorem evalAt_eq (x : X) :
     Path.Homotopic.map_lift]
   apply Path.Homotopic.hpath_hext; intro; rfl
 #align continuous_map.homotopy.eval_at_eq ContinuousMap.Homotopy.evalAt_eq
+-/
 
+#print ContinuousMap.Homotopy.eq_diag_path /-
 -- Finally, we show `d = f(p) ≫ H₁ = H₀ ≫ g(p)`
 theorem eq_diag_path :
     (πₘ f).map p ≫ ⟦H.evalAt x₁⟧ = H.diagonalPath' p ∧
@@ -213,6 +244,7 @@ theorem eq_diag_path :
   dsimp only [prod_to_prod_Top_I]
   constructor <;> · slice_lhs 2 5 => simp [← CategoryTheory.Functor.map_comp]; rfl
 #align continuous_map.homotopy.eq_diag_path ContinuousMap.Homotopy.eq_diag_path
+-/
 
 end ContinuousMap.Homotopy
 
@@ -226,6 +258,7 @@ attribute [local instance] Path.Homotopic.setoid
 
 variable {X Y : TopCat.{u}} {f g : C(X, Y)} (H : ContinuousMap.Homotopy f g)
 
+#print FundamentalGroupoidFunctor.homotopicMapsNatIso /-
 /-- Given a homotopy H : f ∼ g, we have an associated natural isomorphism between the induced
 functors `f` and `g` -/
 def homotopicMapsNatIso : πₘ f ⟶ πₘ g
@@ -233,11 +266,13 @@ def homotopicMapsNatIso : πₘ f ⟶ πₘ g
   app x := ⟦H.evalAt x⟧
   naturality' x y p := by rw [(H.eq_diag_path p).1, (H.eq_diag_path p).2]
 #align fundamental_groupoid_functor.homotopic_maps_nat_iso FundamentalGroupoidFunctor.homotopicMapsNatIso
+-/
 
 instance : IsIso (homotopicMapsNatIso H) := by apply nat_iso.is_iso_of_is_iso_app
 
 open scoped ContinuousMap
 
+#print FundamentalGroupoidFunctor.equivOfHomotopyEquiv /-
 /-- Homotopy equivalent topological spaces have equivalent fundamental groupoids. -/
 def equivOfHomotopyEquiv (hequiv : X ≃ₕ Y) : πₓ X ≌ πₓ Y :=
   by
@@ -248,6 +283,7 @@ def equivOfHomotopyEquiv (hequiv : X ≃ₕ Y) : πₓ X ≌ πₓ Y :=
   · convert as_iso (homotopic_maps_nat_iso hequiv.right_inv.some)
     exacts [(π.map_comp _ _).symm, (π.map_id Y).symm]
 #align fundamental_groupoid_functor.equiv_of_homotopy_equiv FundamentalGroupoidFunctor.equivOfHomotopyEquiv
+-/
 
 end FundamentalGroupoidFunctor

e5470580

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -94,8 +94,6 @@ theorem hcast_def {X : TopCat} {x₀ x₁ : X} (hx₀ : x₀ = x₁) : hcast hx
 variable {X₁ X₂ Y : TopCat.{u}} {f : C(X₁, Y)} {g : C(X₂, Y)} {x₀ x₁ : X₁} {x₂ x₃ : X₂}
   {p : Path x₀ x₁} {q : Path x₂ x₃} (hfg : ∀ t, f (p t) = g (q t))
 
-include hfg
-
 /-- If `f(p(t) = g(q(t))` for two paths `p` and `q`, then the induced path homotopy classes
 `f(p)` and `g(p)` are the same as well, despite having a priori different types -/
 theorem hEq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) := by

e5470580

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -245,7 +245,7 @@ def equivOfHomotopyEquiv (hequiv : X ≃ₕ Y) : πₓ X ≌ πₓ Y :=
   by
   apply equivalence.mk (πₘ hequiv.to_fun : πₓ X ⥤ πₓ Y) (πₘ hequiv.inv_fun : πₓ Y ⥤ πₓ X) <;>
     simp only [Groupoid.hom_to_functor, Groupoid.id_to_functor]
-  · convert(as_iso (homotopic_maps_nat_iso hequiv.left_inv.some)).symm
+  · convert (as_iso (homotopic_maps_nat_iso hequiv.left_inv.some)).symm
     exacts [(π.map_id X).symm, (π.map_comp _ _).symm]
   · convert as_iso (homotopic_maps_nat_iso hequiv.right_inv.some)
     exacts [(π.map_comp _ _).symm, (π.map_id Y).symm]

e5470580

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -203,7 +203,7 @@ theorem evalAt_eq (x : X) :
   refine' (@functor.conj_eq_to_hom_iff_heq (πₓ Y) _ _ _ _ _ _ _ _ _).mpr _
   simp only [id_eq_path_refl, prod_to_prod_Top_map, Path.Homotopic.prod_lift, map_eq, ←
     Path.Homotopic.map_lift]
-  apply Path.Homotopic.hpath_hext; intro ; rfl
+  apply Path.Homotopic.hpath_hext; intro; rfl
 #align continuous_map.homotopy.eval_at_eq ContinuousMap.Homotopy.evalAt_eq
 
 -- Finally, we show `d = f(p) ≫ H₁ = H₀ ≫ g(p)`
@@ -246,9 +246,9 @@ def equivOfHomotopyEquiv (hequiv : X ≃ₕ Y) : πₓ X ≌ πₓ Y :=
   apply equivalence.mk (πₘ hequiv.to_fun : πₓ X ⥤ πₓ Y) (πₘ hequiv.inv_fun : πₓ Y ⥤ πₓ X) <;>
     simp only [Groupoid.hom_to_functor, Groupoid.id_to_functor]
   · convert(as_iso (homotopic_maps_nat_iso hequiv.left_inv.some)).symm
-    exacts[(π.map_id X).symm, (π.map_comp _ _).symm]
+    exacts [(π.map_id X).symm, (π.map_comp _ _).symm]
   · convert as_iso (homotopic_maps_nat_iso hequiv.right_inv.some)
-    exacts[(π.map_comp _ _).symm, (π.map_id Y).symm]
+    exacts [(π.map_comp _ _).symm, (π.map_id Y).symm]
 #align fundamental_groupoid_functor.equiv_of_homotopy_equiv FundamentalGroupoidFunctor.equivOfHomotopyEquiv
 
 end FundamentalGroupoidFunctor

e5470580

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -43,9 +43,9 @@ open CategoryTheory
 
 open FundamentalGroupoidFunctor
 
-open FundamentalGroupoid
+open scoped FundamentalGroupoid
 
-open unitInterval
+open scoped unitInterval
 
 namespace unitInterval
 
@@ -222,7 +222,7 @@ namespace FundamentalGroupoidFunctor
 
 open CategoryTheory
 
-open FundamentalGroupoid
+open scoped FundamentalGroupoid
 
 attribute [local instance] Path.Homotopic.setoid
 
@@ -238,7 +238,7 @@ def homotopicMapsNatIso : πₘ f ⟶ πₘ g
 
 instance : IsIso (homotopicMapsNatIso H) := by apply nat_iso.is_iso_of_is_iso_app
 
-open ContinuousMap
+open scoped ContinuousMap
 
 /-- Homotopy equivalent topological spaces have equivalent fundamental groupoids. -/
 def equivOfHomotopyEquiv (hequiv : X ≃ₕ Y) : πₓ X ≌ πₓ Y :=

e5470580

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -98,11 +98,8 @@ include hfg
 
 /-- If `f(p(t) = g(q(t))` for two paths `p` and `q`, then the induced path homotopy classes
 `f(p)` and `g(p)` are the same as well, despite having a priori different types -/
-theorem hEq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) :=
-  by
-  simp only [map_eq, ← Path.Homotopic.map_lift]
-  apply Path.Homotopic.hpath_hext
-  exact hfg
+theorem hEq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) := by
+  simp only [map_eq, ← Path.Homotopic.map_lift]; apply Path.Homotopic.hpath_hext; exact hfg
 #align continuous_map.homotopy.heq_path_of_eq_image ContinuousMap.Homotopy.hEq_path_of_eq_image
 
 private theorem start_path : f x₀ = g x₂ := by convert hfg 0 <;> simp only [Path.source]
@@ -110,10 +107,8 @@ private theorem start_path : f x₀ = g x₂ := by convert hfg 0 <;> simp only [
 private theorem end_path : f x₁ = g x₃ := by convert hfg 1 <;> simp only [Path.target]
 
 theorem eq_path_of_eq_image :
-    (πₘ f).map ⟦p⟧ = hcast (start_path hfg) ≫ (πₘ g).map ⟦q⟧ ≫ hcast (end_path hfg).symm :=
-  by
-  rw [functor.conj_eq_to_hom_iff_heq]
-  exact heq_path_of_eq_image hfg
+    (πₘ f).map ⟦p⟧ = hcast (start_path hfg) ≫ (πₘ g).map ⟦q⟧ ≫ hcast (end_path hfg).symm := by
+  rw [functor.conj_eq_to_hom_iff_heq]; exact heq_path_of_eq_image hfg
 #align continuous_map.homotopy.eq_path_of_eq_image ContinuousMap.Homotopy.eq_path_of_eq_image
 
 end Casts
@@ -218,9 +213,7 @@ theorem eq_diag_path :
   by
   rw [H.apply_zero_path, H.apply_one_path, H.eval_at_eq, H.eval_at_eq]
   dsimp only [prod_to_prod_Top_I]
-  constructor <;>
-    · slice_lhs 2 5 => simp [← CategoryTheory.Functor.map_comp]
-      rfl
+  constructor <;> · slice_lhs 2 5 => simp [← CategoryTheory.Functor.map_comp]; rfl
 #align continuous_map.homotopy.eq_diag_path ContinuousMap.Homotopy.eq_diag_path
 
 end ContinuousMap.Homotopy

e5470580

bump to nightly-2023-05-28-03

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

6c6011cf

Diff

@@ -106,10 +106,8 @@ theorem hEq_path_of_eq_image : HEq ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q
 #align continuous_map.homotopy.heq_path_of_eq_image ContinuousMap.Homotopy.hEq_path_of_eq_image
 
 private theorem start_path : f x₀ = g x₂ := by convert hfg 0 <;> simp only [Path.source]
-#align continuous_map.homotopy.start_path continuous_map.homotopy.start_path
 
 private theorem end_path : f x₁ = g x₃ := by convert hfg 1 <;> simp only [Path.target]
-#align continuous_map.homotopy.end_path continuous_map.homotopy.end_path
 
 theorem eq_path_of_eq_image :
     (πₘ f).map ⟦p⟧ = hcast (start_path hfg) ≫ (πₘ g).map ⟦q⟧ ≫ hcast (end_path hfg).symm :=

e5470580

bump to nightly-2023-03-17-00

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

c85864d4

Diff

@@ -254,7 +254,7 @@ def equivOfHomotopyEquiv (hequiv : X ≃ₕ Y) : πₓ X ≌ πₓ Y :=
   by
   apply equivalence.mk (πₘ hequiv.to_fun : πₓ X ⥤ πₓ Y) (πₘ hequiv.inv_fun : πₓ Y ⥤ πₓ X) <;>
     simp only [Groupoid.hom_to_functor, Groupoid.id_to_functor]
-  · convert (as_iso (homotopic_maps_nat_iso hequiv.left_inv.some)).symm
+  · convert(as_iso (homotopic_maps_nat_iso hequiv.left_inv.some)).symm
     exacts[(π.map_id X).symm, (π.map_comp _ _).symm]
   · convert as_iso (homotopic_maps_nat_iso hequiv.right_inv.some)
     exacts[(π.map_comp _ _).symm, (π.map_id Y).symm]

e5470580

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

e5470580

feat: add topological lemmas for ULift (#8958)

This also adds a handful of easy instances

Arguably the topological space instance should be defined via coinduced to make these true by Iff.rfl, but that creates a headache with constructors for normed spaces, so is not in this PR.

92d4b01a

Diff

@@ -142,7 +142,7 @@ many of the paths do not have defeq starting/ending points, so we end up needing
 /-- Interpret a homotopy `H : C(I × X, Y)` as a map `C(ULift I × X, Y)` -/
 def uliftMap : C(TopCat.of (ULift.{u} I × X), Y) :=
   ⟨fun x => H (x.1.down, x.2),
-    H.continuous.comp ((continuous_induced_dom.comp continuous_fst).prod_mk continuous_snd)⟩
+    H.continuous.comp ((continuous_uLift_down.comp continuous_fst).prod_mk continuous_snd)⟩
 #align continuous_map.homotopy.ulift_map ContinuousMap.Homotopy.uliftMap
 
 -- This lemma has always been bad, but the linter only noticed after lean4#2644.

e5470580

fix: Fix FundamentalGroupoid being reducible. (#8257)

Instead it is now the opposite -- a structure with a single field.

zulip discussion

Co-authored-by: Adam Topaz <adamtopaz@users.noreply.github.com>

6b362d1e

Diff

@@ -79,11 +79,12 @@ section Casts
 
 /-- Abbreviation for `eqToHom` that accepts points in a topological space -/
 abbrev hcast {X : TopCat} {x₀ x₁ : X} (hx : x₀ = x₁) : fromTop x₀ ⟶ fromTop x₁ :=
-  eqToHom hx
+  eqToHom <| FundamentalGroupoid.ext _ _ hx
 #align continuous_map.homotopy.hcast ContinuousMap.Homotopy.hcast
 
 @[simp]
-theorem hcast_def {X : TopCat} {x₀ x₁ : X} (hx₀ : x₀ = x₁) : hcast hx₀ = eqToHom hx₀ :=
+theorem hcast_def {X : TopCat} {x₀ x₁ : X} (hx₀ : x₀ = x₁) :
+    hcast hx₀ = eqToHom (FundamentalGroupoid.ext _ _ hx₀) :=
   rfl
 #align continuous_map.homotopy.hcast_def ContinuousMap.Homotopy.hcast_def
 
@@ -103,7 +104,9 @@ private theorem end_path : f x₁ = g x₃ := by convert hfg 1 <;> simp only [Pa
 theorem eq_path_of_eq_image :
     (πₘ f).map ⟦p⟧ = hcast (start_path hfg) ≫ (πₘ g).map ⟦q⟧ ≫ hcast (end_path hfg).symm := by
   rw [Functor.conj_eqToHom_iff_heq
-    ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧) (start_path hfg) (end_path hfg)]
+    ((πₘ f).map ⟦p⟧) ((πₘ g).map ⟦q⟧)
+    (FundamentalGroupoid.ext _ _ <| start_path hfg)
+    (FundamentalGroupoid.ext _ _ <| end_path hfg)]
   exact heq_path_of_eq_image hfg
 #align continuous_map.homotopy.eq_path_of_eq_image ContinuousMap.Homotopy.eq_path_of_eq_image
 
@@ -152,7 +155,7 @@ theorem ulift_apply (i : ULift.{u} I) (x : X) : H.uliftMap (i, x) = H (i.down, x
  typechecker. In particular, the first path should be on the ulifted unit interval. -/
 abbrev prodToProdTopI {a₁ a₂ : TopCat.of (ULift I)} {b₁ b₂ : X} (p₁ : fromTop a₁ ⟶ fromTop a₂)
     (p₂ : fromTop b₁ ⟶ fromTop b₂) :=
-  (prodToProdTop (TopCat.of <| ULift I) X).map (X := (a₁, b₁)) (Y := (a₂, b₂)) (p₁, p₂)
+  (prodToProdTop (TopCat.of <| ULift I) X).map (X := (⟨a₁⟩, ⟨b₁⟩)) (Y := (⟨a₂⟩, ⟨b₂⟩)) (p₁, p₂)
 set_option linter.uppercaseLean3 false in
 #align continuous_map.homotopy.prod_to_prod_Top_I ContinuousMap.Homotopy.prodToProdTopI
 
@@ -188,9 +191,11 @@ theorem apply_one_path : (πₘ g).map p = hcast (H.apply_one x₀).symm ≫
 
 /-- Proof that `H.evalAt x = H(0 ⟶ 1, x ⟶ x)`, with the appropriate casts -/
 theorem evalAt_eq (x : X) : ⟦H.evalAt x⟧ = hcast (H.apply_zero x).symm ≫
-    (πₘ H.uliftMap).map (prodToProdTopI uhpath01 (𝟙 x)) ≫ hcast (H.apply_one x).symm.symm := by
+    (πₘ H.uliftMap).map (prodToProdTopI uhpath01 (𝟙 (fromTop x))) ≫
+      hcast (H.apply_one x).symm.symm := by
   dsimp only [prodToProdTopI, uhpath01, hcast]
-  refine' (@Functor.conj_eqToHom_iff_heq (πₓ Y) _ _ _ _ _ _ _ _ (H.apply_one x).symm).mpr _
+  refine' (@Functor.conj_eqToHom_iff_heq (πₓ Y) _ _ _ _ _ _ _ _
+    (FundamentalGroupoid.ext _ _ <| H.apply_one x).symm).mpr _
   simp only [id_eq_path_refl, prodToProdTop_map, Path.Homotopic.prod_lift, map_eq, ←
     Path.Homotopic.map_lift]
   apply Path.Homotopic.hpath_hext; intro; rfl
@@ -225,7 +230,7 @@ variable {X Y : TopCat.{u}} {f g : C(X, Y)} (H : ContinuousMap.Homotopy f g)
 functors `f` and `g` -/
 -- Porting note: couldn't use category arrow `\hom` in statement, needed to expand
 def homotopicMapsNatIso : @Quiver.Hom _ Functor.category.toQuiver (πₘ f) (πₘ g) where
-  app x := ⟦H.evalAt x⟧
+  app x := ⟦H.evalAt x.as⟧
   -- Porting note: Turned `rw` into `erw` in the line below
   naturality x y p := by erw [(H.eq_diag_path p).1, (H.eq_diag_path p).2]
 #align fundamental_groupoid_functor.homotopic_maps_nat_iso FundamentalGroupoidFunctor.homotopicMapsNatIso

e5470580

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

This reverts commit f3695eb2.

ab56fa28

Diff

@@ -142,7 +142,8 @@ def uliftMap : C(TopCat.of (ULift.{u} I × X), Y) :=
     H.continuous.comp ((continuous_induced_dom.comp continuous_fst).prod_mk continuous_snd)⟩
 #align continuous_map.homotopy.ulift_map ContinuousMap.Homotopy.uliftMap
 
-@[simp]
+-- This lemma has always been bad, but the linter only noticed after lean4#2644.
+@[simp, nolint simpNF]
 theorem ulift_apply (i : ULift.{u} I) (x : X) : H.uliftMap (i, x) = H (i.down, x) :=
   rfl
 #align continuous_map.homotopy.ulift_apply ContinuousMap.Homotopy.ulift_apply
@@ -171,7 +172,8 @@ theorem apply_zero_path : (πₘ f).map p = hcast (H.apply_zero x₀).symm ≫
     hcast (H.apply_zero x₁) :=
   Quotient.inductionOn p fun p' => by
     apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')
-    rw [Path.prod_coe]; simp_rw [ulift_apply]; simp
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    erw [Path.prod_coe]; simp_rw [ulift_apply]; simp
 #align continuous_map.homotopy.apply_zero_path ContinuousMap.Homotopy.apply_zero_path
 
 /-- Proof that `g(p) = H(1 ⟶ 1, p)`, with the appropriate casts -/
@@ -180,7 +182,8 @@ theorem apply_one_path : (πₘ g).map p = hcast (H.apply_one x₀).symm ≫
     hcast (H.apply_one x₁) :=
   Quotient.inductionOn p fun p' => by
     apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')
-    rw [Path.prod_coe]; simp_rw [ulift_apply]; simp
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    erw [Path.prod_coe]; simp_rw [ulift_apply]; simp
 #align continuous_map.homotopy.apply_one_path ContinuousMap.Homotopy.apply_one_path
 
 /-- Proof that `H.evalAt x = H(0 ⟶ 1, x ⟶ x)`, with the appropriate casts -/

e5470580

chore: revert #7703 (#7710)

This reverts commit 26eb2b0a.

f3695eb2

Diff

@@ -142,8 +142,7 @@ def uliftMap : C(TopCat.of (ULift.{u} I × X), Y) :=
     H.continuous.comp ((continuous_induced_dom.comp continuous_fst).prod_mk continuous_snd)⟩
 #align continuous_map.homotopy.ulift_map ContinuousMap.Homotopy.uliftMap
 
--- This lemma has always been bad, but the linter only noticed after lean4#2644.
-@[simp, nolint simpNF]
+@[simp]
 theorem ulift_apply (i : ULift.{u} I) (x : X) : H.uliftMap (i, x) = H (i.down, x) :=
   rfl
 #align continuous_map.homotopy.ulift_apply ContinuousMap.Homotopy.ulift_apply
@@ -172,8 +171,7 @@ theorem apply_zero_path : (πₘ f).map p = hcast (H.apply_zero x₀).symm ≫
     hcast (H.apply_zero x₁) :=
   Quotient.inductionOn p fun p' => by
     apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')
-    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
-    erw [Path.prod_coe]; simp_rw [ulift_apply]; simp
+    rw [Path.prod_coe]; simp_rw [ulift_apply]; simp
 #align continuous_map.homotopy.apply_zero_path ContinuousMap.Homotopy.apply_zero_path
 
 /-- Proof that `g(p) = H(1 ⟶ 1, p)`, with the appropriate casts -/
@@ -182,8 +180,7 @@ theorem apply_one_path : (πₘ g).map p = hcast (H.apply_one x₀).symm ≫
     hcast (H.apply_one x₁) :=
   Quotient.inductionOn p fun p' => by
     apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')
-    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
-    erw [Path.prod_coe]; simp_rw [ulift_apply]; simp
+    rw [Path.prod_coe]; simp_rw [ulift_apply]; simp
 #align continuous_map.homotopy.apply_one_path ContinuousMap.Homotopy.apply_one_path
 
 /-- Proof that `H.evalAt x = H(0 ⟶ 1, x ⟶ x)`, with the appropriate casts -/

e5470580

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

@@ -142,7 +142,8 @@ def uliftMap : C(TopCat.of (ULift.{u} I × X), Y) :=
     H.continuous.comp ((continuous_induced_dom.comp continuous_fst).prod_mk continuous_snd)⟩
 #align continuous_map.homotopy.ulift_map ContinuousMap.Homotopy.uliftMap
 
-@[simp]
+-- This lemma has always been bad, but the linter only noticed after lean4#2644.
+@[simp, nolint simpNF]
 theorem ulift_apply (i : ULift.{u} I) (x : X) : H.uliftMap (i, x) = H (i.down, x) :=
   rfl
 #align continuous_map.homotopy.ulift_apply ContinuousMap.Homotopy.ulift_apply
@@ -171,7 +172,8 @@ theorem apply_zero_path : (πₘ f).map p = hcast (H.apply_zero x₀).symm ≫
     hcast (H.apply_zero x₁) :=
   Quotient.inductionOn p fun p' => by
     apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')
-    rw [Path.prod_coe]; simp_rw [ulift_apply]; simp
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    erw [Path.prod_coe]; simp_rw [ulift_apply]; simp
 #align continuous_map.homotopy.apply_zero_path ContinuousMap.Homotopy.apply_zero_path
 
 /-- Proof that `g(p) = H(1 ⟶ 1, p)`, with the appropriate casts -/
@@ -180,7 +182,8 @@ theorem apply_one_path : (πₘ g).map p = hcast (H.apply_one x₀).symm ≫
     hcast (H.apply_one x₁) :=
   Quotient.inductionOn p fun p' => by
     apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')
-    rw [Path.prod_coe]; simp_rw [ulift_apply]; simp
+    -- This used to be `rw`, but we need `erw` after leanprover/lean4#2644
+    erw [Path.prod_coe]; simp_rw [ulift_apply]; simp
 #align continuous_map.homotopy.apply_one_path ContinuousMap.Homotopy.apply_one_path
 
 /-- Proof that `H.evalAt x = H(0 ⟶ 1, x ⟶ x)`, with the appropriate casts -/

e5470580

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) 2022 Praneeth Kolichala. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Praneeth Kolichala
-
-! This file was ported from Lean 3 source module algebraic_topology.fundamental_groupoid.induced_maps
-! leanprover-community/mathlib commit e5470580a62bf043e10976760edfe73c913eb71e
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Topology.Homotopy.Equiv
 import Mathlib.CategoryTheory.Equivalence
 import Mathlib.AlgebraicTopology.FundamentalGroupoid.Product
 
+#align_import algebraic_topology.fundamental_groupoid.induced_maps from "leanprover-community/mathlib"@"e5470580a62bf043e10976760edfe73c913eb71e"
+
 /-!
 # Homotopic maps induce naturally isomorphic functors

e5470580

feat: port AlgebraicTopology.FundamentalGroupoid.InducedMaps (#5756)

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

e5bc4385

`algebraic_topology.fundamental_groupoid.induced_maps` ⟷ `Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 662

algebraic_topology.fundamental_groupoid.induced_maps ⟷ Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 662

`algebraic_topology.fundamental_groupoid.induced_maps` ⟷ `Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps`