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

Proof of `Walsh operator bounds with explicit bilinear rank` (1st statement)

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

Normalize both weights by their sup bounds and apply the uniform rank estimate. If either bound is zero its weight vanishes identically.