answersLogoWhite

0

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.

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan

Add your answer:

Earn +20 pts
Q: Difference betweenDisjoint sets and pairwise disjoint sets?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Algebra

What is a disjoint set?

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.


Difference between Union and Set Intersection Operation?

union means to group the given sets. where as intersection means to pick out the common elements from the given sets. if set a has 1,2,3 elements and B has 1,2,3,4,5. then its union will have 1,2,3,4,5 as its elements. and its intersection will have 1,2,3 as its elements.


Are equivalent sets equal sets why?

No, because equivalent sets are sets that have the SAME cardinality but equal sets are sets that all their elements are precisely the SAME. example: A={a,b,c} and B={1,2,3} equivalent sets C={1,2,3} and D={1,2,3} equal sets


What are the kinds of sets?

set contains two kinds a negative and positive set


Sets of Pythagorean triples?

3,4,5 1,2,3 these are sets of pythagorean triples