Almost disjoint sets Guide, Meaning , Facts, Information and Description
In mathematics, two sets are almost disjoint if their intersection is small in some sense. Different definitions of "small" will therefore result in different definitions of "almost disjoint".
The most common choice is to take "small" to mean finite. In this case, two sets are almost disjoint if their intersection is finite, i.e. if
Definition
(Here, '|X|' denotes the cardinality of X, and '< ∞' means 'finite'.) For example, the closed intervals [0, 1] and [1, 2] are almost disjoint, because their intersection is the finite set {1}. However, the unit interval [0, 1] and the set of rational numbers Q are not almost disjoint, because their intersection is infinite.
This definition extends to any collection of sets. A collection of sets is pairwise almost disjoint or mutually almost disjoint if any two distinct sets in the collection are almost disjoint. Often the prefix "pairwise" is dropped, and a pairwise almost disjoint collection is simply called "almost disjoint".
Formally, let I be an index set, and for each i in I, let Ai be a set. Then the collection of sets {Ai : i in I} is almost disjoint if for any i and j in I,
Sometimes "almost disjoint" is used in some other sense, or in the sense of measure theory or topological category. Here are some alternative definitions of "almost disjoint" that are sometimes used (similar definitions apply to infinite collections):
This is an Article on Almost disjoint sets. Page Contains Information, Facts Details or Explanation Guide About Almost disjoint sets Other meanings
