Proof of `Graph-route distributions from high-value split flows` (1st statement)
groundedproofs/Lax263307Proofs/RouteDistributions.lean · lax-263307
What this proof establishes
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
Index outcomes by the endpoint pair and the original flow record. The normalization theorem gives total mass one. Endpoint uniqueness makes the endpoint marginal uniform; the load theorem bounds each membership feature.