analysis.normed_space.int | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

5cc2dfdd

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

10bf4f82

bump to nightly-2024-04-19-08

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

a9e81450

Diff

@@ -56,7 +56,7 @@ theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = 
 #print Int.toNat_add_toNat_neg_eq_norm /-
 @[simp]
 theorem toNat_add_toNat_neg_eq_norm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖ := by
-  simpa only [NNReal.coe_nat_cast, NNReal.coe_add] using
+  simpa only [NNReal.coe_natCast, NNReal.coe_add] using
     congr_arg (coe : _ → ℝ) (to_nat_add_to_nat_neg_eq_nnnorm n)
 #align int.to_nat_add_to_nat_neg_eq_norm Int.toNat_add_toNat_neg_eq_norm
 -/

10bf4f82

bump to nightly-2024-04-09-08

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

659ec6f7

Diff

@@ -39,11 +39,11 @@ theorem norm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖ = 1 := by
 #align int.norm_coe_units Int.norm_coe_units
 -/
 
-#print Int.nnnorm_coe_nat /-
+#print Int.nnnorm_natCast /-
 @[simp]
-theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
-  Real.nnnorm_coe_nat _
-#align int.nnnorm_coe_nat Int.nnnorm_coe_nat
+theorem nnnorm_natCast (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
+  Real.nnnorm_natCast _
+#align int.nnnorm_coe_nat Int.nnnorm_natCast
 -/
 
 #print Int.toNat_add_toNat_neg_eq_nnnorm /-

10bf4f82

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -49,7 +49,7 @@ theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
 #print Int.toNat_add_toNat_neg_eq_nnnorm /-
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by
-  rw [← Nat.cast_add, to_nat_add_to_nat_neg_eq_nat_abs, NNReal.coe_natAbs]
+  rw [← Nat.cast_add, to_nat_add_to_nat_neg_eq_nat_abs, NNReal.natCast_natAbs]
 #align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnorm
 -/

10bf4f82

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2021 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
 -/
-import Mathbin.Analysis.Normed.Field.Basic
+import Analysis.Normed.Field.Basic
 
 #align_import analysis.normed_space.int from "leanprover-community/mathlib"@"10bf4f825ad729c5653adc039dafa3622e7f93c9"

10bf4f82

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2021 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
-
-! This file was ported from Lean 3 source module analysis.normed_space.int
-! leanprover-community/mathlib commit 10bf4f825ad729c5653adc039dafa3622e7f93c9
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Analysis.Normed.Field.Basic
 
+#align_import analysis.normed_space.int from "leanprover-community/mathlib"@"10bf4f825ad729c5653adc039dafa3622e7f93c9"
+
 /-!
 # The integers as normed ring

10bf4f82

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -29,14 +29,18 @@ open scoped BigOperators
 
 namespace Int
 
+#print Int.nnnorm_coe_units /-
 theorem nnnorm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖₊ = 1 := by
   obtain rfl | rfl := Int.units_eq_one_or e <;>
     simp only [Units.coe_neg_one, Units.val_one, nnnorm_neg, nnnorm_one]
 #align int.nnnorm_coe_units Int.nnnorm_coe_units
+-/
 
+#print Int.norm_coe_units /-
 theorem norm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖ = 1 := by
   rw [← coe_nnnorm, Int.nnnorm_coe_units, NNReal.coe_one]
 #align int.norm_coe_units Int.norm_coe_units
+-/
 
 #print Int.nnnorm_coe_nat /-
 @[simp]
@@ -45,16 +49,20 @@ theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
 #align int.nnnorm_coe_nat Int.nnnorm_coe_nat
 -/
 
+#print Int.toNat_add_toNat_neg_eq_nnnorm /-
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by
   rw [← Nat.cast_add, to_nat_add_to_nat_neg_eq_nat_abs, NNReal.coe_natAbs]
 #align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnorm
+-/
 
+#print Int.toNat_add_toNat_neg_eq_norm /-
 @[simp]
 theorem toNat_add_toNat_neg_eq_norm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖ := by
   simpa only [NNReal.coe_nat_cast, NNReal.coe_add] using
     congr_arg (coe : _ → ℝ) (to_nat_add_to_nat_neg_eq_nnnorm n)
 #align int.to_nat_add_to_nat_neg_eq_norm Int.toNat_add_toNat_neg_eq_norm
+-/
 
 end Int

10bf4f82

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -25,7 +25,7 @@ The resulting nonnegative real number is denoted by `‖n‖₊`.
 -/
 
 
-open BigOperators
+open scoped BigOperators
 
 namespace Int

10bf4f82

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -29,23 +29,11 @@ open BigOperators
 
 namespace Int
 
-/- warning: int.nnnorm_coe_units -> Int.nnnorm_coe_units is a dubious translation:
-lean 3 declaration is
-  forall (e : Units.{0} Int Int.monoid), Eq.{1} NNReal (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) (Units.{0} Int Int.monoid) Int (HasLiftT.mk.{1, 1} (Units.{0} Int Int.monoid) Int (CoeTCₓ.coe.{1, 1} (Units.{0} Int Int.monoid) Int (coeBase.{1, 1} (Units.{0} Int Int.monoid) Int (Units.hasCoe.{0} Int Int.monoid)))) e)) (OfNat.ofNat.{0} NNReal 1 (OfNat.mk.{0} NNReal 1 (One.one.{0} NNReal (AddMonoidWithOne.toOne.{0} NNReal (AddCommMonoidWithOne.toAddMonoidWithOne.{0} NNReal (NonAssocSemiring.toAddCommMonoidWithOne.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring)))))))
-but is expected to have type
-  forall (e : Units.{0} Int Int.instMonoidInt), Eq.{1} NNReal (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) (Units.val.{0} Int Int.instMonoidInt e)) (OfNat.ofNat.{0} NNReal 1 (One.toOfNat1.{0} NNReal instNNRealOne))
-Case conversion may be inaccurate. Consider using '#align int.nnnorm_coe_units Int.nnnorm_coe_unitsₓ'. -/
 theorem nnnorm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖₊ = 1 := by
   obtain rfl | rfl := Int.units_eq_one_or e <;>
     simp only [Units.coe_neg_one, Units.val_one, nnnorm_neg, nnnorm_one]
 #align int.nnnorm_coe_units Int.nnnorm_coe_units
 
-/- warning: int.norm_coe_units -> Int.norm_coe_units is a dubious translation:
-lean 3 declaration is
-  forall (e : Units.{0} Int Int.monoid), Eq.{1} Real (Norm.norm.{0} Int (NormedRing.toHasNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) (Units.{0} Int Int.monoid) Int (HasLiftT.mk.{1, 1} (Units.{0} Int Int.monoid) Int (CoeTCₓ.coe.{1, 1} (Units.{0} Int Int.monoid) Int (coeBase.{1, 1} (Units.{0} Int Int.monoid) Int (Units.hasCoe.{0} Int Int.monoid)))) e)) (OfNat.ofNat.{0} Real 1 (OfNat.mk.{0} Real 1 (One.one.{0} Real Real.hasOne)))
-but is expected to have type
-  forall (e : Units.{0} Int Int.instMonoidInt), Eq.{1} Real (Norm.norm.{0} Int (NormedRing.toNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) (Units.val.{0} Int Int.instMonoidInt e)) (OfNat.ofNat.{0} Real 1 (One.toOfNat1.{0} Real Real.instOneReal))
-Case conversion may be inaccurate. Consider using '#align int.norm_coe_units Int.norm_coe_unitsₓ'. -/
 theorem norm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖ = 1 := by
   rw [← coe_nnnorm, Int.nnnorm_coe_units, NNReal.coe_one]
 #align int.norm_coe_units Int.norm_coe_units
@@ -57,23 +45,11 @@ theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
 #align int.nnnorm_coe_nat Int.nnnorm_coe_nat
 -/
 
-/- warning: int.to_nat_add_to_nat_neg_eq_nnnorm -> Int.toNat_add_toNat_neg_eq_nnnorm is a dubious translation:
-lean 3 declaration is
-  forall (n : Int), Eq.{1} NNReal (HAdd.hAdd.{0, 0, 0} NNReal NNReal NNReal (instHAdd.{0} NNReal (Distrib.toHasAdd.{0} NNReal (NonUnitalNonAssocSemiring.toDistrib.{0} NNReal (NonAssocSemiring.toNonUnitalNonAssocSemiring.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring))))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat NNReal (HasLiftT.mk.{1, 1} Nat NNReal (CoeTCₓ.coe.{1, 1} Nat NNReal (Nat.castCoe.{0} NNReal (AddMonoidWithOne.toNatCast.{0} NNReal (AddCommMonoidWithOne.toAddMonoidWithOne.{0} NNReal (NonAssocSemiring.toAddCommMonoidWithOne.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring))))))) (Int.toNat n)) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat NNReal (HasLiftT.mk.{1, 1} Nat NNReal (CoeTCₓ.coe.{1, 1} Nat NNReal (Nat.castCoe.{0} NNReal (AddMonoidWithOne.toNatCast.{0} NNReal (AddCommMonoidWithOne.toAddMonoidWithOne.{0} NNReal (NonAssocSemiring.toAddCommMonoidWithOne.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring))))))) (Int.toNat (Neg.neg.{0} Int Int.hasNeg n)))) (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) n)
-but is expected to have type
-  forall (n : Int), Eq.{1} NNReal (HAdd.hAdd.{0, 0, 0} NNReal NNReal NNReal (instHAdd.{0} NNReal (Distrib.toAdd.{0} NNReal (NonUnitalNonAssocSemiring.toDistrib.{0} NNReal (NonAssocSemiring.toNonUnitalNonAssocSemiring.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal instNNRealSemiring))))) (Nat.cast.{0} NNReal (CanonicallyOrderedCommSemiring.toNatCast.{0} NNReal instNNRealCanonicallyOrderedCommSemiring) (Int.toNat n)) (Nat.cast.{0} NNReal (CanonicallyOrderedCommSemiring.toNatCast.{0} NNReal instNNRealCanonicallyOrderedCommSemiring) (Int.toNat (Neg.neg.{0} Int Int.instNegInt n)))) (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) n)
-Case conversion may be inaccurate. Consider using '#align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnormₓ'. -/
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by
   rw [← Nat.cast_add, to_nat_add_to_nat_neg_eq_nat_abs, NNReal.coe_natAbs]
 #align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnorm
 
-/- warning: int.to_nat_add_to_nat_neg_eq_norm -> Int.toNat_add_toNat_neg_eq_norm is a dubious translation:
-lean 3 declaration is
-  forall (n : Int), Eq.{1} Real (HAdd.hAdd.{0, 0, 0} Real Real Real (instHAdd.{0} Real Real.hasAdd) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) (Int.toNat n)) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) (Int.toNat (Neg.neg.{0} Int Int.hasNeg n)))) (Norm.norm.{0} Int (NormedRing.toHasNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) n)
-but is expected to have type
-  forall (n : Int), Eq.{1} Real (HAdd.hAdd.{0, 0, 0} Real Real Real (instHAdd.{0} Real Real.instAddReal) (Nat.cast.{0} Real Real.natCast (Int.toNat n)) (Nat.cast.{0} Real Real.natCast (Int.toNat (Neg.neg.{0} Int Int.instNegInt n)))) (Norm.norm.{0} Int (NormedRing.toNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) n)
-Case conversion may be inaccurate. Consider using '#align int.to_nat_add_to_nat_neg_eq_norm Int.toNat_add_toNat_neg_eq_normₓ'. -/
 @[simp]
 theorem toNat_add_toNat_neg_eq_norm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖ := by
   simpa only [NNReal.coe_nat_cast, NNReal.coe_add] using

10bf4f82

bump to nightly-2023-03-16-03

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

8ae28b0b

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
 
 ! This file was ported from Lean 3 source module analysis.normed_space.int
-! leanprover-community/mathlib commit 5cc2dfdd3e92f340411acea4427d701dc7ed26f8
+! leanprover-community/mathlib commit 10bf4f825ad729c5653adc039dafa3622e7f93c9
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.Analysis.Normed.Field.Basic
 /-!
 # The integers as normed ring
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file contains basic facts about the integers as normed ring.
 
 Recall that `‖n‖` denotes the norm of `n` as real number.

5cc2dfdd

bump to nightly-2023-03-13-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/2af0836443b4cfb5feda0df0051acdb398304931

66e1e587

Diff

@@ -26,25 +26,51 @@ open BigOperators
 
 namespace Int
 
+/- warning: int.nnnorm_coe_units -> Int.nnnorm_coe_units is a dubious translation:
+lean 3 declaration is
+  forall (e : Units.{0} Int Int.monoid), Eq.{1} NNReal (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) (Units.{0} Int Int.monoid) Int (HasLiftT.mk.{1, 1} (Units.{0} Int Int.monoid) Int (CoeTCₓ.coe.{1, 1} (Units.{0} Int Int.monoid) Int (coeBase.{1, 1} (Units.{0} Int Int.monoid) Int (Units.hasCoe.{0} Int Int.monoid)))) e)) (OfNat.ofNat.{0} NNReal 1 (OfNat.mk.{0} NNReal 1 (One.one.{0} NNReal (AddMonoidWithOne.toOne.{0} NNReal (AddCommMonoidWithOne.toAddMonoidWithOne.{0} NNReal (NonAssocSemiring.toAddCommMonoidWithOne.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring)))))))
+but is expected to have type
+  forall (e : Units.{0} Int Int.instMonoidInt), Eq.{1} NNReal (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) (Units.val.{0} Int Int.instMonoidInt e)) (OfNat.ofNat.{0} NNReal 1 (One.toOfNat1.{0} NNReal instNNRealOne))
+Case conversion may be inaccurate. Consider using '#align int.nnnorm_coe_units Int.nnnorm_coe_unitsₓ'. -/
 theorem nnnorm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖₊ = 1 := by
   obtain rfl | rfl := Int.units_eq_one_or e <;>
     simp only [Units.coe_neg_one, Units.val_one, nnnorm_neg, nnnorm_one]
 #align int.nnnorm_coe_units Int.nnnorm_coe_units
 
+/- warning: int.norm_coe_units -> Int.norm_coe_units is a dubious translation:
+lean 3 declaration is
+  forall (e : Units.{0} Int Int.monoid), Eq.{1} Real (Norm.norm.{0} Int (NormedRing.toHasNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) (Units.{0} Int Int.monoid) Int (HasLiftT.mk.{1, 1} (Units.{0} Int Int.monoid) Int (CoeTCₓ.coe.{1, 1} (Units.{0} Int Int.monoid) Int (coeBase.{1, 1} (Units.{0} Int Int.monoid) Int (Units.hasCoe.{0} Int Int.monoid)))) e)) (OfNat.ofNat.{0} Real 1 (OfNat.mk.{0} Real 1 (One.one.{0} Real Real.hasOne)))
+but is expected to have type
+  forall (e : Units.{0} Int Int.instMonoidInt), Eq.{1} Real (Norm.norm.{0} Int (NormedRing.toNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) (Units.val.{0} Int Int.instMonoidInt e)) (OfNat.ofNat.{0} Real 1 (One.toOfNat1.{0} Real Real.instOneReal))
+Case conversion may be inaccurate. Consider using '#align int.norm_coe_units Int.norm_coe_unitsₓ'. -/
 theorem norm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖ = 1 := by
   rw [← coe_nnnorm, Int.nnnorm_coe_units, NNReal.coe_one]
 #align int.norm_coe_units Int.norm_coe_units
 
+#print Int.nnnorm_coe_nat /-
 @[simp]
 theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
   Real.nnnorm_coe_nat _
 #align int.nnnorm_coe_nat Int.nnnorm_coe_nat
+-/
 
+/- warning: int.to_nat_add_to_nat_neg_eq_nnnorm -> Int.toNat_add_toNat_neg_eq_nnnorm is a dubious translation:
+lean 3 declaration is
+  forall (n : Int), Eq.{1} NNReal (HAdd.hAdd.{0, 0, 0} NNReal NNReal NNReal (instHAdd.{0} NNReal (Distrib.toHasAdd.{0} NNReal (NonUnitalNonAssocSemiring.toDistrib.{0} NNReal (NonAssocSemiring.toNonUnitalNonAssocSemiring.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring))))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat NNReal (HasLiftT.mk.{1, 1} Nat NNReal (CoeTCₓ.coe.{1, 1} Nat NNReal (Nat.castCoe.{0} NNReal (AddMonoidWithOne.toNatCast.{0} NNReal (AddCommMonoidWithOne.toAddMonoidWithOne.{0} NNReal (NonAssocSemiring.toAddCommMonoidWithOne.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring))))))) (Int.toNat n)) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat NNReal (HasLiftT.mk.{1, 1} Nat NNReal (CoeTCₓ.coe.{1, 1} Nat NNReal (Nat.castCoe.{0} NNReal (AddMonoidWithOne.toNatCast.{0} NNReal (AddCommMonoidWithOne.toAddMonoidWithOne.{0} NNReal (NonAssocSemiring.toAddCommMonoidWithOne.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal NNReal.semiring))))))) (Int.toNat (Neg.neg.{0} Int Int.hasNeg n)))) (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) n)
+but is expected to have type
+  forall (n : Int), Eq.{1} NNReal (HAdd.hAdd.{0, 0, 0} NNReal NNReal NNReal (instHAdd.{0} NNReal (Distrib.toAdd.{0} NNReal (NonUnitalNonAssocSemiring.toDistrib.{0} NNReal (NonAssocSemiring.toNonUnitalNonAssocSemiring.{0} NNReal (Semiring.toNonAssocSemiring.{0} NNReal instNNRealSemiring))))) (Nat.cast.{0} NNReal (CanonicallyOrderedCommSemiring.toNatCast.{0} NNReal instNNRealCanonicallyOrderedCommSemiring) (Int.toNat n)) (Nat.cast.{0} NNReal (CanonicallyOrderedCommSemiring.toNatCast.{0} NNReal instNNRealCanonicallyOrderedCommSemiring) (Int.toNat (Neg.neg.{0} Int Int.instNegInt n)))) (NNNorm.nnnorm.{0} Int (SeminormedAddGroup.toNNNorm.{0} Int (SeminormedAddCommGroup.toSeminormedAddGroup.{0} Int (NonUnitalSeminormedRing.toSeminormedAddCommGroup.{0} Int (NonUnitalNormedRing.toNonUnitalSeminormedRing.{0} Int (NormedRing.toNonUnitalNormedRing.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)))))) n)
+Case conversion may be inaccurate. Consider using '#align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnormₓ'. -/
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by
   rw [← Nat.cast_add, to_nat_add_to_nat_neg_eq_nat_abs, NNReal.coe_natAbs]
 #align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnorm
 
+/- warning: int.to_nat_add_to_nat_neg_eq_norm -> Int.toNat_add_toNat_neg_eq_norm is a dubious translation:
+lean 3 declaration is
+  forall (n : Int), Eq.{1} Real (HAdd.hAdd.{0, 0, 0} Real Real Real (instHAdd.{0} Real Real.hasAdd) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) (Int.toNat n)) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) (Int.toNat (Neg.neg.{0} Int Int.hasNeg n)))) (Norm.norm.{0} Int (NormedRing.toHasNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) n)
+but is expected to have type
+  forall (n : Int), Eq.{1} Real (HAdd.hAdd.{0, 0, 0} Real Real Real (instHAdd.{0} Real Real.instAddReal) (Nat.cast.{0} Real Real.natCast (Int.toNat n)) (Nat.cast.{0} Real Real.natCast (Int.toNat (Neg.neg.{0} Int Int.instNegInt n)))) (Norm.norm.{0} Int (NormedRing.toNorm.{0} Int (NormedCommRing.toNormedRing.{0} Int Int.normedCommRing)) n)
+Case conversion may be inaccurate. Consider using '#align int.to_nat_add_to_nat_neg_eq_norm Int.toNat_add_toNat_neg_eq_normₓ'. -/
 @[simp]
 theorem toNat_add_toNat_neg_eq_norm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖ := by
   simpa only [NNReal.coe_nat_cast, NNReal.coe_add] using

5cc2dfdd

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

5cc2dfdd

chore: reformat deprecation warnings on one line, if possible (#12335)

Occasionally, remove a "deprecated by" or "deprecated since", to fit the line length.

This is desirable (to me) because

it's more compact: I don't see a good reason for these declarations taking up more space than needed; as I understand it, deprecated lemmas are not supposed to be used in mathlib anyway
putting the date on the same line as the attribute makes it easier to discover un-dated deprecations; they also ease writing a tool to replace these by a machine-readable version using leanprover/lean4#3968

45346d9f

Diff

@@ -35,8 +35,7 @@ theorem nnnorm_natCast (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
   Real.nnnorm_natCast _
 #align int.nnnorm_coe_nat Int.nnnorm_natCast
 
--- 2024-04-05
-@[deprecated] alias nnnorm_coe_nat := nnnorm_natCast
+@[deprecated] alias nnnorm_coe_nat := nnnorm_natCast -- 2024-04-05
 
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by

5cc2dfdd

chore: Rename nat_cast/int_cast/rat_cast to natCast/intCast/ratCast (#11486)

Now that I am defining NNRat.cast, I want a definitive answer to this naming issue. Plenty of lemmas in mathlib already use natCast/intCast/ratCast over nat_cast/int_cast/rat_cast, and this matches with the general expectation that underscore-separated name parts correspond to a single declaration.

145460b9

Diff

@@ -45,7 +45,7 @@ theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = 
 
 @[simp]
 theorem toNat_add_toNat_neg_eq_norm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖ := by
-  simpa only [NNReal.coe_nat_cast, NNReal.coe_add] using
+  simpa only [NNReal.coe_natCast, NNReal.coe_add] using
     congrArg NNReal.toReal (toNat_add_toNat_neg_eq_nnnorm n)
 #align int.to_nat_add_to_nat_neg_eq_norm Int.toNat_add_toNat_neg_eq_norm

5cc2dfdd

chore: Rename coe_nat/coe_int/coe_rat to natCast/intCast/ratCast (#11499)

This is less exhaustive than its sibling #11486 because edge cases are harder to classify. No fundamental difficulty, just me being a bit fast and lazy.

Reduce the diff of #11203

b2af0d13

Diff

@@ -31,9 +31,12 @@ theorem norm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖ = 1 := by
 #align int.norm_coe_units Int.norm_coe_units
 
 @[simp]
-theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
-  Real.nnnorm_coe_nat _
-#align int.nnnorm_coe_nat Int.nnnorm_coe_nat
+theorem nnnorm_natCast (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
+  Real.nnnorm_natCast _
+#align int.nnnorm_coe_nat Int.nnnorm_natCast
+
+-- 2024-04-05
+@[deprecated] alias nnnorm_coe_nat := nnnorm_natCast
 
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by

5cc2dfdd

chore: remove some unnecessary 'open BigOperators' (#11880)

Could we have an open linter, that checked for unused opened namespaces?

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

16eb4bdf

Diff

@@ -19,8 +19,6 @@ The resulting nonnegative real number is denoted by `‖n‖₊`.
 -/
 
 
-open BigOperators
-
 namespace Int
 
 theorem nnnorm_coe_units (e : ℤˣ) : ‖(e : ℤ)‖₊ = 1 := by

5cc2dfdd

chore(Data/Int): Rename coe_nat to natCast (#11637)

Reduce the diff of #11499

Renames

All in the Int namespace:

ofNat_eq_cast → ofNat_eq_natCast
cast_eq_cast_iff_Nat → natCast_inj
natCast_eq_ofNat → ofNat_eq_natCast
coe_nat_sub → natCast_sub
coe_nat_nonneg → natCast_nonneg
sign_coe_add_one → sign_natCast_add_one
nat_succ_eq_int_succ → natCast_succ
succ_neg_nat_succ → succ_neg_natCast_succ
coe_pred_of_pos → natCast_pred_of_pos
coe_nat_div → natCast_div
coe_nat_ediv → natCast_ediv
sign_coe_nat_of_nonzero → sign_natCast_of_ne_zero
toNat_coe_nat → toNat_natCast
toNat_coe_nat_add_one → toNat_natCast_add_one
coe_nat_dvd → natCast_dvd_natCast
coe_nat_dvd_left → natCast_dvd
coe_nat_dvd_right → dvd_natCast
le_coe_nat_sub → le_natCast_sub
succ_coe_nat_pos → succ_natCast_pos
coe_nat_modEq_iff → natCast_modEq_iff
coe_natAbs → natCast_natAbs
coe_nat_eq_zero → natCast_eq_zero
coe_nat_ne_zero → natCast_ne_zero
coe_nat_ne_zero_iff_pos → natCast_ne_zero_iff_pos
abs_coe_nat → abs_natCast
coe_nat_nonpos_iff → natCast_nonpos_iff

Also rename Nat.coe_nat_dvd to Nat.cast_dvd_cast

392a24a9

Diff

@@ -39,7 +39,7 @@ theorem nnnorm_coe_nat (n : ℕ) : ‖(n : ℤ)‖₊ = n :=
 
 @[simp]
 theorem toNat_add_toNat_neg_eq_nnnorm (n : ℤ) : ↑n.toNat + ↑(-n).toNat = ‖n‖₊ := by
-  rw [← Nat.cast_add, toNat_add_toNat_neg_eq_natAbs, NNReal.coe_natAbs]
+  rw [← Nat.cast_add, toNat_add_toNat_neg_eq_natAbs, NNReal.natCast_natAbs]
 #align int.to_nat_add_to_nat_neg_eq_nnnorm Int.toNat_add_toNat_neg_eq_nnnorm
 
 @[simp]

5cc2dfdd

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

depends on: #5966

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

89aa3a3b

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2021 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin
-
-! This file was ported from Lean 3 source module analysis.normed_space.int
-! leanprover-community/mathlib commit 5cc2dfdd3e92f340411acea4427d701dc7ed26f8
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Analysis.Normed.Field.Basic
 
+#align_import analysis.normed_space.int from "leanprover-community/mathlib"@"5cc2dfdd3e92f340411acea4427d701dc7ed26f8"
+
 /-!
 # The integers as normed ring

5cc2dfdd

feat: port Analysis.NormedSpace.Int (#2848)

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

da6451b0

`analysis.normed_space.int` ⟷ `Mathlib.Analysis.NormedSpace.Int`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Renames

Dependencies 10 + 601

analysis.normed_space.int ⟷ Mathlib.Analysis.NormedSpace.Int

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Renames

Dependencies 10 + 601

`analysis.normed_space.int` ⟷ `Mathlib.Analysis.NormedSpace.Int`