1. Introduction
Randomized quadrature formulas for numerical integration are widely used in stereology (applied geometric sampling) to estimate parameters—e.g., the volume of spatial structures. According to Cavalieri’s principle, the volume of a solid
can be obtained by integrating the areas of its two-dimensional sections along a fixed axis perpendicular to the cuts. Consequently, the classical approach consists of intersecting
Y with equidistant orthogonal planes at a distance of
along a fixed axis and measuring the resulting areas (the measurement function). The Cavalieri principle underpins routine volume estimation in stereology across several domains. For example, in neuroscience and pathology, it is used to estimate regional brain volumes (e.g., gray matter). Systematic sampling with a random start is widely adopted in these settings because it is simple to implement and operationally robust. Practitioners can control precision through the section spacing, and costs scale linearly with the number of sections; see, e.g., ref. [
1] for further details and additional applications.
Formally, the measurement function is modeled by an integrable real-valued function
with compact support, representing the area of the intersection of
Y with the plane positioned at
along the axis. Assuming, without loss of generality, that the support of
f is
, the volume of interest is
The (classical) Cavalieri estimator
is based on equidistant sampling of
f:
where
with
representing the sampling step and
U denoting a random shift uniformly distributed on
; see, for example, ([
2], Chapter 7).
The Cavalieri estimator in Equation (
1) is unbiased, and its variance depends on the smoothness of the measurement function
f. Classical stereology uses the notion of
piecewise smooth functions:
f is
times continuously differentiable, and the
m-th and
-th derivatives exist and are continuous except at finitely many points where finite jumps may occur (an integer-order smoothness notion) [
3,
4]. Motivated by practical examples from synthetic and real data, this framework was extended towards fractional smoothness based on continuous orders [
5,
6]. Subsequently, in a series of works treating Newton–Cotes estimators as improvements of the Cavalieri estimator under non-equidistant sampling, weak
piecewise smoothness was introduced—allowing
to have finitely many (possibly infinite) jumps [
7]—and the integer notion was further relaxed within a Sobolev-type function space [
8]. However, these two lines of development remain somewhat disjoint: neither the continuous extensions nor the integer relaxations align seamlessly with each other, which hampers a unified theoretical understanding. This motivates searching for smoothness assumptions that both include the above and cannot be improved within the scope where the Cavalieri theory applies.
Therefore, existing smoothness frameworks for Cavalieri estimation have advanced along two largely separate lines. Integer-order piecewise smoothness yields clean rates but can be overly restrictive; fractional extensions capture relevant edge singularities yet do not align transparently with integer relaxations; and neither direction has offered a general necessary condition linking smoothness to variance decay. The key contribution of this paper is to bridge this gap by providing a unified Fourier-decay notion of smoothness that subsumes both lines and yields a necessary condition.
Our idea is to characterize the smoothness of
f through the algebraic decay of its Fourier transform, as is standard in other areas of numerical integration such as quasi-Monte Carlo; see, e.g., ([
9], Chapter 4). This Fourier-analytic viewpoint aligns with classical Fourier analyses of uniform sampling (via Poisson summation and trapezoidal-rule arguments) [
10]. It is also consistent with lattice/digital-net quadrature, where error is governed by the decay of Fourier/Walsh coefficients [
11,
12,
13,
14,
15].
We first show that the classical theory carries through: if the Fourier decay is of order
, then the variance of the Cavalieri estimator in Equation (
1) decays at a rate of
with a constant independent of
t. Consequently,
We then prove that this Fourier-decay-based notion of smoothness is not only natural as a framework for continuous smoothness but also encompasses all previous notions, thereby providing the largest function space in which the theory holds, at least for the classical Cavalieri estimator. Furthermore, we establish that, in a broad sense, this Fourier-decay characterization cannot be improved (via a matching converse), which underscores the appropriateness of formulating Cavalieri estimation in these terms.
We note that the matching converse (inverse problem), to our knowledge, is formulated here for the first time in the Cavalieri setting. It has important theoretical implications: First, it rules out broader, ad hoc smoothness notions from yielding faster variance decay for the classical estimator given in Equation (
1). Second, it prevents underestimating smoothness: whenever algebraic variance decay is observed, the converse implies the corresponding Fourier decay.
The outline is as follows: In
Section 2 we introduce the Fourier-decay function class and relate it to the variance of
. In
Section 3 we review the literature on fractional and relaxed integer smoothness and prove that our notion encompasses these concepts, making it the weakest assumption under which the Cavalieri volume estimation theory works.
Section 4 presents an inverse result showing that algebraic Fourier decay cannot be improved in this setting. Finally,
Section 5 summarizes our contributions and provides final comments.
2. Fourier-Decay-Type Function Space
We work with the following notation (see,
Table 1).
Let
denote the space of integrable functions on
that vanish outside
up to sets of measure zero.
Let
be a smoothness parameter. We consider the Fourier-decay-type function space [
11,
12,
16] as
where
denotes the Fourier transform of
f at
, defined by
Let
and some real number
. The
T-periodic extension of
f is defined by
The
T-periodic covariogram of
f, denoted by
, is defined as the following integral function:
We summarize some of its basic properties in the following lemma (cf. ([
17], Lemma 3.2) for related arguments). We abuse the notation by writing the Fourier coefficients of
and any
T-periodic function at
as
Lemma 1. Let , and let be its T-periodic covariogram; then
- (i)
∗
- (ii)
= T .
- (iii)
- (iv)
If, in addition, then the Fourier series of gT converges absolutely on [0, T].
Proof. (i) By definition,
which is a periodic convolution on the circle of length
T.
- (ii)
The periodic convolution theorem gives
Since
, we have
; hence
- (iii)
By Fubini’s theorem and
T-periodicity,
This is because on , we have on and a.e. on , so .
- (iv)
Since
with
, there exists
such that
where
. For the
T-periodic extension, one has
Since
, the series
converges; therefore
Thus , and the Fourier series converges absolutely on . □
Remark 1. The threshold ensures absolute convergence of the Fourier series of (Lemma 1(iv)) and, equivalently, that . This justifies the Fourier-series argument and the exchange of sums in Proposition 1, yielding the finite bound in Equation (2). For , this control may fail. The result below extends a well-known formula to the setting
; see, for instance, ([
5], Equation (41)) and references therein.
Proposition 1. Let , and let be defined as in Equation (1). Let , and set . Then Proof. With
T as in the statement, we have
, and Equation (
1) can be rewritten as
where
U is uniform on
. Using Lemma 1(iii),
Also, by
T-periodicity, the summand only depends on
. For each residue
there are exactly
N pairs of
, with
; hence
According to Lemma 1(iv), expand
in the Fourier series to obtain
Since
, the
term cancels, and we obtain
Finally, Lemma 1(ii) yields
; hence
as we claimed. □
Corollary 1. Let and . Then, the Cavalieri estimator exhibits the variance bound given in Equation (2). From Proposition 1, we have
since
implies
. Using the decay assumption
,
Since
, the series
converges, and we obtain
with
. This proves the claim. □
3. Relation with Previous Smoothness Assumptions
We recall the largest known function space in which the theory of Cavalieri estimation for integer-order smoothness has been developed. This space (originally defined as
with compactly supported functions, we may, after affine rescaling, restrict the support to
without loss of generality), denoted as
, consists of all functions
that admit
m weak derivatives such that the
m-th derivative
is of bounded variation, with
[
8].
Proposition 2. For all non-negative integers m, the following inclusion holds: Proof. Fix
with
(for
, the bound follows from the
norm of
f). Set
Note that
. By assumption,
f and thus
admit
m weak derivatives in
. For
we have
Additionally, since
is of bounded variation, it is known that its Fourier coefficients decay as follows ([
18], Theorem 4.12):
where
denotes the total variation of
on
. Thus, we have
for some
. Finally, since
, the result follows. □
Also, a smoothness concept that allows for fractional-continuous smoothness was introduced by García-Fiñana and Cruz-Orive [
5,
6]. Below, we provide the definition of this concept on
, including the technical condition on the
-th derivative, as detailed by [
5], Equation (76) with
.
Definition 1. Let , and set and . A function is said to be q-smooth
if f has continuous derivatives up to order , and there exist finitely many points such that has a continuous first derivative on each connected component of . Moreover, for each i there exists and exponents such that as ,where , and the remainders have a continuous first derivative on the corresponding half-interval and satisfy as . Set ; then by construction . We demonstrate that the space of functions defined in Equation (
3) includes that notion. The following result will be used in the proof.
Lemma 2. Let and consider for . Then there exists such that for all , Proof. We include the proof for completeness; cf. ([
19], Example 3.6) for related arguments. If
, then
Hence assume
and, without loss of generality,
, since
We now bound the cosine and sine terms separately:
For the first one, by integration by parts,
and the boundary term at
vanishes since
for
. With
,
Fix
. Since
on
and
on
,
independently of
ξ. Thus,
For the sine integral, the change
yields
The first integral corresponds to the
Mellin transform of
evaluated at
and has a known finite value for
. Since
is integrable on
, the tail integral
is continuous on
and
as
; hence
. Therefore
finishing the proof. □
Proposition 3. Let . Any q-smooth function belongs to .
Proof. Let
with
(the case
follows from the bounding
in terms of the
norm of
f). Set
By the definition of
q-smoothness,
f has continuous derivatives up to order
, and
is piecewise continuously differentiable on
, with only finitely many singular points
at which
has the stated two-sided expansions. In particular, we have
, and for
,
Moreover,
since
on
and
a.e. on
. Fix
as in the definition (shrinking it if needed so that
), and set
and
for notational convenience.
Now, splitting the integral above over
into smooth subintervals that avoid the discontinuities, that is,
, we have
since
is continuously differentiable on such intervals. Here, the boundary terms are bounded because
is continuous up to the endpoints of each smooth piece.
Near each discontinuity
, it suffices to analyze the most singular case with order
α. By Lemma 2
and the same bound holds on
. The regular parts in the local expansion contribute lower orders: the constant term yields
, and the linear term yields
; the remainder
, which is continuously differentiable on the corresponding half-interval and satisfies
, also contributes
by integration by parts. Since
, we have
for
, so all these contributions are dominated by
. Summing over all pieces, there exists
such that
To sum up, since with , the same arguments as in Proposition 2 show that , i.e., . This completes the proof. □
We note that by taking the smoothness indices from Propositions 2 and 3, namely
and
, and inserting them into the variance bound in Equation (
2), we recover the classical rates
([
8], Theorem 1) and
([
5], Proposition 5.1), with constants independent of
t. This confirms that the Fourier-decay formulation captures both the integer and fractional smoothness settings within a single framework.
4. Inverse Problem
The following proposition may be interpreted as the inverse problem of the previous results on the variance decay of the Cavalieri estimator, in particular Proposition 1. By the inverse problem, we mean the converse direction: from an algebraic variance decay assumption
for all
, deduce the necessary Fourier-decay rate
(cf. Proposition 4). The motivation comes from the example
where
denotes the indicator of
(equal to 1 if
and 0 otherwise), which is weakly
-piecewise smooth but neither
-piecewise smooth nor 0-smooth [
7]. Under these notions of smoothness, the strongest conclusion available about the variance decay is of order 2. However, it can be shown that for every
, we have
, which, by Equation (
2), yields
i.e., a variance decay arbitrarily close to order 4.
Numerical check: To illustrate this behavior, we estimated the empirical variance of the Cavalieri estimator
for
using mean numbers of slices
from 2 to 50 (i.e.,
t decreasing from
to
). For each
t, we computed the empirical variance using 1000 Monte Carlo runs (independent random shifts) and then fitted, on a log–log scale, a least-squares line of variance versus
using the largest
of the
grid (smallest
t) to target the asymptotic regime. The fitted slope is
, consistent with the theoretical rate in Equation (
4).
Proposition 4 (Inverse problem)
. Let , and let be defined as in Equation (1). If for all there exists a constant such thatthen . Proof. Fix
with
(for
, the bound follows from the
norm of
f). Let
, and set
Since
for some smoothness
, by Proposition 1, it follows that
From Equation (
5) we obtain
Finally, since , the claim follows. □