analysis.normed_space.continuous_affine_map

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

17ef379e

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

fd4551cf

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -5,7 +5,7 @@ Authors: Oliver Nash
 -/
 import Topology.Algebra.ContinuousAffineMap
 import Analysis.NormedSpace.AffineIsometry
-import Analysis.NormedSpace.OperatorNorm
+import Analysis.NormedSpace.OperatorNorm.Basic
 
 #align_import analysis.normed_space.continuous_affine_map from "leanprover-community/mathlib"@"fd4551cfe4b7484b81c2c9ba3405edae27659676"

fd4551cf

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -248,15 +248,15 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
             (norm_add_le _ _).trans (add_le_add (le_max_right _ _) (le_max_right _ _))⟩
       eq_zero_of_map_eq_zero' := fun f h₀ =>
         by
-        rcases max_eq_iff.mp h₀ with (⟨h₁, h₂⟩ | ⟨h₁, h₂⟩) <;> rw [h₁] at h₂ 
-        · rw [norm_le_zero_iff, cont_linear_eq_zero_iff_exists_const] at h₂ 
+        rcases max_eq_iff.mp h₀ with (⟨h₁, h₂⟩ | ⟨h₁, h₂⟩) <;> rw [h₁] at h₂
+        · rw [norm_le_zero_iff, cont_linear_eq_zero_iff_exists_const] at h₂
           obtain ⟨q, rfl⟩ := h₂
-          simp only [Function.const_apply, coe_const, norm_eq_zero] at h₁ 
+          simp only [Function.const_apply, coe_const, norm_eq_zero] at h₁
           rw [h₁]
           rfl
-        · rw [norm_eq_zero', cont_linear_eq_zero_iff_exists_const] at h₁ 
+        · rw [norm_eq_zero', cont_linear_eq_zero_iff_exists_const] at h₁
           obtain ⟨q, rfl⟩ := h₁
-          simp only [Function.const_apply, coe_const, norm_le_zero_iff] at h₂ 
+          simp only [Function.const_apply, coe_const, norm_le_zero_iff] at h₂
           rw [h₂]
           rfl }

fd4551cf

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,9 +3,9 @@ Copyright (c) 2021 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
 -/
-import Mathbin.Topology.Algebra.ContinuousAffineMap
-import Mathbin.Analysis.NormedSpace.AffineIsometry
-import Mathbin.Analysis.NormedSpace.OperatorNorm
+import Topology.Algebra.ContinuousAffineMap
+import Analysis.NormedSpace.AffineIsometry
+import Analysis.NormedSpace.OperatorNorm
 
 #align_import analysis.normed_space.continuous_affine_map from "leanprover-community/mathlib"@"fd4551cfe4b7484b81c2c9ba3405edae27659676"

fd4551cf

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
-
-! This file was ported from Lean 3 source module analysis.normed_space.continuous_affine_map
-! leanprover-community/mathlib commit fd4551cfe4b7484b81c2c9ba3405edae27659676
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Topology.Algebra.ContinuousAffineMap
 import Mathbin.Analysis.NormedSpace.AffineIsometry
 import Mathbin.Analysis.NormedSpace.OperatorNorm
 
+#align_import analysis.normed_space.continuous_affine_map from "leanprover-community/mathlib"@"fd4551cfe4b7484b81c2c9ba3405edae27659676"
+
 /-!
 # Continuous affine maps between normed spaces.

fd4551cf

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -61,8 +61,6 @@ variable [NormedField R] [NormedSpace R V] [NormedSpace R W] [NormedSpace R W₂
 
 variable [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 V] [NormedSpace 𝕜 W] [NormedSpace 𝕜 W₂]
 
-include V W
-
 #print ContinuousAffineMap.contLinear /-
 /-- The linear map underlying a continuous affine map is continuous. -/
 def contLinear (f : P →A[R] Q) : V →L[R] W :=
@@ -72,52 +70,65 @@ def contLinear (f : P →A[R] Q) : V →L[R] W :=
 #align continuous_affine_map.cont_linear ContinuousAffineMap.contLinear
 -/
 
+#print ContinuousAffineMap.coe_contLinear /-
 @[simp]
 theorem coe_contLinear (f : P →A[R] Q) : (f.contLinear : V → W) = f.linear :=
   rfl
 #align continuous_affine_map.coe_cont_linear ContinuousAffineMap.coe_contLinear
+-/
 
+#print ContinuousAffineMap.coe_contLinear_eq_linear /-
 @[simp]
 theorem coe_contLinear_eq_linear (f : P →A[R] Q) :
     (f.contLinear : V →ₗ[R] W) = (f : P →ᵃ[R] Q).linear := by ext; rfl
 #align continuous_affine_map.coe_cont_linear_eq_linear ContinuousAffineMap.coe_contLinear_eq_linear
+-/
 
+#print ContinuousAffineMap.coe_mk_const_linear_eq_linear /-
 @[simp]
 theorem coe_mk_const_linear_eq_linear (f : P →ᵃ[R] Q) (h) :
     ((⟨f, h⟩ : P →A[R] Q).contLinear : V → W) = f.linear :=
   rfl
 #align continuous_affine_map.coe_mk_const_linear_eq_linear ContinuousAffineMap.coe_mk_const_linear_eq_linear
+-/
 
+#print ContinuousAffineMap.coe_linear_eq_coe_contLinear /-
 theorem coe_linear_eq_coe_contLinear (f : P →A[R] Q) :
     ((f : P →ᵃ[R] Q).linear : V → W) = (⇑f.contLinear : V → W) :=
   rfl
 #align continuous_affine_map.coe_linear_eq_coe_cont_linear ContinuousAffineMap.coe_linear_eq_coe_contLinear
+-/
 
-include W₂
-
+#print ContinuousAffineMap.comp_contLinear /-
 @[simp]
 theorem comp_contLinear (f : P →A[R] Q) (g : Q →A[R] Q₂) :
     (g.comp f).contLinear = g.contLinear.comp f.contLinear :=
   rfl
 #align continuous_affine_map.comp_cont_linear ContinuousAffineMap.comp_contLinear
+-/
 
-omit W₂
-
+#print ContinuousAffineMap.map_vadd /-
 @[simp]
 theorem map_vadd (f : P →A[R] Q) (p : P) (v : V) : f (v +ᵥ p) = f.contLinear v +ᵥ f p :=
   f.map_vadd' p v
 #align continuous_affine_map.map_vadd ContinuousAffineMap.map_vadd
+-/
 
+#print ContinuousAffineMap.contLinear_map_vsub /-
 @[simp]
 theorem contLinear_map_vsub (f : P →A[R] Q) (p₁ p₂ : P) : f.contLinear (p₁ -ᵥ p₂) = f p₁ -ᵥ f p₂ :=
   f.toAffineMap.linearMap_vsub p₁ p₂
 #align continuous_affine_map.cont_linear_map_vsub ContinuousAffineMap.contLinear_map_vsub
+-/
 
+#print ContinuousAffineMap.const_contLinear /-
 @[simp]
 theorem const_contLinear (q : Q) : (const R P q).contLinear = 0 :=
   rfl
 #align continuous_affine_map.const_cont_linear ContinuousAffineMap.const_contLinear
+-/
 
+#print ContinuousAffineMap.contLinear_eq_zero_iff_exists_const /-
 theorem contLinear_eq_zero_iff_exists_const (f : P →A[R] Q) :
     f.contLinear = 0 ↔ ∃ q, f = const R P q :=
   by
@@ -135,42 +146,57 @@ theorem contLinear_eq_zero_iff_exists_const (f : P →A[R] Q) :
   simp_rw [h₁, h₂]
   exact (f : P →ᵃ[R] Q).linear_eq_zero_iff_exists_const
 #align continuous_affine_map.cont_linear_eq_zero_iff_exists_const ContinuousAffineMap.contLinear_eq_zero_iff_exists_const
+-/
 
+#print ContinuousAffineMap.to_affine_map_contLinear /-
 @[simp]
 theorem to_affine_map_contLinear (f : V →L[R] W) : f.toContinuousAffineMap.contLinear = f := by ext;
   rfl
 #align continuous_affine_map.to_affine_map_cont_linear ContinuousAffineMap.to_affine_map_contLinear
+-/
 
+#print ContinuousAffineMap.zero_contLinear /-
 @[simp]
 theorem zero_contLinear : (0 : P →A[R] W).contLinear = 0 :=
   rfl
 #align continuous_affine_map.zero_cont_linear ContinuousAffineMap.zero_contLinear
+-/
 
+#print ContinuousAffineMap.add_contLinear /-
 @[simp]
 theorem add_contLinear (f g : P →A[R] W) : (f + g).contLinear = f.contLinear + g.contLinear :=
   rfl
 #align continuous_affine_map.add_cont_linear ContinuousAffineMap.add_contLinear
+-/
 
+#print ContinuousAffineMap.sub_contLinear /-
 @[simp]
 theorem sub_contLinear (f g : P →A[R] W) : (f - g).contLinear = f.contLinear - g.contLinear :=
   rfl
 #align continuous_affine_map.sub_cont_linear ContinuousAffineMap.sub_contLinear
+-/
 
+#print ContinuousAffineMap.neg_contLinear /-
 @[simp]
 theorem neg_contLinear (f : P →A[R] W) : (-f).contLinear = -f.contLinear :=
   rfl
 #align continuous_affine_map.neg_cont_linear ContinuousAffineMap.neg_contLinear
+-/
 
+#print ContinuousAffineMap.smul_contLinear /-
 @[simp]
 theorem smul_contLinear (t : R) (f : P →A[R] W) : (t • f).contLinear = t • f.contLinear :=
   rfl
 #align continuous_affine_map.smul_cont_linear ContinuousAffineMap.smul_contLinear
+-/
 
+#print ContinuousAffineMap.decomp /-
 theorem decomp (f : V →A[R] W) : (f : V → W) = f.contLinear + Function.const V (f 0) :=
   by
   rcases f with ⟨f, h⟩
   rw [coe_mk_const_linear_eq_linear, coe_mk, f.decomp, Pi.add_apply, LinearMap.map_zero, zero_add]
 #align continuous_affine_map.decomp ContinuousAffineMap.decomp
+-/
 
 section NormedSpaceStructure
 
@@ -184,18 +210,25 @@ noncomputable instance hasNorm : Norm (V →A[𝕜] W) :=
 #align continuous_affine_map.has_norm ContinuousAffineMap.hasNorm
 -/
 
+#print ContinuousAffineMap.norm_def /-
 theorem norm_def : ‖f‖ = max ‖f 0‖ ‖f.contLinear‖ :=
   rfl
 #align continuous_affine_map.norm_def ContinuousAffineMap.norm_def
+-/
 
+#print ContinuousAffineMap.norm_contLinear_le /-
 theorem norm_contLinear_le : ‖f.contLinear‖ ≤ ‖f‖ :=
   le_max_right _ _
 #align continuous_affine_map.norm_cont_linear_le ContinuousAffineMap.norm_contLinear_le
+-/
 
+#print ContinuousAffineMap.norm_image_zero_le /-
 theorem norm_image_zero_le : ‖f 0‖ ≤ ‖f‖ :=
   le_max_left _ _
 #align continuous_affine_map.norm_image_zero_le ContinuousAffineMap.norm_image_zero_le
+-/
 
+#print ContinuousAffineMap.norm_eq /-
 @[simp]
 theorem norm_eq (h : f 0 = 0) : ‖f‖ = ‖f.contLinear‖ :=
   calc
@@ -203,6 +236,7 @@ theorem norm_eq (h : f 0 = 0) : ‖f‖ = ‖f.contLinear‖ :=
     _ = max 0 ‖f.contLinear‖ := by rw [h, norm_zero]
     _ = ‖f.contLinear‖ := max_eq_right (norm_nonneg _)
 #align continuous_affine_map.norm_eq ContinuousAffineMap.norm_eq
+-/
 
 noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
   AddGroupNorm.toNormedAddCommGroup
@@ -234,6 +268,7 @@ instance : NormedSpace 𝕜 (V →A[𝕜] W)
     simp only [norm_def, smul_cont_linear, coe_smul, Pi.smul_apply, norm_smul, ←
       mul_max_of_nonneg _ _ (norm_nonneg t)]
 
+#print ContinuousAffineMap.norm_comp_le /-
 theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ :=
   by
   rw [norm_def, max_le_iff]
@@ -255,9 +290,11 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
         (mul_le_mul f.norm_cont_linear_le g.norm_cont_linear_le (norm_nonneg _) (norm_nonneg _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by rw [le_add_iff_nonneg_right]; apply norm_nonneg
 #align continuous_affine_map.norm_comp_le ContinuousAffineMap.norm_comp_le
+-/
 
 variable (𝕜 V W)
 
+#print ContinuousAffineMap.toConstProdContinuousLinearMap /-
 /-- The space of affine maps between two normed spaces is linearly isometric to the product of the
 codomain with the space of linear maps, by taking the value of the affine map at `(0 : V)` and the
 linear part. -/
@@ -271,18 +308,23 @@ def toConstProdContinuousLinearMap : (V →A[𝕜] W) ≃ₗᵢ[𝕜] W × (V 
   map_smul' _ _ := rfl
   norm_map' f := rfl
 #align continuous_affine_map.to_const_prod_continuous_linear_map ContinuousAffineMap.toConstProdContinuousLinearMap
+-/
 
+#print ContinuousAffineMap.toConstProdContinuousLinearMap_fst /-
 @[simp]
 theorem toConstProdContinuousLinearMap_fst (f : V →A[𝕜] W) :
     (toConstProdContinuousLinearMap 𝕜 V W f).fst = f 0 :=
   rfl
 #align continuous_affine_map.to_const_prod_continuous_linear_map_fst ContinuousAffineMap.toConstProdContinuousLinearMap_fst
+-/
 
+#print ContinuousAffineMap.toConstProdContinuousLinearMap_snd /-
 @[simp]
 theorem toConstProdContinuousLinearMap_snd (f : V →A[𝕜] W) :
     (toConstProdContinuousLinearMap 𝕜 V W f).snd = f.contLinear :=
   rfl
 #align continuous_affine_map.to_const_prod_continuous_linear_map_snd ContinuousAffineMap.toConstProdContinuousLinearMap_snd
+-/
 
 end NormedSpaceStructure

fd4551cf

bump to nightly-2023-06-11-03

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

6960a941

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
 
 ! This file was ported from Lean 3 source module analysis.normed_space.continuous_affine_map
-! leanprover-community/mathlib commit 17ef379e997badd73e5eabb4d38f11919ab3c4b3
+! leanprover-community/mathlib commit fd4551cfe4b7484b81c2c9ba3405edae27659676
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.Analysis.NormedSpace.OperatorNorm
 /-!
 # Continuous affine maps between normed spaces.
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file develops the theory of continuous affine maps between affine spaces modelled on normed
 spaces.

17ef379e

bump to nightly-2023-06-09-11

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

f5e7eb19

Diff

@@ -60,12 +60,14 @@ variable [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 V] [NormedSpace 𝕜 W
 
 include V W
 
+#print ContinuousAffineMap.contLinear /-
 /-- The linear map underlying a continuous affine map is continuous. -/
 def contLinear (f : P →A[R] Q) : V →L[R] W :=
   { f.linear with
     toFun := f.linear
     cont := by rw [AffineMap.continuous_linear_iff]; exact f.cont }
 #align continuous_affine_map.cont_linear ContinuousAffineMap.contLinear
+-/
 
 @[simp]
 theorem coe_contLinear (f : P →A[R] Q) : (f.contLinear : V → W) = f.linear :=
@@ -171,11 +173,13 @@ section NormedSpaceStructure
 
 variable (f : V →A[𝕜] W)
 
+#print ContinuousAffineMap.hasNorm /-
 /-- Note that unlike the operator norm for linear maps, this norm is _not_ submultiplicative:
 we do _not_ necessarily have `‖f.comp g‖ ≤ ‖f‖ * ‖g‖`. See `norm_comp_le` for what we can say. -/
 noncomputable instance hasNorm : Norm (V →A[𝕜] W) :=
   ⟨fun f => max ‖f 0‖ ‖f.contLinear‖⟩
 #align continuous_affine_map.has_norm ContinuousAffineMap.hasNorm
+-/
 
 theorem norm_def : ‖f‖ = max ‖f 0‖ ‖f.contLinear‖ :=
   rfl

17ef379e

bump to nightly-2023-06-09-07

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

16afdc39

Diff

@@ -195,7 +195,6 @@ theorem norm_eq (h : f 0 = 0) : ‖f‖ = ‖f.contLinear‖ :=
     ‖f‖ = max ‖f 0‖ ‖f.contLinear‖ := by rw [norm_def]
     _ = max 0 ‖f.contLinear‖ := by rw [h, norm_zero]
     _ = ‖f.contLinear‖ := max_eq_right (norm_nonneg _)
-    
 #align continuous_affine_map.norm_eq ContinuousAffineMap.norm_eq
 
 noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
@@ -241,7 +240,6 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ :=
         add_le_add_right
           (mul_le_mul f.norm_cont_linear_le g.norm_image_zero_le (norm_nonneg _) (norm_nonneg _)) _
-      
   ·
     calc
       ‖(f.comp g).contLinear‖ ≤ ‖f.cont_linear‖ * ‖g.cont_linear‖ :=
@@ -249,7 +247,6 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
       _ ≤ ‖f‖ * ‖g‖ :=
         (mul_le_mul f.norm_cont_linear_le g.norm_cont_linear_le (norm_nonneg _) (norm_nonneg _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by rw [le_add_iff_nonneg_right]; apply norm_nonneg
-      
 #align continuous_affine_map.norm_comp_le ContinuousAffineMap.norm_comp_le
 
 variable (𝕜 V W)

17ef379e

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -211,15 +211,15 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
             (norm_add_le _ _).trans (add_le_add (le_max_right _ _) (le_max_right _ _))⟩
       eq_zero_of_map_eq_zero' := fun f h₀ =>
         by
-        rcases max_eq_iff.mp h₀ with (⟨h₁, h₂⟩ | ⟨h₁, h₂⟩) <;> rw [h₁] at h₂
-        · rw [norm_le_zero_iff, cont_linear_eq_zero_iff_exists_const] at h₂
+        rcases max_eq_iff.mp h₀ with (⟨h₁, h₂⟩ | ⟨h₁, h₂⟩) <;> rw [h₁] at h₂ 
+        · rw [norm_le_zero_iff, cont_linear_eq_zero_iff_exists_const] at h₂ 
           obtain ⟨q, rfl⟩ := h₂
-          simp only [Function.const_apply, coe_const, norm_eq_zero] at h₁
+          simp only [Function.const_apply, coe_const, norm_eq_zero] at h₁ 
           rw [h₁]
           rfl
-        · rw [norm_eq_zero', cont_linear_eq_zero_iff_exists_const] at h₁
+        · rw [norm_eq_zero', cont_linear_eq_zero_iff_exists_const] at h₁ 
           obtain ⟨q, rfl⟩ := h₁
-          simp only [Function.const_apply, coe_const, norm_le_zero_iff] at h₂
+          simp only [Function.const_apply, coe_const, norm_le_zero_iff] at h₂ 
           rw [h₂]
           rfl }

17ef379e

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -64,9 +64,7 @@ include V W
 def contLinear (f : P →A[R] Q) : V →L[R] W :=
   { f.linear with
     toFun := f.linear
-    cont := by
-      rw [AffineMap.continuous_linear_iff]
-      exact f.cont }
+    cont := by rw [AffineMap.continuous_linear_iff]; exact f.cont }
 #align continuous_affine_map.cont_linear ContinuousAffineMap.contLinear
 
 @[simp]
@@ -76,10 +74,7 @@ theorem coe_contLinear (f : P →A[R] Q) : (f.contLinear : V → W) = f.linear :
 
 @[simp]
 theorem coe_contLinear_eq_linear (f : P →A[R] Q) :
-    (f.contLinear : V →ₗ[R] W) = (f : P →ᵃ[R] Q).linear :=
-  by
-  ext
-  rfl
+    (f.contLinear : V →ₗ[R] W) = (f : P →ᵃ[R] Q).linear := by ext; rfl
 #align continuous_affine_map.coe_cont_linear_eq_linear ContinuousAffineMap.coe_contLinear_eq_linear
 
 @[simp]
@@ -124,26 +119,20 @@ theorem contLinear_eq_zero_iff_exists_const (f : P →A[R] Q) :
   have h₁ : f.cont_linear = 0 ↔ (f : P →ᵃ[R] Q).linear = 0 :=
     by
     refine' ⟨fun h => _, fun h => _⟩ <;> ext
-    · rw [← coe_cont_linear_eq_linear, h]
-      rfl
-    · rw [← coe_linear_eq_coe_cont_linear, h]
-      rfl
+    · rw [← coe_cont_linear_eq_linear, h]; rfl
+    · rw [← coe_linear_eq_coe_cont_linear, h]; rfl
   have h₂ : ∀ q : Q, f = const R P q ↔ (f : P →ᵃ[R] Q) = AffineMap.const R P q :=
     by
     intro q
     refine' ⟨fun h => _, fun h => _⟩ <;> ext
-    · rw [h]
-      rfl
-    · rw [← coe_to_affine_map, h]
-      rfl
+    · rw [h]; rfl
+    · rw [← coe_to_affine_map, h]; rfl
   simp_rw [h₁, h₂]
   exact (f : P →ᵃ[R] Q).linear_eq_zero_iff_exists_const
 #align continuous_affine_map.cont_linear_eq_zero_iff_exists_const ContinuousAffineMap.contLinear_eq_zero_iff_exists_const
 
 @[simp]
-theorem to_affine_map_contLinear (f : V →L[R] W) : f.toContinuousAffineMap.contLinear = f :=
-  by
-  ext
+theorem to_affine_map_contLinear (f : V →L[R] W) : f.toContinuousAffineMap.contLinear = f := by ext;
   rfl
 #align continuous_affine_map.to_affine_map_cont_linear ContinuousAffineMap.to_affine_map_contLinear
 
@@ -246,9 +235,7 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
   ·
     calc
       ‖f.comp g 0‖ = ‖f (g 0)‖ := by simp
-      _ = ‖f.cont_linear (g 0) + f 0‖ := by
-        rw [f.decomp]
-        simp
+      _ = ‖f.cont_linear (g 0) + f 0‖ := by rw [f.decomp]; simp
       _ ≤ ‖f.cont_linear‖ * ‖g 0‖ + ‖f 0‖ :=
         ((norm_add_le _ _).trans (add_le_add_right (f.cont_linear.le_op_norm _) _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ :=
@@ -261,9 +248,7 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
         (g.comp_cont_linear f).symm ▸ f.cont_linear.op_norm_comp_le _
       _ ≤ ‖f‖ * ‖g‖ :=
         (mul_le_mul f.norm_cont_linear_le g.norm_cont_linear_le (norm_nonneg _) (norm_nonneg _))
-      _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by
-        rw [le_add_iff_nonneg_right]
-        apply norm_nonneg
+      _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by rw [le_add_iff_nonneg_right]; apply norm_nonneg
       
 #align continuous_affine_map.norm_comp_le ContinuousAffineMap.norm_comp_le
 
@@ -276,13 +261,8 @@ def toConstProdContinuousLinearMap : (V →A[𝕜] W) ≃ₗᵢ[𝕜] W × (V 
     where
   toFun f := ⟨f 0, f.contLinear⟩
   invFun p := p.2.toContinuousAffineMap + const 𝕜 V p.1
-  left_inv f := by
-    ext
-    rw [f.decomp]
-    simp
-  right_inv := by
-    rintro ⟨v, f⟩
-    ext <;> simp
+  left_inv f := by ext; rw [f.decomp]; simp
+  right_inv := by rintro ⟨v, f⟩; ext <;> simp
   map_add' _ _ := rfl
   map_smul' _ _ := rfl
   norm_map' f := rfl

17ef379e

bump to nightly-2023-03-09-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/21e3562c5e12d846c7def5eff8cdbc520d7d4936

a3ca2eeb

Diff

@@ -184,7 +184,7 @@ variable (f : V →A[𝕜] W)
 
 /-- Note that unlike the operator norm for linear maps, this norm is _not_ submultiplicative:
 we do _not_ necessarily have `‖f.comp g‖ ≤ ‖f‖ * ‖g‖`. See `norm_comp_le` for what we can say. -/
-noncomputable instance hasNorm : HasNorm (V →A[𝕜] W) :=
+noncomputable instance hasNorm : Norm (V →A[𝕜] W) :=
   ⟨fun f => max ‖f 0‖ ‖f.contLinear‖⟩
 #align continuous_affine_map.has_norm ContinuousAffineMap.hasNorm

17ef379e

bump to nightly-2023-03-01-20

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

20cadee0

Diff

@@ -250,7 +250,7 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
         rw [f.decomp]
         simp
       _ ≤ ‖f.cont_linear‖ * ‖g 0‖ + ‖f 0‖ :=
-        (norm_add_le _ _).trans (add_le_add_right (f.cont_linear.le_op_norm _) _)
+        ((norm_add_le _ _).trans (add_le_add_right (f.cont_linear.le_op_norm _) _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ :=
         add_le_add_right
           (mul_le_mul f.norm_cont_linear_le g.norm_image_zero_le (norm_nonneg _) (norm_nonneg _)) _
@@ -260,7 +260,7 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
       ‖(f.comp g).contLinear‖ ≤ ‖f.cont_linear‖ * ‖g.cont_linear‖ :=
         (g.comp_cont_linear f).symm ▸ f.cont_linear.op_norm_comp_le _
       _ ≤ ‖f‖ * ‖g‖ :=
-        mul_le_mul f.norm_cont_linear_le g.norm_cont_linear_le (norm_nonneg _) (norm_nonneg _)
+        (mul_le_mul f.norm_cont_linear_le g.norm_cont_linear_le (norm_nonneg _) (norm_nonneg _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by
         rw [le_add_iff_nonneg_right]
         apply norm_nonneg

17ef379e

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

17ef379e

chore: superfluous parentheses part 2 (#12131)

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

d48d30ac

Diff

@@ -208,7 +208,7 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
 
 instance : NormedSpace 𝕜 (V →A[𝕜] W) where
   norm_smul_le t f := by
-    simp only [SMul.smul, norm_def, (smul_contLinear), norm_smul]
+    simp only [SMul.smul, norm_def, smul_contLinear, norm_smul]
     -- Porting note: previously all these rewrites were in the `simp only`,
     -- but now they don't fire.
     -- (in fact, `norm_smul` fires, but only once rather than twice!)

17ef379e

chore: resolve some simp-related porting notes (#12074)

In all cases, the original proof works now. I presume this is due to simp changes in Lean 4.7, but haven't verified.

fef3b89b

Diff

@@ -189,10 +189,7 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
       neg' := fun f => by
         simp [(ContinuousAffineMap.neg_apply)]
       add_le' := fun f g => by
-        simp only [coe_add, max_le_iff]
-        -- Porting note: previously `Pi.add_apply, add_contLinear, ` in the previous `simp only`
-        -- suffices, but now they don't fire.
-        rw [add_contLinear]
+        simp only [coe_add, max_le_iff, Pi.add_apply, add_contLinear]
         exact
           ⟨(norm_add_le _ _).trans (add_le_add (le_max_left _ _) (le_max_left _ _)),
             (norm_add_le _ _).trans (add_le_add (le_max_right _ _) (le_max_right _ _))⟩
@@ -200,18 +197,12 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
         rcases max_eq_iff.mp h₀ with (⟨h₁, h₂⟩ | ⟨h₁, h₂⟩) <;> rw [h₁] at h₂
         · rw [norm_le_zero_iff, contLinear_eq_zero_iff_exists_const] at h₂
           obtain ⟨q, rfl⟩ := h₂
-          simp only [norm_eq_zero] at h₁
-          -- Porting note: prevously `coe_const, Function.const_apply` were in the previous
-          -- `simp only`, but now they don't fire.
-          rw [coe_const, Function.const_apply] at h₁
+          simp only [norm_eq_zero, coe_const, Function.const_apply] at h₁
           rw [h₁]
           rfl
         · rw [norm_eq_zero', contLinear_eq_zero_iff_exists_const] at h₁
           obtain ⟨q, rfl⟩ := h₁
-          simp only [norm_le_zero_iff] at h₂
-          -- Porting note: prevously `coe_const, Function.const_apply` were in the previous
-          -- `simp only`, but now they don't fire.
-          rw [coe_const, Function.const_apply] at h₂
+          simp only [norm_le_zero_iff, coe_const, Function.const_apply] at h₂
           rw [h₂]
           rfl }

17ef379e

perf(Topology.Algebra.Module): factor out smul (#11331)

We want to avoid making Lean unfold smul during unification. A separate instance does helps at the cost of some elaboration failures.

04a0187c

Diff

@@ -217,11 +217,14 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
 
 instance : NormedSpace 𝕜 (V →A[𝕜] W) where
   norm_smul_le t f := by
-    simp only [norm_def, (smul_contLinear), norm_smul]
+    simp only [SMul.smul, norm_def, (smul_contLinear), norm_smul]
     -- Porting note: previously all these rewrites were in the `simp only`,
     -- but now they don't fire.
     -- (in fact, `norm_smul` fires, but only once rather than twice!)
-    rw [coe_smul, Pi.smul_apply, norm_smul, ← mul_max_of_nonneg _ _ (norm_nonneg t)]
+    have : NormedAddCommGroup (V →A[𝕜] W) := inferInstance -- this is necessary for `norm_smul`
+    rw [coe_smul, Pi.smul_apply, norm_smul, norm_smul _ (f.contLinear),
+      ← mul_max_of_nonneg _ _ (norm_nonneg t)]
+
 
 theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by
   rw [norm_def, max_le_iff]

17ef379e

chore(*): remove empty lines between variable statements (#11418)

Empty lines were removed by executing the following Python script twice

import os
import re


# Loop through each file in the repository
for dir_path, dirs, files in os.walk('.'):
  for filename in files:
    if filename.endswith('.lean'):
      file_path = os.path.join(dir_path, filename)

      # Open the file and read its contents
      with open(file_path, 'r') as file:
        content = file.read()

      # Use a regular expression to replace sequences of "variable" lines separated by empty lines
      # with sequences without empty lines
      modified_content = re.sub(r'(variable.*\n)\n(variable(?! .* in))', r'\1\2', content)

      # Write the modified content back to the file
      with open(file_path, 'w') as file:
        file.write(modified_content)

75c86f04

Diff

@@ -44,15 +44,10 @@ submultiplicative: for a composition of maps, we have only `‖f.comp g‖ ≤ 
 namespace ContinuousAffineMap
 
 variable {𝕜 R V W W₂ P Q Q₂ : Type*}
-
 variable [NormedAddCommGroup V] [MetricSpace P] [NormedAddTorsor V P]
-
 variable [NormedAddCommGroup W] [MetricSpace Q] [NormedAddTorsor W Q]
-
 variable [NormedAddCommGroup W₂] [MetricSpace Q₂] [NormedAddTorsor W₂ Q₂]
-
 variable [NormedField R] [NormedSpace R V] [NormedSpace R W] [NormedSpace R W₂]
-
 variable [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 V] [NormedSpace 𝕜 W] [NormedSpace 𝕜 W₂]
 
 /-- The linear map underlying a continuous affine map is continuous. -/

17ef379e

chore(Analysis/NormedSpace): split up OperatorNorm.lean (#10990)

Split the 2300-line behemoth OperatorNorm.lean into 8 smaller files, of which the largest is 600 lines.

7aeba51a

Diff

@@ -3,10 +3,9 @@ Copyright (c) 2021 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
 -/
-import Mathlib.Topology.Algebra.ContinuousAffineMap
-import Mathlib.Analysis.Normed.Group.AddTorsor
 import Mathlib.Analysis.NormedSpace.AffineIsometry
-import Mathlib.Analysis.NormedSpace.OperatorNorm
+import Mathlib.Topology.Algebra.ContinuousAffineMap
+import Mathlib.Analysis.NormedSpace.OperatorNorm.NormedSpace
 
 #align_import analysis.normed_space.continuous_affine_map from "leanprover-community/mathlib"@"17ef379e997badd73e5eabb4d38f11919ab3c4b3"

17ef379e

chore: Remove unnecessary "rw"s (#10704)

Remove unnecessary "rw"s.

db5a9376

Diff

@@ -260,9 +260,7 @@ def toConstProdContinuousLinearMap : (V →A[𝕜] W) ≃ₗᵢ[𝕜] W × (V 
   left_inv f := by
     ext
     rw [f.decomp]
-    -- Porting note: previously `simp` closed the goal, but now we need to rewrite:
-    simp only [coe_add, ContinuousLinearMap.coe_toContinuousAffineMap, Pi.add_apply]
-    rw [ContinuousAffineMap.coe_const, Function.const_apply]
+    simp only [coe_add, ContinuousLinearMap.coe_toContinuousAffineMap, Pi.add_apply, coe_const]
   right_inv := by rintro ⟨v, f⟩; ext <;> simp
   map_add' _ _ := rfl
   map_smul' _ _ := rfl

17ef379e

chore: shake some imports (#10341)

c458927d

Diff

@@ -4,6 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
 -/
 import Mathlib.Topology.Algebra.ContinuousAffineMap
+import Mathlib.Analysis.Normed.Group.AddTorsor
 import Mathlib.Analysis.NormedSpace.AffineIsometry
 import Mathlib.Analysis.NormedSpace.OperatorNorm

17ef379e

chore: rename op_norm to opNorm (#10185)

Co-authored-by: adomani <adomani@gmail.com>

e3a011e5

Diff

@@ -235,13 +235,13 @@ theorem norm_comp_le (g : W₂ →A[𝕜] V) : ‖f.comp g‖ ≤ ‖f‖ * ‖g
       ‖f.comp g 0‖ = ‖f (g 0)‖ := by simp
       _ = ‖f.contLinear (g 0) + f 0‖ := by rw [f.decomp]; simp
       _ ≤ ‖f.contLinear‖ * ‖g 0‖ + ‖f 0‖ :=
-        ((norm_add_le _ _).trans (add_le_add_right (f.contLinear.le_op_norm _) _))
+        ((norm_add_le _ _).trans (add_le_add_right (f.contLinear.le_opNorm _) _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ :=
         add_le_add_right
           (mul_le_mul f.norm_contLinear_le g.norm_image_zero_le (norm_nonneg _) (norm_nonneg _)) _
   · calc
       ‖(f.comp g).contLinear‖ ≤ ‖f.contLinear‖ * ‖g.contLinear‖ :=
-        (g.comp_contLinear f).symm ▸ f.contLinear.op_norm_comp_le _
+        (g.comp_contLinear f).symm ▸ f.contLinear.opNorm_comp_le _
       _ ≤ ‖f‖ * ‖g‖ :=
         (mul_le_mul f.norm_contLinear_le g.norm_contLinear_le (norm_nonneg _) (norm_nonneg _))
       _ ≤ ‖f‖ * ‖g‖ + ‖f 0‖ := by rw [le_add_iff_nonneg_right]; apply norm_nonneg

17ef379e

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

@@ -43,7 +43,7 @@ submultiplicative: for a composition of maps, we have only `‖f.comp g‖ ≤ 
 
 namespace ContinuousAffineMap
 
-variable {𝕜 R V W W₂ P Q Q₂ : Type _}
+variable {𝕜 R V W W₂ P Q Q₂ : Type*}
 
 variable [NormedAddCommGroup V] [MetricSpace P] [NormedAddTorsor V P]
 
@@ -197,7 +197,7 @@ noncomputable instance : NormedAddCommGroup (V →A[𝕜] W) :=
         simp only [coe_add, max_le_iff]
         -- Porting note: previously `Pi.add_apply, add_contLinear, ` in the previous `simp only`
         -- suffices, but now they don't fire.
-        rw [ContinuousAffineMap.add_apply, add_contLinear]
+        rw [add_contLinear]
         exact
           ⟨(norm_add_le _ _).trans (add_le_add (le_max_left _ _) (le_max_left _ _)),
             (norm_add_le _ _).trans (add_le_add (le_max_right _ _) (le_max_right _ _))⟩

17ef379e

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
-
-! This file was ported from Lean 3 source module analysis.normed_space.continuous_affine_map
-! leanprover-community/mathlib commit 17ef379e997badd73e5eabb4d38f11919ab3c4b3
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Topology.Algebra.ContinuousAffineMap
 import Mathlib.Analysis.NormedSpace.AffineIsometry
 import Mathlib.Analysis.NormedSpace.OperatorNorm
 
+#align_import analysis.normed_space.continuous_affine_map from "leanprover-community/mathlib"@"17ef379e997badd73e5eabb4d38f11919ab3c4b3"
+
 /-!
 # Continuous affine maps between normed spaces.

17ef379e

feat: port Analysis.NormedSpace.ContinuousAffineMap (#4867)

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

697b3954

`analysis.normed_space.continuous_affine_map` ⟷ `Mathlib.Analysis.NormedSpace.ContinuousAffineMap`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 661

analysis.normed_space.continuous_affine_map ⟷ Mathlib.Analysis.NormedSpace.ContinuousAffineMap

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 661

`analysis.normed_space.continuous_affine_map` ⟷ `Mathlib.Analysis.NormedSpace.ContinuousAffineMap`