Proof of `Sparse bounded-load route distributions are impossible`
groundedproofs/Lax263307Proofs/NoBoundedLoadRoutes.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
Choose a controlled-size subcubic source above the growth threshold. The overshoot and degree bound give a polynomial bound on its edge count, so the target and sparsity hypotheses meet the sampling budgets. Apply the cost-based width obstruction, then the integer growth inequality. It bounds the source order below its requested lower bound, a contradiction.