No -relation among three distinct points
DefinitionBehrendWindows_NoRelationadditive-combinatoricsarithmetic-progressions
Let be finite and . The set has no -relation if there are no three pairwise distinct elements and integers with
- , , ,
- and ,
such that
This is the form in which the property is stated in the Lean development accompanying L. Alpöge's November 2026 announcement. It sits between two sparseness conditions: -sparse sets have no -relation, and sets with no -relation are -sparse.
Definition code
import Mathlib
namespace BehrendWindows
/-- No `L`-relation: no three distinct elements `s₁, s₂, s₃` of `T` satisfy
`j * (s₂ - s₁) = i * (s₃ - s₁)` for distinct non-zero integers `i, j` with
`|i|, |j| ≤ L`. -/
def NoRelation (T : Finset ℤ) (L : ℕ) : Prop :=
∀ s₁ ∈ T, ∀ s₂ ∈ T, ∀ s₃ ∈ T, s₁ ≠ s₂ → s₁ ≠ s₃ → s₂ ≠ s₃ →
∀ i j : ℤ, i ≠ 0 → j ≠ 0 → i ≠ j → |i| ≤ L → |j| ≤ L →
j * (s₂ - s₁) ≠ i * (s₃ - s₁)
end BehrendWindows
Source
No published source states the version uniform in m; statement from the mission proposal, relation form; L. Alpöge, Remark (20 Nov 2026), https://alpo.ge/remark.pdf
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Definition. For a finite set of integers and a natural number , the proposition holds if and only if the following is true. For every ordered triple of pairwise distinct elements of (, , ), and for all integers with
we have
Edge cases.
- If , no nonzero integer satisfies , so the condition is vacuously true for every .
- If , the only allowed pairs are and . Both give the relation , so the condition says that no element of is the midpoint of two other elements of .
- For larger , the integers and may have the same sign or opposite signs; the only requirement is .
- If , the condition holds for every .