Domain-uniform integration lower bounds and local information
Abstract
We study deterministic numerical integration on open subsets of ℝd of volume one. Let en be the minimal worst-case error using at most n function values. For twice continuously differentiable functions with the normalized Lipschitz bounds proposed by Novak, we prove en≥ vd−2/dn−2/d/(4(d+2))≥(8πe)−1n−2/d, where vd is the volume of the Euclidean unit ball. This resolves Novak's conjecture: the lower-bound constant is independent of the dimension and the shape of the domain. A midpoint rule on the cube has the same rate, up to an absolute constant. The proof uses smooth functions that vanish near the sample points and are large elsewhere. The bound therefore remains valid when each sample supplies all local information about the function. For scalar linear targets continuous in the uniform norm, we prove a second result on the global smooth class with prescribed function, gradient, and Hessian bounds: adaptive local information has the same minimal error as values and gradients at points chosen in advance. We give extensions to function recovery, finite integration measures, and anisotropic derivative bounds.
Related
- Infinitesimal Hilbertianity for manifolds with Sobolev regular Riemannian metrics through uniform lower capacity bounds
- Uniform restriction lower bounds and nongeodesic common nodal curves in integrable systems
- Uniform lower bounds for the average length of finite Pierce expansions
- Tight Lower Bounds under Matched High-Order Hölder Smoothness and Uniform Convexity
- Degree profiles of uniform polynomial consequences: Linear lower bounds for Nullstellensatz and Polynomial Calculus
BibTeX
@misc{zhang2026domainuniform,
title = {{Domain-uniform integration lower bounds and local information}},
author = {Yutong Zhang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.08524},
eprint = {2611.08524},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.08524},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Domain-uniform integration lower bounds and local information
AU - Yutong Zhang
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.08524
UR - https://arxiv.org/abs/2611.08524
AB - We study deterministic numerical integration on open subsets of ℝ^d of volume one. Let e_n be the minimal worst-case error using at most n function values. For twice continuously differentiable functions with the normalized Lipschitz bounds proposed by Novak, we prove e_n≥ v_d^−2/dn^−2/d/(4(d+2))≥(8πe)^−1n^−2/d, where v_d is the volume of the Euclidean unit ball. This resolves Novak's conjecture: the lower-bound constant is independent of the dimension and the shape of the domain. A midpoint rule on the cube has the same rate, up to an absolute constant. The proof uses smooth functions that vanish near the sample points and are large elsewhere. The bound therefore remains valid when each sample supplies all local information about the function. For scalar linear targets continuous in the uniform norm, we prove a second result on the global smooth class with prescribed function, gradient, and Hessian bounds: adaptive local information has the same minimal error as values and gradients at points chosen in advance. We give extensions to function recovery, finite integration measures, and anisotropic derivative bounds.
ER -