Best Answer

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 : i ∈ I} is pairwise disjoint if for any i and j in I with i ≠ j,

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 : i ∈ I} of X such that {Ai} are pairwise disjoint and

Sets that are not the same.

Study guides

☆☆

Q: What is a disjoint set?

Write your answer...

Submit

Still have questions?

Continue Learning about Algebra

Assuming that, by 'disjoint', you mean that a collection of sets has an empty intersection, here is the difference between pairwise disjoint and 'disjoint': If a collection of sets is pairwise disjoint, it implies that the collection is 'disjoint': If no two sets overlap, then no k sets would overlap for any k, since this would require the overlap of at least two sets i.e. you know for sure that k things aren't in contact at a common point if you know that no two of them are in contact with each other. However, if a collection of sets is 'disjoint' (so the overall intersection is empty), it doesn't mean that the collection is pairwise disjoint. For instance, you could have a collection of 4 sets containing two overlapping pairs, where no set in one pair overlaps with a set in the other. So the intersection of the whole thing would be empty without pairwise disjointness. You could have a few things in contact with each other without all of them sharing a point of contact.

The graph will be a set of disjoint points with coordinates [n, 0.5*(1+n)]

Any set that has elements that are not in that set.

The cardinality of a set is the number of elements in the set.

define compact set?

Related questions

Sets are not disjants, they are disjoint. And two sets are disjoint if they have nothing in common. For example, the set {1,3,5} has nothing in common with the set {2,4,6}. So they are disjoint.

Two sets are said to be "disjoint" if they have no common element - their intersection is the empty set. As far as I know, "joint" is NOT used in the sense of the opposite of disjoint, i.e., "not disjoint".

Not necessarily. For a counterexample, A and C could be the same set.

Two events are disjoint if they cannot occur together. In set terms, their intersection is a null set.

Two sets are said to be "disjoint" if they have no common element - their intersection is the empty set. As far as I know, "joint" is NOT used in the sense of the opposite of disjoint, i.e., "not disjoint".

The difference between joint sets and disjoint sets is the number of elements in common. A disjoint set, in math, does not any elements in common. A joint set must have at least one number in common.

they dont share common elements...thats why their disjoint..g??

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 : i ∈ I} is pairwise disjoint if for any i and j in I with i ≠ j,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 : i ∈ I} of X such that {Ai} are pairwise disjoint andSets that are not the same.

No, only if both sets are empty. The intersection of disjoint sets is always empty.

== == No. The set of rationals and the set of irrationals are disjoint sets.

Are disjoint and complementary subsets of the set of real numbers.

Disjoint sets are sets whose intersection, denoted by an inverted U), produces the null or the empty set. If a set is not disjoint, then it is called joint. [ex. M= {1,2,A} N = {4,5,B}. S intersection D is a null set, so M and N are disjoint sets.

People also asked