Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (26)–(28), p. 6 — Taylor remainder |R^k| ≤ ⅛(|γ|^{k+2}/(k+2)!)E_z[Σ|d ± c₁ ± c₂ ± c₃|^{k+2}] for odd k

Proved
QAOAE3Lin2.General.eq_28

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

max-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1qaoataylor-expansion

Fix a Max E3LIN2 instance, an equation with sign ddd and polynomials c1,c2,c3c_1,c_2,c_3c1​,c2​,c3​, and an odd kkk. Expand (25) as

12d2γ+Pk(γ)+Rk(γ)\tfrac12d^2\gamma+P^k(\gamma)+R^k(\gamma)21​d2γ+Pk(γ)+Rk(γ)

with PkP^kPk as in (27). Then for every real γ\gammaγ the remainder satisfies

∣Rk(γ)∣≤18 ∣γ∣k+2(k+2)! Ez[∣d+c1+c2+c3∣k+2+∣d+c1−c2−c3∣k+2+∣d−c1+c2−c3∣k+2+∣d−c1−c2+c3∣k+2].|R^k(\gamma)|\le\frac18\,\frac{|\gamma|^{k+2}}{(k+2)!}\,E_z\big[|d+c_1+c_2+c_3|^{k+2}+|d+c_1-c_2-c_3|^{k+2}+|d-c_1+c_2-c_3|^{k+2}+|d-c_1-c_2+c_3|^{k+2}\big].∣Rk(γ)∣≤81​(k+2)!∣γ∣k+2​Ez​[∣d+c1​+c2​+c3​∣k+2+∣d+c1​−c2​−c3​∣k+2+∣d−c1​+c2​−c3​∣k+2+∣d−c1​−c2​+c3​∣k+2].

This isolates the linear term 12γ\tfrac12\gamma21​γ of each clause and bounds what is left after the polynomial part.

Formalization Note. RkR^kRk is defined by (26) as (25) minus 12d2γ\tfrac12d^2\gamma21​d2γ minus Pk(γ)P^k(\gamma)Pk(γ), so the statement is the remainder bound (28). kkk is odd, as in (27)'s sum j=3,5,…,kj=3,5,\dots,kj=3,5,…,k.

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

theorem eq_28 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (rhs : Fin m → Bool)
    (i : Fin m) (k : ℕ) (hk : Odd k) (γ : ℝ) :
    |Rk tri rhs i k γ| ≤ (1 / 8) * |γ| ^ (k + 2) / ((k + 2).factorial : ℝ) *
      avgZ (fun x =>
        let d := sgn rhs i
        let c₁ := cPoly tri rhs i 0 x
        let c₂ := cPoly tri rhs i 1 x
        let c₃ := cPoly tri rhs i 2 x
        |d + c₁ + c₂ + c₃| ^ (k + 2) + |d + c₁ - c₂ - c₃| ^ (k + 2) +
          |d - c₁ + c₂ - c₃| ^ (k + 2) + |d - c₁ - c₂ + c₃| ^ (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. 6, Section II, (26)–(28)
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