paradox of the binary tree

The complete infinite binary tree is a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two children which are not children of any other node. The tree serves as binary representation of all real numbers of the interval [0,1] in form of paths, i.e., sequences of nodes.

Every finite binary tree with more than one level contains less paths than nodes. Up to level n there are 2^n paths and 2^(n+1) - 1 nodes.

Every finite binary tree can be represented as an ordered set of nodes, enumerated by natural numbers. The union of all finite binary trees is then identical with the infinite binary tree. The paradox is that, while the set of nodesremains countable as is the set of paths of all finite trees, the set of paths in the infinite tree is uncountable by Cantor’s theorem. (On the other hand, the paths are separated by the nodes. As no path can separate itself from another path without a node, the number of separated paths is the number of nodes.)

Literature: W. Mückenheim: Die Mathematik des Unendlichen, Shaker-Verlag, Aachen 2006.

单词	ParadoxOfTheBinaryTree
释义	paradox of the binary tree The complete infinite binary tree is a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two children which are not children of any other node. The tree serves as binary representation of all real numbers of the interval [0,1] in form of paths, i.e., sequences of nodes. Every finite binary tree with more than one level contains less paths than nodes. Up to level n there are 2^n paths and 2^(n+1) - 1 nodes. Every finite binary tree can be represented as an ordered set of nodes, enumerated by natural numbers. The union of all finite binary trees is then identical with the infinite binary tree. The paradox is that, while the set of nodesremains countable as is the set of paths of all finite trees, the set of paths in the infinite tree is uncountable by Cantor’s theorem. (On the other hand, the paths are separated by the nodes. As no path can separate itself from another path without a node, the number of separated paths is the number of nodes.) Literature: W. Mückenheim: Die Mathematik des Unendlichen, Shaker-Verlag, Aachen 2006.
随便看	BertrandsConjectureProofOf BertrandsProblem there are an infinite number of primes ≡1⁢@⁢ERROR(\symoperators)⁢m⁢o⁢d⁢ERROR(\tmspace)+.1667⁢e⁢m⁢ERROR(\tmspace)+.1667⁢e⁢m⁢m there are an infinite number of primes ≡±1⁢@⁢(ERROR(\symoperators)⁢m⁢o⁢d⁢4) ThereAreNoNonsquareDoublyStochasticMatrices there are no non-square doubly stochastic matrices ThereExistAdditiveFunctionsWhichAreNotLinear there exist additive functions which are not linear ThereforeSign therefore sign ThereIsAUniqueReducedFormOfDiscriminant4nOnlyForN12347 there is a unique reduced form of discriminant -4⁢n only for n=1,2,3,4,7 The Rezk completion TheRingOfIntegersOfANumberFieldIsFinitelyGeneratedOvermathbbZ the ring of integers of a number field is finitely generated over ℤ TheSetOfAllRealTranscendentalNumbersIsUncountable the set of all real transcendental numbers is uncountable TheSetOfPrimeIdealsOfACommutativeRingWithIdentity the set of prime ideals of a commutative ring with identity TheSphereIsIndecomposableAsATopologicalSpace the sphere is indecomposable as a topological space The structure identity principle TheSumOfTheValuesOfACharacterOfAFiniteGroupIs0 the sum of the values of a character of a finite group is 0 The surreal numbers