Theorems · Theorem · ring theory
Finset.prod_add
∀ {ι : Type u_1} {R : Type u_4} [inst : CommSemiring R] [inst_1 : DecidableEq ι] (f g : ι → R) (s : Finset ι),
∏ i ∈ s, (f i + g i) = ∑ t ∈ s.powerset, (∏ i ∈ t, f i) * ∏ i ∈ s \ t, g iThe product of f a + g a over all of s is the sum over the powerset of s of the product of
f over a subset t times the product of g over the complement of t
- Defined in
- Mathlib.Algebra.BigOperators.Ring.Finset
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommSemiringDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites25
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- CommSemiringstatement and proof · cited by 10,911
- Finset.sumstatement · cited by 5,195
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidproof · cited by 2,264
- Finset.filterproof · cited by 949
- Finset.mapproof · cited by 747
- Finset.prod_congrproof · cited by 646
- Finset.extproof · cited by 565
- Finset.sum_singletonproof · cited by 251
- Finset.sum_insertproof · cited by 196
- Finset.attachproof · cited by 168
Cited by7
Results whose statement or proof uses this declaration.
- Finset.prod_subproof · cited by 2
- Finset.prod_one_addproof · cited by 2
- ArithmeticFunction.IsMultiplicative.prodPrimeFactors_add_of_squarefreeproof · cited by 1
- Finset.sum_pow_mul_eq_add_powproof · cited by 1
- Fintype.prod_addproof · cited by 0
- Finset.prod_add_oneproof · cited by 0
- AddDissociated.randomisationproof · cited by 0