On Jun 10, 11:44 am, WM <mueck...@rz.fh-augsburg.de> wrote: > On 9 Jun., 18:34, William Hughes <wpihug...@hotmail.com> wrote: > > > On Jun 9, 11:46 am, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > > And uncountably many X through every node. > > > Let us choose one of them and map it one that node. For the others we > > > will find other nodes, below that one chosen. > > > Nope. You cannot find enough other nodes. There are uncountably many > > paths > > going through the node and only countably many nodes below it. >
<snip non sequitur>
We are discussing your statement:
Let us choose one of them and map it one that node. For the others we will find other nodes, below that one chosen.
Please indicate the first line you disagree.
- There is more that one path through "that node"
- There are countably many nodes below "that node"
- Assuming that "For the others we will find other nodes, below that one chosen" is equivalent to assuming that there are only countably many paths through "that node"
- You are trying to prove that there are countably many paths through the root node.
- This is equivalent to proving that there are countably many paths through "that node"
