Disjoint

This is the current revision of Disjoint as edited by DavidB4-bot (talk | contribs) at 11:42, July 13, 2016. This URL is a permanent link to this version of this page.
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Two sets A and B are said to be disjoint if their intersection is the empty set. The empty set is disjoint from every set. The union of disjoint sets is always a superset of each of the original sets (as long as the sets are finite).