analysis.box_integral.partition.additive

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

70fd9563

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

61db041a

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
 import Analysis.BoxIntegral.Partition.Split
-import Analysis.NormedSpace.OperatorNorm
+import Analysis.NormedSpace.OperatorNorm.Basic
 
 #align_import analysis.box_integral.partition.additive from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"

61db041a

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -188,9 +188,9 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
   by
   rcases exists_split_many_inf_eq_filter_of_finite {π₁, π₂} ((finite_singleton _).insert _) with
     ⟨s, hs⟩
-  simp only [inf_split_many] at hs 
+  simp only [inf_split_many] at hs
   rcases hs _ (Or.inl rfl), hs _ (Or.inr rfl) with ⟨h₁, h₂⟩; clear hs
-  rw [h] at h₁ 
+  rw [h] at h₁
   calc
     ∑ J in π₁.boxes, f J = ∑ J in π₁.boxes, ∑ J' in (split_many J s).boxes, f J' :=
       Finset.sum_congr rfl fun J hJ => (f.sum_partition_boxes _ (is_partition_split_many _ _)).symm
@@ -239,7 +239,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
     I₀
     (by
       intro J hJ j
-      rw [WithTop.coe_le_coe] at hJ 
+      rw [WithTop.coe_le_coe] at hJ
       refine' i.succ_above_cases _ _ j
       · intro x hx
         simp only [box.split_lower_def hx, box.split_upper_def hx, update_same, ←
@@ -248,7 +248,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
       · clear j; intro j x hx
         have : (J.face i : WithTop (box (Fin n))) ≤ I₀.face i :=
           WithTop.coe_le_coe.2 (face_mono hJ i)
-        rw [le_iff_Icc, @box.Icc_eq_pi _ I₀] at hJ 
+        rw [le_iff_Icc, @box.Icc_eq_pi _ I₀] at hJ
         rw [hf _ (hJ J.upper_mem_Icc _ trivial), hf _ (hJ J.lower_mem_Icc _ trivial), ←
           (fb _).map_split_add this j x, ← (fb _).map_split_add this j x]
         have hx' : x ∈ Ioo ((J.face i).lower j) ((J.face i).upper j) := hx

61db041a

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.BoxIntegral.Partition.Split
-import Mathbin.Analysis.NormedSpace.OperatorNorm
+import Analysis.BoxIntegral.Partition.Split
+import Analysis.NormedSpace.OperatorNorm
 
 #align_import analysis.box_integral.partition.additive from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"

61db041a

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.box_integral.partition.additive
-! leanprover-community/mathlib commit 61db041ab8e4aaf8cb5c7dc10a7d4ff261997536
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Analysis.BoxIntegral.Partition.Split
 import Mathbin.Analysis.NormedSpace.OperatorNorm
 
+#align_import analysis.box_integral.partition.additive from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"
+
 /-!
 # Box additive functions

61db041a

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -59,10 +59,8 @@ structure BoxAdditiveMap (ι M : Type _) [AddCommMonoid M] (I : WithTop (Box ι)
 #align box_integral.box_additive_map BoxIntegral.BoxAdditiveMap
 -/
 
--- mathport name: box_integral.box_additive_map.top
 scoped notation:25 ι " →ᵇᵃ " M => BoxIntegral.BoxAdditiveMap ι M ⊤
 
--- mathport name: box_integral.box_additive_map
 scoped notation:25 ι " →ᵇᵃ[" I "] " M => BoxIntegral.BoxAdditiveMap ι M I
 
 namespace BoxAdditiveMap
@@ -82,24 +80,32 @@ theorem toFun_eq_coe (f : ι →ᵇᵃ[I₀] M) : f.toFun = f :=
   rfl
 #align box_integral.box_additive_map.to_fun_eq_coe BoxIntegral.BoxAdditiveMap.toFun_eq_coe
 
+#print BoxIntegral.BoxAdditiveMap.coe_mk /-
 @[simp]
 theorem coe_mk (f h) : ⇑(mk f h : ι →ᵇᵃ[I₀] M) = f :=
   rfl
 #align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mk
+-/
 
+#print BoxIntegral.BoxAdditiveMap.coe_injective /-
 theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x := by
   rintro ⟨f, hf⟩ ⟨g, hg⟩ (rfl : f = g); rfl
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
+-/
 
+#print BoxIntegral.BoxAdditiveMap.coe_inj /-
 @[simp]
 theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g :=
   coe_injective.eq_iff
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
+-/
 
+#print BoxIntegral.BoxAdditiveMap.sum_partition_boxes /-
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}
     (h : π.IsPartition) : ∑ J in π.boxes, f J = f I :=
   f.sum_partition_boxes' I hI π h
 #align box_integral.box_additive_map.sum_partition_boxes BoxIntegral.BoxAdditiveMap.sum_partition_boxes
+-/
 
 @[simps (config := { fullyApplied := false })]
 instance : Zero (ι →ᵇᵃ[I₀] M) :=
@@ -120,19 +126,24 @@ instance {R} [Monoid R] [DistribMulAction R M] : SMul R (ι →ᵇᵃ[I₀] M) :
 instance : AddCommMonoid (ι →ᵇᵃ[I₀] M) :=
   Function.Injective.addCommMonoid _ coe_injective rfl (fun _ _ => rfl) fun _ _ => rfl
 
+#print BoxIntegral.BoxAdditiveMap.map_split_add /-
 @[simp]
 theorem map_split_add (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) (i : ι) (x : ℝ) :
     (I.splitLower i x).elim 0 f + (I.splitUpper i x).elim 0 f = f I := by
   rw [← f.sum_partition_boxes hI (is_partition_split I i x), sum_split_boxes]
 #align box_integral.box_additive_map.map_split_add BoxIntegral.BoxAdditiveMap.map_split_add
+-/
 
+#print BoxIntegral.BoxAdditiveMap.restrict /-
 /-- If `f` is box-additive on subboxes of `I₀`, then it is box-additive on subboxes of any
 `I ≤ I₀`. -/
 @[simps]
 def restrict (f : ι →ᵇᵃ[I₀] M) (I : WithTop (Box ι)) (hI : I ≤ I₀) : ι →ᵇᵃ[I] M :=
   ⟨f, fun J hJ => f.2 J (hJ.trans hI)⟩
 #align box_integral.box_additive_map.restrict BoxIntegral.BoxAdditiveMap.restrict
+-/
 
+#print BoxIntegral.BoxAdditiveMap.ofMapSplitAdd /-
 /-- If `f : box ι → M` is box additive on partitions of the form `split I i x`, then it is box
 additive. -/
 def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
@@ -159,6 +170,7 @@ def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
   rw [← hf _ hI, ← inf_of_le_right hs, inf_split_many, bUnion_boxes, sum_bUnion_boxes]
   exact Finset.sum_congr rfl fun J hJ => (hf _ (Hle _ hJ) _).symm
 #align box_integral.box_additive_map.of_map_split_add BoxIntegral.BoxAdditiveMap.ofMapSplitAdd
+-/
 
 #print BoxIntegral.BoxAdditiveMap.map /-
 /-- If `g : M → N` is an additive map and `f` is a box additive map, then `g ∘ f` is a box additive
@@ -171,6 +183,7 @@ def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N
 #align box_integral.box_additive_map.map BoxIntegral.BoxAdditiveMap.map
 -/
 
+#print BoxIntegral.BoxAdditiveMap.sum_boxes_congr /-
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of
 `I` that cover the same part of `I`, then `∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J`. -/
 theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π₁ π₂ : Prepartition I}
@@ -192,6 +205,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
   exacts [(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,
     (WithTop.coe_le_coe.2 <| π₂.le_of_mem hJ).trans hI]
 #align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congr
+-/
 
 section ToSmul
 
@@ -205,10 +219,12 @@ def toSMul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
 #align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSMul
 -/
 
+#print BoxIntegral.BoxAdditiveMap.toSMul_apply /-
 @[simp]
 theorem toSMul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSMul I x = f I • x :=
   rfl
 #align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSMul_apply
+-/
 
 end ToSmul

61db041a

bump to nightly-2023-06-10-07

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

3fdc57bc

Diff

@@ -55,7 +55,7 @@ structure BoxAdditiveMap (ι M : Type _) [AddCommMonoid M] (I : WithTop (Box ι)
   toFun : Box ι → M
   sum_partition_boxes' :
     ∀ J : Box ι,
-      ↑J ≤ I → ∀ π : Prepartition J, π.IsPartition → (∑ Ji in π.boxes, to_fun Ji) = to_fun J
+      ↑J ≤ I → ∀ π : Prepartition J, π.IsPartition → ∑ Ji in π.boxes, to_fun Ji = to_fun J
 #align box_integral.box_additive_map BoxIntegral.BoxAdditiveMap
 -/
 
@@ -97,7 +97,7 @@ theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
 
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}
-    (h : π.IsPartition) : (∑ J in π.boxes, f J) = f I :=
+    (h : π.IsPartition) : ∑ J in π.boxes, f J = f I :=
   f.sum_partition_boxes' I hI π h
 #align box_integral.box_additive_map.sum_partition_boxes BoxIntegral.BoxAdditiveMap.sum_partition_boxes
 
@@ -144,7 +144,7 @@ def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
               (I.splitLower i x).elim 0 f + (I.splitUpper i x).elim 0 f = f I) :
     ι →ᵇᵃ[I₀] M := by
   refine' ⟨f, _⟩
-  replace hf : ∀ I : box ι, ↑I ≤ I₀ → ∀ s, (∑ J in (split_many I s).boxes, f J) = f I
+  replace hf : ∀ I : box ι, ↑I ≤ I₀ → ∀ s, ∑ J in (split_many I s).boxes, f J = f I
   · intro I hI s
     induction' s using Finset.induction_on with a s ha ihs; · simp
     rw [split_many_insert, inf_split, ← ihs, bUnion_boxes, sum_bUnion_boxes]
@@ -174,7 +174,7 @@ def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of
 `I` that cover the same part of `I`, then `∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J`. -/
 theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π₁ π₂ : Prepartition I}
-    (h : π₁.iUnion = π₂.iUnion) : (∑ J in π₁.boxes, f J) = ∑ J in π₂.boxes, f J :=
+    (h : π₁.iUnion = π₂.iUnion) : ∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J :=
   by
   rcases exists_split_many_inf_eq_filter_of_finite {π₁, π₂} ((finite_singleton _).insert _) with
     ⟨s, hs⟩
@@ -182,7 +182,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
   rcases hs _ (Or.inl rfl), hs _ (Or.inr rfl) with ⟨h₁, h₂⟩; clear hs
   rw [h] at h₁ 
   calc
-    (∑ J in π₁.boxes, f J) = ∑ J in π₁.boxes, ∑ J' in (split_many J s).boxes, f J' :=
+    ∑ J in π₁.boxes, f J = ∑ J in π₁.boxes, ∑ J' in (split_many J s).boxes, f J' :=
       Finset.sum_congr rfl fun J hJ => (f.sum_partition_boxes _ (is_partition_split_many _ _)).symm
     _ = ∑ J in (π₁.bUnion fun J => split_many J s).boxes, f J := (sum_bUnion_boxes _ _ _).symm
     _ = ∑ J in (π₂.bUnion fun J => split_many J s).boxes, f J := by rw [h₁, h₂]

61db041a

bump to nightly-2023-06-09-07

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

16afdc39

Diff

@@ -189,7 +189,6 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
     _ = ∑ J in π₂.boxes, ∑ J' in (split_many J s).boxes, f J' := (sum_bUnion_boxes _ _ _)
     _ = ∑ J in π₂.boxes, f J :=
       Finset.sum_congr rfl fun J hJ => f.sum_partition_boxes _ (is_partition_split_many _ _)
-    
   exacts [(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,
     (WithTop.coe_le_coe.2 <| π₂.le_of_mem hJ).trans hI]
 #align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congr

61db041a

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -178,9 +178,9 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
   by
   rcases exists_split_many_inf_eq_filter_of_finite {π₁, π₂} ((finite_singleton _).insert _) with
     ⟨s, hs⟩
-  simp only [inf_split_many] at hs
+  simp only [inf_split_many] at hs 
   rcases hs _ (Or.inl rfl), hs _ (Or.inr rfl) with ⟨h₁, h₂⟩; clear hs
-  rw [h] at h₁
+  rw [h] at h₁ 
   calc
     (∑ J in π₁.boxes, f J) = ∑ J in π₁.boxes, ∑ J' in (split_many J s).boxes, f J' :=
       Finset.sum_congr rfl fun J hJ => (f.sum_partition_boxes _ (is_partition_split_many _ _)).symm
@@ -190,7 +190,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
     _ = ∑ J in π₂.boxes, f J :=
       Finset.sum_congr rfl fun J hJ => f.sum_partition_boxes _ (is_partition_split_many _ _)
     
-  exacts[(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,
+  exacts [(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,
     (WithTop.coe_le_coe.2 <| π₂.le_of_mem hJ).trans hI]
 #align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congr
 
@@ -227,7 +227,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
     I₀
     (by
       intro J hJ j
-      rw [WithTop.coe_le_coe] at hJ
+      rw [WithTop.coe_le_coe] at hJ 
       refine' i.succ_above_cases _ _ j
       · intro x hx
         simp only [box.split_lower_def hx, box.split_upper_def hx, update_same, ←
@@ -236,7 +236,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
       · clear j; intro j x hx
         have : (J.face i : WithTop (box (Fin n))) ≤ I₀.face i :=
           WithTop.coe_le_coe.2 (face_mono hJ i)
-        rw [le_iff_Icc, @box.Icc_eq_pi _ I₀] at hJ
+        rw [le_iff_Icc, @box.Icc_eq_pi _ I₀] at hJ 
         rw [hf _ (hJ J.upper_mem_Icc _ trivial), hf _ (hJ J.lower_mem_Icc _ trivial), ←
           (fb _).map_split_add this j x, ← (fb _).map_split_add this j x]
         have hx' : x ∈ Ioo ((J.face i).lower j) ((J.face i).upper j) := hx

61db041a

bump to nightly-2023-06-01-04

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

4d9eaa85

Diff

@@ -77,12 +77,10 @@ instance : CoeFun (ι →ᵇᵃ[I₀] M) fun _ => Box ι → M :=
 
 initialize_simps_projections box_integral.box_additive_map (toFun → apply)
 
-/- warning: box_integral.box_additive_map.to_fun_eq_coe clashes with [anonymous] -> [anonymous]
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_fun_eq_coe [anonymous]ₓ'. -/
 @[simp]
-theorem [anonymous] (f : ι →ᵇᵃ[I₀] M) : f.toFun = f :=
+theorem toFun_eq_coe (f : ι →ᵇᵃ[I₀] M) : f.toFun = f :=
   rfl
-#align box_integral.box_additive_map.to_fun_eq_coe [anonymous]
+#align box_integral.box_additive_map.to_fun_eq_coe BoxIntegral.BoxAdditiveMap.toFun_eq_coe
 
 @[simp]
 theorem coe_mk (f h) : ⇑(mk f h : ι →ᵇᵃ[I₀] M) = f :=

61db041a

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -37,7 +37,7 @@ rectangular box, additive function
 
 noncomputable section
 
-open Classical BigOperators
+open scoped Classical BigOperators
 
 open Function Set

61db041a

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -78,55 +78,26 @@ instance : CoeFun (ι →ᵇᵃ[I₀] M) fun _ => Box ι → M :=
 initialize_simps_projections box_integral.box_additive_map (toFun → apply)
 
 /- warning: box_integral.box_additive_map.to_fun_eq_coe clashes with [anonymous] -> [anonymous]
-warning: box_integral.box_additive_map.to_fun_eq_coe -> [anonymous] is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), Eq.{max (succ u1) (succ u2)} ((BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.toFun.{u1, u2} ι M _inst_1 I₀ f) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f)
-but is expected to have type
-  forall {ι : Type.{u1}} {M : Type.{u2}}, (Nat -> ι -> M) -> Nat -> (List.{u1} ι) -> (List.{u2} M)
 Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_fun_eq_coe [anonymous]ₓ'. -/
 @[simp]
 theorem [anonymous] (f : ι →ᵇᵃ[I₀] M) : f.toFun = f :=
   rfl
 #align box_integral.box_additive_map.to_fun_eq_coe [anonymous]
 
-/- warning: box_integral.box_additive_map.coe_mk -> BoxIntegral.BoxAdditiveMap.coe_mk is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} (f : (BoxIntegral.Box.{u1} ι) -> M) (h : forall (J : BoxIntegral.Box.{u1} ι), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) J) I₀) -> (forall (π : BoxIntegral.Prepartition.{u1} ι J), (BoxIntegral.Prepartition.IsPartition.{u1} ι J π) -> (Eq.{succ u2} M (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι J π) (fun (Ji : BoxIntegral.Box.{u1} ι) => f Ji)) (f J)))), Eq.{max (succ u1) (succ u2)} ((BoxIntegral.Box.{u1} ι) -> M) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) (BoxIntegral.BoxAdditiveMap.mk.{u1, u2} ι M _inst_1 I₀ f h)) f
-but is expected to have type
-  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} (f : (BoxIntegral.Box.{u2} ι) -> M) (h : forall (J : BoxIntegral.Box.{u2} ι), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) J) I₀) -> (forall (π : BoxIntegral.Prepartition.{u2} ι J), (BoxIntegral.Prepartition.IsPartition.{u2} ι J π) -> (Eq.{succ u1} M (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι J π) (fun (Ji : BoxIntegral.Box.{u2} ι) => f Ji)) (f J)))), Eq.{max (succ u2) (succ u1)} ((BoxIntegral.Box.{u2} ι) -> M) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ (BoxIntegral.BoxAdditiveMap.mk.{u2, u1} ι M _inst_1 I₀ f h)) f
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mkₓ'. -/
 @[simp]
 theorem coe_mk (f h) : ⇑(mk f h : ι →ᵇᵃ[I₀] M) = f :=
   rfl
 #align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mk
 
-/- warning: box_integral.box_additive_map.coe_injective -> BoxIntegral.BoxAdditiveMap.coe_injective is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)}, Function.Injective.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) ((BoxIntegral.Box.{u1} ι) -> M) (fun (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (x : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f x)
-but is expected to have type
-  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)}, Function.Injective.{max (succ u2) (succ u1), max (succ u2) (succ u1)} (BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) ((BoxIntegral.Box.{u2} ι) -> M) (fun (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) (x : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f x)
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injectiveₓ'. -/
 theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x := by
   rintro ⟨f, hf⟩ ⟨g, hg⟩ (rfl : f = g); rfl
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
 
-/- warning: box_integral.box_additive_map.coe_inj -> BoxIntegral.BoxAdditiveMap.coe_inj is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀} {g : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀}, Iff (Eq.{max (succ u1) (succ u2)} ((fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) f) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) g)) (Eq.{max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) f g)
-but is expected to have type
-  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀} {g : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀}, Iff (Eq.{max (succ u2) (succ u1)} ((BoxIntegral.Box.{u2} ι) -> M) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ g)) (Eq.{max (succ u2) (succ u1)} (BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) f g)
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_injₓ'. -/
 @[simp]
 theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g :=
   coe_injective.eq_iff
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
 
-/- warning: box_integral.box_additive_map.sum_partition_boxes -> BoxIntegral.BoxAdditiveMap.sum_partition_boxes is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {I : BoxIntegral.Box.{u1} ι} (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall {π : BoxIntegral.Prepartition.{u1} ι I}, (BoxIntegral.Prepartition.IsPartition.{u1} ι I π) -> (Eq.{succ u2} M (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι I π) (fun (J : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f J)) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f I)))
-but is expected to have type
-  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {I : BoxIntegral.Box.{u2} ι} (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) I) I₀) -> (forall {π : BoxIntegral.Prepartition.{u2} ι I}, (BoxIntegral.Prepartition.IsPartition.{u2} ι I π) -> (Eq.{succ u1} M (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι I π) (fun (J : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f J)) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f I)))
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.sum_partition_boxes BoxIntegral.BoxAdditiveMap.sum_partition_boxesₓ'. -/
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}
     (h : π.IsPartition) : (∑ J in π.boxes, f J) = f I :=
   f.sum_partition_boxes' I hI π h
@@ -151,24 +122,12 @@ instance {R} [Monoid R] [DistribMulAction R M] : SMul R (ι →ᵇᵃ[I₀] M) :
 instance : AddCommMonoid (ι →ᵇᵃ[I₀] M) :=
   Function.Injective.addCommMonoid _ coe_injective rfl (fun _ _ => rfl) fun _ _ => rfl
 
-/- warning: box_integral.box_additive_map.map_split_add -> BoxIntegral.BoxAdditiveMap.map_split_add is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {I : BoxIntegral.Box.{u1} ι} (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall (i : ι) (x : Real), Eq.{succ u2} M (HAdd.hAdd.{u2, u2, u2} M M M (instHAdd.{u2} M (AddZeroClass.toHasAdd.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f) (BoxIntegral.Box.splitLower.{u1} ι I i x)) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f) (BoxIntegral.Box.splitUpper.{u1} ι I i x))) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f I))
-but is expected to have type
-  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {I : BoxIntegral.Box.{u2} ι} (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) I) I₀) -> (forall (i : ι) (x : Real), Eq.{succ u1} M (HAdd.hAdd.{u1, u1, u1} M M M (instHAdd.{u1} M (AddZeroClass.toAdd.{u1} M (AddMonoid.toAddZeroClass.{u1} M (AddCommMonoid.toAddMonoid.{u1} M _inst_1)))) (Option.elim'.{u2, u1} (BoxIntegral.Box.{u2} ι) M (OfNat.ofNat.{u1} M 0 (Zero.toOfNat0.{u1} M (AddMonoid.toZero.{u1} M (AddCommMonoid.toAddMonoid.{u1} M _inst_1)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f) (BoxIntegral.Box.splitLower.{u2} ι I i x)) (Option.elim'.{u2, u1} (BoxIntegral.Box.{u2} ι) M (OfNat.ofNat.{u1} M 0 (Zero.toOfNat0.{u1} M (AddMonoid.toZero.{u1} M (AddCommMonoid.toAddMonoid.{u1} M _inst_1)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f) (BoxIntegral.Box.splitUpper.{u2} ι I i x))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f I))
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.map_split_add BoxIntegral.BoxAdditiveMap.map_split_addₓ'. -/
 @[simp]
 theorem map_split_add (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) (i : ι) (x : ℝ) :
     (I.splitLower i x).elim 0 f + (I.splitUpper i x).elim 0 f = f I := by
   rw [← f.sum_partition_boxes hI (is_partition_split I i x), sum_split_boxes]
 #align box_integral.box_additive_map.map_split_add BoxIntegral.BoxAdditiveMap.map_split_add
 
-/- warning: box_integral.box_additive_map.restrict -> BoxIntegral.BoxAdditiveMap.restrict is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)}, (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) -> (forall (I : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) I I₀) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I))
-but is expected to have type
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)}, (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) -> (forall (I : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toLE.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.instPartialOrderBox.{u1} ι)))) I I₀) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I))
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.restrict BoxIntegral.BoxAdditiveMap.restrictₓ'. -/
 /-- If `f` is box-additive on subboxes of `I₀`, then it is box-additive on subboxes of any
 `I ≤ I₀`. -/
 @[simps]
@@ -176,12 +135,6 @@ def restrict (f : ι →ᵇᵃ[I₀] M) (I : WithTop (Box ι)) (hI : I ≤ I₀)
   ⟨f, fun J hJ => f.2 J (hJ.trans hI)⟩
 #align box_integral.box_additive_map.restrict BoxIntegral.BoxAdditiveMap.restrict
 
-/- warning: box_integral.box_additive_map.of_map_split_add -> BoxIntegral.BoxAdditiveMap.ofMapSplitAdd is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] [_inst_3 : Fintype.{u1} ι] (f : (BoxIntegral.Box.{u1} ι) -> M) (I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (forall (I : BoxIntegral.Box.{u1} ι), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall {i : ι} {x : Real}, (Membership.Mem.{0, 0} Real (Set.{0} Real) (Set.hasMem.{0} Real) x (Set.Ioo.{0} Real Real.preorder (BoxIntegral.Box.lower.{u1} ι I i) (BoxIntegral.Box.upper.{u1} ι I i))) -> (Eq.{succ u2} M (HAdd.hAdd.{u2, u2, u2} M M M (instHAdd.{u2} M (AddZeroClass.toHasAdd.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) f (BoxIntegral.Box.splitLower.{u1} ι I i x)) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) f (BoxIntegral.Box.splitUpper.{u1} ι I i x))) (f I)))) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀)
-but is expected to have type
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] [_inst_3 : Fintype.{u1} ι] (f : (BoxIntegral.Box.{u1} ι) -> M) (I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (forall (I : BoxIntegral.Box.{u1} ι), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toLE.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.instPartialOrderBox.{u1} ι)))) (WithTop.some.{u1} (BoxIntegral.Box.{u1} ι) I) I₀) -> (forall {i : ι} {x : Real}, (Membership.mem.{0, 0} Real (Set.{0} Real) (Set.instMembershipSet.{0} Real) x (Set.Ioo.{0} Real Real.instPreorderReal (BoxIntegral.Box.lower.{u1} ι I i) (BoxIntegral.Box.upper.{u1} ι I i))) -> (Eq.{succ u2} M (HAdd.hAdd.{u2, u2, u2} M M M (instHAdd.{u2} M (AddZeroClass.toAdd.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (Zero.toOfNat0.{u2} M (AddMonoid.toZero.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) f (BoxIntegral.Box.splitLower.{u1} ι I i x)) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (Zero.toOfNat0.{u2} M (AddMonoid.toZero.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) f (BoxIntegral.Box.splitUpper.{u1} ι I i x))) (f I)))) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀)
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.of_map_split_add BoxIntegral.BoxAdditiveMap.ofMapSplitAddₓ'. -/
 /-- If `f : box ι → M` is box additive on partitions of the form `split I i x`, then it is box
 additive. -/
 def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
@@ -220,12 +173,6 @@ def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N
 #align box_integral.box_additive_map.map BoxIntegral.BoxAdditiveMap.map
 -/
 
-/- warning: box_integral.box_additive_map.sum_boxes_congr -> BoxIntegral.BoxAdditiveMap.sum_boxes_congr is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {I : BoxIntegral.Box.{u1} ι} [_inst_3 : Finite.{succ u1} ι] (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall {π₁ : BoxIntegral.Prepartition.{u1} ι I} {π₂ : BoxIntegral.Prepartition.{u1} ι I}, (Eq.{succ u1} (Set.{u1} (ι -> Real)) (BoxIntegral.Prepartition.iUnion.{u1} ι I π₁) (BoxIntegral.Prepartition.iUnion.{u1} ι I π₂)) -> (Eq.{succ u2} M (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι I π₁) (fun (J : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f J)) (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι I π₂) (fun (J : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f J))))
-but is expected to have type
-  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {I : BoxIntegral.Box.{u2} ι} [_inst_3 : Finite.{succ u2} ι] (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) I) I₀) -> (forall {π₁ : BoxIntegral.Prepartition.{u2} ι I} {π₂ : BoxIntegral.Prepartition.{u2} ι I}, (Eq.{succ u2} (Set.{u2} (ι -> Real)) (BoxIntegral.Prepartition.iUnion.{u2} ι I π₁) (BoxIntegral.Prepartition.iUnion.{u2} ι I π₂)) -> (Eq.{succ u1} M (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι I π₁) (fun (J : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f J)) (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι I π₂) (fun (J : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f J))))
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congrₓ'. -/
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of
 `I` that cover the same part of `I`, then `∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J`. -/
 theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π₁ π₂ : Prepartition I}
@@ -261,9 +208,6 @@ def toSMul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
 #align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSMul
 -/
 
-/- warning: box_integral.box_additive_map.to_smul_apply -> BoxIntegral.BoxAdditiveMap.toSMul_apply is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSMul_applyₓ'. -/
 @[simp]
 theorem toSMul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSMul I x = f I • x :=
   rfl

61db041a

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -106,10 +106,8 @@ lean 3 declaration is
 but is expected to have type
   forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)}, Function.Injective.{max (succ u2) (succ u1), max (succ u2) (succ u1)} (BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) ((BoxIntegral.Box.{u2} ι) -> M) (fun (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) (x : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f x)
 Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injectiveₓ'. -/
-theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x :=
-  by
-  rintro ⟨f, hf⟩ ⟨g, hg⟩ (rfl : f = g)
-  rfl
+theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x := by
+  rintro ⟨f, hf⟩ ⟨g, hg⟩ (rfl : f = g); rfl
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
 
 /- warning: box_integral.box_additive_map.coe_inj -> BoxIntegral.BoxAdditiveMap.coe_inj is a dubious translation:
@@ -197,8 +195,7 @@ def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
   refine' ⟨f, _⟩
   replace hf : ∀ I : box ι, ↑I ≤ I₀ → ∀ s, (∑ J in (split_many I s).boxes, f J) = f I
   · intro I hI s
-    induction' s using Finset.induction_on with a s ha ihs
-    · simp
+    induction' s using Finset.induction_on with a s ha ihs; · simp
     rw [split_many_insert, inf_split, ← ihs, bUnion_boxes, sum_bUnion_boxes]
     refine' Finset.sum_congr rfl fun J' hJ' => _
     by_cases h : a.2 ∈ Ioo (J'.lower a.1) (J'.upper a.1)
@@ -294,8 +291,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
         simp only [box.split_lower_def hx, box.split_upper_def hx, update_same, ←
           WithBot.some_eq_coe, Option.elim', box.face, (· ∘ ·), update_noteq (Fin.succAbove_ne _ _)]
         abel
-      · clear j
-        intro j x hx
+      · clear j; intro j x hx
         have : (J.face i : WithTop (box (Fin n))) ≤ I₀.face i :=
           WithTop.coe_le_coe.2 (face_mono hJ i)
         rw [le_iff_Icc, @box.Icc_eq_pi _ I₀] at hJ

61db041a

bump to nightly-2023-05-28-03

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

6c6011cf

Diff

@@ -256,24 +256,21 @@ section ToSmul
 
 variable {E : Type _} [NormedAddCommGroup E] [NormedSpace ℝ E]
 
-#print BoxIntegral.BoxAdditiveMap.toSmul /-
+#print BoxIntegral.BoxAdditiveMap.toSMul /-
 /-- If `f` is a box-additive map, then so is the map sending `I` to the scalar multiplication
 by `f I` as a continuous linear map from `E` to itself. -/
-def toSmul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
+def toSMul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
   f.map (ContinuousLinearMap.lsmul ℝ ℝ).toLinearMap.toAddMonoidHom
-#align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSmul
+#align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSMul
 -/
 
-/- warning: box_integral.box_additive_map.to_smul_apply -> BoxIntegral.BoxAdditiveMap.toSmul_apply is a dubious translation:
-lean 3 declaration is
-  forall {ι : Type.{u1}} {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {E : Type.{u2}} [_inst_3 : NormedAddCommGroup.{u2} E] [_inst_4 : NormedSpace.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) (I : BoxIntegral.Box.{u1} ι) (x : E), Eq.{succ u2} E (coeFn.{succ u2, succ u2} (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (fun (_x : ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) => E -> E) (ContinuousLinearMap.toFun.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) => (BoxIntegral.Box.{u1} ι) -> (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4))) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) (BoxIntegral.BoxAdditiveMap.toSmul.{u1, u2} ι I₀ E _inst_3 _inst_4 f) I) x) (SMul.smul.{0, u2} Real E (SMulZeroClass.toHasSmul.{0, u2} Real E (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (SMulWithZero.toSmulZeroClass.{0, u2} Real E (MulZeroClass.toHasZero.{0} Real (MulZeroOneClass.toMulZeroClass.{0} Real (MonoidWithZero.toMulZeroOneClass.{0} Real (Semiring.toMonoidWithZero.{0} Real (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField)))))))) (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u2} Real E (Semiring.toMonoidWithZero.{0} Real (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField))))) (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (Module.toMulActionWithZero.{0, u2} Real E (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField)))) (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3))) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4))))) (coeFn.{succ u1, succ u1} (BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) => (BoxIntegral.Box.{u1} ι) -> Real) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, 0} ι Real Real.addCommMonoid I₀) f I) x)
-but is expected to have type
-  forall {ι : Type.{u2}} {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {E : Type.{u1}} [_inst_3 : NormedAddCommGroup.{u1} E] [_inst_4 : NormedSpace.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u2, 0} ι Real Real.instAddCommMonoidReal I₀) (I : BoxIntegral.Box.{u2} ι) (x : E), Eq.{succ u1} ((fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) x) (FunLike.coe.{succ u1, succ u1, succ u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E (fun (_x : E) => (fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) _x) (ContinuousMapClass.toFunLike.{u1, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (ContinuousSemilinearMapClass.toContinuousMapClass.{u1, 0, 0, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (ContinuousLinearMap.continuousSemilinearMapClass.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (TopologicalAddGroup.toContinuousAdd.{u1} E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (NormedAddGroup.toAddGroup.{u1} E (NormedAddCommGroup.toNormedAddGroup.{u1} E _inst_3)) (SeminormedAddCommGroup.toTopologicalAddGroup.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) I₀ (BoxIntegral.BoxAdditiveMap.toSmul.{u2, u1} ι I₀ E _inst_3 _inst_4 f) I) x) (HSMul.hSMul.{0, u1, u1} Real E E (instHSMul.{0, u1} Real E (SMulZeroClass.toSMul.{0, u1} Real E (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (SMulWithZero.toSMulZeroClass.{0, u1} Real E Real.instZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u1} Real E Real.instMonoidWithZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (Module.toMulActionWithZero.{0, u1} Real E Real.semiring (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, 0} ι Real Real.instAddCommMonoidReal I₀ f I) x)
-Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSmul_applyₓ'. -/
+/- warning: box_integral.box_additive_map.to_smul_apply -> BoxIntegral.BoxAdditiveMap.toSMul_apply is a dubious translation:
+<too large>
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSMul_applyₓ'. -/
 @[simp]
-theorem toSmul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSmul I x = f I • x :=
+theorem toSMul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSMul I x = f I • x :=
   rfl
-#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSmul_apply
+#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSMul_apply
 
 end ToSmul

61db041a

bump to nightly-2023-05-25-04

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

2175c3c2

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.box_integral.partition.additive
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
+! leanprover-community/mathlib commit 61db041ab8e4aaf8cb5c7dc10a7d4ff261997536
 ! 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.NormedSpace.OperatorNorm
 /-!
 # Box additive functions
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We say that a function `f : box ι → M` from boxes in `ℝⁿ` to a commutative additive monoid `M` is
 *box additive* on subboxes of `I₀ : with_top (box ι)` if for any box `J`, `↑J ≤ I₀`, and a partition
 `π` of `J`, `f J = ∑ J' in π.boxes, f J'`. We use `I₀ : with_top (box ι)` instead of `I₀ : box ι` to

70fd9563

bump to nightly-2023-05-24-12

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

2a3e3db2

Diff

@@ -265,7 +265,7 @@ def toSmul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
 lean 3 declaration is
   forall {ι : Type.{u1}} {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {E : Type.{u2}} [_inst_3 : NormedAddCommGroup.{u2} E] [_inst_4 : NormedSpace.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) (I : BoxIntegral.Box.{u1} ι) (x : E), Eq.{succ u2} E (coeFn.{succ u2, succ u2} (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (fun (_x : ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) => E -> E) (ContinuousLinearMap.toFun.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) => (BoxIntegral.Box.{u1} ι) -> (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4))) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) (BoxIntegral.BoxAdditiveMap.toSmul.{u1, u2} ι I₀ E _inst_3 _inst_4 f) I) x) (SMul.smul.{0, u2} Real E (SMulZeroClass.toHasSmul.{0, u2} Real E (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (SMulWithZero.toSmulZeroClass.{0, u2} Real E (MulZeroClass.toHasZero.{0} Real (MulZeroOneClass.toMulZeroClass.{0} Real (MonoidWithZero.toMulZeroOneClass.{0} Real (Semiring.toMonoidWithZero.{0} Real (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField)))))))) (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u2} Real E (Semiring.toMonoidWithZero.{0} Real (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField))))) (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (Module.toMulActionWithZero.{0, u2} Real E (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField)))) (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3))) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4))))) (coeFn.{succ u1, succ u1} (BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) => (BoxIntegral.Box.{u1} ι) -> Real) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, 0} ι Real Real.addCommMonoid I₀) f I) x)
 but is expected to have type
-  forall {ι : Type.{u2}} {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {E : Type.{u1}} [_inst_3 : NormedAddCommGroup.{u1} E] [_inst_4 : NormedSpace.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u2, 0} ι Real Real.instAddCommMonoidReal I₀) (I : BoxIntegral.Box.{u2} ι) (x : E), Eq.{succ u1} ((fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) x) (FunLike.coe.{succ u1, succ u1, succ u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E (fun (_x : E) => (fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) _x) (ContinuousMapClass.toFunLike.{u1, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (ContinuousSemilinearMapClass.toContinuousMapClass.{u1, 0, 0, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (ContinuousLinearMap.continuousSemilinearMapClass.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (TopologicalAddGroup.toContinuousAdd.{u1} E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (NormedAddGroup.toAddGroup.{u1} E (NormedAddCommGroup.toNormedAddGroup.{u1} E _inst_3)) (SeminormedAddCommGroup.to_topologicalAddGroup.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) I₀ (BoxIntegral.BoxAdditiveMap.toSmul.{u2, u1} ι I₀ E _inst_3 _inst_4 f) I) x) (HSMul.hSMul.{0, u1, u1} Real E E (instHSMul.{0, u1} Real E (SMulZeroClass.toSMul.{0, u1} Real E (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (SMulWithZero.toSMulZeroClass.{0, u1} Real E Real.instZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u1} Real E Real.instMonoidWithZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (Module.toMulActionWithZero.{0, u1} Real E Real.semiring (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, 0} ι Real Real.instAddCommMonoidReal I₀ f I) x)
+  forall {ι : Type.{u2}} {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {E : Type.{u1}} [_inst_3 : NormedAddCommGroup.{u1} E] [_inst_4 : NormedSpace.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u2, 0} ι Real Real.instAddCommMonoidReal I₀) (I : BoxIntegral.Box.{u2} ι) (x : E), Eq.{succ u1} ((fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) x) (FunLike.coe.{succ u1, succ u1, succ u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E (fun (_x : E) => (fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) _x) (ContinuousMapClass.toFunLike.{u1, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (ContinuousSemilinearMapClass.toContinuousMapClass.{u1, 0, 0, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (ContinuousLinearMap.continuousSemilinearMapClass.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (TopologicalAddGroup.toContinuousAdd.{u1} E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (NormedAddGroup.toAddGroup.{u1} E (NormedAddCommGroup.toNormedAddGroup.{u1} E _inst_3)) (SeminormedAddCommGroup.toTopologicalAddGroup.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) I₀ (BoxIntegral.BoxAdditiveMap.toSmul.{u2, u1} ι I₀ E _inst_3 _inst_4 f) I) x) (HSMul.hSMul.{0, u1, u1} Real E E (instHSMul.{0, u1} Real E (SMulZeroClass.toSMul.{0, u1} Real E (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (SMulWithZero.toSMulZeroClass.{0, u1} Real E Real.instZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u1} Real E Real.instMonoidWithZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (Module.toMulActionWithZero.{0, u1} Real E Real.semiring (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, 0} ι Real Real.instAddCommMonoidReal I₀ f I) x)
 Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSmul_applyₓ'. -/
 @[simp]
 theorem toSmul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSmul I x = f I • x :=

70fd9563

bump to nightly-2023-05-23-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/75e7fca56381d056096ce5d05e938f63a6567828

b380cf81

Diff

@@ -42,6 +42,7 @@ namespace BoxIntegral
 
 variable {ι M : Type _} {n : ℕ}
 
+#print BoxIntegral.BoxAdditiveMap /-
 /-- A function on `box ι` is called box additive if for every box `J` and a partition `π` of `J`
 we have `f J = ∑ Ji in π.boxes, f Ji`. A function is called box additive on subboxes of `I : box ι`
 if the same property holds for `J ≤ I`. We formalize these two notions in the same definition
@@ -53,6 +54,7 @@ structure BoxAdditiveMap (ι M : Type _) [AddCommMonoid M] (I : WithTop (Box ι)
     ∀ J : Box ι,
       ↑J ≤ I → ∀ π : Prepartition J, π.IsPartition → (∑ Ji in π.boxes, to_fun Ji) = to_fun J
 #align box_integral.box_additive_map BoxIntegral.BoxAdditiveMap
+-/
 
 -- mathport name: box_integral.box_additive_map.top
 scoped notation:25 ι " →ᵇᵃ " M => BoxIntegral.BoxAdditiveMap ι M ⊤
@@ -72,27 +74,58 @@ instance : CoeFun (ι →ᵇᵃ[I₀] M) fun _ => Box ι → M :=
 
 initialize_simps_projections box_integral.box_additive_map (toFun → apply)
 
+/- warning: box_integral.box_additive_map.to_fun_eq_coe clashes with [anonymous] -> [anonymous]
+warning: box_integral.box_additive_map.to_fun_eq_coe -> [anonymous] is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), Eq.{max (succ u1) (succ u2)} ((BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.toFun.{u1, u2} ι M _inst_1 I₀ f) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f)
+but is expected to have type
+  forall {ι : Type.{u1}} {M : Type.{u2}}, (Nat -> ι -> M) -> Nat -> (List.{u1} ι) -> (List.{u2} M)
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_fun_eq_coe [anonymous]ₓ'. -/
 @[simp]
-theorem toFun_eq_coe (f : ι →ᵇᵃ[I₀] M) : f.toFun = f :=
+theorem [anonymous] (f : ι →ᵇᵃ[I₀] M) : f.toFun = f :=
   rfl
-#align box_integral.box_additive_map.to_fun_eq_coe BoxIntegral.BoxAdditiveMap.toFun_eq_coe
-
+#align box_integral.box_additive_map.to_fun_eq_coe [anonymous]
+
+/- warning: box_integral.box_additive_map.coe_mk -> BoxIntegral.BoxAdditiveMap.coe_mk is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} (f : (BoxIntegral.Box.{u1} ι) -> M) (h : forall (J : BoxIntegral.Box.{u1} ι), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) J) I₀) -> (forall (π : BoxIntegral.Prepartition.{u1} ι J), (BoxIntegral.Prepartition.IsPartition.{u1} ι J π) -> (Eq.{succ u2} M (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι J π) (fun (Ji : BoxIntegral.Box.{u1} ι) => f Ji)) (f J)))), Eq.{max (succ u1) (succ u2)} ((BoxIntegral.Box.{u1} ι) -> M) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) (BoxIntegral.BoxAdditiveMap.mk.{u1, u2} ι M _inst_1 I₀ f h)) f
+but is expected to have type
+  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} (f : (BoxIntegral.Box.{u2} ι) -> M) (h : forall (J : BoxIntegral.Box.{u2} ι), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) J) I₀) -> (forall (π : BoxIntegral.Prepartition.{u2} ι J), (BoxIntegral.Prepartition.IsPartition.{u2} ι J π) -> (Eq.{succ u1} M (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι J π) (fun (Ji : BoxIntegral.Box.{u2} ι) => f Ji)) (f J)))), Eq.{max (succ u2) (succ u1)} ((BoxIntegral.Box.{u2} ι) -> M) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ (BoxIntegral.BoxAdditiveMap.mk.{u2, u1} ι M _inst_1 I₀ f h)) f
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mkₓ'. -/
 @[simp]
 theorem coe_mk (f h) : ⇑(mk f h : ι →ᵇᵃ[I₀] M) = f :=
   rfl
 #align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mk
 
+/- warning: box_integral.box_additive_map.coe_injective -> BoxIntegral.BoxAdditiveMap.coe_injective is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)}, Function.Injective.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) ((BoxIntegral.Box.{u1} ι) -> M) (fun (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (x : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f x)
+but is expected to have type
+  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)}, Function.Injective.{max (succ u2) (succ u1), max (succ u2) (succ u1)} (BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) ((BoxIntegral.Box.{u2} ι) -> M) (fun (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) (x : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f x)
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injectiveₓ'. -/
 theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x :=
   by
   rintro ⟨f, hf⟩ ⟨g, hg⟩ (rfl : f = g)
   rfl
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
 
+/- warning: box_integral.box_additive_map.coe_inj -> BoxIntegral.BoxAdditiveMap.coe_inj is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀} {g : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀}, Iff (Eq.{max (succ u1) (succ u2)} ((fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) f) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) g)) (Eq.{max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) f g)
+but is expected to have type
+  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀} {g : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀}, Iff (Eq.{max (succ u2) (succ u1)} ((BoxIntegral.Box.{u2} ι) -> M) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ g)) (Eq.{max (succ u2) (succ u1)} (BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀) f g)
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_injₓ'. -/
 @[simp]
 theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g :=
   coe_injective.eq_iff
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
 
+/- warning: box_integral.box_additive_map.sum_partition_boxes -> BoxIntegral.BoxAdditiveMap.sum_partition_boxes is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {I : BoxIntegral.Box.{u1} ι} (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall {π : BoxIntegral.Prepartition.{u1} ι I}, (BoxIntegral.Prepartition.IsPartition.{u1} ι I π) -> (Eq.{succ u2} M (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι I π) (fun (J : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f J)) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f I)))
+but is expected to have type
+  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {I : BoxIntegral.Box.{u2} ι} (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) I) I₀) -> (forall {π : BoxIntegral.Prepartition.{u2} ι I}, (BoxIntegral.Prepartition.IsPartition.{u2} ι I π) -> (Eq.{succ u1} M (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι I π) (fun (J : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f J)) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f I)))
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.sum_partition_boxes BoxIntegral.BoxAdditiveMap.sum_partition_boxesₓ'. -/
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}
     (h : π.IsPartition) : (∑ J in π.boxes, f J) = f I :=
   f.sum_partition_boxes' I hI π h
@@ -117,12 +150,24 @@ instance {R} [Monoid R] [DistribMulAction R M] : SMul R (ι →ᵇᵃ[I₀] M) :
 instance : AddCommMonoid (ι →ᵇᵃ[I₀] M) :=
   Function.Injective.addCommMonoid _ coe_injective rfl (fun _ _ => rfl) fun _ _ => rfl
 
+/- warning: box_integral.box_additive_map.map_split_add -> BoxIntegral.BoxAdditiveMap.map_split_add is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {I : BoxIntegral.Box.{u1} ι} (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall (i : ι) (x : Real), Eq.{succ u2} M (HAdd.hAdd.{u2, u2, u2} M M M (instHAdd.{u2} M (AddZeroClass.toHasAdd.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f) (BoxIntegral.Box.splitLower.{u1} ι I i x)) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f) (BoxIntegral.Box.splitUpper.{u1} ι I i x))) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f I))
+but is expected to have type
+  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {I : BoxIntegral.Box.{u2} ι} (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) I) I₀) -> (forall (i : ι) (x : Real), Eq.{succ u1} M (HAdd.hAdd.{u1, u1, u1} M M M (instHAdd.{u1} M (AddZeroClass.toAdd.{u1} M (AddMonoid.toAddZeroClass.{u1} M (AddCommMonoid.toAddMonoid.{u1} M _inst_1)))) (Option.elim'.{u2, u1} (BoxIntegral.Box.{u2} ι) M (OfNat.ofNat.{u1} M 0 (Zero.toOfNat0.{u1} M (AddMonoid.toZero.{u1} M (AddCommMonoid.toAddMonoid.{u1} M _inst_1)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f) (BoxIntegral.Box.splitLower.{u2} ι I i x)) (Option.elim'.{u2, u1} (BoxIntegral.Box.{u2} ι) M (OfNat.ofNat.{u1} M 0 (Zero.toOfNat0.{u1} M (AddMonoid.toZero.{u1} M (AddCommMonoid.toAddMonoid.{u1} M _inst_1)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f) (BoxIntegral.Box.splitUpper.{u2} ι I i x))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f I))
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.map_split_add BoxIntegral.BoxAdditiveMap.map_split_addₓ'. -/
 @[simp]
 theorem map_split_add (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) (i : ι) (x : ℝ) :
     (I.splitLower i x).elim 0 f + (I.splitUpper i x).elim 0 f = f I := by
   rw [← f.sum_partition_boxes hI (is_partition_split I i x), sum_split_boxes]
 #align box_integral.box_additive_map.map_split_add BoxIntegral.BoxAdditiveMap.map_split_add
 
+/- warning: box_integral.box_additive_map.restrict -> BoxIntegral.BoxAdditiveMap.restrict is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)}, (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) -> (forall (I : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) I I₀) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I))
+but is expected to have type
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)}, (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) -> (forall (I : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toLE.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.instPartialOrderBox.{u1} ι)))) I I₀) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I))
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.restrict BoxIntegral.BoxAdditiveMap.restrictₓ'. -/
 /-- If `f` is box-additive on subboxes of `I₀`, then it is box-additive on subboxes of any
 `I ≤ I₀`. -/
 @[simps]
@@ -130,6 +175,12 @@ def restrict (f : ι →ᵇᵃ[I₀] M) (I : WithTop (Box ι)) (hI : I ≤ I₀)
   ⟨f, fun J hJ => f.2 J (hJ.trans hI)⟩
 #align box_integral.box_additive_map.restrict BoxIntegral.BoxAdditiveMap.restrict
 
+/- warning: box_integral.box_additive_map.of_map_split_add -> BoxIntegral.BoxAdditiveMap.ofMapSplitAdd is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] [_inst_3 : Fintype.{u1} ι] (f : (BoxIntegral.Box.{u1} ι) -> M) (I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (forall (I : BoxIntegral.Box.{u1} ι), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall {i : ι} {x : Real}, (Membership.Mem.{0, 0} Real (Set.{0} Real) (Set.hasMem.{0} Real) x (Set.Ioo.{0} Real Real.preorder (BoxIntegral.Box.lower.{u1} ι I i) (BoxIntegral.Box.upper.{u1} ι I i))) -> (Eq.{succ u2} M (HAdd.hAdd.{u2, u2, u2} M M M (instHAdd.{u2} M (AddZeroClass.toHasAdd.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) f (BoxIntegral.Box.splitLower.{u1} ι I i x)) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (OfNat.mk.{u2} M 0 (Zero.zero.{u2} M (AddZeroClass.toHasZero.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))))) f (BoxIntegral.Box.splitUpper.{u1} ι I i x))) (f I)))) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀)
+but is expected to have type
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] [_inst_3 : Fintype.{u1} ι] (f : (BoxIntegral.Box.{u1} ι) -> M) (I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)), (forall (I : BoxIntegral.Box.{u1} ι), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toLE.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.instPartialOrderBox.{u1} ι)))) (WithTop.some.{u1} (BoxIntegral.Box.{u1} ι) I) I₀) -> (forall {i : ι} {x : Real}, (Membership.mem.{0, 0} Real (Set.{0} Real) (Set.instMembershipSet.{0} Real) x (Set.Ioo.{0} Real Real.instPreorderReal (BoxIntegral.Box.lower.{u1} ι I i) (BoxIntegral.Box.upper.{u1} ι I i))) -> (Eq.{succ u2} M (HAdd.hAdd.{u2, u2, u2} M M M (instHAdd.{u2} M (AddZeroClass.toAdd.{u2} M (AddMonoid.toAddZeroClass.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (Zero.toOfNat0.{u2} M (AddMonoid.toZero.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) f (BoxIntegral.Box.splitLower.{u1} ι I i x)) (Option.elim'.{u1, u2} (BoxIntegral.Box.{u1} ι) M (OfNat.ofNat.{u2} M 0 (Zero.toOfNat0.{u2} M (AddMonoid.toZero.{u2} M (AddCommMonoid.toAddMonoid.{u2} M _inst_1)))) f (BoxIntegral.Box.splitUpper.{u1} ι I i x))) (f I)))) -> (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀)
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.of_map_split_add BoxIntegral.BoxAdditiveMap.ofMapSplitAddₓ'. -/
 /-- If `f : box ι → M` is box additive on partitions of the form `split I i x`, then it is box
 additive. -/
 def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
@@ -158,6 +209,7 @@ def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
   exact Finset.sum_congr rfl fun J hJ => (hf _ (Hle _ hJ) _).symm
 #align box_integral.box_additive_map.of_map_split_add BoxIntegral.BoxAdditiveMap.ofMapSplitAdd
 
+#print BoxIntegral.BoxAdditiveMap.map /-
 /-- If `g : M → N` is an additive map and `f` is a box additive map, then `g ∘ f` is a box additive
 map. -/
 @[simps (config := { fullyApplied := false })]
@@ -166,7 +218,14 @@ def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N
   toFun := g ∘ f
   sum_partition_boxes' I hI π hπ := by rw [← g.map_sum, f.sum_partition_boxes hI hπ]
 #align box_integral.box_additive_map.map BoxIntegral.BoxAdditiveMap.map
+-/
 
+/- warning: box_integral.box_additive_map.sum_boxes_congr -> BoxIntegral.BoxAdditiveMap.sum_boxes_congr is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {M : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} M] {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {I : BoxIntegral.Box.{u1} ι} [_inst_3 : Finite.{succ u1} ι] (f : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀), (LE.le.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (Preorder.toHasLe.{u1} (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.preorder.{u1} (BoxIntegral.Box.{u1} ι) (PartialOrder.toPreorder.{u1} (BoxIntegral.Box.{u1} ι) (BoxIntegral.Box.partialOrder.{u1} ι)))) ((fun (a : Type.{u1}) (b : Type.{u1}) [self : HasLiftT.{succ u1, succ u1} a b] => self.0) (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (HasLiftT.mk.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (CoeTCₓ.coe.{succ u1, succ u1} (BoxIntegral.Box.{u1} ι) (WithTop.{u1} (BoxIntegral.Box.{u1} ι)) (WithTop.hasCoeT.{u1} (BoxIntegral.Box.{u1} ι)))) I) I₀) -> (forall {π₁ : BoxIntegral.Prepartition.{u1} ι I} {π₂ : BoxIntegral.Prepartition.{u1} ι I}, (Eq.{succ u1} (Set.{u1} (ι -> Real)) (BoxIntegral.Prepartition.iUnion.{u1} ι I π₁) (BoxIntegral.Prepartition.iUnion.{u1} ι I π₂)) -> (Eq.{succ u2} M (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι I π₁) (fun (J : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f J)) (Finset.sum.{u2, u1} M (BoxIntegral.Box.{u1} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u1} ι I π₂) (fun (J : BoxIntegral.Box.{u1} ι) => coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι M _inst_1 I₀) => (BoxIntegral.Box.{u1} ι) -> M) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι M _inst_1 I₀) f J))))
+but is expected to have type
+  forall {ι : Type.{u2}} {M : Type.{u1}} [_inst_1 : AddCommMonoid.{u1} M] {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {I : BoxIntegral.Box.{u2} ι} [_inst_3 : Finite.{succ u2} ι] (f : BoxIntegral.BoxAdditiveMap.{u2, u1} ι M _inst_1 I₀), (LE.le.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (Preorder.toLE.{u2} (WithTop.{u2} (BoxIntegral.Box.{u2} ι)) (WithTop.preorder.{u2} (BoxIntegral.Box.{u2} ι) (PartialOrder.toPreorder.{u2} (BoxIntegral.Box.{u2} ι) (BoxIntegral.Box.instPartialOrderBox.{u2} ι)))) (WithTop.some.{u2} (BoxIntegral.Box.{u2} ι) I) I₀) -> (forall {π₁ : BoxIntegral.Prepartition.{u2} ι I} {π₂ : BoxIntegral.Prepartition.{u2} ι I}, (Eq.{succ u2} (Set.{u2} (ι -> Real)) (BoxIntegral.Prepartition.iUnion.{u2} ι I π₁) (BoxIntegral.Prepartition.iUnion.{u2} ι I π₂)) -> (Eq.{succ u1} M (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι I π₁) (fun (J : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f J)) (Finset.sum.{u1, u2} M (BoxIntegral.Box.{u2} ι) _inst_1 (BoxIntegral.Prepartition.boxes.{u2} ι I π₂) (fun (J : BoxIntegral.Box.{u2} ι) => BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι M _inst_1 I₀ f J))))
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congrₓ'. -/
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of
 `I` that cover the same part of `I`, then `∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J`. -/
 theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π₁ π₂ : Prepartition I}
@@ -194,12 +253,20 @@ section ToSmul
 
 variable {E : Type _} [NormedAddCommGroup E] [NormedSpace ℝ E]
 
+#print BoxIntegral.BoxAdditiveMap.toSmul /-
 /-- If `f` is a box-additive map, then so is the map sending `I` to the scalar multiplication
 by `f I` as a continuous linear map from `E` to itself. -/
 def toSmul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
   f.map (ContinuousLinearMap.lsmul ℝ ℝ).toLinearMap.toAddMonoidHom
 #align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSmul
+-/
 
+/- warning: box_integral.box_additive_map.to_smul_apply -> BoxIntegral.BoxAdditiveMap.toSmul_apply is a dubious translation:
+lean 3 declaration is
+  forall {ι : Type.{u1}} {I₀ : WithTop.{u1} (BoxIntegral.Box.{u1} ι)} {E : Type.{u2}} [_inst_3 : NormedAddCommGroup.{u2} E] [_inst_4 : NormedSpace.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) (I : BoxIntegral.Box.{u1} ι) (x : E), Eq.{succ u2} E (coeFn.{succ u2, succ u2} (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (fun (_x : ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) => E -> E) (ContinuousLinearMap.toFun.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (coeFn.{max (succ u1) (succ u2), max (succ u1) (succ u2)} (BoxIntegral.BoxAdditiveMap.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) => (BoxIntegral.Box.{u1} ι) -> (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4))) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, u2} ι (ContinuousLinearMap.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u2, u2} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u2} E (PseudoMetricSpace.toUniformSpace.{u2} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u2} E (NormedAddCommGroup.toAddCommGroup.{u2} E _inst_3)) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4) (BoxIntegral.BoxAdditiveMap.toSmul._proof_1.{u2} E _inst_3)) I₀) (BoxIntegral.BoxAdditiveMap.toSmul.{u1, u2} ι I₀ E _inst_3 _inst_4 f) I) x) (SMul.smul.{0, u2} Real E (SMulZeroClass.toHasSmul.{0, u2} Real E (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (SMulWithZero.toSmulZeroClass.{0, u2} Real E (MulZeroClass.toHasZero.{0} Real (MulZeroOneClass.toMulZeroClass.{0} Real (MonoidWithZero.toMulZeroOneClass.{0} Real (Semiring.toMonoidWithZero.{0} Real (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField)))))))) (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u2} Real E (Semiring.toMonoidWithZero.{0} Real (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField))))) (AddZeroClass.toHasZero.{u2} E (AddMonoid.toAddZeroClass.{u2} E (AddCommMonoid.toAddMonoid.{u2} E (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3)))))) (Module.toMulActionWithZero.{0, u2} Real E (Ring.toSemiring.{0} Real (NormedRing.toRing.{0} Real (NormedCommRing.toNormedRing.{0} Real (NormedField.toNormedCommRing.{0} Real Real.normedField)))) (AddCommGroup.toAddCommMonoid.{u2} E (SeminormedAddCommGroup.toAddCommGroup.{u2} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3))) (NormedSpace.toModule.{0, u2} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u2} E _inst_3) _inst_4))))) (coeFn.{succ u1, succ u1} (BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) (fun (_x : BoxIntegral.BoxAdditiveMap.{u1, 0} ι Real Real.addCommMonoid I₀) => (BoxIntegral.Box.{u1} ι) -> Real) (BoxIntegral.BoxAdditiveMap.hasCoeToFun.{u1, 0} ι Real Real.addCommMonoid I₀) f I) x)
+but is expected to have type
+  forall {ι : Type.{u2}} {I₀ : WithTop.{u2} (BoxIntegral.Box.{u2} ι)} {E : Type.{u1}} [_inst_3 : NormedAddCommGroup.{u1} E] [_inst_4 : NormedSpace.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)] (f : BoxIntegral.BoxAdditiveMap.{u2, 0} ι Real Real.instAddCommMonoidReal I₀) (I : BoxIntegral.Box.{u2} ι) (x : E), Eq.{succ u1} ((fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) x) (FunLike.coe.{succ u1, succ u1, succ u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E (fun (_x : E) => (fun (x._@.Mathlib.Topology.ContinuousFunction.Basic._hyg.699 : E) => E) _x) (ContinuousMapClass.toFunLike.{u1, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) E E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (ContinuousSemilinearMapClass.toContinuousMapClass.{u1, 0, 0, u1, u1} (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (ContinuousLinearMap.continuousSemilinearMapClass.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, u1} ι (ContinuousLinearMap.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)) (ContinuousLinearMap.addCommMonoid.{0, 0, u1, u1} Real Real Real.semiring Real.semiring (RingHom.id.{0} Real (Semiring.toNonAssocSemiring.{0} Real Real.semiring)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4) (TopologicalAddGroup.toContinuousAdd.{u1} E (UniformSpace.toTopologicalSpace.{u1} E (PseudoMetricSpace.toUniformSpace.{u1} E (SeminormedAddCommGroup.toPseudoMetricSpace.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) (NormedAddGroup.toAddGroup.{u1} E (NormedAddCommGroup.toNormedAddGroup.{u1} E _inst_3)) (SeminormedAddCommGroup.to_topologicalAddGroup.{u1} E (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3)))) I₀ (BoxIntegral.BoxAdditiveMap.toSmul.{u2, u1} ι I₀ E _inst_3 _inst_4 f) I) x) (HSMul.hSMul.{0, u1, u1} Real E E (instHSMul.{0, u1} Real E (SMulZeroClass.toSMul.{0, u1} Real E (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (SMulWithZero.toSMulZeroClass.{0, u1} Real E Real.instZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (MulActionWithZero.toSMulWithZero.{0, u1} Real E Real.instMonoidWithZeroReal (NegZeroClass.toZero.{u1} E (SubNegZeroMonoid.toNegZeroClass.{u1} E (SubtractionMonoid.toSubNegZeroMonoid.{u1} E (SubtractionCommMonoid.toSubtractionMonoid.{u1} E (AddCommGroup.toDivisionAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)))))) (Module.toMulActionWithZero.{0, u1} Real E Real.semiring (AddCommGroup.toAddCommMonoid.{u1} E (NormedAddCommGroup.toAddCommGroup.{u1} E _inst_3)) (NormedSpace.toModule.{0, u1} Real E Real.normedField (NormedAddCommGroup.toSeminormedAddCommGroup.{u1} E _inst_3) _inst_4)))))) (BoxIntegral.BoxAdditiveMap.toFun.{u2, 0} ι Real Real.instAddCommMonoidReal I₀ f I) x)
+Case conversion may be inaccurate. Consider using '#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSmul_applyₓ'. -/
 @[simp]
 theorem toSmul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSmul I x = f I • x :=
   rfl
@@ -207,6 +274,7 @@ theorem toSmul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSmu
 
 end ToSmul
 
+#print BoxIntegral.BoxAdditiveMap.upperSubLower /-
 /-- Given a box `I₀` in `ℝⁿ⁺¹`, `f x : box (fin n) → G` is a family of functions indexed by a real
 `x` and for `x ∈ [I₀.lower i, I₀.upper i]`, `f x` is box-additive on subboxes of the `i`-th face of
 `I₀`, then `λ J, f (J.upper i) (J.face i) - f (J.lower i) (J.face i)` is box-additive on subboxes of
@@ -240,6 +308,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
           update_comp_eq_of_injective _ i.succ_above.injective j x, ← hf]
         simp only [box.face])
 #align box_integral.box_additive_map.upper_sub_lower BoxIntegral.BoxAdditiveMap.upperSubLower
+-/
 
 end BoxAdditiveMap

70fd9563

bump to nightly-2023-05-14-08

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

d31da313

Diff

@@ -170,7 +170,7 @@ def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of
 `I` that cover the same part of `I`, then `∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J`. -/
 theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π₁ π₂ : Prepartition I}
-    (h : π₁.unionᵢ = π₂.unionᵢ) : (∑ J in π₁.boxes, f J) = ∑ J in π₂.boxes, f J :=
+    (h : π₁.iUnion = π₂.iUnion) : (∑ J in π₁.boxes, f J) = ∑ J in π₂.boxes, f J :=
   by
   rcases exists_split_many_inf_eq_filter_of_finite {π₁, π₂} ((finite_singleton _).insert _) with
     ⟨s, hs⟩

70fd9563

bump to nightly-2023-03-01-20

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

20cadee0

Diff

@@ -182,7 +182,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
       Finset.sum_congr rfl fun J hJ => (f.sum_partition_boxes _ (is_partition_split_many _ _)).symm
     _ = ∑ J in (π₁.bUnion fun J => split_many J s).boxes, f J := (sum_bUnion_boxes _ _ _).symm
     _ = ∑ J in (π₂.bUnion fun J => split_many J s).boxes, f J := by rw [h₁, h₂]
-    _ = ∑ J in π₂.boxes, ∑ J' in (split_many J s).boxes, f J' := sum_bUnion_boxes _ _ _
+    _ = ∑ J in π₂.boxes, ∑ J' in (split_many J s).boxes, f J' := (sum_bUnion_boxes _ _ _)
     _ = ∑ J in π₂.boxes, f J :=
       Finset.sum_congr rfl fun J hJ => f.sum_partition_boxes _ (is_partition_split_many _ _)

70fd9563

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

70fd9563

chore: superfluous parentheses part 2 (#12131)

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

d48d30ac

Diff

@@ -167,7 +167,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
       Finset.sum_congr rfl fun J hJ => (f.sum_partition_boxes ?_ (isPartition_splitMany _ _)).symm
     _ = ∑ J in (π₁.biUnion fun J => splitMany J s).boxes, f J := (sum_biUnion_boxes _ _ _).symm
     _ = ∑ J in (π₂.biUnion fun J => splitMany J s).boxes, f J := by rw [h₁, h₂]
-    _ = ∑ J in π₂.boxes, ∑ J' in (splitMany J s).boxes, f J' := (sum_biUnion_boxes _ _ _)
+    _ = ∑ J in π₂.boxes, ∑ J' in (splitMany J s).boxes, f J' := sum_biUnion_boxes _ _ _
     _ = ∑ J in π₂.boxes, f J :=
       Finset.sum_congr rfl fun J hJ => f.sum_partition_boxes ?_ (isPartition_splitMany _ _)
   exacts [(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,

70fd9563

chore: scope open Classical (#11199)

We remove all but one open Classicals, instead preferring to use open scoped Classical. The only real side-effect this led to is moving a couple declarations to use Exists.choose instead of Classical.choose.

The first few commits are explicitly labelled regex replaces for ease of review.

c747be0a

Diff

@@ -31,7 +31,8 @@ rectangular box, additive function
 
 noncomputable section
 
-open Classical BigOperators Function Set
+open scoped Classical
+open BigOperators Function Set
 
 namespace BoxIntegral

70fd9563

doc: fix typos in tags header (#11088)

Fix 1 typo, 5 lowercase, 4 header depths

ab90a4e3

Diff

@@ -23,7 +23,7 @@ integrable function over a box.
 In this file we define box-additive functions and prove that a function such that
 `f J = f (J ∩ {x | x i < y}) + f (J ∩ {x | y ≤ x i})` is box-additive.
 
-### Tags
+## Tags
 
 rectangular box, additive function
 -/

70fd9563

chore: classify simp can prove porting notes (#10930)

Classify by adding issue number (#10618) to porting notes claiming anything semantically equivalent to

"simp can prove this"
"simp can simplify this`"
"was @[simp], now can be proved by simp"
"was @[simp], but simp can prove it"
"removed simp attribute as the equality can already be obtained by simp"
"simp can already prove this"
"simp already proves this"
"simp can prove these"

d8fa853a

Diff

@@ -78,7 +78,7 @@ theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x :=
   DFunLike.coe_injective
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
 
--- porting note: was @[simp], now can be proved by `simp`
+-- Porting note (#10618): was @[simp], now can be proved by `simp`
 theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g := DFunLike.coe_fn_eq
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj

70fd9563

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

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
 import Mathlib.Analysis.BoxIntegral.Partition.Split
-import Mathlib.Analysis.NormedSpace.OperatorNorm
+import Mathlib.Analysis.NormedSpace.OperatorNorm.Mul
 
 #align_import analysis.box_integral.partition.additive from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"

70fd9563

chore: remove stream-of-consciousness uses of have, replace and suffices (#10640)

No changes to tactic file, it's just boring fixes throughout the library.

This follows on from #6964.

Co-authored-by: sgouezel <sebastien.gouezel@univ-rennes1.fr> Co-authored-by: Eric Wieser <wieser.eric@gmail.com>

a13e8040

Diff

@@ -127,8 +127,8 @@ def ofMapSplitAdd [Finite ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
       (I.splitLower i x).elim' 0 f + (I.splitUpper i x).elim' 0 f = f I) :
     ι →ᵇᵃ[I₀] M := by
   refine' ⟨f, _⟩
-  replace hf : ∀ I : Box ι, ↑I ≤ I₀ → ∀ s, (∑ J in (splitMany I s).boxes, f J) = f I
-  · intro I hI s
+  replace hf : ∀ I : Box ι, ↑I ≤ I₀ → ∀ s, (∑ J in (splitMany I s).boxes, f J) = f I := by
+    intro I hI s
     induction' s using Finset.induction_on with a s _ ihs
     · simp
     rw [splitMany_insert, inf_split, ← ihs, biUnion_boxes, sum_biUnion_boxes]

70fd9563

chore(Analysis/BoxIntegral): Fintype -> Finite (#10292)

34bbb84e

Diff

@@ -122,7 +122,7 @@ def restrict (f : ι →ᵇᵃ[I₀] M) (I : WithTop (Box ι)) (hI : I ≤ I₀)
 
 /-- If `f : Box ι → M` is box additive on partitions of the form `split I i x`, then it is box
 additive. -/
-def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
+def ofMapSplitAdd [Finite ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
     (hf : ∀ I : Box ι, ↑I ≤ I₀ → ∀ {i x}, x ∈ Ioo (I.lower i) (I.upper i) →
       (I.splitLower i x).elim' 0 f + (I.splitUpper i x).elim' 0 f = f I) :
     ι →ᵇᵃ[I₀] M := by

70fd9563

doc: @[inherit_doc] on notations (#9942)

Make all the notations that unambiguously should inherit the docstring of their definition actually inherit it.

Also write a few docstrings by hand. I only wrote the ones I was competent to write and which I was sure of. Some docstrings come from mathlib3 as they were lost during the early port.

This PR is only intended as a first pass There are many more docstrings to add.

08f7e99d

Diff

@@ -48,8 +48,12 @@ structure BoxAdditiveMap (ι M : Type*) [AddCommMonoid M] (I : WithTop (Box ι))
     ∑ Ji in π.boxes, toFun Ji = toFun J
 #align box_integral.box_additive_map BoxIntegral.BoxAdditiveMap
 
+
+/-- A function on `Box ι` is called box additive if for every box `J` and a partition `π` of `J`
+we have `f J = ∑ Ji in π.boxes, f Ji`. -/
 scoped notation:25 ι " →ᵇᵃ " M => BoxIntegral.BoxAdditiveMap ι M ⊤
-scoped notation:25 ι " →ᵇᵃ[" I "] " M => BoxIntegral.BoxAdditiveMap ι M I
+
+@[inherit_doc] scoped notation:25 ι " →ᵇᵃ[" I "] " M => BoxIntegral.BoxAdditiveMap ι M I
 
 namespace BoxAdditiveMap

70fd9563

refactor(*): abbreviation for non-dependent FunLike (#9833)

This follows up from #9785, which renamed FunLike to DFunLike, by introducing a new abbreviation FunLike F α β := DFunLike F α (fun _ => β), to make the non-dependent use of FunLike easier.

I searched for the pattern DFunLike.*fun and DFunLike.*λ in all files to replace expressions of the form DFunLike F α (fun _ => β) with FunLike F α β. I did this everywhere except for extends clauses for two reasons: it would conflict with #8386, and more importantly extends must directly refer to a structure with no unfolding of defs or abbrevs.

54792e9e

Diff

@@ -58,7 +58,7 @@ open Box Prepartition Finset
 variable {N : Type*} [AddCommMonoid M] [AddCommMonoid N] {I₀ : WithTop (Box ι)} {I J : Box ι}
   {i : ι}
 
-instance : DFunLike (ι →ᵇᵃ[I₀] M) (Box ι) (fun _ ↦ M) where
+instance : FunLike (ι →ᵇᵃ[I₀] M) (Box ι) M where
   coe := toFun
   coe_injective' f g h := by cases f; cases g; congr

70fd9563

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

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

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

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

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

82656743

Diff

@@ -58,7 +58,7 @@ open Box Prepartition Finset
 variable {N : Type*} [AddCommMonoid M] [AddCommMonoid N] {I₀ : WithTop (Box ι)} {I J : Box ι}
   {i : ι}
 
-instance : FunLike (ι →ᵇᵃ[I₀] M) (Box ι) (fun _ ↦ M) where
+instance : DFunLike (ι →ᵇᵃ[I₀] M) (Box ι) (fun _ ↦ M) where
   coe := toFun
   coe_injective' f g h := by cases f; cases g; congr
 
@@ -71,11 +71,11 @@ theorem coe_mk (f h) : ⇑(mk f h : ι →ᵇᵃ[I₀] M) = f := rfl
 #align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mk
 
 theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x :=
-  FunLike.coe_injective
+  DFunLike.coe_injective
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
 
 -- porting note: was @[simp], now can be proved by `simp`
-theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g := FunLike.coe_fn_eq
+theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g := DFunLike.coe_fn_eq
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
 
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}

70fd9563

chore: remove deprecated MonoidHom.map_prod, AddMonoidHom.map_sum (#8787)

aca3f237

Diff

@@ -145,7 +145,7 @@ map. -/
 @[simps (config := .asFn)]
 def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N where
   toFun := g ∘ f
-  sum_partition_boxes' I hI π hπ := by simp_rw [comp, ← g.map_sum, f.sum_partition_boxes hI hπ]
+  sum_partition_boxes' I hI π hπ := by simp_rw [comp, ← map_sum, f.sum_partition_boxes hI hπ]
 #align box_integral.box_additive_map.map BoxIntegral.BoxAdditiveMap.map
 
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of

70fd9563

style: shorten simps configurations (#8296)

Use .asFn and .lemmasOnly as simps configuration options.

For reference, these are defined here:

https://github.com/leanprover-community/mathlib4/blob/4055c8b471380825f07416b12cb0cf266da44d84/Mathlib/Tactic/Simps/Basic.lean#L843-L851

e0637173

Diff

@@ -83,7 +83,7 @@ theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π
   f.sum_partition_boxes' I hI π h
 #align box_integral.box_additive_map.sum_partition_boxes BoxIntegral.BoxAdditiveMap.sum_partition_boxes
 
-@[simps (config := { fullyApplied := false })]
+@[simps (config := .asFn)]
 instance : Zero (ι →ᵇᵃ[I₀] M) :=
   ⟨⟨0, fun _ _ _ _ => sum_const_zero⟩⟩
 
@@ -142,7 +142,7 @@ def ofMapSplitAdd [Fintype ι] (f : Box ι → M) (I₀ : WithTop (Box ι))
 
 /-- If `g : M → N` is an additive map and `f` is a box additive map, then `g ∘ f` is a box additive
 map. -/
-@[simps (config := { fullyApplied := false })]
+@[simps (config := .asFn)]
 def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N where
   toFun := g ∘ f
   sum_partition_boxes' I hI π hπ := by simp_rw [comp, ← g.map_sum, f.sum_partition_boxes hI hπ]

70fd9563

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

@@ -35,14 +35,14 @@ open Classical BigOperators Function Set
 
 namespace BoxIntegral
 
-variable {ι M : Type _} {n : ℕ}
+variable {ι M : Type*} {n : ℕ}
 
 /-- A function on `Box ι` is called box additive if for every box `J` and a partition `π` of `J`
 we have `f J = ∑ Ji in π.boxes, f Ji`. A function is called box additive on subboxes of `I : Box ι`
 if the same property holds for `J ≤ I`. We formalize these two notions in the same definition
 using `I : WithBot (Box ι)`: the value `I = ⊤` corresponds to functions box additive on the whole
 space. -/
-structure BoxAdditiveMap (ι M : Type _) [AddCommMonoid M] (I : WithTop (Box ι)) where
+structure BoxAdditiveMap (ι M : Type*) [AddCommMonoid M] (I : WithTop (Box ι)) where
   toFun : Box ι → M
   sum_partition_boxes' : ∀ J : Box ι, ↑J ≤ I → ∀ π : Prepartition J, π.IsPartition →
     ∑ Ji in π.boxes, toFun Ji = toFun J
@@ -55,7 +55,7 @@ namespace BoxAdditiveMap
 
 open Box Prepartition Finset
 
-variable {N : Type _} [AddCommMonoid M] [AddCommMonoid N] {I₀ : WithTop (Box ι)} {I J : Box ι}
+variable {N : Type*} [AddCommMonoid M] [AddCommMonoid N] {I₀ : WithTop (Box ι)} {I J : Box ι}
   {i : ι}
 
 instance : FunLike (ι →ᵇᵃ[I₀] M) (Box ι) (fun _ ↦ M) where
@@ -171,7 +171,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
 
 section ToSMul
 
-variable {E : Type _} [NormedAddCommGroup E] [NormedSpace ℝ E]
+variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
 
 /-- If `f` is a box-additive map, then so is the map sending `I` to the scalar multiplication
 by `f I` as a continuous linear map from `E` to itself. -/

70fd9563

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.box_integral.partition.additive
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Analysis.BoxIntegral.Partition.Split
 import Mathlib.Analysis.NormedSpace.OperatorNorm
 
+#align_import analysis.box_integral.partition.additive from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"
+
 /-!
 # Box additive functions

70fd9563

chore: bump to nightly-2023-07-01 (#5409)

depends on: https://github.com/leanprover/std4/pull/163
depends on: #5584
depends on: #5715
depends on: #5729
depends on: https://github.com/leanprover/std4/pull/173

Co-authored-by: Komyyy <pol_tta@outlook.jp> Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au> Co-authored-by: Ruben Van de Velde <65514131+Ruben-VandeVelde@users.noreply.github.com> Co-authored-by: Mario Carneiro <di.gama@gmail.com>

906f7221

Diff

@@ -216,7 +216,7 @@ def upperSubLower.{u} {G : Type u} [AddCommGroup G] (I₀ : Box (Fin (n + 1))) (
         simp only [Box.splitLower_def hx, Box.splitUpper_def hx, Box.splitLower_def hx',
           Box.splitUpper_def hx', ← WithBot.some_eq_coe, Option.elim', Box.face_mk,
           update_noteq (Fin.succAbove_ne _ _).symm, sub_add_sub_comm,
-          update_comp_eq_of_injective _ i.succAbove.injective j x, ← hf]
+          update_comp_eq_of_injective _ (Fin.strictMono_succAbove i).injective j x, ← hf]
         simp only [Box.face])
 #align box_integral.box_additive_map.upper_sub_lower BoxIntegral.BoxAdditiveMap.upperSubLower

70fd9563

fix: ∑' precedence (#5615)

Also remove most superfluous parentheses around big operators (∑, ∏ and variants).
roughly the used regex: ([^a-zA-Zα-ωΑ-Ω'𝓝ℳ₀𝕂ₛ)]) $([∑∏][^()∑∏]*,[^()∑∏:]*)$ ([⊂⊆=<≤]) replaced by $1 $2 $3

03fc68aa

Diff

@@ -48,7 +48,7 @@ space. -/
 structure BoxAdditiveMap (ι M : Type _) [AddCommMonoid M] (I : WithTop (Box ι)) where
   toFun : Box ι → M
   sum_partition_boxes' : ∀ J : Box ι, ↑J ≤ I → ∀ π : Prepartition J, π.IsPartition →
-    (∑ Ji in π.boxes, toFun Ji) = toFun J
+    ∑ Ji in π.boxes, toFun Ji = toFun J
 #align box_integral.box_additive_map BoxIntegral.BoxAdditiveMap
 
 scoped notation:25 ι " →ᵇᵃ " M => BoxIntegral.BoxAdditiveMap ι M ⊤
@@ -82,7 +82,7 @@ theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
 
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}
-    (h : π.IsPartition) : (∑ J in π.boxes, f J) = f I :=
+    (h : π.IsPartition) : ∑ J in π.boxes, f J = f I :=
   f.sum_partition_boxes' I hI π h
 #align box_integral.box_additive_map.sum_partition_boxes BoxIntegral.BoxAdditiveMap.sum_partition_boxes
 
@@ -154,14 +154,14 @@ def map (f : ι →ᵇᵃ[I₀] M) (g : M →+ N) : ι →ᵇᵃ[I₀] N where
 /-- If `f` is a box additive function on subboxes of `I` and `π₁`, `π₂` are two prepartitions of
 `I` that cover the same part of `I`, then `∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J`. -/
 theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π₁ π₂ : Prepartition I}
-    (h : π₁.iUnion = π₂.iUnion) : (∑ J in π₁.boxes, f J) = ∑ J in π₂.boxes, f J := by
+    (h : π₁.iUnion = π₂.iUnion) : ∑ J in π₁.boxes, f J = ∑ J in π₂.boxes, f J := by
   rcases exists_splitMany_inf_eq_filter_of_finite {π₁, π₂} ((finite_singleton _).insert _) with
     ⟨s, hs⟩
   simp only [inf_splitMany] at hs
   rcases hs _ (Or.inl rfl), hs _ (Or.inr rfl) with ⟨h₁, h₂⟩; clear hs
   rw [h] at h₁
   calc
-    (∑ J in π₁.boxes, f J) = ∑ J in π₁.boxes, ∑ J' in (splitMany J s).boxes, f J' :=
+    ∑ J in π₁.boxes, f J = ∑ J in π₁.boxes, ∑ J' in (splitMany J s).boxes, f J' :=
       Finset.sum_congr rfl fun J hJ => (f.sum_partition_boxes ?_ (isPartition_splitMany _ _)).symm
     _ = ∑ J in (π₁.biUnion fun J => splitMany J s).boxes, f J := (sum_biUnion_boxes _ _ _).symm
     _ = ∑ J in (π₂.biUnion fun J => splitMany J s).boxes, f J := by rw [h₁, h₂]

70fd9563

chore: add space after exacts (#4945)

Too often tempted to change these during other PRs, so doing a mass edit here.

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

bf799bb9

Diff

@@ -168,7 +168,7 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
     _ = ∑ J in π₂.boxes, ∑ J' in (splitMany J s).boxes, f J' := (sum_biUnion_boxes _ _ _)
     _ = ∑ J in π₂.boxes, f J :=
       Finset.sum_congr rfl fun J hJ => f.sum_partition_boxes ?_ (isPartition_splitMany _ _)
-  exacts[(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,
+  exacts [(WithTop.coe_le_coe.2 <| π₁.le_of_mem hJ).trans hI,
     (WithTop.coe_le_coe.2 <| π₂.le_of_mem hJ).trans hI]
 #align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congr

70fd9563

feat: port Analysis.BoxIntegral.Basic (#4695)

Co-authored-by: Alex J Best <alex.j.best@gmail.com> Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

49f3a15a

Diff

@@ -61,25 +61,24 @@ open Box Prepartition Finset
 variable {N : Type _} [AddCommMonoid M] [AddCommMonoid N] {I₀ : WithTop (Box ι)} {I J : Box ι}
   {i : ι}
 
-instance : CoeFun (ι →ᵇᵃ[I₀] M) fun _ => Box ι → M :=
-  ⟨toFun⟩
+instance : FunLike (ι →ᵇᵃ[I₀] M) (Box ι) (fun _ ↦ M) where
+  coe := toFun
+  coe_injective' f g h := by cases f; cases g; congr
 
 initialize_simps_projections BoxIntegral.BoxAdditiveMap (toFun → apply)
 
 #noalign box_integral.box_additive_map.to_fun_eq_coe
 
--- Porting note: Left-hand side has variable as head symbol @[simp]
+@[simp]
 theorem coe_mk (f h) : ⇑(mk f h : ι →ᵇᵃ[I₀] M) = f := rfl
 #align box_integral.box_additive_map.coe_mk BoxIntegral.BoxAdditiveMap.coe_mk
 
-theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x := by
-  rintro ⟨f, hf⟩ ⟨g, hg⟩ (rfl : f = g)
-  rfl
+theorem coe_injective : Injective fun (f : ι →ᵇᵃ[I₀] M) x => f x :=
+  FunLike.coe_injective
 #align box_integral.box_additive_map.coe_injective BoxIntegral.BoxAdditiveMap.coe_injective
 
-@[simp]
-theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g :=
-  coe_injective.eq_iff
+-- porting note: was @[simp], now can be proved by `simp`
+theorem coe_inj {f g : ι →ᵇᵃ[I₀] M} : (f : Box ι → M) = g ↔ f = g := FunLike.coe_fn_eq
 #align box_integral.box_additive_map.coe_inj BoxIntegral.BoxAdditiveMap.coe_inj
 
 theorem sum_partition_boxes (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) {π : Prepartition I}

70fd9563

chore: tidy various files (#4423)

9f94180e

Diff

@@ -34,9 +34,7 @@ rectangular box, additive function
 
 noncomputable section
 
-open Classical BigOperators
-
-open Function Set
+open Classical BigOperators Function Set
 
 namespace BoxIntegral
 
@@ -175,21 +173,21 @@ theorem sum_boxes_congr [Finite ι] (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I
     (WithTop.coe_le_coe.2 <| π₂.le_of_mem hJ).trans hI]
 #align box_integral.box_additive_map.sum_boxes_congr BoxIntegral.BoxAdditiveMap.sum_boxes_congr
 
-section ToSmul
+section ToSMul
 
 variable {E : Type _} [NormedAddCommGroup E] [NormedSpace ℝ E]
 
 /-- If `f` is a box-additive map, then so is the map sending `I` to the scalar multiplication
 by `f I` as a continuous linear map from `E` to itself. -/
-def toSmul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
+def toSMul (f : ι →ᵇᵃ[I₀] ℝ) : ι →ᵇᵃ[I₀] E →L[ℝ] E :=
   f.map (ContinuousLinearMap.lsmul ℝ ℝ).toLinearMap.toAddMonoidHom
-#align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSmul
+#align box_integral.box_additive_map.to_smul BoxIntegral.BoxAdditiveMap.toSMul
 
 @[simp]
-theorem toSmul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSmul I x = f I • x := rfl
-#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSmul_apply
+theorem toSMul_apply (f : ι →ᵇᵃ[I₀] ℝ) (I : Box ι) (x : E) : f.toSMul I x = f I • x := rfl
+#align box_integral.box_additive_map.to_smul_apply BoxIntegral.BoxAdditiveMap.toSMul_apply
 
-end ToSmul
+end ToSMul
 
 /-- Given a box `I₀` in `ℝⁿ⁺¹`, `f x : Box (Fin n) → G` is a family of functions indexed by a real
 `x` and for `x ∈ [I₀.lower i, I₀.upper i]`, `f x` is box-additive on subboxes of the `i`-th face of

70fd9563

chore: restore simp tag for BoxIntegral.BoxAdditiveMap.map_split_add (#4294)

9b45a6f8

Diff

@@ -109,7 +109,7 @@ instance {R} [Monoid R] [DistribMulAction R M] : SMul R (ι →ᵇᵃ[I₀] M) :
 instance : AddCommMonoid (ι →ᵇᵃ[I₀] M) :=
   Function.Injective.addCommMonoid _ coe_injective rfl (fun _ _ => rfl) fun _ _ => rfl
 
--- Porting note: LHS not in simp normal form due to Option.elim' @[simp]
+@[simp]
 theorem map_split_add (f : ι →ᵇᵃ[I₀] M) (hI : ↑I ≤ I₀) (i : ι) (x : ℝ) :
     (I.splitLower i x).elim' 0 f + (I.splitUpper i x).elim' 0 f = f I := by
   rw [← f.sum_partition_boxes hI (isPartitionSplit I i x), sum_split_boxes]

70fd9563

feat: port Analysis.BoxIntegral.Partition.Additive (#4054)

Co-authored-by: int-y1 <jason_yuen2007@hotmail.com>

ab19baaf

`analysis.box_integral.partition.additive` ⟷ `Mathlib.Analysis.BoxIntegral.Partition.Additive`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 643

analysis.box_integral.partition.additive ⟷ Mathlib.Analysis.BoxIntegral.Partition.Additive

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 643

`analysis.box_integral.partition.additive` ⟷ `Mathlib.Analysis.BoxIntegral.Partition.Additive`