AFTD Auto-Formalizing Theoretical Domains

avoids_subset_sum

def

A finite set of natural numbers $A$ avoids a target integer $n$ if no subset of $A$ has sum equal to $n$, meaning every subset of $A$ summing to $n$ is empty.

Statement

def avoids_subset_sum (A : Finset ℕ) (n : ℕ) : Prop
Defined in
arXiv:2611.17205 Forbidden subset sums in a linear range: an inverse theorem and the Erdős-Graham irregularity problem, Section 1.1
Verified
14 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

Given a finite set of natural numbers A and a natural number n, the definition avoids_subset_sum A n asserts that for every subset B of A, if the sum of the elements in B equals n, then B is empty (equivalently: no non-empty subset of A has sum equal to n).

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 finite set of natural numbers avoids n if no subset sums to n. -/
def avoids_subset_sum (A : Finset ℕ) (n : ℕ) : Prop := ∀ B ⊆ A, B.sum id = n → B = ∅
See it in the graphDiscuss this resultChallenge it