Probability theory and stochastic processes Theorem
Boole's inequality
Builds on Probability spaceEvent
Statement
Let be a probability space and let be a finite or infinite sequence of events. Then
Remarks
The inequality is also called the union bound. It needs no hypothesis on the events: they need not be disjoint or independent. Equality holds when the events are pairwise disjoint. The Bonferroni inequalities refine it with the terms of the inclusion–exclusion principle. For example, .
History
The inequality is named after George Boole.
Reading path
To understand this page from the ground up, read these 29 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Construction of the reals from Cauchy sequences concept
- Element definition
- Integers object
- Ordered field definition
- Proposition concept
- Random experiment concept
- Rational numbers object
- Set definition
- Ring of integers statement
- Disjunction definition
- Implication definition
- Predicate definition
- Union definition
- Sample space definition
- The rationals form a field statement
- Universal quantifier definition
- Subset definition
- The rationals form an ordered field statement
- Power set definition
- Universal set definition
- Order on the reals definition
- Complement definition
- Interval definition
- Sigma-algebra definition
- Event definition
- Probability axioms concept
- Probability measure definition
- Probability space definition
- Boole's inequality statement
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Boole's_inequality, lead section
About this page
| Tag | 0EGSEE9J9R |
|---|---|
| URI | m2://0EGSEE9J9R |
| Aliases | union-bound |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 60E15 |
| Status | This copy of the site has no build data. Run m2 status 0EGSEE9J9R. |
| Uses | Probability space, Event |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.