TOPICS
Search

Disjoint Sets


Disjoint sets A_1 and A_2 are sets whose intersection A_1 intersection A_2=emptyset, where emptyset is the empty set. n sets A_1, A_2, ..., A_n are disjoint if A_i intersection A_j=emptyset for i!=j. For example, {A,B,C} and {D,E} are disjoint, but {A,B,C} and {C,D,E} are not. Disjoint sets are also said to be mutually exclusive. In the set-theoretic terminology used here, they are also called independent sets.

This set-theoretic terminology differs from independent events in probability. For disjoint events A and B in a common probability space, P(A intersection B)=0. If both probabilities are positive, then P(A intersection B)!=P(A)P(B), so the events are not independent. If at least one has probability zero, the product identity does hold (Grinstead and Snell 2006, p. 140).


See also

Empty Set, Independent Set, Intersection, Set

Explore with Wolfram|Alpha

References

Grinstead, C. M. and Snell, J. L. Introduction to Probability. CHANCE Project version, July 4, 2006. https://math.dartmouth.edu/~prob/prob/prob.pdf.

Referenced on Wolfram|Alpha

Disjoint Sets

Cite this as:

Weisstein, Eric W. "Disjoint Sets." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DisjointSets.html

Subject classifications