Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Talk:Power set

Revision as of 01:25, 27 August 2006 by ComplexZeta (talk | contribs)

I deleted the part that said that for no infinite set was there a bijection between the set and its power set. I am fairly certain that this is undecided. It certainly is known that the proposition $\displaystyle 2^{\aleph _{n} } = \aleph _{ n+1 }$ is undecidable, so I am very suspicious of a proposition that such a cardinality as $\displaystyle \aleph _{n>1}$ exists at all. Or are these cardinalities known to exist after all? If so, how are they defined? —Boy Soprano II 21:35, 26 August 2006 (EDT)

It is true (and decidable) that there is no bijection between a set and its power set. --ComplexZeta 21:45, 26 August 2006 (EDT)

Really? Where can I find a proof? Thanks. —Boy Soprano II 21:53, 26 August 2006 (EDT)

See the bottom of http://en.wikipedia.org/wiki/Cantor%27s_diagonal_argument --ComplexZeta 01:25, 27 August 2006 (EDT)

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Talk:Power_set&oldid=9907"