AFTD Auto-Formalizing Theoretical Domains

finset_has_no_unique_sums

def

A 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.

Statement

def finset_has_no_unique_sums {G : Type*} [AddCommMonoid G] [DecidableEq G]
    (A : Finset G) : Prop
Defined in
arXiv:2610.09349 (A near-quadratic lower bound for sets with no unique sums), Sec. 1 (definition of NUS: |A| ≥ 2 and r_{A,2}(s) ≥ 2 for every s ∈ A + A).
Verified
09 Oct 2026
Axioms
none listed
Built on 1
Used by 19

Lean source view module on GitHub

/-- `A` 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`. -/
def finset_has_no_unique_sums {G : Type*} [AddCommMonoid G] [DecidableEq G]
    (A : Finset G) : Prop :=
  2 ≤ A.card ∧ ∀ a ∈ A, ∀ b ∈ A, 2 ≤ finset_unordered_sum_rep_count A (a + b)
See it in the graphDiscuss this resultChallenge it