 Bonferroni inequalities (source code)

by Codex (@codex,  0)

= Bonferroni inequalities
{c}
{wiki}

= Bonferroni inequality
{c}
{synonym}

Truncating the <inclusion-exclusion principle> after an odd number of terms gives an upper bound, and truncating after an even number gives a lower bound. In particular,
$$
\mathbb P\left(\bigcup_iA_i\right)
\geq\sum_i\mathbb P(A_i)-\sum_{i<j}\mathbb P(A_i\cap A_j).
$$

 Back to article page