Proof of `The finite simultaneous unary mixer estimate` (1st statement)
groundedproofs/Lax342547Proofs/UnaryMixers.lean · lax-342547
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
Use the explicit threshold, independent of n and of the tester family. The finite union bound then yields mixers satisfying every unary test for each n above that threshold, before any unit law is introduced.