Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.2 — local algorithm with uniform expected work

Proved
NearlyOptimalPPR.Computation.uniform_local_algorithm

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

graph-algorithmspageranksddm-solvers

Fix an exact-SDDM primitive model. There exist one admissible local scalar/query program and positive constants C,cC,cC,c, fixed before all graph inputs, seeds and parameters, such that every finite simple undirected graph, seed sss, 0<α<10<\alpha<10<α<1 and 0<ε≤10<\varepsilon\le10<ε≤1 receives an almost-surely terminating nonnegative explicit output with the ACL guarantee. An isolated seed is returned exactly.

Writing K=1/εK=1/\varepsilonK=1/ε, the expected charged work satisfies

EW≤CKexp⁡ ⁣(clog⁡(2K)log⁡log⁡(4K)).\mathbb E W\le CK\exp\!\left(c\sqrt{\log(2K)\log\log(4K)}\right).EW≤CKexp(clog(2K)loglog(4K)​).

All parameter preparation, graph queries, sparse-system assembly, boundary propagation and output must be implemented by the program's charged instructions. Exact solves operate only on already prepared sparse SDDM systems.

This is the algorithmic core of the upper bound. Measurability of execution work and the envelope's eventual K1+ηK^{1+\eta}K1+η bound are established separately as general results and combined with this statement in the parent theorem.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_push
set_option autoImplicit false
open MeasureTheory
open scoped ENNReal
Formal statement
namespace NearlyOptimalPPR.Computation

theorem uniform_local_algorithm (m : SolveModel) :
    ∃ (p : Program) (C c : ℝ), admissible p ∧ 0 < C ∧ 0 < c ∧
      (∀ (n : ℕ) (g : InputGraph n) (s : Fin n) (α ε : ℝ),
        0 < α → α < 1 → 0 < ε → ε ≤ 1 →
          successful m p g s α ε ∧
          expectedWork m p g s α ε ≤ ENNReal.ofReal (envelope C c ε)) := 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, Theorem 1.2 p.2; §2 p.4 exact-SDDM model; Lemma 4.5 pp.18–19.

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