AFTD Auto-Formalizing Theoretical Domains

nus_min_card

def

m(p): the least size of a subset of Z/pZ with no unique sums.

Statement

noncomputable def nus_min_card (p : ℕ) : ℕ
Defined in
arXiv:2610.09349 (A near-quadratic lower bound for sets with no unique sums), Sec. 1 (m(p) = min{|A| : A ⊆ F_p NUS}); written as an infimum over subsets of ZMod p.
Verified
09 Oct 2026
Axioms
none listed
Built on 1
  • finset_has_no_unique_sumsA has no unique sums (is NUS): |A| ≥ 2 and every sum a + b with a, b ∈ A has at least two representations as an unordered pair from A.
Used by 7

Lean source view module on GitHub

/-- `m(p)`: the least size of a subset of `ZMod p` with no unique sums. -/
noncomputable def nus_min_card (p : ℕ) : ℕ :=
  sInf {k | ∃ A : Finset (ZMod p), finset_has_no_unique_sums A ∧ A.card = k}
See it in the graphDiscuss this resultChallenge it