group_theory.group_action.big_operators

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-2023-09-24-06

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

5655435f

Diff

@@ -3,10 +3,10 @@ Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathbin.Algebra.BigOperators.Basic
-import Mathbin.Data.Finset.Basic
-import Mathbin.Data.Multiset.Basic
-import Mathbin.GroupTheory.GroupAction.Defs
+import Algebra.BigOperators.Basic
+import Data.Finset.Basic
+import Data.Multiset.Basic
+import GroupTheory.GroupAction.Defs
 
 #align_import group_theory.group_action.big_operators from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"

327c3c0d

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,17 +2,14 @@
 Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module group_theory.group_action.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.Algebra.BigOperators.Basic
 import Mathbin.Data.Finset.Basic
 import Mathbin.Data.Multiset.Basic
 import Mathbin.GroupTheory.GroupAction.Defs
 
+#align_import group_theory.group_action.big_operators from "leanprover-community/mathlib"@"327c3c0d9232d80e250dc8f65e7835b82b266ea5"
+
 /-!
 # Lemmas about group actions on big operators

327c3c0d

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -31,9 +31,11 @@ section
 
 variable [AddMonoid β] [DistribSMul α β]
 
+#print List.smul_sum /-
 theorem List.smul_sum {r : α} {l : List β} : r • l.Sum = (l.map ((· • ·) r)).Sum :=
   (DistribSMul.toAddMonoidHom β r).map_list_sum l
 #align list.smul_sum List.smul_sum
+-/
 
 end
 
@@ -41,9 +43,11 @@ section
 
 variable [Monoid α] [Monoid β] [MulDistribMulAction α β]
 
+#print List.smul_prod /-
 theorem List.smul_prod {r : α} {l : List β} : r • l.Prod = (l.map ((· • ·) r)).Prod :=
   (MulDistribMulAction.toMonoidHom β r).map_list_prod l
 #align list.smul_prod List.smul_prod
+-/
 
 end
 
@@ -51,14 +55,18 @@ section
 
 variable [AddCommMonoid β] [DistribSMul α β]
 
+#print Multiset.smul_sum /-
 theorem Multiset.smul_sum {r : α} {s : Multiset β} : r • s.Sum = (s.map ((· • ·) r)).Sum :=
   (DistribSMul.toAddMonoidHom β r).map_multiset_sum s
 #align multiset.smul_sum Multiset.smul_sum
+-/
 
+#print Finset.smul_sum /-
 theorem Finset.smul_sum {r : α} {f : γ → β} {s : Finset γ} :
     r • ∑ x in s, f x = ∑ x in s, r • f x :=
   (DistribSMul.toAddMonoidHom β r).map_sum f s
 #align finset.smul_sum Finset.smul_sum
+-/
 
 end

327c3c0d

bump to nightly-2023-06-10-07

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

3fdc57bc

Diff

@@ -56,7 +56,7 @@ theorem Multiset.smul_sum {r : α} {s : Multiset β} : r • s.Sum = (s.map ((·
 #align multiset.smul_sum Multiset.smul_sum
 
 theorem Finset.smul_sum {r : α} {f : γ → β} {s : Finset γ} :
-    (r • ∑ x in s, f x) = ∑ x in s, r • f x :=
+    r • ∑ x in s, f x = ∑ x in s, r • f x :=
   (DistribSMul.toAddMonoidHom β r).map_sum f s
 #align finset.smul_sum Finset.smul_sum
 
@@ -74,7 +74,7 @@ theorem Multiset.smul_prod {r : α} {s : Multiset β} : r • s.Prod = (s.map ((
 
 #print Finset.smul_prod /-
 theorem Finset.smul_prod {r : α} {f : γ → β} {s : Finset γ} :
-    (r • ∏ x in s, f x) = ∏ x in s, r • f x :=
+    r • ∏ x in s, f x = ∏ x in s, r • f x :=
   (MulDistribMulAction.toMonoidHom β r).map_prod f s
 #align finset.smul_prod Finset.smul_prod
 -/

327c3c0d

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -25,7 +25,7 @@ Note that analogous lemmas for `module`s like `finset.sum_smul` appear in other
 
 variable {α β γ : Type _}
 
-open BigOperators
+open scoped BigOperators
 
 section

327c3c0d

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -31,12 +31,6 @@ section
 
 variable [AddMonoid β] [DistribSMul α β]
 
-/- warning: list.smul_sum -> List.smul_sum is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {β : Type.{u2}} [_inst_1 : AddMonoid.{u2} β] [_inst_2 : DistribSMul.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β _inst_1)] {r : α} {l : List.{u2} β}, Eq.{succ u2} β (SMul.smul.{u1, u2} α β (SMulZeroClass.toHasSmul.{u1, u2} α β (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (DistribSMul.toSmulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β _inst_1) _inst_2)) r (List.sum.{u2} β (AddZeroClass.toHasAdd.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) l)) (List.sum.{u2} β (AddZeroClass.toHasAdd.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (List.map.{u2, u2} β β (SMul.smul.{u1, u2} α β (SMulZeroClass.toHasSmul.{u1, u2} α β (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (DistribSMul.toSmulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β _inst_1) _inst_2)) r) l))
-but is expected to have type
-  forall {α : Type.{u1}} {β : Type.{u2}} [_inst_1 : AddMonoid.{u2} β] [_inst_2 : DistribSMul.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β _inst_1)] {r : α} {l : List.{u2} β}, Eq.{succ u2} β (HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (SMulZeroClass.toSMul.{u1, u2} α β (AddMonoid.toZero.{u2} β _inst_1) (DistribSMul.toSMulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β _inst_1) _inst_2))) r (List.sum.{u2} β (AddZeroClass.toAdd.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (AddMonoid.toZero.{u2} β _inst_1) l)) (List.sum.{u2} β (AddZeroClass.toAdd.{u2} β (AddMonoid.toAddZeroClass.{u2} β _inst_1)) (AddMonoid.toZero.{u2} β _inst_1) (List.map.{u2, u2} β β ((fun (x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.59 : α) (x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.61 : β) => HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (SMulZeroClass.toSMul.{u1, u2} α β (AddMonoid.toZero.{u2} β _inst_1) (DistribSMul.toSMulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β _inst_1) _inst_2))) x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.59 x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.61) r) l))
-Case conversion may be inaccurate. Consider using '#align list.smul_sum List.smul_sumₓ'. -/
 theorem List.smul_sum {r : α} {l : List β} : r • l.Sum = (l.map ((· • ·) r)).Sum :=
   (DistribSMul.toAddMonoidHom β r).map_list_sum l
 #align list.smul_sum List.smul_sum
@@ -47,12 +41,6 @@ section
 
 variable [Monoid α] [Monoid β] [MulDistribMulAction α β]
 
-/- warning: list.smul_prod -> List.smul_prod is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {β : Type.{u2}} [_inst_1 : Monoid.{u1} α] [_inst_2 : Monoid.{u2} β] [_inst_3 : MulDistribMulAction.{u1, u2} α β _inst_1 _inst_2] {r : α} {l : List.{u2} β}, Eq.{succ u2} β (SMul.smul.{u1, u2} α β (MulAction.toHasSmul.{u1, u2} α β _inst_1 (MulDistribMulAction.toMulAction.{u1, u2} α β _inst_1 _inst_2 _inst_3)) r (List.prod.{u2} β (MulOneClass.toHasMul.{u2} β (Monoid.toMulOneClass.{u2} β _inst_2)) (MulOneClass.toHasOne.{u2} β (Monoid.toMulOneClass.{u2} β _inst_2)) l)) (List.prod.{u2} β (MulOneClass.toHasMul.{u2} β (Monoid.toMulOneClass.{u2} β _inst_2)) (MulOneClass.toHasOne.{u2} β (Monoid.toMulOneClass.{u2} β _inst_2)) (List.map.{u2, u2} β β (SMul.smul.{u1, u2} α β (MulAction.toHasSmul.{u1, u2} α β _inst_1 (MulDistribMulAction.toMulAction.{u1, u2} α β _inst_1 _inst_2 _inst_3)) r) l))
-but is expected to have type
-  forall {α : Type.{u1}} {β : Type.{u2}} [_inst_1 : Monoid.{u1} α] [_inst_2 : Monoid.{u2} β] [_inst_3 : MulDistribMulAction.{u1, u2} α β _inst_1 _inst_2] {r : α} {l : List.{u2} β}, Eq.{succ u2} β (HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (MulAction.toSMul.{u1, u2} α β _inst_1 (MulDistribMulAction.toMulAction.{u1, u2} α β _inst_1 _inst_2 _inst_3))) r (List.prod.{u2} β (MulOneClass.toMul.{u2} β (Monoid.toMulOneClass.{u2} β _inst_2)) (Monoid.toOne.{u2} β _inst_2) l)) (List.prod.{u2} β (MulOneClass.toMul.{u2} β (Monoid.toMulOneClass.{u2} β _inst_2)) (Monoid.toOne.{u2} β _inst_2) (List.map.{u2, u2} β β ((fun (x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.137 : α) (x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.139 : β) => HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (MulAction.toSMul.{u1, u2} α β _inst_1 (MulDistribMulAction.toMulAction.{u1, u2} α β _inst_1 _inst_2 _inst_3))) x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.137 x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.139) r) l))
-Case conversion may be inaccurate. Consider using '#align list.smul_prod List.smul_prodₓ'. -/
 theorem List.smul_prod {r : α} {l : List β} : r • l.Prod = (l.map ((· • ·) r)).Prod :=
   (MulDistribMulAction.toMonoidHom β r).map_list_prod l
 #align list.smul_prod List.smul_prod
@@ -63,22 +51,10 @@ section
 
 variable [AddCommMonoid β] [DistribSMul α β]
 
-/- warning: multiset.smul_sum -> Multiset.smul_sum is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {β : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} β] [_inst_2 : DistribSMul.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))] {r : α} {s : Multiset.{u2} β}, Eq.{succ u2} β (SMul.smul.{u1, u2} α β (SMulZeroClass.toHasSmul.{u1, u2} α β (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))) (DistribSMul.toSmulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2)) r (Multiset.sum.{u2} β _inst_1 s)) (Multiset.sum.{u2} β _inst_1 (Multiset.map.{u2, u2} β β (SMul.smul.{u1, u2} α β (SMulZeroClass.toHasSmul.{u1, u2} α β (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))) (DistribSMul.toSmulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2)) r) s))
-but is expected to have type
-  forall {α : Type.{u1}} {β : Type.{u2}} [_inst_1 : AddCommMonoid.{u2} β] [_inst_2 : DistribSMul.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))] {r : α} {s : Multiset.{u2} β}, Eq.{succ u2} β (HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (SMulZeroClass.toSMul.{u1, u2} α β (AddMonoid.toZero.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) (DistribSMul.toSMulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2))) r (Multiset.sum.{u2} β _inst_1 s)) (Multiset.sum.{u2} β _inst_1 (Multiset.map.{u2, u2} β β ((fun (x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.208 : α) (x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.210 : β) => HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (SMulZeroClass.toSMul.{u1, u2} α β (AddMonoid.toZero.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) (DistribSMul.toSMulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2))) x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.208 x._@.Mathlib.GroupTheory.GroupAction.BigOperators._hyg.210) r) s))
-Case conversion may be inaccurate. Consider using '#align multiset.smul_sum Multiset.smul_sumₓ'. -/
 theorem Multiset.smul_sum {r : α} {s : Multiset β} : r • s.Sum = (s.map ((· • ·) r)).Sum :=
   (DistribSMul.toAddMonoidHom β r).map_multiset_sum s
 #align multiset.smul_sum Multiset.smul_sum
 
-/- warning: finset.smul_sum -> Finset.smul_sum is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {β : Type.{u2}} {γ : Type.{u3}} [_inst_1 : AddCommMonoid.{u2} β] [_inst_2 : DistribSMul.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))] {r : α} {f : γ -> β} {s : Finset.{u3} γ}, Eq.{succ u2} β (SMul.smul.{u1, u2} α β (SMulZeroClass.toHasSmul.{u1, u2} α β (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))) (DistribSMul.toSmulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2)) r (Finset.sum.{u2, u3} β γ _inst_1 s (fun (x : γ) => f x))) (Finset.sum.{u2, u3} β γ _inst_1 s (fun (x : γ) => SMul.smul.{u1, u2} α β (SMulZeroClass.toHasSmul.{u1, u2} α β (AddZeroClass.toHasZero.{u2} β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))) (DistribSMul.toSmulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2)) r (f x)))
-but is expected to have type
-  forall {α : Type.{u1}} {β : Type.{u2}} {γ : Type.{u3}} [_inst_1 : AddCommMonoid.{u2} β] [_inst_2 : DistribSMul.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1))] {r : α} {f : γ -> β} {s : Finset.{u3} γ}, Eq.{succ u2} β (HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (SMulZeroClass.toSMul.{u1, u2} α β (AddMonoid.toZero.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) (DistribSMul.toSMulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2))) r (Finset.sum.{u2, u3} β γ _inst_1 s (fun (x : γ) => f x))) (Finset.sum.{u2, u3} β γ _inst_1 s (fun (x : γ) => HSMul.hSMul.{u1, u2, u2} α β β (instHSMul.{u1, u2} α β (SMulZeroClass.toSMul.{u1, u2} α β (AddMonoid.toZero.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) (DistribSMul.toSMulZeroClass.{u1, u2} α β (AddMonoid.toAddZeroClass.{u2} β (AddCommMonoid.toAddMonoid.{u2} β _inst_1)) _inst_2))) r (f x)))
-Case conversion may be inaccurate. Consider using '#align finset.smul_sum Finset.smul_sumₓ'. -/
 theorem Finset.smul_sum {r : α} {f : γ → β} {s : Finset γ} :
     (r • ∑ x in s, f x) = ∑ x in s, r • f x :=
   (DistribSMul.toAddMonoidHom β r).map_sum f s

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: Replace (· op ·) a by (a op ·) (#8843)

I used the regex $\(· (.) ·$ (.)\), replacing with ($2 $1 ·).

d14658b4

Diff

@@ -25,7 +25,7 @@ section
 
 variable [AddMonoid β] [DistribSMul α β]
 
-theorem List.smul_sum {r : α} {l : List β} : r • l.sum = (l.map ((· • ·) r)).sum :=
+theorem List.smul_sum {r : α} {l : List β} : r • l.sum = (l.map (r • ·)).sum :=
   (DistribSMul.toAddMonoidHom β r).map_list_sum l
 #align list.smul_sum List.smul_sum
 
@@ -35,7 +35,7 @@ section
 
 variable [Monoid α] [Monoid β] [MulDistribMulAction α β]
 
-theorem List.smul_prod {r : α} {l : List β} : r • l.prod = (l.map ((· • ·) r)).prod :=
+theorem List.smul_prod {r : α} {l : List β} : r • l.prod = (l.map (r • ·)).prod :=
   (MulDistribMulAction.toMonoidHom β r).map_list_prod l
 #align list.smul_prod List.smul_prod
 
@@ -45,7 +45,7 @@ section
 
 variable [AddCommMonoid β] [DistribSMul α β]
 
-theorem Multiset.smul_sum {r : α} {s : Multiset β} : r • s.sum = (s.map ((· • ·) r)).sum :=
+theorem Multiset.smul_sum {r : α} {s : Multiset β} : r • s.sum = (s.map (r • ·)).sum :=
   (DistribSMul.toAddMonoidHom β r).map_multiset_sum s
 #align multiset.smul_sum Multiset.smul_sum
 
@@ -60,7 +60,7 @@ section
 
 variable [Monoid α] [CommMonoid β] [MulDistribMulAction α β]
 
-theorem Multiset.smul_prod {r : α} {s : Multiset β} : r • s.prod = (s.map ((· • ·) r)).prod :=
+theorem Multiset.smul_prod {r : α} {s : Multiset β} : r • s.prod = (s.map (r • ·)).prod :=
   (MulDistribMulAction.toMonoidHom β r).map_multiset_prod s
 #align multiset.smul_prod Multiset.smul_prod

008205aa

chore: remove deprecated MonoidHom.map_prod, AddMonoidHom.map_sum (#8787)

aca3f237

Diff

@@ -51,7 +51,7 @@ theorem Multiset.smul_sum {r : α} {s : Multiset β} : r • s.sum = (s.map ((·
 
 theorem Finset.smul_sum {r : α} {f : γ → β} {s : Finset γ} :
     (r • ∑ x in s, f x) = ∑ x in s, r • f x :=
-  (DistribSMul.toAddMonoidHom β r).map_sum f s
+  map_sum (DistribSMul.toAddMonoidHom β r) f s
 #align finset.smul_sum Finset.smul_sum
 
 end
@@ -66,7 +66,7 @@ theorem Multiset.smul_prod {r : α} {s : Multiset β} : r • s.prod = (s.map ((
 
 theorem Finset.smul_prod {r : α} {f : γ → β} {s : Finset γ} :
     (r • ∏ x in s, f x) = ∏ x in s, r • f x :=
-  (MulDistribMulAction.toMonoidHom β r).map_prod f s
+  map_prod (MulDistribMulAction.toMonoidHom β r) f s
 #align finset.smul_prod Finset.smul_prod
 
 end

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

@@ -17,7 +17,7 @@ Note that analogous lemmas for `Module`s like `Finset.sum_smul` appear in other
 -/
 
 
-variable {α β γ : Type _}
+variable {α β γ : Type*}
 
 open BigOperators

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,17 +2,14 @@
 Copyright (c) 2020 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module group_theory.group_action.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.Algebra.BigOperators.Basic
 import Mathlib.Data.Finset.Basic
 import Mathlib.Data.Multiset.Basic
 import Mathlib.GroupTheory.GroupAction.Defs
 
+#align_import group_theory.group_action.big_operators from "leanprover-community/mathlib"@"008205aa645b3f194c1da47025c5f110c8406eab"
+
 /-!
 # Lemmas about group actions on big operators

008205aa

chore: scoped BigOperators notation (#1952)

e707fa67

Diff

@@ -22,8 +22,7 @@ Note that analogous lemmas for `Module`s like `Finset.sum_smul` appear in other
 
 variable {α β γ : Type _}
 
--- Porting note: big operators are currently global
---open BigOperators
+open BigOperators
 
 section

008205aa

feat: port GroupTheory.GroupAction.BigOperators (#1655)

6bec256d

`group_theory.group_action.big_operators` ⟷ `Mathlib.GroupTheory.GroupAction.BigOperators`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3 + 189

group_theory.group_action.big_operators ⟷ Mathlib.GroupTheory.GroupAction.BigOperators

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 3 + 189

`group_theory.group_action.big_operators` ⟷ `Mathlib.GroupTheory.GroupAction.BigOperators`