Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The corrected Cook–Levin tableau preserves the number of accepting certificates

Proved
CountOrderings.NFree.countedCookLevinReduction_preserves_count

by bersubs · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

Fix a well-formed polynomial-time verifier and a polynomial length bound for its accepted certificates. For each input, the corrected Cook–Levin CNF has exactly as many satisfying assignments to its occurring variables as the verifier has accepting certificates. The CNF pins the syntactically present but unreachable head positions at cell T+1T+1T+1 with negative unit clauses.

Preamble
import Definitions.Def_CountOrderings_NFree_CountingTableau

open CookLevin
Formal statement
namespace CountOrderings.NFree

theorem countedCookLevinReduction_preserves_count {Mv : Machine} {k G cw dw ct dt : ℕ}
    (hwf : TuringMachine k G Mv) {V : List Bool → List Bool → Bool}
    (hdec : ∀ x w : List Bool, DecidesIn Mv k (boolsToSymbols x) (boolsToSymbols w)
      (polyBound ct dt (x.length + w.length)) (V x w))
    (hlenV : ∀ x w : List Bool, V x w = true → w.length ≤ polyBound cw dw x.length)
    (x : List Bool) :
    countEncodedCNF (countedCookLevinReduction Mv k G cw dw ct dt x) =
      {w : List Bool | V x w = true}.ncard := by sorry

end CountOrderings.NFree
Source
Cook–Levin tableau correspondence on the platform, https://prove2.me/theorems/b5d75d8e-6bbb-49a3-bd6d-e25ba880e328, counting refinement for the #X3C source of Theorem 6.3

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