The Setting
A finite family of leaf values can be changed one leaf at a time while the root output is recorded. The quantities of interest are the root increments associated with one leaf and with all descendants of a fixed node.
Let be a real normed space and a nonempty convex set. The closed difference subspace and its closed unit ball , viewed as a subset of , are defined by (1); every norm is the ambient norm. (1)
An ordered rooted tree is a family of finite levels , where and , with an order-preserving surjective parent map at every level.✦ Its root is the sole member of .
A weighted ordered tree is an ordered rooted tree with positive real edge weights whose sum over the children of each parent is one.✦ The root path weight of a node is the product of the edge weights along its path from the root, specified by (2).✦ (2)
A tree of nonexpansive maps on and is a family of selfmaps , one for each , all nonexpansive in the ambient norm.✦ For a natural cutoff , the cutoff evaluation of the tree is the root output obtained by repeated weighted child averaging and application of node maps at levels strictly less than .✦ At cutoff zero, evaluation reads the assigned value at the root.
Blocks and Switches
Fix a terminal depth . For , the ancestor map is the composition of the parent maps between these levels, with the identity.✦ The level- descendant block of a node is the finite set in (3). The first and last descendants and of the node and the lower and exclusive upper endpoints and of the block are the indices defined in (3). (3)
Let be a leaf assignment and a common replacement value. For a threshold , the switched leaf assignment and its evaluated root are defined by (4). Decreasing the threshold performs the leaf switches from right to left. (4)
Write for the terminal path weight. The root outputs immediately before and after switching the block are and , respectively, as defined in (5). The normalized leaf switch vector at is defined in the same display. (5)
The Claim
Theorem 1. For the leaf assignment and replacement , the following hold.
Let be a linear subspace containing , and suppose that for all . For every , (6)✦
For every and , (7)✦
In the paper, the result reads: for , let be the consecutive block of depth- descendants of , switch leaves from right to left from to a common , evaluate the actual root after each switch, and, writing for the root outputs immediately before and after switching and for the individual leaf increments, one has and .
What Is Checked
The statements (6) and (7) concern finite cutoff evaluations of a tree of nonexpansive selfmaps of a convex set on a weighted ordered tree, with the subspace and diameter hypotheses in the first part. Every descendant block (3) is nonempty.✦