Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One compiled controller body simulates one recursive source step

Proved
NearlyOptimalPPR.Computation.controller_source_step_exec

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

Let a live logical state satisfy the recursive region, key, boundary, parameter, stored-vertex, and numerical invariants, and let a concrete controller memory represent it. Assume sufficient capacities for ordinary branches and valid queue rank and potential-credit parameters. The entire controller body, including prioritized component completion and ordinary dispatch, has a finite execution representing one canonical recursive source step. It satisfies

M′≤M+Gbody,W′+Φ′≤W+Φ+Δbody.M'\le M+G_{\rm body},\qquad W'+\Phi'\le W+\Phi+\Delta_{\rm body}.M′≤M+Gbody​,W′+Φ′≤W+Φ+Δbody​.

The symbols denote heap masses, the specified body growth, charged work, heap-and-cache potential, and the explicit body charge. In the component branch the output representation is completed; otherwise the returned representation is live.

This contract includes the operational component test, budget scans, program-counter lookup, and branch guards.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_compiler_runtime
open Finset Matrix
open scoped ENNReal
set_option autoImplicit false
noncomputable section
attribute [local instance] Classical.propDecidable
Formal statement
namespace NearlyOptimalPPR.Computation
open SparseQueue
theorem controller_source_step_exec (m : SolveModel) {n : ℕ} (g : InputGraph n) (ω : ℕ → Bool)
    (logical : RecursiveState n) (s : Fin n) (α ε : ℝ) (ell length N rank Q M : ℕ)
    (st : MachineState) (memory : ControllerMemory g s α ε ell length logical st)
    (hDone : logical.done=false) (hDepth : logical.top ≤ ell) (hα : 0<α ∧ α<1)
    (hRegion : RegionInvariant logical) (hKeys : KeysInvariant g logical) (hBoundary : BoundaryIdentity g logical)
    (hParameters : ParameterInvariant logical) (hStored : StoredInvariant g logical) (hNumerical : NumericalInvariant g logical)
    (hm : memory.mass ≤ M) (capacities : ¬componentComplete logical → ControllerCapacities g logical ell M N)
    (hCredit : 4*(16*(ell+3))+17 ≤ Q) (hCap : rank < length) (hPow : N < 2^rank) :
    let P := cleanBodyBound (16*(ell+3)) length rank+2
    ∃ steps out, ∃ next : ControllerMemory g s α ε ell length (recursiveStep m g s α ell [] logical) out,
      MachineEval m g ω controllerBodyCode st steps out ∧ next.mass ≤ M+controllerSourceGrowth g ell logical ∧
      out.work+(next.potential P Q : ℝ≥0∞) ≤ st.work+(memory.potential P Q : ℝ≥0∞)+controllerBodyCharge m g logical ell length rank Q := by sorry
end NearlyOptimalPPR.Computation
Source
Li, Xu, Yang, Zhou, Nearly optimal Personalized PageRank computation, STOC 2027 submission #884, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/884.pdf, Algorithms 1 and 6–9, pp. 5,14–22; charged local-machine realization of the mission computational model.

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