Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial binary program preimages preserve native multistack NP

Proved
PvsNP.np_preimage_polyprogram

by lreyzin · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclusteringcomputational-complexity

Precompose any NP language with a polynomial binary program and construct a checker in PvsNP.NP. Witnesses are clipped to the simulated bound, and the three inputs of length at most one are handled within the native pure-power certificate convention.

Preamble
import Definitions.Def_PvsNP
import Definitions.Def_QuantumMaxCutFiniteNumericRuntime
open OAI.MetricKMedian.Binary.Automatic
Formal statement
theorem PvsNP.np_preimage_polyprogram (L : Language Bool) (hL : L ∈ PvsNP.NP)
    (g : List Bool → List Bool) (hg : Poly g) :
    ({w | g w ∈ L} : Language Bool) ∈ PvsNP.NP := by
  sorry
Source
Stephen Cook, The P versus NP Problem, verification definition of NP. The Prove2Me PvsNP and finite binary-verifier encodings. Polynomial many-one inverse images of NP languages are in NP.

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