 Entropy proof of cube edge-isoperimetry

For a vertex set of size $m$ in a hypercube graph, split one coordinate into sections of sizes $a,b$. Induction bounds the internal edges within the sections by $(a{\log }_{2}a+b{\log }_{2}b)/2$; at most $\min (a,b)$ edges cross between them. Put $t=\min (a,b)/(a+b)$. The chord bound for the binary entropy function gives $H_2(t)\ge 2t$, hence $a{\log }_{2}a+b{\log }_{2}b+2\min (a,b)\le m{\log }_{2}m$. Thus at most $m{\log }_{2}m/2$ internal edges are present, and the edge boundary is at least $m(n-{\log }_{2}m)$. Coordinate subcubes attain equality when $m$ is a power of two.