Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Actual sparse Push implementation has charged ACL work bound

Proved
NearlyOptimalPPR.Computation.push_core_bound

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

For every fixed solve model there is a positive constant CCC such that, on a nonisolated seed with 0<α<10<\alpha<10<α<1 and 0<ε≤10<\varepsilon\le10<ε≤1, the sparse Push core has a finite execution from the specified constant-size input layout and initially empty output. It produces a nonnegative vector ppp with

∣p(v)−πs(v)∣≤εdv,t≤C/(αε).|p(v)-\pi_s(v)|\le\varepsilon d_v,\qquad t\le C/(\alpha\varepsilon).∣p(v)−πs​(v)∣≤εdv​,t≤C/(αε).

Here ttt is the instruction count and exactly the increase in charged machine work. Both negative-address memories start at zero; the seed, teleportation parameter, and tolerance occupy the declared input cells. The machine remains ready to continue after the output is emitted.

This theorem implements the source Push guarantee with actual degree/neighbor queries, sparse FIFO and support lists, and charged explicit output.

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 push_core_bound (m : SolveModel) :
    ∃ C : ℝ, 0 < C ∧ ∀ (n : ℕ) (g : InputGraph n) (s : Fin n) (α ε : ℝ) (ω : ℕ → Bool)
      (st : MachineState), 0 < α → α < 1 → 0 < ε → ε ≤ 1 → 0 < g.graph.degree s →
      st.scalar.halted=false → st.scalar.integerMemory 0=(s.val : ℤ) → st.scalar.core.mem 0=α → st.scalar.core.mem 1=ε →
      (∀ z, z < 0 → st.scalar.integerMemory z=0) → (∀ z, z < 0 → st.scalar.core.mem z=0) → st.output=[] →
      ∃ steps out, MachineEval m g ω pushCoreCode st steps out ∧
        (steps : ℝ≥0∞) ≤ ENNReal.ofReal (C/(α*ε)) ∧
        ACL g.graph α ε s (outputVector out.output) ∧ (∀ v : Fin n, 0 ≤ outputVector out.output v) ∧
        out.work=st.work+steps ∧ out.scalar.halted=false := 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