2026
CLM-INFO-003215<= I(X;Z) <= I(X;Y)UPPER BOUNDThe cited theorem establishes I(X;Z) <= I(X;Y) under the current specification; this does not assert universal empirical attainability.Source: Elements of Information Theory, second edition — Data-processing inequality ↗
PROVEN