Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite component-completion solve and explicit sparse output

Proved
NearlyOptimalPPR.Computation.root_component_solve_exec

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

Let the represented root active set CCC be nonempty and consist of stored positive-degree vertices, with 0<α<10<\alpha<10<α<1 and valid epoch marks. The root component-solve routine has a finite execution whose explicit output denotes

αDMC−1es.\alpha D M_C^{-1}e_s.αDMC−1​es​.

Here the inverse is the principal-domain solve extended by zero outside CCC. Writing S=vol⁡(C)+∣C∣S=\operatorname{vol}(C)+|C|S=vol(C)+∣C∣, charged work is bounded by the explicit enumeration, sparse assembly, and emission allowance plus one exact-solve charge for dimension ∣C∣|C|∣C∣ and sparse size SSS. The instruction count has the corresponding allowance plus one primitive call, and the machine remains ready to continue.

This implementation contract is used when the controller has already established component completion; it separately charges output emission.

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 root_component_solve_exec (m : SolveModel) {n : ℕ} (g : InputGraph n) (ω : ℕ → Bool)
    (logical : RecursiveState n) (s : Fin n) (α ε : ℝ) (ell length : ℕ) (epoch : ℤ)
    (st : MachineState) (hh : st.scalar.halted=false)
    (pm : RecursiveMachineMemory g s α ε ell length logical st) (hDepth : logical.top ≤ ell)
    (hα : 0<α ∧ α<1) (hNonempty : (logical.frames 0).active.Nonempty)
    (hStored : (logical.frames 0).active ⊆ logical.stored)
    (hDegree : ∀ v ∈ (logical.frames 0).active, 0<g.graph.degree v)
    (hEpoch : st.scalar.core.ptrs 53=epoch)
    (hbound : ∀ v : Fin n, st.scalar.integerMemory (vertexRecordAddress (16*(ell+3)) v.val 7) ≤ epoch) :
    let size := volumeNat g (logical.frames 0).active+(logical.frames 0).active.card
    let cost := (10*(logical.frames 0).active.card+5)+((24*(16*(ell+3))+100)*size+28)+
      ((4*(16*(ell+3))+21)*(logical.frames 0).active.card+6)+3
    ∃ steps out, MachineEval m g ω rootComponentSolveCode st steps out ∧ steps ≤ cost+1 ∧
      outputVector out.output=potentialOutput g.graph α (solveOn g α (logical.frames 0).active (LocalPush.e s)) ∧
      out.work ≤ st.work+(cost : ℕ)+solveCharge m (logical.frames 0).active.card size ∧ 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