Uncountable set | EPFL Graph Search

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

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.

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.

Related publications (33)

Related people (6)

Related units (10)

Related concepts (22)

Related courses (5)

Related lectures (32)

Real number

In mathematics, a real number is a number that can be used to measure a continuous one-dimensional quantity such as a distance, duration or temperature. Here, continuous means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and more generally in all mathematics), in particular by their role in the classical definitions of limits, continuity and derivatives.

Rational number

In mathematics, a rational number is a number that can be expressed as the quotient or fraction \tfrac p q of two integers, a numerator p and a non-zero denominator q. For example, \tfrac{-3}{7} is a rational number, as is every integer (e.g., 5 = 5/1). The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface Q, or blackboard bold \Q. A rational number is a real number.

Infinite set

In set theory, an infinite set is a set that is not a finite set. Infinite sets may be countable or uncountable. The set of natural numbers (whose existence is postulated by the axiom of infinity) is infinite. It is the only set that is directly required by the axioms to be infinite. The existence of any other infinite set can be proved in Zermelo–Fraenkel set theory (ZFC), but only by showing that it follows from the existence of the natural numbers.

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.

Relations, Sequences and Summations CS-101: Advanced information, computation, communication I

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 CS-101: Advanced information, computation, communication I

Explores cardinality, countable sets, and examples of countable and uncountable sets.

Cantor's Diagonal Argument CS-101: Advanced information, computation, communication I

Explores Cantor's Diagonal Argument and the concept of uncountability through binary digit sequences.

MaskCLR: Attention-Guided Contrastive Learning for Robust Action Representation Learning

Alexandre Massoud Alahi, Mohamed Ossama Ahmed Abdelfattah, Mariam Ahmed Mahmoud Hegazy Hassan

Current transformer-based skeletal action recognition models tend to focus on a limited set of joints and low-level motion patterns to predict action classes. This results in significant performance degradation under small skeleton perturbations or changin ...

2024

FETCH: A Fast and Efficient Technique for Channel Selection in EEG Wearable Systems

David Atienza Alonso, Amir Aminifar, Alireza Amirshahi, José Angel Miranda Calero, Jonathan Dan

The rapid development of wearable biomedical systems now enables real-time monitoring of electroencephalography (EEG) signals. Acquisition of these signals relies on electrodes. These systems must meet the design challenge of selecting an optimal set of el ...

2024

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

Alireza Karimi, Philippe Louis Schuchert

A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. A convex set of D—stabilizing controllers around an initial D—stabilizing controller for a multi-model set is re ...

Elsevier2022