The Fourier expansion of a boolean function $f : \{-1,1\}^n \to \{-1,1\}$ is simply its representation as a real, multilinear polynomial. (Multilinear means that no variable $x_i$ appears squared, cubed, etc.) For example, suppose $n = 2$ and $f = {\textstyle \min_2}$, the “minimum” function on $2$ bits:

[...]

## Recent comments

Ryan O'Donnell: Good catch, thank you Xi.Ryan O'Donnell: Thank you! Sorry for the delay in replying.Ryan O'Donnell: Hi Ming. Here S stands for a fixed (non-random) subset of [...Xi Wu: typo: "our definition of $\mathbf{Inf}_i[f]$ from Chapter 2....Chengyu: Ex 2.c It should be "Suppose ... is an LTF with $\textbf{E}...Ming: I confuse the notation S in Fact 1.7. I wonder that the sym...Ryan O'Donnell: Yes, thanks! Sorry for the delay in replying.