Deutsch   English   Français   Italiano  
<vhv1ls$275ti$1@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder2.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: WM <wolfgang.mueckenheim@tha.de>
Newsgroups: sci.math
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
Date: Mon, 25 Nov 2024 13:11:26 +0100
Organization: A noiseless patient Spider
Lines: 80
Message-ID: <vi1phf$2n5v2$1@dont-email.me>
References: <vg7cp8$9jka$1@dont-email.me> <vhdl0k$qltl$1@dont-email.me>
 <vhfqcv$1adld$1@dont-email.me> <vhfso7$1bik6$1@dont-email.me>
 <vhg0h8$1adlc$4@dont-email.me> <vhgd9j$1eq8t$1@dont-email.me>
 <vhgebm$1eu67$2@dont-email.me> <vhgfo7$1f8j9$1@dont-email.me>
 <vhiak4$1sjsn$2@dont-email.me>
 <094dadad718eaa3827ad225d54aaa45b880dd821@i2pn2.org>
 <vhkir2$28qt$2@dont-email.me>
 <3399a95e386bc5864f1cfcfc9f91f48366e0fed2@i2pn2.org>
 <vhlamn$7jan$3@dont-email.me>
 <0d551828411c0588000796fa107a16b1e23a866c@i2pn2.org>
 <vhprpj$15kfd$2@dont-email.me>
 <74bdc0f14fd0f2c6bfd9ac511a37f66b41948ac4@i2pn2.org>
 <vhq5ov$1793m$2@dont-email.me> <4205d073-bdac-4a54-a651-b9def098ced0@att.net>
 <vhsas8$1krl6$5@dont-email.me> <46baa73d-2098-4df5-a452-a746b503d8d6@att.net>
 <vhtesh$1rdku$2@dont-email.me> <07d42710-5af8-44e7-a873-eb2e2c9c2bf6@att.net>
 <vhtjar$1r2tr$5@dont-email.me> <11c85fcd-7f48-4573-ba8e-1509e7173d34@att.net>
 <vhv1b8$1faro$1@solani.org> <347d232a-3c57-4b81-b337-df5146911e6c@att.net>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 25 Nov 2024 13:11:28 +0100 (CET)
Injection-Info: dont-email.me; posting-host="a7c58c094504bce9e445e6065d68f171";
	logging-data="2856930"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+UqJmzZp63yvQiHez6ye0iQ62R9G807CU="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:DcKnVar3q6JtLdnhoPTehHI9PNc=
In-Reply-To: <347d232a-3c57-4b81-b337-df5146911e6c@att.net>
Content-Language: en-US
Bytes: 4295

On 24.11.2024 19:16, Jim Burns wrote:
> 
>>>>> On 11/23/2024 3:45 PM, WM wrote:

>> for every interval (0,n]
>> the relative covering is 1/10,
>> independent of how the hats are shifted.
>> This cannot be remedied in the infinite limit
>> because
>> outside of all finite intervals (0, n]
>> there are no further hats available.
> 
> All the hats for which
>   if there are G.many then there are G^G^G.many
> are enough to "remedy" the 1/10.relative.covering

Not at all!
> 
> If each G can match G^G^G

That is a false assumption.
If there are enough hats to cover G then there are enough hats to cover 
G^G^G. G does not cover G^G^G.

> Matching.a.proper.subset is
> the sort of behavior which permits Bob to disappear
> with enough room.swapping _inside_ the Hotel.
> 
> You (WM) treat that behavior as proof that
> we are wrong and you (WM) are right.

I accept logic. Exchange of two elements never leads to loss of one of 
them. You do not.

> What it is  is proof that
> not all sets behave like finite sets.

Nonsense. Logic is also prevailing in infinite sets.

> If there are enough hats for G natural numbers,
> then there are also enough for G^G^G natural numbers.
> 
> The number G^G^G is not.first for which
> there are NOT enough hats.

There is no such number because the set of definable hats is potentially 
infinite.

> Therefore,
> the number G^G^G is not.first for which
> there are NOT enough hats.

We do not disagree. Therefore you need not prove a difference for G and 
G^G^G.
> 
> A similar argument can be made for
>   each natural number.

No, it can be made for each definable natural number, i.e., for a number 
belonging to a tiny finite initial segment which is followed bay almost 
all numbers.

>>> Consider the set of natural numbers for which
>>> there are NOT enough hats.
>>
>> It is dark.
> 
> It is not dark what we mean by 'natural number'.
> A natural number is countable.to from.0

That is a definable number.
> The natural numbers "fail" at
> being finitely.many.
> It is nothing more than that.

If they are infinitely many but complete, then they and their number 
don't vary. |ℕ| - 1 < |ℕ| < |ℕ| + 1.

Regards, WM