Lax Lean Archive

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

Proof of `Free bits of the FAF test` (1st statement)

groundedproofs/Lax253009Proofs/FAFPatterns.lean · lax-253009

What this proof establishes

thm✓Lax253009.FAFPatterns (1st statement)

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

Sum over 2^q reference answer strings, and use the proved bound of 2^s accepting side-condition patterns for each of the n tables.