Disjoint sets - Citizendia

In mathematics, two sets are said to be disjoint if they have no element in common. Mathematics is the body of Knowledge and Academic discipline that studies such concepts as Quantity, Structure, Space and In Mathematics, the elements or members of a set (or more generally a class) are all those objects which when collected together make up the For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.

Explanation

Formally, two sets A and B are disjoint if their intersection is the empty set, i. In Mathematics, the intersection of two sets A and B is the set that contains all elements of A that also belong to B (or equivalently In Mathematics, and more specifically Set theory, the empty set is the unique set having no ( Zero) members e. if

$A\cap B = \varnothing.\,$

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

Formally, let I be an index set, and for each i in I, let A_i be a set. In Mathematics, the elements of a set A may be indexed or labeled by means of a set J that is on that account called an index Then the family of sets {A_i : i ∈ I} is pairwise disjoint if for any i and j in I with i ≠ j,

$A_i \cap A_j = \varnothing.\,$

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

$\bigcap_{i\in I} A_i = \varnothing.\,$

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 the collection.

A partition of a set X is any collection of non-empty subsets {A_i : i ∈ I} of X such that {A_i} are pairwise disjoint and

$\bigcup_{i\in I} A_i = X.\,$

In Mathematics, a partition of a set X is a division of X into non-overlapping " parts " or " blocks " In Mathematics, two sets are almost disjoint if their intersection is small in some sense In Mathematics, connectedness is used to refer to various properties meaning in some sense "all one piece" In Set theory, a disjoint union (or discriminated union) is a modified union operation which indexes the elements according to which set they originated Given a set of elements it is often useful to break them up or partition them into a number of separate nonoverlapping sets.

© 2009 citizendia.org; parts available under the terms of GNU Free Documentation License, from http://en.wikipedia.org
network: | |

Explanation

See also