Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.math
Subject: Re: The set of necessary FISONs
Date: Wed, 29 Jan 2025 07:46:24 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <c50fde56e7e0c4cf4842d4944ea3d1917c75eb41@i2pn2.org>
References: <vmo1bs$1rnl$1@dont-email.me>
 <ee4e189d-56bc-4ed7-b7b7-cd71fc4d2349@att.net> <vmqh9k$urua$1@dont-email.me>
 <903de8e1-3538-4cfe-9f7a-6509eda47ab6@att.net> <vmsvfv$1hn5k$1@dont-email.me>
 <3844edd7-0750-4418-bff6-2759817446b3@att.net> <vmvn1h$25r19$1@dont-email.me>
 <27377646-137a-4f8f-a7bb-a75707b2da96@att.net> <vn2gcf$2ouuo$2@dont-email.me>
 <d90c478d-6806-4ffe-83be-a5d7674bb5e3@att.net>
 <b82a0915-400a-4f77-9309-44eef432e9f4@att.net> <vn50eo$3kgi6$2@dont-email.me>
 <4d349964-211f-42f1-936f-81c22ae54cb5@att.net> <vn7vns$ra97$2@dont-email.me>
 <e3f89d8c-d214-453a-91f4-9023e744fed2@att.net> <vna72s$1ng1k$2@dont-email.me>
 <6e0c8ab2-402a-43a5-a348-0c727eae6a2e@att.net> <vnat4s$1s6ha$4@dont-email.me>
 <e43b1c65-4424-4e0c-9b2e-65e0e463815b@att.net> <vnconr$29v5v$1@dont-email.me>
 <87e2e677c7802c9c17df6063f340cb5857d5700b@i2pn2.org>
 <vnd4h8$2c0st$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 29 Jan 2025 12:46:24 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1699816"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
In-Reply-To: <vnd4h8$2c0st$1@dont-email.me>
Bytes: 3169
Lines: 40

On 1/29/25 6:47 AM, WM wrote:
> On 29.01.2025 11:53, joes wrote:
>> Am Wed, 29 Jan 2025 09:26:35 +0100 schrieb WM:
> 
>>> But its union cannot be ℕ because a non-empty
>>> set of FISONs would be necessary.
>> Why should a necessary set exist?
> 
> The set cannot be empty. Therefore it has elements. For each element we 
> can show that it is not leading to the aim. Therefore no such set 
> U(F(n)) = ℕ exists.
> 
> Regards, WM
> 
> 
> 
> 

The set of "required" FISONs is empty.

That doesn't mean we can't build an infinite set of FISONs whose union 
is the set of Natual Numbers.

We can in fact build an infinite set of infinite sets of FISONs whose 
union is the set of Natural Numbers, it just is a fact that no single 
FISON is in all of them, so none are "required"

The fact that you can't understand that FACT, just shows your stupidity.

Do you disagree that the union of all FISONs that end in a odd number 
will cover N, if not what number doesn't get covered.

By the same token, the union of all FISONs that end in a even number 
will cover N.

Thus, no individual FISON is needed, we just need to select an infinite 
set of FISONs to cover N.

Your failure to process that statement and even try to refute it says 
that you know in the back of your head that you are wrong, but you won't 
listen to that voice, and thus make yourself an idiot.