statement theorem
Boole's inequality
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.
Explanations
L1 human
The chance that at least one of several bad things happens is at most the sum of their chances. If each of parts fails with probability , then some part fails with probability at most .
What this node 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 node is. They do not measure its truth.
What depends on this
2 nodes use this node, directly or through other nodes.
- Second Borel–Cantelli lemma 0NWXRAMEE7
- First Borel–Cantelli lemma 0T6WS7TT77
Sources
- Web https://en.wikipedia.org/wiki/Boole's_inequality, lead section
What links here
Used by
- First Borel–Cantelli lemma 0T6WS7TT77