Definition:Disjoint Sets

From ProofWiki
Jump to: navigation, search

Definition

Two sets $S$ and $T$ are disjoint if and only if:

$S \cap T = \O$

That is, disjoint sets are such that their intersection is the empty set -- they have no elements in common.


Also known as

Some early sources refer to disjoint sets as non-overlapping or non-intersecting.

The term mutually exclusive sets can also be seen.


Examples

$3$ Arbitrarily Chosen Sets

Let:

\(\displaystyle U\) \(=\) \(\displaystyle \set {u_1, u_2, u_3}\)
\(\displaystyle V\) \(=\) \(\displaystyle \set {u_1, u_3}\)
\(\displaystyle W\) \(=\) \(\displaystyle \set {u_2, u_4}\)


Then:

\(\displaystyle U \cup V\) \(=\) \(\displaystyle \set {u_1, u_2, u_3}\)
\(\displaystyle U \cap V\) \(=\) \(\displaystyle \set {u_1, u_3}\)
\(\displaystyle V \cup W\) \(=\) \(\displaystyle \set {u_1, u_2, u_3, u_4}\)
\(\displaystyle U \cap W\) \(=\) \(\displaystyle \set {u_2}\)
\(\displaystyle V \cap W\) \(=\) \(\displaystyle \O\)

Thus $V$ and $W$ are disjoint.


Also see


Sources