betaFeedback

WorksMathematics

Perturbed Exponential Systems, Pattern-Dependent Shifted-Sinc Operators, and Matrix Symbols on Finite Unions of Intervals

Abstract

We study perturbed exponential systems and unions of shifted frequency lattices through shifted-sinc operators and finite-dimensional fiberizations. For the auxiliary binary local-shift model, we identify the exact pattern-dependent invariant ρδ,s=∥P−T2δP+∥, ρ_{δ,s}=\|P_-T_{2δ}P_+\|, which gives the optimal squared synthesis bounds 1±ρδ,s1\pmρ_{δ,s}. For periodic patterns, the synthesis operator reduces exactly to a single constant Vandermonde-type matrix, yielding finite-dimensional basis criteria and optimal bounds. We further prove that the worst binary lower bound is the infimum of its periodic counterparts; at the critical value δ=1/4δ=1/4, a step pattern is governed by a half-shifted Hilbert matrix and has vanishing lower bound, although every fixed periodic pattern remains invertible. We also combine exact bounds for structured patterns with a support-independent perturbation estimate, obtaining explicit stability neighborhoods. For finite unions of bounded intervals and finitely many shifted lattices, folding modulo one yields finitely many rectangular phase matrices whose singular values and ranks give the exact bounds and complete Riesz-sequence, frame, and Riesz-basis criteria. This framework also yields finite Hadamard constraints for periodic spectra and an exact reduction of rationally commensurate multirate sampling.

Introduction

Perturbations of the standard exponential system naturally produce sinc kernels and discrete operators whose shifts depend on the frequency index. Closely related matrix structures also arise when exponential systems are restricted to disconnected spatial domains. A common shifted-sinc mechanism underlies these problems, but the corresponding operators encode different geometric information. One of the main purposes of the present paper is to keep these structures distinct while developing a common operator-theoretic framework for their analysis.

The first object is the genuine Gram operator associated with an index-dependent perturbed exponential family. If the frequencies are

λn=n+δn,\lambda_n = n + \delta_n,

then the Gram kernel is

sinc⁡π(n−m+δn−δm),\operatorname{sinc}_{\pi}(n-m+\delta_n-\delta_m),

and therefore depends simultaneously on the perturbations attached to both indices. This two-index dependence is essential and distinguishes the genuine Gram problem from the auxiliary shifted-sinc model that will be used throughout the paper.

The second object is the sign-modulated shifted-sinc synthesis operator

(Nδa)m=∑n∈Zansinc⁡π(n−m+snδ),sn∈{−1,+1},(N_{\delta}a)_m=\sum_{n\in\mathbb{Z}}a_n\operatorname{sinc}_{\pi}(n-m+s_n\delta),\qquad s_n\in\{-1,+1\},

whose shift depends only on the input index. Equivalently,

Nδ=TδP++T−δP−,N_{\delta}=T_{\delta}P_{+}+T_{-\delta}P_{-},

where P+P_{+} and P−P_{-} are the coordinate projections determined by the sign pattern. This auxiliary model is not itself the Gram operator of the perturbed family, but it admits an exact block structure that isolates the role of the sign pattern and makes possible a detailed spectral analysis.

A third structure appears for exponential systems generated by unions of shifted lattices on disconnected domains. After folding modulo one, the synthesis problem is represented by finite-dimensional matrix fibers. For unions of intervals of unequal lengths the fiber dimension may vary with the base point, but only finitely many different fibers occur. Thus the infinite-dimensional problem is again governed by explicit finite-dimensional data, now through a geometric rather than a periodic reduction.

These three settings are linked by the same shifted-sinc and Fourier-fiber mechanisms, but they answer different questions. In the perturbative problem the main issue is how the arrangement of local frequency shifts affects stability. In the disconnected-domain problem the relevant information is encoded by the integer fibers of the spatial set and by the corresponding phase matrices. The results below show that periodicity or finite-cell geometry can collapse either problem to exact finite-dimensional calculations, whereas genuinely nonperiodic configurations retain an essentially infinite-dimensional component.

Main results and organization

The first part of the paper concerns perturbed exponential systems and local frequency shifts. Section 2 introduces the genuine Gram framework and records the distinction between the actual Gram operator and the auxiliary models used later. Section 3 develops the shifted-sinc operators

Tt,T_t,

showing that they form a unitary group on ℓ2(Z)\ell^2(\mathbb{Z}). This group structure provides the common operator language used throughout the perturbative part of the paper.

Section 4 then studies the auxiliary binary operator

Nδ=TδP++T−δP−.N_{\delta}=T_{\delta}P_{+}+T_{-\delta}P_{-}.

Besides estimates that are uniform over all sign patterns, the fixed-pattern problem admits an exact description. Section 5 proves that, if

ρδ,s=∥P−T2δP+∥2,\rho_{\delta,s}=\frac{\lVert P_{-}T_{2\delta}P_{+}\rVert}{2},

then

inf⁡σ(Nδ∗Nδ)=1−ρδ,s,sup⁡σ(Nδ∗Nδ)=1+ρδ,s.\inf\sigma(N_{\delta}^{*}N_{\delta})=1-\rho_{\delta,s},\qquad\sup\sigma(N_{\delta}^{*}N_{\delta})=1+\rho_{\delta,s}.

Thus a single pattern-dependent compression norm determines both optimal squared synthesis bounds. In particular, ρδ,s<1\rho_{\delta,s}<1 is exactly the lower-stability condition for the synthesis operator onto its closed range.

Periodicity produces a further and stronger reduction. For a pp-periodic binary pattern, § 6 proves a factorization

Np,δ,s(ξ)=Hp,δ,sEδ,s(ξ)V∗.N_{p,\delta,s}(\xi)=H_{p,\delta,s}E_{\delta,s}(\xi)V^{*}.

in which the last two factors are unitary. Consequently, all singular values are independent of the fiber variable ξ\xi, and the optimal bounds are the extreme eigenvalues of the single finite Gram matrix

Hp,δ,s∗Hp,δ,s.H_{p,\delta,s}^{*}H_{p,\delta,s}.

The basis property is equivalent to a finite Vandermonde noncollision condition. This gives, in particular, the exact alternating bounds

1±sin⁡(πδ)1\pm\sin(\pi\delta)

and an explicit period-three example with optimal squared bounds

1±531\pm\frac{\sqrt{5}}{3}

at δ=1/4\delta=1/4.

The relation between periodic and nonperiodic binary patterns is developed further in § 7.1. If Abin(δ)A_{\mathrm{bin}}(\delta) denotes the worst lower squared synthesis bound over all binary patterns and Ap(δ)A_p(\delta) the corresponding minimum over pp-periodic patterns, we prove

Abin(δ)=inf⁡p≥1Ap(δ).A_{\mathrm{bin}}(\delta)=\inf_{p\geq1}A_p(\delta).

Thus the global extremal problem can be approximated by finite-dimensional periodic problems, even when no fixed period realizes the worst behavior. At the critical value δ=1/4\delta=1/4, a step pattern leads to a half-shifted Hilbert matrix and has vanishing lower bound, whereas every fixed periodic binary pattern remains invertible. Hence the critical loss of stability is invisible at every fixed period and emerges only asymptotically as the period tends to infinity. This leads naturally to finite-dimensional extremal questions and to a conjectural logarithmic critical degeneration, motivated by the asymptotics of finite Hilbert matrices.

We then return to the genuine Gram problem. § 8.1 and § 8.2 separate the two mechanisms that enter near the critical regime. A four-block sesquilinear model first isolates the interaction of two sign partitions. The genuine Gram expansion then distinguishes same-sign drift from opposite-sign half-shift interaction and yields support-dependent first-order estimates. § 9 gives a complementary support-independent perturbation theorem around any already stable structured exponential basis. The two results address different aspects of stability: the former retains detailed first-order information about the perturbation, whereas the latter provides a global neighborhood of a fixed stable system.

Section 10 extends the local-shift theory from the binary alphabet {+δ,−δ}\{+\delta,-\delta\} to finitely many shifts t1,…,tLt_1,\ldots,t_L. If PjP_j denotes the coordinate projection associated with the shift tjt_j, the Gram blocks are

Gjk=PjTtk−tjPk.(1)G_{jk}=P_jT_{t_k-t_j}P_k. \tag*{(1)}

A matrix of block norms yields a general sufficient lower-stability criterion. The binary case is exceptional because its self-adjoint off-diagonal structure reduces the two spectral endpoints to a single scalar norm; this symmetry does not persist for three or more local shifts. Under periodicity, however, the finite-alphabet problem again reduces exactly to a single constant Vandermonde-type matrix.

The second part of the paper concerns disconnected spatial domains. We begin with two full shifted lattices on a union of two unit intervals. Sections 11.1 and 11.2 treat respectively integer and noninteger translations and reduce the synthesis operator to explicit 2×22 \times2 matrix fibers. This gives optimal bounds and complete basis criteria in both regimes.

These calculations are instances of a more general folding principle. Section 12 first extends the construction to finitely many translated unit intervals and then to arbitrary finite unions of bounded intervals. For

E=⋃j=1J[aj,bj),Λ=⋃k=1K(Z+δk),E = \bigcup_{j=1}^{J}[a_j,b_j), \qquad\Lambda= \bigcup_{k=1}^{K}(\mathbb{Z}+\delta_k),

we associate to each x∈[0,1)x \in[0,1) the integer fiber

Ωx={m∈Z:x+m∈E}.\Omega_x = \{m \in\mathbb{Z}: x+m \in E\}.

Only finitely many different sets Ωx\Omega_x occur on positive-measure cells. On a cell with fiber Ωr\Omega_r, the synthesis operator is represented by the finite phase matrix

Mr=(e2πiδkm)m∈Ωr, 1≤k≤K.M_r = \left(e^{2\pi i\delta_km}\right)_{m\in\Omega_r,\ 1\leq k\leq K}.

The extreme singular values of these matrices give the exact quantitative bounds, while their column rank, row rank, and square invertibility characterize respectively Riesz sequences, frames, and Riesz bases. This formulation also makes clear why total measure alone is insufficient: the local fiber multiplicity must be compatible with the number of frequency channels.

The finite-cell formulation has two further applications. In Section 13.1, periodicity of spectra for finite unions of intervals converts spectrality into simultaneous finite Hadamard conditions on the integer fibers. Comparing adjacent fibers then produces arithmetic restrictions on possible spectra and, under suitable transition hypotheses, a rigidity mechanism related to the one-dimensional Fuglede problem. In Section 13.2, a finite collection of rationally commensurate sampling lattices is decomposed into cosets of a common lattice. The resulting multirate system is therefore governed by the same finite-cell phase matrices, giving exact existence criteria, optimal condition numbers, and an explicit reconstruction procedure.

The paper concludes by separating the regimes in which exact finite-dimensional reductions are available from the genuinely nonperiodic problems that remain infinite-dimensional. Among the latter are the geometric characterization of

ρδ,s=∥P−T2δP+∥\rho_{\delta,s} = \lVert P_{-}T_{2\delta}P_{+}\rVert

for arbitrary nonperiodic patterns, the critical asymptotics of the periodic extremal problem, a support-independent near-critical theory for the genuine Gram operator, and extensions of the finite-cell framework beyond rationally commensurate lattice systems.

The perturbed exponential Gram framework

The one-dimensional Gram operator

Let (δn)n∈Z(\delta_n)_{n\in\mathbb{Z}} be a real sequence. We consider the exponential family

B(δ):={e2πi(n+δn)x}n∈Z⊂L2(−12,12).(2)\mathcal{B}(\delta) := \left\{e^{2\pi i(n+\delta_n)x}\right\}_{n\in\mathbb{Z}} \subset L^2\left(-\frac{1}{2},\frac{1}{2}\right). \tag*{(2)}

No smallness assumption is imposed at this stage. Whenever a uniform stability result requires

sup⁡n∈Z∣δn∣<14,\sup_{n\in\mathbb{Z}}|\delta_n| < \frac{1}{4},

this hypothesis will be stated explicitly. For finitely supported coefficient sequences, all Gram identities below are valid without any smallness assumption on (δn)(\delta_n).

We use the normalized sinc function

sinc⁡π(u):={sin⁡(πu)πu,u≠0,1,u=0.\operatorname{sinc}_{\pi}(u) := \begin{cases} \dfrac{\sin(\pi u)}{\pi u}, & u\ne0, \\ 1, & u=0. \end{cases}

Recall that B\mathcal{B} is a Riesz sequence if there exist constants A,B>0A,B>0 such that, for every finitely supported sequence a=(an)n∈Za=(a_n)_{n\in\mathbb{Z}},

A∑n∈Z∣an∣2≤∥∑n∈Zane2πi(n+δn)x∥L2(−1/2,1/2)2≤B∑n∈Z∣an∣2.(3)A\sum_{n\in\mathbb{Z}}|a_n|^2 \le\left\|\sum_{n\in\mathbb{Z}}a_ne^{2\pi i(n+\delta_n)x}\right\|_{L^2(-1/2,1/2)}^2 \le B\sum_{n\in\mathbb{Z}}|a_n|^2. \tag*{(3)}

Expanding the L2L^2 norm gives

∥∑n∈Zane2πi(n+δn)x∥L2(−1/2,1/2)2=∑n,m∈Zanam‾∫−1/21/2e2πi(n−m+δn−δm)x dx=∑n,m∈Zanam‾sinc⁡π(n−m+δn−δm).(4)\begin{aligned} \left\|\sum_{n\in\mathbb{Z}}a_ne^{2\pi i(n+\delta_n)x}\right\|_{L^2(-1/2,1/2)}^2 = \sum_{n,m\in\mathbb{Z}}a_n\overline{a_m}\int_{-1/2}^{1/2}e^{2\pi i(n-m+\delta_n-\delta_m)x}\,\mathrm{d}x \\ &= \sum_{n,m\in\mathbb{Z}}a_n\overline{a_m}\operatorname{sinc}_{\pi}(n-m+\delta_n-\delta_m). \tag*{(4)} \end{aligned}

Accordingly, the Gram operator G:ℓ2(Z)→ℓ2(Z)G:\ell^2(\mathbb{Z})\to\ell^2(\mathbb{Z}) is formally given by

(Ga)m:=∑n∈Zsinc⁡π(n−m+δn−δm)an,m∈Z,(5)(Ga)_m := \sum_{n\in\mathbb{Z}}\operatorname{sinc}_{\pi}(n-m+\delta_n-\delta_m)a_n,\qquad m\in\mathbb{Z}, \tag*{(5)}

and (3) reads

∥∑n∈Zane2πi(n+δn)x∥L2(−1/2,1/2)2=⟨Ga,a⟩ℓ2.\left\|\sum_{n\in\mathbb{Z}}a_ne^{2\pi i(n+\delta_n)x}\right\|_{L^2(-1/2,1/2)}^2 = \langle Ga,a\rangle_{\ell^2}.

Since

References

  1. [1]L. De Carli, G. S. Samad, One-parameter groups of operators and discrete Hilbert transforms, Canadian Mathematical Bulletin 59 (2016) 497–507.DOI
  2. [2]M. Rosenblum, On the Hilbert matrix. ii, Proceedings of the American Mathematical Society 9 (1958) 581–585.DOI
  3. [3]T. Alemany, S. Nitzan, On the lower Riesz basis bound of exponential systems over an interval, 2025. ArXiv:2501.11598.arxiv.org/abs/2501.11598
  4. [4]A. P. Austin, L. N. Trefethen, Trigonometric interpolation and quadrature in perturbed points, SIAM Journal on Numerical Analysis 55 (2017) 2113–2122.arxiv.org/abs/1612.04018
  5. [5]N. G. de Bruijn, H. S. Wilf, On Hilbert’s inequality in n dimensions, Bulletin of the American Mathematical Society 68 (1962) 70–73.
  6. [6]L. De Carli, S. Pathak, Stability of exponential bases on d-dimensional domains, arXiv preprint arXiv:1403.2341 (2014).arxiv.org/abs/1403.2341
  7. [7]O. Asipchuk, V. Drezels, Examples of exponential bases on union of intervals, Canadian Mathematical Bulletin 66 (2023) 1296–1312.
  8. [8]O. Asipchuk, Exponential bases on modified domains, in: Recent Advances in Approximation and Potential Theory: In Honor of Edward Saff, Springer, 2025, pp. 29–54.arxiv.org/abs/2410.01995
  9. [9]E. Agora, J. Antezana, C. Cabrelli, Multi-tiling sets, Riesz bases, and sampling near the critical density in LCA groups, Advances in Mathematics 285 (2015) 454–477.
  10. [10]D. Barbieri, C. Cabrelli, E. Hernández, P. Luthy, U. Molter, C. Mosquera, Frames of exponentials and sub-multitiles in LCA groups, Comptes Rendus Mathématique 356 (2018) 107–113.arxiv.org/abs/1710.03176
  11. [12]L. De Carli, A. Mizrahi, A. Tepper, Three problems on exponential bases, Canadian Mathematical Bulletin 62 (2019) 55–70.DOI
  12. [13]D. Bose, S. Madan, Spectrum is periodic for n-intervals, Journal of Functional Analysis 260 (2011) 308–325.arxiv.org/abs/1002.4525
  13. [14]R. Shi, Fuglede’s conjecture holds for three intervals, 2026. ArXiv:2607.24005.arxiv.org/abs/2607.24005
  14. [15]C. Frederick, K. Y. Djima, Examples of Riesz bases of exponentials for multi-tiling domains and their duals, La Matematica 3 (2024) 108–123.DOI
  15. [16]J. Ortega-Cerdà, K. Seip, Fourier frames, Annals of mathematics (2002) 789–806.
  16. [17]A. Aldroubi, K. Gröchenig, Nonuniform sampling and reconstruction in shift-invariant spaces, SIAM review 43 (2001) 585–620.DOI

Paper details

vlnc:W_xpgsez9b
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents