Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III, p. 11 — over the 2^m instances, the variance of the expected satisfied count is at most ¼m(6D + 3)(D + 1)

Proved
QAOAE3Lin2.Typical.variance_bound

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

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

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 γ∈R\gamma\in\mathbb Rγ∈R. Draw the right-hand sides uniformly from {0,1}m\{0,1\}^m{0,1}m and let NNN be the expected number of equations satisfied when ∣−γ,π/4⟩|-\gamma,\pi/4\rangle∣−γ,π/4⟩ is measured, a function of the instance. Then

Vard(N)≤14 m(6D+3)(D+1).\mathrm{Var}_d(N)\le\tfrac14\,m(6D+3)(D+1).Vard​(N)≤41​m(6D+3)(D+1).

With DDD fixed, the standard deviation over instances is O(m)O(\sqrt m)O(m​) while the mean is of order mmm; this is what makes the average-case bound (50) typical.

Formalization Note The variance is over the instances (the ddd's), of the quantum expectation NNN; it is not the variance of the measurement outcome. NNN and ⟨−γ,π/4∣C∣−γ,π/4⟩\langle-\gamma,\pi/4|C|-\gamma,\pi/4\rangle⟨−γ,π/4∣C∣−γ,π/4⟩ differ by the constant m/2m/2m/2, so they have the same variance.

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

/-- p. 11: the variance over the `2^m` instances of the expected number of satisfied equations of
`|−γ, π/4⟩` is at most `¼ m (6D + 3)(D + 1)`. -/
theorem variance_bound {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (D : ℕ)
    (htri : QAOAE3Lin2.General.IsTripleFamily tri) (hocc : QAOAE3Lin2.General.BoundedOccurrence tri D) (γ : ℝ) :
    varD (fun rhs => QAOAE3Lin2.General.expSat tri rhs (-γ) (Real.pi / 4)) ≤
      (m : ℝ) * (6 * D + 3) * (D + 1) / 4 := 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, the paragraph after (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