• Security incident: ISF was recently accessed by intruders. Please change your password, and change it anywhere else you used it. Read more

Cont: Deeper than primes - Continuation 2

Status
Not open for further replies.
Please pay attention to the fact that you can't formally\logically define the set of all members of P(S) that are not mapped with all S members, simply because any particular member of H (which is some member of P(S)) can be mapped with some member of S in another mapping from S to P(S), so the members of H can't be added to each other.

If I interpret this word salad correctly, Doron, you are trying to say the H = {{}} is the set of elements in P(S) not mapped by any mapping S -> P(S).

Is that right?

It is false, of course, but first we need to understand exactly what you were trying to say.
 
Also I think that we show that formally\logically there are cases where one can't define a set, which is the union of infinitely many disjoint sets.

Think what you like, but how is the relevant to the discussion so far?
 
I've already sketched the obvious proof that P(N) has at least countably many elements not in the image of any function f:N -> P(N).
In that case please (by using the standard prof of Cantor's theorem) explicitly demonstrate a set that has more than one element not in the image of any function f:N -> P(N) (where N is an infinite set).

Moreover, please explicitly provide two distinct members of the set that is the result of one iteration of function f:N -> P(N).

If you can't do that, than your sketches are no more than intuitive-only obvious, and such result is insufficient in order to establish "real mathematics".
 
Last edited:
If I interpret this word salad correctly, Doron, you are trying to say the H = {{}} is the set of elements in P(S) not mapped by any mapping S -> P(S).

Is that right?
No, it is wrong.

If you read the rest of http://www.internationalskeptics.com/forums/showpost.php?p=10951167&postcount=798 you probably find the answer to your question which is:

|S|=|S|+1 holds for all mappings from S to P(S), by the standard proof of Cantor's theorem (and so is the case about Cantor's diagonal set).
 
|S|=|S|+1 holds for all mappings from S to P(S), by the standard proof of Cantor's theorem (and so is the case about Cantor's diagonal set).

No, it doesn't. On the one hand, the standard proof makes not reference whatsoever to numerical cardinality; on the other, the statement itself is false.
 
No, it doesn't. On the one hand, the standard proof makes not reference whatsoever to numerical cardinality; on the other, the statement itself is false.
The statement itself is true, and the standard proof makes reference to numerical cardinality (which is very important in case of infinite sets), simply because without it, it is impossible to conclude that one set is smaller or larger than the other set (specially in the case of infinite sets).
 
Last edited:
Proof by intuition? Is this a variant of your proof by direct observation, more commonly known as proof by assumption?
Cantor's theorem tells us |S| < |P(S)| directly.
Some concrete example of intuitive only reasoning, which does not understand that in order to be considered as a theorem, a given statement must be supported by some proof.

In case of axioms or obvious agreed abstract or non-abstract things, proofs are not needed, but this is not the case about Cantor's theorem.
 
Last edited:
So set S that has a certain number of elements (shown as |S|) has that same amount of elements as that same set but plus one more. (|S| =|S| +1)

Please provide proof. What you are saying is equivalent to 2=2+1.
Please take your time to learn about the transfinite number system, where |S|=|S|+1 holds.
 
jsfisher said:
Revisit your identity mapping for S = {a, b, c, ...}. The mapping is f(x) : x -> {x}. You correctly observed that {} is outside the range of this mapping. So is {a,b}, and so is {a,c}, and so is....

Exactly one is nowhere to be found.

In http://www.internationalskeptics.com/forums/showpost.php?p=10950983&postcount=794 I wrote:
doronshadmi said:
S is an infinite set.

H is a set that its members are not mapped with all |S| members of set S, and is has exactly one member for any mapping between S and P(S).

Here is an example, without loss of generality:

If S={a,b,c,...} then the distinct result of the distinct mapping

a --> {a}
b --> {b}
c --> {c}
...

is {}.

In that case H={{}}, where a member of P(S) like {a,b} is not a member of H because a --> {a} or b --> {b}, so what you wrote above is irrelevant to my "weaker" argument.
It has to be clarify that {} as a single member of H, is the result of a group of infinitely many possible mappings from S to P(S), where in the case of jsfisher's example, {} is some possible single member of H, by (for example) the three following mappings of such group, without a loss of generality (about {} or any other P(S) member, as a possible single member of set H):

If S={a,b,c,...} then the distinct result of the distinct mappings

a --> {a}
b --> {b}
c --> {c}
...

or

a --> {a,b}
b --> {b}
c --> {c}
...

or

a --> {a,c}
b --> {b}
c --> {c}
...

and so on ... ad infinitum

is {}.

So we are not talking about a single particular mapping, but about a group of mappings that their result is some single and distinct member of P(S), as a member of H.

Since any possible member of P(S) can be a member of H, one can't formally\logically define the set of all members of P(S) that are not mapped with all S members, simply because any particular member of H (which is some member of P(S)) can be mapped with some member of S in another group of mappings from S to P(S) that does not determine it as a member of set H.

In order to understand it better, there is a group of infinitely many arrangements of the members of the diagonal set w.r.t to the members of N={1,2,3,...), which provide a single diagonal member that is not mapped with any member of N.

But this provided single diagonal member can't be a member of the set of all diagonal members that are not mapped with any member of N, simply because this single diagonal member can be mapped with some member of N, in another group of infinitely many arrangements of the members of the diagonal set w.r.t to the members of N={1,2,3,...}.

----------------

So each single member of set H is the result of a group of infinitely many things, where each group provides another single H member, such that these single members can't be gathered into a one set, which has more than a single member.

What is written in http://www.internationalskeptics.com/forums/showpost.php?p=10950983&postcount=794 has to be taken in terms group for any single member of set H, so my example there (a --> {a} or b --> {b}) is insufficient, and has to be replace in terms of groups, as explained here.
 
Last edited:
So set S that has a certain number of elements (shown as |S|) has that same amount of elements as that same set but plus one more. (|S| =|S| +1)

Please provide proof. What you are saying is equivalent to 2=2+1.

It is a straightforward theorem that, if S is infinite, then |S| = |S| + 1, where + is cardinal addition.
 
EDIT:

I wish to stress that there may be non-standard proofs of Cantor's theorem (for example: http://www.tcs.tifr.res.in/~raja/publications/online/yapct08.pdf), where |S|=|S|+|H| (where |H| can't be but 1) does not hold for any group (as groups have been determined in http://www.internationalskeptics.com/forums/showpost.php?p=10952991&postcount=813, in case of what is known as the standard proof, or by Cantor's diagonal argument (https://en.wikipedia.org/wiki/Cantor's_diagonal_argument)).

In this post I wish to deal with Cantor's diagonal argument, and formally\logically demonstrate that for any matrix of |S|*|S| group of arrangements of P(S) elements, there is exactly one arrangement that is not in that matrix,so in this case the best that we get for any matrix is |S|=|S|*|S|+|H|.

Also it has to be stressed that these arrangements can't be gathered into a one set of arrangements that are not in all groups of matrices of |S|*|S| arrangements, simply because any given arrangement that is not in some matrix of |S|*|S| group of arrangements of P(S) elements, is for sure some arrangement of another matrix of |S|*|S| group of arrangements of P(S) elements, exactly as holds in the case of all possible set H members, that can't be gathered into a one set (as shown in http://www.internationalskeptics.com/forums/showpost.php?p=10952991&postcount=813).

Code:
 *-- a -- [{a}  ,{a,b} ,{a,c}, ...]   The vertical elements of the matrix,     
 |                                    are the members of the group of sets,    
     b -- [{b}  ,{b}   ,{b}  , ...]   which provides {} as the member of P(S)  
|S|                                   that is not in the range of any of       
     c -- [{c}  ,{c}   ,{c}  , ...]   these sets.                              
 |                                                                             
 *-- ...                                                                       
                                                                               
                                                                               
                                                                               
 The matrix of these P(S) elemnts is |S|*|S|, called {}_matrix                 
                                                                               
          *--------- |S| ---------*                                            
          |                       |                                            
                                                                               
 *-- a -- [{a}  ,{b}   ,{c}  , ...]                                            
 |                                                                             
     b -- [{a,b},{b}   ,{c}  , ...]                                            
|S|                                                                            
     c -- [{a,c},{b}   ,{c}  , ...]                                            
 |                                                                             
 *-- ...

There is a diagonal element along the {}_matrix that is not one of any of the horizontal |S| elements of this matrix, so in this case
H={[{b},{c},{a},...] } where |H|=1 and the member of H is a ur-element.
Code:
          *--------- |S| ---------* 
          |                       | 
                                    
 *-- a -- [[COLOR="Blue"][B]{b}[/B][/COLOR]  ,{b}   ,{c}  , ...] 
 |                                  
     b -- [{a,b},[COLOR="Blue"][B]{c}[/B][/COLOR]   ,{c}  , ...] 
|S|                                 
     c -- [{a,c},{b}   ,[COLOR="Blue"][B]{a}[/B][/COLOR]  , ...] 
 |                                  
 *-- ...

This ur-element is some horizontal element of a matrix that is not {}_matrix, and therefore one can't determine the set of all ur-elements, that its elements are not ur-elements of all matrices, or in other words, |S|=|S|*|S|+|1| holds for all matrices.
 
Last edited:
It has to be stressed that if all the possible elements of H are gathered into a one set, the cardinality of this set is at least |P(S)| (in case that S is an infinite set) but such cardinality can't be shown in the context Cantor's standard proof for what is known as Cantor's theorem (as shown in http://www.internationalskeptics.com/forums/showpost.php?p=10952991&postcount=813 and more generally explained in http://www.internationalskeptics.com/forums/showpost.php?p=10954882&postcount=815).
 
Last edited:
Edit:

In addition to http://www.internationalskeptics.com/forums/showpost.php?p=10954882&postcount=815, since |S|=|S|*|S|+|1| holds for all matrices, P(S) (where S is an infinite set) is not formally\logically established in any stage of what is known as Cantor's standard proof of (what is called) Cantor's theorem.

So by this point of view, jsfisher is right, P(S) is not a part of what is known as Cantor's standard proof of (what is called) Cantor's theorem.

Moreover, since |S|=|S|*|S|+|1| holds for all matrices, if one forces |S|<|P(S)| as a result of what is known as Cantor's standard proof of (what is called) Cantor's theorem, one has no choice but to determine the inequality |S|<|S|*|S|+|1| as a result of this forcing, and in this case the reasoning of transfinite numbers system is based on two numeric expressions (|S|<|S|*|S|+|1| ; |S|=|S|*|S|+|1|) that do not "agree" with each other.
 
Last edited:
Status
Not open for further replies.

ISF - Join now!

Every member here is approved by hand. No bots, no spam, just people who care about evidence and honest debate.

Membership is free!

Create your free account

Back
Top Bottom