statement theorem
Every infinite set has a countably infinite subset
Statement
Assume the axiom of choice. Let be an infinite set. Then there is an injective function , so has a countably infinite subset .
Remarks
The proof chooses , then , and so on. Each set is nonempty because 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 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 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
- Web https://en.wikipedia.org/wiki/Infinite_set, Properties
What links here
No node links to this node yet.