Table of Contents
Fetching ...

Dimension-free discretizations of the uniform norm by small product sets

Lars Becker, Ohad Klein, Joseph Slote, Alexander Volberg, Haonan Zhang

TL;DR

The paper addresses dimension-free discretization of the uniform norm for high-dimensional analytic polynomials, showing that sampling sets of size independent of the total degree can control the $L^{\infty}$ norm when the functions have total degree at most $d$ and individual degree at most $K-1$. The authors develop a probabilistic interpolation formula and Vandermonde-based estimates to bound $\|f\|_{\mathbf{D}^n}$ by $\|f\|_{Y_n}$ for $Y_n=\prod_{j=1}^n Z_j$ with $|Z_j|=K$, achieving constants of the form $C(d,K,\eta)^d$ and, in the case $Z_j=\Omega_K$, a bound $C(d,K) \le (\mathcal{O}(\log K))^{2d}$. They further establish small-sampling constructions with size $|Y_n| \le (1+\varepsilon)^n$, prove the necessity of exponential-cardinality sampling sets for product sets, and extend the framework to $L^p$ norms with $1\le p \le \infty$, yielding $\|f\|_{L^p(\mathbf{T}^n)} \le C(d,K) \|f\|_{L^p(\Omega_K^n)}$. The results connect to Bohnenblust–Hille-type inequalities on cyclic groups and broaden the toolkit for high-dimensional harmonic analysis on discrete spaces, with implications for learning theory and quantum information. Overall, the work provides dimension-free discretization tools, sharp degree dependence, and interpolation formulas that advance understanding of norm discretizations on product sets in high dimensions.

Abstract

Let $f$ be an analytic polynomial of degree at most $K-1$. A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. Many extensions of this inequality exist, often understood under the umbrella of Marcinkiewicz-Zygmund-type inequalities for $L^p,1\le p\leq \infty$ norms. We study dimension-free extensions of these discretization inequalities in the high-dimension regime, where existing results construct sampling sets with cardinality growing with the total degree of the polynomial. In this work we show that dimension-free discretizations are possible with sampling sets whose cardinality is independent of $°(f)$ and is instead governed by the maximum individual degree of $f$; i.e., the largest degree of $f$ when viewed as a univariate polynomial in any coordinate. For example, we find that for $n$-variate analytic polynomials $f$ of degree at most $d$ and individual degree at most $K-1$, $\|f\|_{L^\infty(\mathbf{D}^n)}\leq C(X)^d\|f\|_{L^\infty(X^n)}$ for any fixed $X$ in the unit disc $\mathbf{D}$ with $|X|=K$. The dependence on $d$ in the constant is tight for such small sampling sets, which arise naturally for example when studying polynomials of bounded degree coming from functions on products of cyclic groups. As an application we obtain a proof of the cyclic group Bohnenblust-Hille inequality with an explicit constant $O(\log K)^{2d}$.

Dimension-free discretizations of the uniform norm by small product sets

TL;DR

The paper addresses dimension-free discretization of the uniform norm for high-dimensional analytic polynomials, showing that sampling sets of size independent of the total degree can control the norm when the functions have total degree at most and individual degree at most . The authors develop a probabilistic interpolation formula and Vandermonde-based estimates to bound by for with , achieving constants of the form and, in the case , a bound . They further establish small-sampling constructions with size , prove the necessity of exponential-cardinality sampling sets for product sets, and extend the framework to norms with , yielding . The results connect to Bohnenblust–Hille-type inequalities on cyclic groups and broaden the toolkit for high-dimensional harmonic analysis on discrete spaces, with implications for learning theory and quantum information. Overall, the work provides dimension-free discretization tools, sharp degree dependence, and interpolation formulas that advance understanding of norm discretizations on product sets in high dimensions.

Abstract

Let be an analytic polynomial of degree at most . A classical inequality of Bernstein compares the supremum norm of over the unit circle to its supremum norm over the sampling set of the -th roots of unity. Many extensions of this inequality exist, often understood under the umbrella of Marcinkiewicz-Zygmund-type inequalities for norms. We study dimension-free extensions of these discretization inequalities in the high-dimension regime, where existing results construct sampling sets with cardinality growing with the total degree of the polynomial. In this work we show that dimension-free discretizations are possible with sampling sets whose cardinality is independent of and is instead governed by the maximum individual degree of ; i.e., the largest degree of when viewed as a univariate polynomial in any coordinate. For example, we find that for -variate analytic polynomials of degree at most and individual degree at most , for any fixed in the unit disc with . The dependence on in the constant is tight for such small sampling sets, which arise naturally for example when studying polynomials of bounded degree coming from functions on products of cyclic groups. As an application we obtain a proof of the cyclic group Bohnenblust-Hille inequality with an explicit constant .
Paper Structure (13 sections, 12 theorems, 178 equations)

This paper contains 13 sections, 12 theorems, 178 equations.

Key Result

Theorem 1

Let $n\geq 1$ and $K \geq 2$. Consider $Y_n=\prod_{j=1}^nZ_j$ for sets $Z_1,Z_2,\ldots, Z_n \subset \mathbf{D}$ such that for all $1\leq j\leq n$ we have $|Z_j| = K$, and denote by $\eta$ the minimum pairwise distance, Then for any analytic polynomial $f:\mathbf{D}^n\to\mathbf{C}$ of degree $d$ and individual degree $K-1$, Here the constant $C(d, K) := C(d, K,\eta)=C(K,\eta)^d$, and $C(K,\eta)>0

Theorems & Definitions (23)

  • Theorem 1
  • Remark 1
  • Theorem 2
  • Theorem 3
  • Theorem 4
  • Theorem 5
  • Corollary 6
  • Corollary 7
  • Corollary 8
  • proof
  • ...and 13 more