LESSWRONG
LW

Wikitags
Main
3
IntroIntuitive
6
IntroAlgebraic
1
IntroTechnical
1
ExampleReal numbers
1

Uncountability (Math 3)

Edited by Daniel Satanove, Eric B, Patrick Stevens, et al. last updated 27th Oct 2016
Requires: ,

A X is uncountable if there is no between X and . Equivalently, there is no from X to N.

Foundational Considerations

In set theories without the , such as without choice (ZF), it can be that there is a κ that is incomparable to ℵ0. That is, there is no injection from κ to ℵ0 nor from ℵ0 to κ. In this case, cardinality is not a , so it doesn't make sense to think of uncountability as "larger" than ℵ0. In the presence of choice, , so an uncountable set can be thought of as "larger" than a countable set.

Countability in one is not necessarily countability in another. By , there is a model of set theory M where its of the naturals, denoted 2NM∈M is countable when considered outside the model. Of course, it is a that 2NM is uncountable, but that is within the model. That is, there is a bijection f:N→2NM that is not inside the model M (when f is considered as a set, its graph), and there is no such bijection inside M. This means that (un)countability is not .

See also

If you enjoyed this explanation, consider exploring some of other !

Arbital is made by people like you, if you think you can explain a mathematical concept then consider !

Parents:
Math 3
Uncountability
Skolem's Paradox
featured content
absolute
model
1
1
Zermelo Frankel set theory
injection
cardinal_number
bijection
consistent
set
Discussion9
Discussion9
total order
Arbital's
power set
N
cardinality is a total order
theorem
Axiom of Choice
axiom of choice
contributing to Arbital