digplanet beta 1: Athena
Share digplanet:

Agriculture

Applied sciences

Arts

Belief

Chronology

Culture

Education

Environment

Geography

Health

History

Humanities

Language

Law

Life

Mathematics

Nature

People

Politics

Science

Society

Technology

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. Boole's inequality is named after George Boole.

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

${\mathbb P}\biggl(\bigcup_{i} A_i\biggr) \le \sum_i {\mathbb P}(A_i).$

In measure-theoretic terms, Boole's inequality follows from the fact that a measure (and certainly any probability measure) is σ-sub-additive.

## Proof

Boole's inequality may be proved using the method of induction.

For the $n=1$ case, it follows that

$\mathbb P(A_1) \le \mathbb P(A_1).$

For the case $n$, we have

${\mathbb P}\biggl(\bigcup_{i=_1}^{n} A_i\biggr) \le \sum_{i=_1}^{n} {\mathbb P}(A_i).$

Since $\mathbb P(A \cup B) = \mathbb P(A) + \mathbb P(B) - \mathbb P(A \cap B),$ and because the union operation is associative, we have

${\mathbb P}\biggl(\bigcup_{i=_1}^{n+1} A_i\biggr) = {\mathbb P}\biggl(\bigcup_{i=_1}^n A_i\biggr) + \mathbb P(A_{n+1}) - {\mathbb P}\biggl(\bigcup_{i=_1}^n A_i \cap A_{n+1}\biggr).$

Since

${\mathbb P}\biggl(\bigcup_{i=_1}^n A_i \cap A_{n+1}\biggr) \ge 0,$

by the first axiom of probability, we have

${\mathbb P}\biggl(\bigcup_{i=_1}^{n+1} A_i\biggr) \le {\mathbb P}\biggl(\bigcup_{i=_1}^n A_i\biggr) + \mathbb P(A_{n+1})$,

and therefore

${\mathbb P}\biggl(\bigcup_{i=_1}^{n+1} A_i\biggr) \le \sum_{i=_1}^{n} {\mathbb P}(A_i) + \mathbb P(A_{n+1}) = \sum_{i=_1}^{n+1} {\mathbb P}(A_i)$.

## Bonferroni inequalities

Boole's inequality may be generalised to find upper and lower bounds on the probability of finite unions of events. These bounds are known as Bonferroni inequalities, after Carlo Emilio Bonferroni, see Bonferroni (1936).

Define

$S_1 := \sum_{i=1}^n {\mathbb P}(A_i),$

and

$S_2 := \sum_{1\le i

as well as

$S_k := \sum_{1\le i_1<\cdots

for all integers k in {3, ..., n}.

Then, for odd k in {1, ..., n},

${\mathbb P}\biggl( \bigcup_{i=1}^n A_i \biggr) \le \sum_{j=1}^k (-1)^{j-1} S_j,$

and for even k in {2, ..., n},

${\mathbb P}\biggl( \bigcup_{i=1}^n A_i \biggr) \ge \sum_{j=1}^k (-1)^{j-1} S_j.$

Boole's inequality is recovered by setting k = 1. When k = n, then equality holds and the resulting identity is the inclusion–exclusion principle.

## References

Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Boole's_inequality — Please support Wikipedia.
A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
 48 videos foundNext >
 COLLEGE ALGEBRA CIRCLES Equations and Inequalities 08-20-2013COLLEGE ALGEBRA CIRCLES Equations and Inequalities 08-20-2013. Algebra Circles Standard Equation 02practical problem time. Theorem of Inequalities BSCS C21(Taguig City University) Derivative of e raised to the (X*Sin(x))e^(X*Sin(x)) is derived. Inequalities Part OneHow to solve an inequality in a linear equation- part one.. This is video 21 of 51 in the solving equation series. The next three series are "Word Problems",... Multiple comparisonsIn statistics, the multiple comparisons, multiplicity or multiple testing problem occurs when one considers a set of statistical inferences simultaneously or... Solving and Graphing Linear Inequalities (e) De Morgan's Theorem and Propositional NotationDe Morgan's Theorem is looked at.using Boolean and Propositional logic notation. College Algebra Natural nbrs, whole nbrs, and integersI show what Natural and whole nbrs are along with integers. Brief, and to the point. More elaboration with time. Vector Triangles
 48 videos foundNext >

We're sorry, but there's no news about "Boole's inequality" right now.

 Limit to books that you can completely read online Include partial books (book previews) .gsc-branding { display:block; }

Oops, we seem to be having trouble contacting Twitter