Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cook–Levin machines: polynomial-time choice-cell initialization on any tape

Proved
CookLevin.choiceCellEmitter_of_unary_bounds

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

complexitycook-levinloopsturing-machines

Polynomial-time unary width and choice bounds suffice to generate the certificate-choice formula at any fixed logical tape index. The construction computes both bounds, canonicalizes their outputs, initializes the counter, emits clauses and proves the standard output decoding and polynomial runtime. A zero choice bound gives blank-tape initialization.

Preamble
import Definitions.Def_CookLevin_Reduction
import Definitions.Def_CookLevin_Complexity
open CookLevin
set_option autoImplicit false
Formal statement
theorem CookLevin.choiceCellEmitter_of_unary_bounds (k G Q j : Nat) (w m : List Bool → Nat)
    (hw : IsPolyTimeComputable (fun x => List.replicate (w x) true))
    (hm : IsPolyTimeComputable (fun x => List.replicate (m x) true)) :
    IsPolyTimeComputable (fun x => encodeFormula ((List.range (w x + 1)).map fun p =>
      (reductionInit [] (m x) 1 p).map fun s =>
        Literal.Pos ((⟨k, G, Q, w x⟩ : Shape).cellVar 0 j p s))) := by sorry
Source
Input-dependent initialization for the Cook–Levin reduction.

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