Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tagged-pair multistack NP embeds in finite binary-verifier NP

Proved
PvsNP.np_subset_finite_binary_verifier

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

computational-complexityreductionsturing-machines

Each NP verifier in the tagged-pair PvsNP model can check the same language and witnesses in the length-prefixed binary comparator model. The recoding is polynomial on the full input alphabet, and the resulting verifier may use only finite physical work alphabets.

Preamble
import Definitions.Def_PvsNP
import Definitions.Def_KMedianThreshold
Formal statement
theorem PvsNP.np_subset_finite_binary_verifier : PvsNP.NP ⊆ OAI.MetricKMedian.Complexity.NP := by
  sorry
Source
Cook, The complexity of theorem-proving procedures (STOC 1971). Mathlib Computability.TuringMachine.Computable. The finite-stack model and pair conventions are formalized in the Prove2Me PvsNP and OAI.MetricKMedian comparator definitions.

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