Cantor–Bernstein–Schröder theorem
Statement
If và , meaning there is an injection and an injection , then there is a bijection between and .
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 by building two easy one-directional embeddings instead of one hard direct bijection — this is exactly how the examples below show intervals like and have the same cardinality.
Proof sketch
Let and be the two given injections. The idea is to trace, for each element, the chain of ancestors obtained by repeatedly undoing and , and to build the final bijection piece by piece depending on where each chain "starts".
For , define its backward chain , continuing as long as the needed inverse is defined, and symmetrically for . Every element's chain either goes back forever, or stops at an element of with no -preimage, or stops at an element of with no -preimage. This partitions into three parts (chain stops in ), (chain stops in ), (chain never stops), and likewise partitions into .
On chains that stop in or never stop, itself already gives a bijection from that part of onto the corresponding part of (since these elements were reached by injections and nothing "runs out" on the side first). On chains that stop in , it is that gives a bijection from the corresponding part of back onto that part of , so its inverse gives a bijection from that part of onto that part of .
Define by if , and if . Since the three pieces are disjoint and each piece maps bijectively onto its matching piece of ( onto , onto ), the combined map is a bijection from all of onto all of , proving .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Paul R. Halmos (1960). Naive Set Theory
- Karel Hrbacek, Thomas Jech (1999). Introduction to Set Theory