Search Results for ""

A theorem about (or providing an equivalent definition of) compact sets, originally due to Georg Cantor. Given a decreasing sequence of bounded nonempty closed sets C_1 ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A coordinate system obtained by inversion of the bicyclide coordinates. They are given by the transformation equations x = Lambda/(aUpsilon)snmudnnucospsi (1) y = ...

The symbol intersection , used for the intersection of sets, and sometimes also for the logical connective AND instead of the symbol ^ (wedge). In fact, for any two sets A ...

A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...

Let S be a collection of subsets of a set X, mu:S->[0,infty] a set function, and mu^* the outer measure induced by mu. The measure mu^_ that is the restriction of mu^* to the ...

Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

Let g:R->R be a function and let h>0, and define the cardinal series of g with respect to the interval h as the formal series sum_(k=-infty)^inftyg(kh)sinc((x-kh)/h), where ...

Let A and B be any sets. Then the product of |A| and |B| is defined as the Cartesian product |A|*|B|=|A×B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; Moore 1982, p. 37; ...