Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of every eligible recursive MWIS node

Proved
Lax263307Proofs.NativeNodeExecution.executes

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitylinear-programming

Fix a native core configuration, the chosen LP and flow functions, array extents, and an eligibility predicate. Let D,S,v,wD,S,v,wD,S,v,w denote the precision denominator, frame stride, virtual word width and host word width. Suppose the published resource contract holds with local step bound s0s_0s0​, local time bound t0t_0t0​, and branching bound bbb.

For every recursion fuel fff, every eligible node has the complete operational execution promised by the node protocol, with step and time bounds

s≤W(s0,b,f),t≤W(t0,b,f),s\le W(s_0,b,f),\qquad t\le W(t_0,b,f),s≤W(s0​,b,f),t≤W(t0​,b,f),

where W(c,b,0)=cW(c,b,0)=cW(c,b,0)=c and W(c,b,f+1)=c+bW(c,b,f)W(c,b,f+1)=c+bW(c,b,f)W(c,b,f+1)=c+bW(c,b,f). The protocol includes the returned answer, graph and stack-frame invariants and the actual return phase. This theorem converts uniform local resource data into executions of the entire bounded recursion.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeCertificateInterfaces
Formal statement
theorem Lax263307Proofs.NativeNodeExecution.executes : ∀ (D S v w localSteps localTime branches : ℕ) (cfg : Lax263307Proofs.NativeCoreMachine.Config)
  (lp flow : List ℕ → List ℕ) (extent : String → ℕ) (eligible : Lax263307Proofs.NativeNodeProtocol.Eligible)
  (resources :
    Lax263307Proofs.NativeNodeExecution.Resources D S v w localSteps localTime branches cfg lp flow extent eligible)
  (fuel : ℕ),
  Lax263307Proofs.NativeNodeProtocol.Executes (2 ^ w) D fuel S v
    (Lax263307Proofs.NativeRecursionBudget.work localSteps branches fuel)
    (Lax263307Proofs.NativeRecursionBudget.work localTime branches fuel) cfg lp flow extent eligible := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeNodeExecution.lean, theorem executes

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