analysis.inner_product_space.euclidean_dist

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

9425b6f8

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

36938f77

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -132,7 +132,7 @@ theorem closure_ball (x : E) {r : ℝ} (h : r ≠ 0) : closure (ball x r) = clos
 theorem exists_pos_lt_subset_ball {R : ℝ} {s : Set E} {x : E} (hR : 0 < R) (hs : IsClosed s)
     (h : s ⊆ ball x R) : ∃ r ∈ Ioo 0 R, s ⊆ ball x r :=
   by
-  rw [ball_eq_preimage, ← image_subset_iff] at h 
+  rw [ball_eq_preimage, ← image_subset_iff] at h
   rcases exists_pos_lt_subset_ball hR (to_euclidean.is_closed_image.2 hs) h with ⟨r, hr, hsr⟩
   exact ⟨r, hr, image_subset_iff.1 hsr⟩
 #align euclidean.exists_pos_lt_subset_ball Euclidean.exists_pos_lt_subset_ball

36938f77

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) 2021 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathbin.Analysis.InnerProductSpace.Calculus
-import Mathbin.Analysis.InnerProductSpace.PiL2
+import Analysis.InnerProductSpace.Calculus
+import Analysis.InnerProductSpace.PiL2
 
 #align_import analysis.inner_product_space.euclidean_dist from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"

36938f77

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) 2021 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module analysis.inner_product_space.euclidean_dist
-! leanprover-community/mathlib commit 36938f775671ff28bea1c0310f1608e4afbb22e0
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Analysis.InnerProductSpace.Calculus
 import Mathbin.Analysis.InnerProductSpace.PiL2
 
+#align_import analysis.inner_product_space.euclidean_dist from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"
+
 /-!
 # Euclidean distance on a finite dimensional space

36938f77

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -71,15 +71,19 @@ def ball (x : E) (r : ℝ) : Set E :=
 #align euclidean.ball Euclidean.ball
 -/
 
+#print Euclidean.ball_eq_preimage /-
 theorem ball_eq_preimage (x : E) (r : ℝ) :
     ball x r = toEuclidean ⁻¹' Metric.ball (toEuclidean x) r :=
   rfl
 #align euclidean.ball_eq_preimage Euclidean.ball_eq_preimage
+-/
 
+#print Euclidean.closedBall_eq_preimage /-
 theorem closedBall_eq_preimage (x : E) (r : ℝ) :
     closedBall x r = toEuclidean ⁻¹' Metric.closedBall (toEuclidean x) r :=
   rfl
 #align euclidean.closed_ball_eq_preimage Euclidean.closedBall_eq_preimage
+-/
 
 #print Euclidean.ball_subset_closedBall /-
 theorem ball_subset_closedBall {x : E} {r : ℝ} : ball x r ⊆ closedBall x r := fun y (hy : _ < _) =>
@@ -93,14 +97,18 @@ theorem isOpen_ball {x : E} {r : ℝ} : IsOpen (ball x r) :=
 #align euclidean.is_open_ball Euclidean.isOpen_ball
 -/
 
+#print Euclidean.mem_ball_self /-
 theorem mem_ball_self {x : E} {r : ℝ} (hr : 0 < r) : x ∈ ball x r :=
   Metric.mem_ball_self hr
 #align euclidean.mem_ball_self Euclidean.mem_ball_self
+-/
 
+#print Euclidean.closedBall_eq_image /-
 theorem closedBall_eq_image (x : E) (r : ℝ) :
     closedBall x r = toEuclidean.symm '' Metric.closedBall (toEuclidean x) r := by
   rw [to_euclidean.image_symm_eq_preimage, closed_ball_eq_preimage]
 #align euclidean.closed_ball_eq_image Euclidean.closedBall_eq_image
+-/
 
 #print Euclidean.isCompact_closedBall /-
 theorem isCompact_closedBall {x : E} {r : ℝ} : IsCompact (closedBall x r) :=
@@ -116,11 +124,14 @@ theorem isClosed_closedBall {x : E} {r : ℝ} : IsClosed (closedBall x r) :=
 #align euclidean.is_closed_closed_ball Euclidean.isClosed_closedBall
 -/
 
+#print Euclidean.closure_ball /-
 theorem closure_ball (x : E) {r : ℝ} (h : r ≠ 0) : closure (ball x r) = closedBall x r := by
   rw [ball_eq_preimage, ← to_euclidean.preimage_closure, closure_ball (toEuclidean x) h,
     closed_ball_eq_preimage]
 #align euclidean.closure_ball Euclidean.closure_ball
+-/
 
+#print Euclidean.exists_pos_lt_subset_ball /-
 theorem exists_pos_lt_subset_ball {R : ℝ} {s : Set E} {x : E} (hR : 0 < R) (hs : IsClosed s)
     (h : s ⊆ ball x R) : ∃ r ∈ Ioo 0 R, s ⊆ ball x r :=
   by
@@ -128,32 +139,42 @@ theorem exists_pos_lt_subset_ball {R : ℝ} {s : Set E} {x : E} (hR : 0 < R) (hs
   rcases exists_pos_lt_subset_ball hR (to_euclidean.is_closed_image.2 hs) h with ⟨r, hr, hsr⟩
   exact ⟨r, hr, image_subset_iff.1 hsr⟩
 #align euclidean.exists_pos_lt_subset_ball Euclidean.exists_pos_lt_subset_ball
+-/
 
+#print Euclidean.nhds_basis_closedBall /-
 theorem nhds_basis_closedBall {x : E} : (𝓝 x).HasBasis (fun r : ℝ => 0 < r) (closedBall x) :=
   by
   rw [to_euclidean.to_homeomorph.nhds_eq_comap x]
   exact metric.nhds_basis_closed_ball.comap _
 #align euclidean.nhds_basis_closed_ball Euclidean.nhds_basis_closedBall
+-/
 
+#print Euclidean.closedBall_mem_nhds /-
 theorem closedBall_mem_nhds {x : E} {r : ℝ} (hr : 0 < r) : closedBall x r ∈ 𝓝 x :=
   nhds_basis_closedBall.mem_of_mem hr
 #align euclidean.closed_ball_mem_nhds Euclidean.closedBall_mem_nhds
+-/
 
+#print Euclidean.nhds_basis_ball /-
 theorem nhds_basis_ball {x : E} : (𝓝 x).HasBasis (fun r : ℝ => 0 < r) (ball x) :=
   by
   rw [to_euclidean.to_homeomorph.nhds_eq_comap x]
   exact metric.nhds_basis_ball.comap _
 #align euclidean.nhds_basis_ball Euclidean.nhds_basis_ball
+-/
 
+#print Euclidean.ball_mem_nhds /-
 theorem ball_mem_nhds {x : E} {r : ℝ} (hr : 0 < r) : ball x r ∈ 𝓝 x :=
   nhds_basis_ball.mem_of_mem hr
 #align euclidean.ball_mem_nhds Euclidean.ball_mem_nhds
+-/
 
 end Euclidean
 
 variable {F : Type _} [NormedAddCommGroup F] [NormedSpace ℝ F] {G : Type _} [NormedAddCommGroup G]
   [NormedSpace ℝ G] [FiniteDimensional ℝ G] {f g : F → G} {n : ℕ∞}
 
+#print ContDiff.euclidean_dist /-
 theorem ContDiff.euclidean_dist (hf : ContDiff ℝ n f) (hg : ContDiff ℝ n g) (h : ∀ x, f x ≠ g x) :
     ContDiff ℝ n fun x => Euclidean.dist (f x) (g x) :=
   by
@@ -162,4 +183,5 @@ theorem ContDiff.euclidean_dist (hf : ContDiff ℝ n f) (hg : ContDiff ℝ n g)
   exacts [(@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hf,
     (@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hg, fun x => to_euclidean.injective.ne (h x)]
 #align cont_diff.euclidean_dist ContDiff.euclidean_dist
+-/

36938f77

bump to nightly-2023-06-07-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/58a272265b5e05f258161260dd2c5d247213cbd3

831e78ce

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 
 ! This file was ported from Lean 3 source module analysis.inner_product_space.euclidean_dist
-! leanprover-community/mathlib commit 9425b6f8220e53b059f5a4904786c3c4b50fc057
+! leanprover-community/mathlib commit 36938f775671ff28bea1c0310f1608e4afbb22e0
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.Analysis.InnerProductSpace.PiL2
 /-!
 # Euclidean distance on a finite dimensional space
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 When we define a smooth bump function on a normed space, it is useful to have a smooth distance on
 the space. Since the default distance is not guaranteed to be smooth, we define `to_euclidean` to be
 an equivalence between a finite dimensional topological vector space and the standard Euclidean

9425b6f8

bump to nightly-2023-06-05-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/13361559d66b84f80b6d5a1c4a26aa5054766725

62cd60d3

Diff

@@ -35,30 +35,38 @@ noncomputable section
 
 open FiniteDimensional
 
+#print toEuclidean /-
 /-- If `E` is a finite dimensional space over `ℝ`, then `to_euclidean` is a continuous `ℝ`-linear
 equivalence between `E` and the Euclidean space of the same dimension. -/
 def toEuclidean : E ≃L[ℝ] EuclideanSpace ℝ (Fin <| finrank ℝ E) :=
   ContinuousLinearEquiv.ofFinrankEq finrank_euclideanSpace_fin.symm
 #align to_euclidean toEuclidean
+-/
 
 namespace Euclidean
 
+#print Euclidean.dist /-
 /-- If `x` and `y` are two points in a finite dimensional space over `ℝ`, then `euclidean.dist x y`
 is the distance between these points in the metric defined by some inner product space structure on
 `E`. -/
 def dist (x y : E) : ℝ :=
   dist (toEuclidean x) (toEuclidean y)
 #align euclidean.dist Euclidean.dist
+-/
 
+#print Euclidean.closedBall /-
 /-- Closed ball w.r.t. the euclidean distance. -/
 def closedBall (x : E) (r : ℝ) : Set E :=
   {y | dist y x ≤ r}
 #align euclidean.closed_ball Euclidean.closedBall
+-/
 
+#print Euclidean.ball /-
 /-- Open ball w.r.t. the euclidean distance. -/
 def ball (x : E) (r : ℝ) : Set E :=
   {y | dist y x < r}
 #align euclidean.ball Euclidean.ball
+-/
 
 theorem ball_eq_preimage (x : E) (r : ℝ) :
     ball x r = toEuclidean ⁻¹' Metric.ball (toEuclidean x) r :=
@@ -70,13 +78,17 @@ theorem closedBall_eq_preimage (x : E) (r : ℝ) :
   rfl
 #align euclidean.closed_ball_eq_preimage Euclidean.closedBall_eq_preimage
 
+#print Euclidean.ball_subset_closedBall /-
 theorem ball_subset_closedBall {x : E} {r : ℝ} : ball x r ⊆ closedBall x r := fun y (hy : _ < _) =>
   le_of_lt hy
 #align euclidean.ball_subset_closed_ball Euclidean.ball_subset_closedBall
+-/
 
+#print Euclidean.isOpen_ball /-
 theorem isOpen_ball {x : E} {r : ℝ} : IsOpen (ball x r) :=
   Metric.isOpen_ball.Preimage toEuclidean.Continuous
 #align euclidean.is_open_ball Euclidean.isOpen_ball
+-/
 
 theorem mem_ball_self {x : E} {r : ℝ} (hr : 0 < r) : x ∈ ball x r :=
   Metric.mem_ball_self hr
@@ -87,15 +99,19 @@ theorem closedBall_eq_image (x : E) (r : ℝ) :
   rw [to_euclidean.image_symm_eq_preimage, closed_ball_eq_preimage]
 #align euclidean.closed_ball_eq_image Euclidean.closedBall_eq_image
 
+#print Euclidean.isCompact_closedBall /-
 theorem isCompact_closedBall {x : E} {r : ℝ} : IsCompact (closedBall x r) :=
   by
   rw [closed_ball_eq_image]
   exact (is_compact_closed_ball _ _).image to_euclidean.symm.continuous
 #align euclidean.is_compact_closed_ball Euclidean.isCompact_closedBall
+-/
 
+#print Euclidean.isClosed_closedBall /-
 theorem isClosed_closedBall {x : E} {r : ℝ} : IsClosed (closedBall x r) :=
   isCompact_closedBall.IsClosed
 #align euclidean.is_closed_closed_ball Euclidean.isClosed_closedBall
+-/
 
 theorem closure_ball (x : E) {r : ℝ} (h : r ≠ 0) : closure (ball x r) = closedBall x r := by
   rw [ball_eq_preimage, ← to_euclidean.preimage_closure, closure_ball (toEuclidean x) h,

9425b6f8

bump to nightly-2023-06-04-18

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

3fb4268b

Diff

@@ -52,12 +52,12 @@ def dist (x y : E) : ℝ :=
 
 /-- Closed ball w.r.t. the euclidean distance. -/
 def closedBall (x : E) (r : ℝ) : Set E :=
-  { y | dist y x ≤ r }
+  {y | dist y x ≤ r}
 #align euclidean.closed_ball Euclidean.closedBall
 
 /-- Open ball w.r.t. the euclidean distance. -/
 def ball (x : E) (r : ℝ) : Set E :=
-  { y | dist y x < r }
+  {y | dist y x < r}
 #align euclidean.ball Euclidean.ball
 
 theorem ball_eq_preimage (x : E) (r : ℝ) :

9425b6f8

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -105,7 +105,7 @@ theorem closure_ball (x : E) {r : ℝ} (h : r ≠ 0) : closure (ball x r) = clos
 theorem exists_pos_lt_subset_ball {R : ℝ} {s : Set E} {x : E} (hR : 0 < R) (hs : IsClosed s)
     (h : s ⊆ ball x R) : ∃ r ∈ Ioo 0 R, s ⊆ ball x r :=
   by
-  rw [ball_eq_preimage, ← image_subset_iff] at h
+  rw [ball_eq_preimage, ← image_subset_iff] at h 
   rcases exists_pos_lt_subset_ball hR (to_euclidean.is_closed_image.2 hs) h with ⟨r, hr, hsr⟩
   exact ⟨r, hr, image_subset_iff.1 hsr⟩
 #align euclidean.exists_pos_lt_subset_ball Euclidean.exists_pos_lt_subset_ball
@@ -140,7 +140,7 @@ theorem ContDiff.euclidean_dist (hf : ContDiff ℝ n f) (hg : ContDiff ℝ n g)
   by
   simp only [Euclidean.dist]
   apply @ContDiff.dist ℝ
-  exacts[(@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hf,
+  exacts [(@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hf,
     (@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hg, fun x => to_euclidean.injective.ne (h x)]
 #align cont_diff.euclidean_dist ContDiff.euclidean_dist

9425b6f8

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -24,7 +24,7 @@ distance. This way we hide the usage of `to_euclidean` behind an API.
 -/
 
 
-open Topology
+open scoped Topology
 
 open Set

9425b6f8

bump to nightly-2023-05-01-02

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

aad8b38f

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 
 ! This file was ported from Lean 3 source module analysis.inner_product_space.euclidean_dist
-! leanprover-community/mathlib commit f2ce6086713c78a7f880485f7917ea547a215982
+! leanprover-community/mathlib commit 9425b6f8220e53b059f5a4904786c3c4b50fc057
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -16,8 +16,9 @@ import Mathbin.Analysis.InnerProductSpace.PiL2
 
 When we define a smooth bump function on a normed space, it is useful to have a smooth distance on
 the space. Since the default distance is not guaranteed to be smooth, we define `to_euclidean` to be
-an equivalence between a finite dimensional normed space and the standard Euclidean space of the
-same dimension. Then we define `euclidean.dist x y = dist (to_euclidean x) (to_euclidean y)` and
+an equivalence between a finite dimensional topological vector space and the standard Euclidean
+space of the same dimension.
+Then we define `euclidean.dist x y = dist (to_euclidean x) (to_euclidean y)` and
 provide some definitions (`euclidean.ball`, `euclidean.closed_ball`) and simple lemmas about this
 distance. This way we hide the usage of `to_euclidean` behind an API.
 -/
@@ -27,13 +28,16 @@ open Topology
 
 open Set
 
-variable {E : Type _} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
+variable {E : Type _} [AddCommGroup E] [TopologicalSpace E] [TopologicalAddGroup E] [T2Space E]
+  [Module ℝ E] [ContinuousSMul ℝ E] [FiniteDimensional ℝ E]
 
 noncomputable section
 
+open FiniteDimensional
+
 /-- If `E` is a finite dimensional space over `ℝ`, then `to_euclidean` is a continuous `ℝ`-linear
 equivalence between `E` and the Euclidean space of the same dimension. -/
-def toEuclidean : E ≃L[ℝ] EuclideanSpace ℝ (Fin <| FiniteDimensional.finrank ℝ E) :=
+def toEuclidean : E ≃L[ℝ] EuclideanSpace ℝ (Fin <| finrank ℝ E) :=
   ContinuousLinearEquiv.ofFinrankEq finrank_euclideanSpace_fin.symm
 #align to_euclidean toEuclidean
 
@@ -108,7 +112,7 @@ theorem exists_pos_lt_subset_ball {R : ℝ} {s : Set E} {x : E} (hR : 0 < R) (hs
 
 theorem nhds_basis_closedBall {x : E} : (𝓝 x).HasBasis (fun r : ℝ => 0 < r) (closedBall x) :=
   by
-  rw [to_euclidean.to_homeomorph.nhds_eq_comap]
+  rw [to_euclidean.to_homeomorph.nhds_eq_comap x]
   exact metric.nhds_basis_closed_ball.comap _
 #align euclidean.nhds_basis_closed_ball Euclidean.nhds_basis_closedBall
 
@@ -118,7 +122,7 @@ theorem closedBall_mem_nhds {x : E} {r : ℝ} (hr : 0 < r) : closedBall x r ∈
 
 theorem nhds_basis_ball {x : E} : (𝓝 x).HasBasis (fun r : ℝ => 0 < r) (ball x) :=
   by
-  rw [to_euclidean.to_homeomorph.nhds_eq_comap]
+  rw [to_euclidean.to_homeomorph.nhds_eq_comap x]
   exact metric.nhds_basis_ball.comap _
 #align euclidean.nhds_basis_ball Euclidean.nhds_basis_ball
 
@@ -128,14 +132,15 @@ theorem ball_mem_nhds {x : E} {r : ℝ} (hr : 0 < r) : ball x r ∈ 𝓝 x :=
 
 end Euclidean
 
-variable {F : Type _} [NormedAddCommGroup F] [NormedSpace ℝ F] {f g : F → E} {n : ℕ∞}
+variable {F : Type _} [NormedAddCommGroup F] [NormedSpace ℝ F] {G : Type _} [NormedAddCommGroup G]
+  [NormedSpace ℝ G] [FiniteDimensional ℝ G] {f g : F → G} {n : ℕ∞}
 
 theorem ContDiff.euclidean_dist (hf : ContDiff ℝ n f) (hg : ContDiff ℝ n g) (h : ∀ x, f x ≠ g x) :
     ContDiff ℝ n fun x => Euclidean.dist (f x) (g x) :=
   by
   simp only [Euclidean.dist]
   apply @ContDiff.dist ℝ
-  exacts[(@toEuclidean E _ _ _).ContDiff.comp hf, (@toEuclidean E _ _ _).ContDiff.comp hg, fun x =>
-    to_euclidean.injective.ne (h x)]
+  exacts[(@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hf,
+    (@toEuclidean G _ _ _ _ _ _ _).ContDiff.comp hg, fun x => to_euclidean.injective.ne (h x)]
 #align cont_diff.euclidean_dist ContDiff.euclidean_dist

f2ce6086

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

9425b6f8

refactor: replace some [@foo](https://github.com/foo) _ _ _ _ _ ... by named arguments (#8702)

Using Lean4's named arguments, we manage to remove a few hard-to-read explicit function calls [@foo](https://github.com/foo) _ _ _ _ _ ... which used to be necessary in Lean3.

Occasionally, this results in slightly longer code. The benefit of named arguments is readability, as well as to reduce the brittleness of the code when the argument order is changed.

Co-authored-by: Michael Rothgang <rothgami@math.hu-berlin.de>

df634f2a

Diff

@@ -131,7 +131,7 @@ variable {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F] {G : Type*} [Nor
 theorem ContDiff.euclidean_dist (hf : ContDiff ℝ n f) (hg : ContDiff ℝ n g) (h : ∀ x, f x ≠ g x) :
     ContDiff ℝ n fun x => Euclidean.dist (f x) (g x) := by
   simp only [Euclidean.dist]
-  apply @ContDiff.dist ℝ
-  exacts [(@toEuclidean G _ _ _ _ _ _ _).contDiff.comp hf,
-    (@toEuclidean G _ _ _ _ _ _ _).contDiff.comp hg, fun x => toEuclidean.injective.ne (h x)]
+  apply ContDiff.dist ℝ
+  exacts [(toEuclidean (E := G)).contDiff.comp hf,
+    (toEuclidean (E := G)).contDiff.comp hg, fun x => toEuclidean.injective.ne (h x)]
 #align cont_diff.euclidean_dist ContDiff.euclidean_dist

9425b6f8

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -25,7 +25,7 @@ open scoped Topology
 
 open Set
 
-variable {E : Type _} [AddCommGroup E] [TopologicalSpace E] [TopologicalAddGroup E] [T2Space E]
+variable {E : Type*} [AddCommGroup E] [TopologicalSpace E] [TopologicalAddGroup E] [T2Space E]
   [Module ℝ E] [ContinuousSMul ℝ E] [FiniteDimensional ℝ E]
 
 noncomputable section
@@ -125,7 +125,7 @@ theorem ball_mem_nhds {x : E} {r : ℝ} (hr : 0 < r) : ball x r ∈ 𝓝 x :=
 
 end Euclidean
 
-variable {F : Type _} [NormedAddCommGroup F] [NormedSpace ℝ F] {G : Type _} [NormedAddCommGroup G]
+variable {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F] {G : Type*} [NormedAddCommGroup G]
   [NormedSpace ℝ G] [FiniteDimensional ℝ G] {f g : F → G} {n : ℕ∞}
 
 theorem ContDiff.euclidean_dist (hf : ContDiff ℝ n f) (hg : ContDiff ℝ n g) (h : ∀ x, f x ≠ g x) :

9425b6f8

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) 2021 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module analysis.inner_product_space.euclidean_dist
-! leanprover-community/mathlib commit 9425b6f8220e53b059f5a4904786c3c4b50fc057
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Analysis.InnerProductSpace.Calculus
 import Mathlib.Analysis.InnerProductSpace.PiL2
 
+#align_import analysis.inner_product_space.euclidean_dist from "leanprover-community/mathlib"@"9425b6f8220e53b059f5a4904786c3c4b50fc057"
+
 /-!
 # Euclidean distance on a finite dimensional space

9425b6f8

chore: tidy various files (#5104)

62d90431

Diff

@@ -15,7 +15,7 @@ import Mathlib.Analysis.InnerProductSpace.PiL2
 # Euclidean distance on a finite dimensional space
 
 When we define a smooth bump function on a normed space, it is useful to have a smooth distance on
-the space. Since the default distance is not guaranteed to be smooth, we define `to_euclidean` to be
+the space. Since the default distance is not guaranteed to be smooth, we define `toEuclidean` to be
 an equivalence between a finite dimensional topological vector space and the standard Euclidean
 space of the same dimension.
 Then we define `Euclidean.dist x y = dist (toEuclidean x) (toEuclidean y)` and

9425b6f8

feat: port Analysis.InnerProductSpace.EuclideanDist (#4675)

6cb58e7b

`analysis.inner_product_space.euclidean_dist` ⟷ `Mathlib.Analysis.InnerProductSpace.EuclideanDist`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 945

analysis.inner_product_space.euclidean_dist ⟷ Mathlib.Analysis.InnerProductSpace.EuclideanDist

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 945

`analysis.inner_product_space.euclidean_dist` ⟷ `Mathlib.Analysis.InnerProductSpace.EuclideanDist`