Originally Posted by jsfisher
Using Cantor's theorem exactly once proves you wrong.
The basic mathematical fact remains, |S| < |P(S)| for any set S.
Wrong, it simply the basic fact of being closed under X^2 (under the matrix) and compare it only once to 2^X.
Can't you understand a simple thing? Before there was a power set, there was a question whether you can put two subsets of naturals on 1:1 correspondence with the counting numbers. Suppose you have two subsets even and odds:
{{2, 4, 6, 8, ...},{1, 3, 5, 7, ...}}
If you start with the evens
2, 4, 6, 8, ...
1, 2, 3, 4, ...
you never get the chance to hit the odds, coz the evens progress without a bound, so do the odds in case you would like to try your luck the other way. Since the power set of naturals include the naturals as its subset, you never get the chance to count other members of the subsets of the naturals, like prime numbers, Fibonacci numbers, Lucas numbers, triangular numbers, even numbers and so on. If you start with prime numbers, the story is the same, coz primes run without a bound as well. That's why |P(
N)|>|
N|. But that's not the proof by itself -- you need to arrive at a logical contradiction.
LOL. I'm just kidding.
LOL. What if i'm not kidding?
P(N) = {{1}, {2}, {3}, {4}, ... {1,2}, {1,3}, {1,4}, ...}
________1___2____3___4 ...