Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (25), p. 6 — at β = π/4 the clause term ½d⟨Z₁Z₂Z₃⟩ at −γ equals ⅛dE_z[Σ sin(γ(d ± c₁ ± c₂ ± c₃))]

Proved
QAOAE3Lin2.General.eq_25

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 be given in which every equation is on three distinct bits and no triple carries two equations. Fix an equation with sign ddd and bits 1,2,31,2,31,2,3, and let c1,c2,c3c_1,c_2,c_3c1​,c2​,c3​ be its polynomials (21). Then for every real γ\gammaγ,

12d ⟨−γ,π4∣Z1Z2Z3∣−γ,π4⟩=18d Ez[sin⁡(γ(d+c1+c2+c3))+sin⁡(γ(d+c1−c2−c3))+sin⁡(γ(d−c1+c2−c3))+sin⁡(γ(d−c1−c2+c3))].\tfrac12 d\,\langle-\gamma,\tfrac\pi4|Z_1Z_2Z_3|-\gamma,\tfrac\pi4\rangle=\tfrac18 d\,E_z\big[\sin(\gamma(d+c_1+c_2+c_3))+\sin(\gamma(d+c_1-c_2-c_3))+\sin(\gamma(d-c_1+c_2-c_3))+\sin(\gamma(d-c_1-c_2+c_3))\big].21​d⟨−γ,4π​∣Z1​Z2​Z3​∣−γ,4π​⟩=81​dEz​[sin(γ(d+c1​+c2​+c3​))+sin(γ(d+c1​−c2​−c3​))+sin(γ(d−c1​+c2​−c3​))+sin(γ(d−c1​−c2​+c3​))].

This exact single-clause formula is the starting point of both the worst-case analysis (Taylor expansion in γ\gammaγ) and the typical-case analysis.

Formalization Note. The left side is the paper's (8) at β=π/4\beta=\pi/4β=π/4, i.e. 12d⟨s∣e−iγCeiβBZ1Z2Z3e−iβBeiγC∣s⟩\tfrac12d\langle s|e^{-i\gamma C}e^{i\beta B}Z_1Z_2Z_3e^{-i\beta B}e^{i\gamma C}|s\rangle21​d⟨s∣e−iγCeiβBZ1​Z2​Z3​e−iβBeiγC∣s⟩, the state at angle −γ-\gamma−γ. The triple condition is needed: a second equation on the same triple would change the commutation step (11).

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

theorem eq_25 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (rhs : Fin m → Bool)
    (htri : IsTripleFamily tri) (i : Fin m) (γ : ℝ) :
    (1 / 2) * sgn rhs i * corr tri rhs i (-γ) (Real.pi / 4) = clauseSin tri rhs i γ := 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, (25) (with (8), p. 4, and (21), p. 6)
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