Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (29), p. 7 — hypercontractivity: E_z|c|^{k+2} ≤ (k+1)^{k+2}(E_z c²)^{(k+2)/2} for degree-2 c

Proved
QAOAE3Lin2.General.eq_29

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

boolean-functionshypercontractivitymax-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let z=(z1,…,zn)z=(z_1,\dots,z_n)z=(z1​,…,zn​) be uniform in {±1}n\{\pm1\}^n{±1}n and let

c(z)=a0+∑vavzv+∑u<vauvzuzvc(z)=a_0+\sum_v a_vz_v+\sum_{u<v}a_{uv}z_uz_vc(z)=a0​+v∑​av​zv​+u<v∑​auv​zu​zv​

be any real polynomial of degree at most 222. Then for every natural number kkk,

Ez[∣c∣k+2]≤(k+1)k+2(Ez[c2])(k+2)/2.E_z\big[|c|^{k+2}\big]\le(k+1)^{k+2}\big(E_z[c^2]\big)^{(k+2)/2}.Ez​[∣c∣k+2]≤(k+1)k+2(Ez​[c2])(k+2)/2.

This is the hypercontractive (Bonami) inequality ∥c∥q≤(q−1)d/2∥c∥2\|c\|_q\le(q-1)^{d/2}\|c\|_2∥c∥q​≤(q−1)d/2∥c∥2​ for degree d=2d=2d=2 and q=k+2q=k+2q=k+2, cited by the paper as Theorem 5 of Dinur–Friedgut–Kindler–O'Donnell. It controls high moments of the clause arguments d±c1±c2±c3d\pm c_1\pm c_2\pm c_3d±c1​±c2​±c3​ by their second moments.

Formalization Note. Every function on {±1}n\{\pm1\}^n{±1}n of degree at most 222 has the multilinear form above, since zv2=1z_v^2=1zv2​=1. The inequality is stated for every kkk, not only the odd kkk the paper uses. (Ez[c2])(k+2)/2(E_z[c^2])^{(k+2)/2}(Ez​[c2])(k+2)/2 is written as Ez[c2] k+2\sqrt{E_z[c^2]}^{\,k+2}Ez​[c2]​k+2.

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

theorem eq_29 (n k : ℕ) (a₀ : ℝ) (a₁ : Fin n → ℝ) (a₂ : Fin n → Fin n → ℝ) :
    let c : QAlgorithms.Qubits n → ℝ := fun x =>
      a₀ + ∑ v, a₁ v * spin x v +
        ∑ u, ∑ v, (if u < v then a₂ u v * spin x u * spin x v else 0)
    avgZ (fun x => |c x| ^ (k + 2)) ≤
      ((k : ℝ) + 1) ^ (k + 2) * Real.sqrt (avgZ (fun x => c x ^ 2)) ^ (k + 2) := 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, (29) (citing Dinur, Friedgut, Kindler, O'Donnell, Theorem 5)
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