Skip to content

Erdős problem 987

Clunie [Cl67] proved that there exists an infinite sequence {zν}\{z_\nu\} on the unit circle with Aν≤νA_\nu \le \nu for all ν≥1\nu \ge 1. Translating zν=e(xν)z_\nu = e(x_\nu), the natural domain of xνx_\nu is the half-open unit interval Ico 0 1\mathrm{Ico}\,0\,1, matching the original [Er64b]/[Cl67] statement (any unit complex number is allowed, including z=1z = 1, i.e. x=0x = 0).

Sources

The source's own material, retained exactly.

10 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

987.lean

Retained formal statement8 of 10

An internal OpenAI model (see [APSSV26b, §3]) proved that there exists an infinite sequence x1,x2,…∈(0,1)x_1, x_2, \ldots \in (0, 1) such that sup⁡n∣∑j≤ne(kxj)∣≪(klog⁡k)1/2\sup_n \left\lvert \sum_{j \le n} e(k x_j) \right\rvert \ll (k \log k)^{1/2} for all k≥1k \ge 1 (in particular Ak≪(klog⁡k)1/2A_k \ll (k \log k)^{1/2}).

Note: the bound is restricted to k≥2k \ge 2 since log⁡1=0\log 1 = 0 would make the RHS vanish at k=1k = 1, while the LHS ∥∑j<ne(xj)∥\|\sum_{j < n} e(x_j)\| can equal 11 (e.g. for n=1n = 1).

FormalConjectures/ErdosProblems/987.leanErdos987.erdos_987.variants.sqrt_log_upper_bound3 linesExact file
∃ x,  ∃ (_ : ∀ (j : ℕ), x j ∈ Set.Ioo 0 1),    ∃ C, ∃ (_ : 0 < C), ∀ (k n : ℕ), 2 ≤ k → ‖∑ j ∈ Finset.range n, additiveChar (↑k * x j)‖ ≤ C * √(↑k * Real.log ↑k)
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.