证明了联合分布随机变量$A,B,X,Y$的不等式$H(A \mid B,X) + H(A \mid B,Y) \le H(A\mid B)$在一般情况下不成立,但在$A,B,X,Y$的概率分布的支持下,在一定的自然条件下成立.这个结果推广了条件英格尔顿不等式的一个版本:如果对某个分布$I(X: Y \mid A) = H(A\mid X,Y)=0$,则$I(A : B) \le I(A : B \mid X) + I(A: B \mid Y) + I(X : Y)$。我们提出了我们的结果的两个应用。第一个是下面这个简单的组合定理:假设一个二分图的边被划分为$K$匹配,使得对于每一对(左顶点$x$,右顶点$y$)在涉及$x$和$y$两者的分区中存在至多一个匹配;进一步假设每个左顶点的度数至少为$L$,并且每个右顶点的度数至少为$R$。然后是$K\ge LR$。第二个应用是证明二部图的二部覆盖下界的一种新方法。
英文摘要:
We show that the inequality $H(A \mid B,X) + H(A \mid B,Y) \le H(A\mid B)$ for jointly distributed random variables $A,B,X,Y$, which does not hold in general case, holds under some natural condition on the support of the probability distribution of $A,B,X,Y$. This result generalizes a version of the conditional Ingleton inequality: if for some distribution $I(X: Y \mid A) = H(A\mid X,Y)=0$, then $I(A : B) \le I(A : B \mid X) + I(A: B \mid Y) + I(X : Y)$.
We present two applications of our result. The first one is the following easy-to-formulate combinatorial theorem: assume that the edges of a bipartite graph are partitioned into $K$ matchings such that for each pair (left vertex $x$, right vertex $y$) there is at most one matching in the partition involving both $x$ and $y$; assume further that the degree of each left vertex is at least $L$ and the degree of each right vertex is at least $R$. Then $K\ge LR$. The second application is a new method to prove lower bounds for biclique coverings of bipartite graphs.
Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
University of California, Berkeley(加利福尼亚大学伯克利分校);Department of EECS, University of Michigan, Ann Arbor(密歇根大学安娜堡分校电气与计算机工程系);Department of Mathematics, Massachusetts Institute of Technology(麻省理工学院数学系);Simons Institute for the Theory of Computing, UC Berkeley and Institute for Advanced Study, Princeton(加州大学伯克利分校西蒙斯理论计算研究所和普林斯顿高等研究院)