Sieve levels at the small-divisor scales of the main proof #
The small-divisor and prime cutoffs leave a positive exponent gap beneath Theorem 1's lower bound on the interval length.
theorem
NairTenenbaum.exists_smallDivisorSiftedSum_at_scales
{g : ℕ}
(hg : 0 < g)
{ε : ℝ}
(hε : 0 < ε)
:
∃ (K : ℝ) (x₀ : ℝ),
1 ≤ K ∧ 1 ≤ x₀ ∧ ∀ (k r : ℕ) (P : PolynomialSystem k r),
P.total.natDegree = g →
∀ (A B σ : ℝ) (F : ArithmeticMap k),
Admissible A B σ F →
0 ≤ A →
1 ≤ B →
0 < σ →
↑g ^ 2 * σ ≤ 1 / 8 →
∀ (x y : ℝ) (N : ℕ+) (a b : ℤ),
x₀ ≤ x →
↑↑N ≤ x ^ (3 * ↑g ^ 2 * ε / 2) →
x ^ (4 * ↑g ^ 2 * ε) ≤ y →
a ≤ b →
y / 2 ≤ ↑b - ↑a →
P.smallDivisorSiftedSum F N a b (x ^ (↑g * ε / 2)) ≤ K * smallDivisorSieveCost B σ g P.badDiscriminant * (↑b - ↑a) * sieveProduct P.total (x ^ (↑g * ε / 2)) * ∑ n ∈ Finset.Icc 1 N, P.weight F n
The small-divisor sum at the paper's scales, with constants chosen before all polynomial coefficients and the admissible arithmetic function.