Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (40)–(41), p. 8 — max_r |(m/2)γ_r + P^k(γ_r)| ≥ m/(20D^{1/2}k), γ_r = cos(πr/k)/(10D^{1/2})

Proved
QAOAE3Lin2.General.eq_41

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

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

Let a Max E3LIN2 instance with mmm equations be given, let D≥1D\ge1D≥1, let kkk be odd, and let

γr=110D1/2cos⁡(πr/k),r=0,1,…,k.\gamma_r=\frac1{10D^{1/2}}\cos(\pi r/k),\qquad r=0,1,\dots,k .γr​=10D1/21​cos(πr/k),r=0,1,…,k.

Then

max⁡r=0,1,…,k∣m2γr+Pk(γr)∣≥m20D1/2k,\max_{r=0,1,\dots,k}\Big|\frac m2\gamma_r+P^k(\gamma_r)\Big|\ge\frac m{20D^{1/2}k},r=0,1,…,kmax​​2m​γr​+Pk(γr​)​≥20D1/2km​,

where PkP^kPk is the sum of the mmm polynomials (27).

This is the Chebyshev-node bound (39) applied to the main term of (37), on a grid of k+1k+1k+1 angles in [−1/(10D1/2),1/(10D1/2)][-1/(10D^{1/2}),1/(10D^{1/2})][−1/(10D1/2),1/(10D1/2)].

Formalization Note. The maximum is stated as the existence of a grid index rrr. D≥1D\ge1D≥1 is added so that D1/2≠0D^{1/2}\neq0D1/2=0. No condition on the triples is needed: PkP^kPk is a polynomial in γ\gammaγ with only odd powers 3,…,k3,\dots,k3,…,k for every instance.

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

theorem eq_41 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (rhs : Fin m → Bool) (D : ℕ)
    (hD : 1 ≤ D) (k : ℕ) (hk : Odd k) :
    ∃ r ∈ Finset.range (k + 1), (m : ℝ) / (20 * Real.sqrt D * k) ≤
      |(m : ℝ) / 2 * gammaGrid D k r + PkSum tri rhs k (gammaGrid D k r)| := 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, (40)–(41)
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