Answers are grounded in this paper and cite their sources.
Let A₁, A₂, ⋯, Aₙ be events on a probability space. Let Sk,n be the kth binomial moment of the number mₙ of those A's which occur. An estimate on the distribution yₜ = P(mₙ t) by a linear combination of S1,n, S2,n, ⋯, Sn,n is called a Bonferroni inequality. We present for proving Bonferroni inequalities a method which makes use of the following two facts: the sequence yₜ is decreasing and Sk,n is a linear combination of the yₜ. By this method, we significantly simplify a recent proof for the sharpest possible lower bound on y₁ in terms of S1,n and S2,n. In addition, we obtain an extension of known bounds on yₜ in the spirit of a recent extension of the method of inclusion and exclusion.
No takes yet. Share an insight, caveat, or question.
János Galambos (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: