Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform polynomial-time construction of the mass-production formula

Proved
CNFEncComplexity.MassProduction.massBuild_TM2

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

complexity-theorysatisfiability

Given a native polynomial-time neighbor function, the concrete mass-production CNF builder has a polynomial-time TM2 certificate on the truth-table input encoding of Lemma 11.

Preamble
import Definitions.Def_CNFEncComplexity_MassProductionData
import Mathlib.Computability.TuringMachine.Computable

open CNFEncComplexity CNFEncComplexity.MassProduction CookLevin Turing.MultiTapeTM
Formal statement
theorem CNFEncComplexity.MassProduction.massBuild_TM2 (nbr : Neighbor) (c : ℕ)
    (hNbr : ComputableTidilyInPolyTime nbr neighborNative (encOption encNat)) :
    Nonempty (Turing.TM2ComputableInPolyTime encMassIn encodeFormula (massBuild nbr c)) := 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