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

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.

Read the Lean proof on GitHub

Description

Parseval also bounds the energy of the real-valued averaged tables used for side conditions, since every pointwise square is at most one.