Proof of Reconstruction over finite alphabets (2nd 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.
In the paper
- page 18 of this submission's paper
Description
A uniform binary cost through length bounds all lifted words through length .