-sparse sets have no -relation
ProvedBehrendWindows.noRelation_of_atMostTwoPerAPadditive-combinatoricsarithmetic-progressions
Let be finite and . If is -sparse, then has no -relation: there are no pairwise distinct and integers , both non-zero with , such that
Preamble
import Mathlib import Definitions.Def_BehrendWindows_AtMostTwoPerAP import Definitions.Def_BehrendWindows_NoRelation
Formal statement
namespace BehrendWindows
theorem noRelation_of_atMostTwoPerAP {T : Finset ℤ} {L : ℕ}
(h : AtMostTwoPerAP T (2 * L + 1)) : NoRelation T L := by sorry
end BehrendWindows
Source
No published source states the version uniform in m; statement from the mission proposal, Formalization targets, relation form (first 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: is "at most two per AP" with length .
- For every integer , every integer , and all natural numbers , it is not the case that all three of , and belong to .
- Equivalently: no arithmetic progression of terms with nonzero common difference contains three of its terms in .
Conclusion: has "no -relation".
- Take any three pairwise distinct elements .
- Take any integers with , , , and .
- Then
Edge cases.
- If , the hypothesis is about progressions of length . It holds vacuously, since three indices below cannot exist. The conclusion is also vacuous, since no nonzero integer has .
- If , the only allowed pairs are . The conclusion then says that no element of is the midpoint of two other distinct elements of .
- Pairs with are allowed. Only is excluded.
- If , the conclusion holds vacuously.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.