Asymptotics of Constrained Quantization for Compactly Supported Measures
arXiv:2505.10801
Abstract
We study constrained quantization of a compactly supported probability on by codebooks in a nonempty closed set . For , the constrained error is attained and satisfies . Set for finite . A Borel nearest-point selector induces . Writing for the classical quantization error, we obtain and for , with independent of , and for . Also, , where is the nearest-point image of and is its covering radius. For , a weighted power-growth condition with exponent on a fixed source set bounds below by the classical -power quantization cost of . If for a compactly supported reference probability and , , then . These comparisons yield bounds for the quantization dimensions defined by and , with distinct behavior at positive and zero baselines. Convex and uniformly prox-regular constraints supply the growth weights through their projection inequalities. Circle and lifted Cantor distributions give matching quadratic-excess rates, while rectifiable weighted projections give lower Zador estimates.