The Setting
Steinitz-type bounds ask for an order of vectors with zero sum in which every prefix sum is short, and vector balancing gives signs under which every signed prefix sum is short. The lemma turns a signing into an order, for vectors in any real normed space attached to the terms of a sequence. Take a set , a map , a sign function and a finite sequence of elements of . For , the unsigned prefix sum and the signed prefix sum of the sequence are (1)
The Signed Reordering
The signed reordering of a finite sequence of elements of a set , with respect to a sign function on , is the sequence of the same terms that lists first those of sign , in increasing order of index, and then those of sign , in decreasing order of index.✦ With the indices with and those with , it is (2)✦
The Claim
Theorem 1. Let be a real normed space, a set, a map, a sign function, a finite sequence of elements of , and , real numbers. Suppose that the total is zero and that the prefix sums (1) satisfy and for every . Then the signed reordering of (2) satisfies, for every , (3)✦
In the paper, the result reads: put the indices of positive sign in order and then the indices of negative sign in reverse order; when the total is zero, every prefix sum of the new order has norm at most , with and in the roles of and .
What Is Checked
The claim (3) is stated over the signed reordering (2) of a finite sequence of elements of a set, each carrying a vector of a real normed space and a sign, under a zero total and the bounds on the unsigned and on the signed prefix sums (1).