The Setting
Number the configurations of a clocked randomized machine so that every step goes from a smaller number to a larger one, and weight each transition by its probability. The weights form a strictly forward substochastic matrix . The total weight of the forward paths from to is the entry of the finite sum , and solves .
The exact correction and copy hierarchy starts from such a matrix on a finite set of nodes, with entries at most a rate . In place of it iterates the equation with a cutoff at scale applied entry by entry, and a residual measures how far a matrix is from solving that equation.
Nodes and Matrices
A finite domain is a finite set of natural numbers, called nodes.✦ A real vector is a function assigning a real number to each node .✦ A matrix is a function assigning a real number to each pair of nodes, its entry in row and column .✦
The row weight of a matrix at a node over a finite domain is the sum of the entries of row in the columns of , (1)✦
The product over a finite domain of matrices and is the matrix with entries (2)✦ and the combined matrix of and over is .✦
The Cutoff
The clamp of a real number to is .✦ For reals and , the shoulder function with corner and width is the real function (3)✦ The cutoff scale is the constant .✦
Parameter Constants
The constant is ✦, and is the map on the reals.✦ An iteration count is admissible when it is a positive integer with .✦ The parameter constants are four natural numbers, an admissible iteration count , a number of copies and two parameters and , such that (4)✦
The Claim
Definition 1. For finite domains and , the second called the active set, and reals and , a bounded support matrix for is a matrix such that for all nodes and (5)✦ we write for the set of them. A step matrix on at rate is a bounded support matrix with active set and bound : (6)✦ A stage is a quadruple (7)✦ of parameter constants , a level , a finite domain and a matrix . The cutoff is the shoulder function with corner and width , (8)✦ and for every real it satisfies (9)✦ (10)✦ For a rate and a vector , the correction of a matrix is the matrix (11)✦ For a finite domain , a rate , a vector and a matrix , the iterated corrections are the matrices given by (12)✦ The residual over of a matrix against is the matrix (13)✦
In the paper, the result reads: a stage has a finite ordered vertex set , a rate and a nonnegative strictly forward matrix with and ; is a nondecreasing Lipschitz cutoff with , its and being and here; and , , and . The paper’s conditions on are those of a step matrix in .
What Is Checked
The definitions and the two bounds on are stated over finite domains of nodes, real vectors and matrices on the nodes, the row weight (1), the product and the combined matrix over a finite domain (2), the clamp and the shoulder function (3), the constant , and the parameter constants (4) with , and the admissible iteration counts.