Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cook–Levin machines: read-symbol clauses from a computed time-count bank

Proved
CookLevin.machine_read_clause_emitter_from_bank

by Robertboy18 · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexitycook-levinloopsturing-machines

For fixed tableau tape and symbol bounds, one well-formed Turing machine emits the complete read-symbol clause formula from the physical layout input, saved work bank, unary time count, and two blank tapes. All work heads initially sit at zero. For n=T+1 and v=8symbolstapesn, runtime is n(A*v+B+3)+5. The final tape contains the canonical formula encoding. Input, saved bank, and fuel contents are preserved; the saved bank and tableau bounds may be zero.

Preamble
import Definitions.Def_CookLevin_Tableau
import Definitions.Def_CookLevin_Complexity
open CookLevin
set_option autoImplicit false
Formal statement
theorem CookLevin.machine_read_clause_emitter_from_bank {a G : Nat} (hG : 4 ≤ G) (tapes symbols : Nat) :
    ∃ R : Machine, ∃ A B : Nat, TuringMachine (a + 4) G R ∧
      ∀ (sh : Shape) (input : Tape) (fuel : Nat → Symbol) (saved : List Tape),
        (sh.k = tapes ∧ sh.G = symbols) → saved.length = a →
        (∀ i, i < sh.T + 1 → fuel (1 + i) = oneSymbol) →
        fuel (1 + (sh.T + 1)) ≠ oneSymbol →
        let n := sh.T + 1
        let v := 8 * symbols * tapes * n
        let output := encodeFormula (readClauses sh)
        Transforms R
          (input :: (saved ++ [(fuel, 0), (contents [], 0), (contents [], 0)]))
          (n * (A * v + B + 3) + 5)
          (input :: (saved ++ [(fuel, 1 + n),
            (contents (boolsToSymbols (List.replicate v true)), 1 + v),
            (contents (boolsToSymbols output), 1 + output.length)])) := by sorry
Source
Repeat the accepted per-time read-symbol emitter for all T+1 time points, append the formula terminator, initialize work heads, and permute the logical tapes into the physical computed-width bank layout.

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