jsfisher said:
For finite sets, the existence of an injective mapping that isn't bijective is sufficient to show that no bijective mapping exists.
jsfisher said:
... the existence of an injective mapping that is not bijective is not sufficient to show no bijective mapping exists for infinite sets.
So you distinguish between the sufficiency of mappings in case of finite or infinite sets.
I agree with you, because one of the reasons of this distinction is that if, for example, S is a finite set, then |S| ≠ |S|+1, where in case that S is an infinite set |S| = |S|+1.
-----------------------
Now I wish to write something about Cantor's Theorem, as follows:
If S is a finite set, for example, S={a,b,c}, it is clear that "
the existence of an injective mapping that isn't bijective is sufficient to show that no bijective mapping exists" between S and its power set {{},{a},(b},{c},{a,b},{a,c},{b,c},{a,b,c}}.
For example, by the particular case
a --> {a}
b --> {b}
c --> {c}
we get (by the proof of Cantor's statement) {} that is not mapped with any member of S, and by this particular case we can use |{a,b,c}| < |{{},{a},(b},{c}}| in order to conclude that |{a,b,c}| < |{{},{a},(b},{c},{a,b},{a,c},{b,c},{a,b,c}}|.
My argument is that this one particular case "
is sufficient to show that no bijective mapping exists", because in case that S is finite, |S| ≠ |S|+1 .
If S is an infinite set, for example, S={a,b,c,...}, then by
a --> {a}
b --> {b}
c --> {c}
...
we also get (by the proof of Cantor's statement) {} that is not mapped with any member of S, but unlike in the case of finite sets, "
the existence of one injective mapping that is not bijective, is not sufficient to show no bijective mapping exists for infinite sets", because in case that S is infinite, |S| = |S|+1 .
Please carefully pay attention to the following argument about the proof of Cantor's statement:
For |P(S)| mappings between S and P(S) (where S is infinite) any given mapping is between all |S| members of S and |S| members of P(S), which defines exactly one member of P(S) that is not mapped with any one of all S members.
So for |P(S)| mappings between S and P(S) it is true that Cantor's proof is only about |S| and |S|+1 members for each mapping, but since S is infinite |S| = |S|+1, so no |P(S)| mappings (where each one of them is only about |S| = |S|+1) are "
sufficient to show that" |S| < |P(S)|, in case that S is an infinite set.