On the non-robustness of essentially conditional information inequalities

We show that two essentially conditional linear inequalities for Shannon's entropies (including the Zhang-Yeung'97 conditional inequality) do not hold for asymptotically entropic points. This means that these inequalities are non-robust in a very strong sense. This result raises the question of the meaning of these inequalities and the validity of their use in practice-oriented applications.

[1]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

[2]  F. Matús,et al.  Two Constructions on Limits of Entropy Functions , 2007, IEEE Transactions on Information Theory.

[3]  Zhen Zhang,et al.  On a new non-Shannon-type information inequality , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Andrei E. Romashchenko,et al.  On essentially conditional information inequalities , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Raymond W. Yeung,et al.  On a relation between information inequalities and group theory , 2002, IEEE Trans. Inf. Theory.

[6]  Randall Dougherty,et al.  Networks, Matroids, and Non-Shannon Information Inequalities , 2007, IEEE Transactions on Information Theory.

[7]  F. Mattt,et al.  Conditional Independences among Four Random Variables Iii: Final Conclusion , 1999 .

[8]  Zhen Zhang,et al.  A non-Shannon-type conditional inequality of information quantities , 1997, IEEE Trans. Inf. Theory.

[9]  J. Pearl.  Causal inference in statistics: An overview , 2009 .

[10]  A. Dawid.  Conditional Independence in Statistical Theory , 1979 .

[11]  Frantisek Matús,et al.  Infinitely Many Information Inequalities , 2007, 2007 IEEE International Symposium on Information Theory.

[12]  Nikolai K. Vereshchagin,et al.  A new class of non-Shannon-type inequalities for entropies , 2002, Commun. Inf. Syst..

[13]  Andrei E. Romashchenko.  Extracting the mutual information for a triple of binary strings , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[14]  Frantisek Matús,et al.  Adhesivity of polymatroids , 2007, Discret. Math..

[15]  Nikolai K. Vereshchagin,et al.  Inequalities for Shannon Entropy and Kolmogorov Complexity , 1997, J. Comput. Syst. Sci..

[16]  Andrej Muchnik,et al.  Conditional complexity and codes , 2002, Theor. Comput. Sci..

[17]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .

[18]  Frantisek Matús,et al.  Piecewise linear conditional information inequality , 2006, IEEE Transactions on Information Theory.

[19]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.