Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

"Why should we subsidize intellectual curiosity?" -- Ronald Reagan


tech / sci.math / Re: Three proofs of dark numbers

SubjectAuthor
* Three proofs of dark numbersWM
+- Re: Three proofs of dark numbersFromTheRafters
+* Re: Three proofs of dark numbersBen Bacarisse
|`* Re: Three proofs of dark numbersWM
| `* Re: Three proofs of dark numbersBen Bacarisse
|  +* Re: Three proofs of dark numbersWM
|  |+* Re: Three proofs of dark numbersBen Bacarisse
|  ||`* Re: Three proofs of dark numbersWM
|  || +- Re: Three proofs of dark numbersSergio
|  || `* Re: Three proofs of dark numbersBen Bacarisse
|  ||  `* Re: Three proofs of dark numbersWM
|  ||   +* Re: Three proofs of dark numbersBen Bacarisse
|  ||   |+* Re: Three proofs of dark numbersWM
|  ||   ||+* Re: Three proofs of dark numbersSergio
|  ||   |||`- Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||`* Re: Three proofs of dark numbersBen Bacarisse
|  ||   || `* Re: Three proofs of dark numbersWM
|  ||   ||  +- Re: Three proofs of dark numbersSergio
|  ||   ||  `* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   +* Re: Three proofs of dark numbersWM
|  ||   ||   |+* Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   ||`* Re: Three proofs of dark numbersWM
|  ||   ||   || +* Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   || |`* Re: Three proofs of dark numbersWM
|  ||   ||   || | `* Re: Three proofs of dark numbersSergio
|  ||   ||   || |  `* Re: Three proofs of dark numbersFromTheRafters
|  ||   ||   || |   `* Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   || |    `* Re: Three proofs of dark numbersSergi o
|  ||   ||   || |     `* Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   || |      `* Re: Three proofs of dark numbersSergi o
|  ||   ||   || |       `- Re: Three proofs of dark numbersFromTheRafters
|  ||   ||   || `- Re: Three proofs of dark numbersSergio
|  ||   ||   |+- Re: Three proofs of dark numbersSergio
|  ||   ||   |`* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   | `* Re: Three proofs of dark numbersWM
|  ||   ||   |  `* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   +* Re: Three proofs of dark numbersTom Bola
|  ||   ||   |   |`* Re: Three proofs of dark numbersWM
|  ||   ||   |   | `- Re: Three proofs of dark numbersTom Bola
|  ||   ||   |   +* Re: Three proofs of dark numbersJVR
|  ||   ||   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   ||`* Re: Three proofs of dark numbersJVR
|  ||   ||   |   || `* Re: Three proofs of dark numbersWM
|  ||   ||   |   ||  +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   ||  `- Re: Three proofs of dark numbersJVR
|  ||   ||   |   |`* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   | +- Re: Three proofs of dark numbersJVR
|  ||   ||   |   | `* Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |  +* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   |  |+* Re: Three proofs of dark numbersJVR
|  ||   ||   |   |  ||`- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |  |+* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |  ||+- Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |  ||`- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |  |`- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |  `* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   +* Re: Three proofs of dark numbersFromTheRafters
|  ||   ||   |   |   |`* Re: Three proofs of dark numbersPython
|  ||   ||   |   |   | `* Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   |  `- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   +* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   |   |`* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   | +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   | +* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   |   | |`* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   | | +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   | | `* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   |   | |  `- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   | `* Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   |   |   |  `* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |   `* Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   |   |   |    `* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |     `* Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   |   |   |      `* Re: Three proofs of dark numbersSergi o
|  ||   ||   |   |   |       `* Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   |   |   |        `* Re: Three proofs of dark numbersSergi o
|  ||   ||   |   |   |         `- Re: Three proofs of dark numbersChris M. Thomasson
|  ||   ||   |   |   +* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||+* Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   |||`* Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||| +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   ||| `* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   |||  `- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||+* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   |||+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||+- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   ||||`* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   |||| `* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  +- Re: Three proofs of dark numbersFromTheRafters
|  ||   ||   |   |   ||||  +* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   ||||  |`* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  | +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   ||||  | `* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   ||||  |  +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  |`* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | |`* Re: Three proofs of dark numbersJim Burns
|  ||   ||   |   |   ||||  |  | | +* Re: Three proofs of dark numbersBen Bacarisse
|  ||   ||   |   |   ||||  |  | | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  | | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | | +- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | | `- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  |  | +- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  | `- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   ||||  |  +- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||||  |  `* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   ||||  `- Re: Three proofs of dark numbersSergio
|  ||   ||   |   |   |||`- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   ||`- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   |+- Re: Three proofs of dark numberszelos...@gmail.com
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersJVR
|  ||   ||   |   |   |+- Re: Three proofs of dark numberszelos...@gmail.com
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersFritz Feldhase
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   |+- Re: Three proofs of dark numberszelos...@gmail.com
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numberszelos...@gmail.com
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersGus Gassmann
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |+- Re: Three proofs of dark numbersJVR
|  ||   ||   |   |   |+* Re: Three proofs of dark numbersWM
|  ||   ||   |   |   |`* Re: Three proofs of dark numbersJVR
|  ||   ||   |   |   `- Re: Three proofs of dark numberszelos...@gmail.com
|  ||   ||   |   `* Re: Three proofs of dark numbersWM
|  ||   ||   `- Re: Three proofs of dark numbersWM
|  ||   |`* Re: Three proofs of dark numbersWM
|  ||   `- Re: Three proofs of dark numbersEram semper recta
|  |`- Re: Three proofs of dark numbersSergio
|  `* Re: Three proofs of dark numbersRoss A. Finlayson
+- Re: Three proofs of dark numbersArchimedes Plutonium
+* Re: Three proofs of dark numbersFritz Feldhase
+* Re: Three proofs of dark numbersGus Gassmann
+- Re: Three proofs of dark numberszelos...@gmail.com
+- Re: Three proofs of dark numbersKristjan Robam
+* Re: Three proofs of dark numbersArchimedes Plutonium
+- Re: Three proofs of dark numbersArchimedes Plutonium
`- Re: Three proofs of dark numbersArchimedes Plutonium

Pages:12345678910111213141516171819202122232425262728293031323334353637383940
Re: Three proofs of dark numbers

<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115675&group=sci.math#115675

  copy link   Newsgroups: sci.math
X-Received: by 2002:a05:620a:4082:b0:6ee:b24f:47b3 with SMTP id f2-20020a05620a408200b006eeb24f47b3mr2513123qko.518.1665653521931;
Thu, 13 Oct 2022 02:32:01 -0700 (PDT)
X-Received: by 2002:a05:6808:b31:b0:354:9436:2e52 with SMTP id
t17-20020a0568080b3100b0035494362e52mr4126978oij.1.1665653521702; Thu, 13 Oct
2022 02:32:01 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Thu, 13 Oct 2022 02:32:01 -0700 (PDT)
In-Reply-To: <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
Injection-Info: google-groups.googlegroups.com; posting-host=2003:c7:8f32:40e2:5c00:cf58:cb4:2551;
posting-account=jn1PxAoAAAD-XIFhTFFaTyGmTiEGt0_b
NNTP-Posting-Host: 2003:c7:8f32:40e2:5c00:cf58:cb4:2551
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com> <a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: askaske...@gmail.com (WM)
Injection-Date: Thu, 13 Oct 2022 09:32:01 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 3419
 by: WM - Thu, 13 Oct 2022 09:32 UTC

Jim Burns schrieb am Donnerstag, 13. Oktober 2022 um 05:19:27 UTC+2:
> On 10/12/2022 5:11 PM, WM wrote:
>
> >>> The dark numbers have no discernible well-order.
> >>> ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo
> >>> The least discernible infinite segment
> >>> therefore is the complete set ℕ.
> >>
> >> The least infinite initial segment
> >> is an infinite initial segment, and
> >> is less than (⊆) each infinite initial segment.
> >
> > There is only one in ℕ.
> It's a curious thing how you manage to
> make all these claims at the same time.

What is curious? All FISONs are finite. The only infinite set is creted by including the dark numbers. But they cannot be subdivided. Therefore there is only one infinite set.
> Like:
> <WM>
> > Nevertheless it is impossible to distinguish
> > different infinite initial segments.
> </WM>

> > There is only one in ℕ.
> Let's say that
> ℕ is the only infinite initial segment in ℕ
> and
> an infinite initial segment
> contains 0 and contains all its successors j⁺⁺

Most of which cannot be distinguished.

Regards, WM

Re: Three proofs of dark numbers

<eee5f9c3-b74b-469e-a50c-d50044499912n@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115676&group=sci.math#115676

  copy link   Newsgroups: sci.math
X-Received: by 2002:a05:6214:1c85:b0:4af:7393:3d91 with SMTP id ib5-20020a0562141c8500b004af73933d91mr26923429qvb.74.1665653716112;
Thu, 13 Oct 2022 02:35:16 -0700 (PDT)
X-Received: by 2002:a05:6830:618a:b0:65c:45b1:4d53 with SMTP id
cb10-20020a056830618a00b0065c45b14d53mr15086763otb.151.1665653715893; Thu, 13
Oct 2022 02:35:15 -0700 (PDT)
Path: i2pn2.org!i2pn.org!aioe.org!news.mixmin.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Thu, 13 Oct 2022 02:35:15 -0700 (PDT)
In-Reply-To: <ti7c8h$1j44i$1@dont-email.me>
Injection-Info: google-groups.googlegroups.com; posting-host=2003:c7:8f32:40e2:5c00:cf58:cb4:2551;
posting-account=jn1PxAoAAAD-XIFhTFFaTyGmTiEGt0_b
NNTP-Posting-Host: 2003:c7:8f32:40e2:5c00:cf58:cb4:2551
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com> <70363a44-0236-b8f1-ea4c-350dd5558361@att.net>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com> <a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <b7db0bc2-36d6-469c-a6c0-4846217595dbn@googlegroups.com>
<52b2525e-882d-48ab-b9f8-496fc5fb8323n@googlegroups.com> <2afbc15e-e3cf-423c-81ff-9a215aededf6n@googlegroups.com>
<4446f145-201b-402b-a487-da7635ab1fccn@googlegroups.com> <ti7c8h$1j44i$1@dont-email.me>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <eee5f9c3-b74b-469e-a50c-d50044499912n@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: askaske...@gmail.com (WM)
Injection-Date: Thu, 13 Oct 2022 09:35:16 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
 by: WM - Thu, 13 Oct 2022 09:35 UTC

FromTheRafters schrieb am Mittwoch, 12. Oktober 2022 um 23:40:42 UTC+2:
> WM has brought this to us :
> > Fritz Feldhase schrieb am Mittwoch, 12. Oktober 2022 um 11:13:52 UTC+2:
> >
> >> {{0, ..., n} : n e IN} = {{0}, {0, 1}, {0, 1, 2}, ...} = (due to von
> >> Neumann) = {1, 2, 3, ...} = IN \ {0}.
> >>
> >> Now card( IN \ {0} ) = aleph_0, since card( IN ) = aleph_0 BY DEFINITION.
> >
> > Contradicted by counting FISONs by elements in FISONs:
> >
> > 1
> > 2, 1
> > 3, 2, 1
> > ...
> >
> > If the first column contains ℵo elements.
> The natural numbers. The second column also lists the natural numbers,
> so does the third and so on.

Each column has one number less than the first column. But that does not matter in potential infinity.

> > then the complete figure contains ℵo elements.
> You got it, the natural numbers are still countable in two dimensional
> tables.

Here all columns contain the same. No two-dimensional counting necessary.

> > But no set of lines contains more than one line of the set.
> > And no line contains ℵo elements.

That is important!

Regards, WM

Re: Three proofs of dark numbers

<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115702&group=sci.math#115702

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: james.g....@att.net (Jim Burns)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 11:46:54 -0400
Organization: A noiseless patient Spider
Lines: 106
Message-ID: <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: reader01.eternal-september.org; posting-host="74f979a17503c03ef370be997aaaef36";
logging-data="1928505"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18bEFttig/BtuiYht/ufsSBAC3HMUAGeFw="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.2
Cancel-Lock: sha1:6ICZCZjOLzJGM5Z6/mY33GbFGYA=
Content-Language: en-US
In-Reply-To: <b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
 by: Jim Burns - Thu, 13 Oct 2022 15:46 UTC

On 10/13/2022 5:32 AM, WM wrote:
> Jim Burns schrieb am Donnerstag,
> 13. Oktober 2022 um 05:19:27 UTC+2:
>> On 10/12/2022 5:11 PM, WM wrote:

>>> There is only one in ℕ.
>>
>> Let's say that
>> ℕ is the only infinite initial segment in ℕ
>> and
>> an infinite initial segment
>> contains 0 and contains all its successors j⁺⁺
>
> Most of which cannot be distinguished.

However,
you (WM) agree that
ℕ is the only infinite initial segment in ℕ

That's enough for us to know that
ℕ = ⋃𝓕 the union of FISONs

What does "cannot be distinguished" mean?
Never mind. We don't need it.
It doesn't matter.

⋃𝓕 subset ℕ
[1]

⋃𝓕 is an infinite initial segment.
[2]

There is only one subset of ℕ which is
an infinite initial segment,
and it is ℕ

Therefore,
⋃𝓕 = ℕ

----
[1]
⋃𝓕 subset ℕ

| Assume otherwise.
| Assume ⋃𝓕 is not subset ℕ
| Assume something in ⋃𝓕 is not in ℕ
| | Let m ∈ ⋃𝓕 and m ∉ ℕ
| m is in some FISON 𝐹 in 𝓕
| | {i: ~∃i₂=<i, i₂∉ℕ} {i: ∃i₂=<i, i₂∉ℕ}
| is a split of 𝐹
| | Because 𝐹 is a FISON,
| {i: ~∃i₂=<i, i₂∉ℕ} contains a last, j
| {i: ∃i₂=<i, i₂∉ℕ} contains a first, k
| and k = j⁺⁺
| | From the definition of the split,
| j ∈ ℕ and k ∉ ℕ
| | However,
| ℕ is an infinite initial segment
| ∀j ∈ ℕ, j⁺⁺ ∈ ℕ
| and k = j⁺⁺
| Contradiction.

Therefore
⋃𝓕 subset ℕ

----
[2]
⋃𝓕 is an infinite initial segment.

An infinite initial segment
contains 0 and contains all its successors j⁺⁺

| ⟨0⟩ is a FISON
| ⟨0⟩ ∈ 𝓕

0 ∈ ⋃𝓕

| Assume j ∈ ⋃𝓕
| | j is in some FISON 𝐹 in 𝓕
| Either
| j⁺⁺ ∈ 𝐹
| or
| j⁺⁺ ∉ 𝐹 and j⁺⁺ ∈ 𝐹⊕⟨j⁺⁺⟩
| | 𝐹⊕⟨j⁺⁺⟩ is 𝐹 with j⁺⁺ appended at its end.
| 𝐹 is a FISON. 𝐹⊕⟨j⁺⁺⟩ is a FISON too.
| j⁺⁺ is in a FISON, 𝐹 or 𝐹⊕⟨j⁺⁺⟩
| | j⁺⁺ ∈ ⋃𝓕

if j ∈ ⋃𝓕 then j⁺⁺ ∈ ⋃𝓕

⋃𝓕 contains all its successors. And 0.

Therefore,
⋃𝓕 is an infinite initial segment.

Re: Three proofs of dark numbers

<ti9h34$kv0$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115729&group=sci.math#115729

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 12:15:15 -0500
Organization: Aioe.org NNTP Server
Message-ID: <ti9h34$kv0$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<be9768a9-1ae0-4b4c-a3fb-83bb0be43616n@googlegroups.com>
<78918b06-02ac-61ba-3811-1adf8a877403@att.net>
<2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com>
<70363a44-0236-b8f1-ea4c-350dd5558361@att.net>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com>
<a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<thq2hb$3qi0p$4@dont-email.me>
<243c7aff-ca13-4e33-aa90-17ee76e646f1n@googlegroups.com>
<10c5b85a-fff6-4637-b8bd-d714a921b4e2n@googlegroups.com>
<6481c4b0-85ae-4dab-b2d6-43aea62762b2n@googlegroups.com>
<a244021c-9d81-4ada-bbaf-0238b47a321fn@googlegroups.com>
<0f5c3e53-bac7-440f-a7c3-9b79cc8e3564n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="21472"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.1
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Thu, 13 Oct 2022 17:15 UTC

On 10/11/2022 11:57 AM, WM wrote:
> Fritz Feldhase schrieb am Dienstag, 11. Oktober 2022 um 18:29:04 UTC+2:
>> On Tuesday, October 11, 2022 at 5:16:23 PM UTC+2, WM wrote:
>>
>>> ω is the first infinite ordinal number.
>>> ℕ is the set of all finite ordinal numbers.
>>> There is an obvious difference.
>> Except that there is no difference in the context of ZFC
>
> ZFC is wrong.
>
>> where IN/omega is defined due to von Neumann,
>
> The name v. Neumann cannot beat logic.
>
> Counting FISONs by elements in FISONs we have to count ℵo elements in ℵo FISONs.
>
> 1
> 2, 1
> 3, 2, 1
> ...
>

> Regards, WM

WMs math usefulness is only in counting rocks, or sheeps.

the rest is made up bunk, lies, fiction, imagination, drivelings, and always => without math.

Re: Three proofs of dark numbers

<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115748&group=sci.math#115748

  copy link   Newsgroups: sci.math
X-Received: by 2002:a05:622a:5149:b0:38d:961c:a568 with SMTP id ew9-20020a05622a514900b0038d961ca568mr1131381qtb.511.1665687947516;
Thu, 13 Oct 2022 12:05:47 -0700 (PDT)
X-Received: by 2002:a05:6808:1244:b0:353:c8f3:9928 with SMTP id
o4-20020a056808124400b00353c8f39928mr663943oiv.152.1665687947229; Thu, 13 Oct
2022 12:05:47 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Thu, 13 Oct 2022 12:05:46 -0700 (PDT)
In-Reply-To: <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
Injection-Info: google-groups.googlegroups.com; posting-host=2003:c7:8f32:40e2:5c00:cf58:cb4:2551;
posting-account=jn1PxAoAAAD-XIFhTFFaTyGmTiEGt0_b
NNTP-Posting-Host: 2003:c7:8f32:40e2:5c00:cf58:cb4:2551
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com> <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: askaske...@gmail.com (WM)
Injection-Date: Thu, 13 Oct 2022 19:05:47 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 3899
 by: WM - Thu, 13 Oct 2022 19:05 UTC

Jim Burns schrieb am Donnerstag, 13. Oktober 2022 um 17:47:04 UTC+2:
> On 10/13/2022 5:32 AM, WM wrote:
> > Jim Burns schrieb am Donnerstag,
> > 13. Oktober 2022 um 05:19:27 UTC+2:
> >> On 10/12/2022 5:11 PM, WM wrote:
>
> >>> There is only one in ℕ.
> >>
> >> Let's say that
> >> ℕ is the only infinite initial segment in ℕ
> >> and
> >> an infinite initial segment
> >> contains 0 and contains all its successors j⁺⁺
> >
> > Most of which cannot be distinguished.
> However,
> you (WM) agree that
> ℕ is the only infinite initial segment in ℕ

Yes. The reason is that the set of dark numbers cannot be divided.
Without dark numbers there were two alternatives:
Either there is a gap before omega or the natural numbers reach till omega.
If omega exists, then all smaller numbers can be subtracted. If all were definable, then a last one could be subtracted.

> That's enough for us to know that
> ℕ = ⋃𝓕 the union of FISONs
>

>
> What does "cannot be distinguished" mean?

Dark.
>
> ⋃𝓕 subset ℕ

Of course.

> [1]

> ⋃𝓕 is an infinite initial segment.

No. ℵo > n. Counting ℵo FISONs by elements in FISONs we have to count ℵo elements in ℵo FISONs.

1
2, 1
3, 2, 1
....

Assume that the first column contains ℵo elements.
Then the complete figure contains ℵo elements.
No line contains ℵo elements.
By inclusion-monotony: no set of lines contains ℵo elements.
The figure does not contain ℵo lines.

Regards, WM

Re: Three proofs of dark numbers

<ti9rpr$1nli$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115754&group=sci.math#115754

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 15:18:03 -0500
Organization: Aioe.org NNTP Server
Message-ID: <ti9rpr$1nli$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com>
<a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<b7db0bc2-36d6-469c-a6c0-4846217595dbn@googlegroups.com>
<52b2525e-882d-48ab-b9f8-496fc5fb8323n@googlegroups.com>
<2afbc15e-e3cf-423c-81ff-9a215aededf6n@googlegroups.com>
<4446f145-201b-402b-a487-da7635ab1fccn@googlegroups.com>
<ti7c8h$1j44i$1@dont-email.me>
<eee5f9c3-b74b-469e-a50c-d50044499912n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="57010"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.1
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Thu, 13 Oct 2022 20:18 UTC

On 10/13/2022 4:35 AM, WM wrote:
> FromTheRafters schrieb am Mittwoch, 12. Oktober 2022 um 23:40:42 UTC+2:
>> WM has brought this to us :
>>> Fritz Feldhase schrieb am Mittwoch, 12. Oktober 2022 um 11:13:52 UTC+2:
>>>
>>>> {{0, ..., n} : n e IN} = {{0}, {0, 1}, {0, 1, 2}, ...} = (due to von
>>>> Neumann) = {1, 2, 3, ...} = IN \ {0}.
>>>>
>>>> Now card( IN \ {0} ) = aleph_0, since card( IN ) = aleph_0 BY DEFINITION.
>>>
>>> Contradicted by counting FISONs by elements in FISONs:
>>>
>>> 1
>>> 2, 1
>>> 3, 2, 1
>>> ...
>>>
>>> If the first column contains ℵo elements.
>> The natural numbers. The second column also lists the natural numbers,
>> so does the third and so on.
>
> Each column has one number less than the first column.

?#!? All you did is *put spaces in the top of the columns*, dummy.

>
>>> then the complete figure contains ℵo elements.
>> You got it, the natural numbers are still countable in two dimensional
>> tables.
>
> Here all columns contain the same. No two-dimensional counting necessary.

you are lost again, out of math, each column has extra spaces on top.......

>
>>> But no set of lines contains more than one line of the set.
>>> And no line contains ℵo elements.
>
> That is important!

nope, it's all bullshit.

>
> Regards, WM

Re: Three proofs of dark numbers

<ti9ru0$1nmd$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115755&group=sci.math#115755

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 15:20:16 -0500
Organization: Aioe.org NNTP Server
Message-ID: <ti9ru0$1nmd$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<aa367742-fc4c-c277-17bd-46ef58df9f53@att.net>
<79c7197e-bd91-4af1-b0f4-44e427a4f9c2n@googlegroups.com>
<7cc4bb02-7eb7-a951-bf6f-65eb39ae1d35@att.net>
<8e490887-bde4-4503-ab1b-41a3660d02c6n@googlegroups.com>
<3b084529-d35f-874e-3f71-3408ba91ea92@att.net>
<be9768a9-1ae0-4b4c-a3fb-83bb0be43616n@googlegroups.com>
<78918b06-02ac-61ba-3811-1adf8a877403@att.net>
<2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com>
<70363a44-0236-b8f1-ea4c-350dd5558361@att.net>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com>
<a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<thq2hb$3qi0p$4@dont-email.me>
<243c7aff-ca13-4e33-aa90-17ee76e646f1n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="57037"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.1
X-Notice: Filtered by postfilter v. 0.9.2
Content-Language: en-US
 by: Sergi o - Thu, 13 Oct 2022 20:20 UTC

On 10/9/2022 4:02 AM, WM wrote:
> Chris M. Thomasson schrieb am Freitag, 7. Oktober 2022 um 22:35:00 UTC+2:
>> On 10/7/2022 12:09 AM, WM wrote:
>
>>> below omega there is no gap. No leap can end in a gap. The result of this is the existence of dark nunbers.
>> With regard to artificially restricting ones self to the natural
>> numbers, there is no gap between say, [41...42].
>
> Yes, there is no gap. And if ω exists, then there is no gap between ω and ℕ. But every leap from ω into ℕ covers infinitely many natural numbers.
>
> Reagrds, WM
the gap(s) is(are) expanding in your gray matter.

bunny leap?, or leaping lizard ?

Re: Three proofs of dark numbers

<ti9s19$1nmd$2@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115756&group=sci.math#115756

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 15:22:01 -0500
Organization: Aioe.org NNTP Server
Message-ID: <ti9s19$1nmd$2@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<7cc4bb02-7eb7-a951-bf6f-65eb39ae1d35@att.net>
<8e490887-bde4-4503-ab1b-41a3660d02c6n@googlegroups.com>
<3b084529-d35f-874e-3f71-3408ba91ea92@att.net>
<be9768a9-1ae0-4b4c-a3fb-83bb0be43616n@googlegroups.com>
<78918b06-02ac-61ba-3811-1adf8a877403@att.net>
<2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com>
<70363a44-0236-b8f1-ea4c-350dd5558361@att.net>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com>
<a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<thq2hb$3qi0p$4@dont-email.me>
<243c7aff-ca13-4e33-aa90-17ee76e646f1n@googlegroups.com>
<10c5b85a-fff6-4637-b8bd-d714a921b4e2n@googlegroups.com>
<6481c4b0-85ae-4dab-b2d6-43aea62762b2n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="57037"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.1
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Thu, 13 Oct 2022 20:22 UTC

On 10/11/2022 10:16 AM, WM wrote:
> Gus Gassmann schrieb am Sonntag, 9. Oktober 2022 um 15:58:35 UTC+2:
>> On Sunday, 9 October 2022 at 06:02:36 UTC-3, WM wrote:
>> [...]
>>> Yes, there is no gap. And if ω exists, then there is no gap between ω and ℕ. But every leap from ω into ℕ covers infinitely many natural numbers.
>> WTF is a "leap from ω into ℕ"?
>
> It means to enter ℕ from above.

like second floor to first floor ?

>
>> What even do *YOU* mean by a "gap between ω and ℕ"?
>
> Nothing existing.

so it is not real. Is this part of your delusion?

>
>> More basically, is ω =/= ℕ?
>
> ω is the first infinite ordinal number.
> ℕ is the set of all finite ordinal numbers.
> There is an obvious difference.

of course, they are spelt differently for a reason.

>
> Regards, WM

Re: Three proofs of dark numbers

<ti9sct$1vua$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115757&group=sci.math#115757

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 15:28:13 -0500
Organization: Aioe.org NNTP Server
Message-ID: <ti9sct$1vua$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<7cc4bb02-7eb7-a951-bf6f-65eb39ae1d35@att.net>
<8e490887-bde4-4503-ab1b-41a3660d02c6n@googlegroups.com>
<3b084529-d35f-874e-3f71-3408ba91ea92@att.net>
<be9768a9-1ae0-4b4c-a3fb-83bb0be43616n@googlegroups.com>
<78918b06-02ac-61ba-3811-1adf8a877403@att.net>
<2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com>
<70363a44-0236-b8f1-ea4c-350dd5558361@att.net>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com>
<a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<thq2hb$3qi0p$4@dont-email.me>
<243c7aff-ca13-4e33-aa90-17ee76e646f1n@googlegroups.com>
<3477945f-71f3-4e9d-8b49-516e30a2812an@googlegroups.com>
<d7c7dd73-7fcd-4c3b-bd98-66bdfc94dec9n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="65482"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.1
X-Notice: Filtered by postfilter v. 0.9.2
Content-Language: en-US
 by: Sergi o - Thu, 13 Oct 2022 20:28 UTC

On 10/11/2022 10:45 AM, WM wrote:
> Fritz Feldhase schrieb am Montag, 10. Oktober 2022 um 14:48:55 UTC+2:
>> On Sunday, October 9, 2022 at 11:02:36 AM UTC+2, WM wrote:
>>
>>> there is no gap between ω and ℕ.

QUACK!!

>> I'll interprete this to mean: There is no ordinal o such that for all n in IN: n < o < ω.
>
> Yes. But there are many (ℵo) ordinals between all definable

QUACK!! natnumbers and ω which cannot be defined

QUACK!! because

> ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo
>
>> Hint: For all n e IN: card({k e IN: n < k} = aleph_0.
>>
>> Meaning: For each and every n in IN there are countably-infintely many elements in IN which are larger than n.
>
> If ℕ is completed

QUACK!!
>, this is impossible. If you subtract each and every n then nothing remains.

QUACK!!

> |ℕ \ {1, 2, 3, ...}| = 0 .
> {0, 1, 2, 3, ..., ω} \ ℕ = {0, ω},

QUACK!!

>
> Regards, WM

each QUACK!! indicates mistake that needs correcting.

WM, please post in alt.delusional.fake.math

Re: Three proofs of dark numbers

<tia2up$i5d$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115767&group=sci.math#115767

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 17:20:08 -0500
Organization: Aioe.org NNTP Server
Message-ID: <tia2up$i5d$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="18605"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.1
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Thu, 13 Oct 2022 22:20 UTC

On 10/13/2022 2:05 PM, WM wrote:
> Jim Burns schrieb am Donnerstag, 13. Oktober 2022 um 17:47:04 UTC+2:
>> On 10/13/2022 5:32 AM, WM wrote:
>>> Jim Burns schrieb am Donnerstag,
>>> 13. Oktober 2022 um 05:19:27 UTC+2:
>>>> On 10/12/2022 5:11 PM, WM wrote:
>>
>>>>> There is only one in ℕ.
>>>>
>>>> Let's say that
>>>> ℕ is the only infinite initial segment in ℕ
>>>> and
>>>> an infinite initial segment
>>>> contains 0 and contains all its successors j⁺⁺
>>>
>>> Most of which cannot be

[QUACK!!]distinguished.
>> However,
>> you (WM) agree that
>> ℕ is the only infinite initial segment in ℕ
>
> Yes. The reason is that the set of dark

[QUACK!!] numbers cannot be divided.
> Without dark

[QUACK!!] numbers there were two alternatives:
> Either there is a gap

[QUACK!!] before omega or the natural numbers reach

[QUACK!!] till omega.
> If omega exists, then all smaller numbers can be subtracted. If all were

[QUACK!!] definable, then a last

[QUACK!!] one could be subtracted.
>
>> That's enough for us to know that
>> ℕ = ⋃𝓕 the union of FISONs
>>
>
>>
>> What does "cannot be distinguished" mean?
>
> Dark. [QUACK!!]
>>
>> ⋃𝓕 subset ℕ
>
> Of course.
>
>> [1]
>
>> ⋃𝓕 is an infinite initial segment.
>
>
> No. ℵo > n. Counting ℵo FISONs by elements in FISONs we have to count ℵo elements in ℵo FISONs.

No. No FISON is ℵo.

>
> 1
> 2, 1
> 3, 2, 1
> ...
>
> Assume that the first column contains ℵo elements.
> Then the complete figure contains ℵo elements.
> No line contains ℵo elements.
> By inclusion [QUACK!!]-monotony: no set of lines contains ℵo elements.
> The figure does not contain ℵo lines.

because you stop at ...

>
> Regards, WM

Re: Three proofs of dark numbers

<aa6fd496-0017-0a75-630e-220288b79b42@att.net>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115780&group=sci.math#115780

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: james.g....@att.net (Jim Burns)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 23:24:39 -0400
Organization: A noiseless patient Spider
Lines: 16
Message-ID: <aa6fd496-0017-0a75-630e-220288b79b42@att.net>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<8e490887-bde4-4503-ab1b-41a3660d02c6n@googlegroups.com>
<3b084529-d35f-874e-3f71-3408ba91ea92@att.net>
<be9768a9-1ae0-4b4c-a3fb-83bb0be43616n@googlegroups.com>
<78918b06-02ac-61ba-3811-1adf8a877403@att.net>
<2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com>
<70363a44-0236-b8f1-ea4c-350dd5558361@att.net>
<4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com>
<a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com>
<4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<thq2hb$3qi0p$4@dont-email.me>
<243c7aff-ca13-4e33-aa90-17ee76e646f1n@googlegroups.com>
<3477945f-71f3-4e9d-8b49-516e30a2812an@googlegroups.com>
<d7c7dd73-7fcd-4c3b-bd98-66bdfc94dec9n@googlegroups.com>
<ti9sct$1vua$1@gioia.aioe.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: reader01.eternal-september.org; posting-host="33e63347c1a0920ac2d4f712e89f066c";
logging-data="2121066"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+DlccgvDgDG0NKOplNxW3ksP77hjEl43o="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.2
Cancel-Lock: sha1:Bri0ZjCYoj+Qd1a2nH1y17Nvv4g=
Content-Language: en-US
In-Reply-To: <ti9sct$1vua$1@gioia.aioe.org>
 by: Jim Burns - Fri, 14 Oct 2022 03:24 UTC

On 10/13/2022 4:28 PM, Sergi o wrote:
> On 10/11/2022 10:45 AM, WM wrote:

>> |ℕ \ {1, 2, 3, ...}| = 0 .
>> {0, 1, 2, 3, ..., ω} \ ℕ = {0, ω},
>
> QUACK!!
>
>>
>> Regards, WM
>
> each QUACK!! indicates mistake that needs correcting.

You offer multiple QUorrACKtions.

Re: Three proofs of dark numbers

<919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115781&group=sci.math#115781

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: james.g....@att.net (Jim Burns)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Thu, 13 Oct 2022 23:26:10 -0400
Organization: A noiseless patient Spider
Lines: 108
Message-ID: <919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com>
<b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: reader01.eternal-september.org; posting-host="33e63347c1a0920ac2d4f712e89f066c";
logging-data="2121066"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/uEcz1HrHgyfmP6yBDsigrrQLC0I0eoXA="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.2
Cancel-Lock: sha1:vc1nbnXLnI/3CD6jF45f4Alw/aE=
Content-Language: en-US
In-Reply-To: <2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
 by: Jim Burns - Fri, 14 Oct 2022 03:26 UTC

On 10/13/2022 3:05 PM, WM wrote:
> Jim Burns schrieb am Donnerstag,
> 13. Oktober 2022 um 17:47:04 UTC+2:
>> On 10/13/2022 5:32 AM, WM wrote:
>>> Jim Burns schrieb am Donnerstag,
>>> 13. Oktober 2022 um 05:19:27 UTC+2:
>>>> On 10/12/2022 5:11 PM, WM wrote:

>>>>> There is only one in ℕ.
>>>>
>>>> Let's say that
>>>> ℕ is the only infinite initial segment in ℕ
>>>> and
>>>> an infinite initial segment
>>>> contains 0 and contains all its successors j⁺⁺
>>>
>>> Most of which cannot be distinguished.
>>
>> However,
>> you (WM) agree that
>> ℕ is the only infinite initial segment in ℕ
>
> Yes.

And I quote: "Yes".

You claim you have reasons.
I am not in the mood for looking a gift-horse
in the mouth.

We agree that
ℕ is an infinite initial segment
(ℕ contains all its successors j⁺⁺ and 0)
and
each non-ℕ subset B of N is
NOT an infinite initial segment
(B does NOT contain all its successors j⁺⁺ and 0)

> The reason is that
> the set of dark numbers cannot be divided.
> Without dark numbers there were two alternatives:
> Either there is a gap before omega
> or the natural numbers reach till omega.
> If omega exists,
> then all smaller numbers can be subtracted.
> If all were definable,
> then a last one could be subtracted.
>
>> That's enough for us to know that
>> ℕ = ⋃𝓕 the union of FISONs

>> ⋃𝓕 subset ℕ
>
> Of course.

>> ⋃𝓕 is an infinite initial segment.
>
> No.

Yes.
An infinite initial segment
contains all its successors j⁺⁺ and 0

⋃𝓕 contains all its successors j⁺⁺ and 0

⋃𝓕 is an infinite initial segment.

----
ℕ does not contain dark numbers
because
ℕ = ⋃𝓕
because
⋃𝓕 is an infinite initial segment in ℕ
because
⋃𝓕 contains all its successors j⁺⁺
because
𝐹ⱼ⊕⟨j⁺⁺⟩ is a FISON too

<WM<JB>>
>
>> That's because 𝐹ₘ₋₁⊕⟨m⟩ is a FISON too.
>
> Boring.
>
</WM<JB>>
Date: Fri, 7 Oct 2022 14:34:33 -0400

You were correct. It is boring.

Thrills and chills are not an essential feature
of mathematical facts.

> ℵo > n.
> Counting ℵo FISONs by elements in FISONs
> we have to count ℵo elements in ℵo FISONs.
>
> 1
> 2, 1
> 3, 2, 1
> ...
>
> Assume that the first column contains ℵo elements.
> Then the complete figure contains ℵo elements.
> No line contains ℵo elements.
> By inclusion-monotony: no set of lines contains ℵo elements.
> The figure does not contain ℵo lines.

Re: Three proofs of dark numbers

<d6fdbf9a-340a-40e8-a8d9-b8c93b973d3en@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115788&group=sci.math#115788

  copy link   Newsgroups: sci.math
X-Received: by 2002:a05:620a:2909:b0:6ee:6c83:9769 with SMTP id m9-20020a05620a290900b006ee6c839769mr2627407qkp.732.1665724294434;
Thu, 13 Oct 2022 22:11:34 -0700 (PDT)
X-Received: by 2002:a9d:4042:0:b0:661:90c6:7b6f with SMTP id
o2-20020a9d4042000000b0066190c67b6fmr1702886oti.1.1665724294009; Thu, 13 Oct
2022 22:11:34 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Thu, 13 Oct 2022 22:11:33 -0700 (PDT)
In-Reply-To: <2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
Injection-Info: google-groups.googlegroups.com; posting-host=185.234.68.33; posting-account=9KdpAQoAAAAHk6UQCkS1dsKOLsVDFEUN
NNTP-Posting-Host: 185.234.68.33
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com> <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <d6fdbf9a-340a-40e8-a8d9-b8c93b973d3en@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: zelos.ma...@gmail.com (zelos...@gmail.com)
Injection-Date: Fri, 14 Oct 2022 05:11:34 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 4132
 by: zelos...@gmail.com - Fri, 14 Oct 2022 05:11 UTC

torsdag 13 oktober 2022 kl. 21:05:51 UTC+2 skrev WM:
> Jim Burns schrieb am Donnerstag, 13. Oktober 2022 um 17:47:04 UTC+2:
> > On 10/13/2022 5:32 AM, WM wrote:
> > > Jim Burns schrieb am Donnerstag,
> > > 13. Oktober 2022 um 05:19:27 UTC+2:
> > >> On 10/12/2022 5:11 PM, WM wrote:
> >
> > >>> There is only one in ℕ.
> > >>
> > >> Let's say that
> > >> ℕ is the only infinite initial segment in ℕ
> > >> and
> > >> an infinite initial segment
> > >> contains 0 and contains all its successors j⁺⁺
> > >
> > > Most of which cannot be distinguished.
> > However,
> > you (WM) agree that
> > ℕ is the only infinite initial segment in ℕ
> Yes. The reason is that the set of dark numbers cannot be divided.
> Without dark numbers there were two alternatives:
> Either there is a gap before omega or the natural numbers reach till omega.
> If omega exists, then all smaller numbers can be subtracted. If all were definable, then a last one could be subtracted.
> > That's enough for us to know that
> > ℕ = ⋃𝓕 the union of FISONs
> >
>
> >
> > What does "cannot be distinguished" mean?
> Dark.
> >
> > ⋃𝓕 subset ℕ
>
> Of course.
> > [1]
>
> > ⋃𝓕 is an infinite initial segment.
> No. ℵo > n. Counting ℵo FISONs by elements in FISONs we have to count ℵo elements in ℵo FISONs.
> 1
> 2, 1
> 3, 2, 1
> ...
> Assume that the first column contains ℵo elements.
> Then the complete figure contains ℵo elements.
> No line contains ℵo elements.
> By inclusion-monotony: no set of lines contains ℵo elements.
> The figure does not contain ℵo lines.
>
> Regards, WM
"dark" is meaningless!

Re: Three proofs of dark numbers

<593fc128-55de-4a74-b511-9ed4df4fe276n@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115800&group=sci.math#115800

  copy link   Newsgroups: sci.math
X-Received: by 2002:ad4:5be6:0:b0:4b3:ff39:7ad4 with SMTP id k6-20020ad45be6000000b004b3ff397ad4mr3085061qvc.126.1665731581898;
Fri, 14 Oct 2022 00:13:01 -0700 (PDT)
X-Received: by 2002:a05:6830:6207:b0:660:c7ed:28bd with SMTP id
cd7-20020a056830620700b00660c7ed28bdmr1807903otb.219.1665731581689; Fri, 14
Oct 2022 00:13:01 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Fri, 14 Oct 2022 00:13:01 -0700 (PDT)
In-Reply-To: <2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
Injection-Info: google-groups.googlegroups.com; posting-host=79.206.198.85; posting-account=-75WZwoAAABL0f0-07Kn6tvNHWg7W9AE
NNTP-Posting-Host: 79.206.198.85
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com> <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <593fc128-55de-4a74-b511-9ed4df4fe276n@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: franz.fr...@gmail.com (Fritz Feldhase)
Injection-Date: Fri, 14 Oct 2022 07:13:01 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 2633
 by: Fritz Feldhase - Fri, 14 Oct 2022 07:13 UTC

On Thursday, October 13, 2022 at 9:05:51 PM UTC+2, WM wrote:

> The figure does not contain ℵo lines.

Look, dumbo, if you consider the infinite sequence (F_n)_(n e IN) with F_n = {1, ..., n}, then "it contains" ℵo (different) terms BY DEFINITION.

You see: card((F_n)_(N e IN)) = card(IN) = ℵo, since An,m e IN: n =/= m -> F_n =/= F_m.

AND NOW FUCK OFF, YOU SILLY ASSHOLE FULL OF SHIT!

Re: Three proofs of dark numbers

<90897f7e-2f9a-476f-9858-d94b05116cc7n@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115805&group=sci.math#115805

  copy link   Newsgroups: sci.math
X-Received: by 2002:a05:620a:2293:b0:6ee:94a6:5cd4 with SMTP id o19-20020a05620a229300b006ee94a65cd4mr3137206qkh.537.1665748008846;
Fri, 14 Oct 2022 04:46:48 -0700 (PDT)
X-Received: by 2002:a05:6808:16ac:b0:353:b7d7:5fef with SMTP id
bb44-20020a05680816ac00b00353b7d75fefmr2272569oib.293.1665748008623; Fri, 14
Oct 2022 04:46:48 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Fri, 14 Oct 2022 04:46:48 -0700 (PDT)
In-Reply-To: <593fc128-55de-4a74-b511-9ed4df4fe276n@googlegroups.com>
Injection-Info: google-groups.googlegroups.com; posting-host=2003:c7:8f32:4078:2ded:c8ff:811:9262;
posting-account=jn1PxAoAAAD-XIFhTFFaTyGmTiEGt0_b
NNTP-Posting-Host: 2003:c7:8f32:4078:2ded:c8ff:811:9262
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com> <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com> <593fc128-55de-4a74-b511-9ed4df4fe276n@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <90897f7e-2f9a-476f-9858-d94b05116cc7n@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: askaske...@gmail.com (WM)
Injection-Date: Fri, 14 Oct 2022 11:46:48 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 2796
 by: WM - Fri, 14 Oct 2022 11:46 UTC

Fritz Feldhase schrieb am Freitag, 14. Oktober 2022 um 09:13:07 UTC+2:
> On Thursday, October 13, 2022 at 9:05:51 PM UTC+2, WM wrote:
>
> > The figure does not contain ℵo lines.
> if you consider the infinite sequence (F_n)_(n e IN) with F_n = {1, ..., n}, then "it contains" ℵo (different) terms BY DEFINITION.

1
2, 1
3, 2, 1
....

By mathematics / symmetry there cannot be more lines than columns.
By definition there are not ℵo columns.
Any questions?

Regards, WM

Re: Three proofs of dark numbers

<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115806&group=sci.math#115806

  copy link   Newsgroups: sci.math
X-Received: by 2002:ac8:5c51:0:b0:39c:c813:249 with SMTP id j17-20020ac85c51000000b0039cc8130249mr3628871qtj.57.1665748432536;
Fri, 14 Oct 2022 04:53:52 -0700 (PDT)
X-Received: by 2002:a05:6870:160b:b0:12b:8d8d:1401 with SMTP id
b11-20020a056870160b00b0012b8d8d1401mr2498799oae.7.1665748432163; Fri, 14 Oct
2022 04:53:52 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Fri, 14 Oct 2022 04:53:51 -0700 (PDT)
In-Reply-To: <919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
Injection-Info: google-groups.googlegroups.com; posting-host=2003:c7:8f32:4078:2ded:c8ff:811:9262;
posting-account=jn1PxAoAAAD-XIFhTFFaTyGmTiEGt0_b
NNTP-Posting-Host: 2003:c7:8f32:4078:2ded:c8ff:811:9262
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com> <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com> <919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: askaske...@gmail.com (WM)
Injection-Date: Fri, 14 Oct 2022 11:53:52 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 4378
 by: WM - Fri, 14 Oct 2022 11:53 UTC

Jim Burns schrieb am Freitag, 14. Oktober 2022 um 05:26:20 UTC+2:
> On 10/13/2022 3:05 PM, WM wrote:
> > Jim Burns schrieb am Donnerstag,
> > 13. Oktober 2022 um 17:47:04 UTC+2:
> >> On 10/13/2022 5:32 AM, WM wrote:
> >>> Jim Burns schrieb am Donnerstag,
> >>> 13. Oktober 2022 um 05:19:27 UTC+2:
> >>>> On 10/12/2022 5:11 PM, WM wrote:
>
> >>>>> There is only one in ℕ.
> >>>>
> >>>> Let's say that
> >>>> ℕ is the only infinite initial segment in ℕ
> >>>> and
> >>>> an infinite initial segment
> >>>> contains 0 and contains all its successors j⁺⁺
> >>>
> >>> Most of which cannot be distinguished.
> >>
> >> However,
> >> you (WM) agree that
> >> ℕ is the only infinite initial segment in ℕ
> >
> > Yes.
> And I quote: "Yes".

> We agree that
> ℕ is an infinite initial segment

> > the set of dark numbers cannot be divided.
> > Without dark numbers there were two alternatives:
> > Either there is a gap before omega
> > or the natural numbers reach till omega.
> > If omega exists,
> > then all smaller numbers can be subtracted.
> > If all were definable,
> > then a last one could be subtracted.

> >> ⋃𝓕 subset ℕ
> >
> > Of course.
> >> ⋃𝓕 is an infinite initial segment.
> >
> > No.
> Yes.
> An infinite initial segment
> contains all its successors j⁺⁺ and 0

You have to distinguish potential infinity and actual infinity.
> ℕ does not contain dark numbers
> because
> ℕ = ⋃𝓕

Wrong.

> > 1
> > 2, 1
> > 3, 2, 1
> > ...
> >
By mathematics / symmetry there cannot be more lines than columns.
By definition there are not ℵo columns.

> > Assume that the first column contains ℵo elements.
> > Then the complete figure contains ℵo elements.
> > No line contains ℵo elements.
> > By inclusion-monotony: no set of lines contains ℵo elements.
> > The figure does not contain ℵo lines.

Regards, WM

Re: Three proofs of dark numbers

<tibst3$1k0o$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115817&group=sci.math#115817

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Fri, 14 Oct 2022 09:49:05 -0500
Organization: Aioe.org NNTP Server
Message-ID: <tibst3$1k0o$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
<593fc128-55de-4a74-b511-9ed4df4fe276n@googlegroups.com>
<90897f7e-2f9a-476f-9858-d94b05116cc7n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="53272"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Fri, 14 Oct 2022 14:49 UTC

On 10/14/2022 6:46 AM, WM wrote:
> Fritz Feldhase schrieb am Freitag, 14. Oktober 2022 um 09:13:07 UTC+2:
>> On Thursday, October 13, 2022 at 9:05:51 PM UTC+2, WM wrote:
>>
>>> The figure does not contain ℵo lines.
>> if you consider the infinite sequence (F_n)_(n e IN) with F_n = {1, ..., n}, then "it contains" ℵo (different) terms BY DEFINITION.
>
> 1
> 2, 1
> 3, 2, 1
> ...
>
> By mathematics / symmetry there cannot be more lines than columns.
> By definition there are not ℵo columns.
> Any questions?
>
> Regards, WM

sure, WTF are you talking about ?

you are only adding spaces at the beginning of each column, so what is that suppose to show ?

your three dots mean the columns go to infinity, and the rows go to infinity. You are known to have problems with common math nomenclature, so try again.

Re: Three proofs of dark numbers

<tick9i$28pbc$1@dont-email.me>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115838&group=sci.math#115838

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: chris.m....@gmail.com (Chris M. Thomasson)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Fri, 14 Oct 2022 14:28:18 -0700
Organization: A noiseless patient Spider
Lines: 57
Message-ID: <tick9i$28pbc$1@dont-email.me>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
<919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 14 Oct 2022 21:28:18 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="c4dc57116584bf69bc6b51c0291429d8";
logging-data="2385260"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/z58eR535ReTwWEAP+vgLLZTEGg1G4/S0="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
Cancel-Lock: sha1:U2fFn/YNgdQtq24eMgTMCsoguZY=
In-Reply-To: <0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
Content-Language: en-US
 by: Chris M. Thomasson - Fri, 14 Oct 2022 21:28 UTC

On 10/14/2022 4:53 AM, WM wrote:
> Jim Burns schrieb am Freitag, 14. Oktober 2022 um 05:26:20 UTC+2:
>> On 10/13/2022 3:05 PM, WM wrote:
>>> Jim Burns schrieb am Donnerstag,
>>> 13. Oktober 2022 um 17:47:04 UTC+2:
>>>> On 10/13/2022 5:32 AM, WM wrote:
>>>>> Jim Burns schrieb am Donnerstag,
>>>>> 13. Oktober 2022 um 05:19:27 UTC+2:
>>>>>> On 10/12/2022 5:11 PM, WM wrote:
>>
>>>>>>> There is only one in ℕ.
>>>>>>
>>>>>> Let's say that
>>>>>> ℕ is the only infinite initial segment in ℕ
>>>>>> and
>>>>>> an infinite initial segment
>>>>>> contains 0 and contains all its successors j⁺⁺
>>>>>
>>>>> Most of which cannot be distinguished.
>>>>
>>>> However,
>>>> you (WM) agree that
>>>> ℕ is the only infinite initial segment in ℕ
>>>
>>> Yes.
>> And I quote: "Yes".
>
>> We agree that
>> ℕ is an infinite initial segment
>
>>> the set of dark numbers cannot be divided.
>>> Without dark numbers there were two alternatives:
>>> Either there is a gap before omega
>>> or the natural numbers reach till omega.
>>> If omega exists,
>>> then all smaller numbers can be subtracted.
>>> If all were definable,
>>> then a last one could be subtracted.
>
>>>> ⋃𝓕 subset ℕ
>>>
>>> Of course.
>>>> ⋃𝓕 is an infinite initial segment.
>>>
>>> No.
>> Yes.
>> An infinite initial segment
>> contains all its successors j⁺⁺ and 0
>
> You have to distinguish potential infinity and actual infinity.
[...]

Are you infinitely stupid, or potentially stupid?

Well, stupid is as stupid does, right? ;^)

lol.

Re: Three proofs of dark numbers

<ticmnd$lc7$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115846&group=sci.math#115846

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Fri, 14 Oct 2022 17:09:48 -0500
Organization: Aioe.org NNTP Server
Message-ID: <ticmnd$lc7$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
<919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
<tick9i$28pbc$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="21895"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Fri, 14 Oct 2022 22:09 UTC

On 10/14/2022 4:28 PM, Chris M. Thomasson wrote:
> On 10/14/2022 4:53 AM, WM wrote:
>> Jim Burns schrieb am Freitag, 14. Oktober 2022 um 05:26:20 UTC+2:
>>> On 10/13/2022 3:05 PM, WM wrote:
>>>> Jim Burns schrieb am Donnerstag,
>>>> 13. Oktober 2022 um 17:47:04 UTC+2:
>>>>> On 10/13/2022 5:32 AM, WM wrote:
>>>>>> Jim Burns schrieb am Donnerstag,
>>>>>> 13. Oktober 2022 um 05:19:27 UTC+2:
>>>>>>> On 10/12/2022 5:11 PM, WM wrote:
>>>
>>>>>>>> There is only one in ℕ.
>>>>>>>
>>>>>>> Let's say that
>>>>>>> ℕ is the only infinite initial segment in ℕ
>>>>>>> and
>>>>>>> an infinite initial segment
>>>>>>> contains 0 and contains all its successors j⁺⁺
>>>>>>
>>>>>> Most of which cannot be distinguished.
>>>>>
>>>>> However,
>>>>> you (WM) agree that
>>>>> ℕ is the only infinite initial segment in ℕ
>>>>
>>>> Yes.
>>> And I quote: "Yes".
>>
>>> We agree that
>>> ℕ is an infinite initial segment
>>
>>>> the set of dark numbers cannot be divided.
>>>> Without dark numbers there were two alternatives:
>>>> Either there is a gap before omega
>>>> or the natural numbers reach till omega.
>>>> If omega exists,
>>>> then all smaller numbers can be subtracted.
>>>> If all were definable,
>>>> then a last one could be subtracted.
>>
>>>>> ⋃𝓕 subset ℕ
>>>>
>>>> Of course.
>>>>> ⋃𝓕 is an infinite initial segment.
>>>>
>>>> No.
>>> Yes.
>>> An infinite initial segment
>>> contains all its successors j⁺⁺ and 0
>>
>> You have to distinguish potential infinity and actual infinity.
> [...]
>
> Are you infinitely stupid, or potentially stupid?
>
> Well, stupid is as stupid does, right? ;^)
>
> lol.

WM streams his consciousness into the (actual) ANT LIST

(this short section is from 9/18/2020 ANT LIST 4.0- so, is WM a bot or not?)

154 degenerate Ants
155 Delusional Ants
156 Demasking Ants
157 Deodor Ant *
158 despicable bastard Ants
159 destroy every converging sequence Ants
160 Differing Ants
161 Dimentionless Ants
162 discontinuity Ants
163 dishonest cheating Ants
164 distinguish between sense and nonsense Ants
165 Distracted Ants
166 Dodgy Shtick Ants
167 Dumb and Dumber Ants
168 Dumbo Ants
169 Each and every Ant
170 Eggsegmented Ants
171 Eggsegments Ants
172 Element Ants
173 Emirp Ants *
174 Empty set Ants
175 Empty Ants
176 Empty limit Ants
177 Endless Ants
178 Endpointless Ants
179 Endsegment Infesting Ants

Re: Three proofs of dark numbers

<88e78f6d-dd67-fa07-fc33-2b25fbe240f7@att.net>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115865&group=sci.math#115865

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: james.g....@att.net (Jim Burns)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Fri, 14 Oct 2022 22:48:35 -0400
Organization: A noiseless patient Spider
Lines: 162
Message-ID: <88e78f6d-dd67-fa07-fc33-2b25fbe240f7@att.net>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com>
<41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
<919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: reader01.eternal-september.org; posting-host="5535d801bd3cc806f4855bb3a4f73c70";
logging-data="2619824"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18aCSmOEt9PMpGQ0xNtdRAvbyBMkUlDVqY="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
Cancel-Lock: sha1:6jB9e9MNAzmqd+aKD5VfRTtiJKE=
In-Reply-To: <0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
Content-Language: en-US
 by: Jim Burns - Sat, 15 Oct 2022 02:48 UTC

On 10/14/2022 7:53 AM, WM wrote:
> Jim Burns schrieb am Freitag,
> 14. Oktober 2022 um 05:26:20 UTC+2:
>> On 10/13/2022 3:05 PM, WM wrote:
>>> Jim Burns schrieb am Donnerstag,
>>> 13. Oktober 2022 um 17:47:04 UTC+2:
>>>> On 10/13/2022 5:32 AM, WM wrote:
>>>>> Jim Burns schrieb am Donnerstag,
>>>>> 13. Oktober 2022 um 05:19:27 UTC+2:
>>>>>> On 10/12/2022 5:11 PM, WM wrote:

>>>>>>> There is only one in ℕ.
>>>>>>
>>>>>> Let's say that
>>>>>> ℕ is the only infinite initial segment in ℕ
>>>>>> and
>>>>>> an infinite initial segment
>>>>>> contains 0 and contains all its successors j⁺⁺
>>>>>
>>>>> Most of which cannot be distinguished.
>>>>
>>>> However,
>>>> you (WM) agree that
>>>> ℕ is the only infinite initial segment in ℕ
>>>
>>> Yes.
>>
>> And I quote: "Yes".
>
>> We agree that
>> ℕ is an infinite initial segment

Should I read that as you (WM) NOT agreeing to
the part that you deleted?

If so, it's mysterious what you meant by
<WM>
>>>>>>> There is only one in ℕ.

----
Still,
we at least agree that
ℕ is an infinite initial segment...
until further notice.

From that, it arises that
ω = 𝛚ℕ = ⋃𝓕

I define a _set operator_ '𝛚𝑆'
as the intersection of
all infinite initial segments 𝐵 in 𝑆
𝛚𝑆 = ⋂{𝐵 ⊆ 𝑆 : 𝐵⋮₀}

That will lead us to the unique _set_ ω
but, without more work, we might consider whether
𝛚𝑆 could be different for each 𝑆

I have introduced the notation '𝑆⋮₀' for
"𝑆 is an infinite initial segment"

"𝑆 contains all its successors j⁺⁺ and 0"

ℕ is an infinite initial segment.
ℕ contains all its successors j⁺⁺ and 0
ℕ⋮₀

Lemma 1.
The intersection of infinite initial segments
is an infinite initial segment.
(⋂{ 𝐵⋮₀ })⋮₀

| if
| j ∈ ⋂{ 𝐵⋮₀ }
| then
| j is in each 𝐵 and 𝐵⋮₀
| and
| j⁺⁺ is in each 𝐵
| and
| j⁺⁺ ∈ ⋂{ 𝐵⋮₀ }

If 𝑆 is an infinite initial segment,
then 𝛚𝑆 is the least (⊆) infinite initial
sub-segment in 𝑆
𝑆⋮₀ ⟹
(𝛚𝑆)⋮₀ ∧
∀𝐵⋮₀ ⊆ 𝑆⋮₀ : 𝛚𝑆 ⊆ 𝐵⋮₀ ⊆ 𝑆⋮₀

If 𝐴 and 𝐵 are infinite initial segments,
then their _least_ infinite initial sub-segments
are the same.
𝐴⋮₀ ∧ 𝐵⋮₀ ⟹ 𝛚𝐴 = 𝛚𝐵

| Assume 𝐴 and 𝐵 are infinite initial segments.
| 𝐴⋮₀ ∧ 𝐵⋮₀
| | The intersection 𝐴∩𝐵 of 𝐴 and 𝐵 is
| an infinite initial segment (lemma 1) and
| is subset both 𝐴 and 𝐵
| (𝐴∩𝐵)⋮₀
| 𝐴∩𝐵 ⊆ 𝐴 ∧ 𝐴∩𝐵 ⊆ 𝐵
| | The least infinite initial segment 𝛚𝐵 of 𝐵
| is subset 𝐴∩𝐵 subset 𝐵
| 𝛚𝐵 ⊆ (𝐴∩𝐵)⋮₀ ⊆ 𝐵⋮₀
| | Also,
| 𝛚𝐵 subset 𝐴∩𝐵 subset 𝐴
| thus,
| the least infinite initial segment 𝛚𝐴 of 𝐴
| is subset 𝛚𝐵 subset 𝐴∩𝐵 subset 𝐴
| 𝛚𝐴 ⊆ 𝛚𝐵⋮₀ ⊆ (𝐴∩𝐵)⋮₀ ⊆ 𝐴⋮₀
| | Thus, 𝛚𝐴 ⊆ 𝛚𝐵
| Similarly, 𝛚𝐵 ⊆ 𝛚𝐴
| Thus, 𝛚𝐴 = 𝛚𝐵

Therefore,
if 𝐴 and 𝐵 are infinite initial segments,
then their _least_ infinite initial sub-segments
are the same.
𝐴⋮₀ ∧ 𝐵⋮₀ ⟹ 𝛚𝐴 = 𝛚𝐵

<WM>
> Nevertheless it is impossible to distinguish
> different infinite initial segments.
>
Date: Sun, 9 Oct 2022 02:39:18 -0700 (PDT)

ω is distinguished as the unique
least infinite initial segment.

For any infinite initial segment 𝑆⋮₀
ω is the least infinite initial sub-segment in 𝑆
∀𝑆⋮₀ : ω⋮₀ ⊆ 𝑆

<WM>
> Why?
> Because the additional numbers are dark.
>
Date: Sun, 9 Oct 2022 02:39:18 -0700 (PDT)

ω = ⋃𝓕

∀j ∈ ω, ∃𝐹 ∈ 𝓕 : j ∈ 𝐹 ∈ 𝓕

ω does not contain dark numbers.

>>>> ⋃𝓕 is an infinite initial segment.
>>>
>>> No.
>>
>> Yes.
>> An infinite initial segment
>> contains all its successors j⁺⁺ and 0
>
> You have to distinguish potential infinity
> and actual infinity.

If j is in FISON 𝐹
then j⁺⁺ is in 𝐹 or in FISON 𝐹ⱼ⊕⟨j⁺⁺⟩

Re: Three proofs of dark numbers

<c4decf70-461f-4ebe-a5f9-cd09012b4e76n@googlegroups.com>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115878&group=sci.math#115878

  copy link   Newsgroups: sci.math
X-Received: by 2002:a05:622a:1804:b0:39c:c7ba:4ac1 with SMTP id t4-20020a05622a180400b0039cc7ba4ac1mr1356092qtc.457.1665830786579;
Sat, 15 Oct 2022 03:46:26 -0700 (PDT)
X-Received: by 2002:a4a:4847:0:b0:443:347d:6617 with SMTP id
p68-20020a4a4847000000b00443347d6617mr772565ooa.94.1665830786309; Sat, 15 Oct
2022 03:46:26 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!feed1.usenet.blueworldhosting.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: sci.math
Date: Sat, 15 Oct 2022 03:46:26 -0700 (PDT)
In-Reply-To: <88e78f6d-dd67-fa07-fc33-2b25fbe240f7@att.net>
Injection-Info: google-groups.googlegroups.com; posting-host=2003:c7:8f32:408f:3c89:66ce:197e:b6df;
posting-account=jn1PxAoAAAD-XIFhTFFaTyGmTiEGt0_b
NNTP-Posting-Host: 2003:c7:8f32:408f:3c89:66ce:197e:b6df
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com> <fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com> <c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com> <3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com> <919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com> <88e78f6d-dd67-fa07-fc33-2b25fbe240f7@att.net>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <c4decf70-461f-4ebe-a5f9-cd09012b4e76n@googlegroups.com>
Subject: Re: Three proofs of dark numbers
From: askaske...@gmail.com (WM)
Injection-Date: Sat, 15 Oct 2022 10:46:26 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Received-Bytes: 5228
 by: WM - Sat, 15 Oct 2022 10:46 UTC

Jim Burns schrieb am Samstag, 15. Oktober 2022 um 04:48:47 UTC+2:
> On 10/14/2022 7:53 AM, WM wrote:
> > Jim Burns schrieb am Freitag,
> > 14. Oktober 2022 um 05:26:20 UTC+2:
> >> On 10/13/2022 3:05 PM, WM wrote:
> >>> Jim Burns schrieb am Donnerstag,
> >>> 13. Oktober 2022 um 17:47:04 UTC+2:
> >>>> On 10/13/2022 5:32 AM, WM wrote:
> >>>>> Jim Burns schrieb am Donnerstag,
> >>>>> 13. Oktober 2022 um 05:19:27 UTC+2:
> >>>>>> On 10/12/2022 5:11 PM, WM wrote:
>
> >>>>>>> There is only one in ℕ.
> >>>>>>
> >>>>>> Let's say that
> >>>>>> ℕ is the only infinite initial segment in ℕ
> >>>>>> and
> >>>>>> an infinite initial segment
> >>>>>> contains 0 and contains all its successors j⁺⁺
> >>>>>
> >>>>> Most of which cannot be distinguished.
> >>>>
> >>>> However,
> >>>> you (WM) agree that
> >>>> ℕ is the only infinite initial segment in ℕ
> >>>
> >>> Yes.
> >>
> >> And I quote: "Yes".
> >
> >> We agree that
> >> ℕ is an infinite initial segment
> Should I read that as you (WM) NOT agreeing to
> the part that you deleted?

We agree that ℕ is an infinite initial segment
>
> If so, it's mysterious what you meant by
> <WM>
> >>>>>>> There is only one in ℕ.

There is only one infinite initial segment that can be discerned in ℕ because the infinite set of dark nunbers cannot be subdivided.
> ----
> Still,
> we at least agree that
> ℕ is an infinite initial segment...
> until further notice.

Yes. There are man more but not initial infinite segemnts:
{2, 3, 4, ...}
{3, 4, 5, ...}
and so on.
>
> From that, it arises that
> ω = 𝛚ℕ = ⋃𝓕
>
No.

> I define a _set operator_ '𝛚𝑆'
> as the intersection of
> all infinite initial segments 𝐵 in 𝑆
> 𝛚𝑆 = ⋂{𝐵 ⊆ 𝑆 : 𝐵⋮₀}

The intersection all infinite segments is the set of dark numbers.
>
> I have introduced the notation '𝑆⋮₀' for
> "𝑆 is an infinite initial segment"
> ⟺
> "𝑆 contains all its successors j⁺⁺ and 0"
>
> ℕ is an infinite initial segment.
> ℕ contains all its successors j⁺⁺ and 0
> ℕ⋮₀
>
> Lemma 1.
> The intersection of infinite initial segments
> is an infinite initial segment.

There is only one discernible infinite initial segment.

> ω = ⋃𝓕

No.

⋃𝓕 has not cardinality ℵo.

The figure
1 2, 1
3, 2, 1
....
does not contain ℵo lines.

Proof: By symmetry there cannot be more lines than columns.
By definition there are not ℵo columns.

Regards, WM

Re: Three proofs of dark numbers

<tie687$2n27p$1@dont-email.me>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115882&group=sci.math#115882

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!weretis.net!feeder8.news.weretis.net!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: FTR...@nomail.afraid.org (FromTheRafters)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Sat, 15 Oct 2022 07:40:48 -0400
Organization: Peripheral Visions
Lines: 21
Message-ID: <tie687$2n27p$1@dont-email.me>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com> <2148b107-5f97-4e1d-8851-74cc37193abfn@googlegroups.com> <70363a44-0236-b8f1-ea4c-350dd5558361@att.net> <4f51669c-0444-4768-896c-b32322c1187dn@googlegroups.com> <a1a8348d-7b9e-aa3d-c26e-f78b4562adb2@att.net> <d88c5ef6-168f-4f74-aee3-a4bc7d63b5d1n@googlegroups.com> <4fb0f54a-01eb-da71-22de-c24f25166813@att.net> <c88d7ef5-c086-4f03-940a-0a99b5f44763n@googlegroups.com> <b6c77319-205f-da62-b7f0-8a3378465de3@att.net> <eb32afe6-f3cc-4fab-aea9-c6d6530826acn@googlegroups.com> <41e8b7d7-e610-80a8-5942-aa636b813499@att.net> <0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com> <2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net> <72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com> <1730d023-16ef-d8a3-c637-c151a36302bb@att.net> <b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com> <66b9f254-54f8-df27-0964-76bedb945ce5@att.net> <ti19rd$r0k2$1@dont-email.me> <090b5e7c-d30f-4e28-9826-a9146c00f10dn@googlegroups.com>
Reply-To: erratic.howard@gmail.com
MIME-Version: 1.0
Content-Type: text/plain; charset="iso-8859-15"; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 15 Oct 2022 11:40:56 -0000 (UTC)
Injection-Info: reader01.eternal-september.org; posting-host="5d0ad98686a0cae1c67d83bfb39b30f3";
logging-data="2853113"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18gmBbUBsuSKM6Lgu6oEKOui+sRQTaSyr0="
Cancel-Lock: sha1:c5rNZwKvAvCSUYz0/30Ru9PPdR8=
X-Newsreader: MesNews/1.08.06.00-gb
X-ICQ: 1701145376
 by: FromTheRafters - Sat, 15 Oct 2022 11:40 UTC

Gus Gassmann has brought this to us :
> On Monday, 10 October 2022 at 11:22:48 UTC-3, FromTheRafters wrote:
> [...]
>> I don't think a well ordered set has an infinite initial segment.
>
> I think that is wrong. Consider the set of natural numbers ordered by << in
> the following manner
>
> if a is odd and b is even, then a << b
> if a and b have the same parity, then A << b iff a < b in the conventional
> order if a is even and b is odd, then b << a.
>
> This well-order(!) can also be written as 1 << 3 << 5 << ... << 2 << 4 << 6
> << ... .
>
> I would think that for every /even/ natural number the initial segment is
> infinite.

That works as a sequence I guess, but I can't help seeing this as {{set
of odds},{set of evens}} order type two in sets. You're probably right
though, I retract my statement.

Re: Three proofs of dark numbers

<tieits$1g4u$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115893&group=sci.math#115893

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Sat, 15 Oct 2022 10:17:16 -0500
Organization: Aioe.org NNTP Server
Message-ID: <tieits$1g4u$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
<919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
<88e78f6d-dd67-fa07-fc33-2b25fbe240f7@att.net>
<c4decf70-461f-4ebe-a5f9-cd09012b4e76n@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="49310"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
X-Notice: Filtered by postfilter v. 0.9.2
Content-Language: en-US
 by: Sergi o - Sat, 15 Oct 2022 15:17 UTC

On 10/15/2022 5:46 AM, WM wrote:
> Jim Burns schrieb am Samstag, 15. Oktober 2022 um 04:48:47 UTC+2:
>> On 10/14/2022 7:53 AM, WM wrote:
>>> Jim Burns schrieb am Freitag,
>>> 14. Oktober 2022 um 05:26:20 UTC+2:
>>>> On 10/13/2022 3:05 PM, WM wrote:
>>>>> Jim Burns schrieb am Donnerstag,
>>>>> 13. Oktober 2022 um 17:47:04 UTC+2:
>>>>>> On 10/13/2022 5:32 AM, WM wrote:
>>>>>>> Jim Burns schrieb am Donnerstag,
>>>>>>> 13. Oktober 2022 um 05:19:27 UTC+2:
>>>>>>>> On 10/12/2022 5:11 PM, WM wrote:
>>
>>>>>>>>> There is only one in ℕ.
>>>>>>>>
>>>>>>>> Let's say that
>>>>>>>> ℕ is the only infinite initial segment in ℕ
>>>>>>>> and
>>>>>>>> an infinite initial segment
>>>>>>>> contains 0 and contains all its successors j⁺⁺
>>>>>>>
>>>>>>> Most of which cannot be distinguished.
>>>>>>
>>>>>> However,
>>>>>> you (WM) agree that
>>>>>> ℕ is the only infinite initial segment in ℕ
>>>>>
>>>>> Yes.
>>>>
>>>> And I quote: "Yes".
>>>
>>>> We agree that
>>>> ℕ is an infinite initial segment
>> Should I read that as you (WM) NOT agreeing to
>> the part that you deleted?
>
> We agree that ℕ is an infinite initial segment

no, ℕ is an infinite endsegment.

>>
>> If so, it's mysterious what you meant by
>> <WM>
>>>>>>>>> There is only one in ℕ.
>
> There is only one infinite initial segment that can be discerned in ℕ because the infinite set of dark nunbers cannot be subdivided.
>> ----
>> Still,
>> we at least agree that
>> ℕ is an infinite initial segment...
>> until further notice.
>
> Yes. There are man more but not initial infinite segemnts:
> {2, 3, 4, ...}
> {3, 4, 5, ...}
> and so on.
>>
>> From that, it arises that
>> ω = 𝛚ℕ = ⋃𝓕
>>
> No.

yes.

>
>> I define a _set operator_ '𝛚𝑆'
>> as the intersection of
>> all infinite initial segments 𝐵 in 𝑆
>> 𝛚𝑆 = ⋂{𝐵 ⊆ 𝑆 : 𝐵⋮₀}
>
> The intersection all infinite segments is the set of dark numbers.
>>
>> I have introduced the notation '𝑆⋮₀' for
>> "𝑆 is an infinite initial segment"
>> ⟺
>> "𝑆 contains all its successors j⁺⁺ and 0"
>>
>> ℕ is an infinite initial segment.
>> ℕ contains all its successors j⁺⁺ and 0
>> ℕ⋮₀
>>
>> Lemma 1.
>> The intersection of infinite initial segments
>> is an infinite initial segment.
>
> There is only one discernible infinite initial segment.
>
>> ω = ⋃𝓕
>
> No.
>
> ⋃𝓕 has not cardinality ℵo.
>
> The figure
> 1
> 2, 1
> 3, 2, 1
> ...
> does not contain ℵo lines.

wrong, if you want that, do not use the three dots, ...

>
> Proof: By symmetry there cannot be more lines than columns.
> By definition there are not ℵo columns.

wrong, you use the three dots ... so there are infinite rows and columns.

if that is not what you mean, then go study Mathematical Nomenclature for Dummies.

>
> Regards, WM

Re: Three proofs of dark numbers

<tiep8t$i0n$1@gioia.aioe.org>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115903&group=sci.math#115903

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!aioe.org!jq9Zon5wYWPEc6MdU7JpBw.user.46.165.242.75.POSTED!not-for-mail
From: inva...@invalid.com (Sergi o)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Sat, 15 Oct 2022 12:05:32 -0500
Organization: Aioe.org NNTP Server
Message-ID: <tiep8t$i0n$1@gioia.aioe.org>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<241052c0-5715-450c-9563-e0864398f547n@googlegroups.com>
<87y1v1hgn5.fsf@bsb.me.uk>
<e4d0b92b-38eb-40ea-8a8f-e34279adb176n@googlegroups.com>
<87zgfhfn0f.fsf@bsb.me.uk>
<4c266401-9d8c-4c5e-90d0-2f87ff60a8cbn@googlegroups.com>
<87edwrexet.fsf@bsb.me.uk>
<e2a1de6c-a629-4518-b996-f30fbe97d059n@googlegroups.com>
<87ilm3ce2i.fsf@bsb.me.uk>
<cd675151-187d-4f01-8734-68cca36d7465n@googlegroups.com>
<87bkrvc55d.fsf@bsb.me.uk>
<e6382d9c-04c6-40e4-a70f-fe3577806f0fn@googlegroups.com>
<87y1uybznm.fsf@bsb.me.uk>
<14d09e29-dc47-4c99-b0a5-baf1e2af44c7n@googlegroups.com>
<f113a477-303e-4b55-a2c5-de9c252bd3e8n@googlegroups.com>
<87wnahakko.fsf@bsb.me.uk>
<d3f82620-cf79-4e76-8c8d-89987bebdc2bn@googlegroups.com>
<ti0fso$obv5$3@dont-email.me>
<2c96cd47-ef45-4e40-b0fe-b88cf2eb133cn@googlegroups.com>
<ti4ha5$15roj$3@dont-email.me>
<72f92539-5a5e-4d3c-8017-bed6db8b13b9n@googlegroups.com>
<ti7a7m$1iv9o$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="18455"; posting-host="jq9Zon5wYWPEc6MdU7JpBw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
 by: Sergi o - Sat, 15 Oct 2022 17:05 UTC

On 10/12/2022 4:05 PM, Chris M. Thomasson wrote:
> On 10/12/2022 1:56 PM, WM wrote:
>> Chris M. Thomasson schrieb am Dienstag, 11. Oktober 2022 um 21:48:30 UTC+2:
>>> On 10/11/2022 8:32 AM, WM wrote:
>>
>>>> Everything easily accessible in a system is not dark in that system.
>>> Okay. I am thinking of a number. It is not dark to me, but its dark to
>>> you, right?
>>
>> That depends, but may be possible.
>
> The number I am thinking of is able to be constructed.

I used to use BAUDOT 5 (ITA2) and paper tape, got good results, AND it was recorded so all could see, they called me crazy, but I knew better.

>
>
>>> Is that what you mean?
>>
>> That is not so important since the border between visible and dark is blurred. Important is that for everybody the dark part is and remains infinite,
>> much larger than the always finite visible part:
>> ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo .
>
> The border between visible and dark? Okay, for some reason this makes me think of the numbers that escape vs the ones that do not in the Mandelbrot set.
>

yes, those that escape are dark areas, no they are points actually.

Re: Three proofs of dark numbers

<66eb0c36-a643-dace-3806-f5e8b38c371a@att.net>

  copy mid

https://www.novabbs.com/tech/article-flat.php?id=115909&group=sci.math#115909

  copy link   Newsgroups: sci.math
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!weretis.net!feeder8.news.weretis.net!eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: james.g....@att.net (Jim Burns)
Newsgroups: sci.math
Subject: Re: Three proofs of dark numbers
Date: Sat, 15 Oct 2022 14:07:26 -0400
Organization: A noiseless patient Spider
Lines: 136
Message-ID: <66eb0c36-a643-dace-3806-f5e8b38c371a@att.net>
References: <f409d781-ece6-4466-8071-c8ef967d8182n@googlegroups.com>
<0f86d8ac-66cb-4aac-805f-fc6bf6ace27cn@googlegroups.com>
<2f9b3774-b7d0-6f3a-88b4-c0322e61aa1b@att.net>
<72d790a9-2714-4294-b1a2-f290dc6a0f32n@googlegroups.com>
<1730d023-16ef-d8a3-c637-c151a36302bb@att.net>
<b1be3c67-b38c-4dfd-8d92-fb90846e416cn@googlegroups.com>
<66b9f254-54f8-df27-0964-76bedb945ce5@att.net>
<80c37c15-004d-4146-bfd1-ad0ec25677fen@googlegroups.com>
<fd486e93-9a8f-9c05-a9bd-798df56e7b42@att.net>
<8df87cc4-ae42-45d7-bd63-07efbe47c769n@googlegroups.com>
<c2a0fdd0-08ad-a1a4-dc5d-d61df1e4059e@att.net>
<b42a4829-68c4-4681-a317-84187125bf93n@googlegroups.com>
<3cdcb6fd-11b1-7e7d-0e31-37fb779de2ee@att.net>
<2f86865e-fe36-44ed-8afa-a5e30231e75fn@googlegroups.com>
<919e3601-8caa-3534-e4e8-8bfea52b71b7@att.net>
<0975479f-3cbe-4567-86d1-d887969edbbfn@googlegroups.com>
<88e78f6d-dd67-fa07-fc33-2b25fbe240f7@att.net>
<c4decf70-461f-4ebe-a5f9-cd09012b4e76n@googlegroups.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: reader01.eternal-september.org; posting-host="5535d801bd3cc806f4855bb3a4f73c70";
logging-data="3009093"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19dYvU+xbFpgGtC9OTTS2LJCVuYdkmQX1E="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.3.3
Cancel-Lock: sha1:vwLrSBEUdreb+O/84wmhDI2m/Lc=
Content-Language: en-US
In-Reply-To: <c4decf70-461f-4ebe-a5f9-cd09012b4e76n@googlegroups.com>
 by: Jim Burns - Sat, 15 Oct 2022 18:07 UTC

On 10/15/2022 6:46 AM, WM wrote:

> There are man more but not initial
> infinite segemnts:
>
> {2, 3, 4, ...}
> {3, 4, 5, ...}
> and so on.

>> I define a _set operator_ '𝛚𝑆'
>> as the intersection of
>> all infinite initial segments 𝐵 in 𝑆
>> 𝛚𝑆 = ⋂{𝐵 ⊆ 𝑆 : 𝐵⋮₀}
>
> The intersection all infinite segments
> is the set of dark numbers.

𝐵⋮₀ is an infinite _initial_ segment.
𝐵⋮₀ contains all its successors j⁺⁺ and 0

>> I have introduced the notation '𝑆⋮₀' for
>> "𝑆 is an infinite initial segment"
>> ⟺
>> "𝑆 contains all its successors j⁺⁺ and 0"
>>
>> ℕ is an infinite initial segment.
>> ℕ contains all its successors j⁺⁺ and 0
>> ℕ⋮₀
>>
>> Lemma 1.
>> The intersection of infinite initial segments
>> is an infinite initial segment.
>
> There is only one discernible
> infinite initial segment.

Being discernible is not an essential feature
of an infinite _initial_ segment.
Containing all its successors j⁺⁺ and 0 are
essential features of an infinite _initial_ segment.

>> ω = ⋃𝓕
>
> No.

Yes.
⋃𝓕 ⊆ ω and ω ⊆ ⋃𝓕

----
(1)
⋃𝓕 ⊆ ω
∀j : j ∈ ⋃𝓕 ⟹ j ∈ ω

| Assume otherwise.
| Assume j ∈ ⋃𝓕 and j ∉ ω
| | j ∉ ω and j ∈ 𝐹 ∈ 𝓕
| 𝐹 is a FISON
| There is a first j₁ in 𝐹 such that
| j₁ ∉ ω and j₁⁻⁻ ∈ ω
| | However,
| ∀j ∈ ω : j++ ∈ ω
| j₁⁻⁻ ∈ ω and j₁⁻⁻⁺⁺ = j₁ ∈ ω
| Contradiction.

Therefore,
∀j : j ∈ ⋃𝓕 ⟹ j ∈ ω
⋃𝓕 ⊆ ω

----
(2)
ω ⊆ ⋃𝓕

ω = 𝛚𝐵
for any infinite initial segment 𝐵⋮₀

𝐴⋮₀ ⟹ ω ⊆ 𝐴
for any infinite initial segment 𝐴⋮₀

(⋃𝓕)⋮₀
∀j ∈ ⋃𝓕 : j⁺⁺ ∈ ⋃𝓕 ∧ 0 ∈ ⋃𝓕
[1]

(⋃𝓕)⋮₀ ⟹ ω ⊆ ⋃𝓕

ω ⊆ ⋃𝓕

[1]
| Assume j ∈ ⋃𝓕
| | j ∈ 𝐹 ∈ 𝓕
| and 𝐹 is a FISON
| Either j⁺⁺ ∈ 𝐹 or j⁺⁺ ∉ 𝐹
| | If j⁺⁺ ∈ 𝐹 ∈ 𝓕
| then j⁺⁺ ∈ ⋃𝓕
| | If j ∈ 𝐹 and j⁺⁺ ∉ 𝐹
| then
| 𝐹⊕⟨j⁺⁺⟩ is a FISON too
| and
| j⁺⁺ ∈ 𝐹⊕⟨j⁺⁺⟩ ∈ 𝓕
| and
| j⁺⁺ ∈ ⋃𝓕

Therefore,
∀j ∈ ⋃𝓕 : j⁺⁺ ∈ ⋃𝓕

----
>> ω = ⋃𝓕
>
> No.

Yes.
⋃𝓕 ⊆ ω and ω ⊆ ⋃𝓕
ω = ⋃𝓕

> ⋃𝓕 has not cardinality ℵo.
>
> The figure
> 1
> 2, 1
> 3, 2, 1
> ...
> does not contain ℵo lines.
>
> Proof:
> By symmetry there cannot be
> more lines than columns.
> By definition there are not ℵo columns.

𝐹ⱼ⊕⟨j⁺⁺⟩ is a FISON too.


tech / sci.math / Re: Three proofs of dark numbers

Pages:12345678910111213141516171819202122232425262728293031323334353637383940
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor