On Nov 26, 11:00 am, William Hughes <
wpihug...@gmail.com> wrote:
> On Nov 25, 6:24 pm, Graham Cooper <
grahamcoop...@gmail.com> wrote:
>
> > On Nov 26, 8:11 am, William Hughes <
wpihug...@gmail.com> wrote:
> > > Actually the third line should read
>
> > > the 2rd digit of mr =/= r3
>
> > > > You only need a wDIAGONAL to prove the same result as Cantor's Proof.
>
> > > Yep (but you do need every digit specified)
>
> > > > THEOREM1: Cantor's Main Diagonal is a special type of wDIAGONAL
>
> > > Yes, in particular every element of the main diagonal is specified.
>
> > > Have I pulled enough teeth yet?
>
> > E(d): r1_d = wDIAGONAL_d
>
> Note that this puts a constraint on wDIAGONAL
> We cannot have for all n in N, wDIAGONAL_n =/= r1_n
Right! This also holds in Cantor's proof for the MainDiagonal.
>
> > E(e): r2_e = wDIAGONAL_e
> > E(f): r3_f = wDIAGONAL_f
> > ...
>
> > A(o): wDIAGONAL_o = 0 OTHERWISE
>
> Clearly I have not pulled enough teeth yet.
> Please get to the point.
Let's call THE wDIAGONAL PROOF the following deduction sequence:
[1] Given any list of reals: r1, r2, r3...
[2] Construct a wDIAGONAL
E(d): r1_d = wDIAGONAL_d
E(e): r2_e = wDIAGONAL_e
E(f): r3_f = wDIAGONAL_f
...
A(o): wDIAGONAL_o = 0 OTHERWISE
[3] Construct ANTI(wDIAGONAL) .... add 5 mod 10 to each digit
[4]
E(d): r1_d =/= ANTI(wDIAGONAL)_d
E(e): r2_e =/= ANTI(wDIAGONAL)_e
E(f): r3_f =/= ANTI(wDIAGONAL)_f
...
[5] A(n): rn =/= ANTI(wDIAGONAL)
[6] ANTI(wDIAGONAL) is not in the list r1, r2, r3...
[7] The list r1, r2, r3... is incomplete
[8] By Universal Generalisation, since rn is any arbitrary real
no list of reals can be the complete set of reals.
OK 1 more step if you agree with the above proof!
Herc