Data Processing Inequality

For random variables forming a Markov chain X → Y → Z (i.e., X and Z are conditionally independent given Y), the Data Processing Inequality states I(X;Z) ≤ I(X;Y), where I denotes mutual information. In words: any (stochastic) processing of Y cannot increase the mutual information that the processed result Z has about the original X.