Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Tight O(x)O(x)O(x) upper bound on η+\eta_+η+​ coefficient energy

Open
Helfgott.minorArcPlusSquareEnergy_bound

by Ethan Cheung Wang · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

circle-methodgoldbachhelfgottpossibly-false

Assume x≥49⋅1025x\ge 49\cdot 10^{25}x≥49⋅1025 and that

∑n∥Λ(n)η+(n/x)∥2\sum_n\Bigl\|\Lambda(n)\eta_+\bigl(n/x\bigr)\Bigr\|^2n∑​​Λ(n)η+​(n/x)​2

converges. The claim is that the sum is at most (973913/3500000) x(973913/3500000)\,x(973913/3500000)x.

Analytically the Plancherel identity and the prime number theorem give

∑nΛ(n)2η+(n/x)2∼xlog⁡x∫Rη+(u)2 du,\sum_n\Lambda(n)^2\eta_+\bigl(n/x\bigr)^2\sim x\log x\int_{\mathbb R}\eta_+(u)^2\,du,n∑​Λ(n)2η+​(n/x)2∼xlogx∫R​η+​(u)2du,

and the platform lemma etaPlus_regularity supplies ∫η+2≤321/500\int\eta_+^2\le 321/500∫η+2​≤321/500, so the left-hand side is asymptotic to a positive multiple of xlog⁡xx\log xxlogx. For x≥49⋅1025x\ge 49\cdot 10^{25}x≥49⋅1025 one has xlog⁡x≫(973913/3500000) xx\log x\gg (973913/3500000)\,xxlogx≫(973913/3500000)x, so this tight O(x)O(x)O(x) bound is expected to be false. It is isolated here so that it can be disproved (or replaced by a correct large-sieve bound on the minor-arc L2L^2L2 mass) without blocking the summable half of minorArcPlusSquareEnergy_le.

Preamble
import Definitions.Def_Helfgott_MinorArcData
open scoped BigOperators Classical
Formal statement
namespace Helfgott

theorem minorArcPlusSquareEnergy_bound (x : ℝ)
    (hx : (49 : ℝ)*10^25 ≤ x)
    (hsum : Summable (fun n : ℕ => ‖minorArcPlusCoefficients x n‖^2)) :
    (∑' n : ℕ, ‖minorArcPlusCoefficients x n‖^2) ≤
      (973913 / 3500000 : ℝ) * x := by
  sorry

end Helfgott
Source
Helfgott, arXiv:1312.7748v2, §1.3.2: |S|_2^2 ∼ x log x (not O(x)). The constant 973913/3500000 matches the platform formalization of actual_minor_arc_prime_L2_mass_upper, which likely confuses coefficient energy with the large-sieve minor-arc integral.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me