digplanet beta 1: Athena
Share digplanet:


Applied sciences






















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.


Boole's inequality may be proved for finite collections of events 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).


{\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[edit]

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).


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


S_2 := \sum_{1\le i<j\le n} {\mathbb P}(A_i \cap A_j),

as well as

S_k := \sum_{1\le i_1<\cdots<i_k\le n} {\mathbb P}(A_{i_1}\cap \cdots \cap A_{i_k} )

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.

See also[edit]


This article incorporates material from Bonferroni inequalities on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

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.
61 videos foundNext > 

Mod-01 Lec-04 Laws of Probability - I

Probability and Statistics by Dr.Somesh Kumar,Department of Mathematics,IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in.

Решение задач по теории вероятностей и математике. Курсовые работы на заказ. Помощь репетитора МФТИ

http://www.youtube.com/watch?v=orMbvjrvxvE Решение задач ЕГЭ математика стереометрия. Уроки онлайн репетитора http://sites.google.com/site/reseniezadacegepom...

C3 - Modulus Function - Solving Inequalities

Graphical and algebraic approach to solving inequalities. Squaring and using the difference of 2 squares.

Matlab Basics 07 Simple Math

Basic addition, subtraction, multiplication, exponentiation, and modulus are looked at.

Algebra Circles Standard Equation 02

practical problem time.

Theorem of Inequalities BSCS C21(Taguig City University)

College Algebra Natural nbrs, whole nbrs, and integers

I show what Natural and whole nbrs are along with integers. Brief, and to the point. More elaboration with time.

Rage Math: An Explanation of Vectors

You probably don't know what a vector is, so you should probably watch this video so you can cure your unbearable ignorance.

A Structure Theorem for Boolean Functions with Small Total Influences

Hamed Hatami, McGill University Functional Inequalities in Discrete Spaces with Applications http://simons.berkeley.edu/talks/hamed-hatami-2013-09-30.

Inequalities Part One

How 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",...

61 videos foundNext > 

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


Oops, we seem to be having trouble contacting Twitter

Talk About Boole's inequality

You can talk about Boole's inequality with people all over the world in our discussions.

Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!