Re: Infinte strings of digits
From: Mike Oliver (mike_lists_at_verizon.net)
Date: 09/19/04
- Next message: wang: "Re: A Simple Boolean Expression Problem"
- Previous message: Denis Feldmann: "Re: JSH: Just plain silly"
- In reply to: N. Silver: "Re: Infinte strings of digits"
- Next in thread: Peter Webb: "Re: Infinte strings of digits"
- Reply: Peter Webb: "Re: Infinte strings of digits"
- Reply: Alan Stern: "Re: Infinte strings of digits"
- Messages sorted by: [ date ] [ thread ]
Date: Sun, 19 Sep 2004 16:48:37 -0500
N. Silver wrote:
> Mike Oliver wrote:
>
>
>>But that isn't what you get, from the "intermediate
>>step"! What you get is a bijection between the
>>set of *representatives* for equivalence classes,
>>and R. Not the same thing at all.
>
>
> Since the sequences in each equivalence class
> are a countable set, yes it is.
No it isn't. It does *imply* the existence
of such a bijection, using the Axiom of Choice,
but it doesn't let you *construct* one, in
the sense I suspect Peter was looking for.
In fact no "reasonably definable" such bijection
exists. That's the interesting mathematical
point to be seen here, and it can be quite well-formulated
at the level of formality from Peter's original
post.
- Next message: wang: "Re: A Simple Boolean Expression Problem"
- Previous message: Denis Feldmann: "Re: JSH: Just plain silly"
- In reply to: N. Silver: "Re: Infinte strings of digits"
- Next in thread: Peter Webb: "Re: Infinte strings of digits"
- Reply: Peter Webb: "Re: Infinte strings of digits"
- Reply: Alan Stern: "Re: Infinte strings of digits"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|