Proof of `Factorization and counting of low-rank binary matrices` (3rd statement)
groundedproofs/Lax342547Proofs/LowRankCounting.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
Divide the checked low-rank matrix count by the size of the full binary matrix space to obtain the exact finite uniform probability bound.