| advertise add site services publishers database health videos | ![]() | about toolbar stats live show health store more stuff JOIN/LOGIN |
Leading Union Dentist - Finding Union Dentists - Union Dentistry sullivansedationdentist.c... | Union City Dentistry In A Great Location - Union City Dentist Dr. Giang... eastbayperiodontics.com | Union City Dentistry - Union City Dentist Dr. Giang - Graceful Smiles -... southlanddental.com | Dentist in Fremont Union city newark for Healthy teeths - Pediatric... preciousdental.com |
In mathematics, the term disjoint union may refer to one of two different concepts:
[edit] Set theory definitionFormally, let {Ai : i ∈ I} be a family of sets indexed by I. The disjoint union of this family is the set The elements of the disjoint union are ordered pairs (x, i). Here i serves as an auxiliary index that indicates which Ai the element x came from. Each of the sets Ai is canonically embedded in the disjoint union as the set For i ≠ j, the sets Ai* and Aj* are disjoint even if the sets Ai and Aj are not. In the extreme case where each of the Ai are equal to some fixed set A for each i ∈ I, the disjoint union is the Cartesian product of A and I: One may occasionally see the notation for the disjoint union of a family of sets, or the notation A + B for the disjoint union of two sets. This notation is meant to be suggestive of the fact that the cardinality of the disjoint union is the sum of the cardinalities of the terms in the family. Compare this to the notation for the Cartesian product of a family of sets. In the language of category theory, the disjoint union is the coproduct in the category of sets. It therefore satisfies the associated universal property. This also means that the disjoint union is the categorical dual of the Cartesian product construction. See coproduct for more details. For many purposes, the particular choice of auxiliary index is unimportant, and in a simplifying abuse of notation, the indexed family can be treated simply as a collection of sets. In this case [edit] Probability theory definitionLet C be a collection of pairwise disjoint sets. That is, for all sets A≠B in C, the intersection of these sets is empty: A∩B = ∅. Then the union of all sets in collection C is called the disjoint union of sets: As such, the term “disjoint union” is simply a shorthand for “union of sets which are pairwise disjoint”. [edit] See also |
| ↑ top of page ↑ | about thumbshots |