Scholarlink

<p>We study constrained versions of the Ingleton inequality in the entropic setting and quantify its stability under small violations of conditional independence. Although the classical Ingleton inequality fails for general entropy profiles, it is known to hold under certain exact independence constraints. We focus on the regime where selected conditional mutual information terms are small (but not zero), and the inequality continues to hold up to controlled error terms. A central technical tool is a structural lemma that “materializes” part of the mutual information between two random variables, implicitly capturing the effect of infinitely many non-Shannon-type inequalities. This leads to conceptually transparent proofs without explicitly invoking such infinite families. Some of our bounds recover, in a unified way, what can also be deduced from the infinite families of inequalities of Matúš [<CitationRef CitationID="CR23">23</CitationRef>] and of Dougherty et al. [<CitationRef CitationID="CR11">11</CitationRef>], while others appear to be new.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Structural properties of entropic vectors and stability of the Ingleton inequality

  • 期刊论文

  • 发表日期：

    2026年7月28日

查看全文
  • Rostislav Matveev,
  • Andrei Romashchenko

摘要

We study constrained versions of the Ingleton inequality in the entropic setting and quantify its stability under small violations of conditional independence. Although the classical Ingleton inequality fails for general entropy profiles, it is known to hold under certain exact independence constraints. We focus on the regime where selected conditional mutual information terms are small (but not zero), and the inequality continues to hold up to controlled error terms. A central technical tool is a structural lemma that “materializes” part of the mutual information between two random variables, implicitly capturing the effect of infinitely many non-Shannon-type inequalities. This leads to conceptually transparent proofs without explicitly invoking such infinite families. Some of our bounds recover, in a unified way, what can also be deduced from the infinite families of inequalities of Matúš [23] and of Dougherty et al. [11], while others appear to be new.