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

07980376

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

9240e8be

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -137,7 +137,7 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
         (bind₁ (select_poly fun i => ¬P i)) (wittPolynomial p ℤ n) =
       wittPolynomial p ℤ n
     by
-    apply_fun aeval x.coeff at this 
+    apply_fun aeval x.coeff at this
     simpa only [AlgHom.map_add, aeval_bind₁, ← coeff_select]
   simp only [wittPolynomial_eq_sum_C_mul_X_pow, select_poly, AlgHom.map_sum, AlgHom.map_pow,
     AlgHom.map_mul, bind₁_X_right, bind₁_C_right, ← Finset.sum_add_distrib, ← mul_add]
@@ -169,7 +169,7 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
     _ = x.coeff n + y.coeff n := _
   dsimp [z]
   split_ifs with hn
-  · dsimp [P] at hn ; rw [hn, add_zero]
+  · dsimp [P] at hn; rw [hn, add_zero]
   · rw [(h n).resolve_right hn, zero_add]
 #align witt_vector.coeff_add_of_disjoint WittVector.coeff_add_of_disjoint
 -/

9240e8be

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2020 Johan Commelin, Robert Y. Lewis. 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.Basic
-import Mathbin.RingTheory.WittVector.IsPoly
+import RingTheory.WittVector.Basic
+import RingTheory.WittVector.IsPoly
 
 #align_import ring_theory.witt_vector.init_tail from "leanprover-community/mathlib"@"9240e8be927a0955b9a82c6c85ef499ee3a626b8"
 
@@ -49,9 +49,9 @@ namespace Tactic
 namespace Interactive
 
 /- ./././Mathport/Syntax/Translate/Tactic/Mathlib/Core.lean:38:34: unsupported: setup_tactic_parser -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:337:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:337:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:337:4: warning: unsupported (TODO): `[tacs] -/
 -- PLEASE REPORT THIS TO MATHPORT DEVS, THIS SHOULD NOT HAPPEN.
 -- failed to format: unknown constant 'term.pseudo.antiquot'
 /--

9240e8be

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2020 Johan Commelin, Robert Y. Lewis. 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.init_tail
-! 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.Basic
 import Mathbin.RingTheory.WittVector.IsPoly
 
+#align_import ring_theory.witt_vector.init_tail from "leanprover-community/mathlib"@"9240e8be927a0955b9a82c6c85ef499ee3a626b8"
+
 /-!
 
 # `init` and `tail`

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.init_tail
-! leanprover-community/mathlib commit 0798037604b2d91748f9b43925fb7570a5f3256c
+! leanprover-community/mathlib commit 9240e8be927a0955b9a82c6c85ef499ee3a626b8
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.RingTheory.WittVector.IsPoly
 
 # `init` and `tail`
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 Given a Witt vector `x`, we are sometimes interested
 in its components before and after an index `n`.
 This file defines those operations, proves that `init` is polynomial,

07980376

bump to nightly-2023-06-28-19

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

6577c9bd

Diff

@@ -139,7 +139,7 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
     by
     apply_fun aeval x.coeff at this 
     simpa only [AlgHom.map_add, aeval_bind₁, ← coeff_select]
-  simp only [wittPolynomial_eq_sum_c_mul_x_pow, select_poly, AlgHom.map_sum, AlgHom.map_pow,
+  simp only [wittPolynomial_eq_sum_C_mul_X_pow, select_poly, AlgHom.map_sum, AlgHom.map_pow,
     AlgHom.map_mul, bind₁_X_right, bind₁_C_right, ← Finset.sum_add_distrib, ← mul_add]
   apply Finset.sum_congr rfl
   refine' fun m hm => mul_eq_mul_left_iff.mpr (Or.inl _)

07980376

bump to nightly-2023-06-28-01

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

c13c40e8

Diff

@@ -84,23 +84,28 @@ noncomputable section
 
 section
 
+#print WittVector.select /-
 /-- `witt_vector.select P x`, for a predicate `P : ℕ → Prop` is the Witt vector
 whose `n`-th coefficient is `x.coeff n` if `P n` is true, and `0` otherwise.
 -/
 def select (P : ℕ → Prop) (x : 𝕎 R) : 𝕎 R :=
   mk' p fun n => if P n then x.coeff n else 0
 #align witt_vector.select WittVector.select
+-/
 
 section Select
 
 variable (P : ℕ → Prop)
 
+#print WittVector.selectPoly /-
 /-- The polynomial that witnesses that `witt_vector.select` is a polynomial function.
 `select_poly n` is `X n` if `P n` holds, and `0` otherwise. -/
 def selectPoly (n : ℕ) : MvPolynomial ℕ ℤ :=
   if P n then X n else 0
 #align witt_vector.select_poly WittVector.selectPoly
+-/
 
+#print WittVector.coeff_select /-
 theorem coeff_select (x : 𝕎 R) (n : ℕ) : (select P x).coeff n = aeval x.coeff (selectPoly P n) :=
   by
   dsimp [select, select_poly]
@@ -108,7 +113,9 @@ theorem coeff_select (x : 𝕎 R) (n : ℕ) : (select P x).coeff n = aeval x.coe
   · rw [aeval_X]
   · rw [AlgHom.map_zero]
 #align witt_vector.coeff_select WittVector.coeff_select
+-/
 
+#print WittVector.select_isPoly /-
 @[is_poly]
 theorem select_isPoly (P : ℕ → Prop) : IsPoly p fun R _Rcr x => select P x :=
   by
@@ -117,7 +124,9 @@ theorem select_isPoly (P : ℕ → Prop) : IsPoly p fun R _Rcr x => select P x :
   funext i
   apply coeff_select
 #align witt_vector.select_is_poly WittVector.select_isPoly
+-/
 
+#print WittVector.select_add_select_not /-
 theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬P i) x = x :=
   by
   ghost_calc _
@@ -140,7 +149,9 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
     exact not_not.mpr Pm
   · rwa [if_neg Pm, if_pos, zero_add]
 #align witt_vector.select_add_select_not WittVector.select_add_select_not
+-/
 
+#print WittVector.coeff_add_of_disjoint /-
 theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coeff n = 0) :
     (x + y).coeff n = x.coeff n + y.coeff n :=
   by
@@ -161,9 +172,11 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
   · dsimp [P] at hn ; rw [hn, add_zero]
   · rw [(h n).resolve_right hn, zero_add]
 #align witt_vector.coeff_add_of_disjoint WittVector.coeff_add_of_disjoint
+-/
 
 end Select
 
+#print WittVector.init /-
 /-- `witt_vector.init n x` is the Witt vector of which the first `n` coefficients are those from `x`
 and all other coefficients are `0`.
 See `witt_vector.tail` for the complementary part.
@@ -171,61 +184,84 @@ See `witt_vector.tail` for the complementary part.
 def init (n : ℕ) : 𝕎 R → 𝕎 R :=
   select fun i => i < n
 #align witt_vector.init WittVector.init
+-/
 
+#print WittVector.tail /-
 /-- `witt_vector.tail n x` is the Witt vector of which the first `n` coefficients are `0`
 and all other coefficients are those from `x`.
 See `witt_vector.init` for the complementary part. -/
 def tail (n : ℕ) : 𝕎 R → 𝕎 R :=
   select fun i => n ≤ i
 #align witt_vector.tail WittVector.tail
+-/
 
+#print WittVector.init_add_tail /-
 @[simp]
 theorem init_add_tail (x : 𝕎 R) (n : ℕ) : init n x + tail n x = x := by
   simp only [init, tail, ← not_lt, select_add_select_not]
 #align witt_vector.init_add_tail WittVector.init_add_tail
+-/
 
 end
 
+#print WittVector.init_init /-
 @[simp]
 theorem init_init (x : 𝕎 R) (n : ℕ) : init n (init n x) = init n x := by init_ring
 #align witt_vector.init_init WittVector.init_init
+-/
 
+#print WittVector.init_add /-
 theorem init_add (x y : 𝕎 R) (n : ℕ) : init n (x + y) = init n (init n x + init n y) := by
   init_ring using witt_add_vars
 #align witt_vector.init_add WittVector.init_add
+-/
 
+#print WittVector.init_mul /-
 theorem init_mul (x y : 𝕎 R) (n : ℕ) : init n (x * y) = init n (init n x * init n y) := by
   init_ring using witt_mul_vars
 #align witt_vector.init_mul WittVector.init_mul
+-/
 
+#print WittVector.init_neg /-
 theorem init_neg (x : 𝕎 R) (n : ℕ) : init n (-x) = init n (-init n x) := by
   init_ring using witt_neg_vars
 #align witt_vector.init_neg WittVector.init_neg
+-/
 
+#print WittVector.init_sub /-
 theorem init_sub (x y : 𝕎 R) (n : ℕ) : init n (x - y) = init n (init n x - init n y) := by
   init_ring using witt_sub_vars
 #align witt_vector.init_sub WittVector.init_sub
+-/
 
+#print WittVector.init_nsmul /-
 theorem init_nsmul (m : ℕ) (x : 𝕎 R) (n : ℕ) : init n (m • x) = init n (m • init n x) := by
   init_ring using fun p [Fact (Nat.Prime p)] n => witt_nsmul_vars p m n
 #align witt_vector.init_nsmul WittVector.init_nsmul
+-/
 
+#print WittVector.init_zsmul /-
 theorem init_zsmul (m : ℤ) (x : 𝕎 R) (n : ℕ) : init n (m • x) = init n (m • init n x) := by
   init_ring using fun p [Fact (Nat.Prime p)] n => witt_zsmul_vars p m n
 #align witt_vector.init_zsmul WittVector.init_zsmul
+-/
 
+#print WittVector.init_pow /-
 theorem init_pow (m : ℕ) (x : 𝕎 R) (n : ℕ) : init n (x ^ m) = init n (init n x ^ m) := by
   init_ring using fun p [Fact (Nat.Prime p)] n => witt_pow_vars p m n
 #align witt_vector.init_pow WittVector.init_pow
+-/
 
 section
 
 variable (p)
 
+#print WittVector.init_isPoly /-
 /-- `witt_vector.init n x` is polynomial in the coefficients of `x`. -/
 theorem init_isPoly (n : ℕ) : IsPoly p fun R _Rcr => init n :=
   select_isPoly fun i => i < n
 #align witt_vector.init_is_poly WittVector.init_isPoly
+-/
 
 end

07980376

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -41,7 +41,6 @@ and shows how that polynomial interacts with `mv_polynomial.bind₁`.
 
 variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) {R : Type _} [CommRing R]
 
--- mathport name: expr𝕎
 local notation "𝕎" => WittVector p
 
 -- type as `\bbW`
@@ -119,8 +118,6 @@ theorem select_isPoly (P : ℕ → Prop) : IsPoly p fun R _Rcr x => select P x :
   apply coeff_select
 #align witt_vector.select_is_poly WittVector.select_isPoly
 
-include hp
-
 theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬P i) x = x :=
   by
   ghost_calc _
@@ -182,8 +179,6 @@ def tail (n : ℕ) : 𝕎 R → 𝕎 R :=
   select fun i => n ≤ i
 #align witt_vector.tail WittVector.tail
 
-include hp
-
 @[simp]
 theorem init_add_tail (x : 𝕎 R) (n : ℕ) : init n x + tail n x = x := by
   simp only [init, tail, ← not_lt, select_add_select_not]
@@ -195,8 +190,6 @@ end
 theorem init_init (x : 𝕎 R) (n : ℕ) : init n (init n x) = init n x := by init_ring
 #align witt_vector.init_init WittVector.init_init
 
-include hp
-
 theorem init_add (x y : 𝕎 R) (n : ℕ) : init n (x + y) = init n (init n x + init n y) := by
   init_ring using witt_add_vars
 #align witt_vector.init_add WittVector.init_add
@@ -229,8 +222,6 @@ section
 
 variable (p)
 
-omit hp
-
 /-- `witt_vector.init n x` is polynomial in the coefficients of `x`. -/
 theorem init_isPoly (n : ℕ) : IsPoly p fun R _Rcr => init n :=
   select_isPoly fun i => i < n

07980376

bump to nightly-2023-06-09-07

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

16afdc39

Diff

@@ -50,9 +50,9 @@ namespace Tactic
 namespace Interactive
 
 /- ./././Mathport/Syntax/Translate/Tactic/Mathlib/Core.lean:38:34: unsupported: setup_tactic_parser -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:336:4: warning: unsupported (TODO): `[tacs] -/
 -- PLEASE REPORT THIS TO MATHPORT DEVS, THIS SHOULD NOT HAPPEN.
 -- failed to format: unknown constant 'term.pseudo.antiquot'
 /--
@@ -159,7 +159,6 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
   calc
     (x + y).coeff n = z.coeff n := by rw [← hx, ← hy, select_add_select_not P z]
     _ = x.coeff n + y.coeff n := _
-    
   dsimp [z]
   split_ifs with hn
   · dsimp [P] at hn ; rw [hn, add_zero]

07980376

bump to nightly-2023-06-08-23

mathlib commit https://github.com/leanprover-community/mathlib/commit/31c24aa72e7b3e5ed97a8412470e904f82b81004

d3cfe2e3

Diff

@@ -53,6 +53,7 @@ namespace Interactive
 /- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
 /- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
 /- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
+-- PLEASE REPORT THIS TO MATHPORT DEVS, THIS SHOULD NOT HAPPEN.
 -- failed to format: unknown constant 'term.pseudo.antiquot'
 /--
       `init_ring` is an auxiliary tactic that discharges goals factoring `init` over ring operations.
@@ -110,13 +111,13 @@ theorem coeff_select (x : 𝕎 R) (n : ℕ) : (select P x).coeff n = aeval x.coe
 #align witt_vector.coeff_select WittVector.coeff_select
 
 @[is_poly]
-theorem selectIsPoly (P : ℕ → Prop) : IsPoly p fun R _Rcr x => select P x :=
+theorem select_isPoly (P : ℕ → Prop) : IsPoly p fun R _Rcr x => select P x :=
   by
   use select_poly P
   rintro R _Rcr x
   funext i
   apply coeff_select
-#align witt_vector.select_is_poly WittVector.selectIsPoly
+#align witt_vector.select_is_poly WittVector.select_isPoly
 
 include hp
 
@@ -232,9 +233,9 @@ variable (p)
 omit hp
 
 /-- `witt_vector.init n x` is polynomial in the coefficients of `x`. -/
-theorem initIsPoly (n : ℕ) : IsPoly p fun R _Rcr => init n :=
-  selectIsPoly fun i => i < n
-#align witt_vector.init_is_poly WittVector.initIsPoly
+theorem init_isPoly (n : ℕ) : IsPoly p fun R _Rcr => init n :=
+  select_isPoly fun i => i < n
+#align witt_vector.init_is_poly WittVector.init_isPoly
 
 end

07980376

bump to nightly-2023-06-05-12

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

d07076be

Diff

@@ -88,7 +88,7 @@ section
 whose `n`-th coefficient is `x.coeff n` if `P n` is true, and `0` otherwise.
 -/
 def select (P : ℕ → Prop) (x : 𝕎 R) : 𝕎 R :=
-  mk p fun n => if P n then x.coeff n else 0
+  mk' p fun n => if P n then x.coeff n else 0
 #align witt_vector.select WittVector.select
 
 section Select

07980376

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -130,7 +130,7 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
         (bind₁ (select_poly fun i => ¬P i)) (wittPolynomial p ℤ n) =
       wittPolynomial p ℤ n
     by
-    apply_fun aeval x.coeff  at this 
+    apply_fun aeval x.coeff at this 
     simpa only [AlgHom.map_add, aeval_bind₁, ← coeff_select]
   simp only [wittPolynomial_eq_sum_c_mul_x_pow, select_poly, AlgHom.map_sum, AlgHom.map_pow,
     AlgHom.map_mul, bind₁_X_right, bind₁_C_right, ← Finset.sum_add_distrib, ← mul_add]

07980376

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -130,7 +130,7 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
         (bind₁ (select_poly fun i => ¬P i)) (wittPolynomial p ℤ n) =
       wittPolynomial p ℤ n
     by
-    apply_fun aeval x.coeff  at this
+    apply_fun aeval x.coeff  at this 
     simpa only [AlgHom.map_add, aeval_bind₁, ← coeff_select]
   simp only [wittPolynomial_eq_sum_c_mul_x_pow, select_poly, AlgHom.map_sum, AlgHom.map_pow,
     AlgHom.map_mul, bind₁_X_right, bind₁_C_right, ← Finset.sum_add_distrib, ← mul_add]
@@ -161,7 +161,7 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
     
   dsimp [z]
   split_ifs with hn
-  · dsimp [P] at hn; rw [hn, add_zero]
+  · dsimp [P] at hn ; rw [hn, add_zero]
   · rw [(h n).resolve_right hn, zero_add]
 #align witt_vector.coeff_add_of_disjoint WittVector.coeff_add_of_disjoint

07980376

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -78,7 +78,7 @@ namespace WittVector
 
 open MvPolynomial
 
-open Classical
+open scoped Classical
 
 noncomputable section

07980376

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -150,25 +150,18 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
   haveI : DecidablePred P := Classical.decPred P
   set z := mk p fun n => if P n then x.coeff n else y.coeff n with hz
   have hx : select P z = x := by
-    ext1 n
-    rw [select, coeff_mk, coeff_mk]
-    split_ifs with hn
-    · rfl
-    · rw [(h n).resolve_right hn]
+    ext1 n; rw [select, coeff_mk, coeff_mk]
+    split_ifs with hn; · rfl; · rw [(h n).resolve_right hn]
   have hy : select (fun i => ¬P i) z = y := by
-    ext1 n
-    rw [select, coeff_mk, coeff_mk]
-    split_ifs with hn
-    · exact hn.symm
-    · rfl
+    ext1 n; rw [select, coeff_mk, coeff_mk]
+    split_ifs with hn; · exact hn.symm; · rfl
   calc
     (x + y).coeff n = z.coeff n := by rw [← hx, ← hy, select_add_select_not P z]
     _ = x.coeff n + y.coeff n := _
     
   dsimp [z]
   split_ifs with hn
-  · dsimp [P] at hn
-    rw [hn, add_zero]
+  · dsimp [P] at hn; rw [hn, add_zero]
   · rw [(h n).resolve_right hn, zero_add]
 #align witt_vector.coeff_add_of_disjoint WittVector.coeff_add_of_disjoint

07980376

bump to nightly-2023-03-15-10

mathlib commit https://github.com/leanprover-community/mathlib/commit/1a313d8bba1bad05faba71a4a4e9742ab5bd9efd

f73428b0

Diff

@@ -98,7 +98,7 @@ variable (P : ℕ → Prop)
 /-- The polynomial that witnesses that `witt_vector.select` is a polynomial function.
 `select_poly n` is `X n` if `P n` holds, and `0` otherwise. -/
 def selectPoly (n : ℕ) : MvPolynomial ℕ ℤ :=
-  if P n then x n else 0
+  if P n then X n else 0
 #align witt_vector.select_poly WittVector.selectPoly
 
 theorem coeff_select (x : 𝕎 R) (n : ℕ) : (select P x).coeff n = aeval x.coeff (selectPoly P n) :=

07980376

bump to nightly-2023-03-01-20

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

20cadee0

Diff

@@ -50,9 +50,9 @@ namespace Tactic
 namespace Interactive
 
 /- ./././Mathport/Syntax/Translate/Tactic/Mathlib/Core.lean:38:34: unsupported: setup_tactic_parser -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:334:4: warning: unsupported (TODO): `[tacs] -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:334:4: warning: unsupported (TODO): `[tacs] -/
-/- ./././Mathport/Syntax/Translate/Expr.lean:334:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
+/- ./././Mathport/Syntax/Translate/Expr.lean:330:4: warning: unsupported (TODO): `[tacs] -/
 -- failed to format: unknown constant 'term.pseudo.antiquot'
 /--
       `init_ring` is an auxiliary tactic that discharges goals factoring `init` over ring operations.

07980376

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

07980376

chore: more backporting of simp changes from #10995 (#11001)

Co-authored-by: Patrick Massot <patrickmassot@free.fr> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

d9589c14

Diff

@@ -127,7 +127,7 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
   calc
     (x + y).coeff n = z.coeff n := by rw [← hx, ← hy, select_add_select_not P z]
     _ = x.coeff n + y.coeff n := by
-      simp only [mk._eq_1]
+      simp only [z, mk._eq_1]
       split_ifs with y0
       · rw [y0, add_zero]
       · rw [h n |>.resolve_right y0, zero_add]

07980376

feat: The support of f ^ n (#9617)

This involves moving lemmas from Algebra.GroupPower.Ring to Algebra.GroupWithZero.Basic and changing some 0 < n assumptions to n ≠ 0.

From LeanAPAP

9d1a7d26

Diff

@@ -103,11 +103,9 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
     AlgHom.map_mul, bind₁_X_right, bind₁_C_right, ← Finset.sum_add_distrib, ← mul_add]
   apply Finset.sum_congr rfl
   refine' fun m _ => mul_eq_mul_left_iff.mpr (Or.inl _)
-  rw [ite_pow, zero_pow (pow_pos hp.out.pos _)]
+  rw [ite_pow, zero_pow (pow_ne_zero _ hp.out.ne_zero)]
   by_cases Pm : P m
-  · rw [if_pos Pm, if_neg _, zero_pow, add_zero]
-    · exact Fin.size_positive'
-    · exact not_not_intro Pm
+  · rw [if_pos Pm, if_neg $ not_not_intro Pm, zero_pow Fin.size_pos'.ne', add_zero]
   · rwa [if_neg Pm, if_pos, zero_add]
 #align witt_vector.select_add_select_not WittVector.select_add_select_not

07980376

chore: remove nonterminal simp (#7580)

Removes nonterminal simps on lines looking like simp [...]

6fc8e6ec

Diff

@@ -129,7 +129,7 @@ theorem coeff_add_of_disjoint (x y : 𝕎 R) (h : ∀ n, x.coeff n = 0 ∨ y.coe
   calc
     (x + y).coeff n = z.coeff n := by rw [← hx, ← hy, select_add_select_not P z]
     _ = x.coeff n + y.coeff n := by
-      simp [mk]
+      simp only [mk._eq_1]
       split_ifs with y0
       · rw [y0, add_zero]
       · rw [h n |>.resolve_right y0, zero_add]

07980376

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

@@ -36,7 +36,7 @@ and shows how that polynomial interacts with `MvPolynomial.bind₁`.
 -/
 
 
-variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) {R : Type _} [CommRing R]
+variable {p : ℕ} [hp : Fact p.Prime] (n : ℕ) {R : Type*} [CommRing R]
 
 -- type as `\bbW`
 local notation "𝕎" => WittVector p

07980376

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

depends on: #5966

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

89aa3a3b

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2020 Johan Commelin, Robert Y. Lewis. 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.init_tail
-! leanprover-community/mathlib commit 0798037604b2d91748f9b43925fb7570a5f3256c
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.RingTheory.WittVector.Basic
 import Mathlib.RingTheory.WittVector.IsPoly
 
+#align_import ring_theory.witt_vector.init_tail from "leanprover-community/mathlib"@"0798037604b2d91748f9b43925fb7570a5f3256c"
+
 /-!
 
 # `init` and `tail`

07980376

feat: port RingTheory.WittVector.MulCoeff (#5554)

b47e7d28

Diff

@@ -102,7 +102,7 @@ theorem select_add_select_not : ∀ x : 𝕎 R, select P x + select (fun i => ¬
       wittPolynomial p ℤ n by
     apply_fun aeval x.coeff at this
     simpa only [AlgHom.map_add, aeval_bind₁, ← coeff_select]
-  simp only [wittPolynomial_eq_sum_c_mul_x_pow, selectPoly, AlgHom.map_sum, AlgHom.map_pow,
+  simp only [wittPolynomial_eq_sum_C_mul_X_pow, selectPoly, AlgHom.map_sum, AlgHom.map_pow,
     AlgHom.map_mul, bind₁_X_right, bind₁_C_right, ← Finset.sum_add_distrib, ← mul_add]
   apply Finset.sum_congr rfl
   refine' fun m _ => mul_eq_mul_left_iff.mpr (Or.inl _)

07980376

feat: port RingTheory.WittVector.InitTail (#5520)

Co-authored-by: Johan Commelin <johan@commelin.net> Co-authored-by: Jeremy Tan Jie Rui <reddeloostw@gmail.com>

bbbec1ac

`ring_theory.witt_vector.init_tail` ⟷ `Mathlib.RingTheory.WittVector.InitTail`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 675

ring_theory.witt_vector.init_tail ⟷ Mathlib.RingTheory.WittVector.InitTail

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 675

`ring_theory.witt_vector.init_tail` ⟷ `Mathlib.RingTheory.WittVector.InitTail`