The Setting
Let a complex vector mass sit at each index of a square grid at the finest dyadic scale . Paths of refinement descend from a vertex of a coarser level to the finest grid, one vertex per level, and each path carries the mass at its end multiplied by a weight for every step. Grouped by their initial segments, the paths from one vertex form a tree, and the mass of a node, the norm of the vector it collects, can be less than the masses of its children together, since their vectors cancel. The item replaces the tree by particles indexed by a path and a birth level, weighted by the fractions of mass that survive each branching, and locates in the plane the paths of nonzero mass.
Trees, Masses and Charges
Fix a finite index set and a normed abelian group . A finite tree over with vectors in is either a leaf, carrying a vector of , or a branch node with one subtree for each .✦ Its nodes are addressed by finite words over : the root is the empty word , and is the child of . A terminal path is the address of a leaf. For a word of length we write for its prefix of length , the node at depth on the path.
The total vector of is the sum of the vectors at its leaves.✦ We write for the total vector of the subtree at the node and for its node mass, so that is the vector at the leaf . The terminal mass of is the sum of the norms of its leaf vectors✦, and a terminal path is active when .✦
The survival fraction of a branch node is the norm of the sum of the total vectors of its children divided by the sum of their norms: (1)✦
For a real function on the nodes of , the node charge of is the sum over all nodes, branch nodes and leaves, of the node mass times ✦; the path charge of is the function of a word over and a level that sums over the prefixes of of length at least : (2)✦
The particle evaluation of assigns to a real function of a word over and a level the number (3)✦ where runs over the terminal paths of and the factor is read as for . Each term is a particle born at the node and running to the leaf ; the terms with form the root evaluation, the particles born at the root, and the others the late evaluation.
Mark Trees on the Dyadic Grid
For , the grid is the square index box of half-width , the set of indices with and .✦ Fix a finest scale . The dyadic scale of level is ✦, and the grid point of index at scale is the point of with coordinates and .✦ The box norm of is .✦ The tent is the function on ✦, and the hat of index at scale is the function on (4)✦
Let vector masses be given at the indices , and a real weight for each step from an index to an index . For a level , a real weight and a root , the mark tree is the tree over with vectors in whose terminal paths are all sequences in , the leaf at carrying the vector (5)✦ The vertex of such a path, reached after steps, lies at level , at the grid point , and is the last vertex of the path.
The Claim
Theorem 1. Let be a finite tree over a finite index set with vectors in a normed abelian group, and a real function on its nodes. Then the particle evaluation of the path charge of is the node charge of : (6)✦ Let vector masses and step weights be given on , and let . Then the mark trees of level and weight satisfy (7)✦ Let moreover , and . If is an active terminal path of , then for (8)✦ If , is an active terminal path of and is a point with , then for (9)✦
In the paper, the result reads: there is a finite positive measure on pairs of a terminal path and a birth level such that for every node at level , in particular and the total mass of is , the terminal position satisfies for , and the path is defined also before birth, where the levels are counted from the coarsest with scales , the vertices are points of the plane, is the level mass at , the sum of the level masses at the finest level , and the total mass of the vector measure .
In the library, the particle evaluation stands for integration against . With , the vertex of has the scale .
What Is Checked
The claim is stated over finite trees over a finite index set with vectors in a normed abelian group, with their total vectors, node masses, survival fractions (1), node and path charges, particle evaluation and active terminal paths, and over the mark trees of vector masses on the grid , placed in the plane by the dyadic scales, the grid points, the box norm and the hats (4).