Misplaced Pages

In mathematics, an uncountable set, informally, 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 aleph-null, the cardinality of the natural numbers.

Characterizations

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 ${\displaystyle \aleph _{0}}$ (aleph-null).
• The set X has cardinality strictly greater than ${\displaystyle \aleph _{0}}$.

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.

Properties

• If an uncountable set X is a subset of set Y, then Y is uncountable.

Examples

The best known example of an uncountable set is the set ⁠${\displaystyle \mathbb {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 ⁠${\displaystyle \mathbb {N} }$⁠, and the set of all subsets of the set of natural numbers. The cardinality of ⁠${\displaystyle \mathbb {R} }$⁠ is often called the cardinality of the continuum, and denoted by ${\displaystyle {\mathfrak {c}}}$, or ${\displaystyle 2^{\aleph _{0}}}$, or ${\displaystyle \beth _{1}}$ (beth-one).

The Cantor set is an uncountable subset of ⁠${\displaystyle \mathbb {R} }$⁠. The Cantor set is a fractal and has Hausdorff dimension greater than zero but less than one (⁠${\displaystyle \mathbb {R} }$⁠ has dimension one). This is an example of the following fact: any subset of ⁠${\displaystyle \mathbb {R} }$⁠ of Hausdorff dimension strictly greater than zero must be uncountable.

Another example of an uncountable set is the set of all functions from ⁠${\displaystyle \mathbb {R} }$⁠ to ⁠${\displaystyle \mathbb {R} }$⁠. This set is even "more uncountable" than ⁠${\displaystyle \mathbb {R} }$⁠ in the sense that the cardinality of this set is ${\displaystyle \beth _{2}}$ (beth-two), which is larger than ${\displaystyle \beth _{1}}$.

A more abstract example of an uncountable set is the set of all countable ordinal numbers, denoted by Ω or ω₁. The cardinality of Ω is denoted ${\displaystyle \aleph _{1}}$ (aleph-one). It can be shown, using the axiom of choice, that ${\displaystyle \aleph _{1}}$ is the smallest uncountable cardinal number. Thus either ${\displaystyle \beth _{1}}$, the cardinality of the reals, is equal to ${\displaystyle \aleph _{1}}$ or it is strictly larger. Georg Cantor was the first to propose the question of whether ${\displaystyle \beth _{1}}$ is equal to ${\displaystyle \aleph _{1}}$. In 1900, David Hilbert posed this question as the first of his 23 problems. The statement that ${\displaystyle \aleph _{1}=\beth _{1}}$ is now called the continuum hypothesis, and is known to be independent of the Zermelo–Fraenkel axioms for set theory (including the axiom of choice).

Without the axiom of choice

Without the axiom of choice, there might exist cardinalities incomparable to ${\displaystyle \aleph _{0}}$ (namely, the cardinalities of Dedekind-finite infinite sets). Sets of these cardinalities satisfy the first three characterizations above, but not the fourth characterization. Since these sets are not larger than the natural numbers in the sense of cardinality, some may not want to call them uncountable.

If the axiom of choice holds, the following conditions on a cardinal ${\displaystyle \kappa }$ are equivalent:

• ${\displaystyle \kappa \nleq \aleph _{0};}$
• ${\displaystyle \kappa >\aleph _{0};}$ and
• ${\displaystyle \kappa \geq \aleph _{1}}$, where ${\displaystyle \aleph _{1}=|\omega _{1}|}$ and ${\displaystyle \omega _{1}}$ is the least initial ordinal greater than ${\displaystyle \omega .}$

However, these may all be different if the axiom of choice fails. So it is not obvious which one is the appropriate generalization of "uncountability" when the axiom fails. It may be best to avoid using the word in this case and specify which of these one means.

See also

• Aleph number
• Beth number
• First uncountable ordinal
• Injective function

References

1. Weisstein, Eric W. "Uncountably Infinite". mathworld.wolfram.com. Retrieved 2020-09-05.

Bibliography

• Halmos, Paul, Naive Set Theory. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition). Reprinted by Martino Fine Books, 2011. ISBN 978-1-61427-131-4 (Paperback edition).
• Jech, Thomas (2002), Set Theory, Springer Monographs in Mathematics (3rd millennium ed.), Springer, ISBN 3-540-44085-2

External links

• Proof that R is uncountable

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

• Basic concepts in infinite set theory
• Infinity
• Cardinal numbers