Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ram frames

Proved
ResourceScheduling.Graph.ram_frames

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

algorithmspolynomial-time

Updating one register, input word, or output preserves the representation relation with the corresponding semantic update; stack nonemptiness recognizes positive registers.

Preamble
import Definitions.Def_ResourceScheduling_Graph_RAM
open CookPvsNP ResourceScheduling.Graph
Formal statement
namespace ResourceScheduling.Graph
theorem ram_frames {V : Type} [DecidableEq V] (s : RAMState V)
    (l : RAMWire V → List Letter) (hr : RAMRep s l) :
    (∀ v w, RAMRep (s.set v w.length) (Function.update l (ramReg v) w)) ∧
    (∀ w, RAMRep { s with word := w } (Function.update l ramInput w)) ∧
    (∀ w, RAMRep { s with out := w } (Function.update l ramOutput w)) ∧
    (∀ v, ((l (ramReg v)).head?).isSome = decide (0 < s.val v)) := by sorry
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