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 nonzero integers has a sum-free subset of size greater than
Statement
Every nonempty finite set of nonzero integers contains a sum-free subset of cardinality strictly greater than .
Facts & Assumptions
Given: A nonempty finite set with .
Sum-free means no three members, with repeated summands allowed, satisfy (Sum-free subsets of the integers).
There are primes arbitrarily large with (There are arbitrarily large primes congruent to modulo ).
For prime , nonzero residue classes form the multiplicative group of the field (For every prime , the two operations on make it a field).
A nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum).
Uniform probabilities are cardinality ratios; indicators count membership, expectation is linear, and some outcome reaches at least the expectation (The uniform probability space on a nonempty finite set, Indicators turn event probabilities, intersections, and finite counts into expectations and products, Expectation is linear for every finite family of random variables, without any independence hypothesis, Expectation preserves pointwise order and lies between the minimum and maximum attained values).
Proof
Since is nonempty, . Choose a prime larger than twice .
Let . This set is sum-free modulo : if representatives satisfied , then would be a multiple of lying between and , which is impossible.
Choose uniformly from the nonzero residue classes and put . Reduction modulo is injective on by the choice of , and multiplication by each nonzero permutes the nonzero classes by [L3].
Thus every belongs to with probability . Linearity gives .
Some has at least the expectation. If in , then modulo , contradicting sum-freeness of ; so is sum-free and has size greater than .
Depends on
- Sum-free subsets of the integers
- There are arbitrarily large primes congruent to $2$ modulo $3$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- Every nonempty finite set of reals has a maximum and a minimum
- The uniform probability space on a nonempty finite set
- Indicators turn event probabilities, intersections, and finite counts into expectations and products
- Expectation is linear for every finite family of random variables, without any independence hypothesis
- Expectation preserves pointwise order and lies between the minimum and maximum attained values
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
- M. Bucic, Probabilistic Method, Theorem 2.3 (standard reference, not scraped)