Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2L+1)(2L+1)(2L+1)-sparse sets have no LLL-relation

Proved
BehrendWindows.noRelation_of_atMostTwoPerAP

by pitimespi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsarithmetic-progressions

Let T⊂ZT\subset\mathbb{Z}T⊂Z be finite and L∈NL\in\mathbb{N}L∈N. If TTT is (2L+1)(2L+1)(2L+1)-sparse, then TTT has no LLL-relation: there are no pairwise distinct s1,s2,s3∈Ts_1,s_2,s_3\in Ts1​,s2​,s3​∈T and integers i≠ji\neq ji=j, both non-zero with ∣i∣,∣j∣≤L|i|,|j|\le L∣i∣,∣j∣≤L, such that

j (s2−s1)=i (s3−s1).j\,(s_2-s_1)=i\,(s_3-s_1).j(s2​−s1​)=i(s3​−s1​).
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. TTT is any finite set of integers and LLL is any natural number. Both are implicit and universally quantified.

Hypothesis: TTT is "at most two per AP" with length 2L+12L+12L+1.

  • For every integer aaa, every integer d≠0d \ne 0d=0, and all natural numbers k1<k2<k3<2L+1k_1 < k_2 < k_3 < 2L+1k1​<k2​<k3​<2L+1, it is not the case that all three of a+k1da + k_1 da+k1​d, a+k2da + k_2 da+k2​d and a+k3da + k_3 da+k3​d belong to TTT.
  • Equivalently: no arithmetic progression a,a+d,…,a+2Lda, a+d, \dots, a+2Lda,a+d,…,a+2Ld of 2L+12L+12L+1 terms with nonzero common difference contains three of its terms in TTT.

Conclusion: TTT has "no LLL-relation".

  • Take any three pairwise distinct elements s1,s2,s3∈Ts_1, s_2, s_3 \in Ts1​,s2​,s3​∈T.
  • Take any integers i,ji, ji,j with i≠0i \ne 0i=0, j≠0j \ne 0j=0, i≠ji \ne ji=j, ∣i∣≤L|i| \le L∣i∣≤L and ∣j∣≤L|j| \le L∣j∣≤L.
  • Then
j (s2−s1)  ≠  i (s3−s1).j\,(s_2 - s_1) \;\ne\; i\,(s_3 - s_1).j(s2​−s1​)=i(s3​−s1​).

Edge cases.

  • If L=0L = 0L=0, the hypothesis is about progressions of length 111. It holds vacuously, since three indices below 111 cannot exist. The conclusion is also vacuous, since no nonzero integer has ∣i∣≤0|i| \le 0∣i∣≤0.
  • If L=1L = 1L=1, the only allowed pairs are {i,j}={1,−1}\{i, j\} = \{1, -1\}{i,j}={1,−1}. The conclusion then says that no element s1s_1s1​ of TTT is the midpoint of two other distinct elements s2,s3s_2, s_3s2​,s3​ of TTT.
  • Pairs with i=−ji = -ji=−j are allowed. Only i=ji = ji=j is excluded.
  • If ∣T∣≤2|T| \le 2∣T∣≤2, the conclusion holds vacuously.
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me