re:How to prove the statement without using a array case

From: mathman (mathnucl_at_optonline-dot-net.no-spam.invalid)
Date: 03/09/05


Date: 9 Mar 2005 17:35:10 -0600

Write the set Xk as (Xk0,Xk1,Xk2,...)

Then a countable set can be formed from the union of Xk's as follows:

X00,X01,X10,X02,X11,X20,X03,X12,X21,X30,.......

 Posted Via Usenet.com Premium Usenet Newsgroup Services
----------------------------------------------------------
    ** SPEED ** RETENTION ** COMPLETION ** ANONYMITY **
----------------------------------------------------------
                http://www.usenet.com



Relevant Pages

  • Re: Cantor Confusion
    ... Therefore all combinations form a countable set. ... >>> infinite path is the union of finite paths. ... > But this union is considered an infinite tree. ... > subsets are considered infinite paths. ...
    (sci.math)
  • Re: Cantor Confusion
    ... But the complete infinite binary tree has demonstrably uncountably many ... All possible *finite* subets of this countable set of finite sequences ... Of course there are only finite paths in the union of finite trees. ... of 0.000 to endless strings of binary digits. ...
    (sci.math)
  • Re: Algebraic integer mistake, basic
    ... |maximal subrings of a countable ring without having to appeal to any ... a countable set is a theorem of ZF. ... Denote by Y the union of the Y_n. ...
    (sci.math)
  • Re: Cantor Confusion
    ... Therefore all combinations form a countable set. ... It is the union of the paths of this subset - one of countably many ... But this union is considered an infinite tree. ... union of trees is an infinite tree, and it contains infinite paths. ...
    (sci.math)
  • Re: Countable unions of finite sets w/o choice
    ... from this that a countable union of finite sets is c. ... Since a countable set can be decomposed in a definable ... shoe first. ...
    (sci.math)

Quantcast