Search results
Results from the WOW.Com Content Network
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 ...
A generalized form of the diagonal argument was used by Cantor to prove Cantor's theorem: for every set S, the power set of S—that is, the set of all subsets of S (here written as P(S))—cannot be in bijection with S itself. This proof proceeds as follows:
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 ]
One of the earliest results in set theory, published by Cantor in 1874, was the existence of different sizes, or cardinalities, of infinite sets. [2] An infinite set is called countable if there is a function that gives a one-to-one correspondence between and the natural numbers, and is uncountable if there is no such correspondence function.
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|.
A set is countable if it can be enumerated, that is, if there exists an enumeration of it. Otherwise, it is uncountable. For example, the set of the real numbers is uncountable. A set is finite if it can be enumerated by means of a proper initial segment {1, ..., n} of the natural numbers, in which case, its cardinality is n.
It is possible for a Sierpiński set to be a subgroup under addition. For this one modifies the construction above by choosing a real number x β that is not in any of the countable number of sets of the form ( S α + X )/ n for α < β , where n is a positive integer and X is an integral linear combination of the numbers x α for α < β .
The Cantor set is an example of an uncountable null set. It is uncountable because it contains all real numbers between 0 and 1 whose ternary form decimal expansion can be written using only 0’s and 2’s, and it is null because it is constructed by beginning with the closed interval of real numbers from 0 to 1 and multiplying the length by 2 ...