additive_basis_threshold
def
The 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 natural numbers l such that every regular multiset S : Multiset G over G with S.card ≥ l satisfies IsAdditiveBasis S.
Statement
noncomputable def additive_basis_threshold (G : Type*) [AddCommGroup G] : ℕ
- Defined in
- scout/2610-13103-additive-bases-and-the-zero-sum-invariant-mathsf-n-g-for-gr.md:73
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 2
- IsRegularSequenceA sequence S over an additive commutative group G is regular if for every proper additive subgroup H < G, the number of terms of S…
- IsAdditiveBasisA 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…
- Used by 1
- 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…
Read back from the Lean
For an additive abelian group G, additive_basis_threshold G is defined as the infimum (sInf in ℕ) of the set of natural numbers l such that for every multiset S of elements of G, if S is a regular sequence and l ≤ S.card, then S is an additive basis for 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
/-- The minimal integer l such that every regular sequence S over G with |S| ≥ l is an additive basis. -/ noncomputable def additive_basis_threshold (G : Type*) [AddCommGroup G] : ℕ := sInf {l : ℕ | ∀ S : Multiset G, IsRegularSequence S → l ≤ S.card → IsAdditiveBasis S}