Proof of `Recovery of low-rank Boolean moments from low degrees` (1st statement)
groundedproofs/Lax342547Proofs/MomentRecovery.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 sum of the two matrices is Hankel, has rank at most the sum of their ranks, and vanishes in all degrees up to that bound. Apply the minimal-degree rank obstruction. Over the binary field its vanishing is equality.