Archive for February 2012
This post is part of a series
When the binary tree was presented in the context of discrete calculus, the following small section of the tree was illustrated to establish the way the nodes are labelled
Two sets of coordinates were introduced on the binary tree:
- Cartesian coordinates
- Graph coordinates
The following illustrates the binary tree when we zoom out a bit:
Cartesian coordinates were defined such that
Although Cartesian coordinates often help to relate discrete calculus to continuum calculus, the expressions are often not the most natural to work with when performing computations. One reason for this can be understood by overlaying the Cartesian coordinate lines onto the binary tree.
On the other hand, graph coordinates are defined such that
Computations are often cleaner when using graph coordinates. One reason for this can be understood by overlaying the graph coordinate lines onto the binary tree.
For instance, the commutative relations in graph coordinates are given by
whereas the commutative relations for Cartesian coordinates are given by
The cross commutative relations between the two sets of coordinates are given by
As a final note, for any discrete 0-form , the above indicates that