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

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