Art of Problem Solving

Uncountable: Difference between revisions

No edit summary
Bubka (talk | contribs)
No edit summary
Line 3: Line 3:
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.)
=== Proof that <math>\mathbb{R}</math> is uncountable ===


==See Also==
==See Also==

Revision as of 05:22, 5 November 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}$.

Proof that $\mathbb{R}$ is uncountable

See Also