of size smaller than (in the sense of exponent) would cover a set of probability bounded away from .

Proof: Source coding theorem for symbol codes

For let denote the word length of each possible . Define , where is chosen so that . Then

where the second line follows from Gibbs' inequality and the fifth line follows from Kraft's inequality:

so .

For the second inequality we may set