Events are mutually independent when
for every nonempty index subset . For two events and , this is equivalent to : learning whether occurred does not change the chance of .
For independent uniform dice, the events that the first result is an even integer and that the second result is an even integer each have probability ; their intersection has probability . In contrast, "first result is an even integer" and "first result is an odd integer" are disjoint events of positive probability, so they cannot be independent events. Learning one occurred completely rules out the other.
Pairwise independence is weaker than mutual independence. Take two independent fair bits . The three events , , and each have probability and every pair has intersection probability . Their triple intersection is the single outcome , of probability rather than . Checking pairs alone misses the joint constraint.
For three pairwise independent events of common probability , write . Inclusion-exclusion principle gives avoidance probability , and gives the displayed lower bound. It is strictly positive for . For , a symmetric atomic law with no zero-success atom has mass on each singleton success pattern, on each doubleton, and on the tripleton. These masses sum to one, have marginal , and have pair intersections .

Ancestors (6)

  1. Independent sigma-algebras
  2. Probability theory
  3. Probability and statistics
  4. Area of mathematics
  5. Mathematics
  6. Home

Synonyms (1)

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.