Sujet : Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary)
De : noreply (at) *nospam* example.org (joes)
Groupes : sci.mathDate : 14. Dec 2024, 11:12:42
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <ca3b9b0fa83abb369a3eb916aaf3d59007024dc0@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Fri, 13 Dec 2024 20:19:24 +0100 schrieb WM:
On 13.12.2024 19:29, joes wrote:
Am Fri, 13 Dec 2024 18:20:59 +0100 schrieb WM:
On 13.12.2024 15:41, joes wrote:
> Am Fri, 13 Dec 2024 09:42:36 +0100 schrieb WM:
>
>> The subset is considered as its own independent set D = {10n | n
>> ∈ ℕ}
>> and then it is attached to the set ℕ = {1, 2, 3, ...}. That does
>> not change the subset.
> It changes the domain from D to N. What operation is „attachment”?
You can also say pairing. The elements of D are paired with the
elements 10n of ℕ. After this small detour everything proceeds as
usual.
Aha, and what is paired with the rest of N? This is not the identity.
I was under the impression the bijection step came later.
No, it came earlier and it was no bijecton.
I mean, you apply your function before the bijection, but then also
change the domain of the bijection to be N instead of D, which of
course doesn’t preserve it, as there is nothing to be paired with
the nondivisible numbers. NB this does NOT mean there aren’t „enough”
multiples of 10 (there’s one for every natural, obviously); they HAVE
already been paired on the other side. Non-multiples of 10 are only
members of ONE of the sets being bijected - N, not D. Do not confuse them.
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.