Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Cantor–Bernstein theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|There are equally many countable order types and real numbers}} {{For|the theorem that injections from A to B and from B to A imply a bijection between A and B|Schröder–Bernstein theorem}} In [[set theory]] and [[order theory]], the '''Cantor–Bernstein theorem''' states that the [[cardinality]] of the second type class, the class of [[Countable set|countable]] [[order type]]s, equals the [[cardinality of the continuum]]. It was used by [[Felix Hausdorff]] and named by him after [[Georg Cantor]] and [[Felix Bernstein (mathematician)|Felix Bernstein]]. Cantor constructed a family of countable order types with the cardinality of the continuum, and in his 1901 inaugural dissertation Bernstein proved that such a family can have no higher cardinality.<ref name="plotkin">{{cite book|title=Hausdorff on Ordered Sets|volume=25|series=History of Mathematics|editor-first=J. M.|editor-last=Plotkin|publisher=American Mathematical Society|isbn=9780821890516|year=2005|page=3|url=https://books.google.com/books?id=M_skkA3r-QAC&pg=PA3}}.</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)