proof of Schroeder-Bernstein theorem using Tarski-Knaster theorem
The Tarski-Knaster theorem can be used to give a short, elegant proof of the Schroeder-Bernstein theorem.
Proof.
Suppose and are injective. Define a function by .
If , then , and so is monotone. Since is a complete lattice, we may apply the Tarski-Knaster theorem to conclude that the set of fixed points
of is a complete lattice and thus nonempty.
Let be a fixed point of . We have
Hence and are bijections. We can therefore construct the desired bijection by defining
The usual proof of Schroeder-Bernstein theorem explicitly constructs a fixed point of .
References
- 1 Thomas Forster, Logic, induction
and sets, Cambridge University Press, Cambridge, 2003.
- 2 M. Kolibiar, A. Legéň, T. Šalát, and Š. Znám, Algebra a príbuzné disciplíny, Alfa, Bratislava, 1992 (Slovak).