Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A polynomial-time multistack computation with finite output has a finite work-alphabet realization

Proved
PvsNP.finite_work_realization

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

computational-complexityreductionsturing-machines

A finite-control TM2 program can introduce only finitely many work symbols, even when its supplied stack types are infinite. Finite input and output ports are preserved, and restricting all other stacks gives another realization with the same transition count.

Preamble
import Definitions.Def_PvsNPFrontier
Formal statement
theorem PvsNP.finite_work_realization {α β U V : Type} [Finite V]
    {ei : α → List U} {eo : β → List V} {f : α → β}
    (p : Turing.TM2ComputableInPolyTime ei eo f) : PvsNP.FinitePolyTime ei eo f := 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