Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 168 2 ii Solution Created 2026-09-24 Updated 2026-09-24
To prove it, put . Part (i), applied to each discrete derivative of a Boolean function , givesOn the other hand, expanding the noise stability in Fourier coefficients givesChoose and defineThe preceding bounds make the low-degree Fourier mass omitted by at most , while the hypothesis makes the high-degree mass at most . Thus . Finally,which gives the asserted bound on .
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 168 2 iv Solution Created 2026-09-24 Updated 2026-09-24
For a Boolean-valued , each discrete derivative of a Boolean function takes values in and has degree at most . If depends on coordinate , then is nonzero, so part (iii) givesSince has degree at most , the Fourier formula for total influence and Parseval identity giveIf coordinates affect , then , so . Thus is a -junta, which is the Nisan-Szegedy junta theorem.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 168 3 ii Solution Created 2026-09-24 Updated 2026-09-24
If , monotonicity already gives , so assume . Suppose for a contradiction that . By the mean value theorem, some satisfiesThe Margulis-Russo formula identifies this derivative with the appropriately normalized total influence, so is bounded solely in terms of . The -biased Friedgut junta theorem then supplies, for any small , a Boolean -junta with and
Because is monotone, , hence when . It follows thatFor some assignment on with , therefore, . Monotonicity and imply . Choose , set , and take . Thencontradicting -quasirandomness. Thus .