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

acbe099c

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

9240e8be

bump to nightly-2024-04-19-08

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

a9e81450

Diff

@@ -336,16 +336,16 @@ theorem truncateFun_pow (x : 𝕎 R) (m : ℕ) : truncateFun n (x ^ m) = truncat
 #align witt_vector.truncate_fun_pow WittVector.truncateFun_pow
 -/
 
-#print WittVector.truncateFun_nat_cast /-
-theorem truncateFun_nat_cast (m : ℕ) : truncateFun n (m : 𝕎 R) = m :=
+#print WittVector.truncateFun_natCast /-
+theorem truncateFun_natCast (m : ℕ) : truncateFun n (m : 𝕎 R) = m :=
   rfl
-#align witt_vector.truncate_fun_nat_cast WittVector.truncateFun_nat_cast
+#align witt_vector.truncate_fun_nat_cast WittVector.truncateFun_natCast
 -/
 
-#print WittVector.truncateFun_int_cast /-
-theorem truncateFun_int_cast (m : ℤ) : truncateFun n (m : 𝕎 R) = m :=
+#print WittVector.truncateFun_intCast /-
+theorem truncateFun_intCast (m : ℤ) : truncateFun n (m : 𝕎 R) = m :=
   rfl
-#align witt_vector.truncate_fun_int_cast WittVector.truncateFun_int_cast
+#align witt_vector.truncate_fun_int_cast WittVector.truncateFun_intCast
 -/
 
 end WittVector
@@ -361,8 +361,8 @@ variable [CommRing R]
 instance : CommRing (TruncatedWittVector p n R) :=
   (truncateFun_surjective p n R).CommRing _ (truncateFun_zero p n R) (truncateFun_one p n R)
     (truncateFun_add n) (truncateFun_mul n) (truncateFun_neg n) (truncateFun_sub n)
-    (truncateFun_nsmul n) (truncateFun_zsmul n) (truncateFun_pow n) (truncateFun_nat_cast n)
-    (truncateFun_int_cast n)
+    (truncateFun_nsmul n) (truncateFun_zsmul n) (truncateFun_pow n) (truncateFun_natCast n)
+    (truncateFun_intCast n)
 
 end TruncatedWittVector

9240e8be

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -142,7 +142,7 @@ theorem out_injective : Injective (@out p n R _) :=
   by
   intro x y h
   ext i
-  rw [WittVector.ext_iff] at h 
+  rw [WittVector.ext_iff] at h
   simpa only [coeff_out] using h ↑i
 #align truncated_witt_vector.out_injective TruncatedWittVector.out_injective
 -/

9240e8be

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2020 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.InitTail
+import RingTheory.WittVector.InitTail
 
 #align_import ring_theory.witt_vector.truncated from "leanprover-community/mathlib"@"9240e8be927a0955b9a82c6c85ef499ee3a626b8"
 
@@ -258,7 +258,7 @@ theorem coeff_zero (i : Fin n) : (0 : TruncatedWittVector p n R).coeff i = 0 :=
 
 end TruncatedWittVector
 
-/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:337:4: warning: unsupported (TODO): `[tacs] -/
 /-- A macro tactic used to prove that `truncate_fun` respects ring operations. -/
 unsafe def tactic.interactive.witt_truncate_fun_tac : tactic Unit :=
   sorry

9240e8be

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2020 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.truncated
-! 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.InitTail
 
+#align_import ring_theory.witt_vector.truncated from "leanprover-community/mathlib"@"9240e8be927a0955b9a82c6c85ef499ee3a626b8"
+
 /-!
 
 # Truncated Witt vectors

9240e8be

bump to nightly-2023-07-16-17

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

6db63fa6

Diff

@@ -495,7 +495,7 @@ theorem truncate_surjective {m : ℕ} (hm : n ≤ m) : Surjective (@truncate p _
 #print TruncatedWittVector.coeff_truncate /-
 @[simp]
 theorem coeff_truncate {m : ℕ} (hm : n ≤ m) (i : Fin n) (x : TruncatedWittVector p m R) :
-    (truncate hm x).coeff i = x.coeff (Fin.castLE hm i) :=
+    (truncate hm x).coeff i = x.coeff (Fin.castLEEmb hm i) :=
   by
   obtain ⟨y, rfl⟩ := WittVector.truncate_surjective p _ _ x
   simp only [truncate_witt_vector_truncate, WittVector.coeff_truncate, Fin.coe_castLE]

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.truncated
-! leanprover-community/mathlib commit acbe099ced8be9c9754d62860110295cde0d7181
+! leanprover-community/mathlib commit 9240e8be927a0955b9a82c6c85ef499ee3a626b8
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.RingTheory.WittVector.InitTail
 
 # Truncated Witt vectors
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 The ring of truncated Witt vectors (of length `n`) is a quotient of the ring of Witt vectors.
 It retains the first `n` coefficients of each Witt vector.
 In this file, we set up the basic quotient API for this ring.

acbe099c

bump to nightly-2023-06-28-15

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

bf9f9bdc

Diff

@@ -48,6 +48,7 @@ variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) (R : Type _)
 
 local notation "𝕎" => WittVector p
 
+#print TruncatedWittVector /-
 -- type as `\bbW`
 /-- A truncated Witt vector over `R` is a vector of elements of `R`,
 i.e., the first `n` coefficients of a Witt vector.
@@ -64,6 +65,7 @@ equal as types but will have different ring operations.)
 def TruncatedWittVector (p : ℕ) (n : ℕ) (R : Type _) :=
   Fin n → R
 #align truncated_witt_vector TruncatedWittVector
+-/
 
 instance (p n : ℕ) (R : Type _) [Inhabited R] : Inhabited (TruncatedWittVector p n R) :=
   ⟨fun _ => default⟩
@@ -74,51 +76,68 @@ namespace TruncatedWittVector
 
 variable (p)
 
+#print TruncatedWittVector.mk /-
 /-- Create a `truncated_witt_vector` from a vector `x`. -/
 def mk (x : Fin n → R) : TruncatedWittVector p n R :=
   x
 #align truncated_witt_vector.mk TruncatedWittVector.mk
+-/
 
 variable {p}
 
+#print TruncatedWittVector.coeff /-
 /-- `x.coeff i` is the `i`th entry of `x`. -/
 def coeff (i : Fin n) (x : TruncatedWittVector p n R) : R :=
   x i
 #align truncated_witt_vector.coeff TruncatedWittVector.coeff
+-/
 
+#print TruncatedWittVector.ext /-
 @[ext]
 theorem ext {x y : TruncatedWittVector p n R} (h : ∀ i, x.coeff i = y.coeff i) : x = y :=
   funext h
 #align truncated_witt_vector.ext TruncatedWittVector.ext
+-/
 
+#print TruncatedWittVector.ext_iff /-
 theorem ext_iff {x y : TruncatedWittVector p n R} : x = y ↔ ∀ i, x.coeff i = y.coeff i :=
   ⟨fun h i => by rw [h], ext⟩
 #align truncated_witt_vector.ext_iff TruncatedWittVector.ext_iff
+-/
 
+#print TruncatedWittVector.coeff_mk /-
 @[simp]
 theorem coeff_mk (x : Fin n → R) (i : Fin n) : (mk p x).coeff i = x i :=
   rfl
 #align truncated_witt_vector.coeff_mk TruncatedWittVector.coeff_mk
+-/
 
+#print TruncatedWittVector.mk_coeff /-
 @[simp]
 theorem mk_coeff (x : TruncatedWittVector p n R) : (mk p fun i => x.coeff i) = x := by ext i;
   rw [coeff_mk]
 #align truncated_witt_vector.mk_coeff TruncatedWittVector.mk_coeff
+-/
 
 variable [CommRing R]
 
+#print TruncatedWittVector.out /-
 /-- We can turn a truncated Witt vector `x` into a Witt vector
 by setting all coefficients after `x` to be 0.
 -/
 def out (x : TruncatedWittVector p n R) : 𝕎 R :=
   WittVector.mk' p fun i => if h : i < n then x.coeff ⟨i, h⟩ else 0
 #align truncated_witt_vector.out TruncatedWittVector.out
+-/
 
+#print TruncatedWittVector.coeff_out /-
 @[simp]
 theorem coeff_out (x : TruncatedWittVector p n R) (i : Fin n) : x.out.coeff i = x.coeff i := by
   rw [out, WittVector.coeff_mk, dif_pos i.is_lt, Fin.eta]
 #align truncated_witt_vector.coeff_out TruncatedWittVector.coeff_out
+-/
 
+#print TruncatedWittVector.out_injective /-
 theorem out_injective : Injective (@out p n R _) :=
   by
   intro x y h
@@ -126,6 +145,7 @@ theorem out_injective : Injective (@out p n R _) :=
   rw [WittVector.ext_iff] at h 
   simpa only [coeff_out] using h ↑i
 #align truncated_witt_vector.out_injective TruncatedWittVector.out_injective
+-/
 
 end TruncatedWittVector
 
@@ -135,24 +155,29 @@ variable {p} (n)
 
 section
 
+#print WittVector.truncateFun /-
 /-- `truncate_fun n x` uses the first `n` entries of `x` to construct a `truncated_witt_vector`,
 which has the same base `p` as `x`.
 This function is bundled into a ring homomorphism in `witt_vector.truncate` -/
 def truncateFun (x : 𝕎 R) : TruncatedWittVector p n R :=
   TruncatedWittVector.mk p fun i => x.coeff i
 #align witt_vector.truncate_fun WittVector.truncateFun
+-/
 
 end
 
 variable {n}
 
+#print WittVector.coeff_truncateFun /-
 @[simp]
 theorem coeff_truncateFun (x : 𝕎 R) (i : Fin n) : (truncateFun n x).coeff i = x.coeff i := by
   rw [truncate_fun, TruncatedWittVector.coeff_mk]
 #align witt_vector.coeff_truncate_fun WittVector.coeff_truncateFun
+-/
 
 variable [CommRing R]
 
+#print WittVector.out_truncateFun /-
 @[simp]
 theorem out_truncateFun (x : 𝕎 R) : (truncateFun n x).out = init n x :=
   by
@@ -161,6 +186,7 @@ theorem out_truncateFun (x : 𝕎 R) : (truncateFun n x).out = init n x :=
   split_ifs with hi; swap; · rfl
   rw [coeff_truncate_fun, Fin.val_mk]
 #align witt_vector.out_truncate_fun WittVector.out_truncateFun
+-/
 
 end WittVector
 
@@ -168,10 +194,12 @@ namespace TruncatedWittVector
 
 variable [CommRing R]
 
+#print TruncatedWittVector.truncateFun_out /-
 @[simp]
 theorem truncateFun_out (x : TruncatedWittVector p n R) : x.out.truncateFun n = x := by
   simp only [WittVector.truncateFun, coeff_out, mk_coeff]
 #align truncated_witt_vector.truncate_fun_out TruncatedWittVector.truncateFun_out
+-/
 
 open WittVector
 
@@ -201,24 +229,32 @@ instance : Neg (TruncatedWittVector p n R) :=
 instance : Sub (TruncatedWittVector p n R) :=
   ⟨fun x y => truncateFun n (x.out - y.out)⟩
 
+#print TruncatedWittVector.hasNatScalar /-
 instance hasNatScalar : SMul ℕ (TruncatedWittVector p n R) :=
   ⟨fun m x => truncateFun n (m • x.out)⟩
 #align truncated_witt_vector.has_nat_scalar TruncatedWittVector.hasNatScalar
+-/
 
+#print TruncatedWittVector.hasIntScalar /-
 instance hasIntScalar : SMul ℤ (TruncatedWittVector p n R) :=
   ⟨fun m x => truncateFun n (m • x.out)⟩
 #align truncated_witt_vector.has_int_scalar TruncatedWittVector.hasIntScalar
+-/
 
+#print TruncatedWittVector.hasNatPow /-
 instance hasNatPow : Pow (TruncatedWittVector p n R) ℕ :=
   ⟨fun x m => truncateFun n (x.out ^ m)⟩
 #align truncated_witt_vector.has_nat_pow TruncatedWittVector.hasNatPow
+-/
 
+#print TruncatedWittVector.coeff_zero /-
 @[simp]
 theorem coeff_zero (i : Fin n) : (0 : TruncatedWittVector p n R).coeff i = 0 :=
   by
   show coeff i (truncate_fun _ 0 : TruncatedWittVector p n R) = 0
   rw [coeff_truncate_fun, WittVector.zero_coeff]
 #align truncated_witt_vector.coeff_zero TruncatedWittVector.coeff_zero
+-/
 
 end TruncatedWittVector
 
@@ -234,59 +270,83 @@ variable (p n R)
 
 variable [CommRing R]
 
+#print WittVector.truncateFun_surjective /-
 theorem truncateFun_surjective : Surjective (@truncateFun p n R) :=
   Function.RightInverse.surjective TruncatedWittVector.truncateFun_out
 #align witt_vector.truncate_fun_surjective WittVector.truncateFun_surjective
+-/
 
+#print WittVector.truncateFun_zero /-
 @[simp]
 theorem truncateFun_zero : truncateFun n (0 : 𝕎 R) = 0 :=
   rfl
 #align witt_vector.truncate_fun_zero WittVector.truncateFun_zero
+-/
 
+#print WittVector.truncateFun_one /-
 @[simp]
 theorem truncateFun_one : truncateFun n (1 : 𝕎 R) = 1 :=
   rfl
 #align witt_vector.truncate_fun_one WittVector.truncateFun_one
+-/
 
 variable {p R}
 
+#print WittVector.truncateFun_add /-
 @[simp]
 theorem truncateFun_add (x y : 𝕎 R) : truncateFun n (x + y) = truncateFun n x + truncateFun n y :=
   by witt_truncate_fun_tac; rw [init_add]
 #align witt_vector.truncate_fun_add WittVector.truncateFun_add
+-/
 
+#print WittVector.truncateFun_mul /-
 @[simp]
 theorem truncateFun_mul (x y : 𝕎 R) : truncateFun n (x * y) = truncateFun n x * truncateFun n y :=
   by witt_truncate_fun_tac; rw [init_mul]
 #align witt_vector.truncate_fun_mul WittVector.truncateFun_mul
+-/
 
+#print WittVector.truncateFun_neg /-
 theorem truncateFun_neg (x : 𝕎 R) : truncateFun n (-x) = -truncateFun n x := by
   witt_truncate_fun_tac; rw [init_neg]
 #align witt_vector.truncate_fun_neg WittVector.truncateFun_neg
+-/
 
+#print WittVector.truncateFun_sub /-
 theorem truncateFun_sub (x y : 𝕎 R) : truncateFun n (x - y) = truncateFun n x - truncateFun n y :=
   by witt_truncate_fun_tac; rw [init_sub]
 #align witt_vector.truncate_fun_sub WittVector.truncateFun_sub
+-/
 
+#print WittVector.truncateFun_nsmul /-
 theorem truncateFun_nsmul (x : 𝕎 R) (m : ℕ) : truncateFun n (m • x) = m • truncateFun n x := by
   witt_truncate_fun_tac; rw [init_nsmul]
 #align witt_vector.truncate_fun_nsmul WittVector.truncateFun_nsmul
+-/
 
+#print WittVector.truncateFun_zsmul /-
 theorem truncateFun_zsmul (x : 𝕎 R) (m : ℤ) : truncateFun n (m • x) = m • truncateFun n x := by
   witt_truncate_fun_tac; rw [init_zsmul]
 #align witt_vector.truncate_fun_zsmul WittVector.truncateFun_zsmul
+-/
 
+#print WittVector.truncateFun_pow /-
 theorem truncateFun_pow (x : 𝕎 R) (m : ℕ) : truncateFun n (x ^ m) = truncateFun n x ^ m := by
   witt_truncate_fun_tac; rw [init_pow]
 #align witt_vector.truncate_fun_pow WittVector.truncateFun_pow
+-/
 
+#print WittVector.truncateFun_nat_cast /-
 theorem truncateFun_nat_cast (m : ℕ) : truncateFun n (m : 𝕎 R) = m :=
   rfl
 #align witt_vector.truncate_fun_nat_cast WittVector.truncateFun_nat_cast
+-/
 
+#print WittVector.truncateFun_int_cast /-
 theorem truncateFun_int_cast (m : ℤ) : truncateFun n (m : 𝕎 R) = m :=
   rfl
 #align witt_vector.truncate_fun_int_cast WittVector.truncateFun_int_cast
+-/
 
 end WittVector
 
@@ -314,6 +374,7 @@ variable (n)
 
 variable [CommRing R]
 
+#print WittVector.truncate /-
 /-- `truncate n` is a ring homomorphism that truncates `x` to its first `n` entries
 to obtain a `truncated_witt_vector`, which has the same base `p` as `x`. -/
 noncomputable def truncate : 𝕎 R →+* TruncatedWittVector p n R
@@ -324,37 +385,46 @@ noncomputable def truncate : 𝕎 R →+* TruncatedWittVector p n R
   map_one' := truncateFun_one p n R
   map_mul' := truncateFun_mul n
 #align witt_vector.truncate WittVector.truncate
+-/
 
 variable (p n R)
 
+#print WittVector.truncate_surjective /-
 theorem truncate_surjective : Surjective (truncate n : 𝕎 R → TruncatedWittVector p n R) :=
   truncateFun_surjective p n R
 #align witt_vector.truncate_surjective WittVector.truncate_surjective
+-/
 
 variable {p n R}
 
+#print WittVector.coeff_truncate /-
 @[simp]
 theorem coeff_truncate (x : 𝕎 R) (i : Fin n) : (truncate n x).coeff i = x.coeff i :=
   coeff_truncateFun _ _
 #align witt_vector.coeff_truncate WittVector.coeff_truncate
+-/
 
 variable (n)
 
+#print WittVector.mem_ker_truncate /-
 theorem mem_ker_truncate (x : 𝕎 R) : x ∈ (@truncate p _ n R _).ker ↔ ∀ i < n, x.coeff i = 0 :=
   by
   simp only [RingHom.mem_ker, truncate, truncate_fun, RingHom.coe_mk, TruncatedWittVector.ext_iff,
     TruncatedWittVector.coeff_mk, coeff_zero]
   exact Fin.forall_iff
 #align witt_vector.mem_ker_truncate WittVector.mem_ker_truncate
+-/
 
 variable (p)
 
+#print WittVector.truncate_mk' /-
 @[simp]
 theorem truncate_mk' (f : ℕ → R) : truncate n (mk' p f) = TruncatedWittVector.mk _ fun k => f k :=
   by
   ext i
   rw [coeff_truncate, coeff_mk, TruncatedWittVector.coeff_mk]
 #align witt_vector.truncate_mk WittVector.truncate_mk'
+-/
 
 end WittVector
 
@@ -362,6 +432,7 @@ namespace TruncatedWittVector
 
 variable [CommRing R]
 
+#print TruncatedWittVector.truncate /-
 /-- A ring homomorphism that truncates a truncated Witt vector of length `m` to
 a truncated Witt vector of length `n`, for `n ≤ m`.
 -/
@@ -373,19 +444,25 @@ def truncate {m : ℕ} (hm : n ≤ m) : TruncatedWittVector p m R →+* Truncate
       intro h i hi
       exact h i (lt_of_lt_of_le hi hm)⟩
 #align truncated_witt_vector.truncate TruncatedWittVector.truncate
+-/
 
+#print TruncatedWittVector.truncate_comp_wittVector_truncate /-
 @[simp]
 theorem truncate_comp_wittVector_truncate {m : ℕ} (hm : n ≤ m) :
     (@truncate p _ n R _ m hm).comp (WittVector.truncate m) = WittVector.truncate n :=
   RingHom.liftOfRightInverse_comp _ _ _ _
 #align truncated_witt_vector.truncate_comp_witt_vector_truncate TruncatedWittVector.truncate_comp_wittVector_truncate
+-/
 
+#print TruncatedWittVector.truncate_wittVector_truncate /-
 @[simp]
 theorem truncate_wittVector_truncate {m : ℕ} (hm : n ≤ m) (x : 𝕎 R) :
     truncate hm (WittVector.truncate m x) = WittVector.truncate n x :=
   RingHom.liftOfRightInverse_comp_apply _ _ _ _ _
 #align truncated_witt_vector.truncate_witt_vector_truncate TruncatedWittVector.truncate_wittVector_truncate
+-/
 
+#print TruncatedWittVector.truncate_truncate /-
 @[simp]
 theorem truncate_truncate {n₁ n₂ n₃ : ℕ} (h1 : n₁ ≤ n₂) (h2 : n₂ ≤ n₃)
     (x : TruncatedWittVector p n₃ R) : (truncate h1) (truncate h2 x) = truncate (h1.trans h2) x :=
@@ -393,20 +470,26 @@ theorem truncate_truncate {n₁ n₂ n₃ : ℕ} (h1 : n₁ ≤ n₂) (h2 : n₂
   obtain ⟨x, rfl⟩ := WittVector.truncate_surjective p n₃ R x
   simp only [truncate_witt_vector_truncate]
 #align truncated_witt_vector.truncate_truncate TruncatedWittVector.truncate_truncate
+-/
 
+#print TruncatedWittVector.truncate_comp /-
 @[simp]
 theorem truncate_comp {n₁ n₂ n₃ : ℕ} (h1 : n₁ ≤ n₂) (h2 : n₂ ≤ n₃) :
     (@truncate p _ _ R _ _ h1).comp (truncate h2) = truncate (h1.trans h2) := by ext1 x;
   simp only [truncate_truncate, Function.comp_apply, RingHom.coe_comp]
 #align truncated_witt_vector.truncate_comp TruncatedWittVector.truncate_comp
+-/
 
+#print TruncatedWittVector.truncate_surjective /-
 theorem truncate_surjective {m : ℕ} (hm : n ≤ m) : Surjective (@truncate p _ _ R _ _ hm) :=
   by
   intro x
   obtain ⟨x, rfl⟩ := WittVector.truncate_surjective p _ R x
   exact ⟨WittVector.truncate _ x, truncate_witt_vector_truncate _ _⟩
 #align truncated_witt_vector.truncate_surjective TruncatedWittVector.truncate_surjective
+-/
 
+#print TruncatedWittVector.coeff_truncate /-
 @[simp]
 theorem coeff_truncate {m : ℕ} (hm : n ≤ m) (i : Fin n) (x : TruncatedWittVector p m R) :
     (truncate hm x).coeff i = x.coeff (Fin.castLE hm i) :=
@@ -414,6 +497,7 @@ theorem coeff_truncate {m : ℕ} (hm : n ≤ m) (i : Fin n) (x : TruncatedWittVe
   obtain ⟨y, rfl⟩ := WittVector.truncate_surjective p _ _ x
   simp only [truncate_witt_vector_truncate, WittVector.coeff_truncate, Fin.coe_castLE]
 #align truncated_witt_vector.coeff_truncate TruncatedWittVector.coeff_truncate
+-/
 
 section Fintype
 
@@ -422,13 +506,16 @@ instance {R : Type _} [Fintype R] : Fintype (TruncatedWittVector p n R) :=
 
 variable (p n R)
 
+#print TruncatedWittVector.card /-
 theorem card {R : Type _} [Fintype R] :
     Fintype.card (TruncatedWittVector p n R) = Fintype.card R ^ n := by
   simp only [TruncatedWittVector, Fintype.card_fin, Fintype.card_fun]
 #align truncated_witt_vector.card TruncatedWittVector.card
+-/
 
 end Fintype
 
+#print TruncatedWittVector.iInf_ker_truncate /-
 theorem iInf_ker_truncate : (⨅ i : ℕ, (@WittVector.truncate p _ i R _).ker) = ⊥ :=
   by
   rw [Submodule.eq_bot_iff]
@@ -437,6 +524,7 @@ theorem iInf_ker_truncate : (⨅ i : ℕ, (@WittVector.truncate p _ i R _).ker)
   simp only [WittVector.mem_ker_truncate, Ideal.mem_iInf, WittVector.zero_coeff] at hx ⊢
   exact hx _ _ (Nat.lt_succ_self _)
 #align truncated_witt_vector.infi_ker_truncate TruncatedWittVector.iInf_ker_truncate
+-/
 
 end TruncatedWittVector
 
@@ -459,15 +547,18 @@ variable {p R}
 
 variable (n)
 
+#print WittVector.liftFun /-
 /-- Given a family `fₖ : S → truncated_witt_vector p k R` and `s : S`, we produce a Witt vector by
 defining the `k`th entry to be the final entry of `fₖ s`.
 -/
 def liftFun (s : S) : 𝕎 R :=
   WittVector.mk' p fun k => TruncatedWittVector.coeff (Fin.last k) (f (k + 1) s)
 #align witt_vector.lift_fun WittVector.liftFun
+-/
 
 variable {f}
 
+#print WittVector.truncate_liftFun /-
 @[simp]
 theorem truncate_liftFun (s : S) : WittVector.truncate n (liftFun f s) = f n s :=
   by
@@ -478,9 +569,11 @@ theorem truncate_liftFun (s : S) : WittVector.truncate n (liftFun f s) = f n s :
   congr with _
   simp only [Fin.val_last, Fin.coe_castLE]
 #align witt_vector.truncate_lift_fun WittVector.truncate_liftFun
+-/
 
 variable (f)
 
+#print WittVector.lift /-
 /--
 Given compatible ring homs from `S` into `truncated_witt_vector n` for each `n`, we can lift these
 to a ring hom `S → 𝕎 R`.
@@ -493,19 +586,25 @@ def lift : S →+* 𝕎 R := by
       rw [← sub_eq_zero, ← Ideal.mem_bot, ← infi_ker_truncate, Ideal.mem_iInf]
       simp [RingHom.mem_ker, f_compat]
 #align witt_vector.lift WittVector.lift
+-/
 
 variable {f}
 
+#print WittVector.truncate_lift /-
 @[simp]
 theorem truncate_lift (s : S) : WittVector.truncate n (lift _ f_compat s) = f n s :=
   truncate_liftFun _ f_compat s
 #align witt_vector.truncate_lift WittVector.truncate_lift
+-/
 
+#print WittVector.truncate_comp_lift /-
 @[simp]
 theorem truncate_comp_lift : (WittVector.truncate n).comp (lift _ f_compat) = f n := by ext1;
   rw [RingHom.comp_apply, truncate_lift]
 #align witt_vector.truncate_comp_lift WittVector.truncate_comp_lift
+-/
 
+#print WittVector.lift_unique /-
 /-- The uniqueness part of the universal property of `𝕎 R`. -/
 theorem lift_unique (g : S →+* 𝕎 R) (g_compat : ∀ k, (WittVector.truncate k).comp g = f k) :
     lift _ f_compat = g := by
@@ -515,7 +614,9 @@ theorem lift_unique (g : S →+* 𝕎 R) (g_compat : ∀ k, (WittVector.truncate
   simp only [RingHom.mem_ker, g_compat, ← RingHom.comp_apply, truncate_comp_lift, RingHom.map_sub,
     sub_self]
 #align witt_vector.lift_unique WittVector.lift_unique
+-/
 
+#print WittVector.liftEquiv /-
 /-- The universal property of `𝕎 R` as projective limit of truncated Witt vector rings. -/
 @[simps]
 def liftEquiv :
@@ -530,11 +631,14 @@ def liftEquiv :
   left_inv := by rintro ⟨f, hf⟩; simp only [truncate_comp_lift]
   right_inv g := lift_unique _ _ fun _ => rfl
 #align witt_vector.lift_equiv WittVector.liftEquiv
+-/
 
+#print WittVector.hom_ext /-
 theorem hom_ext (g₁ g₂ : S →+* 𝕎 R) (h : ∀ k, (truncate k).comp g₁ = (truncate k).comp g₂) :
     g₁ = g₂ :=
   liftEquiv.symm.Injective <| Subtype.ext <| funext h
 #align witt_vector.hom_ext WittVector.hom_ext
+-/
 
 end lift

acbe099c

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -46,7 +46,6 @@ noncomputable section
 
 variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) (R : Type _)
 
--- mathport name: expr𝕎
 local notation "𝕎" => WittVector p
 
 -- type as `\bbW`
@@ -178,8 +177,6 @@ open WittVector
 
 variable (p n R)
 
-include hp
-
 instance : Zero (TruncatedWittVector p n R) :=
   ⟨truncateFun n 0⟩
 
@@ -241,8 +238,6 @@ theorem truncateFun_surjective : Surjective (@truncateFun p n R) :=
   Function.RightInverse.surjective TruncatedWittVector.truncateFun_out
 #align witt_vector.truncate_fun_surjective WittVector.truncateFun_surjective
 
-include hp
-
 @[simp]
 theorem truncateFun_zero : truncateFun n (0 : 𝕎 R) = 0 :=
   rfl
@@ -303,8 +298,6 @@ variable (p n R)
 
 variable [CommRing R]
 
-include hp
-
 instance : CommRing (TruncatedWittVector p n R) :=
   (truncateFun_surjective p n R).CommRing _ (truncateFun_zero p n R) (truncateFun_one p n R)
     (truncateFun_add n) (truncateFun_mul n) (truncateFun_neg n) (truncateFun_sub n)
@@ -321,8 +314,6 @@ variable (n)
 
 variable [CommRing R]
 
-include hp
-
 /-- `truncate n` is a ring homomorphism that truncates `x` to its first `n` entries
 to obtain a `truncated_witt_vector`, which has the same base `p` as `x`. -/
 noncomputable def truncate : 𝕎 R →+* TruncatedWittVector p n R
@@ -371,8 +362,6 @@ namespace TruncatedWittVector
 
 variable [CommRing R]
 
-include hp
-
 /-- A ring homomorphism that truncates a truncated Witt vector of length `m` to
 a truncated Witt vector of length `n`, for `n ≤ m`.
 -/
@@ -428,8 +417,6 @@ theorem coeff_truncate {m : ℕ} (hm : n ≤ m) (i : Fin n) (x : TruncatedWittVe
 
 section Fintype
 
-omit hp
-
 instance {R : Type _} [Fintype R] : Fintype (TruncatedWittVector p n R) :=
   Pi.fintype
 
@@ -481,8 +468,6 @@ def liftFun (s : S) : 𝕎 R :=
 
 variable {f}
 
-include f_compat
-
 @[simp]
 theorem truncate_liftFun (s : S) : WittVector.truncate n (liftFun f s) = f n s :=
   by
@@ -531,10 +516,6 @@ theorem lift_unique (g : S →+* 𝕎 R) (g_compat : ∀ k, (WittVector.truncate
     sub_self]
 #align witt_vector.lift_unique WittVector.lift_unique
 
-omit f_compat
-
-include hp
-
 /-- The universal property of `𝕎 R` as projective limit of truncated Witt vector rings. -/
 @[simps]
 def liftEquiv :

acbe099c

bump to nightly-2023-06-09-07

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

16afdc39

Diff

@@ -225,7 +225,7 @@ theorem coeff_zero (i : Fin n) : (0 : TruncatedWittVector p n R).coeff i = 0 :=
 
 end TruncatedWittVector
 
-/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
 /-- A macro tactic used to prove that `truncate_fun` respects ring operations. -/
 unsafe def tactic.interactive.witt_truncate_fun_tac : tactic Unit :=
   sorry

acbe099c

bump to nightly-2023-06-05-12

mathlib commit https://github.com/leanprover-community/mathlib/commit/13361559d66b84f80b6d5a1c4a26aa5054766725

d07076be

Diff

@@ -112,7 +112,7 @@ variable [CommRing R]
 by setting all coefficients after `x` to be 0.
 -/
 def out (x : TruncatedWittVector p n R) : 𝕎 R :=
-  WittVector.mk p fun i => if h : i < n then x.coeff ⟨i, h⟩ else 0
+  WittVector.mk' p fun i => if h : i < n then x.coeff ⟨i, h⟩ else 0
 #align truncated_witt_vector.out TruncatedWittVector.out
 
 @[simp]
@@ -359,11 +359,11 @@ theorem mem_ker_truncate (x : 𝕎 R) : x ∈ (@truncate p _ n R _).ker ↔ ∀
 variable (p)
 
 @[simp]
-theorem truncate_mk (f : ℕ → R) : truncate n (mk p f) = TruncatedWittVector.mk _ fun k => f k :=
+theorem truncate_mk' (f : ℕ → R) : truncate n (mk' p f) = TruncatedWittVector.mk _ fun k => f k :=
   by
   ext i
   rw [coeff_truncate, coeff_mk, TruncatedWittVector.coeff_mk]
-#align witt_vector.truncate_mk WittVector.truncate_mk
+#align witt_vector.truncate_mk WittVector.truncate_mk'
 
 end WittVector
 
@@ -476,7 +476,7 @@ variable (n)
 defining the `k`th entry to be the final entry of `fₖ s`.
 -/
 def liftFun (s : S) : 𝕎 R :=
-  WittVector.mk p fun k => TruncatedWittVector.coeff (Fin.last k) (f (k + 1) s)
+  WittVector.mk' p fun k => TruncatedWittVector.coeff (Fin.last k) (f (k + 1) s)
 #align witt_vector.lift_fun WittVector.liftFun
 
 variable {f}
@@ -487,7 +487,7 @@ include f_compat
 theorem truncate_liftFun (s : S) : WittVector.truncate n (liftFun f s) = f n s :=
   by
   ext i
-  simp only [lift_fun, TruncatedWittVector.coeff_mk, WittVector.truncate_mk]
+  simp only [lift_fun, TruncatedWittVector.coeff_mk, WittVector.truncate_mk']
   rw [← f_compat (i + 1) n i.is_lt, RingHom.comp_apply, TruncatedWittVector.coeff_truncate]
   -- this is a bit unfortunate
   congr with _

acbe099c

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -124,7 +124,7 @@ theorem out_injective : Injective (@out p n R _) :=
   by
   intro x y h
   ext i
-  rw [WittVector.ext_iff] at h
+  rw [WittVector.ext_iff] at h 
   simpa only [coeff_out] using h ↑i
 #align truncated_witt_vector.out_injective TruncatedWittVector.out_injective
 
@@ -447,7 +447,7 @@ theorem iInf_ker_truncate : (⨅ i : ℕ, (@WittVector.truncate p _ i R _).ker)
   rw [Submodule.eq_bot_iff]
   intro x hx
   ext
-  simp only [WittVector.mem_ker_truncate, Ideal.mem_iInf, WittVector.zero_coeff] at hx⊢
+  simp only [WittVector.mem_ker_truncate, Ideal.mem_iInf, WittVector.zero_coeff] at hx ⊢
   exact hx _ _ (Nat.lt_succ_self _)
 #align truncated_witt_vector.infi_ker_truncate TruncatedWittVector.iInf_ker_truncate

acbe099c

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -102,9 +102,7 @@ theorem coeff_mk (x : Fin n → R) (i : Fin n) : (mk p x).coeff i = x i :=
 #align truncated_witt_vector.coeff_mk TruncatedWittVector.coeff_mk
 
 @[simp]
-theorem mk_coeff (x : TruncatedWittVector p n R) : (mk p fun i => x.coeff i) = x :=
-  by
-  ext i
+theorem mk_coeff (x : TruncatedWittVector p n R) : (mk p fun i => x.coeff i) = x := by ext i;
   rw [coeff_mk]
 #align truncated_witt_vector.mk_coeff TruncatedWittVector.mk_coeff
 
@@ -259,46 +257,32 @@ variable {p R}
 
 @[simp]
 theorem truncateFun_add (x y : 𝕎 R) : truncateFun n (x + y) = truncateFun n x + truncateFun n y :=
-  by
-  witt_truncate_fun_tac
-  rw [init_add]
+  by witt_truncate_fun_tac; rw [init_add]
 #align witt_vector.truncate_fun_add WittVector.truncateFun_add
 
 @[simp]
 theorem truncateFun_mul (x y : 𝕎 R) : truncateFun n (x * y) = truncateFun n x * truncateFun n y :=
-  by
-  witt_truncate_fun_tac
-  rw [init_mul]
+  by witt_truncate_fun_tac; rw [init_mul]
 #align witt_vector.truncate_fun_mul WittVector.truncateFun_mul
 
-theorem truncateFun_neg (x : 𝕎 R) : truncateFun n (-x) = -truncateFun n x :=
-  by
-  witt_truncate_fun_tac
-  rw [init_neg]
+theorem truncateFun_neg (x : 𝕎 R) : truncateFun n (-x) = -truncateFun n x := by
+  witt_truncate_fun_tac; rw [init_neg]
 #align witt_vector.truncate_fun_neg WittVector.truncateFun_neg
 
 theorem truncateFun_sub (x y : 𝕎 R) : truncateFun n (x - y) = truncateFun n x - truncateFun n y :=
-  by
-  witt_truncate_fun_tac
-  rw [init_sub]
+  by witt_truncate_fun_tac; rw [init_sub]
 #align witt_vector.truncate_fun_sub WittVector.truncateFun_sub
 
-theorem truncateFun_nsmul (x : 𝕎 R) (m : ℕ) : truncateFun n (m • x) = m • truncateFun n x :=
-  by
-  witt_truncate_fun_tac
-  rw [init_nsmul]
+theorem truncateFun_nsmul (x : 𝕎 R) (m : ℕ) : truncateFun n (m • x) = m • truncateFun n x := by
+  witt_truncate_fun_tac; rw [init_nsmul]
 #align witt_vector.truncate_fun_nsmul WittVector.truncateFun_nsmul
 
-theorem truncateFun_zsmul (x : 𝕎 R) (m : ℤ) : truncateFun n (m • x) = m • truncateFun n x :=
-  by
-  witt_truncate_fun_tac
-  rw [init_zsmul]
+theorem truncateFun_zsmul (x : 𝕎 R) (m : ℤ) : truncateFun n (m • x) = m • truncateFun n x := by
+  witt_truncate_fun_tac; rw [init_zsmul]
 #align witt_vector.truncate_fun_zsmul WittVector.truncateFun_zsmul
 
-theorem truncateFun_pow (x : 𝕎 R) (m : ℕ) : truncateFun n (x ^ m) = truncateFun n x ^ m :=
-  by
-  witt_truncate_fun_tac
-  rw [init_pow]
+theorem truncateFun_pow (x : 𝕎 R) (m : ℕ) : truncateFun n (x ^ m) = truncateFun n x ^ m := by
+  witt_truncate_fun_tac; rw [init_pow]
 #align witt_vector.truncate_fun_pow WittVector.truncateFun_pow
 
 theorem truncateFun_nat_cast (m : ℕ) : truncateFun n (m : 𝕎 R) = m :=
@@ -533,9 +517,7 @@ theorem truncate_lift (s : S) : WittVector.truncate n (lift _ f_compat s) = f n
 #align witt_vector.truncate_lift WittVector.truncate_lift
 
 @[simp]
-theorem truncate_comp_lift : (WittVector.truncate n).comp (lift _ f_compat) = f n :=
-  by
-  ext1
+theorem truncate_comp_lift : (WittVector.truncate n).comp (lift _ f_compat) = f n := by ext1;
   rw [RingHom.comp_apply, truncate_lift]
 #align witt_vector.truncate_comp_lift WittVector.truncate_comp_lift
 
@@ -562,12 +544,9 @@ def liftEquiv :
     where
   toFun f := lift f.1 f.2
   invFun g :=
-    ⟨fun k => (truncate k).comp g, by
-      intro _ _ h
+    ⟨fun k => (truncate k).comp g, by intro _ _ h;
       simp only [← RingHom.comp_assoc, truncate_comp_witt_vector_truncate]⟩
-  left_inv := by
-    rintro ⟨f, hf⟩
-    simp only [truncate_comp_lift]
+  left_inv := by rintro ⟨f, hf⟩; simp only [truncate_comp_lift]
   right_inv g := lift_unique _ _ fun _ => rfl
 #align witt_vector.lift_equiv WittVector.liftEquiv

acbe099c

bump to nightly-2023-05-14-08

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

d31da313

Diff

@@ -458,14 +458,14 @@ theorem card {R : Type _} [Fintype R] :
 
 end Fintype
 
-theorem infᵢ_ker_truncate : (⨅ i : ℕ, (@WittVector.truncate p _ i R _).ker) = ⊥ :=
+theorem iInf_ker_truncate : (⨅ i : ℕ, (@WittVector.truncate p _ i R _).ker) = ⊥ :=
   by
   rw [Submodule.eq_bot_iff]
   intro x hx
   ext
-  simp only [WittVector.mem_ker_truncate, Ideal.mem_infᵢ, WittVector.zero_coeff] at hx⊢
+  simp only [WittVector.mem_ker_truncate, Ideal.mem_iInf, WittVector.zero_coeff] at hx⊢
   exact hx _ _ (Nat.lt_succ_self _)
-#align truncated_witt_vector.infi_ker_truncate TruncatedWittVector.infᵢ_ker_truncate
+#align truncated_witt_vector.infi_ker_truncate TruncatedWittVector.iInf_ker_truncate
 
 end TruncatedWittVector
 
@@ -521,7 +521,7 @@ to a ring hom `S → 𝕎 R`.
 def lift : S →+* 𝕎 R := by
   refine_struct { toFun := lift_fun f } <;>
     · intros
-      rw [← sub_eq_zero, ← Ideal.mem_bot, ← infi_ker_truncate, Ideal.mem_infᵢ]
+      rw [← sub_eq_zero, ← Ideal.mem_bot, ← infi_ker_truncate, Ideal.mem_iInf]
       simp [RingHom.mem_ker, f_compat]
 #align witt_vector.lift WittVector.lift
 
@@ -543,7 +543,7 @@ theorem truncate_comp_lift : (WittVector.truncate n).comp (lift _ f_compat) = f
 theorem lift_unique (g : S →+* 𝕎 R) (g_compat : ∀ k, (WittVector.truncate k).comp g = f k) :
     lift _ f_compat = g := by
   ext1 x
-  rw [← sub_eq_zero, ← Ideal.mem_bot, ← infi_ker_truncate, Ideal.mem_infᵢ]
+  rw [← sub_eq_zero, ← Ideal.mem_bot, ← infi_ker_truncate, Ideal.mem_iInf]
   intro i
   simp only [RingHom.mem_ker, g_compat, ← RingHom.comp_apply, truncate_comp_lift, RingHom.map_sub,
     sub_self]

acbe099c

bump to nightly-2023-04-12-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/039ef89bef6e58b32b62898dd48e9d1a4312bb65

06c79b19

Diff

@@ -436,10 +436,10 @@ theorem truncate_surjective {m : ℕ} (hm : n ≤ m) : Surjective (@truncate p _
 
 @[simp]
 theorem coeff_truncate {m : ℕ} (hm : n ≤ m) (i : Fin n) (x : TruncatedWittVector p m R) :
-    (truncate hm x).coeff i = x.coeff (Fin.castLe hm i) :=
+    (truncate hm x).coeff i = x.coeff (Fin.castLE hm i) :=
   by
   obtain ⟨y, rfl⟩ := WittVector.truncate_surjective p _ _ x
-  simp only [truncate_witt_vector_truncate, WittVector.coeff_truncate, Fin.coe_castLe]
+  simp only [truncate_witt_vector_truncate, WittVector.coeff_truncate, Fin.coe_castLE]
 #align truncated_witt_vector.coeff_truncate TruncatedWittVector.coeff_truncate
 
 section Fintype
@@ -507,7 +507,7 @@ theorem truncate_liftFun (s : S) : WittVector.truncate n (liftFun f s) = f n s :
   rw [← f_compat (i + 1) n i.is_lt, RingHom.comp_apply, TruncatedWittVector.coeff_truncate]
   -- this is a bit unfortunate
   congr with _
-  simp only [Fin.val_last, Fin.coe_castLe]
+  simp only [Fin.val_last, Fin.coe_castLE]
 #align witt_vector.truncate_lift_fun WittVector.truncate_liftFun
 
 variable (f)

acbe099c

bump to nightly-2023-03-01-20

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

20cadee0

Diff

@@ -227,7 +227,7 @@ theorem coeff_zero (i : Fin n) : (0 : TruncatedWittVector p n R).coeff i = 0 :=
 
 end TruncatedWittVector
 
-/- ./././Mathport/Syntax/Translate/Expr.lean:334:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
 /-- A macro tactic used to prove that `truncate_fun` respects ring operations. -/
 unsafe def tactic.interactive.witt_truncate_fun_tac : tactic Unit :=
   sorry

acbe099c

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

acbe099c

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

@@ -282,11 +282,11 @@ theorem truncateFun_pow (x : 𝕎 R) (m : ℕ) : truncateFun n (x ^ m) = truncat
   witt_truncateFun_tac
 #align witt_vector.truncate_fun_pow WittVector.truncateFun_pow
 
-theorem truncateFun_nat_cast (m : ℕ) : truncateFun n (m : 𝕎 R) = m := rfl
-#align witt_vector.truncate_fun_nat_cast WittVector.truncateFun_nat_cast
+theorem truncateFun_natCast (m : ℕ) : truncateFun n (m : 𝕎 R) = m := rfl
+#align witt_vector.truncate_fun_nat_cast WittVector.truncateFun_natCast
 
-theorem truncateFun_int_cast (m : ℤ) : truncateFun n (m : 𝕎 R) = m := rfl
-#align witt_vector.truncate_fun_int_cast WittVector.truncateFun_int_cast
+theorem truncateFun_intCast (m : ℤ) : truncateFun n (m : 𝕎 R) = m := rfl
+#align witt_vector.truncate_fun_int_cast WittVector.truncateFun_intCast
 
 end WittVector
 
@@ -300,8 +300,8 @@ variable [CommRing R]
 instance instCommRing : CommRing (TruncatedWittVector p n R) :=
   (truncateFun_surjective p n R).commRing _ (truncateFun_zero p n R) (truncateFun_one p n R)
     (truncateFun_add n) (truncateFun_mul n) (truncateFun_neg n) (truncateFun_sub n)
-    (truncateFun_nsmul n) (truncateFun_zsmul n) (truncateFun_pow n) (truncateFun_nat_cast n)
-    (truncateFun_int_cast n)
+    (truncateFun_nsmul n) (truncateFun_zsmul n) (truncateFun_pow n) (truncateFun_natCast n)
+    (truncateFun_intCast n)
 
 end TruncatedWittVector

acbe099c

chore(Field/InjSurj): Tidy (#11480)

Among other things, change the nsmul, zsmul, qsmul fields to have n/q come before x, because this matches the lemmas we want to write about them. It would be preferrable to perform the same changes to the AddMonoid/AddGroup-like typeclasses, but this is impossible with the current to_additive framework, so instead I have inserted some Function.swap at the interface between AddMonoid/AddGroup and Ring/Field.

Reduce the diff of #11203

64e5ddf0

Diff

@@ -270,11 +270,11 @@ theorem truncateFun_sub (x y : 𝕎 R) :
   witt_truncateFun_tac
 #align witt_vector.truncate_fun_sub WittVector.truncateFun_sub
 
-theorem truncateFun_nsmul (x : 𝕎 R) (m : ℕ) : truncateFun n (m • x) = m • truncateFun n x := by
+theorem truncateFun_nsmul (m : ℕ) (x : 𝕎 R) : truncateFun n (m • x) = m • truncateFun n x := by
   witt_truncateFun_tac
 #align witt_vector.truncate_fun_nsmul WittVector.truncateFun_nsmul
 
-theorem truncateFun_zsmul (x : 𝕎 R) (m : ℤ) : truncateFun n (m • x) = m • truncateFun n x := by
+theorem truncateFun_zsmul (m : ℤ) (x : 𝕎 R) : truncateFun n (m • x) = m • truncateFun n x := by
   witt_truncateFun_tac
 #align witt_vector.truncate_fun_zsmul WittVector.truncateFun_zsmul

acbe099c

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

Empty lines were removed by executing the following Python script twice

import os
import re


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

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

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

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

75c86f04

Diff

@@ -233,7 +233,6 @@ macro (name := witt_truncateFun_tac) "witt_truncateFun_tac" : tactic =>
 namespace WittVector
 
 variable (p n R)
-
 variable [CommRing R]
 
 theorem truncateFun_surjective : Surjective (@truncateFun p n R) :=
@@ -296,7 +295,6 @@ namespace TruncatedWittVector
 open WittVector
 
 variable (p n R)
-
 variable [CommRing R]
 
 instance instCommRing : CommRing (TruncatedWittVector p n R) :=
@@ -312,7 +310,6 @@ namespace WittVector
 open TruncatedWittVector
 
 variable (n)
-
 variable [CommRing R]
 
 /-- `truncate n` is a ring homomorphism that truncates `x` to its first `n` entries
@@ -444,11 +441,8 @@ open TruncatedWittVector hiding truncate coeff
 section lift
 
 variable [CommRing R]
-
 variable {S : Type*} [Semiring S]
-
 variable (f : ∀ k : ℕ, S →+* TruncatedWittVector p k R)
-
 variable
   (f_compat : ∀ (k₁ k₂ : ℕ) (hk : k₁ ≤ k₂), (TruncatedWittVector.truncate hk).comp (f k₂) = f k₁)

acbe099c

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -41,7 +41,7 @@ open Function (Injective Surjective)
 
 noncomputable section
 
-variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) (R : Type _)
+variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) (R : Type*)
 
 local notation "𝕎" => WittVector p -- type as `\bbW`
 
@@ -57,11 +57,11 @@ and under this assumption we construct a ring structure on `TruncatedWittVector
 equal as types but will have different ring operations.)
 -/
 @[nolint unusedArguments]
-def TruncatedWittVector (_ : ℕ) (n : ℕ) (R : Type _) :=
+def TruncatedWittVector (_ : ℕ) (n : ℕ) (R : Type*) :=
   Fin n → R
 #align truncated_witt_vector TruncatedWittVector
 
-instance (p n : ℕ) (R : Type _) [Inhabited R] : Inhabited (TruncatedWittVector p n R) :=
+instance (p n : ℕ) (R : Type*) [Inhabited R] : Inhabited (TruncatedWittVector p n R) :=
   ⟨fun _ => default⟩
 
 variable {n R}
@@ -415,12 +415,12 @@ theorem coeff_truncate {m : ℕ} (hm : n ≤ m) (i : Fin n) (x : TruncatedWittVe
 
 section Fintype
 
-instance {R : Type _} [Fintype R] : Fintype (TruncatedWittVector p n R) :=
+instance {R : Type*} [Fintype R] : Fintype (TruncatedWittVector p n R) :=
   Pi.fintype
 
 variable (p n R)
 
-theorem card {R : Type _} [Fintype R] :
+theorem card {R : Type*} [Fintype R] :
     Fintype.card (TruncatedWittVector p n R) = Fintype.card R ^ n := by
   simp only [TruncatedWittVector, Fintype.card_fin, Fintype.card_fun]
 #align truncated_witt_vector.card TruncatedWittVector.card
@@ -445,7 +445,7 @@ section lift
 
 variable [CommRing R]
 
-variable {S : Type _} [Semiring S]
+variable {S : Type*} [Semiring S]
 
 variable (f : ∀ k : ℕ, S →+* TruncatedWittVector p k R)

acbe099c

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

depends on: #5966

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

89aa3a3b

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2020 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.truncated
-! leanprover-community/mathlib commit acbe099ced8be9c9754d62860110295cde0d7181
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.RingTheory.WittVector.InitTail
 
+#align_import ring_theory.witt_vector.truncated from "leanprover-community/mathlib"@"acbe099ced8be9c9754d62860110295cde0d7181"
+
 /-!
 
 # Truncated Witt vectors

acbe099c

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

@@ -471,7 +471,7 @@ theorem truncate_liftFun (s : S) : WittVector.truncate n (liftFun f s) = f n s :
   ext i
   simp only [liftFun, TruncatedWittVector.coeff_mk, WittVector.truncate_mk']
   rw [← f_compat (i + 1) n i.is_lt, RingHom.comp_apply, TruncatedWittVector.coeff_truncate]
-  congr with _
+  congr 1 with _
 #align witt_vector.truncate_lift_fun WittVector.truncate_liftFun
 
 variable (f)

acbe099c

chore: tidy various files (#5628)

3282e2f7

Diff

@@ -262,7 +262,7 @@ theorem truncateFun_add (x y : 𝕎 R) :
 @[simp]
 theorem truncateFun_mul (x y : 𝕎 R) :
     truncateFun n (x * y) = truncateFun n x * truncateFun n y := by
-witt_truncateFun_tac
+  witt_truncateFun_tac
 #align witt_vector.truncate_fun_mul WittVector.truncateFun_mul
 
 theorem truncateFun_neg (x : 𝕎 R) : truncateFun n (-x) = -truncateFun n x := by

acbe099c

fix: precedences of ⨆⋃⋂⨅ (#5614)

e3c8f983

Diff

@@ -430,7 +430,7 @@ theorem card {R : Type _} [Fintype R] :
 
 end Fintype
 
-theorem iInf_ker_truncate : (⨅ i : ℕ, RingHom.ker (@WittVector.truncate p _ i R _)) = ⊥ := by
+theorem iInf_ker_truncate : ⨅ i : ℕ, RingHom.ker (@WittVector.truncate p _ i R _) = ⊥ := by
   rw [Submodule.eq_bot_iff]
   intro x hx
   ext

acbe099c

feat: port RingTheory.WittVector.Truncated (#5538)

abaae3b8

`ring_theory.witt_vector.truncated` ⟷ `Mathlib.RingTheory.WittVector.Truncated`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 676

ring_theory.witt_vector.truncated ⟷ Mathlib.RingTheory.WittVector.Truncated

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 676

`ring_theory.witt_vector.truncated` ⟷ `Mathlib.RingTheory.WittVector.Truncated`