The Setting
Along the filter that chooses the signs in the Euclidean Steinitz-Bergström theorem, a matrix records the variation accumulated so far, and each step of the filter changes it at an energy cost. The same sequence of steps, a run, can be observed at every dyadic scale , with an integer, its energy weighted by . The question is whether these weighted energies, summed over many scales, stay below a fixed multiple of the traces of the starting matrix and of what the steps add, however many scales are taken.
Moves and Their Energy
Fix a finite set ; a state is a real matrix. A move on is a pair of real matrices, its contraction and its gain , acting on a state by (1)✦ A move is admissible if is a contraction, , and its gain is positive semidefinite.✦
A run is a finite sequence of moves; from a state it passes through the states and . The energy of a run from a state is the sum of the costs of its moves at the states they act on, (2)✦ where is the cost of the move at the state .
The total gain of a run is the sum of the traces of its gains, , where is the gain of .✦ For a real number , the rescaling of a move by is the move , and rescales every move of a run by .✦
The Claim
Theorem 1. Let be a positive semidefinite real matrix, let be a run of admissible moves, and let be a finite set of integers. Then (3)✦
In the paper, the result reads for a constant , the sum running over dyadic scales , which stand where the page has , of the scale-weighted energies .
What Is Checked
The claim (3) is stated over real square matrices indexed by a finite set : a positive semidefinite start , a run of moves (1) that are admissible, the energy (2) of a run from a state, the rescaling of gains and the total gain , with the scales indexed by a finite set of integers.