Abstract We study a key inequality that implies the lower bound formula for the probability of correct selection and other selection-related events of interest in the Levin-Robbins-Leu family of sequential binomial subset selection procedures. We present a strategy for the proof of the key inequality, and a mostly complete general proof is given. The strategy provides an entirely complete and rigorous proof of the inequality for as many as seven competing populations using computer-assisted symbolic manipulation.

中文翻译：

---

关于在顺序二项式子集选择程序的 Levin-Robbins-Leu 族中隐含正确选择概率的下界公式的不等式

摘要 我们研究了一个关键的不等式，它暗示了正确选择的概率和其他与选择相关的事件在顺序二项式子集选择程序的 Levin-Robbins-Leu 家族中的概率的下界公式。我们提出了一个证明关键不等式的策略，并给出了一个几乎完整的一般证明。该策略使用计算机辅助的符号操作为多达七个竞争群体提供了完全完整和严格的不平等证明。