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\leftA_i\right \leq \sum_i \Pr\leftA_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
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.

 

<< PreviousWord BrowserNext >>
glen canyon dam
nancy greene
karlspreis
canada's athletes of the 20th century
on her majesty's secret service
giant slalom skiing
lord high treasurer
die rzte
concilium germanicum
equestrian sculpture
times beach, missouri
new media
osterley tube station
saturday night massacre
conrad of franconia
lublin voivodship
n pow
oath of allegiance
n affil
holm oak
cytogenetics
shannon whirry
canine
flora tristan
oregon white oak
turkey oak
boxcar children
hms enterprise (1705)
hms enterprize (1709)
cork oak
gene stratton porter
skin walker
halley research station
list of ontario provincial highways
mechanical traveller
bchi automaton
julio cesar gonzalez
richard burns
leech lattice
neuroevolution of augmented topologies
hms enterprize (1718)
hms enterprize (1774)
carpatair
hms enterprise (1848)