ring_theory.witt_vector.compare | 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

168ad7fc

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

9240e8be

bump to nightly-2023-10-21-06

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

a2dc86f8

Diff

@@ -51,7 +51,7 @@ theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
   replace hin := lt_of_le_of_ne hin hpi; clear hpi
   have : (↑p ^ i : TruncatedWittVector p n R) = WittVector.truncate n (↑p ^ i) := by
     rw [RingHom.map_pow, map_natCast]
-  rw [this, ext_iff, not_forall]; clear this
+  rw [this, ext_iff, Classical.not_forall]; clear this
   use⟨i, hin⟩
   rw [WittVector.coeff_truncate, coeff_zero, Fin.val_mk, WittVector.coeff_p_pow]
   haveI : Nontrivial R := CharP.nontrivial_of_char_ne_one hp.1.ne_one

9240e8be

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,9 +3,9 @@ Copyright (c) 2020 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Robert Y. Lewis
 -/
-import Mathbin.RingTheory.WittVector.Truncated
-import Mathbin.RingTheory.WittVector.Identities
-import Mathbin.NumberTheory.Padics.RingHoms
+import RingTheory.WittVector.Truncated
+import RingTheory.WittVector.Identities
+import NumberTheory.Padics.RingHoms
 
 #align_import ring_theory.witt_vector.compare from "leanprover-community/mathlib"@"9240e8be927a0955b9a82c6c85ef499ee3a626b8"

9240e8be

bump to nightly-2023-08-02-01

mathlib commit https://github.com/leanprover-community/mathlib/commit/63721b2c3eba6c325ecf8ae8cca27155a4f6306f

7aca3f15

Diff

@@ -52,7 +52,7 @@ theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
   have : (↑p ^ i : TruncatedWittVector p n R) = WittVector.truncate n (↑p ^ i) := by
     rw [RingHom.map_pow, map_natCast]
   rw [this, ext_iff, not_forall]; clear this
-  use ⟨i, hin⟩
+  use⟨i, hin⟩
   rw [WittVector.coeff_truncate, coeff_zero, Fin.val_mk, WittVector.coeff_p_pow]
   haveI : Nontrivial R := CharP.nontrivial_of_char_ne_one hp.1.ne_one
   exact one_ne_zero

9240e8be

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2020 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Robert Y. Lewis
-
-! This file was ported from Lean 3 source module ring_theory.witt_vector.compare
-! leanprover-community/mathlib commit 9240e8be927a0955b9a82c6c85ef499ee3a626b8
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.RingTheory.WittVector.Truncated
 import Mathbin.RingTheory.WittVector.Identities
 import Mathbin.NumberTheory.Padics.RingHoms
 
+#align_import ring_theory.witt_vector.compare from "leanprover-community/mathlib"@"9240e8be927a0955b9a82c6c85ef499ee3a626b8"
+
 /-!
 
 # Comparison isomorphism between `witt_vector p (zmod p)` and `ℤ_[p]`

9240e8be

bump to nightly-2023-07-01-17

mathlib commit https://github.com/leanprover-community/mathlib/commit/9240e8be927a0955b9a82c6c85ef499ee3a626b8

a0c14df7

Diff

@@ -66,16 +66,16 @@ section Iso
 
 variable (p n) {R}
 
-#print TruncatedWittVector.card_zMod /-
-theorem card_zMod : Fintype.card (TruncatedWittVector p n (ZMod p)) = p ^ n := by
+#print TruncatedWittVector.card_zmod /-
+theorem card_zmod : Fintype.card (TruncatedWittVector p n (ZMod p)) = p ^ n := by
   rw [card, ZMod.card]
-#align truncated_witt_vector.card_zmod TruncatedWittVector.card_zMod
+#align truncated_witt_vector.card_zmod TruncatedWittVector.card_zmod
 -/
 
-#print TruncatedWittVector.charP_zMod /-
-theorem charP_zMod : CharP (TruncatedWittVector p n (ZMod p)) (p ^ n) :=
-  charP_of_prime_pow_injective _ _ _ (card_zMod _ _) (eq_of_le_of_cast_pow_eq_zero p n (ZMod p))
-#align truncated_witt_vector.char_p_zmod TruncatedWittVector.charP_zMod
+#print TruncatedWittVector.charP_zmod /-
+theorem charP_zmod : CharP (TruncatedWittVector p n (ZMod p)) (p ^ n) :=
+  charP_of_prime_pow_injective _ _ _ (card_zmod _ _) (eq_of_le_of_cast_pow_eq_zero p n (ZMod p))
+#align truncated_witt_vector.char_p_zmod TruncatedWittVector.charP_zmod
 -/
 
 attribute [local instance] char_p_zmod
@@ -87,7 +87,7 @@ This isomorphism exists, because `truncated_witt_vector p n (zmod p)` is a finit
 with characteristic and cardinality `p^n`.
 -/
 def zmodEquivTrunc : ZMod (p ^ n) ≃+* TruncatedWittVector p n (ZMod p) :=
-  ZMod.ringEquiv (TruncatedWittVector p n (ZMod p)) (card_zMod _ _)
+  ZMod.ringEquiv (TruncatedWittVector p n (ZMod p)) (card_zmod _ _)
 #align truncated_witt_vector.zmod_equiv_trunc TruncatedWittVector.zmodEquivTrunc
 -/
 
@@ -166,19 +166,19 @@ open TruncatedWittVector
 
 variable (p)
 
-#print WittVector.toZmodPow /-
+#print WittVector.toZModPow /-
 /-- `to_zmod_pow` is a family of compatible ring homs. We get this family by composing
 `truncated_witt_vector.zmod_equiv_trunc` (in right-to-left direction)
 with `witt_vector.truncate`.
 -/
-def toZmodPow (k : ℕ) : 𝕎 (ZMod p) →+* ZMod (p ^ k) :=
+def toZModPow (k : ℕ) : 𝕎 (ZMod p) →+* ZMod (p ^ k) :=
   (zmodEquivTrunc p k).symm.toRingHom.comp (truncate k)
-#align witt_vector.to_zmod_pow WittVector.toZmodPow
+#align witt_vector.to_zmod_pow WittVector.toZModPow
 -/
 
-#print WittVector.toZmodPow_compat /-
-theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
-    (ZMod.castHom (pow_dvd_pow p h) (ZMod (p ^ m))).comp (toZmodPow p n) = toZmodPow p m :=
+#print WittVector.toZModPow_compat /-
+theorem toZModPow_compat (m n : ℕ) (h : m ≤ n) :
+    (ZMod.castHom (pow_dvd_pow p h) (ZMod (p ^ m))).comp (toZModPow p n) = toZModPow p m :=
   calc
     (ZMod.castHom _ (ZMod (p ^ m))).comp ((zmodEquivTrunc p n).symm.toRingHom.comp (truncate n)) =
         ((zmodEquivTrunc p m).symm.toRingHom.comp (TruncatedWittVector.truncate h)).comp
@@ -186,7 +186,7 @@ theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
       by rw [commutes_symm, RingHom.comp_assoc]
     _ = (zmodEquivTrunc p m).symm.toRingHom.comp (truncate m) := by
       rw [RingHom.comp_assoc, truncate_comp_witt_vector_truncate]
-#align witt_vector.to_zmod_pow_compat WittVector.toZmodPow_compat
+#align witt_vector.to_zmod_pow_compat WittVector.toZModPow_compat
 -/
 
 #print WittVector.toPadicInt /-
@@ -194,7 +194,7 @@ theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
 using `padic_int.lift`, the universal property of `ℤ_[p]`.
 -/
 def toPadicInt : 𝕎 (ZMod p) →+* ℤ_[p] :=
-  PadicInt.lift <| toZmodPow_compat p
+  PadicInt.lift <| toZModPow_compat p
 #align witt_vector.to_padic_int WittVector.toPadicInt
 -/

9240e8be

bump to nightly-2023-06-30-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/9240e8be927a0955b9a82c6c85ef499ee3a626b8

397a8f48

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Robert Y. Lewis
 
 ! This file was ported from Lean 3 source module ring_theory.witt_vector.compare
-! leanprover-community/mathlib commit 168ad7fc5d8173ad38be9767a22d50b8ecf1cd00
+! leanprover-community/mathlib commit 9240e8be927a0955b9a82c6c85ef499ee3a626b8
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -16,6 +16,9 @@ import Mathbin.NumberTheory.Padics.RingHoms
 
 # Comparison isomorphism between `witt_vector p (zmod p)` and `ℤ_[p]`
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We construct a ring isomorphism between `witt_vector p (zmod p)` and `ℤ_[p]`.
 This isomorphism follows from the fact that both satisfy the universal property
 of the inverse limit of `zmod (p^n)`.

168ad7fc

bump to nightly-2023-06-28-21

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

a99847f5

Diff

@@ -43,6 +43,7 @@ namespace TruncatedWittVector
 
 variable (p) (n : ℕ) (R : Type _) [CommRing R]
 
+#print TruncatedWittVector.eq_of_le_of_cast_pow_eq_zero /-
 theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
     (hpi : (p ^ i : TruncatedWittVector p n R) = 0) : i = n :=
   by
@@ -56,21 +57,27 @@ theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
   haveI : Nontrivial R := CharP.nontrivial_of_char_ne_one hp.1.ne_one
   exact one_ne_zero
 #align truncated_witt_vector.eq_of_le_of_cast_pow_eq_zero TruncatedWittVector.eq_of_le_of_cast_pow_eq_zero
+-/
 
 section Iso
 
 variable (p n) {R}
 
+#print TruncatedWittVector.card_zMod /-
 theorem card_zMod : Fintype.card (TruncatedWittVector p n (ZMod p)) = p ^ n := by
   rw [card, ZMod.card]
 #align truncated_witt_vector.card_zmod TruncatedWittVector.card_zMod
+-/
 
+#print TruncatedWittVector.charP_zMod /-
 theorem charP_zMod : CharP (TruncatedWittVector p n (ZMod p)) (p ^ n) :=
   charP_of_prime_pow_injective _ _ _ (card_zMod _ _) (eq_of_le_of_cast_pow_eq_zero p n (ZMod p))
 #align truncated_witt_vector.char_p_zmod TruncatedWittVector.charP_zMod
+-/
 
 attribute [local instance] char_p_zmod
 
+#print TruncatedWittVector.zmodEquivTrunc /-
 /-- The unique isomorphism between `zmod p^n` and `truncated_witt_vector p n (zmod p)`.
 
 This isomorphism exists, because `truncated_witt_vector p n (zmod p)` is a finite ring
@@ -79,12 +86,16 @@ with characteristic and cardinality `p^n`.
 def zmodEquivTrunc : ZMod (p ^ n) ≃+* TruncatedWittVector p n (ZMod p) :=
   ZMod.ringEquiv (TruncatedWittVector p n (ZMod p)) (card_zMod _ _)
 #align truncated_witt_vector.zmod_equiv_trunc TruncatedWittVector.zmodEquivTrunc
+-/
 
+#print TruncatedWittVector.zmodEquivTrunc_apply /-
 theorem zmodEquivTrunc_apply {x : ZMod (p ^ n)} :
     zmodEquivTrunc p n x = ZMod.castHom (by rfl) (TruncatedWittVector p n (ZMod p)) x :=
   rfl
 #align truncated_witt_vector.zmod_equiv_trunc_apply TruncatedWittVector.zmodEquivTrunc_apply
+-/
 
+#print TruncatedWittVector.commutes /-
 /-- The following diagram commutes:
 ```text
           zmod (p^n) ----------------------------> zmod (p^m)
@@ -102,12 +113,16 @@ theorem commutes {m : ℕ} (hm : n ≤ m) :
       (zmodEquivTrunc p n).toRingHom.comp (ZMod.castHom (pow_dvd_pow p hm) _) :=
   RingHom.ext_zmod _ _
 #align truncated_witt_vector.commutes TruncatedWittVector.commutes
+-/
 
+#print TruncatedWittVector.commutes' /-
 theorem commutes' {m : ℕ} (hm : n ≤ m) (x : ZMod (p ^ m)) :
     truncate hm (zmodEquivTrunc p m x) = zmodEquivTrunc p n (ZMod.castHom (pow_dvd_pow p hm) _ x) :=
   show (truncate hm).comp (zmodEquivTrunc p m).toRingHom x = _ by rw [commutes _ _ hm] <;> rfl
 #align truncated_witt_vector.commutes' TruncatedWittVector.commutes'
+-/
 
+#print TruncatedWittVector.commutes_symm' /-
 theorem commutes_symm' {m : ℕ} (hm : n ≤ m) (x : TruncatedWittVector p m (ZMod p)) :
     (zmodEquivTrunc p n).symm (truncate hm x) =
       ZMod.castHom (pow_dvd_pow p hm) _ ((zmodEquivTrunc p m).symm x) :=
@@ -116,7 +131,9 @@ theorem commutes_symm' {m : ℕ} (hm : n ≤ m) (x : TruncatedWittVector p m (ZM
   rw [← commutes']
   simp
 #align truncated_witt_vector.commutes_symm' TruncatedWittVector.commutes_symm'
+-/
 
+#print TruncatedWittVector.commutes_symm /-
 /-- The following diagram commutes:
 ```text
 truncated_witt_vector p n (zmod p) ----> truncated_witt_vector p m (zmod p)
@@ -134,6 +151,7 @@ theorem commutes_symm {m : ℕ} (hm : n ≤ m) :
       (ZMod.castHom (pow_dvd_pow p hm) _).comp (zmodEquivTrunc p m).symm.toRingHom :=
   by ext <;> apply commutes_symm'
 #align truncated_witt_vector.commutes_symm TruncatedWittVector.commutes_symm
+-/
 
 end Iso
 
@@ -145,6 +163,7 @@ open TruncatedWittVector
 
 variable (p)
 
+#print WittVector.toZmodPow /-
 /-- `to_zmod_pow` is a family of compatible ring homs. We get this family by composing
 `truncated_witt_vector.zmod_equiv_trunc` (in right-to-left direction)
 with `witt_vector.truncate`.
@@ -152,7 +171,9 @@ with `witt_vector.truncate`.
 def toZmodPow (k : ℕ) : 𝕎 (ZMod p) →+* ZMod (p ^ k) :=
   (zmodEquivTrunc p k).symm.toRingHom.comp (truncate k)
 #align witt_vector.to_zmod_pow WittVector.toZmodPow
+-/
 
+#print WittVector.toZmodPow_compat /-
 theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
     (ZMod.castHom (pow_dvd_pow p h) (ZMod (p ^ m))).comp (toZmodPow p n) = toZmodPow p m :=
   calc
@@ -163,21 +184,27 @@ theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
     _ = (zmodEquivTrunc p m).symm.toRingHom.comp (truncate m) := by
       rw [RingHom.comp_assoc, truncate_comp_witt_vector_truncate]
 #align witt_vector.to_zmod_pow_compat WittVector.toZmodPow_compat
+-/
 
+#print WittVector.toPadicInt /-
 /-- `to_padic_int` lifts `to_zmod_pow : 𝕎 (zmod p) →+* zmod (p ^ k)` to a ring hom to `ℤ_[p]`
 using `padic_int.lift`, the universal property of `ℤ_[p]`.
 -/
 def toPadicInt : 𝕎 (ZMod p) →+* ℤ_[p] :=
   PadicInt.lift <| toZmodPow_compat p
 #align witt_vector.to_padic_int WittVector.toPadicInt
+-/
 
+#print WittVector.zmodEquivTrunc_compat /-
 theorem zmodEquivTrunc_compat (k₁ k₂ : ℕ) (hk : k₁ ≤ k₂) :
     (TruncatedWittVector.truncate hk).comp
         ((zmodEquivTrunc p k₂).toRingHom.comp (PadicInt.toZModPow k₂)) =
       (zmodEquivTrunc p k₁).toRingHom.comp (PadicInt.toZModPow k₁) :=
   by rw [← RingHom.comp_assoc, commutes, RingHom.comp_assoc, PadicInt.zmod_cast_comp_toZModPow]
 #align witt_vector.zmod_equiv_trunc_compat WittVector.zmodEquivTrunc_compat
+-/
 
+#print WittVector.fromPadicInt /-
 /-- `from_padic_int` uses `witt_vector.lift` to lift `truncated_witt_vector.zmod_equiv_trunc`
 composed with `padic_int.to_zmod_pow` to a ring hom `ℤ_[p] →+* 𝕎 (zmod p)`.
 -/
@@ -185,7 +212,9 @@ def fromPadicInt : ℤ_[p] →+* 𝕎 (ZMod p) :=
   (WittVector.lift fun k => (zmodEquivTrunc p k).toRingHom.comp (PadicInt.toZModPow k)) <|
     zmodEquivTrunc_compat _
 #align witt_vector.from_padic_int WittVector.fromPadicInt
+-/
 
+#print WittVector.toPadicInt_comp_fromPadicInt /-
 theorem toPadicInt_comp_fromPadicInt : (toPadicInt p).comp (fromPadicInt p) = RingHom.id ℤ_[p] :=
   by
   rw [← PadicInt.toZModPow_eq_iff_ext]
@@ -195,12 +224,16 @@ theorem toPadicInt_comp_fromPadicInt : (toPadicInt p).comp (fromPadicInt p) = Ri
   rw [RingHom.comp_assoc, truncate_comp_lift, ← RingHom.comp_assoc]
   simp only [RingEquiv.symm_toRingHom_comp_toRingHom, RingHom.id_comp]
 #align witt_vector.to_padic_int_comp_from_padic_int WittVector.toPadicInt_comp_fromPadicInt
+-/
 
+#print WittVector.toPadicInt_comp_fromPadicInt_ext /-
 theorem toPadicInt_comp_fromPadicInt_ext (x) :
     (toPadicInt p).comp (fromPadicInt p) x = RingHom.id ℤ_[p] x := by
   rw [to_padic_int_comp_from_padic_int]
 #align witt_vector.to_padic_int_comp_from_padic_int_ext WittVector.toPadicInt_comp_fromPadicInt_ext
+-/
 
+#print WittVector.fromPadicInt_comp_toPadicInt /-
 theorem fromPadicInt_comp_toPadicInt :
     (fromPadicInt p).comp (toPadicInt p) = RingHom.id (𝕎 (ZMod p)) :=
   by
@@ -210,12 +243,16 @@ theorem fromPadicInt_comp_toPadicInt :
   simp only [to_padic_int, to_zmod_pow, RingHom.comp_id, PadicInt.lift_spec, RingHom.id_comp, ←
     RingHom.comp_assoc, RingEquiv.toRingHom_comp_symm_toRingHom]
 #align witt_vector.from_padic_int_comp_to_padic_int WittVector.fromPadicInt_comp_toPadicInt
+-/
 
+#print WittVector.fromPadicInt_comp_toPadicInt_ext /-
 theorem fromPadicInt_comp_toPadicInt_ext (x) :
     (fromPadicInt p).comp (toPadicInt p) x = RingHom.id (𝕎 (ZMod p)) x := by
   rw [from_padic_int_comp_to_padic_int]
 #align witt_vector.from_padic_int_comp_to_padic_int_ext WittVector.fromPadicInt_comp_toPadicInt_ext
+-/
 
+#print WittVector.equiv /-
 /-- The ring of Witt vectors over `zmod p` is isomorphic to the ring of `p`-adic integers. This
 equivalence is witnessed by `witt_vector.to_padic_int` with inverse `witt_vector.from_padic_int`.
 -/
@@ -227,6 +264,7 @@ def equiv : 𝕎 (ZMod p) ≃+* ℤ_[p] where
   map_mul' := RingHom.map_mul _
   map_add' := RingHom.map_add _
 #align witt_vector.equiv WittVector.equiv
+-/
 
 end WittVector

168ad7fc

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -37,11 +37,8 @@ noncomputable section
 
 variable {p : ℕ} [hp : Fact p.Prime]
 
--- mathport name: expr𝕎
 local notation "𝕎" => WittVector p
 
-include hp
-
 namespace TruncatedWittVector
 
 variable (p) (n : ℕ) (R : Type _) [CommRing R]

168ad7fc

bump to nightly-2023-06-09-07

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

16afdc39

Diff

@@ -165,7 +165,6 @@ theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
       by rw [commutes_symm, RingHom.comp_assoc]
     _ = (zmodEquivTrunc p m).symm.toRingHom.comp (truncate m) := by
       rw [RingHom.comp_assoc, truncate_comp_witt_vector_truncate]
-    
 #align witt_vector.to_zmod_pow_compat WittVector.toZmodPow_compat
 
 /-- `to_padic_int` lifts `to_zmod_pow : 𝕎 (zmod p) →+* zmod (p ^ k)` to a ring hom to `ℤ_[p]`

168ad7fc

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -50,12 +50,10 @@ theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
     (hpi : (p ^ i : TruncatedWittVector p n R) = 0) : i = n :=
   by
   contrapose! hpi
-  replace hin := lt_of_le_of_ne hin hpi
-  clear hpi
+  replace hin := lt_of_le_of_ne hin hpi; clear hpi
   have : (↑p ^ i : TruncatedWittVector p n R) = WittVector.truncate n (↑p ^ i) := by
     rw [RingHom.map_pow, map_natCast]
-  rw [this, ext_iff, not_forall]
-  clear this
+  rw [this, ext_iff, not_forall]; clear this
   use ⟨i, hin⟩
   rw [WittVector.coeff_truncate, coeff_zero, Fin.val_mk, WittVector.coeff_p_pow]
   haveI : Nontrivial R := CharP.nontrivial_of_char_ne_one hp.1.ne_one

168ad7fc

bump to nightly-2023-05-28-03

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

6c6011cf

Diff

@@ -179,22 +179,22 @@ def toPadicInt : 𝕎 (ZMod p) →+* ℤ_[p] :=
 
 theorem zmodEquivTrunc_compat (k₁ k₂ : ℕ) (hk : k₁ ≤ k₂) :
     (TruncatedWittVector.truncate hk).comp
-        ((zmodEquivTrunc p k₂).toRingHom.comp (PadicInt.toZmodPow k₂)) =
-      (zmodEquivTrunc p k₁).toRingHom.comp (PadicInt.toZmodPow k₁) :=
-  by rw [← RingHom.comp_assoc, commutes, RingHom.comp_assoc, PadicInt.zMod_cast_comp_toZmodPow]
+        ((zmodEquivTrunc p k₂).toRingHom.comp (PadicInt.toZModPow k₂)) =
+      (zmodEquivTrunc p k₁).toRingHom.comp (PadicInt.toZModPow k₁) :=
+  by rw [← RingHom.comp_assoc, commutes, RingHom.comp_assoc, PadicInt.zmod_cast_comp_toZModPow]
 #align witt_vector.zmod_equiv_trunc_compat WittVector.zmodEquivTrunc_compat
 
 /-- `from_padic_int` uses `witt_vector.lift` to lift `truncated_witt_vector.zmod_equiv_trunc`
 composed with `padic_int.to_zmod_pow` to a ring hom `ℤ_[p] →+* 𝕎 (zmod p)`.
 -/
 def fromPadicInt : ℤ_[p] →+* 𝕎 (ZMod p) :=
-  (WittVector.lift fun k => (zmodEquivTrunc p k).toRingHom.comp (PadicInt.toZmodPow k)) <|
+  (WittVector.lift fun k => (zmodEquivTrunc p k).toRingHom.comp (PadicInt.toZModPow k)) <|
     zmodEquivTrunc_compat _
 #align witt_vector.from_padic_int WittVector.fromPadicInt
 
 theorem toPadicInt_comp_fromPadicInt : (toPadicInt p).comp (fromPadicInt p) = RingHom.id ℤ_[p] :=
   by
-  rw [← PadicInt.toZmodPow_eq_iff_ext]
+  rw [← PadicInt.toZModPow_eq_iff_ext]
   intro n
   rw [← RingHom.comp_assoc, to_padic_int, PadicInt.lift_spec]
   simp only [from_padic_int, to_zmod_pow, RingHom.comp_id]

168ad7fc

bump to nightly-2023-03-18-20

mathlib commit https://github.com/leanprover-community/mathlib/commit/02ba8949f486ebecf93fe7460f1ed0564b5e442c

1c3193ff

Diff

@@ -105,7 +105,7 @@ and the horizontal arrow at the bottom is `truncated_witt_vector.truncate`.
 theorem commutes {m : ℕ} (hm : n ≤ m) :
     (truncate hm).comp (zmodEquivTrunc p m).toRingHom =
       (zmodEquivTrunc p n).toRingHom.comp (ZMod.castHom (pow_dvd_pow p hm) _) :=
-  RingHom.ext_zMod _ _
+  RingHom.ext_zmod _ _
 #align truncated_witt_vector.commutes TruncatedWittVector.commutes
 
 theorem commutes' {m : ℕ} (hm : n ≤ m) (x : ZMod (p ^ m)) :

168ad7fc

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

168ad7fc

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

@@ -38,7 +38,7 @@ local notation "𝕎" => WittVector p
 
 namespace TruncatedWittVector
 
-variable (p) (n : ℕ) (R : Type _) [CommRing R]
+variable (p) (n : ℕ) (R : Type*) [CommRing R]
 
 theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
     (hpi : (p : TruncatedWittVector p n R) ^ i = 0) : i = n := by

168ad7fc

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

depends on: #5966

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

89aa3a3b

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2020 Johan Commelin. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Robert Y. Lewis
-
-! This file was ported from Lean 3 source module ring_theory.witt_vector.compare
-! leanprover-community/mathlib commit 168ad7fc5d8173ad38be9767a22d50b8ecf1cd00
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.RingTheory.WittVector.Truncated
 import Mathlib.RingTheory.WittVector.Identities
 import Mathlib.NumberTheory.Padics.RingHoms
 
+#align_import ring_theory.witt_vector.compare from "leanprover-community/mathlib"@"168ad7fc5d8173ad38be9767a22d50b8ecf1cd00"
+
 /-!
 
 # Comparison isomorphism between `WittVector p (ZMod p)` and `ℤ_[p]`

168ad7fc

chore: remove occurrences of semicolon after space (#5713)

This is the second half of the changes originally in #5699, removing all occurrences of ; after a space and implementing a linter rule to enforce it.

In most cases this 2-character substring has a space after it, so the following command was run first:

find . -type f -name "*.lean" -exec sed -i -E 's/ ; /; /g' {} \;

The remaining cases were few enough in number that they were done manually.

c795bd35

Diff

@@ -104,7 +104,7 @@ theorem commutes {m : ℕ} (hm : n ≤ m) :
 
 theorem commutes' {m : ℕ} (hm : n ≤ m) (x : ZMod (p ^ m)) :
     truncate hm (zmodEquivTrunc p m x) = zmodEquivTrunc p n (ZMod.castHom (pow_dvd_pow p hm) _ x) :=
-  show (truncate hm).comp (zmodEquivTrunc p m).toRingHom x = _ by rw [commutes _ _ hm] ; rfl
+  show (truncate hm).comp (zmodEquivTrunc p m).toRingHom x = _ by rw [commutes _ _ hm]; rfl
 #align truncated_witt_vector.commutes' TruncatedWittVector.commutes'
 
 theorem commutes_symm' {m : ℕ} (hm : n ≤ m) (x : TruncatedWittVector p m (ZMod p)) :
@@ -130,7 +130,7 @@ and the horizontal arrow at the bottom is `TruncatedWittVector.truncate`.
 theorem commutes_symm {m : ℕ} (hm : n ≤ m) :
     (zmodEquivTrunc p n).symm.toRingHom.comp (truncate hm) =
       (ZMod.castHom (pow_dvd_pow p hm) _).comp (zmodEquivTrunc p m).symm.toRingHom :=
-  by ext ; apply commutes_symm'
+  by ext; apply commutes_symm'
 #align truncated_witt_vector.commutes_symm TruncatedWittVector.commutes_symm
 
 end Iso

168ad7fc

chore: tidy various files (#5628)

3282e2f7

Diff

@@ -14,15 +14,15 @@ import Mathlib.NumberTheory.Padics.RingHoms
 
 /-!
 
-# Comparison isomorphism between `WittVector p (zmod p)` and `ℤ_[p]`
+# Comparison isomorphism between `WittVector p (ZMod p)` and `ℤ_[p]`
 
-We construct a ring isomorphism between `WittVector p (zmod p)` and `ℤ_[p]`.
+We construct a ring isomorphism between `WittVector p (ZMod p)` and `ℤ_[p]`.
 This isomorphism follows from the fact that both satisfy the universal property
-of the inverse limit of `zmod (p^n)`.
+of the inverse limit of `ZMod (p^n)`.
 
 ## Main declarations
 
-* `WittVector.toZmodPow`: a family of compatible ring homs `𝕎 (zmod p) → zmod (p^k)`
+* `WittVector.toZModPow`: a family of compatible ring homs `𝕎 (ZMod p) → ZMod (p^k)`
 * `WittVector.equiv`: the isomorphism
 
 ## References
@@ -44,41 +44,39 @@ namespace TruncatedWittVector
 variable (p) (n : ℕ) (R : Type _) [CommRing R]
 
 theorem eq_of_le_of_cast_pow_eq_zero [CharP R p] (i : ℕ) (hin : i ≤ n)
-    (hpi : ((p ^ i : ℕ) : TruncatedWittVector p n R) = 0) : i = n := by
+    (hpi : (p : TruncatedWittVector p n R) ^ i = 0) : i = n := by
   contrapose! hpi
   replace hin := lt_of_le_of_ne hin hpi; clear hpi
-  have : (p ^ i : TruncatedWittVector p n R) = WittVector.truncate n ((p : 𝕎 R) ^ i) := by
-    rw [RingHom.map_pow, map_natCast, Nat.cast_pow]
+  have : (p : TruncatedWittVector p n R) ^ i = WittVector.truncate n ((p : 𝕎 R) ^ i) := by
+    rw [RingHom.map_pow, map_natCast]
   rw [this, ne_eq, ext_iff, not_forall]; clear this
   use ⟨i, hin⟩
-  --PORTING NOTE: The coercion on WittVector.coeff_p_pow does not agree with the Lean 3 version
-  rw [WittVector.coeff_truncate, coeff_zero, Fin.val_mk, ← Nat.cast_pow, WittVector.coeff_p_pow]
+  rw [WittVector.coeff_truncate, coeff_zero, Fin.val_mk, WittVector.coeff_p_pow]
   haveI : Nontrivial R := CharP.nontrivial_of_char_ne_one hp.1.ne_one
   exact one_ne_zero
-#align truncated_witt_vector.eq_of_le_of_cast_pow_eq_zero
-  TruncatedWittVector.eq_of_le_of_cast_pow_eq_zero
+#align truncated_witt_vector.eq_of_le_of_cast_pow_eq_zero TruncatedWittVector.eq_of_le_of_cast_pow_eq_zero
 
 section Iso
 
 variable {R}
 
-theorem card_zMod : Fintype.card (TruncatedWittVector p n (ZMod p)) = p ^ n := by
+theorem card_zmod : Fintype.card (TruncatedWittVector p n (ZMod p)) = p ^ n := by
   rw [card, ZMod.card]
-#align truncated_witt_vector.card_zmod TruncatedWittVector.card_zMod
+#align truncated_witt_vector.card_zmod TruncatedWittVector.card_zmod
 
-theorem charP_zMod : CharP (TruncatedWittVector p n (ZMod p)) (p ^ n) :=
-  charP_of_prime_pow_injective _ _ _ (card_zMod _ _) (eq_of_le_of_cast_pow_eq_zero p n (ZMod p))
-#align truncated_witt_vector.char_p_zmod TruncatedWittVector.charP_zMod
+theorem charP_zmod : CharP (TruncatedWittVector p n (ZMod p)) (p ^ n) :=
+  charP_of_prime_pow_injective _ _ _ (card_zmod _ _) (eq_of_le_of_cast_pow_eq_zero p n (ZMod p))
+#align truncated_witt_vector.char_p_zmod TruncatedWittVector.charP_zmod
 
-attribute [local instance] charP_zMod
+attribute [local instance] charP_zmod
 
-/-- The unique isomorphism between `zmod p^n` and `TruncatedWittVector p n (zmod p)`.
+/-- The unique isomorphism between `ZMod p^n` and `TruncatedWittVector p n (ZMod p)`.
 
-This isomorphism exists, because `TruncatedWittVector p n (zmod p)` is a finite ring
+This isomorphism exists, because `TruncatedWittVector p n (ZMod p)` is a finite ring
 with characteristic and cardinality `p^n`.
 -/
 def zmodEquivTrunc : ZMod (p ^ n) ≃+* TruncatedWittVector p n (ZMod p) :=
-  ZMod.ringEquiv (TruncatedWittVector p n (ZMod p)) (card_zMod _ _)
+  ZMod.ringEquiv (TruncatedWittVector p n (ZMod p)) (card_zmod _ _)
 #align truncated_witt_vector.zmod_equiv_trunc TruncatedWittVector.zmodEquivTrunc
 
 theorem zmodEquivTrunc_apply {x : ZMod (p ^ n)} :
@@ -145,28 +143,28 @@ open TruncatedWittVector
 
 variable (p)
 
-/-- `toZmodPow` is a family of compatible ring homs. We get this family by composing
+/-- `toZModPow` is a family of compatible ring homs. We get this family by composing
 `TruncatedWittVector.zmodEquivTrunc` (in right-to-left direction) with `WittVector.truncate`. -/
-def toZmodPow (k : ℕ) : 𝕎 (ZMod p) →+* ZMod (p ^ k) :=
+def toZModPow (k : ℕ) : 𝕎 (ZMod p) →+* ZMod (p ^ k) :=
   (zmodEquivTrunc p k).symm.toRingHom.comp (truncate k)
-#align witt_vector.to_zmod_pow WittVector.toZmodPow
+#align witt_vector.to_zmod_pow WittVector.toZModPow
 
-theorem toZmodPow_compat (m n : ℕ) (h : m ≤ n) :
-    (ZMod.castHom (pow_dvd_pow p h) (ZMod (p ^ m))).comp (toZmodPow p n) = toZmodPow p m :=
+theorem toZModPow_compat (m n : ℕ) (h : m ≤ n) :
+    (ZMod.castHom (pow_dvd_pow p h) (ZMod (p ^ m))).comp (toZModPow p n) = toZModPow p m :=
   calc
-    (ZMod.castHom _ (ZMod (p ^ m))).comp ((zmodEquivTrunc p n).symm.toRingHom.comp (truncate n)) =
-        ((zmodEquivTrunc p m).symm.toRingHom.comp (TruncatedWittVector.truncate h)).comp
-          (truncate n) :=
-      by rw [commutes_symm, RingHom.comp_assoc]
+    (ZMod.castHom _ (ZMod (p ^ m))).comp ((zmodEquivTrunc p n).symm.toRingHom.comp (truncate n))
+    _ = ((zmodEquivTrunc p m).symm.toRingHom.comp (TruncatedWittVector.truncate h)).comp
+          (truncate n) := by
+      rw [commutes_symm, RingHom.comp_assoc]
     _ = (zmodEquivTrunc p m).symm.toRingHom.comp (truncate m) := by
       rw [RingHom.comp_assoc, truncate_comp_wittVector_truncate]
-#align witt_vector.to_zmod_pow_compat WittVector.toZmodPow_compat
+#align witt_vector.to_zmod_pow_compat WittVector.toZModPow_compat
 
-/-- `toPadicInt` lifts `toZmodPow : 𝕎 (zmod p) →+* zmod (p ^ k)` to a ring hom to `ℤ_[p]`
+/-- `toPadicInt` lifts `toZModPow : 𝕎 (ZMod p) →+* ZMod (p ^ k)` to a ring hom to `ℤ_[p]`
 using `PadicInt.lift`, the universal property of `ℤ_[p]`.
 -/
 def toPadicInt : 𝕎 (ZMod p) →+* ℤ_[p] :=
-  PadicInt.lift <| toZmodPow_compat p
+  PadicInt.lift <| toZModPow_compat p
 #align witt_vector.to_padic_int WittVector.toPadicInt
 
 theorem zmodEquivTrunc_compat (k₁ k₂ : ℕ) (hk : k₁ ≤ k₂) :
@@ -178,7 +176,7 @@ theorem zmodEquivTrunc_compat (k₁ k₂ : ℕ) (hk : k₁ ≤ k₂) :
 #align witt_vector.zmod_equiv_trunc_compat WittVector.zmodEquivTrunc_compat
 
 /-- `fromPadicInt` uses `WittVector.lift` to lift `TruncatedWittVector.zmodEquivTrunc`
-composed with `PadicInt.toZmodPow` to a ring hom `ℤ_[p] →+* 𝕎 (zmod p)`.
+composed with `PadicInt.toZModPow` to a ring hom `ℤ_[p] →+* 𝕎 (ZMod p)`.
 -/
 def fromPadicInt : ℤ_[p] →+* 𝕎 (ZMod p) :=
   (WittVector.lift fun k => (zmodEquivTrunc p k).toRingHom.comp (PadicInt.toZModPow k)) <|
@@ -189,7 +187,7 @@ theorem toPadicInt_comp_fromPadicInt : (toPadicInt p).comp (fromPadicInt p) = Ri
   rw [← PadicInt.toZModPow_eq_iff_ext]
   intro n
   rw [← RingHom.comp_assoc, toPadicInt, PadicInt.lift_spec]
-  simp only [fromPadicInt, toZmodPow, RingHom.comp_id]
+  simp only [fromPadicInt, toZModPow, RingHom.comp_id]
   rw [RingHom.comp_assoc, truncate_comp_lift, ← RingHom.comp_assoc]
   simp only [RingEquiv.symm_toRingHom_comp_toRingHom, RingHom.id_comp]
 #align witt_vector.to_padic_int_comp_from_padic_int WittVector.toPadicInt_comp_fromPadicInt
@@ -204,7 +202,7 @@ theorem fromPadicInt_comp_toPadicInt :
   apply WittVector.hom_ext
   intro n
   rw [fromPadicInt, ← RingHom.comp_assoc, truncate_comp_lift, RingHom.comp_assoc]
-  simp only [toPadicInt, toZmodPow, RingHom.comp_id, PadicInt.lift_spec, RingHom.id_comp, ←
+  simp only [toPadicInt, toZModPow, RingHom.comp_id, PadicInt.lift_spec, RingHom.id_comp, ←
     RingHom.comp_assoc, RingEquiv.toRingHom_comp_symm_toRingHom]
 #align witt_vector.from_padic_int_comp_to_padic_int WittVector.fromPadicInt_comp_toPadicInt

168ad7fc

feat: port ring theory.witt_vector.compare (#5555)

f90c0b29

`ring_theory.witt_vector.compare` ⟷ `Mathlib.RingTheory.WittVector.Compare`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 819

ring_theory.witt_vector.compare ⟷ Mathlib.RingTheory.WittVector.Compare

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 819

`ring_theory.witt_vector.compare` ⟷ `Mathlib.RingTheory.WittVector.Compare`