Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Literal finite stack-push statements

Definition
QMAPerfectCompleteness_Proof_ConcreteUniformity

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

qma-perfect-completeness-bbe19ef

Defines a finite statement that pushes a specified list of symbols before a continuation. Its execution identity gives the resulting stack contents and is used when constructing concrete compiler machines.

Definition code
/- Generated from Solutions.ConcreteUniformity 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_QAlgorithms_ClassicalStringComputability
import Definitions.Def_QMAPerfectCompleteness_Proof_PolyTimeComposition



/-! Specialized compiler closure: add a fixed code prefix directly to the source machine's
halting statements. This constructs the exact machine needed for this operation and does not
use a general polynomial-time composition theorem. -/
open Turing StateTransition

namespace QMAPerfectCompleteness.Uniformity

namespace Statement
variable {K Λ σ : Type} {Γ : K → Type}

def pushMany (k : K) : List (Γ k) → TM2.Stmt Γ Λ σ → TM2.Stmt Γ Λ σ
  | [], q => q
  | a :: s, q => pushMany k s (.push k (fun _ => a) q)

theorem stepAux_pushMany [DecidableEq K] (k : K) (s : List (Γ k))
    (q : TM2.Stmt Γ Λ σ) (v : σ) (S : ∀ k, List (Γ k)) :
    TM2.stepAux (pushMany k s q) v S =
      TM2.stepAux q v (Function.update S k (s ++ S k)) := by
  induction s generalizing q with
  | nil => simp [pushMany]
  | cons a s ih =>
    simp [pushMany, ih, TM2.stepAux, Function.update_idem]

end Statement































end QMAPerfectCompleteness.Uniformity
Source
Formalization auxiliary for ~/research/qma1z/main.tex, the uniform circuit implementation supporting Section 3.3 and the proof of Theorem 1.1. Original Lean source: commit bbe19efbde567e5c8f7fe21655fd0c4da3573e4d, Solutions/ConcreteUniformity.lean, retained declaration span lines 13–24.

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