Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Uncountable set
Summary
In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than that of the set of all natural numbers.
There are many equivalent characterizations of uncountability. A set X is uncountable if and only if any of the following conditions hold:
There is no injective function (hence no bijection) from X to the set of natural numbers.
X is nonempty and for every ω-sequence of elements of X, there exists at least one element of X not included in it. That is, X is nonempty and there is no surjective function from the natural numbers to X.
The cardinality of X is neither finite nor equal to (aleph-null, the cardinality of the natural numbers).
The set X has cardinality strictly greater than .
The first three of these characterizations can be proven equivalent in Zermelo–Fraenkel set theory without the axiom of choice, but the equivalence of the third and fourth cannot be proved without additional choice principles.
If an uncountable set X is a subset of set Y, then Y is uncountable.
The best known example of an uncountable set is the set R 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 and the set of all subsets of the set of natural numbers. The cardinality of R is often called the cardinality of the continuum, and denoted by , or , or (beth-one).
The Cantor set is an uncountable subset of R. The Cantor set is a fractal and has Hausdorff dimension greater than zero but less than one (R has dimension one). This is an example of the following fact: any subset of R of Hausdorff dimension strictly greater than zero must be uncountable.
Another example of an uncountable set is the set of all functions from R to R.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related courses (5)
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
PHYS-460: Nonlinear dynamics, chaos and complex systems
The course provides students with the tools to approach the study of nonlinear systems and chaotic dynamics. Emphasis is given to concrete examples and numerical applications are carried out during th
PHYS-702: Advanced Quantum Field Theory
The course builds on the course QFT1 and QFT2 and develops in parallel to the course on Gauge Theories and the SM.
Related lectures (32)
Relations, Sequences and Summations
Covers strings, countable sets, cardinality, and the concept of countability, exploring the countability of various sets and Cantor diagonalization.
Cardinality of Sets: Countable and Uncountable
Explores cardinality, countable sets, and examples of countable and uncountable sets.
Cantor's Diagonal Argument
Explores Cantor's Diagonal Argument and the concept of uncountability through binary digit sequences.