Art of Problem Solving

Uncountable: Difference between revisions

ComplexZeta (talk | contribs)
No edit summary
 
No edit summary
Line 1: Line 1:
{{stub}}
A set <math>S</math> is said to be '''uncountable''' if there is no [[injection]] <math>f:S\to\mathbb{Z}</math>. A well-known example of an uncountable set is the set of [[real number]]s <math>\mathbb{R}</math>.
A set <math>S</math> is said to be '''uncountable''' if there is no [[injection]] <math>f:S\to\mathbb{Z}</math>. A well-known example of an uncountable set is the set of [[real number]]s <math>\mathbb{R}</math>.


(Someone should give the proof that <math>\mathbb{R}</math> is uncountable.)
(Someone should give the proof that <math>\mathbb{R}</math> is uncountable.)


{{stub}}
==See Also==
 
* [[Countable]]
* [[Infinite]]
* [[Finite]]

Revision as of 12:17, 29 June 2006

This article is a stub. Help us out by expanding it.

A set $S$ is said to be uncountable if there is no injection $f:S\to\mathbb{Z}$. A well-known example of an uncountable set is the set of real numbers $\mathbb{R}$.

(Someone should give the proof that $\mathbb{R}$ is uncountable.)

See Also