Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III, (57), p. 11 — clause terms whose (25) expressions share no d are uncorrelated over the d's

Proved
QAOAE3Lin2.Typical.eq_57

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

average-casemax-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1qaoa

Let the triples form an E3LIN2 family and let γ∈R\gamma\in\mathbb Rγ∈R. For an equation abcabcabc, call its dependency set the equation itself together with all equations sharing exactly one bit with it: these are the ddd's that appear in (25) for abcabcabc. If the dependency sets of two equations abcabcabc and a′b′c′a'b'c'a′b′c′ are disjoint, then, averaging over uniformly random right-hand sides,

Ed[Tabc Ta′b′c′]=Ed[Tabc]⋅Ed[Ta′b′c′],Tabc=12dabc⟨−γ,π/4∣ZaZbZc∣−γ,π/4⟩.\mathbb E_d\Big[T_{abc}\,T_{a'b'c'}\Big]=\mathbb E_d\big[T_{abc}\big]\cdot\mathbb E_d\big[T_{a'b'c'}\big],\qquad T_{abc}=\tfrac12 d_{abc}\langle-\gamma,\pi/4|Z_aZ_bZ_c|-\gamma,\pi/4\rangle .Ed​[Tabc​Ta′b′c′​]=Ed​[Tabc​]⋅Ed​[Ta′b′c′​],Tabc​=21​dabc​⟨−γ,π/4∣Za​Zb​Zc​∣−γ,π/4⟩.

Only pairs of linked equations therefore contribute to the variance of (55).

Formalization Note The paper's (57) is written for dabc⟨⋯ ⟩d_{abc}\langle\cdots\rangledabc​⟨⋯⟩ without the factor 12\tfrac1221​ of (55); both sides of the identity scale by 14\tfrac1441​, so the statement is the same. The dependency set contains the equation itself, so two terms sharing their own ddd are never declared unlinked.

Preamble
import Mathlib
import Definitions.Def_QAOAE3Lin2_Typical_Setting
Formal statement
namespace QAOAE3Lin2.Typical

/-- (57), p. 11: if no sign `d` appearing in (25) for equation `i` appears in (25) for equation
`i'`, the two clause terms are uncorrelated over the instances. -/
theorem eq_57 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (htri : QAOAE3Lin2.General.IsTripleFamily tri)
    (i i' : Fin m) (hdis : Disjoint (deps tri i) (deps tri i')) (γ : ℝ) :
    avgD (fun rhs => clauseTerm tri rhs i γ * clauseTerm tri rhs i' γ) =
      avgD (fun rhs => clauseTerm tri rhs i γ) *
        avgD (fun rhs => clauseTerm tri rhs i' γ) := by sorry

end QAOAE3Lin2.Typical
Source
Farhi, Goldstone, Gutmann, A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem, arXiv:1412.6062v2, p. 11, Section III, (56)–(57)
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