The Setting
Take vectors in Euclidean space , each of norm at most . If they sum to zero, how small can a reordering of the indices make all the prefix sums , , uniformly in ? This is the question of the Steinitz lemma. Its signed counterpart drops the condition on the sum and keeps the order: it asks for signs that make every signed prefix sum short.
Theorem 1.2, the Euclidean Steinitz-Bergström bound, asks for orderings with every prefix sum of norm at most , with an absolute constant for which the signed prefix bound, defined below, holds.
The Two Prefix Bounds
For a real number , the signed prefix bound with constant , written , is the property that for all integers and all vectors in of norm at most there are signs with (1)✦
For a real number , the ordering prefix bound with constant , written , is the property that whenever and are vectors in of norm at most with , some permutation of gives (2)✦
The Claim
Theorem 1. There is a real number for which both prefix bounds hold: (3)✦ For every real number , if the signed prefix bound holds with constant , then the ordering prefix bound holds with the same constant: (4)✦
What Is Checked
The claim is stated over Euclidean space and over the signed and ordering prefix bounds and of a real number , which quantify over every family of vectors of norm at most in , , the ordering bound over those summing to zero.