Proof of `Fourier analysis on a finite Boolean cube` (2nd statement)
groundedproofs/Lax253009Proofs/BooleanFourier.lean · lax-253009
What this proof establishes
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
Parseval also bounds the energy of the real-valued averaged tables used for side conditions, since every pointwise square is at most one.