Middle-Scale Peak Theorem Overview

• Middle-scale peak theorem is a quantitative near-peaking result that balances approximate delta-interpolation with explicit spectral bounds.
• It converts local approximation errors into global spectral constraints using Landau concentration arguments and finite-dimensional perturbation lemmas.
• The theorem establishes optimal density conditions in Paley–Wiener spaces and sharp threshold behaviors under non-quasianalytic growth regimes.

Searching arXiv for the cited papers and closely related terminology. “Middle-Scale Peak Theorem” is best understood as an Editor’s term for a quantitative near-peaking principle that lies between exact interpolation and unconstrained approximation. In the most direct formulation, the relevant result is Theorem 1 of "Approximation of discrete functions and size of spectrum" (Olevskii et al., 2013): bounded Paley–Wiener functions that approximately realize Kronecker delta data on a uniformly discrete set force a sharp lower bound on spectral measure. A related, but structurally different, interpolation principle appears in "Pick and Peak Interpolation" (Izzo, 2016), where finite Pick data and peak interpolation data are solved simultaneously in a uniform algebra. Taken together, these results motivate the phrase “middle-scale peak” as denoting regimes of controlled but non-exact peaking.

1. Terminological status and scope

The expression “Middle-Scale Peak Theorem” is not the formal title of a theorem in the cited papers. In (Olevskii et al., 2013), the central theorem is a quantitative approximate interpolation result for Paley–Wiener spaces, and the supplied interpretation identifies it as the result most directly relevant to a “middle-scale peak” viewpoint. In (Izzo, 2016), the paper explicitly notes that there is no theorem with that exact title, but identifies Theorem 2.1 as the natural statement if the phrase is intended to describe a result balancing finite Pick data against peak-set constraints.

This suggests that the phrase is best used descriptively rather than bibliographically. In the Paley–Wiener setting, “middle-scale” refers to the regime in which one does not demand exact interpolation of $\delta$-data, but also does not permit arbitrary approximation error: the error is fixed in $l^2$, and that quantitative tolerance still imposes a definite spectral cost (Olevskii et al., 2013). In the uniform-algebra setting, the phrase points to a theorem that sits between local finite-point interpolation and interpolation on a peak interpolation set, with norm control preserved (Izzo, 2016).

The two settings are not identical. One concerns spectral size versus approximation accuracy for discrete data in $PW_S$; the other concerns compatibility of Pick interpolation and peak interpolation in abstract uniform algebras. Their common feature is a controlled peaking mechanism that is neither purely exact nor wholly unconstrained.

2. Paley–Wiener formulation of the near-peaking principle

The principal theorem associated with the term is stated for a compact set $S \subset \mathbb R$ and a uniformly discrete set $\Lambda$, where

$$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$

The Paley–Wiener space is

$$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$

The hypothesis is that for every $\lambda\in\Lambda$ there exists a bounded function $f_\lambda\in PW_S$ such that

$$\|f_\lambda|_\Lambda-\delta_\lambda\|_{l^2(\Lambda)}<d,$$

with $l^2$0, and that the family is uniformly bounded in $l^2$1: $l^2$2 Under these assumptions, Theorem 1 gives the sharp inequality

$l^2$3

where the upper uniform density is

$l^2$4

This is the paper’s main “size of spectrum versus approximation accuracy” inequality (Olevskii et al., 2013).

The content is quantitative. The denser the set $l^2$5 and the smaller the allowed approximation error $l^2$6, the larger the spectral measure must be. The factor $l^2$7 interpolates continuously between exact interpolation and weaker approximate interpolation. In particular, when $l^2$8, the theorem recovers the classical necessary density condition

$l^2$9

Conceptually, this is why the result is naturally described as “middle-scale.” It is not merely about exact interpolation, and it is not about approximation without structure; it concerns quantitative near-peaking of $PW_S$0-data by spectrally constrained functions. The supplied interpretation places it between classical interpolation theory and uncertainty-principle or large-sieve type bounds (Olevskii et al., 2013).

3. Density mechanism and proof architecture

The proof in (Olevskii et al., 2013) combines a Landau-type concentration argument with a finite-dimensional perturbation lemma, identified in the summary as Lemma 2, in a Kolmogorov-width style form. The initial device is to multiply the approximants $PW_S$1 by a small smoothing factor $PW_S$2 satisfying $PW_S$3. This preserves the approximation properties while enlarging the spectrum only slightly, to

$PW_S$4

One then restricts attention to a finite interval

$PW_S$5

and considers the vectors of values of the approximants at the points $PW_S$6. The perturbation lemma yields a large-dimensional subspace on which these value vectors satisfy a uniform lower quadratic bound. From this, one obtains a subspace of $PW_S$7 concentrated on a slightly larger interval $PW_S$8.

Landau’s concentration lemma then imposes an upper bound on the dimension of such a subspace: $PW_S$9 This is compared with the lower-dimensional estimate

$S \subset \mathbb R$0

After passing to the limit $S \subset \mathbb R$1, one obtains the density inequality

$S \subset \mathbb R$2

The significance of this proof architecture is that it converts local approximate interpolation data into a global spectral obstruction. The lower bound arises from the existence of many approximately independent peaking vectors, while the upper bound arises from concentration. This suggests that the theorem belongs to a broader class of arguments in which finite-dimensional geometry and concentration estimates are used to quantify uncertainty-type phenomena.

4. Sharpness and extremal realization

The estimate in (Olevskii et al., 2013) is sharp for every $S \subset \mathbb R$3. The explicit extremal example takes

$S \subset \mathbb R$4

and defines

$S \subset \mathbb R$5

These functions satisfy

$S \subset \mathbb R$6

Since

$S \subset \mathbb R$7

one obtains equality in

$S \subset \mathbb R$8

This example rules out any general improvement of the coefficient $S \subset \mathbb R$9. It also clarifies the geometric meaning of the theorem: approximate peaking on a lattice can be achieved exactly up to the limit permitted by the spectral interval, and the theorem captures that limit with equality.

A common misunderstanding would be to treat the factor $\Lambda$0 as a technical artifact of the proof. The extremal example shows that it is structural rather than accidental. The dependence on $\Lambda$1 is not merely qualitative; it is optimal in the precise sense asserted by the theorem (Olevskii et al., 2013).

5. Moderate growth extension and threshold behavior

The paper also proves an analogue in a moderate-growth regime. If the approximating functions satisfy

$\Lambda$2

then the same lower bound persists with the upper Beurling density

$\Lambda$3

namely

$\Lambda$4

This extends the bounded-family result beyond uniform $\Lambda$5-boundedness while preserving the same dependence on approximation error (Olevskii et al., 2013).

The growth restriction is also sharp in the sense recorded in the summary. If the norms are allowed to grow exponentially like $\Lambda$6, then no lower bound on $\Lambda$7 is possible: there exist compact spectra of arbitrarily small, even zero, measure supporting such approximations. The paper further remarks that the same argument works for any non-quasianalytic growth assumption, while quasianalytic growth is expected to be the threshold for failure.

This sharp threshold behavior is central to the “middle-scale” interpretation. The theorem is not only sensitive to approximation accuracy; it is also sensitive to how large the approximating family is allowed to become. A plausible implication is that controlled near-peaking requires two simultaneous resources: spectral bandwidth and a growth regime below the quasianalytic threshold.

6. Relation to peak interpolation in uniform algebras

A distinct but related use of “peak” appears in (Izzo, 2016). There, $\Lambda$8 is a uniform algebra on a compact space $\Lambda$9: a closed subalgebra of $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$0 that contains the constants and separates points. A function $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$1 is said to peak on $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$2 if

$$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$3

A set $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$4 is a peak interpolation set if for every nonzero $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$5 there exists $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$6 such that $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$7 and $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$8 on $$\inf_{\lambda\neq\lambda'\in\Lambda}|\lambda-\lambda'|>0.$$9.

Theorem 2.1 of (Izzo, 2016) states that if $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$0 is a peak interpolation set, if $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$1, if $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$2 with $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$3, and if for every $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$4 there exists $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$5 with

$$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$6

then one can choose such an interpolant $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$7 so that also

$$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$8

In the disc algebra $$PW_S=\{f\in L^2(\mathbb R): \widehat f=0 \text{ on } \mathbb R\setminus S\}.$$9, the corresponding corollary asserts that when $\lambda\in\Lambda$0 is closed and of $\lambda\in\Lambda$1-dimensional Lebesgue measure zero, simultaneous interpolation on $\lambda\in\Lambda$2 and at distinct interior points $\lambda\in\Lambda$3 is possible with $\lambda\in\Lambda$4 if and only if the Pick matrix is positive semidefinite (Izzo, 2016).

The proof has two conceptual steps. First, an approximate interpolant is built that matches the peak-set data exactly and the finite Pick data approximately. The key lemma provides a sequence $\lambda\in\Lambda$5 with $\lambda\in\Lambda$6, $\lambda\in\Lambda$7 on $\lambda\in\Lambda$8, and $\lambda\in\Lambda$9 pointwise on $f_\lambda\in PW_S$0. Second, the remaining finite interpolation errors are corrected exactly using functions $f_\lambda\in PW_S$1 satisfying

$f_\lambda\in PW_S$2

The connection to the Paley–Wiener theorem is analogical rather than formal. In both cases, a peak-type device localizes or suppresses unwanted behavior, and a finite correction or density argument then restores exact control. The difference is substantive: (Olevskii et al., 2013) yields a quantitative lower bound on spectral size from approximate $f_\lambda\in PW_S$3-interpolation, whereas (Izzo, 2016) proves compatibility of two interpolation mechanisms under approximate norm control. This suggests that “middle-scale peak” names a family resemblance across settings, not a single universal theorem.

7. Conceptual significance and common misconceptions

The central significance of the Paley–Wiener result is that approximate interpolation remains rigid. Allowing a fixed $f_\lambda\in PW_S$4-error $f_\lambda\in PW_S$5 does not eliminate density obstructions; it modifies them quantitatively through the sharp factor $f_\lambda\in PW_S$6 (Olevskii et al., 2013). The theorem therefore gives a precise answer to how much spectral measure is required for controlled near-peaking on a dense discrete set.

One common misconception is to equate the theorem with exact interpolation theory. The theorem does recover the exact case when $f_\lambda\in PW_S$7, but its distinctive content lies in the nonzero-error regime. Another misconception is to identify it with peak interpolation in the sense of uniform algebras. The latter is a different theory, despite the shared language of peaking. In (Izzo, 2016), the issue is simultaneous solvability of finite Pick data and peak-set data with norm control; in (Olevskii et al., 2013), the issue is spectral size forced by approximate delta interpolation.

A further interpretive point concerns the phrase “middle-scale.” In the supplied summaries, that phrase is explanatory rather than canonical. It indicates a regime between exact local interpolation and fully uncontrolled approximation, or between finite-point Pick interpolation and peak-set interpolation. Used in that restricted sense, it accurately captures the role of the principal theorems. Used as a formal historical label, however, it would be misleading, because neither paper presents that exact title as part of its theorem nomenclature.