Sets with no -relation are -sparse
ProvedBehrendWindows.atMostTwoPerAP_of_noRelationadditive-combinatoricsarithmetic-progressions
Let be finite and . If has no -relation (no pairwise distinct and distinct non-zero integers with satisfy ), then is -sparse.
Preamble
import Mathlib import Definitions.Def_BehrendWindows_AtMostTwoPerAP import Definitions.Def_BehrendWindows_NoRelation
Formal statement
namespace BehrendWindows
theorem atMostTwoPerAP_of_noRelation {T : Finset ℤ} {L : ℕ}
(h : NoRelation T L) : AtMostTwoPerAP T (L + 1) := by sorry
end BehrendWindows
Source
No published source states the version uniform in m; statement from the mission proposal, Formalization targets, relation form (second implication), milestone 8
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. is any finite set of integers and is any natural number. Both are implicit and universally quantified.
Hypothesis: has "no -relation".
- Take any three pairwise distinct elements .
- Take any integers with , , , and .
- Then
Conclusion: is "at most two per AP" with length .
- For every integer , every integer , and all natural numbers , the three numbers , and do not all lie in .
- Equivalently: no arithmetic progression of terms with nonzero common difference contains three of its terms in .
Edge cases.
- If , the progression length admits no three indices. The conclusion is then vacuously true, whatever the hypothesis says.
- If , the hypothesis is also vacuous.
- If , both sides are trivially true.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.