Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes Newsgroups: sci.math Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary) Date: Sat, 14 Dec 2024 10:26:16 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: References: <8a53c5d4-4afd-4f25-b1da-30d57e7fe91c@att.net> <10ebeeea-6712-4544-870b-92803ee1e398@att.net> <1f1a4089-dfeb-45f8-9c48-a36f6a4688fb@att.net> <84818a4f5d3795b746b017ad0861a3d818c5b053@i2pn2.org> <5805ad50ebff3400d1370d8c99790cbc727a340a@i2pn2.org> <1ac93432f1ba567e0f15308b8964bee86b92c706@i2pn2.org> <4e7901e16785581d0d02a2d6474d7d2615c5fac9@i2pn2.org> <8faa2f28f026986f1b6f78fc0397ad137640dce5@i2pn2.org> <80e52b661cd6caf51ba386c1d5148a11a4046a48@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Sat, 14 Dec 2024 10:26:16 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2789670"; mail-complaints-to="usenet@i2pn2.org"; posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM"; User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2) X-Spam-Checker-Version: SpamAssassin 4.0.0 Bytes: 3660 Lines: 36 Am Fri, 13 Dec 2024 11:55:16 +0100 schrieb WM: > On 13.12.2024 03:23, Richard Damon wrote: >> On 12/12/24 9:25 AM, WM wrote: >>> if Cantor can apply all natural numbers as indices for his bijections, >>> then all must leave the sequence of endsegments. Then the sequence >>> (E(k)) must end up empty. >>> And there must be a continuous staircase from E(k) to the empty set. >> But a segment that is infinite in length is, by definiton, missing at >> least on end. > That means that the premise "if Cantor can apply all natural numbers as > indices for his bijections" is false. Nah. Just imagine all of the inf.many steps as a whole - y’know, ACTUAL infinity. >> So, which bijection from Cantor are you talking about? Of are you >> working on a straw man that Cantor never talked about? > > There are many. The mapping from natumbers to the rationals, for > instance, needs all natural numbers. That means all must leave the > endsegments. Another example is Cantor's list "proving" uncountable > sets. If not every natural number has left the endsegment and is applied > as an index of a line of the list, the list is useless. Then the list were finite. It isn’t, though. > But if every natural number has left the endsegments, then the > intersection of all endsegments is empty. Yes. > Then the infinite sequence of > endegments has a last term (and many finite predecessors, because of ∀k > ∈ ℕ : ∩{E(1), E(2), ..., E(k+1)} = ∩{E(1), E(2), ..., E(k)} \ {k}). No. It is literally „without an end”, and yet can be „completed”, if only you were able to conceive of infinity. -- 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.