MathLabs
TheoremProved

Cantor–Bernstein–Schröder theorem

Statement

If ∣A∣≤∣B∣|A|\le|B| và ∣B∣≤∣A∣  ⟹  ∣A∣=∣B∣|B|\le|A| \implies |A|=|B|, meaning there is an injection A→BA \to B and an injection B→AB \to A, then there is a bijection between AA and BB.

Why is it true?

Comparing cardinalities via injections only (each set fits inside the other) already forces the sets to have exactly the same size, just as with finite sets. This lets us prove ∣A∣=∣B∣|A|=|B| by building two easy one-directional embeddings instead of one hard direct bijection — this is exactly how the examples below show intervals like [0,1][0,1] and (0,1)(0,1) have the same cardinality.

Proof sketch

Let f:A→Bf : A \to B and g:B→Ag : B \to A be the two given injections. The idea is to trace, for each element, the chain of ancestors obtained by repeatedly undoing ff and gg, and to build the final bijection piece by piece depending on where each chain "starts".

For a∈Aa \in A, define its backward chain a,g−1(a),f−1(g−1(a)),…a, g^{-1}(a), f^{-1}(g^{-1}(a)), \ldots, continuing as long as the needed inverse is defined, and symmetrically for b∈Bb \in B. Every element's chain either goes back forever, or stops at an element of AA with no gg-preimage, or stops at an element of BB with no ff-preimage. This partitions AA into three parts AAA_A (chain stops in AA), ABA_B (chain stops in BB), A∞A_\infty (chain never stops), and likewise partitions BB into BA,BB,B∞B_A, B_B, B_\infty.

On chains that stop in AA or never stop, ff itself already gives a bijection from that part of AA onto the corresponding part of BB (since these elements were reached by injections and nothing "runs out" on the BB side first). On chains that stop in BB, it is gg that gives a bijection from the corresponding part of BB back onto that part of AA, so its inverse g−1g^{-1} gives a bijection from that part of AA onto that part of BB.

Define h:A→Bh : A \to B by h(a)=f(a)h(a) = f(a) if a∈AA∪A∞a \in A_A \cup A_\infty, and h(a)=g−1(a)h(a) = g^{-1}(a) if a∈ABa \in A_B. Since the three pieces are disjoint and each piece maps bijectively onto its matching piece of BB (ff onto BA∪B∞B_A \cup B_\infty, g−1g^{-1} onto BBB_B), the combined map hh is a bijection from all of AA onto all of BB, proving ∣A∣=∣B∣|A|=|B|.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Paul R. Halmos (1960). Naive Set Theory
  2. Karel Hrbacek, Thomas Jech (1999). Introduction to Set Theory