The Setting
The filter is a sequence of steps, each of which moves a positive semidefinite matrix: the step contracts it and then adds a positive semidefinite gain. Over a stretch of steps an initial matrix becomes a final matrix , the sum of two parts: the matrix that becomes under the contractions alone, and the accumulated gain , the gains added on the way, each contracted by the steps after it.
The size of such a matrix is measured by the trace of a potential applied to it. The question is how far can exceed when the stretch spends little energy , the energy cost defined below.
Moves, Runs and Their Costs
All matrices are real and square, indexed by a finite set ; is the identity, the transpose of , and the Loewner order.
A move is a pair of such matrices, its contraction and its gain , and it sends a matrix to .✦ A move is admissible if and its gain is positive semidefinite.✦
A run is a finite list of moves, with . From a matrix it passes through the states (1) and its final state is .
The cost of a move at a matrix is the energy charged for applying to , and the energy cost of the run from is the sum of the costs of its moves at the states (1) it passes through, (2)✦
The gain value of a positive semidefinite matrix is a real number, the quantity by which the gain part of the energy is measured. The gain cost of the run from is the gain part of the energy: the sum of the changes in as each gain is added to the contracted state, (3)✦
Following the run from a pair of matrices leads to the pair given by , and (4)✦ For a positive semidefinite matrix , following the run from leads to the pair .
The Potential
The exponent is the real number ✦, and the gain constant is ✦. The weight is the real function given by ✦, and the potential is the real function (5)✦ The size weight is the real function given by .✦
A real function acts on a symmetric matrix through the functional calculus, on its eigenvalues. The potential trace of a matrix is , the trace of the matrix .✦
The Claim
Theorem 1. (i) Let be a positive semidefinite matrix, a run of admissible moves, and the pair reached by following the run from . Let be a real number with , and put . If the gain cost of the run from is at most , then (6)✦
(ii) Let and be positive semidefinite matrices and a real number with and . Then (7)✦
(iii) Let , the run, , and be as in (i), and let be the final state of the run from . If the energy cost of the run from is at most , then (8)✦
In the paper, the result reads: if the energy is at most , where , and , then , and for a constant .
What Is Checked
The claim is stated over runs of admissible moves from a positive semidefinite matrix, with the energy cost and the gain cost of a run, its final state and the pair reached by following it, and over the potential with its weight , the size weight , the potential trace and the constants and .