Math 2.0

statement theorem

Every infinite set has a countably infinite subset

Statement

Assume the axiom of choice. Let AA be an infinite set. Then there is an injective function f ⁣:N→Af \colon \mathbb{N} \to A, so AA has a countably infinite subset f(N)f(\mathbb{N}).

Remarks

The proof chooses a0∈Aa_0 \in A, then a1∈A∖{a0}a_1 \in A \setminus \{a_0\}, and so on. Each set A∖{a0,…,an}A \setminus \{a_0, \dots, a_n\} is nonempty because AA is infinite. The axiom of countable choice is enough, but some choice is needed: in ZF alone, the statement cannot be proved. It follows that ℵ0\aleph_0 is the least infinite cardinal.

Explanations

L1 human

In an infinite set you can always pick one more element. Picking forever gives a sequence of different elements, which is a copy of N\mathbb{N} inside the set.

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/Infinite_set, Properties