Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1.1 — (log log n)^2 = o((log n)^{β−δ}) for the positive constant β − δ

Proved
ExactDFTRefine.Main.loglog_absorption

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-complexityfourier-transformp2o-gran-per-chapterp2o-plan-paperp2o-v1

With β=3020165925/1012\beta = 3020165925/10^{12}β=3020165925/1012 and δ=30201659/1010\delta = 30201659/10^{10}δ=30201659/1010, the constant β−δ\beta - \deltaβ−δ is positive and

(log⁡log⁡n)2=o((log⁡n)β−δ)(n→∞, n∈N).(\log\log n)^2 = o\big((\log n)^{\beta-\delta}\big) \qquad (n \to \infty,\ n \in \mathbb N).(loglogn)2=o((logn)β−δ)(n→∞, n∈N).

Logarithms are natural. This absorbs the (log⁡log⁡n)2(\log\log n)^2(loglogn)2 overhead of the Fourier reduction into the gap β−δ\beta - \deltaβ−δ, turning the bound O(n(log⁡n)1−β(log⁡log⁡n)2)O(n(\log n)^{1-\beta}(\log\log n)^2)O(n(logn)1−β(loglogn)2) into O(n(log⁡n)1−δ)O(n(\log n)^{1-\delta})O(n(logn)1−δ).

Differences from the source:

  • encoding: f = o(g) → Asymptotics.IsLittleO atTop on functions ℕ → ℝ; reason: standard little-o along n → ∞
Preamble
import Mathlib
import Definitions.Def_ExactDFTRefine_Main_Moments

open Asymptotics Filter
Formal statement
namespace ExactDFTRefine.Main

/-- **Proof of Theorem 1.1, absorption of `(log log n)^2`**, p. 6. `β - δ` is positive and
`(log log n)^2 = o((log n)^{β-δ})` as `n → ∞`. -/
theorem loglog_absorption :
    0 < beta - delta ∧
    (fun n : ℕ => Real.log (Real.log (n : ℝ)) ^ 2) =o[atTop]
      (fun n : ℕ => Real.log (n : ℝ) ^ (beta - delta)) := by sorry

end ExactDFTRefine.Main
Source
Yao, Liu, A Numerical Refinement of an Exact Discrete Fourier Transform Bound, arXiv:2611.01257v1, p. 6, proof of Theorem 1.1
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me