Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The release's normalisation: large sets with no LLL-relation

Proved
BehrendWindows.exists_large_noRelation

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

additive-combinatoricsarithmetic-progressions

There is a constant C>0C>0C>0 such that for all natural numbers L≥2L\ge 2L≥2 and nnn there is a finite set TTT of integers with

  1. 0≤s0\le s0≤s and 4Ls<n4Ls<n4Ls<n for every s∈Ts\in Ts∈T,
  2. no LLL-relation in TTT (no pairwise distinct s1,s2,s3∈Ts_1,s_2,s_3\in Ts1​,s2​,s3​∈T and distinct non-zero integers i,ji,ji,j with ∣i∣,∣j∣≤L|i|,|j|\le L∣i∣,∣j∣≤L satisfy j(s2−s1)=i(s3−s1)j(s_2-s_1)=i(s_3-s_1)j(s2​−s1​)=i(s3​−s1​)),
  3. the size bound
∣T∣ ≥ nLexp⁡ ⁣(−Clog⁡n log⁡L).|T|\ \ge\ \frac{n}{L}\exp\!\Big(-C\sqrt{\log n\,\log L}\Big).∣T∣ ≥ Ln​exp(−ClognlogL​).

This is the normalisation in which the property is used in the Lean development accompanying L. Alpöge's November 2026 announcement, and it follows from the goal theorem with m=2L+1m=2L+1m=2L+1.

Formalization Note The condition 0≤s0\le s0≤s is required: without it, negative elements would make the range condition 4Ls<n4Ls<n4Ls<n empty.

Preamble
import Mathlib
import Definitions.Def_BehrendWindows_NoRelation
Formal statement
namespace BehrendWindows

theorem exists_large_noRelation :
    ∃ C : ℝ, 0 < C ∧ ∀ L n : ℕ, 2 ≤ L → ∃ T : Finset ℤ,
      (∀ s ∈ T, 0 ≤ s ∧ 4 * L * s < n) ∧ NoRelation T L ∧
      ((n : ℝ) / L) * Real.exp (-C * Real.sqrt (Real.log n * Real.log L)) ≤ (T.card : ℝ) := by sorry

end BehrendWindows
Source
No published source states the version uniform in m; statement from the mission proposal, milestone 9; 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

Claim. There is a real constant C>0C > 0C>0 such that the following holds for all natural numbers LLL and nnn with L≥2L \ge 2L≥2. The constant CCC is chosen once, before LLL and nnn, so it does not depend on them. For each such pair there is a finite set of integers TTT, which may depend on LLL and nnn, with these three properties:

  1. Range. Every s∈Ts \in Ts∈T satisfies 0≤s0 \le s0≤s and 4Ls<n4Ls < n4Ls<n, an inequality between integers. So T⊆{s∈Z:0≤s<n/(4L)}T \subseteq \{s \in \mathbb{Z} : 0 \le s < n/(4L)\}T⊆{s∈Z:0≤s<n/(4L)}.

  2. 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​).
  3. Size. With real division, the real natural logarithm and the real square root,

nL exp⁡ ⁣(−Clog⁡n⋅log⁡L)  ≤  ∣T∣.\frac{n}{L}\,\exp\!\Big(-C\sqrt{\log n \cdot \log L}\Big) \;\le\; |T|.Ln​exp(−Clogn⋅logL​)≤∣T∣.

Edge cases.

  • L≥2L \ge 2L≥2 makes n/Ln/Ln/L a genuine quotient and makes log⁡L>0\log L > 0logL>0.
  • If n=0n = 0n=0, the range condition forces T=∅T = \emptysetT=∅. The size bound becomes 0≤00 \le 00≤0.
  • If n=1n = 1n=1, the logarithm of nnn is 000, so the exponential factor is 111. The size bound becomes 1/L≤∣T∣1/L \le |T|1/L≤∣T∣, which forces T={0}T = \{0\}T={0}, the only element allowed by the range condition.
  • Whenever ∣T∣≤2|T| \le 2∣T∣≤2, property 2 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