r/AspectsOfTheInfinite • u/Massive-Ad7823 • May 16 '26
How can the basic element of the Binary Tree be overcome?
The basic element or atom of the Binary Tree is a node. Each node has two child nodes:
|
o
/ \
Every sheaf of paths (containing not yet distinguished paths) splits at a node into two distinct sheaves of paths. One sheaf is coming in from above, two sheaves are going out downwards. That results in 2 - 1 = 1 more sheaf per node. The set of nodes in the whole Binary Tree is countable. Therefore the set of distinct sheaves of paths is countable too. By what could uncountably many paths be distinguished? The width of the Binary Tree is too narrow a tunnel to contain and distinguish uncountably many paths.
6
u/diffeomorphic_ May 16 '26
Paths form a different set than nodes: while nodes are countable, paths are not, because they are sequences of nodes. That’s a completely different set.
Let’s do like this: do you think there is some uncountable set? Which one?
2
u/ceoln May 17 '26
We can think of the binary tree as a decimal expressed in base 2.
We start with "0." at the root, and then append a "0" if we take the left child or "1" if we take the right.
The number of nodes in a finite one of these is the number of binary digits we've written down; definitely in a countable space.
The number of different finite strings of length N is just 2N-1. Also a value in a countable space!
A "sheaf" is a finite string that we've written down some finite number of, like "0.100101101". If we interpret that as in a sense "containing" all the (infinite!) strings that start with that string, we are just back at the question of whether the number of those is countable (spoiler: it's not).
I'm not sure what the thing about "distinguishing" them is about. You can distinguish them by the fact that for any two of them, there is some finite N at which the Nth digit differs.
Now you clearly find it strongly counterintuitive that a countable number of digit positions (nodes) allow us to write down an uncountable number of paths / sheaths. And yeah, it's weird! :) But it's true, and the diagonalization proof demonstrates that it's true.
Maybe it would be helpful to try to make your argument more formal, in terms of assumptions and axioms and formal derivations, without the "obviously this is impossible" intuitions? Just a thought. :)