Proof of `The row-corank bound for a uniform binary matrix` (3rd statement)
groundedproofs/Lax342547Proofs/CorankCounting.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
Normalize the independent-relation count and cancel the common power of two, obtaining exactly 2^(sm)/2^(sn). If s exceeds the number of rows, the bad event is empty.