Search results
Results from the WOW.Com Content Network
Georg Cantor, c. 1870. Cantor's first set theory article contains Georg Cantor's first theorems of transfinite set theory, which studies infinite sets and their properties. One of these theorems is his "revolutionary discovery" that the set of all real numbers is uncountably, rather than countably, infinite. [1]
The best known example of an uncountable set is the set of all real numbers; Cantor's diagonal argument shows that this set is uncountable. The diagonalization proof technique can also be used to show that several other sets are uncountable, such as the set of all infinite sequences of natural numbers (see: (sequence A102288 in the OEIS)), and the set of all subsets of the set ...
An illustration of Cantor's diagonal argument (in base 2) for the existence of uncountable sets. The sequence at the bottom cannot occur anywhere in the enumeration of sequences above. An infinite set may have the same cardinality as a proper subset of itself, as the depicted bijection f(x)=2x from the natural to the even numbers demonstrates ...
As the above summation argument shows, the Cantor set is uncountable but has Lebesgue measure 0. Since the Cantor set is the complement of a union of open sets, it itself is a closed subset of the reals, and therefore a complete metric space. Since it is also totally bounded, the Heine–Borel theorem says that it must be compact.
You are free: to share – to copy, distribute and transmit the work; to remix – to adapt the work; Under the following conditions: attribution – You must give appropriate cre
the set of natural numbers, irrespective of including or excluding zero, the set of all integers, any infinite subset of the integers, such as the set of all square numbers or the set of all prime numbers, the set of all rational numbers, the set of all constructible numbers (in the geometric sense), the set of all algebraic numbers,
In mathematics, a Cantor algebra, named after Georg Cantor, is one of two closely related Boolean algebras, one countable and one complete. The countable Cantor algebra is the Boolean algebra of all clopen subsets of the Cantor set. This is the free Boolean algebra on a countable number of generators. Up to isomorphism, this is the only ...
All subsets of a set S (all possible choices of its elements) form the power set P(S). Georg Cantor proved that the power set is always larger than the set, i.e., |P(S)| > |S|. A special case of Cantor's theorem is that the set of all real numbers R cannot be enumerated by natural numbers, that is, R is uncountable: |R| > |N|.