Table of Contents
Fetching ...

Uniform optimal-order Wasserstein quantisation

Maja Gwozdz

Abstract

We address Steinerberger's Wasserstein transport problem on the cube $Q=[0,1]^d$. For every $d\ge2$, we consider a dyadic digital sequence $(x_n)\subset Q$ and prove that every prefix $\{x_1,\dots,x_N\}$ admits an exact equal-mass transport partition at the optimal scale. More precisely, for every $N\in\mathbb{N}$, there exist pairwise disjoint Borel sets $A_1,\dots,A_N\subset Q$ such that \[ λ_d(A_n)=\frac1N,\qquad A_n\subset B(x_n,6\sqrt d\,N^{-1/d})\qquad(1\le n\le N), \] and $λ_d\!\bigl(Q\setminus\bigcup_{n=1}^N A_n\bigr)=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_\infty\!\left(\frac1N\sum_{n=1}^Nδ_{x_n},\,λ_d\right)\le 6\sqrt d\,N^{-1/d} \qquad(N\in\mathbb{N}). \] The bound holds for every $1\le p\le\infty$. 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 $d\ge1$ and all $1\le p\le\infty$.

Uniform optimal-order Wasserstein quantisation

Abstract

We address Steinerberger's Wasserstein transport problem on the cube . For every , we consider a dyadic digital sequence and prove that every prefix admits an exact equal-mass transport partition at the optimal scale. More precisely, for every , there exist pairwise disjoint Borel sets such that and . In other terms, every prefix of the sequence supports an exact transport allocation of Lebesgue mass to its points with uniformly controlled radius . By an elementary partition criterion, this yields The bound holds for every . The exponent is optimal, so it gives the sharp uniform prefix rate on the cube. The result settles Steinerberger's problem for all and all .

Paper Structure

This paper contains 12 sections, 12 theorems, 92 equations.

Key Result

Theorem 1.2

Let $d\ge2$, and let $(x_n)_{n\ge1}\subset Q$ be the dyadic digital sequence from eq:digital_sequence_winfty. For every $N\in\mathbb{N}$, there exist pairwise disjoint Borel sets $A_1,\dots,A_N\subset Q$ such that and

Theorems & Definitions (28)

  • Definition 1.1: Dyadic digital sequence
  • Theorem 1.2: Prefix transport partition at optimal scale
  • Corollary 1.3: Uniform optimal-order $W_\infty$ bound on the cube
  • proof
  • Corollary 1.4: Uniform optimal-order Wasserstein bounds for all $p$
  • proof
  • Proposition 1.5: Obstruction
  • Remark 1.6: Sharpness of the exponent
  • Lemma 2.1: A partition implies a $W_\infty$ bound
  • proof
  • ...and 18 more