Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.4 — the cyclic history kernel and its soundness

Proved
QMAPerfectCompleteness.Main.cyclic_constraint

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

history-statesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1qmaquantum-complexity

Let Cz,ΓC_{z,\Gamma}Cz,Γ​ and ∣Ωz⟩|\Omega_z\rangle∣Ωz​⟩ be the operator and vector of Eq. (3).

  1. On a YES instance, if Γz>2\Gamma_z>2Γz​>2 and Γ=Γz\Gamma=\Gamma_zΓ=Γz​, then ∣Ωz⟩≠0|\Omega_z\rangle\ne0∣Ωz​⟩=0 and
(I−Cz,Γ)∣Ωz⟩=0.(I-C_{z,\Gamma})|\Omega_z\rangle=0.(I−Cz,Γ​)∣Ωz​⟩=0.
  1. On a NO instance, that is, if every proof is accepted with probability at most 1/31/31/3,
∥(I−Cz,Γ)∣Ψ⟩∥≥13∥∣Ψ⟩∥\|(I-C_{z,\Gamma})|\Psi\rangle\|\ge\tfrac13\||\Psi\rangle\|∥(I−Cz,Γ​)∣Ψ⟩∥≥31​∥∣Ψ⟩∥

for all zzz, all real Γ≥2\Gamma\ge2Γ≥2, and all complex vectors ∣Ψ⟩|\Psi\rangle∣Ψ⟩, normalized or not, with the Euclidean norm.

Clause 2 does not assume Γ=Γz\Gamma=\Gamma_zΓ=Γz​: it holds for every claimed value. Together the clauses reduce the distinction between YES and NO instances to an exact kernel condition.

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 YES and NO instances being the conditions at 2/32/32/3 and 1/31/31/3 on that verifier, and without the source's g≥1g\ge1g≥1; reason: the statement specializes to the source's verifier on any input in the promise; no property of ggg is used
  • encoding: the number Γz\Gamma_zΓz​ → the real part of the matrix entry ⟨z∣Aℓ∣z⟩\langle z|A^\ell|z\rangle⟨z∣Aℓ∣z⟩; histories are complex functions on the clock/proof basis, with euclidNorm defined as the square root of the sum of squared absolute values; reason: AℓA^\ellAℓ is Hermitian, so the entry is real, and this is exactly the finite-dimensional Euclidean norm
Preamble
import Definitions.Def_QMAPerfectCompleteness_Main_Cyclic

open Matrix
Formal statement
namespace QMAPerfectCompleteness.Main

/-- Lemma 3.4 (p. 8). (i) On a YES instance, if `Γ_z > 2` and `Γ = Γ_z`, then `|Ω_z⟩ ≠ 0` satisfies
`(I - C_{z,Γ})|Ω_z⟩ = 0`. (ii) On a NO instance (`E ⪯ I/3`),
`‖(I - C_{z,Γ})|Ψ⟩‖ ≥ (1/3)‖|Ψ⟩‖` for all `z`, all `Γ ≥ 2` and all `|Ψ⟩`. -/
theorem cyclic_constraint (V : Verifier gatesG2) :
    (V.AcceptsSomeProof (2 / 3) → ∀ (z : V.Proof) (Γ : ℝ), 2 < V.gamma z → Γ = V.gamma z →
      V.historyVector z ≠ 0 ∧ (1 - V.cyclicOp z Γ) *ᵥ V.historyVector z = 0) ∧
    (V.AcceptsAllProofsAtMost (1 / 3) → ∀ (z : V.Proof) (Γ : ℝ), 2 ≤ Γ → ∀ Ψ : History V → ℂ,
      (1 / 3) * euclidNorm Ψ ≤ euclidNorm ((1 - V.cyclicOp z Γ) *ᵥ Ψ)) := by sorry

end QMAPerfectCompleteness.Main
Source
Sabee Grewal, Dorian Rudolph, QMA has perfect completeness, STOC 2027 submission #490 (October 2026), p. 8, Lemma 3.4, Eq. (3)
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