Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (35)–(37), pp. 7–8 — |⟨−γ,π/4|C|−γ,π/4⟩| ≥ |(m/2)γ + P^k(γ)| − m(9D^{1/2}|γ|)^{k+2}

Proved
QAOAE3Lin2.General.eq_37

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

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

Let an instance of Max E3LIN2 with mmm equations have every equation on three distinct bits, no triple carrying two equations, and every bit in at most D+1D+1D+1 equations, with D≥1D\ge1D≥1. Let kkk be odd and γ\gammaγ real. Then

∣⟨−γ,π4∣C∣−γ,π4⟩∣≥∣m2γ+Pk(γ)∣−m(9D1/2∣γ∣)k+2,\big|\langle-\gamma,\tfrac\pi4|C|-\gamma,\tfrac\pi4\rangle\big|\ge\Big|\frac m2\gamma+P^k(\gamma)\Big|-m\big(9D^{1/2}|\gamma|\big)^{k+2},​⟨−γ,4π​∣C∣−γ,4π​⟩​≥​2m​γ+Pk(γ)​−m(9D1/2∣γ∣)k+2,

where C=12∑dabcZaZbZcC=\tfrac12\sum d_{abc}Z_aZ_bZ_cC=21​∑dabc​Za​Zb​Zc​ and PkP^kPk is the sum of the mmm polynomials (27).

This separates the quantity (7) into a polynomial main term and an error controlled by (34).

Formalization Note. ⟨−γ,π4∣C∣−γ,π4⟩\langle-\gamma,\tfrac\pi4|C|-\gamma,\tfrac\pi4\rangle⟨−γ,4π​∣C∣−γ,4π​⟩ is written as the expected satisfied count at −γ-\gamma−γ minus m/2m/2m/2. D≥1D\ge1D≥1 is inherited from (34).

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

theorem eq_37 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (rhs : Fin m → Bool) (D : ℕ)
    (htri : IsTripleFamily tri) (hocc : BoundedOccurrence tri D) (hD : 1 ≤ D)
    (k : ℕ) (hk : Odd k) (γ : ℝ) :
    |(m : ℝ) / 2 * γ + PkSum tri rhs k γ| - (m : ℝ) * (9 * Real.sqrt D * |γ|) ^ (k + 2) ≤
      |expSat tri rhs (-γ) (Real.pi / 4) - (m : ℝ) / 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, pp. 7–8, Section II, (35)–(37)
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