Definition:Countable Set/Definition 3

From ProofWiki
Jump to navigation Jump to search


Let $S$ be a set.

$S$ is countable if and only if there exists a bijection between $S$ and a subset of $\N$.

That is, if it can be shown that it is possible to exhaustively count its elements.

Also defined as

Some sources define countable to be what is defined on $\mathsf{Pr} \infty \mathsf{fWiki}$ as countably infinite.

That is, they use countable to describe a collection which has exactly the same cardinality as $\N$.

Thus under this criterion $X$ is said to be countable if and only if there exists a bijection from $X$ to $\N$, that is, if and only if $X$ is equivalent to $\N$.

However, as the very concept of the term countable implies that a collection can be counted, which, plainly, a finite can be, it is suggested that this interpretation may be counter-intuitive.

Hence, on $\mathsf{Pr} \infty \mathsf{fWiki}$, the term countable will be taken in the sense as to include the concept of finite, and countably infinite will mean a countable collection which is specifically not finite.

Also known as

When the terms denumerable and enumerable are encountered, they generally mean the same as countably infinite.

Sometimes the term enumerably infinite can be seen.

Some modern pedagogues (for example Vi Hart and James Grime) use the term listable, but this has yet to catch on.

Also see