Proof of claim made in Lecture 1

In Lecture 1 I made the claim that no symmetric encryption scheme can have perfect privacy (one-time or otherwise) if the key space is smaller than the message space. In this note I provide a proof of this claim.