Proof of `Deterministic directed uniform flow–cut algorithm`
groundedproofs/Lax455465Proofs/ProductCorollaries.lean · lax-455465
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
The directed uniform algorithm is the directed product algorithm on all-one weights, with full unit demand for each distinct ordered pair.
Proof strategy
Rewrite the demand-support cardinality to the input order in the directed product certificate guarantee. The RAM program itself is retained.