Proof of `Uniform endpoint normalization of finite path flows` (2nd statement)
groundedproofs/Lax263307Proofs/RoutingNormalization.lean · lax-263307
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The lower bound on each routed mass bounds its inverse by gamma. Apply this to each weighted cost, interchange the finite sums, and use endpoint uniqueness to count each record at most once.