Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3 — succinct exact description of the diagonal entries Γz\Gamma_zΓz​

Proved
QMAPerfectCompleteness.Main.diagonal_witness

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1qmaquantum-complexity

Let VVV be a verifier over G2\mathcal G_2G2​ with g≥1g\ge1g≥1 gates H⊗HH\otimes HH⊗H, let h=2gh=2gh=2g, A=2EA=2EA=2E, and let ℓ\ellℓ be the clock length. For every z∈{0,1}mz\in\{0,1\}^mz∈{0,1}m the number Γz=⟨z∣Aℓ∣z⟩\Gamma_z=\langle z|A^\ell|z\rangleΓz​=⟨z∣Aℓ∣z⟩ satisfies

0≤Γz≤2ℓ,2hℓΓz∈Z.0\le\Gamma_z\le 2^\ell,\qquad 2^{h\ell}\Gamma_z\in\mathbb Z.0≤Γz​≤2ℓ,2hℓΓz​∈Z.

Moreover Γz=p/q\Gamma_z=p/qΓz​=p/q for natural numbers p,qp,qp,q, q>0q>0q>0, each with at most (h+1)ℓ(h+1)\ell(h+1)ℓ bits. On a YES instance, that is, if some proof is accepted with probability at least 2/32/32/3, some zzz has Γz>2\Gamma_z>2Γz​>2.

Unlike the maximum eigenvalue of EEE, the number Γz\Gamma_zΓz​ is therefore an exact quantity with a polynomial-size description, which the prover can send.

Formalization Note The hypothesis g≥1g\ge1g≥1 is the source's standing assumption for §3.2 (p. 7). It is needed: for g=0g=0g=0 and Ezz=1E_{zz}=1Ezz​=1 one has Γz=2ℓ\Gamma_z=2^\ellΓz​=2ℓ, which has ℓ+1>(h+1)ℓ\ell+1>(h+1)\ellℓ+1>(h+1)ℓ bits. The (h+1)ℓ=O(hℓ)(h+1)\ell=O(h\ell)(h+1)ℓ=O(hℓ) of the source is stated through its explicit bound.

Differences from the source:

  • generalization: the fixed verifier VVV of Lemma 3.1 on one input → any verifier VVV over G2\mathcal G_2G2​ with g≥1g\ge1g≥1, a YES instance being a verifier that accepts some proof with probability at least 2/32/32/3; reason: the statement specializes to the source's verifier on any YES input; nothing else about VVV is used
  • encoding: the number Γz=⟨z∣Aℓ∣z⟩\Gamma_z=\langle z|A^\ell|z\rangleΓz​=⟨z∣Aℓ∣z⟩ → the real part of that matrix entry; reason: AℓA^\ellAℓ is Hermitian, so the entry is real
  • encoding: a rational description with numerator and denominator of at most (h+1)ℓ(h+1)\ell(h+1)ℓ bits → nonnegative natural numbers p,qp,qp,q, with q>0q>0q>0, Γz=p/q\Gamma_z=p/qΓz​=p/q, and Nat.size bounds on both numbers; reason: Nat.size is binary length, and allowing an unreduced description preserves existence at the stated bound
Preamble
import Definitions.Def_QMAPerfectCompleteness_Main_Cyclic

open Matrix
Formal statement
namespace QMAPerfectCompleteness.Main

/-- Lemma 3.3 (p. 7), for a verifier over `𝒢₂` with `g ≥ 1` gates `H ⊗ H`, `h = 2g`: for every `z`,
`0 ≤ Γ_z ≤ 2^ℓ` and `2^{hℓ} Γ_z ∈ ℤ`, and `Γ_z` is a rational whose numerator and denominator have
at most `(h + 1)ℓ` bits. On a YES instance (`λ_max(E) ≥ 2/3`) some `z` has `Γ_z > 2`. -/
theorem diagonal_witness (V : Verifier gatesG2) (hg : 1 ≤ hhCount V) :
    (∀ z : V.Proof,
      0 ≤ V.gamma z ∧ V.gamma z ≤ 2 ^ ell V.proofQubits ∧
      (∃ n : ℤ, (2 : ℝ) ^ (2 * hhCount V * ell V.proofQubits) * V.gamma z = n) ∧
      ∃ p q : ℕ, 0 < q ∧ V.gamma z = (p : ℝ) / q ∧
        p.size ≤ (2 * hhCount V + 1) * ell V.proofQubits ∧
        q.size ≤ (2 * hhCount V + 1) * ell V.proofQubits) ∧
    (V.AcceptsSomeProof (2 / 3) → ∃ z : V.Proof, 2 < V.gamma z) := by sorry

end QMAPerfectCompleteness.Main
Source
Sabee Grewal, Dorian Rudolph, QMA has perfect completeness, STOC 2027 submission #490 (October 2026), p. 7, Lemma 3.3, with the standing notation of §3.1–3.2
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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