Boole's inequality - Your Art History Reference Guide!

ArtHistoryClub Information Site on Boole's inequality Art History Art History Search        Art History Browse welcome to our free resource site for all art history lovers!
Art History Search        Art History Browse             News        Gallery        Forums        Articles        Weblinks        welcome to our free resource site for all art history lovers!

Boole's inequality

In probability theory, Boole's inequality (also known as the union bound) says that for any finite or countable set of events, the probability that at least one of the events happens is no greater than the sum of the probabilities of the individual events.

Formally, for a countable set of events A1, A2, A3, ..., we have

\Pr\left[\bigcup_{i} A_i\right] \leq \sum_i \Pr\left[A_i\right].

Bonferroni inequalities

Boole's inequality may be generalised to find upper and lower bounds, known as Bonferroni inequalities, on the probability of finite unions of events.

Define

S_1 := \sum_{i=1}^n \Pr(A_i),
S_2 := \sum_{i<j} \Pr(A_i \cap A_j),

and for 2 < kn,

S_k := \sum \Pr(A_{i_1}\cap \cdots \cap A_{i_k} ),

where the summation is taken over all k-tuples of distinct integers.

Then, for odd k ≥ 1,

\Pr\left( \bigcup_{i=1}^n A_i \right) \leq \sum_{j=1}^k (-1)^{j+1} S_j,

and for even k ≥ 2,

\Pr\left( \bigcup_{i=1}^n A_i \right) \geq \sum_{j=1}^k (-1)^{j+1} S_j.

Boole's inequality is recovered by setting k = 1.


Last updated: 06-30-2005 14:40:52
Last updated: 01-04-2007 01:18:57
The contents of this article are licensed from Wikipedia.org under the
GNU Free Documentation License. See original document.
Art History Search | Art History Browse | Contact | Legal info