Kahn-Kalai 界何时提供非平凡信息？
When do the Kahn-Kalai Bounds Provide Nontrivial Information?
AI总结：
本文探讨了 Kahn-Kalai 界（即 Park-Pham 定理）何时能提供非平凡信息，给出了上界小于 1 的若干必要条件和充分条件，并证明了极小元素数量与覆盖大小须无限增长的强必要条件。
摘要：
Park-Pham 定理（先前被称为 Kahn-Kalai 猜想）将一个在超集下封闭的非平凡性质 $\mathcal{F}\subseteq 2^X$ 的临界概率 $p_c(\mathcal{F})$ 界定为通用常数 $K$、该性质的期望阈值 $q(\mathcal{F})$ 以及该性质最大极小元素大小的对数 $\log\ell(\mathcal{F})$ 的乘积。也就是说，Park-Pham 定理断言 $p_c(\mathcal{F})\leq Kq(\mathcal{F})\log\ell(\mathcal{F})$。由于临界概率 $p_c(\mathcal{F})$ 始终满足 $p_c(\mathcal{F})<1$，人们可能会问 Kahn 和 Kalai 提出的上界何时能比这提供更多信息——即，何时 $Kq(\mathcal{F})\log\ell(\mathcal{F}) < 1$ 成立？在这篇简短的笔记中，我们提供了这种情况发生的若干必要条件，并在此过程中给出了使该界提供新信息（实际上是渐近完美信息）的几个充分条件。在最有趣的情形 $\ell(\mathcal{F}_n)\rightarrow \infty$ 下，我们证明了 Kahn-Kalai 界提供非平凡信息的一个相对较强的必要条件：对于每个正整数 $t$，$\mathcal{F}_n$ 中除了 $t$ 个之外的所有极小元素的集合，只能在有限多个 $n$ 中具有非空交集。因此，不仅极小元素的数量必须变得任意大，任何覆盖的大小也必须如此。直观地说，这意味着这样的序列 $\mathcal{F}_n$ 必须在 $2^{X_n}$ 中占据一个不断扩大的“楔形”区域：$\mathcal{F}_n$ 在 $2^{X_n}$ 的一个区域中攀升得越高，它就必须在另一个区域中向下和向外蔓延得越远。
英文摘要：
The Park-Pham theorem (previously known as the Kahn-Kalai conjecture), bounds the critical probability, $p_c(\mathcal{F})$, of the a non-trivial property $\mathcal{F}\subseteq 2^X$ that is closed under supersets by the product of a universal constant $K$, the expectation threshold of the property, $q(\mathcal{F})$, and the logarithm of the size of the property's largest minimal element, $\log\ell(\mathcal{F})$. That is, the Park-Pham theorem asserts that $p_c(\mathcal{F})\leq Kq(\mathcal{F})\log\ell(\mathcal{F})$. Since the critical probability $p_c(\mathcal{F})$ always satisfies $p_c(\mathcal{F})<1$, one may ask when the upper bound posed by Kahn and Kalai gives us more information than this--that is, when is it true that $Kq(\mathcal{F})\log\ell(\mathcal{F}) < 1$? In this short note, we provide a number of necessary conditions for this to happen and give a few sufficient conditions for the bounds to provide new (and, in fact, asymptotically perfect) information along the way. In the most interesting case where $\ell(\mathcal{F}_n)\rightarrow \infty$, we prove the following relatively strong necessary condition for the Kahn-Kalai bounds to provide nontrivial information: For every positive integer $t$, every collection of all-but-$t$ of the minimal elements of $\mathcal{F}_n$ may have nonempty intersection for only finitely many $n$. Consequently, not only must the number of minimal elements become arbitrarily large, but so too must the size of any cover. Intuitively, this means that such sequences $\mathcal{F}_n$ must occupy an ever-widening `wedge' in $2^{X_n}$: the further $\mathcal{F}_n$ climbs up $2^{X_n}$ in one area, the further it must spread down and across $2^{X_n}$ in another.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
