Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1) — δ_{s,t}(s) = 1 and δ_{s,t}(v) = Σ_{u∈Pred_{s,t}(v)} δ_{s,t}(u)·R(s,u,v,t)

Proved
RoutingBC.Chaining.pairwise_dependency_recursion

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

betweenness-centralityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrouting

Let RRR be a loop-free routing scheme on a finite node set VVV (nonnegative, total forwarding probability one at every non-target node, silent target); the decisions may depend on the source. Fix s,t∈Vs,t\in Vs,t∈V and let Preds,t(v)={u:R(s,u,v,t)>0}\mathrm{Pred}_{s,t}(v)=\{u : R(s,u,v,t)>0\}Preds,t​(v)={u:R(s,u,v,t)>0} be the set of immediate predecessors of vvv on the way to ttt. Then

δs,t(s)=1,δs,t(v)=∑u∈Preds,t(v)δs,t(u)⋅R(s,u,v,t)(v≠s).\delta_{s,t}(s)=1,\qquad \delta_{s,t}(v)=\sum_{u\in \mathrm{Pred}_{s,t}(v)}\delta_{s,t}(u)\cdot R(s,u,v,t)\quad (v\ne s).δs,t​(s)=1,δs,t​(v)=u∈Preds,t​(v)∑​δs,t​(u)⋅R(s,u,v,t)(v=s).

This recursion computes all pairwise dependencies of a pair (s,t)(s,t)(s,t) by one pass over a topological order of the routing DAG, which is Algorithm 1 of the paper.

Formalization Note. The page writes the second line of (1) without "v≠sv\ne sv=s"; at v=sv=sv=s the first line applies instead (the right side of the second line is 000 there, by loop-freeness). Both lines are stated without source-obliviousness.

Preamble
import Mathlib
import Definitions.Def_RoutingBC_Chaining_Routing
Formal statement
namespace RoutingBC.Chaining

theorem pairwise_dependency_recursion {V : Type*} [Fintype V] [DecidableEq V]
    (R : V → V → V → V → ℝ) (hR : IsRoutingScheme R) (s t : V) :
    delta R s t s = 1 ∧
      ∀ v, v ≠ s →
        delta R s t v =
          ∑ u ∈ Finset.univ.filter (fun u => 0 < R s u v t), delta R s t u * R s u v t := by sorry

end RoutingBC.Chaining
Source
Dolev, Elovici, Puzis, Routing Betweenness Centrality, BGU CS Tech. Rep. #2009-09 (Aug. 2009), Section 4.1, Eq. (1), p. 6
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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