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
Zermelo set theory
(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!
== Cantor's theorem == Zermelo's paper may be the first to mention the name "[[Cantor's theorem]]". Cantor's theorem: "If ''M'' is an arbitrary set, then always ''M'' < P(''M'') [the power set of ''M'']. Every set is of lower cardinality than the set of its subsets". Zermelo proves this by considering a function Ο: ''M'' β P(''M''). By Axiom III this defines the following set ''M' '': :''M' '' = {''m'': ''m'' β Ο(''m'')}. But no element ''m' '' of ''M '' could correspond to ''M' '', i.e. such that Ο(''m' '') = ''M' ''. Otherwise we can construct a contradiction: # If ''m' '' is in ''M' '' then by definition ''m' '' β Ο(''m' '') = ''M' '', which is the first part of the contradiction # If ''m' '' is not in ''M' '' but in ''M '' then by definition ''m' '' β ''M' '' = Ο(''m' '') which by definition implies that ''m' '' is in ''M' '', which is the second part of the contradiction. so by contradiction ''m' '' does not exist. Note the close resemblance of this proof to the way Zermelo disposes of Russell's paradox.
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)