Theorems · Theorem · commutative algebra
DividedPowerAlgebra.dp_sum
∀ {R : Type u_2} {M : Type u_3} [inst : CommSemiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M] {ι : Type u_4}
[inst_3 : DecidableEq ι] (s : Finset ι) (q : ℕ) (x : ι → M),
DividedPowerAlgebra.dp R q (s.sum x) = ∑ k ∈ s.sym q, ∏ i ∈ s, DividedPowerAlgebra.dp R (Multiset.count i ↑k) (x i)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement and proof · cited by 20,661
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- CommSemiringstatement and proof · cited by 10,911
- Top.topproof · cited by 9,680
- Finsuppstatement · cited by 5,255
- Finset.sumstatement · cited by 5,195
- Finset.prodstatement · cited by 2,356
- MvPolynomialstatement · cited by 2,140
- Multiset.countstatement · cited by 302
- Symstatement · cited by 150
- Sym.toMultisetstatement · cited by 51
Cited by1
Results whose statement or proof uses this declaration.
- DividedPowerAlgebra.dp_sum_smulproof · cited by 0