Theorems · Theorem · combinatorics
Fintype.sum_prod_type
∀ {γ : Type u_3} {α₁ : Type u_4} {α₂ : Type u_5} [inst : Fintype α₁] [inst_1 : Fintype α₂] [inst_2 : AddCommMonoid γ]
(f : α₁ × α₂ → γ), ∑ x, f x = ∑ x, ∑ y, f (x, y)The sum over a product type equals the sum of fiberwise
sums. For rewriting in the reverse direction, use Fintype.sum_prod_type'.
- Defined in
- Mathlib.Data.Fintype.BigOperators
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeFintypeAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddCommMonoidstatement and proof · cited by 12,281
- Fintypestatement and proof · cited by 7,736
- Finset.sumstatement · cited by 5,195
- Finset.univstatement and proof · cited by 3,473
- Finset.sum_productproof · cited by 27
Cited by6
Results whose statement or proof uses this declaration.
- AlgHom.mulLeftRightMatrix.comp_invproof · cited by 1
- AlgHom.mulLeftRightMatrix.inv_compproof · cited by 1
- mk_mem_convexHull_prodproof · cited by 1
- Matrix.dotProduct_hadamard_mulVec_eq_kroneckerproof · cited by 1
- RingHom.locally_stableUnderCompositionproof · cited by 0
- Matrix.trace_blockDiagonalproof · cited by 0