Table of Contents
Fetching ...

Beyond Tchakaloff Quadrature: Positive Functionals, Frames and Widths

Martin Schäfer, Tino Ullrich

TL;DR

This work generalizes exact discretization beyond traditional nonnegative quadrature by proving a complex-valued extension of $Tchakaloff$ discretization for finite-dimensional subspaces and by characterizing when positive discretizations are possible for linear functionals. It introduces strict $S$-positivity as a key criterion, connects discretization to Kolmogorov widths and singular numbers, and applies the framework to $L_p$-Marcinkiewicz-Zygmund equalities as well as frame discretization, yielding both theoretical bounds and constructive procedures. The results yield explicit bounds on Tchakaloff widths $\kappa_n^+$, establish conditions for exact weighted frame subsampling, and provide a $D$-optimal design scheme to choose discretization points, with potential algorithmic impact for quadrature, norm discretization, and frame analysis. Collectively, the paper unifies discretization theory across quadrature, norm approximation, and frames, and offers practical routes to construct discretizations via convex geometry and determinant optimization.

Abstract

Tchakaloff's theorem from 1957 asserts the existence of exact quadrature rules with non-negative weights for any polynomial space of finite degree on $\mathbb{R}^d$ if the underlying measure is positive, compactly supported, and absolutely continuous with respect to the Lebesgue measure. This classical result coined the term Tchakaloff quadrature for quadrature that is exact and only uses non-negative weights. It has been a long-standing endeavor, under which conditions such rules exist. A final answer was given in 2012 by Bisgaard with the insight that, in fact, every finite-dimensional space of integrable functions on a positive measure space admits them. In this article we recall this result and provide a major extension to the question of positive discretizability of $\mathbb{C}$-linear functionals on finite-dimensional spaces. We introduce the notion of strict $S$-positivity for such functionals, where $S$ are subsets of the functional's domain, and show the equivalence of positive discretizability to being strictly $S$-positive for a suitable choice of $S$. We further investigate consequences for other discretization problems. One fundamental implication is the guaranteed existence of $L_p$-Marcinkiewicz-Zygmund equalities in finite-dimensional spaces of $p$-integrable functions in case that $p$ is an even integer, another the exact discretizability of any frame in $\mathbb{K}^n$, where $\mathbb{K}\in\{\mathbb{R},\mathbb{C}\}$, if a rescaling of the frame elements is allowed. In addition, we provide bounds for Tchakaloff quadrature widths $κ_n^+$ and, addressing the question of constructibility of discretization points, establish a connection to $D$-optimal design.

Beyond Tchakaloff Quadrature: Positive Functionals, Frames and Widths

TL;DR

This work generalizes exact discretization beyond traditional nonnegative quadrature by proving a complex-valued extension of discretization for finite-dimensional subspaces and by characterizing when positive discretizations are possible for linear functionals. It introduces strict -positivity as a key criterion, connects discretization to Kolmogorov widths and singular numbers, and applies the framework to -Marcinkiewicz-Zygmund equalities as well as frame discretization, yielding both theoretical bounds and constructive procedures. The results yield explicit bounds on Tchakaloff widths , establish conditions for exact weighted frame subsampling, and provide a -optimal design scheme to choose discretization points, with potential algorithmic impact for quadrature, norm discretization, and frame analysis. Collectively, the paper unifies discretization theory across quadrature, norm approximation, and frames, and offers practical routes to construct discretizations via convex geometry and determinant optimization.

Abstract

Tchakaloff's theorem from 1957 asserts the existence of exact quadrature rules with non-negative weights for any polynomial space of finite degree on if the underlying measure is positive, compactly supported, and absolutely continuous with respect to the Lebesgue measure. This classical result coined the term Tchakaloff quadrature for quadrature that is exact and only uses non-negative weights. It has been a long-standing endeavor, under which conditions such rules exist. A final answer was given in 2012 by Bisgaard with the insight that, in fact, every finite-dimensional space of integrable functions on a positive measure space admits them. In this article we recall this result and provide a major extension to the question of positive discretizability of -linear functionals on finite-dimensional spaces. We introduce the notion of strict -positivity for such functionals, where are subsets of the functional's domain, and show the equivalence of positive discretizability to being strictly -positive for a suitable choice of . We further investigate consequences for other discretization problems. One fundamental implication is the guaranteed existence of -Marcinkiewicz-Zygmund equalities in finite-dimensional spaces of -integrable functions in case that is an even integer, another the exact discretizability of any frame in , where , if a rescaling of the frame elements is allowed. In addition, we provide bounds for Tchakaloff quadrature widths and, addressing the question of constructibility of discretization points, establish a connection to -optimal design.

Paper Structure

This paper contains 18 sections, 39 theorems, 184 equations.

Key Result

Theorem 1.1

Let $(\Omega,\Sigma,\mu)$ be a positive measure space, whereby $\Omega$ may be any generic set, and $\mathbb{K}\in\{\mathbb{R},\mathbb{C}\}$. For each given $n$-dimensional subspace $V_n$ of $L_1(\Omega,\mu;\mathbb{K})$ with effective real dimension $N$, see Definition def:eff_dim, there exist point

Theorems & Definitions (114)

  • Theorem 1.1
  • Remark 1.2
  • Definition 1.3
  • Definition 2.1
  • Remark 2.2
  • Theorem 2.3
  • proof
  • Lemma 2.4
  • proof
  • Corollary 2.5
  • ...and 104 more