Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — at most one order of a node set is traversed with positive probability

Proved
RoutingBC.Chaining.order_unique

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, the target forwarding nothing), whose decisions may depend on both the source sss and the target ttt. Fix s,t∈Vs,t\in Vs,t∈V, a set of nodes M⊆VM\subseteq VM⊆V, and two orderings L1L_1L1​ and L2L_2L2​ of MMM (each lists every element of MMM exactly once). If

δ~s,t(L1)>0andδ~s,t(L2)>0,\tilde\delta_{s,t}(L_1)>0\quad\text{and}\quad\tilde\delta_{s,t}(L_2)>0,δ~s,t​(L1​)>0andδ~s,t​(L2​)>0,

then L1=L2L_1=L_2L1​=L2​. Here δ~s,t(L)\tilde\delta_{s,t}(L)δ~s,t​(L) is the probability that a packet from sss to ttt passes through the nodes of LLL in the order of LLL.

In words: a packet from sss to ttt can traverse a given set of nodes in at most one order with positive probability. The paper uses this to make the order of s,s1,…,sk,ts, s_1,\dots,s_k, ts,s1​,…,sk​,t well defined in the proof of Lemma 1.

Formalization Note. The set MMM and its two permutations are encoded as two repetition-free lists that are permutations of each other. The sentence before the proposition (p. 14) says "δ~s,t(L)≥0\tilde\delta_{s,t}(L)\ge 0δ~s,t​(L)≥0"; the proposition itself has >0>0>0, which is what is stated. Source-obliviousness is not assumed. Total forwarding probability one and the silent target are the mission's standing assumptions (see the definitions file).

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

theorem order_unique {V : Type*} [Fintype V] [DecidableEq V]
    (R : V → V → V → V → ℝ) (hR : IsRoutingScheme R) (s t : V) (L₁ L₂ : List V)
    (h₁ : L₁.Nodup) (h₂ : L₂.Nodup) (hperm : L₁.Perm L₂)
    (hpos₁ : 0 < seqDelta R s t L₁) (hpos₂ : 0 < seqDelta R s t L₂) :
    L₁ = L₂ := by sorry

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