The Setting
Consider a finite label set and injective maps , for , into a set ; write . An active set for a sequence of subsets of is a finite subset of such that each of its points belongs to some and fails to belong to some . For a finite region , the boundary token count in (1) counts labels that enter or leave between consecutive times, where denotes the indicator of : (1)
For a scalar coordinate , a nonnegative error bound , and real thresholds , the three strips in are the inverse images under of the closed intervals in (2): (2)
A planar point is an ordered pair of real numbers, so the plane is .✦ The scalar product of and the squared Euclidean norm of are given by (3): (3)
The Claim
Theorem 1. For finite subsets and arbitrary subsets , (4)✦
Let be injectively labelled as above, let be active, and let be finite. Suppose and functions satisfy and for all and . Suppose also that, for every such and , membership in is given by . With and as in (1) and (2), (5)✦
For planar maps , let be active and let be finite. Suppose , and vectors satisfy for every . Suppose for every , and membership in on is given by . With and in (2), (6)✦
In the paper, the result reads: for finite , bounded open , and with on , let be strictly separated cuts of equal cardinality, , with unit vectors satisfying , choose a bijection from the lost points to the gained points at each step, let count the resulting transfers with exactly one endpoint in , and set , , , , and for ; then and , where repeated thresholds are counted repeatedly in the sum.
What Is Checked
The counting statement (4) concerns arbitrary finite sets and three subsets of their ambient set, while the activity statements concern injectively labelled finite configurations and finite regions, with bounded scalar errors in (5) and squared Euclidean bounds from (3) in (6).