Math 2.0

statement proposition

The integers are countable

Statement

The set Z\mathbb{Z} of integers is countably infinite. The function f ⁣:N→Zf \colon \mathbb{N} \to \mathbb{Z} with f(2k)=kf(2k) = k and f(2k+1)=−(k+1)f(2k + 1) = -(k + 1) is a bijection.

Remarks

The bijection lists the integers as 0,−1,1,−2,2,…0, -1, 1, -2, 2, \dots. So ∣Z∣=∣N∣=ℵ0|\mathbb{Z}| = |\mathbb{N}| = \aleph_0, although N\mathbb{N} is a proper subset of Z\mathbb{Z}.

Explanations

L1 human

The list 0,1,2,…0, 1, 2, \dots never reaches the negative integers. Alternate between the two signs, and every integer gets a position in the list.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Countable_set, Introduction