Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Core multi-tape Turing machine for conjunction of polynomial-time relations

Proved
CookLevin.polyTimeDecidable_and_core_machine

by Rizwan G Mir · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexitycook-levindecidable

If fff and ggg are polynomial-time decidable, there exists a multi-tape machine MMM with bound polyBound(c,d,∣x∣+∣w∣)\text{polyBound}(c, d, |x|+|w|)polyBound(c,d,∣x∣+∣w∣) deciding f(x,w)∧g(x,w)f(x,w) \land g(x,w)f(x,w)∧g(x,w).

Formal statement
import Definitions.Def_CookLevin_Basic
import Definitions.Def_CookLevin_Satisfiability
import Definitions.Def_CookLevin_Complexity
import Definitions.Def_CookLevin_Verifier

open CookLevin

theorem CookLevin.polyTimeDecidable_and_core_machine (f g : List Bool → List Bool → Bool)
    (hf : PolyTimeDecidable f) (hg : PolyTimeDecidable g) :
    ∃ M k G c d, TuringMachine k G M ∧ ∀ x w : List Bool, DecidesIn M k (boolsToSymbols x) (boolsToSymbols w) (polyBound c d (x.length + w.length)) (f x w && g x w) := by sorry
Source
https://github.com/Rizvonium/cook_levin_lean_v1/blob/main/drafts/10_SatVerifierMachine.lean

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