Proofs of the Cantor-Bernstein Theorem
View/
The file is restricted.
Please click here to access if the item description shows YU only.
Date
2016-06Metadata
Show full item recordDescription
The file is restricted for YU community access only.
Abstract
In this work I will examine and compare different proofs of the Cantor-Bernstein theorem.
Additionally, I will give a new and somewhat different proof. The Cantor-Bernstein Theorem
states that if there is an injective function, f, from a set A to a set B, and an injective function,
g, from the set B to the set A, then there exists a bijection, h, between A and B. This means
that the two sets have the same cardinality, that is, they have the same size.
Permanent Link(s)
https://hdl.handle.net/20.500.12202/4252https://ezproxy.yu.edu/login?url=https://repository.yu.edu/handle/20.500.12202/4252
Collections
Item Preview
The file is restricted. Please click here to access if the item description shows YU only.
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States