Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (31), p. 7 — E_z[c_i²] = Σ d_iab d_iab ≤ D

Proved
QAOAE3Lin2.General.eq_31

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

bounded-occurrencemax-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1qaoa

Let an instance of Max E3LIN2 have every equation on three distinct bits, no triple carrying two equations, and every bit in at most D+1D+1D+1 equations. Fix an equation and one of its bits, and let ccc be the corresponding polynomial (21) with DcD_cDc​ terms. Then

Ez[c2]=∑a<bdiabdiab=Dc≤D.E_z[c^2]=\sum_{a<b}d_{iab}d_{iab}=D_c\le D .Ez​[c2]=a<b∑​diab​diab​=Dc​≤D.

The terms of ccc are products zazbz_az_bza​zb​ of distinct pairs, hence orthonormal, and the shared bit lies in at most DDD equations besides the central one.

Formalization Note. The sum ∑a<bdiabdiab\sum_{a<b}d_{iab}d_{iab}∑a<b​diab​diab​ is the number of terms of ccc, written as a count. Both conclusions, the identity and the bound, are stated.

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

theorem eq_31 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (rhs : Fin m → Bool) (D : ℕ)
    (htri : IsTripleFamily tri) (hocc : BoundedOccurrence tri D) (i : Fin m) (r : Fin 3) :
    avgZ (fun x => cPoly tri rhs i r x ^ 2) = (termCount tri i r : ℝ) ∧
      termCount tri i r ≤ D := 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. 7, Section II, (31)
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