data.nat.gcd.big_operators | 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

008205aa

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

327c3c0d

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2014 Jeremy Avigad. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Jeremy Avigad, Leonardo de Moura
 -/
-import Data.Nat.Gcd.Basic
+import Data.Nat.GCD.Basic
 import Algebra.BigOperators.Basic
 
 #align_import data.nat.gcd.big_operators from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"

327c3c0d

bump to nightly-2023-12-16-06

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

4e55c28d

Diff

@@ -21,20 +21,20 @@ namespace Nat
 
 open scoped BigOperators
 
-#print Nat.coprime_prod_left /-
+#print Nat.Coprime.prod_left /-
 /-- See `is_coprime.prod_left` for the corresponding lemma about `is_coprime` -/
-theorem coprime_prod_left {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
+theorem Nat.Coprime.prod_left {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
     (∀ i : ι, i ∈ t → Coprime (s i) x) → Coprime (∏ i : ι in t, s i) x :=
   Finset.prod_induction s (fun y => y.Coprime x) (fun a b => Coprime.mul) (by simp)
-#align nat.coprime_prod_left Nat.coprime_prod_left
+#align nat.coprime_prod_left Nat.Coprime.prod_left
 -/
 
-#print Nat.coprime_prod_right /-
+#print Nat.Coprime.prod_right /-
 /-- See `is_coprime.prod_right` for the corresponding lemma about `is_coprime` -/
-theorem coprime_prod_right {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
+theorem Nat.Coprime.prod_right {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
     (∀ i : ι, i ∈ t → Coprime x (s i)) → Coprime x (∏ i : ι in t, s i) :=
   Finset.prod_induction s (fun y => x.Coprime y) (fun a b => Coprime.mul_right) (by simp)
-#align nat.coprime_prod_right Nat.coprime_prod_right
+#align nat.coprime_prod_right Nat.Coprime.prod_right
 -/
 
 end Nat

327c3c0d

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) 2014 Jeremy Avigad. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Jeremy Avigad, Leonardo de Moura
 -/
-import Mathbin.Data.Nat.Gcd.Basic
-import Mathbin.Algebra.BigOperators.Basic
+import Data.Nat.Gcd.Basic
+import Algebra.BigOperators.Basic
 
 #align_import data.nat.gcd.big_operators from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"

327c3c0d

bump to nightly-2023-09-20-06

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

e28e6964

Diff

@@ -24,16 +24,16 @@ open scoped BigOperators
 #print Nat.coprime_prod_left /-
 /-- See `is_coprime.prod_left` for the corresponding lemma about `is_coprime` -/
 theorem coprime_prod_left {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → coprime (s i) x) → coprime (∏ i : ι in t, s i) x :=
-  Finset.prod_induction s (fun y => y.coprime x) (fun a b => coprime.mul) (by simp)
+    (∀ i : ι, i ∈ t → Coprime (s i) x) → Coprime (∏ i : ι in t, s i) x :=
+  Finset.prod_induction s (fun y => y.Coprime x) (fun a b => Coprime.mul) (by simp)
 #align nat.coprime_prod_left Nat.coprime_prod_left
 -/
 
 #print Nat.coprime_prod_right /-
 /-- See `is_coprime.prod_right` for the corresponding lemma about `is_coprime` -/
 theorem coprime_prod_right {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → coprime x (s i)) → coprime x (∏ i : ι in t, s i) :=
-  Finset.prod_induction s (fun y => x.coprime y) (fun a b => coprime.mul_right) (by simp)
+    (∀ i : ι, i ∈ t → Coprime x (s i)) → Coprime x (∏ i : ι in t, s i) :=
+  Finset.prod_induction s (fun y => x.Coprime y) (fun a b => Coprime.mul_right) (by simp)
 #align nat.coprime_prod_right Nat.coprime_prod_right
 -/

327c3c0d

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) 2014 Jeremy Avigad. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Jeremy Avigad, Leonardo de Moura
-
-! This file was ported from Lean 3 source module data.nat.gcd.big_operators
-! leanprover-community/mathlib commit 327c3c0d9232d80e250dc8f65e7835b82b266ea5
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Nat.Gcd.Basic
 import Mathbin.Algebra.BigOperators.Basic
 
+#align_import data.nat.gcd.big_operators from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"
+
 /-! # Lemmas about coprimality with big products.
 
 > THIS FILE IS SYNCHRONIZED WITH MATHLIB4.

327c3c0d

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -22,7 +22,7 @@ These lemmas are kept separate from `data.nat.gcd.basic` in order to minimize im
 
 namespace Nat
 
-open BigOperators
+open scoped BigOperators
 
 #print Nat.coprime_prod_left /-
 /-- See `is_coprime.prod_left` for the corresponding lemma about `is_coprime` -/

327c3c0d

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

008205aa

chore: reduce imports (#9830)

This uses the improved shake script from #9772 to reduce imports across mathlib. The corresponding noshake.json file has been added to #9772.

Co-authored-by: Mario Carneiro <di.gama@gmail.com>

f4c4ca61

Diff

@@ -3,7 +3,6 @@ Copyright (c) 2014 Jeremy Avigad. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Jeremy Avigad, Leonardo de Moura
 -/
-import Mathlib.Data.Nat.GCD.Basic
 import Mathlib.Algebra.BigOperators.Basic
 
 #align_import data.nat.gcd.big_operators from "leanprover-community/mathlib"@"008205aa645b3f194c1da47025c5f110c8406eab"

008205aa

feat(Data/Nat/GCD/BigOperators): add lemmas about coprimality with List.prod, Multiset.prod, Finset.prod (#9005)

Add coprime_xxx_prod_left_iff, coprime_xxx_prod_right_iff lemma for List, Multiset, Finset and Fintype. This is a PR separated from #8887.

Co-authored-by: jeh <hodellurt@gmail.com> Co-authored-by: Eric Wieser <wieser.eric@gmail.com>

c6e2a243

Diff

@@ -18,16 +18,46 @@ namespace Nat
 
 open BigOperators
 
+variable {ι : Type*}
+
+theorem coprime_list_prod_left_iff {l : List ℕ} {k : ℕ} :
+    Coprime l.prod k ↔ ∀ n ∈ l, Coprime n k := by
+  induction l <;> simp [Nat.coprime_mul_iff_left, *]
+
+theorem coprime_list_prod_right_iff {k : ℕ} {l : List ℕ} :
+    Coprime k l.prod ↔ ∀ n ∈ l, Coprime k n := by
+  simp_rw [coprime_comm (n := k), coprime_list_prod_left_iff]
+
+theorem coprime_multiset_prod_left_iff {m : Multiset ℕ} {k : ℕ} :
+    Coprime m.prod k ↔ ∀ n ∈ m, Coprime n k := by
+  induction m using Quotient.inductionOn; simpa using coprime_list_prod_left_iff
+
+theorem coprime_multiset_prod_right_iff {k : ℕ} {m : Multiset ℕ} :
+    Coprime k m.prod ↔ ∀ n ∈ m, Coprime k n := by
+  induction m using Quotient.inductionOn; simpa using coprime_list_prod_right_iff
+
+theorem coprime_prod_left_iff {t : Finset ι} {s : ι → ℕ} {x : ℕ} :
+    Coprime (∏ i in t, s i) x ↔ ∀ i ∈ t, Coprime (s i) x := by
+  simpa using coprime_multiset_prod_left_iff (m := t.val.map s)
+
+theorem coprime_prod_right_iff {x : ℕ} {t : Finset ι} {s : ι → ℕ} :
+    Coprime x (∏ i in t, s i) ↔ ∀ i ∈ t, Coprime x (s i) := by
+  simpa using coprime_multiset_prod_right_iff (m := t.val.map s)
+
 /-- See `IsCoprime.prod_left` for the corresponding lemma about `IsCoprime` -/
-theorem coprime_prod_left {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → Coprime (s i) x) → Coprime (∏ i : ι in t, s i) x :=
-  Finset.prod_induction s (fun y ↦ y.Coprime x) (fun a b ↦ Coprime.mul) (by simp)
-#align nat.coprime_prod_left Nat.coprime_prod_left
+alias ⟨_, Coprime.prod_left⟩ := coprime_prod_left_iff
+#align nat.coprime_prod_left Nat.Coprime.prod_left
 
 /-- See `IsCoprime.prod_right` for the corresponding lemma about `IsCoprime` -/
-theorem coprime_prod_right {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → Coprime x (s i)) → Coprime x (∏ i : ι in t, s i) :=
-  Finset.prod_induction s (fun y ↦ x.Coprime y) (fun a b ↦ Coprime.mul_right) (by simp)
-#align nat.coprime_prod_right Nat.coprime_prod_right
+alias ⟨_, Coprime.prod_right⟩ := coprime_prod_right_iff
+#align nat.coprime_prod_right Nat.Coprime.prod_right
+
+theorem coprime_fintype_prod_left_iff [Fintype ι] {s : ι → ℕ} {x : ℕ} :
+    Coprime (∏ i, s i) x ↔ ∀ i, Coprime (s i) x := by
+  simp [coprime_prod_left_iff]
+
+theorem coprime_fintype_prod_right_iff [Fintype ι] {x : ℕ} {s : ι → ℕ} :
+    Coprime x (∏ i, s i) ↔ ∀ i, Coprime x (s i) := by
+  simp [coprime_prod_right_iff]
 
 end Nat

008205aa

chore: bump to v4.1.0-rc1 (2nd attempt) (#7216)

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

bfaffcf1

Diff

@@ -20,14 +20,14 @@ open BigOperators
 
 /-- See `IsCoprime.prod_left` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_left {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → coprime (s i) x) → coprime (∏ i : ι in t, s i) x :=
-  Finset.prod_induction s (fun y ↦ y.coprime x) (fun a b ↦ coprime.mul) (by simp)
+    (∀ i : ι, i ∈ t → Coprime (s i) x) → Coprime (∏ i : ι in t, s i) x :=
+  Finset.prod_induction s (fun y ↦ y.Coprime x) (fun a b ↦ Coprime.mul) (by simp)
 #align nat.coprime_prod_left Nat.coprime_prod_left
 
 /-- See `IsCoprime.prod_right` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_right {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → coprime x (s i)) → coprime x (∏ i : ι in t, s i) :=
-  Finset.prod_induction s (fun y ↦ x.coprime y) (fun a b ↦ coprime.mul_right) (by simp)
+    (∀ i : ι, i ∈ t → Coprime x (s i)) → Coprime x (∏ i : ι in t, s i) :=
+  Finset.prod_induction s (fun y ↦ x.Coprime y) (fun a b ↦ Coprime.mul_right) (by simp)
 #align nat.coprime_prod_right Nat.coprime_prod_right
 
 end Nat

008205aa

Revert "chore: bump to v4.1.0-rc1 (#7174)" (#7198)

This reverts commit 6f8e8104. Unfortunately this bump was not linted correctly, as CI did not run runLinter Mathlib.

We can unrevert once that's fixed.

40b58304

Diff

@@ -20,14 +20,14 @@ open BigOperators
 
 /-- See `IsCoprime.prod_left` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_left {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → Coprime (s i) x) → Coprime (∏ i : ι in t, s i) x :=
-  Finset.prod_induction s (fun y ↦ y.Coprime x) (fun a b ↦ Coprime.mul) (by simp)
+    (∀ i : ι, i ∈ t → coprime (s i) x) → coprime (∏ i : ι in t, s i) x :=
+  Finset.prod_induction s (fun y ↦ y.coprime x) (fun a b ↦ coprime.mul) (by simp)
 #align nat.coprime_prod_left Nat.coprime_prod_left
 
 /-- See `IsCoprime.prod_right` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_right {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → Coprime x (s i)) → Coprime x (∏ i : ι in t, s i) :=
-  Finset.prod_induction s (fun y ↦ x.Coprime y) (fun a b ↦ Coprime.mul_right) (by simp)
+    (∀ i : ι, i ∈ t → coprime x (s i)) → coprime x (∏ i : ι in t, s i) :=
+  Finset.prod_induction s (fun y ↦ x.coprime y) (fun a b ↦ coprime.mul_right) (by simp)
 #align nat.coprime_prod_right Nat.coprime_prod_right
 
 end Nat

008205aa

chore: bump to v4.1.0-rc1 (#7174)

Some changes have already been review and delegated in #6910 and #7148.

The diff that needs looking at is https://github.com/leanprover-community/mathlib4/pull/7174/commits/64d6d07ee18163627c8f517eb31455411921c5ac

The std bump PR was insta-merged already!

Co-authored-by: leanprover-community-mathlib4-bot <leanprover-community-mathlib4-bot@users.noreply.github.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

6f8e8104

Diff

@@ -20,14 +20,14 @@ open BigOperators
 
 /-- See `IsCoprime.prod_left` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_left {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → coprime (s i) x) → coprime (∏ i : ι in t, s i) x :=
-  Finset.prod_induction s (fun y ↦ y.coprime x) (fun a b ↦ coprime.mul) (by simp)
+    (∀ i : ι, i ∈ t → Coprime (s i) x) → Coprime (∏ i : ι in t, s i) x :=
+  Finset.prod_induction s (fun y ↦ y.Coprime x) (fun a b ↦ Coprime.mul) (by simp)
 #align nat.coprime_prod_left Nat.coprime_prod_left
 
 /-- See `IsCoprime.prod_right` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_right {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
-    (∀ i : ι, i ∈ t → coprime x (s i)) → coprime x (∏ i : ι in t, s i) :=
-  Finset.prod_induction s (fun y ↦ x.coprime y) (fun a b ↦ coprime.mul_right) (by simp)
+    (∀ i : ι, i ∈ t → Coprime x (s i)) → Coprime x (∏ i : ι in t, s i) :=
+  Finset.prod_induction s (fun y ↦ x.Coprime y) (fun a b ↦ Coprime.mul_right) (by simp)
 #align nat.coprime_prod_right Nat.coprime_prod_right
 
 end Nat

008205aa

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

@@ -19,13 +19,13 @@ namespace Nat
 open BigOperators
 
 /-- See `IsCoprime.prod_left` for the corresponding lemma about `IsCoprime` -/
-theorem coprime_prod_left {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
+theorem coprime_prod_left {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
     (∀ i : ι, i ∈ t → coprime (s i) x) → coprime (∏ i : ι in t, s i) x :=
   Finset.prod_induction s (fun y ↦ y.coprime x) (fun a b ↦ coprime.mul) (by simp)
 #align nat.coprime_prod_left Nat.coprime_prod_left
 
 /-- See `IsCoprime.prod_right` for the corresponding lemma about `IsCoprime` -/
-theorem coprime_prod_right {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
+theorem coprime_prod_right {ι : Type*} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :
     (∀ i : ι, i ∈ t → coprime x (s i)) → coprime x (∏ i : ι in t, s i) :=
   Finset.prod_induction s (fun y ↦ x.coprime y) (fun a b ↦ coprime.mul_right) (by simp)
 #align nat.coprime_prod_right Nat.coprime_prod_right

008205aa

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) 2014 Jeremy Avigad. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Jeremy Avigad, Leonardo de Moura
-
-! This file was ported from Lean 3 source module data.nat.gcd.big_operators
-! leanprover-community/mathlib commit 008205aa645b3f194c1da47025c5f110c8406eab
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Nat.GCD.Basic
 import Mathlib.Algebra.BigOperators.Basic
 
+#align_import data.nat.gcd.big_operators from "leanprover-community/mathlib"@"008205aa645b3f194c1da47025c5f110c8406eab"
+
 /-! # Lemmas about coprimality with big products.
 
 These lemmas are kept separate from `Data.Nat.GCD.Basic` in order to minimize imports.

008205aa

chore: scoped BigOperators notation (#1952)

e707fa67

Diff

@@ -19,8 +19,7 @@ These lemmas are kept separate from `Data.Nat.GCD.Basic` in order to minimize im
 
 namespace Nat
 
--- Porting note: commented out the next line
--- open BigOperators
+open BigOperators
 
 /-- See `IsCoprime.prod_left` for the corresponding lemma about `IsCoprime` -/
 theorem coprime_prod_left {ι : Type _} {x : ℕ} {s : ι → ℕ} {t : Finset ι} :

008205aa

feat port: Data.Nat.GCD.BigOperators (#1649)

ebe63c71

`data.nat.gcd.big_operators` ⟷ `Mathlib.Data.Nat.GCD.BigOperators`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3 + 191

data.nat.gcd.big_operators ⟷ Mathlib.Data.Nat.GCD.BigOperators

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3 + 191

`data.nat.gcd.big_operators` ⟷ `Mathlib.Data.Nat.GCD.BigOperators`