int_mem_h_fold_sumset
def
m belongs to the h-fold sumset hA: m is a sum of exactly h, not necessarily distinct, elements of A.
Statement
def int_mem_h_fold_sumset (h : ℕ) (A : Finset ℤ) (m : ℤ) : Prop
- Defined in
- arXiv:2610.19470 (Positivity and negativity for h-bases for n), Sec. 1 (the sumset hA).
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Used by 38
- postage_stamp_number_neg_two_of_odd_family_eFor h = 12r+5 (m = 6r+2), the set {-(2r+1), 2r+1, 4r+4} h-fold covers [0, 36r² + 48r + 12] = [0, n_h(2) - 2].
- postage_stamp_number_negn♭_h(k): the largest n_h(A) over sets A of k + 1 integers containing at least one negative integer.
- int_mem_h_fold_sumset_two_exampleSanity check: 4 = 1 + 3 lies in 2{0, 1, 3}.
- postage_stamp_basis_mem_h_fold_sumset_mod_twelve_eq_nineFor any r : ℕ and any m ≤ 36r² + 72r + 33, m belongs to the (12r+9)-fold sumset of {-(2r+2), 2r+2, 4r+5}.
- postage_stamp_number_neg_two_of_odd_upper_threeFor odd h ≥ 5 with h ≡ 11 (mod 12), every 3-element set with a negative element has h-range at most n_h(2) - 3.
- int_mem_h_fold_sumset_of_listThe sum of a list of h elements of A lies in hA.
- postage_stamp_basis_range_eight_neg_four_one_thirteen_fourteenThe set A = {−4, 1, 13, 14} is an 8-basis for 99: every integer in [0, 99] is a sum of exactly 8 elements of A, so n_8(A) ≥ 99.
- postage_stamp_basis_range_ge_of_mod_four_eq_twoFor h = 4w − 2 (w ≥ 1), the set A = {−w, w, w + 1} satisfies n_h(A) ≥ (w + 1)h = (h² + 6h)/4.
- postage_stamp_basis_range_one_zero_one_twoSanity check: with h = 1, A = {0, 1, 2} covers exactly [0, 2], so n_1(A) = 2.
- postage_stamp_basis_range_add_two_boundsIf [0, m² + 4m + 1] is contained in the (2m+1)-fold sumset of {a, a+x, a+y} with 0 < x < y and a < 0 (where m ≥ 2), then x and y are…
- postage_stamp_number_neg_three_eight_gen♭_8(3) ≥ 99: some 4-element set of integers with a negative element is an 8-basis for 99 (namely {−4, 1, 13, 14}).
- postage_stamp_number_neg_two_of_odd_range_geIf A is bounded above and h-fold covers [0, R], its h-range is at least R.
- postage_stamp_number_neg_two_of_odd_family_1For m ≥ 2 with m ≢ 2 (mod 3), the set {-1, 2, m} (2m+1)-fold covers [0, m² + 4m] = [0, n_h(2) - 2].
- postage_stamp_basis_range_add_one_le_of_neg_of_oddFor odd h ≥ 1, every 3-element set A of integers containing a negative integer has h-range n_h(A) < ⌊(h² + 6h + 1)/4⌋ = n_h(2); hence…
- postage_stamp_number_neg_two_of_odd_mem_of_stFor s + t ≤ h, h·a + s(b-a) + t(c-a) lies in the h-fold sumset of {a, b, c}.
- postage_stamp_number_neg_four_one_nine_two_add_six_leFor h = 419 (h ≡ 59 mod 60), the negative-allowed three-stamp number satisfies n♭_h(2) ≤ n_h(2) - 6, where n_h(2) = ⌊(h²+6h+1)/4⌋ = 44519.…
- postage_stamp_number_neg_two_of_odd_consAdding an element of A to an element of hA gives an element of (h+1)A.
- postage_stamp_basis_range_zero_one_ge_of_mod_four_eq_zeroFor h = 4w (w ≥ 1), the basis {0, 1, 2w + 1} = {0, 1, (h+2)/2} has h-range at least w(4w + 6) = (h² + 6h)/4: every integer in [0, w(4w+6)]…
- postage_stamp_number_neg_two_of_odd_range_ltIf a set does not h-fold cover [0, R] (R > 0), its h-range is less than R.
- postage_stamp_number_three_eight_eqThe classical postage stamp number with four stamps (one of them 0) and h = 8: n_8(3) = 89, attained by {0, 1, 9, 14}.
- postage_stamp_number_neg_two_eq_of_mod_four_eq_twoIf h ≥ 2 and h ≡ 2 (mod 4), then n♭_h(2) = n_h(2) = (h² + 6h)/4.
- postage_stamp_numberThe postage stamp number n_h(k): the largest n_h(A) over sets A of k + 1 nonnegative integers.
- postage_stamp_basis_range_neg_ge_of_mod_twelve_eq_nineFor h = 12r + 9, the set {-(2r+2), 2r+2, 4r+5} (which contains a negative integer) has h-range at least ⌊(h²+6h+1)/4⌋ - 1 = n_h(2) - 1.
- postage_stamp_number_three_eight_lt_negWith four stamps and h = 8, allowing a negative denomination strictly helps: n_8(3) = 89 < 99 ≤ n♭_8(3). (For three stamps the opposite…
- postage_stamp_basis_range_succ_le_card_powIf A is a nonempty finite set of integers, n_h(A) + 1 ≤ |A|^h: the integers 0, ..., n_h(A) are distinct elements of hA, which has at most…
- postage_stamp_number_neg_two_of_odd_rep_eFor h = 12r+5 and the set {-(2r+1), 2r+1, 4r+4}: (2r+1)D + (4r+4)t is an h-fold sum whenever 0 ≤ t, |D| ≤ h - t and h - t - D is even.
- postage_stamp_number_neg_two_of_odd_addAdding c copies of an element s of A to an element of kA gives an element of (k+c)A.
- postage_stamp_number_neg_two_of_odd_family_2For m ≥ 5 with m ≡ 5 (mod 6) and m ≢ 4 (mod 5), the set {-2, 3, m-1} (2m+1)-fold covers [0, m² + 4m - 1] = [0, n_h(2) - 3].
- postage_stamp_basis_range_zero_one_ge_of_mod_four_eq_twoFor h = 4w - 2 (w ≥ 1), the basis {0, 1, 2w} = {0, 1, (h+2)/2} has h-range at least (w+1)h = (h² + 6h)/4: every integer in [0, (w+1)h] is…
- int_mem_h_fold_sumset_le_of_forall_leIf every element of A is at most b, every element of hA is at most h·b.
- postage_stamp_number_neg_two_of_odd_upper_fourFor odd h ≥ 5 with h ≡ 59 (mod 60), every 3-element set with a negative element has h-range at most n_h(2) - 4.
- postage_stamp_basis_range_add_two_le_of_neg_of_oddFor odd h ≥ 5 with h ≢ 9 (mod 12), every 3-element set of integers containing a negative integer has h-range at most n_h(2) - 2 =…
- postage_stamp_basis_range_zero_one_ge_of_oddFor odd h = 2m + 1, Stöhr's extremal basis {0, 1, (h+3)/2} = {0, 1, m+2} has h-range at least m² + 4m + 2 = (h² + 6h + 1)/4: every integer…
- 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).
- postage_stamp_basis_range_ge_of_mod_four_eq_zeroFor h = 4w with w ≥ 2, the set A = {−(w − 1), w, w + 2} satisfies n_h(A) ≥ w(4w + 6) = (h² + 6h)/4.
- postage_stamp_number_neg_two_of_odd_boundsIf {a, a+x, a+y} (a < 0 < x < y) h-fold covers [0, R] with h = 2m+1 and R ≥ 2m+2, then x, y are coprime and (y-1)(1-x) ≥ ha ≥ R - (2m+2)y…
- postage_stamp_is_coprime_of_memIf 0 and 1 are both in the h-fold sumset of {a, a+x, a+y} with distinct elements, then x and y are coprime.
- postage_stamp_number_two_eqThe classical postage stamp number for three stamps: n_h(2) = ⌊(h² + 6h + 1)/4⌋ for every h ≥ 1.
Lean source view module on GitHub
/-- `m ∈ hA`: `m` is the sum of `h` (not necessarily distinct) elements of the finite set `A ⊆ ℤ`. -/ def int_mem_h_fold_sumset (h : ℕ) (A : Finset ℤ) (m : ℤ) : Prop := ∃ f : Fin h → ℤ, (∀ i, f i ∈ A) ∧ ∑ i, f i = m