Search All of the Math Forum:

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

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

Topic: Matheology § 258
Replies: 2   Last Post: May 1, 2013 4:12 PM

 Messages: [ Previous | Next ]
 Alan Smaill Posts: 1,103 Registered: 1/29/05
Re: Matheology § 258
Posted: May 1, 2013 4:07 PM

Virgil <virgil@ligriv.com> writes:

> In article
> WM <mueckenh@rz.fh-augsburg.de> wrote:
>

>> On 1 Mai, 11:15, Dan <dan.ms.ch...@gmail.com> wrote:
>> > > It is necessary for Cantor's proof. Unless every digit exists on the
>> > > diagonal, the diagonal number is undefined in an undefined list. But
>> > > that is Cantor's claim: forall n : a_nn =/= d_n.

>> >
>> > It exists "as formula" , whether or not you know the formula .

>>
>> There are only countably many formulas. If all diagonals exist as
>> formulas, then all belong to a countable set.

>
> But if there were only countably many reals, one only needs countably
> many formulas to find the nth digit of the nth real.

In fact WM tells us that there is a single finite description
P(n,m) of the paths through the binary tree such that for every
pair of naturals n,m, P(n,m) characterises the nth digit of
the mth path.

--
Alan Smaill

Date Subject Author
5/1/13 Alan Smaill
5/1/13 Virgil