IsAdditiveBasis
def
A multiset S over an additive commutative group G is an additive basis of G if for every element g of G, there exists a nonempty submultiset T of S (T ≤ S with T ≠ 0) whose multiset sum equals g.
Statement
def IsAdditiveBasis {G : Type*} [AddCommGroup G] (S : Multiset G) : Prop
- Defined in
- scout/2610-13103-additive-bases-and-the-zero-sum-invariant-mathsf-n-g-for-gr.md:91
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 4
- is_additive_basis_of_leIf a submultiset T of S is an additive basis of an additive commutative group G, then S is also an additive basis of G.
- additive_basis_thresholdThe additive basis threshold c_0(G) of an additive commutative group G is the minimal integer l, defined as the infimum of the set of…
- additive_basis_threshold_le_of_card_eqTo bound the additive basis threshold c_0(G) ≤ m, it suffices to show that every regular sequence S over G of cardinality exactly m is an…
- not_is_additive_basis_zeroFor any nontrivial additive commutative group G, the empty multiset 0 : Multiset G is not an additive basis (¬ IsAdditiveBasis (0 :…
Read back from the Lean
For a type G with an additive commutative group structure ([AddCommGroup G]) and a multiset S : Multiset G, IsAdditiveBasis S asserts that for every element g : G, there exists a multiset T : Multiset G such that:
1. T is a sub-multiset of S (T ≤ S),
2. T is non-empty (T ≠ 0), and
3. the sum of the elements of T is equal to g (T.sum = g).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A multiset S over G is an additive basis if every element of G is a sum of a nonempty submultiset of S. -/ def IsAdditiveBasis {G : Type*} [AddCommGroup G] (S : Multiset G) : Prop := ∀ g : G, ∃ T : Multiset G, T ≤ S ∧ T ≠ 0 ∧ T.sum = g