TheoremBase

The Integer Lattice Admits an Enumeration by the Natural Numbers

The integer lattice of Euclidean space is countable and not finite, and therefore admits a bijection from the natural numbers onto it.

Statement

Let N\mathbb{N} be the set of natural numbers, let Z\mathbb{Z} be the set of integers, let n∈Nn\in\mathbb{N} (so that 1≤n1\le n, by claim 4 of Properties of the Order on the Natural Numbers), and let [n][n] be the initial segment determined by nn. Let Rn\mathbb{R}^{n} be Euclidean space, whose points are read as maps on [n][n] with real values, the component of m∈Rnm\in\mathbb{R}^{n} at i∈[n]i\in[n] being written mim_{i}, and let Zn\mathbb{Z}^{n} be the integer lattice, the set of those m∈Rnm\in\mathbb{R}^{n} with mi∈Zm_{i}\in\mathbb{Z} for every i∈[n]i\in[n]. The notions finite, countable and bijection are those of the indicated definitions.

1. (Countability) The set Zn\mathbb{Z}^{n} is countable and is not finite.

2. (Enumeration) There is a bijection from N\mathbb{N} onto Zn\mathbb{Z}^{n}.

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…