Does the standard proof that the power set of a set is strictly larger than the set rely on the axiom of choice?
-
Here's the proof: First, we note that there's a one-to-one function from SSS to 2S2S2^S given by xâ¦{x}xâ¦{x}x \mapsto \{x\}. Now we assume that there's a bijection ÏÏ\phi between SSS and 2S2S2^S. Then there is some xâSxâSx \in S such that Ï(x)={x:xâÏ(x)}Ï(x)={x:xâÏ(x)}\phi(x) = \{x : x \notin \phi(x)\}. By the same reasoning as in Russell's paradox, xâÏ(x)xâÏ(x)x \in \phi(x) if and only if xâÏ(x)xâÏ(x)x \notin \phi(x), so there can be no such bijection ÏÏ\phi. Since there's a one-to-one function from SSS to 2S2S2^S and no one-to-one function the other way, we conclude that |S|<â£â£2Sâ£â£|S|<|2S||S| I've heard at least a couple people claim that this argument relies on the axiom of choice, but I don't see it. Are they right?
-
Answer:
No, this proof does not require the Axiom of Choice (AC). But it's very difficult to work with cardinalities without AC. For example, it's very intuitive and very useful to say that for any two sets A and B, exactly one of the following holds: |A|=|B|,|A|<|B|,|A|>|B|.|A|=|B|,|A|<|B|,|A|>|B|.|A|=|B|, |A||B|. But this, the principle of trichotomy, is equivalent to AC! Many proofs implicitly use this (but the specific proof you gave above doesn't rely on this).
Joe Blitzstein at Quora Visit the source
Other answers
This can be shown using Cantor's Diagonalization trick, which doesn't require the axiom of choice to my understanding.
Jonathan Chung-Kuan Huang
No, it doesn't use AC. Sorbeswar is astute in noticing something subtle is going on, though. The set in question really should be defined as something like: A={y:yâS\andyâÏ(y)}A={y:yâS\andyâÏ(y)}A=\{y:y \in S \and y \notin \phi (y)\}. Without the restriction to SSS of the range of elements considered, we can't guarantee the resulting collection is a set. However, if we do restrict the elements considered to form the set to SSS, then the axiom schema of specification guarantees the result is a set. Note that even if every yâSyâSy \in S is an element of Ï(y)Ï(y)\phi (y), then AAA is the empty set, which is still an element of 2S2S2^S so that the argument still holds.
Chase Skipper
Saying there is a bijection requires axiom of choice. But the argument stays valid with an onto function. Bijection ensures x is unique, but that is not required for the argument you gave to work. Even though I would rewrite what you write as Ï(x)={y:yâÏ(y)}Ï(x)={y:yâÏ(y)} \phi(x) = \{ y : y \notin \phi(y) \} for several x.
Anita S Vasu
Related Q & A:
- How many regions are created by the set of all hyperplanes defined by a set of points?Best solution by Mathematics
- How to set up a simple subversion workflow?Best solution by Programmers
- How to set up a business email?Best solution by Yahoo! Answers
- How to arrange a set of number?Best solution by math.stackexchange.com
- Where is the power wire on a 94 Suburban?Best solution by commandocaralarms.com
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.