Difference between revisions of "Disjoint"

From Conservapedia
Jump to navigation Jump to search
(math concept)
 
(expand)
Line 1: Line 1:
Two sets A and B are said to be '''disjoint''' if their [[Intersect|intersection]] is the [[empty set]]. The empty set is disjoint from every set.
+
Two sets A and B are said to be '''disjoint''' if their [[Intersect|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).
  
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]

Revision as of 06:26, February 23, 2008

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).