Theorems · Definition · combinatorics
Finset.fold
{α : Type u_1} →
{β : Type u_2} → (op : β → β → β) → [hc : Std.Commutative op] → [ha : Std.Associative op] → β → (α → β) → Finset α → βfold op b f s folds the commutative associative operation op over the
f-image of s, i.e. fold (+) b f {1,2,3} = f 1 + f 2 + f 3 + b.
- Defined in
- Mathlib.Data.Finset.Fold
- Cited by
- 46 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- Multiset.mapproof · cited by 876
- Finset.valproof · cited by 438
- Multiset.foldproof · cited by 38
Cited by50
Results whose statement or proof uses this declaration.
- Finset.supproof · cited by 530
- Finset.infproof · cited by 219
- Finset.sum_add_distribproof · cited by 131
- Finset.prod_mul_distribproof · cited by 68
- Finset.gcdproof · cited by 49
- Finset.lcmproof · cited by 37
- Finset.fold_congrstatement and proof · cited by 11
- Finset.fold_insertstatement · cited by 11
- Polynomial.natDegree_sum_lestatement · cited by 9
- Finset.sum_disjUnionproof · cited by 8
- Finset.fold_consstatement · cited by 6
- Finset.fold_insert_idemstatement and proof · cited by 5