Disjunktsete

Disjunktsete, or disjoint sets, refer to a collection of sets that have no elements in common. In mathematics, a family {A_i} indexed by i ∈ I is pairwise disjoint if A_i ∩ A_j = ∅ whenever i ≠ j. The union of such a family consists of all elements that belong to any A_i, with no element appearing in more than one member.

If the sets A_i are nonempty and the family is finite, they form a partition of their union. More generally, a partition of a set X is a collection of nonempty pairwise disjoint subsets whose union is X. The concept of disjoint sets is fundamental to counting, probability, and measure theory because disjointness underpins additivity: for disjoint A_i, the measure or probability of the union equals the sum of the measures or probabilities, μ(∪ A_i) = Σ μ(A_i) in the finite case, and in the infinite case under σ-additivity.

Disjoint unions are a related construction in set theory and category theory. When forming a disjoint union, elements from different A_i are distinguished by tagging them with their index i, so that identical elements from different sets are kept distinct in the union. This idea generalizes to the concept of coproducts in categories.

Applications of disjoint sets include partitioning data, solving counting problems by breaking them into disjoint cases, and defining partitions in algebra, topology, and probability. The term illustrates the principle of mutual exclusivity: two sets are disjoint if they do not share any element.