Theorems · Definition · combinatorics
Finset.subsetSum
{M : Type u_1} → [DecidableEq M] → [AddCommMonoid M] → Finset M → Finset MThe subset-sum of a finite set A in a commutative monoid is the set of all sums
of subsets of A.
- Defined in
- Mathlib.Combinatorics.Additive.SubsetSum
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqAddCommMonoid
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.
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumproof · cited by 5,195
- Finset.imageproof · cited by 910
- Finset.powersetproof · cited by 93
Cited by11
Results whose statement or proof uses this declaration.
- Finset.mem_subsetSum_iffstatement · cited by 3
- Finset.subsetSum_monostatement · cited by 2
- Finset.card_add_card_subsetSum_lt_card_subsetSum_insert_maxstatement and proof · cited by 1
- Finset.card_succ_choose_two_lt_card_subsetSum_of_posstatement and proof · cited by 1
- Finset.zero_mem_subsetSumstatement · cited by 1
- Finset.subset_subsetSumstatement · cited by 1
- Finset.vadd_finset_subsetSum_subset_subsetSum_insertstatement and proof · cited by 1
- Finset.nonneg_of_mem_subsetSumstatement · cited by 1
- Finset.subsetSum_erase_zerostatement and proof · cited by 1
- Finset.card_choose_two_lt_card_subsetSum_of_nonnegstatement and proof · cited by 0
- Finset.subsetSum_nonemptystatement · cited by 0