<?xml version="1.0" encoding="UTF-8"?>

<record version="6" id="2091">
 <title>Schr\"oder-Bernstein theorem</title>
 <name>SchroederBernsteinTheorem</name>
 <created>2002-02-18 01:25:51</created>
 <modified>2006-12-22 07:13:20</modified>
 <type>Theorem</type>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <author id="22" name="vampyr"/>
 <classification>
	<category scheme="msc" code="03E10"/>
 </classification>
 <synonyms>
	<synonym concept="Schr\&quot;oder-Bernstein theorem" alias="Schroeder-Bernstein theorem"/>
	<synonym concept="Schr\&quot;oder-Bernstein theorem" alias="Cantor-Schroeder-Bernstein theorem"/>
	<synonym concept="Schr\&quot;oder-Bernstein theorem" alias="Cantor-Schr\&quot;oder-Bernstein theorem"/>
	<synonym concept="Schr\&quot;oder-Bernstein theorem" alias="Cantor-Bernstein theorem"/>
 </synonyms>
 <related>
	<object name="AnInjectionBetweenTwoFiniteSetsOfTheSameCardinalityIsBijective"/>
	<object name="ProofOfSchroederBernsteinTheoremUsingTarskiKnasterTheorem"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}</preamble>
 <content>\PMlinkescapeword{theorem}
\PMlinkescapeword{between}

Let $S$ and $T$ be sets.
If there are injections $S \to T$ and $T \to S$,
then there is a bijection $S\to T$.

The Schr\"oder-Bernstein theorem is useful
for proving many results about cardinality,
since it replaces one hard problem (finding a bijection between $S$ and $T$)
with two generally easier problems (finding two injections).</content>
</record>
