Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Every nonempty finite set of n nonzero integers has a sum-free subset of size greater than n/3

Statement

Every nonempty finite set A of n nonzero integers contains a sum-free subset of cardinality strictly greater than n/3.

Facts & Assumptions

Given: A nonempty finite set AZ{0} with A=n.

[L1]

Sum-free means no three members, with repeated summands allowed, satisfy x+y=z (Sum-free subsets of the integers).

[L2]

There are primes p arbitrarily large with p2(mod3) (There are arbitrarily large primes congruent to 2 modulo 3).

[L3]

For prime p, nonzero residue classes form the multiplicative group of the field Z/p (For every prime p, the two operations on Z/p make it a field).

[L4]

A nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum).

Proof

technique · constructive
1.1

Since A is nonempty, n1. Choose a prime p=3r+2 larger than twice maxaAa.

givenL2L4chooseconstruct
1.2

Let I={r+1,,2r+1}Z/p. This set is sum-free modulo p: if representatives x,y,uI satisfied x+yu(modp), then x+yu would be a multiple of p lying between 1 and 3r+1=p1, which is impossible.

L1algebra
2.1

Choose z uniformly from the nonzero residue classes and put Bz={aA:zamodpI}. Reduction modulo p is injective on A by the choice of p, and multiplication by each nonzero a permutes the nonzero classes by [L3].

step 1.1L3
3.1

Thus every aA belongs to Bz with probability I/(p1)=(r+1)/(3r+1)>1/3. Linearity gives E[Bz]=n(r+1)/(3r+1)>n/3.

step 2.1L5algebra
4.1

Some z has Bz at least the expectation. If x+y=u in Bz, then zx+zy=zu modulo p, contradicting sum-freeness of I; so Bz is sum-free and has size greater than n/3.

step 1.2step 3.1L1L5discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 89 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources