Almost disjoint sets

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, two sets are almost disjoint [1][2] if their intersection is small in some sense; different definitions of "small" will result in different definitions of "almost disjoint".

Definition[edit]

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

\left|A\cap B\right| < \infty.

(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,

A_i \ne A_j \quad \Rightarrow \quad \left|A_i \cap A_j\right| < \infty.

For example, the collection of all lines through the origin in R2 is almost disjoint, because any two of them only meet at the origin. If {Ai} is an almost disjoint collection consisting of more than one set, then clearly its intersection is finite:

\bigcap_{i\in I} A_i < \infty.

However, the converse is not true—the intersection of the collection

\{\{1, 2, 3,\ldots\}, \{2, 3, 4,\ldots\}, \{3, 4, 5,\ldots\},\ldots\}

is empty, but the collection is not almost disjoint; in fact, the intersection of any two distinct sets in this collection is infinite.

Other meanings[edit]

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):

  • Let κ be any cardinal number. Then two sets A and B are almost disjoint if the cardinality of their intersection is less than κ, i.e. if
\left|A\cap B\right| < \kappa.
The case of κ = 1 is simply the definition of disjoint sets; the case of
\kappa = \aleph_0
is simply the definition of almost disjoint given above, where the intersection of A and B is finite.
  • Let m be a complete measure on a measure space X. Then two subsets A and B of X are almost disjoint if their intersection is a null-set, i.e. if
m(A\cap B) = 0.
  • Let X be a topological space. Then two subsets A and B of X are almost disjoint if their intersection is meagre in X.

References[edit]

  1. ^ Kunen, K. (1980), "Set Theory; an introduction to independence proofs", North Holland, p. 47
  2. ^ Jech, R. (2006) "Set Theory (the third millennium edition, revised and expanded)", Springer, p. 118