Proof of `Fourier analysis on a finite Boolean cube` (1st statement)
groundedproofs/Lax323828Proofs/BooleanFourier.lean · lax-323828
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
Apply Parseval and use that every sign has square one.