迭代熵导数与二元熵不等式
Iterated Entropy Derivatives and Binary Entropy Inequalities
AI总结:
该研究系统分析二元熵相关函数的高阶导数,将二元熵不等式的证明转化为多项式实根问题,证明了分数指数下的不等式,提出了证明紧熵不等式的新框架。
摘要:
我们对$x^{k-r}H(x^r)$的$(k+1)$阶导数展开系统研究,其中$H(x):=-x\text{log}x-(1-x)\text{log}(1-x)$为二元熵,$k>r\geq1$为整数。研究动机是猜想性的熵不等式$α_k H(x^k)\geq x^{k-1}H(x)$,其中$0<α_k<1$由一个函数方程给出。$k=2$的情形是近期并闭集猜想相关突破的核心技术工具。我们将$\frac{d^{k+1}}{dx^{k+1}}x^{k-r}H(x^r)$表示为有理函数、无穷级数以及广义斯特林数的和。这使得我们可将实数$k$下的熵不等式证明简化为证明相关多项式在区间$(0,1)$内仅有两个实根,也让我们得以证明分数指数(如$k=3/2$)下的不等式。该证明为证明“多项式乘以多项式对数之和”的紧不等式提供了新框架,可将不等式转化为关于更简单的相关多项式实根的命题。
英文摘要:
We embark on a systematic study of the $(k+1)$-th derivative of $x^{k-r}H(x^r)$, where $H(x):=-x\log x-(1-x)\log(1-x)$ is the binary entropy and $k>r\geq 1$ are integers. Our motivation is the conjectural entropy inequality $α_k H(x^k)\geq x^{k-1}H(x)$, where $0<α_k<1$ is given by a functional equation. The $k=2$ case was the key technical tool driving recent breakthroughs on the union-closed sets conjecture. We express $ \frac{d^{k+1}}{dx^{k+1}}x^{k-r}H(x^r)$ as a rational function, an infinite series, and a sum over generalized Stirling numbers. This allows us to reduce the proof of the entropy inequality for real $k$ to showing that an associated polynomial has only two real roots in the interval $(0,1)$, which also allows us to prove the inequality for fractional exponents such as $k=3/2$. The proof suggests a new framework for proving tight inequalities for the sum of polynomials times the logarithms of polynomials, which converts the inequality into a statement about the real roots of a simpler associated polynomial.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。