Math 2.0

statement theorem

Boole's inequality

Statement

Let (Ω,F,P)(\Omega, \mathcal{F}, P) be a probability space and let A1,A2,A3,…A_1, A_2, A_3, \dots be a finite or infinite sequence of events. Then P(⋃iAi)≤∑iP(Ai).P\left(\bigcup_{i} A_i\right) \le \sum_{i} P(A_i).

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, P(⋃i=1nAi)≥∑iP(Ai)−∑i<jP(Ai∩Aj)P\left(\bigcup_{i=1}^n A_i\right) \ge \sum_i P(A_i) - \sum_{i < j} P(A_i \cap A_j).

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 1010 parts fails with probability 0.010.01, then some part fails with probability at most 0.10.1.

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.

Sources

  1. Web https://en.wikipedia.org/wiki/Boole's_inequality, lead section