The Integer Lattice Admits an Enumeration by the Natural Numbers
lemmaSet Theorylem:integer-lattice-enumeration-2026aThe integer lattice of Euclidean space is countable and not finite, and therefore admits a bijection from the natural numbers onto it.
Let be the set of natural numbers, let be the set of integers, let (so that , by claim 4 of Properties of the Order on the Natural Numbers), and let be the initial segment determined by . Let be Euclidean space, whose points are read as maps on with real values, the component of at being written , and let be the integer lattice, the set of those with for every . The notions finite, countable and bijection are those of the indicated definitions.
1. (Countability)¶ The set is countable and is not finite.
2. (Enumeration)¶ There is a bijection from onto .
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.