Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hermiticity of the acceptance operator

Definition
QMAPerfectCompleteness_Proof_Cyclic

by Dorian Rudolph · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

qma-perfect-completeness-bbe19ef

Provides the retained Hermitian acceptance-operator fact used by the cyclic-constraint analysis. This is an operator-theoretic auxiliary for applying spectral and quadratic-form arguments to the verifier acceptance matrix.

Definition code
/- Generated from Solutions.Cyclic by authoritative Stage-2 skeleton subtraction.
Original explanatory text, declaration names and scoped commands are retained.
Only selected proof cuts, import rewrites and fact-indexed platform edits are applied. -/
import Definitions.Def_QMAPerfectCompleteness_Main_Cyclic
import Definitions.Def_QMAPerfectCompleteness_Proof_EuclideanStates



open Matrix
open scoped Kronecker
namespace QMAPerfectCompleteness.Main.CyclicProof

variable {G : GateSet}



theorem acceptance_hermitian (V : Verifier G) : V.acceptanceOperator.IsHermitian := by
  have hP : V.acceptProjector.IsHermitian := by
    unfold Verifier.acceptProjector
    apply Matrix.isHermitian_diagonal_of_self_adjoint
    ext w
    simp only [Pi.star_apply]
    split <;> simp
  have h := Matrix.isHermitian_conjTranspose_mul_mul (V.unitary * V.ancillaZero) hP
  simpa only [Verifier.acceptanceOperator, Matrix.conjTranspose_mul, Matrix.mul_assoc] using h



















open VerifierAnalysis











open scoped ComplexOrder





open scoped Matrix.Norms.L2Operator







end QMAPerfectCompleteness.Main.CyclicProof
Source
Formalization auxiliary for ~/research/qma1z/main.tex, Section 3.2, the cyclic-constraint analysis. Original Lean source: commit bbe19efbde567e5c8f7fe21655fd0c4da3573e4d, Solutions/Cyclic.lean, retained declaration span lines 14–22.

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