Eq. (9) — δ_{•,t}(v) = T(v,t) + Σ_{u∈Pred_t(v)} δ_{•,t}(u)·R(∅,u,v,t)
ProvedRoutingBC.Chaining.target_dependency_recursionLet be a loop-free, source-oblivious routing scheme on a finite node set (total forwarding probability one at every non-target node, silent target), and a traffic matrix. Since the scheme does not depend on the source, write for the common value of , and . Then for every target and node ,
The expected number of packets targeted at that pass through consists of those injected at and those forwarded to 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 is represented by an arbitrary fixed node ; by source-obliviousness the value does not depend on the choice. No sign condition on is assumed.
import Mathlib import Definitions.Def_RoutingBC_Chaining_Routing
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.