AFTD Auto-Formalizing Theoretical Domains

postage_stamp_number_neg

def

n♭_h(k): the largest n_h(A) over sets A of k + 1 integers containing at least one negative integer.

Statement

noncomputable def postage_stamp_number_neg (h k : ℕ) : ℕ
Defined in
arXiv:2610.19470 (Positivity and negativity for h-bases for n), Sec. 1 (n♭_h(k)).
Verified
17 Oct 2026
Axioms
none listed
Built on 2
  • 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.
  • postage_stamp_basis_rangen_h(A): the largest n such that every integer in [0, n] belongs to hA (A is an h-basis for n).
Used by 9

Lean source view module on GitHub

/-- `n♭_h(k)`: the largest `n_h(A)` over `(k+1)`-element sets `A ⊆ ℤ` with a negative element. -/
noncomputable def postage_stamp_number_neg (h k : ℕ) : ℕ :=
  sSup {n | ∃ A : Finset ℤ, A.card = k + 1 ∧ (∃ a ∈ A, a < 0) ∧ postage_stamp_basis_range h A = n}
See it in the graphDiscuss this resultChallenge it