 Low-degree Fourier mass of a sparse Boolean set

For a subset of the unbiased Boolean hypercube of density $\alpha$, use normalized Fourier-Walsh transform coefficients. Applying Beckner's inequality with $\rho =1/\sqrt{3}$ gives $\Vert T_{\rho }{1}_A{\Vert }_2^2\le \Vert 1_A{\Vert }_{4/3}^2={\alpha }^{3/2}$. On levels at most two the weights ${\rho }^{2|S|}$ are at least $1/9$, giving the displayed bound. Parseval's identity gives total Fourier mass $\alpha$, so when $9\sqrt{\alpha }<1/2$ the higher levels contain strictly more than the lower levels.