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: Mon, 3 Feb 2025 19:39:28 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <936ee906b144a8ead8a47b53426610836830f9e9@i2pn2.org>
References: <vmo1bs$1rnl$1@dont-email.me> <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>
 <c50fde56e7e0c4cf4842d4944ea3d1917c75eb41@i2pn2.org>
 <vnfftp$2rv3t$1@dont-email.me>
 <680d4249c9bf1504231a53732ac5096184261495@i2pn2.org>
 <vngk12$31ud4$5@dont-email.me>
 <5cc37d5ccc25d192843fcaf87e7418be0e9c5136@i2pn2.org>
 <vni8b7$3f2gg$3@dont-email.me>
 <b3661d4e001c1467c1121af3f013304666ac40bf@i2pn2.org>
 <vnl5dv$3ae6$2@dont-email.me>
 <080c854de10093669d87615694e51dd052ed2394@i2pn2.org>
 <vnlog6$6dbv$2@dont-email.me>
 <bf10f777d4005fb3ee28e246cbe0245d554223d3@i2pn2.org>
 <vnnl8v$kkq0$1@dont-email.me>
 <80abaa335fdefb7dfd2cf4694a8bc1eba7f3eecd@i2pn2.org>
 <vno6rg$nm9i$4@dont-email.me>
 <fdb7f19edfab2141f518d74f00df194616d16121@i2pn2.org>
 <vnqmar$1a7ie$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 4 Feb 2025 00:39:30 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2571638"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <vnqmar$1a7ie$1@dont-email.me>
Content-Language: en-US
Bytes: 3087
Lines: 34

On 2/3/25 10:11 AM, WM wrote:
> On 02.02.2025 21:11, Richard Damon wrote:
> 
>> Since I don't recall you actually DEFINING what A(n) means, any 
>> assumption about it would be unwarranted.
> 
> German A(n), or English F(n) is the FISON {1, 2, 3, ..., n}.
> The assumption is that U(F(n)) = ℕ.

Then why did you change your notation.

You are just using the typical techiques of scammers and charlatons.

And if U is supposed to be the Union, that statement is just incorrect, 
there is no SINGLE FISON (your F(n) ) that makes the set of the Natural 
Numbers. After all, the input to the union operator is a collection of 
sets, not just a single set which is what F(n) would be.

What you need to do is take the union of a lot of set, in fact, and 
infinite number of them.

So, U(F(n), F(n+1), F(n+2), ...) would be N, not just U(F(n))

> 
> By induction we prove that every F(n) can be removed without changing 
> the union. Therefore the assumption leads to { } = ℕ. Therefore the 
> assumption is wrong.

No, you prove that ANY FISON can be removed, not that ALL can be.


> 
> Regards, WM

All you are doing is proving your math is just sloppy, and broken,