Re: abundance of irrationals!)

Virgil said:
> In article <MPG.1cec30755c89b41b989c26@xxxxxxxxxxxxxxxxxxxxxxxxx>,
> Tony Orlow (aeo6) <aeo6@xxxxxxxxxxx> wrote:
>
> > Virgil said:
> > > In article <1115808674.466909.326260@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
> > > mueckenh@xxxxxxxxxxxxxxxxx wrote:
> > >
> > > > Russell wrote:
> > > >
> > > > > No. The obvious linear enumeration of *nodes* is not an
> > > > > enumeration of the reals. For that, you need to enumerate
> > > > > the different paths. That's not merely a rearrangement of
> > > > > the enumeration of nodes; if you think it is, then please
> > > > > tell us how you associate each node with one and only one
> > > > > path. Can't be done.
> > > >
> > > > Tell us how you associate Cantor's antidiagonal with one and only one
> > > > line, e.g., where it ends. Cant't be done.
> > > >
> > > > But the nodes can be shown to be not less than the paths.
> > >
> > > I challenge you to show this. I claim that one can ennumerate the nodes
> > > but not the paths.
> > >
> > > Each node can be represented by a finite string of zeros and ones, the
> > > root node by one digit string, "1", and given any finite string, "s",
> > > representing a node, the left and right nodes at the next level by "s0"
> > > and "s1", respectively.
> > >
> > > Since interpreting these as binary integers counts them, they are
> > > countable.
> > >
> > > For the infinite strings needed to represent paths, a somple diagonal
> > > costruction will show that no list can be complete.
> > >
> > >
> > >
> > > > It is not
> > > > possible to say which node belongs to some single path.
> > >
> > > Why not?
> > >
> > There is a 1-1 correspondence between the points and lines, the nodes and
> > branches. You have not specified exactly what you mean by branch, so i will
> > define it as a line connecting two nodes.
>
> In a binary tree, a "branch" is a directed line segment joining two
> nodes, with the direction being away from the root node.
>
> > Perhaps you mean a string of such
> > connections, in which case that is also specified by the string of digits
> > denoting each number, 0 for left branch and 1 for right.
>
> That would be a path. A maximal path is one which starts at the root
> node and either ends at a terminal node from which no further branches
> extend, or does not stop at all.
>
> In an infinite binary tree (with no finite maximal paths) every maximal
> path contains an infinite sequence of branches.
>
> Each node corresponds to the finite path starting at the root node and
> ending at the given node, so there are only countably many nodes
> coreesponding to those countably many finite paths.
>
> But there are uncountably many maximal ( and therefore inifinte) paths
> in an infinite binary tree as defined above.
>
Holy cow!! Do you ever listen to yourself, or critically examine what you are
told?

You have infinite maximal paths, with branches infinitely far from the root
node, but the nodes they connect are a finite distance from the root? When this
maximal path has an infinite series of branches, what is between each
subsequent pair of those branches? A node. Is it farther from, or closer to the
root, than the branches? It's between them, farther than the parent node and
closer than the child. If the breanches are infinitely many steps from the
root, is the node a finite number? And you maintain this infinite tree, with
infinite series of branches, contains no nodes that are infinitely far from the
root, even though each node is DEFINED by the path to it from the root?

This is almost enough to make me drink the water, or maybe something stronger.
--
Smiles,

Tony
.

Relevant Pages

  • Re: Cantor and the binary tree
    ... Rather, each one leads to another (unending, infinite) subtree. ... But for this new tree and each of its nodes the ... And if the binary tree is maximal as described, for each natural, there ... Given any maximal path in this maximal binary tree, ...
    (sci.math)
  • Re: use of real numbers in mathematics and physics
    ... That is not infinite information. ... The pure states then become singular distributions ... > The root of the problem is then addressed by noting that the p's ... > a way framework which will allow for the Bekenstein bound or something ...
    (sci.physics.research)
  • Re: Cantor and the binary tree
    ... >>> the other remains countably infinite. ... Assume a binary tree in which each node is a parent and has a left-child ... Given any node, let the root node be labeled 1 and thereafter, on the ...
    (sci.math)
  • Re: Cantor Confusion
    ... far away from the root. ... infinite tree, because that contains edges that are *not* finitely far ... difference between the union of all finite trees and the infinite tree. ... The situation with the rationals is quite different, ...
    (sci.math)
  • Re: abundance of irrationals!)
    ... A maximal path is one which starts at the root ... >>> path contains an infinite sequence of branches. ... > tree is by a finite sequence of braches and nodes. ...
    (sci.math)