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

Proof of `Bounded table data and linear-size nominal coefficient records` (2nd statement)

groundedproofs/Lax342547Proofs/TableCounts.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.

Read the Lean proof on GitHub

Description

The padded record has one bit per component, sign, basis index, endpoint, and primal-or-channel coordinate. Count these independent binary slots.