The release's normalisation: large sets with no -relation
ProvedBehrendWindows.exists_large_noRelationThere is a constant such that for all natural numbers and there is a finite set of integers with
- and for every ,
- no -relation in (no pairwise distinct and distinct non-zero integers with satisfy ),
- the size bound
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 .
Formalization Note The condition is required: without it, negative elements would make the range condition empty.
import Mathlib import Definitions.Def_BehrendWindows_NoRelation
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Claim. There is a real constant such that the following holds for all natural numbers and with . The constant is chosen once, before and , so it does not depend on them. For each such pair there is a finite set of integers , which may depend on and , with these three properties:
-
Range. Every satisfies and , an inequality between integers. So .
-
No -relation.
- Take any three pairwise distinct elements .
- Take any integers with , , , and .
- Then .
-
Size. With real division, the real natural logarithm and the real square root,
Edge cases.
- makes a genuine quotient and makes .
- If , the range condition forces . The size bound becomes .
- If , the logarithm of is , so the exponential factor is . The size bound becomes , which forces , the only element allowed by the range condition.
- Whenever , property 2 holds vacuously.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.