Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 (Dependency chaining) — δ̃_{s,t}((s_1,…,s_k)) = δ_{s,t}(s_1)·δ̃_{s_1,t}((s_2,…,s_k))

Proved
RoutingBC.Chaining.dependency_chaining

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 in which every node other than the target forwards with total probability one and the target forwards nothing. Let s≠ts\ne ts=t be nodes and S=(s1,…,sk)S=(s_1,\dots,s_k)S=(s1​,…,sk​), k≥1k\ge 1k≥1, an ordered sequence of nodes. Then the probability that a packet sent from sss to ttt passes through all nodes of SSS in the given order factors as

δ~s,t((s1,…,sk))=δs,t(s1)⋅δ~s1,t((s2,…,sk)).\tilde\delta_{s,t}((s_1,\dots,s_k))=\delta_{s,t}(s_1)\cdot\tilde\delta_{s_1,t}((s_2,\dots,s_k)).δ~s,t​((s1​,…,sk​))=δs,t​(s1​)⋅δ~s1​,t​((s2​,…,sk​)).

Here δs,t(s1)\delta_{s,t}(s_1)δs,t​(s1​) is the probability that a packet from sss to ttt passes through s1s_1s1​, and δ~s1,t\tilde\delta_{s_1,t}δ~s1​,t​ is the sequence dependency for packets with source s1s_1s1​.

The lemma says that once a packet has reached s1s_1s1​, its further path does not depend on where it came from. Iterating it gives the product formula (16) and, after summing over sources, the target dependency chain (17).

Formalization Note. For k=1k=1k=1 the right-hand side is δs,t(s1)⋅δ~s1,t(())\delta_{s,t}(s_1)\cdot\tilde\delta_{s_1,t}(())δs,t​(s1​)⋅δ~s1​,t​(()), where the dependency on the empty sequence is the total route probability. No distinctness of the sis_isi​ is assumed, as on the page; consecutive repetitions are collapsed by the definition of δ~\tilde\deltaδ~. The hypothesis that non-target nodes forward with total probability one is implicit in the paper and is needed: if packets could be dropped after s1s_1s1​, the left side would not count them while δs,t(s1)\delta_{s,t}(s_1)δs,t​(s1​) would. Source-obliviousness is the paper's standing assumption of Section 5.

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

theorem dependency_chaining {V : Type*} [Fintype V] [DecidableEq V]
    (R : V → V → V → V → ℝ) (hR : IsRoutingScheme R) (hobl : IsSourceOblivious R)
    (s t : V) (hst : s ≠ t) (s₁ : V) (rest : List V) :
    seqDelta R s t (s₁ :: rest) = delta R s t s₁ * seqDelta R s₁ t rest := by sorry

end RoutingBC.Chaining
Source
Dolev, Elovici, Puzis, Routing Betweenness Centrality, BGU CS Tech. Rep. #2009-09 (Aug. 2009), Lemma 1, p. 13 (proof pp. 14–15)
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