Proof of Reconstruction over finite alphabets (1st statement)
groundedproofs/Lax100001Proofs/AlphabetResults.lean · lax-100001
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
A monotone bound for binary runs gives the stated finite-alphabet query bound.