Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Logical flag and clock actions with range tags

Definition
QMAPerfectCompleteness_Proof_BlockTaggedActions

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

qma-perfect-completeness-bbe19ef

For a verifier and certificate (z,a,b)(z,a,b)(z,a,b), specifies the logical flag updates controlled by the cached index-range predicates, the final-clock test and equality with zzz. The post-call map then advances the clock cyclically exactly on the active range, leaving the remaining data registers fixed.

Definition code
/- Generated from Solutions.BlockTaggedActions 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_Compiler
import Definitions.Def_QMAPerfectCompleteness_Main_Cyclic
import Init.Data.BitVec.Bitblast
import Definitions.Def_QMAPerfectCompleteness_Main_BlockEncoding
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockClockCoordinates
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockCompiler
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockCoordinates
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockEncoding
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockImplements
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockLogicalSelect
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockStateCoordinates
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockVerifierCoordinates
import Definitions.Def_QMAPerfectCompleteness_Proof_CircuitUnitary
import Definitions.Def_QMAPerfectCompleteness_Proof_ClockCircuits
import Definitions.Def_QMAPerfectCompleteness_Proof_ComparisonCircuits
import Definitions.Def_QMAPerfectCompleteness_Proof_ControlCircuits
import Definitions.Def_QMAPerfectCompleteness_Proof_Cyclic
import Definitions.Def_QMAPerfectCompleteness_Proof_EqualityCircuits
import Definitions.Def_QMAPerfectCompleteness_Proof_EuclideanStates
import Definitions.Def_QMAPerfectCompleteness_Proof_IndexHadamards
import Definitions.Def_QMAPerfectCompleteness_Proof_ReversibleGadgets

/- Namespace registrations retained from original proof-only imports. -/
namespace QMAPerfectCompleteness.Main.BlockComposition
end QMAPerfectCompleteness.Main.BlockComposition
namespace QMAPerfectCompleteness.Main.BlockTransport
end QMAPerfectCompleteness.Main.BlockTransport
namespace QMAPerfectCompleteness.Main.BlockHistoryCoordinates
end QMAPerfectCompleteness.Main.BlockHistoryCoordinates



/-! Deterministic block SELECT operations on the indexed predicate-tagged workspace fiber. -/
set_option backward.isDefEq.respectTransparency false
set_option maxHeartbeats 1800000
open Matrix
open scoped Kronecker
namespace QMAPerfectCompleteness.Main.BlockImplements
open BlockCompiler BlockCoordinates BlockStateCoordinates BlockClockCoordinates
variable (V : Verifier gatesG2)











/-- The logical middle operation, including the index-range control. -/
noncomputable def midLogical (a b : ℕ) (p : Logical V) : Logical V :=
  (p.1,p.2.1,p.2.2.1,xor p.2.2.2
    ((Layout.rangeTruth a b p.1.val 3 && decide (p.2.1.val < ell V.proofQubits)) && p.2.2.1 V.output))







/-- The logical closing/identity flag updates before the controlled clock shift. -/
noncomputable def postFlagLogical (z : V.Proof) (a b : ℕ) (p : Logical V) : Logical V :=
  (p.1,p.2.1,p.2.2.1,
    xor (xor p.2.2.2 (Layout.rangeTruth a b p.1.val 0))
      (Layout.rangeTruth a b p.1.val 4 &&
        (decide (p.2.1.val = ell V.proofQubits) && decide (V.proofPart p.2.2.1 = z))))





/-- The logical post-call permutation, before range erasure and final Hadamards. -/
noncomputable def postLogical (z : V.Proof) (a b : ℕ) (p : Logical V) : Logical V :=
  let q := postFlagLogical V z a b p
  (q.1,q.2.1+Fin.ofNat (ell V.proofQubits+1) ((Layout.rangeTruth a b q.1.val 5).toNat),q.2.2)



end QMAPerfectCompleteness.Main.BlockImplements
Source
Auxiliary formalization source for ~/research/qma1z/main.tex: commit bbe19efbde567e5c8f7fe21655fd0c4da3573e4d, Solutions/BlockTaggedActions.lean, lines 47–106.

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