Schröder–Bernstein theorem
In set theory, the Schröder–Bernstein theorem states that, if there exist injective functions f : A → B and g : B → A between the sets A and B, then there exists a bijective function h : A → B.
Schröder–Bernstein theorem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Theorem in set theory In set theory , the Schröder–Bernstein theorem states that, if there exist injective functions f  : A → B and g  : B → A between the sets A and B , then there exists a bijective function h  : A → B . In terms of the cardinality of the two sets, this classically implies that if | A | ≤ | B | and | B | ≤ | A | , then | A | = | B | ; that is, A and B are equipotent . This is a useful feature in the ordering of
Explore this link on the map →saved by
related reading
- Zorn's lemma - Wikipediaen.wikipedia.org
- Set Theory | Internet Encyclopedia of Philosophyiep.utm.edu
- Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
- 4. Sets and Functions - Mathematics in Lean v4.19.0 documentationleanprover-community.github.io
- Two infinities that are surprisingly equal | Gowers's Webloggowers.wordpress.com
- Set theory - Wikipediaen.wikipedia.org
- Cantor's diagonal argument - Wikipediaen.wikipedia.org
- How Many Numbers Exist? Infinity Proof Moves Math Closer to an Answer. | Quanta Magazinequantamagazine.org
- Set Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- How Sridhar Thinkssridharramesh.github.io
- Set Theory > Basic Set Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Arithmetical hierarchy - Wikipediaen.wikipedia.org