analysis.normed_space.enorm | 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

57ac39bd

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

6b31d1ee

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -162,7 +162,7 @@ noncomputable instance : Top (ENorm 𝕜 V) :=
         simpa [hx, hy] using hxy
       map_smul_le' := fun c x =>
         by
-        split_ifs with hcx hx hx <;> simp only [smul_eq_zero, not_or] at hcx 
+        split_ifs with hcx hx hx <;> simp only [smul_eq_zero, not_or] at hcx
         · simp only [MulZeroClass.mul_zero, le_refl]
         · have : c = 0 := by tauto
           simp [this]

6b31d1ee

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
 -/
-import Mathbin.Analysis.NormedSpace.Basic
+import Analysis.NormedSpace.Basic
 
 #align_import analysis.normed_space.enorm from "leanprover-community/mathlib"@"6b31d1eebd64eab86d5bd9936bfaada6ca8b5842"

6b31d1ee

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
-
-! This file was ported from Lean 3 source module analysis.normed_space.enorm
-! leanprover-community/mathlib commit 6b31d1eebd64eab86d5bd9936bfaada6ca8b5842
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Analysis.NormedSpace.Basic
 
+#align_import analysis.normed_space.enorm from "leanprover-community/mathlib"@"6b31d1eebd64eab86d5bd9936bfaada6ca8b5842"
+
 /-!
 # Extended norm

6b31d1ee

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -69,20 +69,27 @@ theorem coeFn_injective : Function.Injective (coeFn : ENorm 𝕜 V → V → ℝ
 #align enorm.coe_fn_injective ENorm.coeFn_injective
 -/
 
+#print ENorm.ext /-
 @[ext]
 theorem ext {e₁ e₂ : ENorm 𝕜 V} (h : ∀ x, e₁ x = e₂ x) : e₁ = e₂ :=
   coeFn_injective <| funext h
 #align enorm.ext ENorm.ext
+-/
 
+#print ENorm.ext_iff /-
 theorem ext_iff {e₁ e₂ : ENorm 𝕜 V} : e₁ = e₂ ↔ ∀ x, e₁ x = e₂ x :=
   ⟨fun h x => h ▸ rfl, ext⟩
 #align enorm.ext_iff ENorm.ext_iff
+-/
 
+#print ENorm.coe_inj /-
 @[simp, norm_cast]
 theorem coe_inj {e₁ e₂ : ENorm 𝕜 V} : (e₁ : V → ℝ≥0∞) = e₂ ↔ e₁ = e₂ :=
   coeFn_injective.eq_iff
 #align enorm.coe_inj ENorm.coe_inj
+-/
 
+#print ENorm.map_smul /-
 @[simp]
 theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
   le_antisymm (e.map_smul_le' c x) <| by
@@ -97,36 +104,49 @@ theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
           one_mul] <;>
         simp [hc]
 #align enorm.map_smul ENorm.map_smul
+-/
 
+#print ENorm.map_zero /-
 @[simp]
 theorem map_zero : e 0 = 0 := by rw [← zero_smul 𝕜 (0 : V), e.map_smul]; norm_num
 #align enorm.map_zero ENorm.map_zero
+-/
 
+#print ENorm.eq_zero_iff /-
 @[simp]
 theorem eq_zero_iff {x : V} : e x = 0 ↔ x = 0 :=
   ⟨e.eq_zero' x, fun h => h.symm ▸ e.map_zero⟩
 #align enorm.eq_zero_iff ENorm.eq_zero_iff
+-/
 
+#print ENorm.map_neg /-
 @[simp]
 theorem map_neg (x : V) : e (-x) = e x :=
   calc
     e (-x) = ‖(-1 : 𝕜)‖₊ * e x := by rw [← map_smul, neg_one_smul]
     _ = e x := by simp
 #align enorm.map_neg ENorm.map_neg
+-/
 
+#print ENorm.map_sub_rev /-
 theorem map_sub_rev (x y : V) : e (x - y) = e (y - x) := by rw [← neg_sub, e.map_neg]
 #align enorm.map_sub_rev ENorm.map_sub_rev
+-/
 
+#print ENorm.map_add_le /-
 theorem map_add_le (x y : V) : e (x + y) ≤ e x + e y :=
   e.map_add_le' x y
 #align enorm.map_add_le ENorm.map_add_le
+-/
 
+#print ENorm.map_sub_le /-
 theorem map_sub_le (x y : V) : e (x - y) ≤ e x + e y :=
   calc
     e (x - y) = e (x + -y) := by rw [sub_eq_add_neg]
     _ ≤ e x + e (-y) := (e.map_add_le x (-y))
     _ = e x + e y := by rw [e.map_neg]
 #align enorm.map_sub_le ENorm.map_sub_le
+-/
 
 instance : PartialOrder (ENorm 𝕜 V)
     where
@@ -155,9 +175,11 @@ noncomputable instance : Top (ENorm 𝕜 V) :=
 noncomputable instance : Inhabited (ENorm 𝕜 V) :=
   ⟨⊤⟩
 
+#print ENorm.top_map /-
 theorem top_map {x : V} (hx : x ≠ 0) : (⊤ : ENorm 𝕜 V) x = ⊤ :=
   if_neg hx
 #align enorm.top_map ENorm.top_map
+-/
 
 noncomputable instance : OrderTop (ENorm 𝕜 V)
     where
@@ -179,15 +201,19 @@ noncomputable instance : SemilatticeSup (ENorm 𝕜 V) :=
     le_sup_right := fun e₁ e₂ x => le_max_right _ _
     sup_le := fun e₁ e₂ e₃ h₁ h₂ x => max_le (h₁ x) (h₂ x) }
 
+#print ENorm.coe_max /-
 @[simp, norm_cast]
 theorem coe_max (e₁ e₂ : ENorm 𝕜 V) : ⇑(e₁ ⊔ e₂) = fun x => max (e₁ x) (e₂ x) :=
   rfl
 #align enorm.coe_max ENorm.coe_max
+-/
 
+#print ENorm.max_map /-
 @[norm_cast]
 theorem max_map (e₁ e₂ : ENorm 𝕜 V) (x : V) : (e₁ ⊔ e₂) x = max (e₁ x) (e₂ x) :=
   rfl
 #align enorm.max_map ENorm.max_map
+-/
 
 #print ENorm.emetricSpace /-
 /-- Structure of an `emetric_space` defined by an extended norm. -/
@@ -226,13 +252,17 @@ instance : MetricSpace e.finiteSubspace :=
   change e (x - y) ≠ ⊤
   exact ne_top_of_le_ne_top (ENNReal.add_lt_top.2 ⟨x.2, y.2⟩).Ne (e.map_sub_le x y)
 
+#print ENorm.finite_dist_eq /-
 theorem finite_dist_eq (x y : e.finiteSubspace) : dist x y = (e (x - y)).toReal :=
   rfl
 #align enorm.finite_dist_eq ENorm.finite_dist_eq
+-/
 
+#print ENorm.finite_edist_eq /-
 theorem finite_edist_eq (x y : e.finiteSubspace) : edist x y = e (x - y) :=
   rfl
 #align enorm.finite_edist_eq ENorm.finite_edist_eq
+-/
 
 /-- Normed group instance on `e.finite_subspace`. -/
 instance : NormedAddCommGroup e.finiteSubspace :=
@@ -241,9 +271,11 @@ instance : NormedAddCommGroup e.finiteSubspace :=
     norm := fun x => (e x).toReal
     dist_eq := fun x y => rfl }
 
+#print ENorm.finite_norm_eq /-
 theorem finite_norm_eq (x : e.finiteSubspace) : ‖x‖ = (e x).toReal :=
   rfl
 #align enorm.finite_norm_eq ENorm.finite_norm_eq
+-/
 
 /-- Normed space instance on `e.finite_subspace`. -/
 instance : NormedSpace 𝕜 e.finiteSubspace

6b31d1ee

bump to nightly-2023-06-10-03

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

e13a28eb

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
 
 ! This file was ported from Lean 3 source module analysis.normed_space.enorm
-! leanprover-community/mathlib commit 57ac39bd365c2f80589a700f9fbb664d3a1a30c2
+! leanprover-community/mathlib commit 6b31d1eebd64eab86d5bd9936bfaada6ca8b5842
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.Analysis.NormedSpace.Basic
 /-!
 # Extended norm
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 In this file we define a structure `enorm 𝕜 V` representing an extended norm (i.e., a norm that can
 take the value `∞`) on a vector space `V` over a normed field `𝕜`. We do not use `class` for
 an `enorm` because the same space can have more than one extended norm. For example, the space of

57ac39bd

bump to nightly-2023-06-09-07

mathlib commit https://github.com/leanprover-community/mathlib/commit/7e5137f579de09a059a5ce98f364a04e221aabf0

16afdc39

Diff

@@ -88,7 +88,6 @@ theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
       (‖c‖₊ : ℝ≥0∞) * e x = ‖c‖₊ * e (c⁻¹ • c • x) := by rw [inv_smul_smul₀ hc]
       _ ≤ ‖c‖₊ * (‖c⁻¹‖₊ * e (c • x)) := _
       _ = e (c • x) := _
-      
     · exact mul_le_mul_left' (e.map_smul_le' _ _) _
     ·
       rw [← mul_assoc, nnnorm_inv, ENNReal.coe_inv, ENNReal.mul_inv_cancel _ ENNReal.coe_ne_top,
@@ -110,7 +109,6 @@ theorem map_neg (x : V) : e (-x) = e x :=
   calc
     e (-x) = ‖(-1 : 𝕜)‖₊ * e x := by rw [← map_smul, neg_one_smul]
     _ = e x := by simp
-    
 #align enorm.map_neg ENorm.map_neg
 
 theorem map_sub_rev (x y : V) : e (x - y) = e (y - x) := by rw [← neg_sub, e.map_neg]
@@ -125,7 +123,6 @@ theorem map_sub_le (x y : V) : e (x - y) ≤ e x + e y :=
     e (x - y) = e (x + -y) := by rw [sub_eq_add_neg]
     _ ≤ e x + e (-y) := (e.map_add_le x (-y))
     _ = e x + e y := by rw [e.map_neg]
-    
 #align enorm.map_sub_le ENorm.map_sub_le
 
 instance : PartialOrder (ENorm 𝕜 V)
@@ -201,7 +198,6 @@ def emetricSpace : EMetricSpace V where
     calc
       e (x - z) = e (x - y + (y - z)) := by rw [sub_add_sub_cancel]
       _ ≤ e (x - y) + e (y - z) := e.map_add_le (x - y) (y - z)
-      
 #align enorm.emetric_space ENorm.emetricSpace
 -/
 
@@ -215,7 +211,6 @@ def finiteSubspace : Subspace 𝕜 V where
     calc
       e (c • x) = ‖c‖₊ * e x := e.map_smul c x
       _ < ⊤ := ENNReal.mul_lt_top ENNReal.coe_ne_top hx.Ne
-      
 #align enorm.finite_subspace ENorm.finiteSubspace
 -/

57ac39bd

bump to nightly-2023-06-08-07

mathlib commit https://github.com/leanprover-community/mathlib/commit/31c24aa72e7b3e5ed97a8412470e904f82b81004

50cb46e3

Diff

@@ -42,39 +42,43 @@ attribute [local instance 1001] Classical.propDecidable
 
 open scoped ENNReal
 
+#print ENorm /-
 /-- Extended norm on a vector space. As in the case of normed spaces, we require only
 `‖c • x‖ ≤ ‖c‖ * ‖x‖` in the definition, then prove an equality in `map_smul`. -/
-structure Enorm (𝕜 : Type _) (V : Type _) [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] where
+structure ENorm (𝕜 : Type _) (V : Type _) [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] where
   toFun : V → ℝ≥0∞
   eq_zero' : ∀ x, to_fun x = 0 → x = 0
   map_add_le' : ∀ x y : V, to_fun (x + y) ≤ to_fun x + to_fun y
   map_smul_le' : ∀ (c : 𝕜) (x : V), to_fun (c • x) ≤ ‖c‖₊ * to_fun x
-#align enorm Enorm
+#align enorm ENorm
+-/
 
-namespace Enorm
+namespace ENorm
 
-variable {𝕜 : Type _} {V : Type _} [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] (e : Enorm 𝕜 V)
+variable {𝕜 : Type _} {V : Type _} [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] (e : ENorm 𝕜 V)
 
-instance : CoeFun (Enorm 𝕜 V) fun _ => V → ℝ≥0∞ :=
-  ⟨Enorm.toFun⟩
+instance : CoeFun (ENorm 𝕜 V) fun _ => V → ℝ≥0∞ :=
+  ⟨ENorm.toFun⟩
 
-theorem coeFn_injective : Function.Injective (coeFn : Enorm 𝕜 V → V → ℝ≥0∞) := fun e₁ e₂ h => by
+#print ENorm.coeFn_injective /-
+theorem coeFn_injective : Function.Injective (coeFn : ENorm 𝕜 V → V → ℝ≥0∞) := fun e₁ e₂ h => by
   cases e₁ <;> cases e₂ <;> congr <;> exact h
-#align enorm.coe_fn_injective Enorm.coeFn_injective
+#align enorm.coe_fn_injective ENorm.coeFn_injective
+-/
 
 @[ext]
-theorem ext {e₁ e₂ : Enorm 𝕜 V} (h : ∀ x, e₁ x = e₂ x) : e₁ = e₂ :=
+theorem ext {e₁ e₂ : ENorm 𝕜 V} (h : ∀ x, e₁ x = e₂ x) : e₁ = e₂ :=
   coeFn_injective <| funext h
-#align enorm.ext Enorm.ext
+#align enorm.ext ENorm.ext
 
-theorem ext_iff {e₁ e₂ : Enorm 𝕜 V} : e₁ = e₂ ↔ ∀ x, e₁ x = e₂ x :=
+theorem ext_iff {e₁ e₂ : ENorm 𝕜 V} : e₁ = e₂ ↔ ∀ x, e₁ x = e₂ x :=
   ⟨fun h x => h ▸ rfl, ext⟩
-#align enorm.ext_iff Enorm.ext_iff
+#align enorm.ext_iff ENorm.ext_iff
 
 @[simp, norm_cast]
-theorem coe_inj {e₁ e₂ : Enorm 𝕜 V} : (e₁ : V → ℝ≥0∞) = e₂ ↔ e₁ = e₂ :=
+theorem coe_inj {e₁ e₂ : ENorm 𝕜 V} : (e₁ : V → ℝ≥0∞) = e₂ ↔ e₁ = e₂ :=
   coeFn_injective.eq_iff
-#align enorm.coe_inj Enorm.coe_inj
+#align enorm.coe_inj ENorm.coe_inj
 
 @[simp]
 theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
@@ -90,16 +94,16 @@ theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
       rw [← mul_assoc, nnnorm_inv, ENNReal.coe_inv, ENNReal.mul_inv_cancel _ ENNReal.coe_ne_top,
           one_mul] <;>
         simp [hc]
-#align enorm.map_smul Enorm.map_smul
+#align enorm.map_smul ENorm.map_smul
 
 @[simp]
 theorem map_zero : e 0 = 0 := by rw [← zero_smul 𝕜 (0 : V), e.map_smul]; norm_num
-#align enorm.map_zero Enorm.map_zero
+#align enorm.map_zero ENorm.map_zero
 
 @[simp]
 theorem eq_zero_iff {x : V} : e x = 0 ↔ x = 0 :=
   ⟨e.eq_zero' x, fun h => h.symm ▸ e.map_zero⟩
-#align enorm.eq_zero_iff Enorm.eq_zero_iff
+#align enorm.eq_zero_iff ENorm.eq_zero_iff
 
 @[simp]
 theorem map_neg (x : V) : e (-x) = e x :=
@@ -107,14 +111,14 @@ theorem map_neg (x : V) : e (-x) = e x :=
     e (-x) = ‖(-1 : 𝕜)‖₊ * e x := by rw [← map_smul, neg_one_smul]
     _ = e x := by simp
     
-#align enorm.map_neg Enorm.map_neg
+#align enorm.map_neg ENorm.map_neg
 
 theorem map_sub_rev (x y : V) : e (x - y) = e (y - x) := by rw [← neg_sub, e.map_neg]
-#align enorm.map_sub_rev Enorm.map_sub_rev
+#align enorm.map_sub_rev ENorm.map_sub_rev
 
 theorem map_add_le (x y : V) : e (x + y) ≤ e x + e y :=
   e.map_add_le' x y
-#align enorm.map_add_le Enorm.map_add_le
+#align enorm.map_add_le ENorm.map_add_le
 
 theorem map_sub_le (x y : V) : e (x - y) ≤ e x + e y :=
   calc
@@ -122,9 +126,9 @@ theorem map_sub_le (x y : V) : e (x - y) ≤ e x + e y :=
     _ ≤ e x + e (-y) := (e.map_add_le x (-y))
     _ = e x + e y := by rw [e.map_neg]
     
-#align enorm.map_sub_le Enorm.map_sub_le
+#align enorm.map_sub_le ENorm.map_sub_le
 
-instance : PartialOrder (Enorm 𝕜 V)
+instance : PartialOrder (ENorm 𝕜 V)
     where
   le e₁ e₂ := ∀ x, e₁ x ≤ e₂ x
   le_refl e x := le_rfl
@@ -132,7 +136,7 @@ instance : PartialOrder (Enorm 𝕜 V)
   le_antisymm e₁ e₂ h₁₂ h₂₁ := ext fun x => le_antisymm (h₁₂ x) (h₂₁ x)
 
 /-- The `enorm` sending each non-zero vector to infinity. -/
-noncomputable instance : Top (Enorm 𝕜 V) :=
+noncomputable instance : Top (ENorm 𝕜 V) :=
   ⟨{  toFun := fun x => if x = 0 then 0 else ⊤
       eq_zero' := fun x => by split_ifs <;> simp [*]
       map_add_le' := fun x y =>
@@ -148,20 +152,20 @@ noncomputable instance : Top (Enorm 𝕜 V) :=
         · tauto
         · simp [hcx.1] }⟩
 
-noncomputable instance : Inhabited (Enorm 𝕜 V) :=
+noncomputable instance : Inhabited (ENorm 𝕜 V) :=
   ⟨⊤⟩
 
-theorem top_map {x : V} (hx : x ≠ 0) : (⊤ : Enorm 𝕜 V) x = ⊤ :=
+theorem top_map {x : V} (hx : x ≠ 0) : (⊤ : ENorm 𝕜 V) x = ⊤ :=
   if_neg hx
-#align enorm.top_map Enorm.top_map
+#align enorm.top_map ENorm.top_map
 
-noncomputable instance : OrderTop (Enorm 𝕜 V)
+noncomputable instance : OrderTop (ENorm 𝕜 V)
     where
   top := ⊤
   le_top e x := if h : x = 0 then by simp [h] else by simp [top_map h]
 
-noncomputable instance : SemilatticeSup (Enorm 𝕜 V) :=
-  { Enorm.partialOrder with
+noncomputable instance : SemilatticeSup (ENorm 𝕜 V) :=
+  { ENorm.partialOrder with
     le := (· ≤ ·)
     lt := (· < ·)
     sup := fun e₁ e₂ =>
@@ -176,15 +180,16 @@ noncomputable instance : SemilatticeSup (Enorm 𝕜 V) :=
     sup_le := fun e₁ e₂ e₃ h₁ h₂ x => max_le (h₁ x) (h₂ x) }
 
 @[simp, norm_cast]
-theorem coe_max (e₁ e₂ : Enorm 𝕜 V) : ⇑(e₁ ⊔ e₂) = fun x => max (e₁ x) (e₂ x) :=
+theorem coe_max (e₁ e₂ : ENorm 𝕜 V) : ⇑(e₁ ⊔ e₂) = fun x => max (e₁ x) (e₂ x) :=
   rfl
-#align enorm.coe_max Enorm.coe_max
+#align enorm.coe_max ENorm.coe_max
 
 @[norm_cast]
-theorem max_map (e₁ e₂ : Enorm 𝕜 V) (x : V) : (e₁ ⊔ e₂) x = max (e₁ x) (e₂ x) :=
+theorem max_map (e₁ e₂ : ENorm 𝕜 V) (x : V) : (e₁ ⊔ e₂) x = max (e₁ x) (e₂ x) :=
   rfl
-#align enorm.max_map Enorm.max_map
+#align enorm.max_map ENorm.max_map
 
+#print ENorm.emetricSpace /-
 /-- Structure of an `emetric_space` defined by an extended norm. -/
 @[reducible]
 def emetricSpace : EMetricSpace V where
@@ -197,8 +202,10 @@ def emetricSpace : EMetricSpace V where
       e (x - z) = e (x - y + (y - z)) := by rw [sub_add_sub_cancel]
       _ ≤ e (x - y) + e (y - z) := e.map_add_le (x - y) (y - z)
       
-#align enorm.emetric_space Enorm.emetricSpace
+#align enorm.emetric_space ENorm.emetricSpace
+-/
 
+#print ENorm.finiteSubspace /-
 /-- The subspace of vectors with finite enorm. -/
 def finiteSubspace : Subspace 𝕜 V where
   carrier := {x | e x < ⊤}
@@ -209,7 +216,8 @@ def finiteSubspace : Subspace 𝕜 V where
       e (c • x) = ‖c‖₊ * e x := e.map_smul c x
       _ < ⊤ := ENNReal.mul_lt_top ENNReal.coe_ne_top hx.Ne
       
-#align enorm.finite_subspace Enorm.finiteSubspace
+#align enorm.finite_subspace ENorm.finiteSubspace
+-/
 
 /-- Metric space structure on `e.finite_subspace`. We use `emetric_space.to_metric_space`
 to ensure that this definition agrees with `e.emetric_space`. -/
@@ -222,11 +230,11 @@ instance : MetricSpace e.finiteSubspace :=
 
 theorem finite_dist_eq (x y : e.finiteSubspace) : dist x y = (e (x - y)).toReal :=
   rfl
-#align enorm.finite_dist_eq Enorm.finite_dist_eq
+#align enorm.finite_dist_eq ENorm.finite_dist_eq
 
 theorem finite_edist_eq (x y : e.finiteSubspace) : edist x y = e (x - y) :=
   rfl
-#align enorm.finite_edist_eq Enorm.finite_edist_eq
+#align enorm.finite_edist_eq ENorm.finite_edist_eq
 
 /-- Normed group instance on `e.finite_subspace`. -/
 instance : NormedAddCommGroup e.finiteSubspace :=
@@ -237,11 +245,11 @@ instance : NormedAddCommGroup e.finiteSubspace :=
 
 theorem finite_norm_eq (x : e.finiteSubspace) : ‖x‖ = (e x).toReal :=
   rfl
-#align enorm.finite_norm_eq Enorm.finite_norm_eq
+#align enorm.finite_norm_eq ENorm.finite_norm_eq
 
 /-- Normed space instance on `e.finite_subspace`. -/
 instance : NormedSpace 𝕜 e.finiteSubspace
     where norm_smul_le c x := le_of_eq <| by simp [finite_norm_eq, ENNReal.toReal_mul]
 
-end Enorm
+end ENorm

57ac39bd

bump to nightly-2023-06-04-18

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

3fb4268b

Diff

@@ -200,9 +200,8 @@ def emetricSpace : EMetricSpace V where
 #align enorm.emetric_space Enorm.emetricSpace
 
 /-- The subspace of vectors with finite enorm. -/
-def finiteSubspace : Subspace 𝕜 V
-    where
-  carrier := { x | e x < ⊤ }
+def finiteSubspace : Subspace 𝕜 V where
+  carrier := {x | e x < ⊤}
   zero_mem' := by simp
   add_mem' x y hx hy := lt_of_le_of_lt (e.map_add_le x y) (ENNReal.add_lt_top.2 ⟨hx, hy⟩)
   smul_mem' c x (hx : _ < _) :=

57ac39bd

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -141,7 +141,7 @@ noncomputable instance : Top (Enorm 𝕜 V) :=
         simpa [hx, hy] using hxy
       map_smul_le' := fun c x =>
         by
-        split_ifs with hcx hx hx <;> simp only [smul_eq_zero, not_or] at hcx
+        split_ifs with hcx hx hx <;> simp only [smul_eq_zero, not_or] at hcx 
         · simp only [MulZeroClass.mul_zero, le_refl]
         · have : c = 0 := by tauto
           simp [this]

57ac39bd

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -40,7 +40,7 @@ noncomputable section
 
 attribute [local instance 1001] Classical.propDecidable
 
-open ENNReal
+open scoped ENNReal
 
 /-- Extended norm on a vector space. As in the case of normed spaces, we require only
 `‖c • x‖ ≤ ‖c‖ * ‖x‖` in the definition, then prove an equality in `map_smul`. -/

57ac39bd

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -93,9 +93,7 @@ theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
 #align enorm.map_smul Enorm.map_smul
 
 @[simp]
-theorem map_zero : e 0 = 0 := by
-  rw [← zero_smul 𝕜 (0 : V), e.map_smul]
-  norm_num
+theorem map_zero : e 0 = 0 := by rw [← zero_smul 𝕜 (0 : V), e.map_smul]; norm_num
 #align enorm.map_zero Enorm.map_zero
 
 @[simp]

57ac39bd

bump to nightly-2023-04-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/09079525fd01b3dda35e96adaa08d2f943e1648c

ff662d55

Diff

@@ -38,7 +38,7 @@ normed space, extended norm
 
 noncomputable section
 
-attribute [local instance] Classical.propDecidable
+attribute [local instance 1001] Classical.propDecidable
 
 open ENNReal

57ac39bd

bump to nightly-2023-03-11-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/3180fab693e2cee3bff62675571264cb8778b212

cd44fb92

Diff

@@ -144,7 +144,7 @@ noncomputable instance : Top (Enorm 𝕜 V) :=
       map_smul_le' := fun c x =>
         by
         split_ifs with hcx hx hx <;> simp only [smul_eq_zero, not_or] at hcx
-        · simp only [mul_zero, le_refl]
+        · simp only [MulZeroClass.mul_zero, le_refl]
         · have : c = 0 := by tauto
           simp [this]
         · tauto

57ac39bd

bump to nightly-2023-03-03-10

mathlib commit https://github.com/leanprover-community/mathlib/commit/195fcd60ff2bfe392543bceb0ec2adcdb472db4c

04b5c979

Diff

@@ -189,7 +189,7 @@ theorem max_map (e₁ e₂ : Enorm 𝕜 V) (x : V) : (e₁ ⊔ e₂) x = max (e
 
 /-- Structure of an `emetric_space` defined by an extended norm. -/
 @[reducible]
-def emetricSpace : EmetricSpace V where
+def emetricSpace : EMetricSpace V where
   edist x y := e (x - y)
   edist_self x := by simp
   eq_of_edist_eq_zero x y := by simp [sub_eq_zero]
@@ -219,7 +219,7 @@ to ensure that this definition agrees with `e.emetric_space`. -/
 instance : MetricSpace e.finiteSubspace :=
   by
   letI := e.emetric_space
-  refine' EmetricSpace.toMetricSpace fun x y => _
+  refine' EMetricSpace.toMetricSpace fun x y => _
   change e (x - y) ≠ ⊤
   exact ne_top_of_le_ne_top (ENNReal.add_lt_top.2 ⟨x.2, y.2⟩).Ne (e.map_sub_le x y)

57ac39bd

bump to nightly-2023-03-01-20

mathlib commit https://github.com/leanprover-community/mathlib/commit/4c586d291f189eecb9d00581aeb3dd998ac34442

20cadee0

Diff

@@ -121,7 +121,7 @@ theorem map_add_le (x y : V) : e (x + y) ≤ e x + e y :=
 theorem map_sub_le (x y : V) : e (x - y) ≤ e x + e y :=
   calc
     e (x - y) = e (x + -y) := by rw [sub_eq_add_neg]
-    _ ≤ e x + e (-y) := e.map_add_le x (-y)
+    _ ≤ e x + e (-y) := (e.map_add_le x (-y))
     _ = e x + e y := by rw [e.map_neg]
     
 #align enorm.map_sub_le Enorm.map_sub_le

57ac39bd

bump to nightly-2023-02-28-03

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

ead5cda8

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
 
 ! This file was ported from Lean 3 source module analysis.normed_space.enorm
-! leanprover-community/mathlib commit 17ef379e997badd73e5eabb4d38f11919ab3c4b3
+! leanprover-community/mathlib commit 57ac39bd365c2f80589a700f9fbb664d3a1a30c2
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -85,7 +85,7 @@ theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
       _ ≤ ‖c‖₊ * (‖c⁻¹‖₊ * e (c • x)) := _
       _ = e (c • x) := _
       
-    · exact ENNReal.mul_le_mul le_rfl (e.map_smul_le' _ _)
+    · exact mul_le_mul_left' (e.map_smul_le' _ _) _
     ·
       rw [← mul_assoc, nnnorm_inv, ENNReal.coe_inv, ENNReal.mul_inv_cancel _ ENNReal.coe_ne_top,
           one_mul] <;>

17ef379e

bump to nightly-2023-02-27-10

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

49ff026a

Diff

@@ -40,7 +40,7 @@ noncomputable section
 
 attribute [local instance] Classical.propDecidable
 
-open Ennreal
+open ENNReal
 
 /-- Extended norm on a vector space. As in the case of normed spaces, we require only
 `‖c • x‖ ≤ ‖c‖ * ‖x‖` in the definition, then prove an equality in `map_smul`. -/
@@ -85,9 +85,9 @@ theorem map_smul (c : 𝕜) (x : V) : e (c • x) = ‖c‖₊ * e x :=
       _ ≤ ‖c‖₊ * (‖c⁻¹‖₊ * e (c • x)) := _
       _ = e (c • x) := _
       
-    · exact Ennreal.mul_le_mul le_rfl (e.map_smul_le' _ _)
+    · exact ENNReal.mul_le_mul le_rfl (e.map_smul_le' _ _)
     ·
-      rw [← mul_assoc, nnnorm_inv, Ennreal.coe_inv, Ennreal.mul_inv_cancel _ Ennreal.coe_ne_top,
+      rw [← mul_assoc, nnnorm_inv, ENNReal.coe_inv, ENNReal.mul_inv_cancel _ ENNReal.coe_ne_top,
           one_mul] <;>
         simp [hc]
 #align enorm.map_smul Enorm.map_smul
@@ -168,11 +168,11 @@ noncomputable instance : SemilatticeSup (Enorm 𝕜 V) :=
     lt := (· < ·)
     sup := fun e₁ e₂ =>
       { toFun := fun x => max (e₁ x) (e₂ x)
-        eq_zero' := fun x h => e₁.eq_zero_iff.1 (Ennreal.max_eq_zero_iff.1 h).1
+        eq_zero' := fun x h => e₁.eq_zero_iff.1 (ENNReal.max_eq_zero_iff.1 h).1
         map_add_le' := fun x y =>
           max_le (le_trans (e₁.map_add_le _ _) <| add_le_add (le_max_left _ _) (le_max_left _ _))
             (le_trans (e₂.map_add_le _ _) <| add_le_add (le_max_right _ _) (le_max_right _ _))
-        map_smul_le' := fun c x => le_of_eq <| by simp only [map_smul, Ennreal.mul_max] }
+        map_smul_le' := fun c x => le_of_eq <| by simp only [map_smul, ENNReal.mul_max] }
     le_sup_left := fun e₁ e₂ x => le_max_left _ _
     le_sup_right := fun e₁ e₂ x => le_max_right _ _
     sup_le := fun e₁ e₂ e₃ h₁ h₂ x => max_le (h₁ x) (h₂ x) }
@@ -206,11 +206,11 @@ def finiteSubspace : Subspace 𝕜 V
     where
   carrier := { x | e x < ⊤ }
   zero_mem' := by simp
-  add_mem' x y hx hy := lt_of_le_of_lt (e.map_add_le x y) (Ennreal.add_lt_top.2 ⟨hx, hy⟩)
+  add_mem' x y hx hy := lt_of_le_of_lt (e.map_add_le x y) (ENNReal.add_lt_top.2 ⟨hx, hy⟩)
   smul_mem' c x (hx : _ < _) :=
     calc
       e (c • x) = ‖c‖₊ * e x := e.map_smul c x
-      _ < ⊤ := Ennreal.mul_lt_top Ennreal.coe_ne_top hx.Ne
+      _ < ⊤ := ENNReal.mul_lt_top ENNReal.coe_ne_top hx.Ne
       
 #align enorm.finite_subspace Enorm.finiteSubspace
 
@@ -221,7 +221,7 @@ instance : MetricSpace e.finiteSubspace :=
   letI := e.emetric_space
   refine' EmetricSpace.toMetricSpace fun x y => _
   change e (x - y) ≠ ⊤
-  exact ne_top_of_le_ne_top (Ennreal.add_lt_top.2 ⟨x.2, y.2⟩).Ne (e.map_sub_le x y)
+  exact ne_top_of_le_ne_top (ENNReal.add_lt_top.2 ⟨x.2, y.2⟩).Ne (e.map_sub_le x y)
 
 theorem finite_dist_eq (x y : e.finiteSubspace) : dist x y = (e (x - y)).toReal :=
   rfl
@@ -244,7 +244,7 @@ theorem finite_norm_eq (x : e.finiteSubspace) : ‖x‖ = (e x).toReal :=
 
 /-- Normed space instance on `e.finite_subspace`. -/
 instance : NormedSpace 𝕜 e.finiteSubspace
-    where norm_smul_le c x := le_of_eq <| by simp [finite_norm_eq, Ennreal.toReal_mul]
+    where norm_smul_le c x := le_of_eq <| by simp [finite_norm_eq, ENNReal.toReal_mul]
 
 end Enorm

17ef379e

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

57ac39bd

chore: superfluous parentheses part 2 (#12131)

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

d48d30ac

Diff

@@ -120,7 +120,7 @@ theorem map_add_le (x y : V) : e (x + y) ≤ e x + e y :=
 theorem map_sub_le (x y : V) : e (x - y) ≤ e x + e y :=
   calc
     e (x - y) = e (x + -y) := by rw [sub_eq_add_neg]
-    _ ≤ e x + e (-y) := (e.map_add_le x (-y))
+    _ ≤ e x + e (-y) := e.map_add_le x (-y)
     _ = e x + e y := by rw [e.map_neg]
 #align enorm.map_sub_le ENorm.map_sub_le

57ac39bd

perf: remove overspecified fields (#6965)

This removes redundant field values of the form add := add for smaller terms and less unfolding during unification.

A list of all files containing a structure instance of the form { a1, ... with x1 := val, ... } where some xi is a field of some aj was generated by modifying the structure instance elaboration algorithm to print such overlaps to stdout in a custom toolchain.

Using that toolchain, I went through each file on the list and attempted to remove algebraic fields that overlapped and were redundant, eg add := add and not toFun (though some other ones did creep in). If things broke (which was the case in a couple of cases), I did not push further and reverted.

It is possible that pushing harder and trying to remove all redundant overlaps will yield further improvements.

12150475

Diff

@@ -225,8 +225,7 @@ theorem finite_edist_eq (x y : e.finiteSubspace) : edist x y = e (x - y) :=
 
 /-- Normed group instance on `e.finiteSubspace`. -/
 instance normedAddCommGroup : NormedAddCommGroup e.finiteSubspace :=
-  { e.metricSpace,
-    Submodule.addCommGroup _ with
+  { e.metricSpace with
     norm := fun x => (e x).toReal
     dist_eq := fun _ _ => rfl }

57ac39bd

chore: drop MulZeroClass. in mul_zero/zero_mul (#6682)

Search&replace MulZeroClass.mul_zero -> mul_zero, MulZeroClass.zero_mul -> zero_mul.

These were introduced by Mathport, as the full name of mul_zero is actually MulZeroClass.mul_zero (it's exported with the short name).

277dea95

Diff

@@ -141,7 +141,7 @@ noncomputable instance : Top (ENorm 𝕜 V) :=
       map_smul_le' := fun c x => by
         simp only
         split_ifs with hcx hx hx <;> simp only [smul_eq_zero, not_or] at hcx
-        · simp only [MulZeroClass.mul_zero, le_refl]
+        · simp only [mul_zero, le_refl]
         · have : c = 0 := by tauto
           simp [this]
         · tauto

57ac39bd

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

@@ -41,7 +41,7 @@ open ENNReal
 
 /-- Extended norm on a vector space. As in the case of normed spaces, we require only
 `‖c • x‖ ≤ ‖c‖ * ‖x‖` in the definition, then prove an equality in `map_smul`. -/
-structure ENorm (𝕜 : Type _) (V : Type _) [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] where
+structure ENorm (𝕜 : Type*) (V : Type*) [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] where
   toFun : V → ℝ≥0∞
   eq_zero' : ∀ x, toFun x = 0 → x = 0
   map_add_le' : ∀ x y : V, toFun (x + y) ≤ toFun x + toFun y
@@ -50,7 +50,7 @@ structure ENorm (𝕜 : Type _) (V : Type _) [NormedField 𝕜] [AddCommGroup V]
 
 namespace ENorm
 
-variable {𝕜 : Type _} {V : Type _} [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] (e : ENorm 𝕜 V)
+variable {𝕜 : Type*} {V : Type*} [NormedField 𝕜] [AddCommGroup V] [Module 𝕜 V] (e : ENorm 𝕜 V)
 
 -- Porting note: added to appease norm_cast complaints
 attribute [coe] ENorm.toFun

57ac39bd

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,14 +2,11 @@
 Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
-
-! This file was ported from Lean 3 source module analysis.normed_space.enorm
-! leanprover-community/mathlib commit 57ac39bd365c2f80589a700f9fbb664d3a1a30c2
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Analysis.NormedSpace.Basic
 
+#align_import analysis.normed_space.enorm from "leanprover-community/mathlib"@"57ac39bd365c2f80589a700f9fbb664d3a1a30c2"
+
 /-!
 # Extended norm

57ac39bd

feat: port Analysis.NormedSpace.ENorm (#3469)

Co-authored-by: Matthew Ballard <matt@mrb.email> Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

7c00d96b

`analysis.normed_space.enorm` ⟷ `Mathlib.Analysis.NormedSpace.ENorm`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 609

analysis.normed_space.enorm ⟷ Mathlib.Analysis.NormedSpace.ENorm

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 609

`analysis.normed_space.enorm` ⟷ `Mathlib.Analysis.NormedSpace.ENorm`