LudovicoVan
Posts:
3,201
From:
London
Registered:
2/8/08


Re: Cantor's first proof in DETAILS
Posted:
Nov 12, 2012 1:20 PM


"LudovicoVan" <julio@diegidio.name> wrote in message news:k7rehn$rci$1@dontemail.me... > "Zuhair" <zaljohar@gmail.com> wrote in message > news:86a85cce2a844c9fb860527958274b50@o8g2000yqh.googlegroups.com... > >> Let a_0 = x_0 >> Let b_0 be the first entry in (x_n) such that b_0 > a_0. >> Let a_i+1 be the first entry in (x_n) such that a_i < a_i+1 < b_i. >> Let b_i+1 be the first entry in (x_n) such that a_i+1 < b_i+1 < b_i. > > In Cantor's proof a_{i+1} and b_{i+1} are the two first entries > encountered
That should read: a_{i+1} and b_{i+1} are the first two entries...
LV
> (in any order) in (x_n) *after* the entries corresponding to a_i and b_i. > This does not seem to be the case with your proof, where it instead seems > that entries are just picked every time restarting from the beginning of > (x_n). > > Could you clarify? I'd like to be sure before I proceed reading it...

