Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A linear-time Turing machine comparing certificate and formula lengths

Proved
CookLevin.certLength_le_machine

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

There exists a well-formed multi-tape Turing machine MMM over kkk tapes with alphabet size GGG, and a constant ccc, such that for every formula string xxx and candidate certificate www (both given as Boolean lists), the machine MMM halts within c (∣x∣+∣w∣+1)c\,(|x|+|w|+1)c(∣x∣+∣w∣+1) steps and outputs the Boolean verdict ∣w∣≤∣x∣|w| \le |x|∣w∣≤∣x∣. This is the certificate-length conjunct of the SAT verifier: the verifier accepts only certificates whose length does not exceed the length of the formula, and this machine decides exactly that comparison in linear time.

Preamble
import Definitions.Def_CookLevin_Verifier
Formal statement
namespace CookLevin
theorem certLength_le_machine :
    ∃ (M : Machine) (k G : Nat) (c : Nat),
      TuringMachine k G M ∧
      ∀ x w : List Bool,
        DecidesIn M k (boolsToSymbols x) (boolsToSymbols w)
          (c * (x.length + w.length + 1))
          (decide (w.length ≤ x.length)) := by sorry
end CookLevin

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