Math 2.0

statement theorem

Comparability of cardinals

Statement

Assume the axiom of choice. Let AA and BB be sets. Then there is an injective function from AA to BB or an injective function from BB to AA. So ∣A∣≤∣B∣|A| \le |B| or ∣B∣≤∣A∣|B| \le |A|.

Remarks

With the Schröder–Bernstein theorem, it follows that the order of cardinals is a total order. The statement is equivalent to the axiom of choice over ZF. One proof uses Zorn's lemma on the set of injective partial functions from AA to BB.

Explanations

L1 human

Any two sets can be compared in size: one of them fits into the other. Without the axiom of choice, two sets can exist such that neither fits into the other.

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/Cardinal_number, Cardinal comparison