OpenAI preprint, September 2026 · Section 1. Introduction
Theorem1.1:Cardinality bounds on integer intervals and their translates in
Square differences force a power saving.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
The extremal question asks how large a finite set can be inside an interval when no difference of two elements of is a positive integer square; such a set is called square-difference-free.✦ For an integer , the integer and natural intervals are those in (1): (1) The translation between them sends to .
(2)✦A finite set is square-difference-free if it contains no pair separated by a positive square, as in (3): (3)✦
Definition 1. The power-saving property is the assertion that there are real constants and such that, for every integer and every square-difference-free finite set , the bound (4) holds: (4)✦
The Claim
Theorem 1. (5)✦There are real constants and such that, for every integer and every square-difference-free finite set ,(6)✦
In the paper, the result reads: there are absolute constants and such that, for every integer and every square-difference-free set ,; equivalently, every subset of larger than contains distinct elements whose absolute difference is a positive integer square.
What Is Checked
The assertions (5) and (6) concern finite subsets of the intervals in (1), with square differences excluded by (2) and (3).