A simple proof of the blowing-up lemma (Corresp.)

TLDR: Here an information-theoretic proof of the blowing-up lemma, generalizing it to continuous alphabets, is given.

Abstract: The blowing-up lemma says that if the probability with respect to a product measure of a set A\subseteq {\cal X}^{n} ({\cal X} finite, n large) is not exponentially small, then its l_{n} -neighborhood has probability almost one for some l_{n} = O(n) . Here an information-theoretic proof of the blowing-up lemma, generalizing it to continuous alphabets, is given.