Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ResourceScheduling Graph StackPrefix

Definition
ResourceScheduling_Graph_StackPrefix

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

algorithmspolynomial-time

Consume leading unary ones into a counter stack, stopping before the first separator or at the end.

Definition code
import Definitions.Def_CookPvsNP_StackProgram
import Definitions.Def_ResourceScheduling_Graph_WordProgram

set_option autoImplicit false
namespace ResourceScheduling.Graph
open CookPvsNP

def prefixAct {K : Type} [DecidableEq K] (input count : K)
    (_h : K → Option Letter) (k : K) : StackAct Letter :=
  if k = input then .pop else if k = count then .push .one else .keep

/-- Count leading unary ones, leaving the separator (if any) under the input stack top. -/
def prefixProg {K : Type} [DecidableEq K] (input count : K) : StackProg K Letter :=
  .loop (fun h => decide (h input = some .one)) (.act (prefixAct input count))

end ResourceScheduling.Graph
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