Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

CookPvsNP StackSpecification

Definition
CookPvsNP_StackSpecification

by arexychen · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmspolynomial-time

A semantic representation relation with certified actual executions and explicit costs; the loop cost sums the body costs along iterates.

Definition code
import Definitions.Def_CookPvsNP_StackProgram

set_option autoImplicit false
namespace CookPvsNP

/-- A semantic abstraction accompanied by actual source executions and their costs. -/
def StackImplements {K A S : Type} (R : S → (K → List A) → Prop)
    (p : StackProg K A) (f : S → S) (cost : S → ℕ) : Prop :=
  ∀ s l, R s l → ∃ t l', t ≤ cost s ∧ p.Exec l l' t ∧ R (f s) l'

def stackLoopCost {S : Type} (f : S → S) (cost : S → ℕ) (n : ℕ) (s : S) : ℕ :=
  (∑ i ∈ Finset.range n, (cost ((f^[i]) s) + 2)) + 1

end CookPvsNP
Source
New auxiliary formalization for the ResourceScheduling Q2 reduction. The target is the unchanged CookPvsNP one-tape machine model, following Cook, The P versus NP problem, Clay Mathematics Institute (2000), Appendix. This explicit finite-column stack compiler and its simulation lemmas are new contributions, not numbered claims from Cook or the scheduling source paper.

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