A Simple Proof of Multi-Letter Converse Theorem for Distributed Lossless Source Coding

This paper provides a simple proof of the multi-letter converse theorem for distributed lossless source coding (Slepian-Wolf source coding and Wyner-Ahlswede-Körner source coding), where the number of reproduced sources is arbitrary. It is shown only by using basic inequalities of limit superior/inferior in probability, the non-negativity of the divergence, and the single-source version of the Fano inequality, where the epsilon-delta arguments are hidden in the above inequalities.