Proof of `Per-Client Fairness Parameters Reduce to a Uniform One` (1st statement)
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 two markers can never run on the same day, so each of them runs on exactly one day of every pair; a client of the original instance is blocked on exactly the additional days whose private slot lies inside the markers' job, and needs of the original days to reach .