Proof of `Bounded table data and linear-size nominal coefficient records` (1st 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.
Description
Every component/sign pin space has dimension at most the total pin budget. Pad one of its bases to K vectors, giving a uniform coefficient array whose span recovers that precise nominal subspace.