Proof of `Recovery of low-rank Boolean moments from low degrees` (2nd 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
Choose a nonzero moment of least selector degree d. Complementary subsets of its support give an identity submatrix of size binomial(d, floor(d/2)), which is at least d. The rank bound forces d into the vanishing degrees.