Proof of `The 3K+28 baseline bound in the actual nominal coordinates`
groundedproofs/Lax342547Proofs/NominalBaselines.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
The combined primal portion of the table has dimension at most 2K, the key span costs at most 28, and the opposite stored pin space at most K. Apply the bilateral bounded baseline construction to the two actual nominal table spaces, then evaluate on each endpoint's channels.