Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial-time conversion of delimited words to framed bits

Proved
CNFEncComplexity.MassProduction.WordReader.encWordsToBitsRead_polytime

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

complexity-theorysatisfiability

Words over the ternary delimiter format can be read into the framed binary list encoding in polynomial time.

Preamble
import Definitions.Def_CNFEncComplexity_encWords
import Definitions.Def_Complexitylib_0ebd467_Computability_Machines_Turing_MultiTape_Complexity_PolyTime_BitString
import Definitions.Def_Complexitylib_0ebd467_Computability_Machines_Turing_MultiTape_Encodings_List
import Mathlib.Computability.TuringMachine.Computable
Formal statement
open CNFEncComplexity Turing.MultiTapeTM

theorem CNFEncComplexity.MassProduction.WordReader.encWordsToBitsRead_polytime {α : Type} (words : α → List (List Bool)) :
    Nonempty (Turing.TM2ComputableInPolyTime
      (fun a => encWords (words a)) (encList encBits) words) := by sorry
Source
Krapivin, Przybocki, Subercaseaux, The CNF Encoding Complexity of Boolean Functions, arXiv:2611.05614, Lemma 11, Section 3.4.

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