While this submission is a draft, it cannot be used by other submissions.

Proof of `Agreement among many decoded tables` (1st statement)

groundedproofs/Lax253009Proofs/ManyTableConsistency.lean · lax-253009

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.

Read the Lean proof on GitHub

Description

Split selections according to their number of distinct projected assignments. Few distinct assignments are rare by the representative-table bound. For each remaining selection, each random function has to be constant on its image; take the union bound over all selections and then average over tables.