TheoremBase

Countable Sets: a Bijection from ℕ onto ℕ×ℕ, Finite Sets, Subsets, Surjective Images, Images, Products, and the Integers and Rationals

The natural numbers, finite sets, subsets and images of countable sets, products of two countable sets, the integers, the rationals and pairs of rationals are countable, and there is a bijection from the natural numbers onto the pairs of natural numbers.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let N\mathbb{N} be the set of natural numbers, let countable sets be as in Countable Set (i) and finite sets as in Finite Sets (i), let maps be as in Functions, Values of a Function, and Functions from One Class to Another (iii) and surjective maps and bijections as in Injective, Surjective and Bijective Functions between Classes, let ×\times denote the Cartesian product, which for two sets is a set by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii), let images of sets under maps be as in Sets and Maps: Ordinary Notation (vii), where they are sets, and let Z\mathbb{Z} and Q\mathbb{Q} be the sets of integers and of rational numbers, as in The Integers and the Rational Numbers, with the Natural Numbers and the Integers Identified with Subsets of the Rationals (ii) and The Integers and the Rational Numbers, with the Natural Numbers and the Integers Identified with Subsets of the Rationals (iii). Let XX and YY be sets.

N\mathbb{N} is countable.

There is a bijection τ:N→N×N\tau:\mathbb{N}\to\mathbb{N}\times\mathbb{N}; in particular, N×N\mathbb{N}\times\mathbb{N} is countable.

If XX is finite, then XX is countable.

If XX is countable and Y⊆XY\subseteq X, then YY is countable.

If XX is countable and there is a surjective map g:X→Yg:X\to Y, then YY is countable.

Let AA and BB be sets and g:A→Bg:A\to B a map. If X⊆AX\subseteq A and XX is countable, then the image g(X)g(X) is countable.

If XX and YY are countable, then X×YX\times Y is countable.

Z\mathbb{Z} is countable.

Q\mathbb{Q} is countable.

Q×Q\mathbb{Q}\times\mathbb{Q} is countable.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…