Re: Cantor and the binary tree



Robert Kolker wrote:

> mueckenh@xxxxxxxxxxxxxxxxx wrote:
>
>> of paths always equals that of the nodes + 1. It is simply impossible
>> to assume that one of these numbers becomes uncountably infinite while
>> the other remains countably infinite.

"becomes"? Muck's fuzzy metaphors are sabotaging him again.
The fact is that the nodes in this tree form a countable
set and the paths form an uncountable set. "becoming"
has nowt to do with that.

>
> Wrong. 2^(aleph_0) > aleph_0.
>
> List all the infinite binary sequences with a bijection to the integers.
> Now flip the n-th digit of the n-th sequence in the list. This cannot
> occur anywhere in the list. Contradiction. Such a bijection to the
> integers does not exist.

One can hardly imagine a simpler mathematical proof. Alas, it's still
beyond the limits of Muck's feeble intellect :-(

--
Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html
"Elegance is an algorithm"
Iain M. Banks, _The Algebraist_
.



Relevant Pages

  • Re: Cantor and the binary tree
    ... to assume that one of these numbers becomes uncountably infinite while the other remains countably infinite. ... List all the infinite binary sequences with a bijection to the integers. ...
    (sci.math)
  • Re: infinity
    ... >>> some mapping between members to be compared. ... >> that bijection comes first. ... >> If either the number of characters in the alphabet or the string ... > If you either allow an infinite alphabet or infinite strings? ...
    (sci.math)
  • Re: Infinite Binary Strings: A Question
    ... counting is seen as the implementability of a bijection. ... But in the context of infinite sets of integers or reals, ... just as the rationals do, ...
    (sci.math)
  • Re: Galileos Paradox
    ... set theory. ... There are sets that are both infinite ... but without a bijection between them. ... the mapping: ...
    (sci.math)
  • Re: Well Ordering the Reals
    ... and instead compare the strings ... > infinite strings. ... > bijection involves a contradiction, ... there is nothing wrong with infinite bitstrings. ...
    (sci.math)