Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Residual scale and density at a requested full solve

Proved
NearlyOptimalPPR.Computation.recursive_successful_request_bounds

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

algorithm-analysisgraph-theorypagerank

Consider a full solve requested after a successful episode return in Algorithms 6–9. Let qjq_jqj​ and bjb_jbj​ be its threshold and block size, HjH_jHj​ its active domain, and μj=∑v∈Hjrj(v)\mu_j=\sum_{v\in H_j}r_j(v)μj​=∑v∈Hj​​rj​(v) its residual mass. At that full-solve state,

qjbj<2μj,rj(v)≤2κ0μjbjdv(v∈Hj).q_jb_j<2\mu_j,\qquad r_j(v)\le\frac{2\kappa_0\mu_j}{b_j}d_v\quad(v\in H_j).qj​bj​<2μj​,rj​(v)≤bj​2κ0​μj​​dv​(v∈Hj​).

The graph is finite and undirected with a nonisolated seed, 0<α<10<\alpha<10<α<1, and a positive root threshold. The successful-return instruction occurs two operational states before the full solve; the intervening entry preserves the domain, residual, threshold and block size.

These are the scale and density premises used in Lemma 5.8 to distinguish mass-halving solves from exceptional solves.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_work_analysis
open Finset Matrix NearlyOptimalPPR.Computation
Formal statement
theorem NearlyOptimalPPR.Computation.recursive_successful_request_bounds (m : SolveModel) (n : ℕ) (g : InputGraph n) (s : Fin n) (α q : ℝ)
    (hα : 0 < α ∧ α < 1) (hq : 0 < q) (hs : 0 < g.graph.degree s)
    (ℓ : ℕ) (schedule : BlockSchedule) (t id : ℕ)
    (he : fullSolveEvent g (recursiveRun m g s α q ℓ schedule t) id)
    (hfinish : currentPC (recursiveRun m g s α q ℓ schedule (t-2))=.finishEpisode) :
    let st := recursiveRun m g s α q ℓ schedule t
    (st.frames st.top).q*(st.frames st.top).block < 2*(∑ v ∈ (st.frames st.top).active, (st.frames st.top).residual v) ∧
      ∀ v ∈ (st.frames st.top).active, (st.frames st.top).residual v ≤
        (kappa ℓ 0 : ℝ)*(2*(∑ w ∈ (st.frames st.top).active, (st.frames st.top).residual w)/(st.frames st.top).block)*
          LocalPush.deg g.graph v := by sorry
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, Lemmas 5.7–5.8 and their proof pp.26–28; Lemma 4.4 p.18 and finite-prefix counts pp.28–29.

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