Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial-time exact interpolation postprocessing for Theorem 6.3

Proved
CountOrderings.NFree.interpolation_postprocess_polytime

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

counting-complexitylinear-extensions

A Cook–Levin transducer takes a packed exact-cover input word and list of reply words and computes the specified postprocessing in polynomial time. On a standing instance it constructs the sampled values of the common-denominator numerator and uses rational interpolation in t=q+1t=q+1t=q+1, extracting the coefficient of tn−ht^{n-h}tn−h. On malformed inputs it outputs zero. On the other instances it returns the exact-cover count by the degenerate-case rule.

Preamble
import Definitions.Def_CountOrderings_NFree_OracleReduction
import Definitions.Def_CookLevin_Complexity
Formal statement
namespace CountOrderings.NFree

theorem interpolation_postprocess_polytime :
    ∃ finish : List Bool → List Bool, CookLevin.IsPolyTimeComputable finish ∧
      ∀ (x : List Bool) (replies : List (List Bool)),
        finish (packWords (x :: replies)) = NPBinary.encodeNat (finishX3C x replies) := by sorry

end CountOrderings.NFree
Source
Arenas, Schild and Subercaseaux, Hardness of Counting Orderings: Taking Gadget Amplification to the Limit, STOC 2027 submission #1207, https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1207.pdf, Appendix A.12, pp. 37–38 (PDF pp. 38–39), proof 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