almost disjoint sets
   HOME

TheInfoList



OR:

In mathematics, two sets are almost disjoint Kunen, K. (1980), "Set Theory; an introduction to independence proofs", North Holland, p. 47Jech, R. (2006) "Set Theory (the third millennium edition, revised and expanded)", Springer, p. 118 if their intersection is small in some sense; different definitions of "small" will result in different definitions of "almost disjoint".


Definition

The most common choice is to take "small" to mean
finite Finite is the opposite of infinite. It may refer to: * Finite number (disambiguation) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marke ...
. In this case, two sets are almost disjoint if their intersection is finite, i.e. if :\left, A\cap B\ < \infty. (Here, ', ''X'', ' denotes the cardinality of ''X'', and '< ∞' means 'finite'.) For example, the closed intervals
, 1 The comma is a punctuation mark that appears in several variants in different languages. It has the same shape as an apostrophe or single closing quotation mark () in many typefaces, but it differs from them in being placed on the baseline o ...
and , 2are almost disjoint, because their intersection is the finite set . However, the unit interval
, 1 The comma is a punctuation mark that appears in several variants in different languages. It has the same shape as an apostrophe or single closing quotation mark () in many typefaces, but it differs from them in being placed on the baseline o ...
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 In mathematics, an index set is a set whose members label (or index) members of another set. For instance, if the elements of a set may be ''indexed'' or ''labeled'' by means of the elements of a set , then is an index set. The indexing consists ...
, and for each ''i'' in ''I'', let ''A''''i'' be a set. Then the collection of sets 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\ < \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 is an almost disjoint collection consisting of more than one set, then clearly its intersection is finite: :\bigcap_ A_i < \infty. However, the converse is not true—the intersection of the collection :\ is empty, but the collection is ''not'' almost disjoint; in fact, the intersection of ''any'' two distinct sets in this collection is infinite. The possible cardinalities of a maximal almost disjoint family (commonly referred to as a MAD family) on the set \omega of the
natural number In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''cardinal ...
s has been the object of intense study. The minimum infinite such cardinal is one of the classical Cardinal characteristics of the continuum.


Other meanings

Sometimes "almost disjoint" is used in some other sense, or in the sense of measure theory or
topological category In category theory, a discipline in mathematics, the notion of topological category has a number of different, inequivalent definitions. In one approach, a topological category is a category that is enriched over the category of compactly genera ...
. Here are some alternative definitions of "almost disjoint" that are sometimes used (similar definitions apply to infinite collections): *Let κ be any
cardinal number In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. T ...
. 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\ < \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 In mathematics, a complete measure (or, more precisely, a complete measure space) is a measure space in which every subset of every null set is measurable (having measure zero). More formally, a measure space (''X'', Σ, ''μ'') is compl ...
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 In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called po ...
. Then two subsets ''A'' and ''B'' of ''X'' are almost disjoint if their intersection is meagre in ''X''.


References

{{DEFAULTSORT:Almost Disjoint Sets Families of sets