Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (42)–(43), p. 8 — for large D, some odd k ∈ [5 ln D, 5 ln D + 2] gives 1/(20D^{1/2}k) − (9/10)^{k+2} > 1/(101D^{1/2} ln D)

Proved
QAOAE3Lin2.General.eq_43

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

asymptoticsmax-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1qaoa

There is a threshold D0D_0D0​ such that for every natural number D≥D0D\ge D_0D≥D0​ there is an odd integer kkk with 5ln⁡D≤k≤5ln⁡D+25\ln D\le k\le5\ln D+25lnD≤k≤5lnD+2 and

120D1/2k−(910)k+2>1101D1/2ln⁡D.\frac1{20D^{1/2}k}-\Big(\frac9{10}\Big)^{k+2}>\frac1{101D^{1/2}\ln D}.20D1/2k1​−(109​)k+2>101D1/2lnD1​.

This is the right-hand side of (42), divided by mmm, compared with (43). It fixes how many grid angles are needed.

Formalization Note. "For large DDD" is the existential threshold D0D_0D0​; it is very large (the inequality first holds near ln⁡D≈573\ln D\approx573lnD≈573), so it is not named. The page's "k=5ln⁡Dk=5\ln Dk=5lnD" is pinned as an odd kkk in [5ln⁡D,5ln⁡D+2][5\ln D,5\ln D+2][5lnD,5lnD+2], because (39) needs kkk odd and 5ln⁡D5\ln D5lnD is not an integer.

Preamble
import Mathlib
import Definitions.Def_QAOAE3Lin2_General_Setting
Formal statement
namespace QAOAE3Lin2.General

theorem eq_43 :
    ∃ D₀ : ℕ, ∀ D : ℕ, D₀ ≤ D → ∃ k : ℕ, Odd k ∧ 5 * Real.log D ≤ k ∧
      (k : ℝ) ≤ 5 * Real.log D + 2 ∧
      1 / (101 * Real.sqrt D * Real.log D) < 1 / (20 * Real.sqrt D * k) - (9 / 10 : ℝ) ^ (k + 2) := by sorry

end QAOAE3Lin2.General
Source
Farhi, Goldstone, Gutmann, A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem, arXiv:1412.6062v2, p. 8, Section II, (42)–(43)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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