Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (9) — δ_{•,t}(v) = T(v,t) + Σ_{u∈Pred_t(v)} δ_{•,t}(u)·R(∅,u,v,t)

Proved
RoutingBC.Chaining.target_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, source-oblivious routing scheme on a finite node set VVV (total forwarding probability one at every non-target node, silent target), and T:V×V→RT:V\times V\to\mathbb RT:V×V→R a traffic matrix. Since the scheme does not depend on the source, write R(⊘,u,v,t)R(\oslash,u,v,t)R(⊘,u,v,t) for the common value of R(s,u,v,t)R(s,u,v,t)R(s,u,v,t), and Predt(v)={u:R(⊘,u,v,t)>0}\mathrm{Pred}_t(v)=\{u : R(\oslash,u,v,t)>0\}Predt​(v)={u:R(⊘,u,v,t)>0}. Then for every target ttt and node vvv,

δ∙,t(v)=T(v,t)+∑u∈Predt(v)δ∙,t(u)⋅R(⊘,u,v,t).\delta_{\bullet,t}(v)=T(v,t)+\sum_{u\in\mathrm{Pred}_t(v)}\delta_{\bullet,t}(u)\cdot R(\oslash,u,v,t).δ∙,t​(v)=T(v,t)+u∈Predt​(v)∑​δ∙,t​(u)⋅R(⊘,u,v,t).

The expected number of packets targeted at ttt that pass through vvv consists of those injected at vvv and those forwarded to vvv by its predecessors; this recursion is Algorithm 4 of the paper, which replaces the loop over source–target pairs by a loop over targets.

Formalization Note. The "don't care" source ⊘\oslash⊘ is represented by an arbitrary fixed node s0s_0s0​; by source-obliviousness the value does not depend on the choice. No sign condition on TTT is assumed.

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

theorem target_dependency_recursion {V : Type*} [Fintype V] [DecidableEq V]
    (R : V → V → V → V → ℝ) (hR : IsRoutingScheme R) (hobl : IsSourceOblivious R)
    (T : V → V → ℝ) (s₀ t v : V) :
    targetDelta R T t v =
      T v t + ∑ u ∈ Finset.univ.filter (fun u => 0 < R s₀ u v t),
        targetDelta R T 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 5.1, Eq. (9), p. 11
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