Math 2.0

statement theorem

The rationals are countable

Statement

The set Q\mathbb{Q} of rational numbers is countably infinite.

Remarks

Proof: each rational number has a unique form p/qp/q with p∈Zp \in \mathbb{Z}, q≥1q \ge 1 and gcd⁡(p,q)=1\gcd(p, q) = 1. The map p/q↦(p,q)p/q \mapsto (p, q) is an injection into Z×N\mathbb{Z} \times \mathbb{N}, which is countable. And Q\mathbb{Q} is infinite. The rationals are dense in R\mathbb{R}, but they are countable, and R\mathbb{R} is not countable.

Explanations

L1 human

Write the fractions p/qp/q in a grid, with pp along one side and qq along the other. List the grid diagonal by diagonal, and skip each fraction that is not in lowest terms. Each rational number appears exactly one time.

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.

Sources

  1. Web https://en.wikipedia.org/wiki/Rational_number, Countability