A simple proof of the blowing-up lemma (Corresp.)
K. Marton · IEEE Transactions on Information Theory · 1986
The blowing-up lemma says that if the probability with respect to a product measure of a setA\subseteq {\cal X}^{n} ({\cal X}finite,nlarge) is not exponentially small, then itsl_{n}-neighborhood has probability almost one for somel_{n} = O(n). Here an information-theoretic proof of the blowing-up lemma, generalizing it to continuous alphabets, is given.