The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Matheology � 233
Replies: 37   Last Post: May 12, 2014 10:24 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 18,076
Registered: 1/29/05
Re: Matheology § 233
Posted: Mar 30, 2013 9:38 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 29 Mrz., 19:34, Virgil <> wrote:

> > So we have established the fact that an irrational number has no node
> > of its own.

> No number in any infinite binary tree has any node "of its own", as
> every node has two child nodes belonging to necessarily different
> numbers.

That is correct, but only establishes the fact that no actually
infinite path can be distinguished from all rational paths as should
be possible in a Cantor-list - but is not.

> > The first bit causes that the anti-
> > diagonal differs from 2^-1 of all entries and agrees with 2^-1, the
> > second bit leaves 2^2 entries and the n-th bits leaves 2-^n entries of
> > the list agreeing with the anti-diagonal. There is no bit that would
> > leave zero entries agreeing with the diagonal, since there is no bit
> > at position infinity.

> Thus there is always at least one bit of any listed entry disagreeing
> with the antidiagonanl, just as the Cantor proof requires.

In a list containing every rational: Is there always, i.e., up to
every digit, an infinite set of paths identical with the anti-
diagonal? Yes or no?

Regards, WM

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.