The subject of this book/blog is the *analysis of Boolean functions*. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps the most basic object of study in theoretical computer science, and Fourier analysis has become an indispensable tool in the field. The topic has also played a key role in several other areas of mathematics, from combinatorics, random graph theory, and statistical physics, to Gaussian geometry, metric/Banach spaces, and social choice theory.

The intent of this book is both to develop the foundations of the field and to give a wide (though far from exhaustive) overview of its applications. Each chapter ends with a “highlight” showing the power of analysis of Boolean functions in different subject areas: property testing, social choice, cryptography, circuit complexity, learning theory, pseudorandomness, hardness of approximation, concrete complexity, and random graph theory.

The book can be used as a reference for working researchers or as the basis of a one-semester graduate-level course.

## Recent comments

Ohad Klein: In lemma 46 (48) - should it be $i \not \in J'_x$? (In its ...Ohad Klein: Another one - is the symbol "union" is redundant in 37b,c?Ohad Klein: I might be misunderstanding 37b. Suppose k=n=1. Then $E[f^q]...Ohad Klein: I might be wrong, but in ex. 9.31 (i.e. remark 9.29), I trie...Ohad Klein: sorry, my bad, again!Ohad Klein: In 23, is it $q \leq 2+2\epsilon$?Ohad Klein: ctrl+f: Paresval.