Uniform optimal-order Wasserstein quantisation
Abstract
We address Steinerberger's Wasserstein transport problem on the cube Q=[0,1]d. For every d2, we consider a dyadic digital sequence (xn)⊂ Q and prove that every prefix \x1,…,xN\ admits an exact equal-mass transport partition at the optimal scale. More precisely, for every N∈N, there exist pairwise disjoint Borel sets A1,…,AN⊂ Q such that \[ λd(An)=1N, An⊂ B(xn,6 d\,N-1/d)(1 n N), \] and λd\!(Qn=1N An)=0. In other terms, every prefix of the sequence supports an exact transport allocation of Lebesgue mass to its points with uniformly controlled radius O(N-1/d). By an elementary partition criterion, this yields \[ W∞\!(1NΣn=1Nδxn,\,λd) 6 d\,N-1/d (N∈N). \] The bound holds for every 1 p∞. The exponent 1/d is optimal, so it gives the sharp uniform prefix rate on the cube. The result settles Steinerberger's problem for all d1 and all 1 p∞.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.