OctoInformBeta

Power savings for intersective polynomial differences and prime arguments

For a positive integer NN, write [N]={1,…,N}[N]=\{1,\ldots,N\}. A set A⊆[N]A\subseteq[N] is square-difference-free if (A−A)∩{m2:m∈ℕ,m≥1}=⌀(A-A)\cap\{m^2:m\in\mathbb N,\ m\ge1\}=\varnothing. Let s(N)s(N) be the largest cardinality of a square-difference-free subset of [N][N]. The extremal problem asks how s(N)s(N) grows with NN.

Furstenberg and Sárközy independently proved s(N)=o(N)s(N)=o(N). Green and Sawhney proved s(N)≪Nexp⁡(−c1log⁡N)s(N)\ll N\exp(-c_1\sqrt{\log N}) for an absolute constant c1>0c_1>0. In the opposite direction, Krachun obtained liminf⁡N→∞log⁡s(N)/log⁡N≥0.752796455874514…\liminf_{N\to\infty}\log s(N)/\log N\ge0.752796455874514\ldots.

The preprint proves that there are absolute constants c>0c>0 and C<∞C<\infty such that s(N)≤CN1−cs(N)\le C N^{1-c} for every N≥1N\ge1. The preprint also derives a consequence absent from the Lean library: for integers r,N≥1r,N\ge1 with N>(Cr)1/cN>(Cr)^{1/c}, every rr-coloring of [N][N] contains same-colored elements a,a+d2a,a+d^2 with an integer d≥1d\ge1.

The results of the Lean library are stated as the Lean library states them, each with a link to its Lean declaration. Lean has checked every result of the Lean library, so the Lean library is the reference. Where the preprint states a result differently, its statement appears beside the Lean library’s statement. The preprint is a guide only, giving the results their order and names.

The Lean library: SquareDifference

SquareDifference is a Lean library: 30 items, in nine groups. Each has a page written by OctoInform, listed below.

Section 1. Introduction 2 items
  1. Section 1 (setting): square-difference-free sets Avoiding positive squares among pairwise differences.
  2. Theorem 1.1 Square differences force a power saving.
Section 2. Finite-field square constraints 3 items
  1. Section 2 (setting): strict squares and normalized kernels Directed square constraints between two lists.
  2. Lemma 2.1 Strict-square constraints admit graph counting bounds.
  3. Lemma 2.2 Oriented square constraints have small centered kernels.
Section 3. Finite reflection-positive probability laws 7 items
  1. Section 3 (setting): the fixed tuple and marked components Permutation tuples with marked list components.
  2. Proposition 3.1 Reflection-positive tuple laws above fixed thresholds.
  3. Lemma 3.2 Marked components have symmetric cut forms.
  4. Lemma 3.3 A lower bound for marked reflections.
  5. Lemma 3.4 A lower bound for unmarked cuts.
  6. Lemma 3.5 Marking controls the reflection cut form.
  7. Lemma 3.6 Large-prime tuple laws have uniform labels.
Section 4. Signed multilinear forms and conductor decay 4 items
  1. Section 4 (setting): tensor laws and the functional Multilinear functionals for product tuple laws.
  2. Proposition 4.1 Signed Hölder bounds from reflection positivity.
  3. Lemma 4.2 Coordinate averaging contracts translation-invariant diagonal-root seminorms.
  4. Lemma 4.3 Conductor decay for conditional tensor energy.
Section 5. Uniform moment bounds for Fourier lifts 3 items
  1. Section 5 (setting): Fourier lifts and complete-support families Fourier lifts retain complete coordinate supports.
  2. Lemma 5.2 Even moments of partial Fourier lifts.
  3. Lemma 5.3 Freezing coordinates bounds moments and removes support.
Section 6. A signed kernel for actual square differences 2 items
  1. Section 6 (setting): rational quadratic weights and strict square classes Rational quadratic coefficients with residue restrictions.
  2. Proposition 6.1 Ordered square kernels have controlled pairings.
Section 7. Comparison along square-step progressions 3 items
  1. Section 7 (setting): induction parameters, fibers, and the functional Parameters and fibers for scale comparison.
  2. Lemma 7.1 Low-denominator coefficients after freezing residues.
  3. Proposition 7.2 Frozen lifts transfer to shorter progressions.
Section 8. Contraction on ordered intervals 3 items
  1. Section 8 (setting): good small-residue assignments Good residue assignments along the selected cycle.
  2. Lemma 8.1 Distinct small primes admit good residue assignments.
  3. Proposition 8.2 Ordered interval bounds for good residue lifts.
Section 9. Exceptional terms and the power-saving induction 3 items
  1. Section 9 (setting): exceptional products and child scales Exceptional coordinates in the induction on scale.
  2. Proposition 9.1 A uniform step for power-saving induction.
  3. Theorem 9.2 Uniform power decay for the set functional.

No item matches.