So according to jsfisher if S = {A,B} then P(S) = {{},{A,B}}.
No, it's according to you.
Edited by jhunter1163:
Edited for civility.
But it is just jsfisher's box-reasoning.
No, it's your misrepresentation.
The right reasoning is this:
S = {A,B}
P(S) = {{},{A},{B},{A.B}}
Cantor's constriction method of all the above P(S) members, works like this (without using any rounds, because it is constructed at once in parallel):
|
|
|-----------------------
|a ↔ {a} |
|b ↔ {b} | Provides {}
|-----------------------
|
|
|-----------------------
|a ↔ { } |
|b ↔ {b} | Provides {a}
|-----------------------
|
|
|-----------------------
|a ↔ {a} |
|b ↔ { } | Provides {b}
|-----------------------
|
|
|-----------------------
|a ↔ { } |
|b ↔ {a} | Provides {a,b}
|-----------------------
Then it is possible to define the following bijection, which is based on the fact that no P(S) member is missing:
{} ↔ a
{a} ↔ b
{b} ↔ c
{a,b} ↔ d

That would be a bijection, yes, but not between S and P(S). Notice that c and d are not members of S.
Edited by jhunter1163:
Edited for civility.
In other words, jsfisher's reasoning simply does not get the considered fine subject.
Edited by jhunter1163:
Edited for civility.
Last edited by a moderator: