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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本