Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Correctness of guarded mass-production CNF assembly

Proved
CNFEncComplexity.MassProduction.assemble_isEncoding

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

complexity-theorysatisfiability

Guarded sparse encodings and an occupied-slot checker encode the conjunction of all queries. Hall expansion up to the number of queries guarantees that every set of accepted inputs can be placed into the slots.

Preamble
import Definitions.Def_CNFEncComplexity_MassProductionAssembly
import Definitions.Def_CNFEncComplexity_IsEncoding
import Definitions.Def_CNFEncComplexity_andPow
import Mathlib.Data.Finset.Union
open CNFEncComplexity CNFEncComplexity.MassProduction CookLevin
Formal statement
theorem CNFEncComplexity.MassProduction.assemble_isEncoding {b n q : ℕ} (f : (Fin n → Bool) → Bool)
    (neighbors : (Fin n → Bool) → Finset (Fin q)) (checker : Formula) (slots : Fin q → Formula)
    (hall : ∀ S : Finset ((Fin n → Bool)), S.card ≤ b → S.card ≤ (S.biUnion neighbors).card)
    (hChecker : IsEncoding checker Fin.val (checkerPredicate b n q))
    (hSlots : ∀ r, IsEncoding (slots r) Fin.val (slotPredicate f neighbors r)) :
    IsEncoding (assembleFormula b n q checker slots) Fin.val (andPow f b) := 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