Wednesday, April 25, 2007

Homework #5 & Talagrand

Solutions are posted.

Regarding Question #2: I referred to this as "Talagrand's Lemma", and that's how I personally think of it, having learned it first as Proposition 2.2 in Michel Talagrand's ingenious paper How much are increasing sets positively correlated?.

I think that, really, it should count as a folklore result. For example, in arithmetic combinatorics I think it's sometimes called Chang's Theorem. It is also the pith of the very technical proof of Bourgain's Theorem on the Fourier tails of boolean functions (not available online, but appearing in a paper of Khot and Naor). Bourgain uses a different proof, but doesn't quite derive it explicitly. The different proof relies on hypercontractivity and is extremely short:

Given f:{-1,1}n, let L be the degree-1 part of f. Then by Plancherel, W1(f)=f,LfqʹLq for any 1/q+1/qʹ=1, by Holder. Use hypercontractivity on Lq, noting that it has degree 1. One gets Lqq-1L2=q-1W1(f). On the other hand, we have fqʹ=E[fqʹ]1/qʹp1/qʹ=p1-1/q where p=E[f], since f1 and qʹ1. Putting it together, we get W1(f)p1-1/qq-1, which implies W1(f)p2q(1/p)2/q. Now we just need to choose q to balance q and (1/p)2/q; the optimum choice is q=Θ(log(1/p)), and this completes the proof.

No comments: