Theorem.Parseval's Theorem [boolean/thm/parseval]

For all 𝑓,𝑔:{±1}𝑛,

𝑓2=𝐄[𝑓(𝑥)2]=𝑆[𝑛]𝑓̂(𝑆)2.

If 𝑓 is Boolean-valued then 𝑓(𝑥)2=1 everywhere, so 𝑆𝑓̂(𝑆)2=1: the squared coefficients of a ±1-valued function form a probability distribution over subsets 𝑆.