Re: Well Ordering the Reals
- From: Virgil <ITSnetNOTcom#virgil@xxxxxxxxxxx>
- Date: Wed, 09 Nov 2005 13:44:27 -0700
In article <MPG.1ddbfa626c13cef198a690@xxxxxxxxxxxxxxxxxxxxxxxxx>,
Tony Orlow <aeo6@xxxxxxxxxxx> wrote:
> Daryl McCullough said:
> > Virgil says...
> >
> > >Since TO's alleged "apparent bijection" is merely an artifact of
> > >TO's delusions, and has no existence in real mathematics, it is
> > >certainly no big thing in mathematics.
> >
> > Actually, I think Tony is thinking (in his web page) of an
> > enumeration of a dense subset of the reals. That is, for any two
> > distinct reals r_1 and r_2 there is a real r in his set such that r
> > is between r_1 and r_2. He seems to think that this well-orders the
> > reals, when it actually just well-orders a countable subset.
> Well, that is what I am asking. How does one prove that such an
> ordered subset actually includes ALL the reals, rather than just the
> rationals or some other type of real? I don't think this enumeration
> misses one point on the line, but how do I prove this?
One method, based on Dedekind's construction, suggests itself:
Show that for every non-empty set of your numbers which is bounded above
(below) there is a least upper bound (greatest lower bound) in your set
of numbers.
.
- References:
- Re: Well Ordering the Reals
- From: Robert Low
- Re: Well Ordering the Reals
- From: Tony Orlow
- Re: Well Ordering the Reals
- Prev by Date: Re: Well Ordering the Reals
- Next by Date: Re: Well Ordering the Reals
- Previous by thread: Re: Well Ordering the Reals
- Next by thread: Re: Well Ordering the Reals
- Index(es):
Relevant Pages
|
Loading