PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: No information on entry rating
Bonferroni inequalities (Theorem)

Let $E(1)$ , $E(2),\ldots, E(n)$ be events in a sample space. Define

$\displaystyle S_1 := \sum_{i=1}^n \Pr(E(i))$    
$\displaystyle S_2 := \sum_{i<j} \Pr(E(i) \cap E(j)),$    

and for $2<k\leq n$ , $$ S_k := \sum \Pr(E(i_1)\cap \cdots \cap E(i_k) ) $$ where the summation is taken over all ordered $k$ -tuples of distinct integers.

Theorem

For odd $k$ , $1 \leq k \leq n$ , $$ \Pr(E(1)\cup\cdots\cup E(n)) \leq \sum_{j=1}^k (-1)^{j+1} S_j, $$ and for even $k$ , $2\leq k \leq n$ , $$ \Pr(E(1)\cup\cdots\cup E(n)) \geq \sum_{j=1}^k (-1)^{j+1} S_j, $$

Remark When $k=1$ , the Bonferroni inequality is also known as the union bound. When $k=n$ , we have an equality, also known as the inclusion-exclusion principle.




"Bonferroni inequalities" is owned by kshum.
(view preamble | get metadata)

View style:

See Also: Brun's pure sieve

Also defines:  union bound
Log in to rate this entry.
(view current ratings)

Cross-references: inclusion-exclusion principle, equality, even, odd, theorem, integers, summation, events
There is 1 reference to this entry.

This is version 6 of Bonferroni inequalities, born on 2004-07-29, modified 2008-05-22.
Object id is 6049, canonical name is BonferroniInequalities.
Accessed 12239 times total.

Classification:
AMS MSC60A99 (Probability theory and stochastic processes :: Foundations of probability theory :: Miscellaneous)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)