Math 2.0

statement theorem

Schröder–Bernstein theorem

Statement

Let AA and BB be sets. If there are injective functions f ⁣:A→Bf \colon A \to B and g ⁣:B→Ag \colon B \to A, then there is a bijective function h ⁣:A→Bh \colon A \to B.

Remarks

In terms of cardinals: ∣A∣≤∣B∣|A| \le |B| and ∣B∣≤∣A∣|B| \le |A| imply ∣A∣=∣B∣|A| = |B|. So the order of cardinals is antisymmetric. The proof does not use the axiom of choice. Example: [0,1][0, 1] and [0,1)[0, 1) are equinumerous, because each one injects into the other.

History

Cantor stated the theorem in 1887 without a proof. Dedekind proved it in 1887, but he did not publish the proof. Bernstein and Schröder published proofs in 1898, and the proof of Schröder had a flaw.

Explanations

L1 human

If AA fits into BB and BB fits into AA, then AA and BB have the same size. For finite sets this is obvious, but for infinite sets it needs a clever construction of hh.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (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/Schröder–Bernstein_theorem, lead section