AFTD Auto-Formalizing Theoretical Domains

postage_stamp_basis_range

def

n_h(A): the largest n such that every integer in [0, n] belongs to hA (A is an h-basis for n).

Statement

noncomputable def postage_stamp_basis_range (h : ℕ) (A : Finset ℤ) : ℕ
Defined in
arXiv:2610.19470 (Positivity and negativity for h-bases for n), Sec. 1 (n_h(A)).
Verified
17 Oct 2026
Axioms
none listed
Built on 1
  • int_mem_h_fold_sumsetm belongs to the h-fold sumset hA: m is a sum of exactly h, not necessarily distinct, elements of A.
Used by 27

Lean source view module on GitHub

/-- `n_h(A)`: the largest `n` with `[0, n] ⊆ hA`. The set of such `n` is bounded since `hA` is finite; it is `0` (not `-1`) when `0 ∉ hA`, which only matters for sets that are no basis at all. -/
noncomputable def postage_stamp_basis_range (h : ℕ) (A : Finset ℤ) : ℕ :=
  sSup {n : ℕ | ∀ m : ℕ, m ≤ n → int_mem_h_fold_sumset h A m}
See it in the graphDiscuss this resultChallenge it