Almost disjoint sets

Almost disjoint sets

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".

Definition

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|Acap B ight| < infty.

(Here, '|"X"|' denotes the cardinality of "X", and '< &infin;' 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 "A""i" be a set. Then the collection of sets {"A""i" : "i" in "I"} is almost disjoint if for any "i" and "j" in "I",

:A_i e A_j quad Rightarrow quad left|A_i cap A_j ight| < 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 {"A""i"} is an almost disjoint collection, then clearly its intersection is finite:

:igcap_{iin 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

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 &kappa; be any cardinal number. Then two sets "A" and "B" are almost disjoint if the cardinality of their intersection is less than &kappa;, i.e. if

:left|Acap B ight| < kappa.

:The case of &kappa; = 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(Acap 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".


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Disjoint sets — Two disjoint sets. In mathematics, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.[1] Explanation Formally, two sets A and …   Wikipedia

  • Near sets — are disjoint sets that resemble each other. Resemblance between disjoint sets occurs whenever there are observable similarities between the objects in the sets. Similarity is determined by comparing lists of object feature values. Each list of… …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Ensembles disjoints — En mathématiques, deux ensembles sont dits disjoints s ils n ont pas d éléments en commun. Par exemple, {1,2,3} et {4,5,6} sont deux ensembles disjoints. Explication De manière formelle, deux ensembles A et B sont disjoints si leur intersection… …   Wikipédia en Français

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Coproduct — This article is about coproducts in categories. For coproduct in the sense of comultiplication, see Coalgebra. In category theory, the coproduct, or categorical sum, is the category theoretic construction which includes the disjoint union of sets …   Wikipedia

  • logic, history of — Introduction       the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic       There was a medieval tradition according to which the Greek philosopher …   Universalium

  • Probability space — This article is about mathematical term. For the novel, see Probability Space (novel). In probability theory, a probability space or a probability triple is a mathematical construct that models a real world process (or experiment ) consisting of… …   Wikipedia

  • Addition — is the mathematical process of putting things together. The plus sign + means that two numbers are added together. For example, in the picture on the right, there are 3 + 2 apples meaning three apples and two other apples which is the same as… …   Wikipedia

  • Non-measurable set — This page gives a general overview of the concept of non measurable sets. For a precise definition of measure, see Measure (mathematics). For various constructions of non measurable sets, see Vitali set, Hausdorff paradox, and Banach–Tarski… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”