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

Proof of `The finite uniform raw-vertex law` (1st statement)

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

Forget the Gram and injectivity constraints and count the four binary matrices at every component. Each component uses 2N(d+h) bits.