Schröder-Bernstein theorem
Let and be sets. If there are injections and , then there is a bijection .
The Schröder-Bernstein theorem is useful for proving many results about cardinality, since it replaces one hard problem (finding a bijection between and ) with two generally easier problems (finding two injections).
Title | Schröder-Bernstein theorem |
Canonical name | SchroderBernsteinTheorem |
Date of creation | 2013-03-22 12:21:46 |
Last modified on | 2013-03-22 12:21:46 |
Owner | yark (2760) |
Last modified by | yark (2760) |
Numerical id | 9 |
Author | yark (2760) |
Entry type | Theorem |
Classification | msc 03E10 |
Synonym | Schroeder-Bernstein theorem |
Synonym | Cantor-Schroeder-Bernstein theorem |
Synonym | Cantor-Schröder-Bernstein theorem |
Synonym | Cantor-Bernstein theorem |
Related topic | AnInjectionBetweenTwoFiniteSetsOfTheSameCardinalityIsBijective |
Related topic | ProofOfSchroederBernsteinTheoremUsingTarskiKnasterTheorem |