English

On essentially conditional information inequalities

Information Theory 2011-09-27 v4 Discrete Mathematics math.IT Probability

Abstract

In 1997, Z.Zhang and R.W.Yeung found the first example of a conditional information inequality in four variables that is not "Shannon-type". This linear inequality for entropies is called conditional (or constraint) since it holds only under condition that some linear equations are satisfied for the involved entropies. Later, the same authors and other researchers discovered several unconditional information inequalities that do not follow from Shannon's inequalities for entropy. In this paper we show that some non Shannon-type conditional inequalities are "essentially" conditional, i.e., they cannot be extended to any unconditional inequality. We prove one new essentially conditional information inequality for Shannon's entropy and discuss conditional information inequalities for Kolmogorov complexity.

Keywords

Cite

@article{arxiv.1103.2545,
  title  = {On essentially conditional information inequalities},
  author = {Tarik Kaced and Andrei Romashchenko},
  journal= {arXiv preprint arXiv:1103.2545},
  year   = {2011}
}

Comments

v4: substantial corrections; 13 pages

R2 v1 2026-06-21T17:38:55.470Z