Sphere images are -sparse
ProvedBehrendWindows.atMostTwoPerAP_image_sphereLet with and . Let be the set of vectors with , and let
Then is -sparse (no -term arithmetic progression with non-zero common difference contains three elements of ), and .
Formalization Note is Mathlib's Behrend.sphere S d k and the digit map is Behrend.map (m * d), cast to .
import Mathlib import Definitions.Def_BehrendWindows_AtMostTwoPerAP
namespace BehrendWindows
theorem atMostTwoPerAP_image_sphere (S d m k : ℕ) (hd : 1 ≤ d) (hm : 3 ≤ m) :
AtMostTwoPerAP ((Behrend.sphere S d k).image (fun x => (Behrend.map (m * d) x : ℤ))) m ∧
(Behrend.sphere S d k).image (fun x => (Behrend.map (m * d) x : ℤ)) ⊆
Finset.Ico (0 : ℤ) ((m * d) ^ S : ℕ) := by sorry
end BehrendWindows
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let with and .
Let be Mathlib's Behrend "sphere" (with allowed):
the vectors with every coordinate in and sum of squares exactly .
Let be the image of under
computed in and then viewed as an integer. The theorem states two things.
- has the "at most two per progression" property with parameter . Fix any and any common difference with ; may be negative. Fix any natural numbers . Then the three integers
are not all in . Equivalently, no -term arithmetic progression with non-zero difference contains three of its terms, at distinct positions, in .
- , that is, every element of is an integer with .
Edge cases:
- is empty whenever is, for example when cannot be written as such a sum of squares. Both claims then hold trivially.
- If , then is when and empty otherwise. So and the bound is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.