0

What is disjointed set?

Wiki User

2011-11-29 20:42:02

ExplanationFormally, two sets A and B are disjoint if their intersection is the empty set, i.e. if

This definition extends to any collection of sets. A collection of sets is pairwise disjoint or mutually disjoint if, given any two sets in the collection, those two sets are disjoint.

Formally, let I be an index set, and for each i in I, let Ai be a set. Then the family of sets {Ai : iI} is pairwise disjoint if for any i and j in I with ij,

For example, the collection of sets { {1}, {2}, {3}, ... } is pairwise disjoint. If {Ai} is a pairwise disjoint collection (containing at least two sets), then clearly its intersection is empty:

However, the converse is not true: the intersection of the collection {{1, 2}, {2, 3}, {3, 1}} is empty, but the collection is not pairwise disjoint. In fact, there are no two disjoint sets in this collection.

A partition of a set X is any collection of non-empty subsets {Ai : iI} of X such that {Ai} are pairwise disjoint and
Sets that are not the same.

Lauretta Pollich

Lvl 9
2022-09-07 06:49:07
Study guides

20 cards

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

➡️
See all cards
3.81
2052 Reviews

Wiki User

2015-12-19 17:25:57

It is a set which is usually defined over a continuous domain but has one or more gaps. Another way of looking at it is as a union of two or more sets which do not touch one another.