Proof of `Bit rank and Walsh bounds for global vector-slot pairings` (1st statement)
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 bit matrix pairs equal bit coordinates. Interchanging the finite sums gives the specified linear combination of the vector-slot dot products.