Proof of `Walsh operator bounds with explicit bilinear rank` (4th 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.
Description
Multiplying a bounded test weight by a nonnegative relative density bounded by C multiplies its sup bound by at most C. The two factors therefore cost C₁C₂, without changing the bilinear rank.