Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III, (50), p. 10 — for γ ∈ [0, π/2], (m/2) sin γ cos^{3D} γ ⩽ E_d⟨−γ, π/4|C|−γ, π/4⟩ ⩽ (m/2) sin γ

Proved
QAOAE3Lin2.Typical.eq_50

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 with mmm equations in which every bit lies in at most D+1D+1D+1 equations, and let 0≤γ≤π/20\le\gamma\le\pi/20≤γ≤π/2. Draw the right-hand sides uniformly from {0,1}m\{0,1\}^m{0,1}m and measure ∣−γ,π/4⟩|-\gamma,\pi/4\rangle∣−γ,π/4⟩. Then the average over the instances of the expected number of satisfied equations, minus m/2m/2m/2, satisfies

m2sin⁡γcos⁡3Dγ  ≤  Ed[⟨−γ,π/4∣C∣−γ,π/4⟩]  ≤  m2sin⁡γ.\frac m2\sin\gamma\cos^{3D}\gamma\;\le\;\mathbb E_d\big[\langle-\gamma,\pi/4|C|-\gamma,\pi/4\rangle\big]\;\le\;\frac m2\sin\gamma .2m​sinγcos3Dγ≤Ed​[⟨−γ,π/4∣C∣−γ,π/4⟩]≤2m​sinγ.

This is the mean performance of the level-one QAOA on a random-sign instance with fixed triples. Combined with the variance bound it yields the concentration statement of Section III.

Formalization Note ⟨−γ,π/4∣C∣−γ,π/4⟩\langle-\gamma,\pi/4|C|-\gamma,\pi/4\rangle⟨−γ,π/4∣C∣−γ,π/4⟩ is the expected satisfied count minus m/2m/2m/2 (p. 4). The range 0≤γ≤π/20\le\gamma\le\pi/20≤γ≤π/2 is added: the page leaves γ\gammaγ unspecified at this point, but the lower bound needs sin⁡γ≥0\sin\gamma\ge0sinγ≥0 and cos⁡γ≥0\cos\gamma\ge0cosγ≥0, and the paper's choice γ=1/(3D1/2)\gamma=1/(\sqrt3D^{1/2})γ=1/(3​D1/2) lies in this range.

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

/-- (50), p. 10: for `γ ∈ [0, π/2]`, the average over the `2^m` instances of
`⟨−γ, π/4|C|−γ, π/4⟩` (the expected satisfied count minus `m/2`) lies between
`(m/2) sin γ cos^{3D} γ` and `(m/2) sin γ`. -/
theorem eq_50 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (D : ℕ) (htri : QAOAE3Lin2.General.IsTripleFamily tri)
    (hocc : QAOAE3Lin2.General.BoundedOccurrence tri D) (γ : ℝ) (hγ₀ : 0 ≤ γ) (hγ₁ : γ ≤ Real.pi / 2) :
    (m : ℝ) / 2 * Real.sin γ * Real.cos γ ^ (3 * D) ≤
        avgD (fun rhs => QAOAE3Lin2.General.expSat tri rhs (-γ) (Real.pi / 4) - (m : ℝ) / 2) ∧
      avgD (fun rhs => QAOAE3Lin2.General.expSat tri rhs (-γ) (Real.pi / 4) - (m : ℝ) / 2) ≤
        (m : ℝ) / 2 * Real.sin γ := 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. 10, Section III, (50)
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