is_bh
def
A set A of natural numbers is a B_h set if every sum of h elements from A (with repetitions allowed) uniquely determines the multiset of summands.
Statement
def is_bh (h : ℕ) (A : Set ℕ) : Prop
- Defined in
- scout/2611-01871-infinite-generalized-sidon-sets-with-a-negative-answer-to-a.md:90
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 1
- is_bh_iUnion_of_monotoneThe union of an ascending sequence of sets, each of which is a B_h set, is itself a B_h set.
Read back from the Lean
Definition of a predicate is_bh taking a natural number h and a set of natural numbers A. It asserts that for all multisets of natural numbers s and t, if every element of s is in A, every element of t is in A, the cardinality of s is h, the cardinality of t is h, and the sum of the elements of s equals the sum of the elements of t, then s = t.
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 set A of natural numbers is a B_h set if every sum of h elements from A uniquely determines the multiset of summands. -/ def is_bh (h : ℕ) (A : Set ℕ) : Prop := ∀ (s t : Multiset ℕ), (∀ x ∈ s, x ∈ A) → (∀ x ∈ t, x ∈ A) → s.card = h → t.card = h → s.sum = t.sum → s = t