While this submission is a draft, it cannot be used by other submissions.

Proof of `Low-rank Boolean moments have bounded label support`

groundedproofs/Lax342547Proofs/LabelDecomposition.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.

Read the Lean proof on GitHub

Description

Express the matrix by point weights, find a stabilized degree, and pass to the radical quotient. The selector shifts induce commuting self-adjoint idempotents. Their joint projections give the label blocks; interpolation proves the binary diagonal identities. The dimension decomposition bounds both the number of labels and the sum of block ranks. Finally the minimal-degree identity-submatrix obstruction recovers all higher moments.