Preprint
Article

This version is not peer-reviewed.

Eulerian Pantograph Equations, Half-Line Spectra, and Hermite Representations

Submitted:

08 July 2026

Posted:

09 July 2026

You are already at the latest version

Abstract
We study an Eulerian pantograph equation with proportional delay by means of a logarithmic change of variables, which transforms the problem into a constant-shift equation on the half-line. The main object is the maximal left-transport realization on Lp(0,∞), with derivative domain W1,p(0,∞) and no boundary condition at the endpoint. For the characteristic function m(μ)=vμ+B+Cexp(Lμ), we prove that the spectrum is the closure of the image of the open left half-plane under m: the open image gives the point spectrum, the boundary image gives the approximate spectrum, and the closure gives the full spectrum. The associated semigroup has a sharp norm identity with exponent ReB+|C|, yielding the exact stability threshold ReB+|C|<0. We compare this half-line result with the full-line Fourier multiplier realization and with the Mellin-root description of pantograph modes. Hermite functions are used only as a computational representation tool for histories and translations; they do not replace the half-line spectral theorem. The same logarithmic translation structure also suggests a natural connection with Fourier Neural Operator parameterizations of finite-history input-output maps, although the spectral results proved here are independent of any neural approximation scheme.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Functional-differential equations with proportional delay occur in self-similar and Mellin-type reductions of evolution and integral problems. The scalar Eulerian pantograph equation
A t q ( t ) + B q ( t ) + C q ( α t ) = 0 , 0 < α < 1 ,
has a singular endpoint at t = 0 , because the delay length ( 1 α ) t collapses there. Setting
t = e x , Q ( x ) = q ( e x ) , L = log ( 1 / α ) > 0 ,
transforms (1) into
A Q ( x ) + B Q ( x ) + C Q ( x + L ) = 0 , x 0 .
Thus the proportional delay becomes a constant advanced shift on the half-line.
The paper uses four related, but distinct, objects. The original unknown is q ( t ) on t > 0 . After the logarithmic change t = e x , the new unknown is Q ( x ) , with x R for the full-line comparison model and x [ 0 , ) for the half-line problem associated with the singular endpoint t = 0 . The full-line operator is used only as a reference Fourier multiplier. The main operator studied below is the half-line operator with maximal domain.
More precisely, for the left-transport sign
v : = A > 0 ,
we analyze the maximal half-line operator
L + = v D + B I + C S L , D = d d x , Dom ( D ) = W 1 , p ( 0 , ) ,
where the shift operator is
( S L f ) ( x ) = f ( x + L ) , x 0 .
No boundary trace is imposed at x = 0 .
The results should be separated as follows. The logarithmic conjugacy, the full-line Fourier multiplier picture, the step-method interpretation of histories, and the Hermite translation matrix are standard or representational tools recalled for context. The new contribution of the paper is the explicit assembly, for the maximal half-line realization (5), of the point spectrum, boundary approximate spectrum, full spectral image, and sharp semigroup norm identity. The comparison with Mellin modes, Markov heuristics, and FNO-type parametrizations is interpretive; it is included to clarify how these familiar viewpoints relate to the half-line operator, not to claim that they are new spectral methods. Informally, the main distinction is that on the full line the Fourier transform sees only oscillatory modes, whereas on the half-line exponentially decaying modes are also admissible and become genuine eigenfunctions.
The main theorem identifies the spectrum and growth bound for (5). With
m ( μ ) = v μ + B + C e L μ , H = { μ C : μ < 0 } ,
we prove
Spec ( L + ) = m ( H ) ¯ , ω 0 ( L + ) = B + | C | .
Here Spec ( L + ) is the full spectrum of the unbounded operator L + , and ω 0 ( L + ) is the exponential growth rate of the corresponding time-evolution semigroup. This is a half-line result: the interior image consists of genuine L p eigenfunctions, the boundary image consists of approximate eigenvalues produced by wave packets escaping to infinity, and the closure gives the full spectrum.
The pantograph equation and proportional-delay models go back to classical work such as [8,9,10]; general delay-equation background and characteristic-root methods are treated in [5,6], while stability questions for time-delay systems are discussed in [7] and recent numerical schemes for pantograph-type equations in [16]. The present paper does not attempt to replace these theories. Its narrower aim is to record a precise operator realization for the Eulerian half-line case and to keep it separate from the full-line Fourier multiplier picture. Hermite functions and their Laguerre-polynomial translation matrix are included because they give a concrete finite-dimensional representation of histories, which is useful in computations and in operator-learning parameterizations.
For clarity, we use the following notation throughout the paper. The symbol S L always denotes translation by L, but its underlying space is indicated by context: on the full line it acts on functions on R , whereas in the main half-line model it acts on functions on [ 0 , ) . If A is a closed operator, then Spec ( A ) denotes its spectrum, i.e., the set of complex numbers λ for which λ A is not boundedly invertible. The point spectrum Spec p ( A ) is the set of eigenvalues. The approximate point spectrum Spec ap ( A ) consists of those λ for which there are unit vectors u n in the operator domain with ( A λ ) u n 0 ; such vectors are approximate eigenvectors. We write Dom ( A ) for the domain of A, Ran ( A ) for its range, Ker ( A ) for its kernel, and ω 0 ( A ) for the growth bound of the semigroup generated by A. The spectral bound is denoted by s ( A ) = sup { λ : λ Spec ( A ) } . These conventions are standard in semigroup theory [4], but they are recalled here because the paper compares several related spectral notions.

2. Logarithmic Conjugacy and the Full-Line Model

Let
H = L 2 ( R + , d t / t ) .
The measure d t / t is the natural scale-invariant measure on the positive half-line: the dilation t α t preserves this measure. This is why logarithmic coordinates turn dilations into translations without changing the L 2 norm. The map
( U f ) ( x ) = f ( e x )
is unitary from H onto L 2 ( R ) . Under this map,
U t d d t U 1 = d d x .
Thus the Euler operator is the logarithmic form of the translation generator. This subsection recalls a standard full-line comparison model; it is not the main half-line spectral theorem of the paper.
On the full line, define
L = A x + B I + C S L , Dom ( L ) = H 1 ( R ) L 2 ( R ) .
Here x denotes differentiation on the full real line and H 1 ( R ) is the Sobolev space of square-integrable functions with square-integrable weak derivative. The Fourier transform diagonalizes this realization:
F L F 1 = M L ^ , L ^ ( k ) = i A k + B + C e i k L .
Consequently, by the standard spectral theorem for multiplication operators,
Spec ( L ) = L ^ ( R ) ¯ .
This full-line spectrum is a multiplier spectrum. It is recalled only as a comparison object and should not be confused with the half-line spectrum of the maximal operator (5), where exponentially decaying modes become actual eigenfunctions.
Remark 1. 
If A is real and v = A > 0 , then (13) becomes L ^ ( k ) = i v k + B + C e i k L = m ( i k ) . Hence the full-line spectrum is exactly the boundary curve appearing in the half-line theorem below.

2.1. Probabilistic Interpretation Under Markov Assumptions

The same logarithmic change of variables also gives a limited connection with Markov processes and their generators. This connection is not used in the spectral proof, but it is useful for placing the deterministic half-line operator in the broader context of functional differential equations and their stochastic variants. Suppose that the coefficients are real and that C 0 is interpreted as the intensity of multiplicative jumps t α t . In this interpretation, a trajectory moves deterministically between jumps, and at random jump times it is multiplied by α . The infinitesimal Markov generator records the first-order change of expected observables. On functions of t > 0 it is then
( G f ) ( t ) = A t f ( t ) + C f ( α t ) f ( t ) .
In logarithmic variables x = log t , this becomes
( G x F ) ( x ) = v F ( x ) + C F ( x + L ) F ( x ) , v = A , L = log ( 1 / α ) .
Consequently, under these additional positivity assumptions,
L + = G x + ( B + C ) I .
The scalar shift in (17) may or may not correspond to a genuine killing rate, depending on its sign. Thus the Markov interpretation is conditional, whereas the operator-theoretic spectrum below is formulated for complex B and C and does not rely on positivity. On Mellin functions t z , one has
G t z = A z + C ( α z 1 ) t z ,
so the characteristic equation of the pantograph mode is the shifted generator symbol A z + B + C α z = 0 . This is the probabilistic counterpart of the logarithmic translation symbol used below; standard references for Markov generators and semigroups include [11,12].

3. The Maximal Half-Line Operator

Throughout this section 1 p < and X p = L p ( 0 , ) . We write D = d / d x with maximal domain W 1 , p ( 0 , ) . Let
( T 0 ( t ) f ) ( x ) = f ( x + v t ) , t 0 .
Then ( T 0 ( t ) ) t 0 is a strongly continuous contraction semigroup on X p , and its generator is v D . Moreover
S L = T 0 ( L / v ) = e L D .
Therefore (5) is a bounded perturbation of v D . The word “maximal” means that every W 1 , p function is allowed in the domain; in particular, no boundary value such as Q ( 0 ) = 0 is imposed. This choice is essential for the spectrum below. The semigroup T 0 ( t ) simply transports the graph to the left: the value observed at x after time t is the old value at x + v t .
Proposition 1 
(Transport spectrum). For 1 p < ,
Spec ( v D ) = { λ C : λ 0 } .
The point spectrum consists precisely of the open half-plane λ < 0 , with eigenfunction x exp ( λ x / v ) . For λ > 0 ,
( ( λ v D ) 1 f ) ( x ) = 1 v x exp λ v ( y x ) f ( y ) d y .
Proof. 
Solving v f = λ f gives the eigenvalue statement. Formula (22) follows by variation of constants and gives a bounded inverse for λ > 0 . The line λ = 0 belongs to approximate spectrum by the usual cutoff plane waves translated to infinity. These approximate eigenvectors are not true eigenfunctions, because pure oscillations do not belong to L p ( 0 , ) , but they look like eigenfunctions on longer and longer intervals far from the endpoint. □

4. Point Spectrum and Characteristic Roots

For f μ ( x ) = e μ x with μ < 0 ,
L + f μ = m ( μ ) f μ .
Thus m ( H ) is contained in the point spectrum Spec p ( L + ) , the set of eigenvalues of L + . For the converse we use, as a known input, the Carleman-transform representation theorem for autonomous half-line functional-differential equations. The role of this theorem is to rule out hidden L p eigenfunctions: every such eigenfunction must be built from exponential modes associated with zeros of the characteristic determinant.
Lemma 1 
(Carleman representation). Let u W 1 , p ( 0 , ) solve
v u ( x ) + ( B λ ) u ( x ) + C u ( x + L ) = 0 , x > 0 .
If u L p ( 0 , ) , then u is a finite sum
u ( x ) = j P j ( x ) e μ j x ,
where P j are polynomials and μ j are zeros in μ < 0 of
Δ λ ( μ ) = λ B v μ C e L μ .
In particular, a non-zero L p solution exists only if Δ λ has a zero in μ < 0 .
Proof. 
We recall the reduction, because this is the point where the half-line domain enters. Choose a > 0 and multiply u by a smooth cut-off which is equal to one on [ a , ) . For z > 0 the one-sided Laplace transform
U a ( z ) = a e z x u ( x ) d x
is well defined after the harmless exponential damping u ( x ) e ε x u ( x ) and passage to the limit ε 0 . Transforming (24) on [ a , ) gives
Δ λ ( z ) U a ( z ) = E a ( z ) ,
where E a is an entire function depending only on the finite interval [ a , a + L ] and on boundary terms at a. Thus the possible singularities of U a are poles at zeros of Δ λ ( z ) , equivalently at exponential exponents μ = z satisfying Δ λ ( μ ) = 0 . The standard Carleman representation theorem for autonomous linear functional-differential equations makes this residue calculation precise: after moving the inversion contour to the left, the solution is a finite sum of residues x k e μ j x plus a remainder which vanishes by the homogeneous equation and the L p condition; see [5, Chapter 7] and [6, Chapter IV]. Since Δ λ is an exponential polynomial and is not identically zero because of the term v μ , all relevant zeros have finite multiplicity. Finally, x k e μ x L p ( 0 , ) only when μ < 0 , which removes all non-decaying terms and gives (25). □
Theorem 1 
(Point spectrum). For every 1 p < ,
Spec p ( L + ) = m ( H ) .
If Δ λ has a zero μ of multiplicity r in μ < 0 , then the corresponding root vectors are generated by μ k e μ x , 0 k < r .
Proof. 
The inclusion m ( H ) Spec p ( L + ) follows from (23). Conversely, if L + u = λ u with u 0 , then u solves (24); by Lemma 1, Δ λ ( μ ) = 0 for some μ < 0 , which is equivalent to λ = m ( μ ) . Differentiating ( L + m ( μ ) ) e μ x = 0 with respect to μ gives the root-vector statement at multiple zeros. □
Returning to the original variable, a modal solution has the form Q ( x ) = e z x , so μ = z . The equation m ( z ) = 0 is
A z + B + C e L z = 0 .
The condition Q L p ( 0 , ) is z > 0 . In terms of the original variable t = e x , this corresponds to the Mellin-type power q ( t ) = t z , which is why (30) is the usual characteristic equation for pantograph modes.

5. Full Spectrum by a Wiener–Hopf Criterion

Boundary spectral points arise from approximate eigenvectors localized far from the endpoint. The Wiener–Hopf terminology refers here to operators on a half-line whose coefficients are translation invariant away from the endpoint. The boundary at x = 0 prevents a full Fourier diagonalization, but the classical scalar Wiener–Hopf criterion relates invertibility to the boundary symbol and its winding number, or index. For readers not using this terminology, the criterion below may be viewed as the half-line analogue of checking that a Fourier multiplier has no zeros, with an additional index condition.
Lemma 2 
(Boundary approximate spectrum). For every ξ R ,
m ( i ξ ) Spec ap ( L + ) .
Consequently,
m ( H ) ¯ Spec ( L + ) .
Proof. 
Let χ C c 1 ( 1 , 1 ) be non-zero and put
u R ( x ) = R 1 / p χ ( ( x R ) / R ) e i ξ x .
Then u R p is independent of R for all large R, while
( D i ξ ) u R p = O ( R 1 ) , ( S L e i L ξ ) u R p = O ( R 1 ) .
After normalization, ( L + m ( i ξ ) ) u R 0 in L p . □
Lemma 3 
(Maximal half-line realization and scalar symbol). For each λ C , the operator
A λ : = λ L + , Dom ( A λ ) = W 1 , p ( 0 , ) ,
is the maximal half-line realization of the scalar expression
A λ u = ( λ B ) u v u C S L u .
Its translation-invariant boundary symbol is
Δ λ ( i ξ ) = λ B v i ξ C e i L ξ .
No boundary trace at x = 0 is part of the domain.
Proof. 
The derivative part v D is the generator of the left-translation semigroup on L p ( 0 , ) with maximal domain W 1 , p ( 0 , ) , and S L is a bounded operator on L p ( 0 , ) . Hence L + = v D + B I + C S L and A λ are closed on exactly this domain by the bounded perturbation theorem. This is a maximal, not minimal, realization: C c 1 ( 0 , ) is not used as a core, and no condition such as u ( 0 ) = 0 is imposed. For test functions localized away from the endpoint, substituting u ( x ) = e i ξ x in (36) gives (37); this is the symbol seen by wave packets escaping to infinity and by the scalar Wiener–Hopf operator associated with the maximal realization. □
The following non-elementary input is the only place where scalar Wiener–Hopf Fredholm theory is used. For scalar first-order plus-shift half-line expressions of the form (36), with maximal derivative domain and bounded shift term, the classical theorem states that non-vanishing of the boundary symbol together with index zero implies Fredholmness on L p ( 0 , ) ; the Fredholm kernel is the space of W 1 , p solutions of the homogeneous equation, and the Fredholm index equals the winding number of the boundary symbol. This is the specific functional-analytic hypothesis needed below; it is a standard scalar Wiener–Hopf result, not a formal symbolic calculation. References include [3].
Lemma 4 
(Scalar half-line Wiener–Hopf invertibility). Let λ m ( H ) ¯ . Then the boundary symbol ξ Δ λ ( i ξ ) is non-vanishing and has index zero, where the index is the winding number of this curve around the origin. Consequently, A λ = λ L + is boundedly invertible from W 1 , p ( 0 , ) onto L p ( 0 , ) , 1 p < .
Proof. 
By Lemma 3, the relevant concrete operator is A λ with maximal domain (35), and its boundary symbol is (37). The assumption λ m ( H ) ¯ means Δ λ ( μ ) 0 for μ 0 . Hence the boundary symbol has no zeros. On a large left half-disc, the argument principle gives zero zeros inside the contour; the contribution of the large semicircle is governed by Δ λ ( μ ) = v μ ( 1 + o ( 1 ) ) . Passing to the boundary limit gives index zero for Δ λ ( i R ) .
The scalar Wiener–Hopf Fredholm theorem quoted above gives Fredholmness of A λ with index zero. Its kernel is precisely the set of u W 1 , p ( 0 , ) satisfying (24). By Lemma 1, a non-zero kernel would imply a zero of Δ λ in μ < 0 , which is excluded. Since the Fredholm index is zero, the cokernel is also trivial, and the range is all of L p ( 0 , ) . Thus A λ is bijective. The closed graph theorem gives boundedness of the inverse. □
Theorem 2 
(Half-line spectral equality). Assume the scalar Wiener–Hopf Fredholm theorem stated above for the maximal realization (35). Then, for every 1 p < ,
Spec ( L + ) = m ( H ) ¯ .
Proof. 
The inclusion “⊃” follows from Theorem 1 and Lemma 2 and closedness of the spectrum. If λ m ( H ) ¯ , then Lemma 4 gives bounded invertibility of the concrete maximal operator A λ = λ L + from W 1 , p ( 0 , ) onto L p ( 0 , ) . Thus λ belongs to the resolvent set. □

6. Exact Semigroup Norm and Stability

Since S L = T 0 ( L / v ) commutes with the left-translation semigroup, the semigroup generated by (5) is
T ( t ) = e B t exp ( C t S L ) T 0 ( t ) = e B t n = 0 ( C t ) n n ! T 0 t + n L v .
This formula is a variation-of-constants expansion in which the bounded shift term C S L is exponentiated separately from the transport part v D . Commutation is the key point: it turns the semigroup into an explicit positive-time series of translations.
Theorem 3 
(Exact spectral and growth bounds). For every 1 p < ,
s ( L + ) = ω 0 ( L + ) = B + | C | ,
and
T ( t ) = e ( B + | C | ) t , t 0 .
Proof. 
For the upper bound, use (39) and the contraction property T 0 ( s ) 1 :
T ( t ) e B t n = 0 | C | n t n n ! = e ( B + | C | ) t .
It remains to prove that no cancellation can improve this estimate. If C = 0 , the identity follows from T 0 ( t ) = 1 , so assume C 0 . Choose θ R such that C e i θ = | C | , and choose η R with η L θ ( mod 2 π ) . Let χ C c 1 ( 1 , 1 ) be normalized by χ p = 1 and set
f R ( x ) = R 1 / p χ ( ( x R ) / R ) e i η x .
For R large enough the support of f R lies in ( 0 , ) , and f R p = 1 . For each fixed s 0 ,
T 0 ( s ) f R e i η v s f R p 0 , R ,
which follows by the change of variables x = R + R y and the continuity of translations in L p ( R ) applied to the compactly supported profile χ .
Fix N N . Applying (44) to the finitely many shifts s n = t + n L / v , 0 n N , gives
e B t n = 0 N ( C t ) n n ! T 0 t + n L v f R e B t e i η v t n = 0 N ( C t ) n e i η n L n ! f R p 0 .
Because η L θ and C e i θ = | C | , the scalar sum in (45) is n = 0 N ( | C | t ) n / n ! . The remaining tail of (39) is bounded uniformly in R by
ρ N ( t ) = e B t n = N + 1 ( | C | t ) n n ! .
Therefore
lim inf R T ( t ) f R p e B t n = 0 N ( | C | t ) n n ! ρ N ( t ) .
Letting N in (47) gives T ( t ) e ( B + | C | ) t . Together with (42), this proves (41).
The growth bound is then
ω 0 ( L + ) = lim t t 1 log T ( t ) = B + | C | .
Finally, by Theorem 2,
s ( L + ) = sup μ < 0 v μ + B + C e L μ .
The upper bound is at most B + | C | because | e L μ | < 1 and ( v μ ) < 0 . The opposite inequality follows by taking μ 0 and choosing μ so that the phase of C e L μ approaches the positive real direction. Thus s ( L + ) = B + | C | as well. □
Corollary 1 
(Sharp stability threshold). The semigroup generated by L + is exponentially stable if and only if
B + | C | < 0 .
If equality holds, the semigroup is bounded but not exponentially stable.

7. Initial Histories and Modal Incompleteness

The preceding spectral results describe the maximal half-line operator on L p ( 0 , ) . Initial-history problems use the same characteristic roots, but in a different way. If a history Φ C 1 [ 0 , L ] is prescribed for (3), the solution can be continued interval by interval by the step method. Exponential histories Q ( x ) = e z x are compatible with this continuation precisely when z satisfies the Mellin characteristic equation (30). These are the modal histories. The word “history” means the part of Q already known on one delay interval; for equation (3), values on [ 0 , L ] determine later values recursively.
This modal family is useful for describing the eigenfunction part of the half-line operator, but it should not be mistaken for a basis of all admissible initial data. The reason is elementary and is tied to the singular endpoint t = 0 : every decaying Mellin mode has zero trace there. Therefore modal expansions cannot uniformly approximate continuous initial data with non-zero endpoint trace. In applications this means that a finite-history continuation generally contains a residual component that is not captured by the discrete Mellin roots alone, even though those roots exactly describe the point spectrum in Theorem 1.
Proposition 2 
(Modal incompleteness for endpoint data). Let
M mod = span { t z : z solves ( 30 ) and z > 0 }
in C [ 0 , 1 ] . Then
M mod ¯ C [ 0 , 1 ] C 0 [ 0 , 1 ] : = { f C [ 0 , 1 ] : f ( 0 ) = 0 } .
Consequently, every continuous history g C [ 0 , 1 ] with g ( 0 ) 0 satisfies
dist C [ 0 , 1 ] ( g , M mod ) | g ( 0 ) | .
Thus no modal expansion made only of decaying Mellin modes can approximate such an initial history uniformly on [ 0 , 1 ] .
Proof. 
If z > 0 , then t z 0 as t 0 + . Hence every finite modal sum vanishes at t = 0 . The space C 0 [ 0 , 1 ] is closed as the kernel of the continuous trace functional f f ( 0 ) , which proves (52). The distance estimate follows by evaluating g m at t = 0 . □
Remark 2. 
The term “non-modal” is used here only in this approximation sense: it refers to the part of a prescribed history that is not uniformly approximable by the decaying Mellin modes. It is not an additional spectral type beyond the point and approximate spectra identified above.

8. Representation and Approximation Perspectives

The spectral results above are independent of any numerical discretization. We do not solve numerical approximation or learning problems in this paper. Nevertheless, the logarithmic transformation reduces proportional delay to translation, and this makes it natural to compare the exact operator theory with two common representation languages: Hermite expansions for histories and Fourier-based operator-learning architectures. The purpose of this section is therefore interpretive. It explains how the exact spectrum and growth bound constrain such representations, without claiming that these representations replace the half-line spectral theorem.

8.1. Hermite Representation of Translations and Histories

Hermite functions provide a useful orthonormal basis of L 2 ( R ) for representing extended histories, but they do not diagonalize the shift operator or the half-line operator. Let
ψ n ( x ) = ( 1 ) n 2 n n ! π e x 2 / 2 d n d x n e x 2 , n = 0 , 1 , 2 , .
Then ( ψ n ) n 0 is an orthonormal basis of L 2 ( R ) . With the Fourier transform convention
( F f ) ( k ) = 1 2 π R e i k x f ( x ) d x ,
one has
F ψ n = ( i ) n ψ n .
Thus a square-integrable extended history can be encoded by its Hermite coefficients. This is analogous to a Fourier series, but the Hermite basis is localized in both position and frequency, which is convenient for finite or rapidly decaying histories.
Lemma 5 
(Translation matrix). For L R ,
ψ n ( x + L ) = e L 2 / 4 m = 0 n m ! n ! L 2 n m L m ( n m ) L 2 2 ψ m ( x ) + e L 2 / 4 m = n + 1 n ! m ! L 2 m n L n ( m n ) L 2 2 ψ m ( x ) .
Proof. 
This is the standard displacement-operator formula; see [2, Chapter 1]. Writing S L = exp ( ( L / 2 ) ( a a * ) ) in the Hermite basis gives the displayed Laguerre-polynomial matrix elements. □
Example 1 
(Shift of the ground-state Hermite function). For n = 0 , Lemma 5 gives
ψ 0 ( x + L ) = e L 2 / 4 m = 0 1 m ! L 2 m ψ m ( x ) .
Thus even the shifted Gaussian has infinitely many Hermite coefficients. Truncating (58) gives a finite matrix approximation of the translation operator on the Hermite basis. This illustrates the role of Hermite functions in the present paper: they provide a computable representation of shifted histories, while the spectrum of the half-line operator is still determined by the Wiener–Hopf formula in Theorem 2.
If a finite history Φ on [ 0 , L ] is extended to a function Φ ˜ L 2 ( R ) , then
Φ ˜ = n = 0 c n ψ n , c n = Φ ˜ , ψ n L 2 ( R ) .
Together with Lemma 5, this gives a concrete matrix representation of translations acting on the extended history. The representation depends on the chosen extension and is therefore a computational model for histories, not a canonical spectral resolution of (5).

8.2. Fourier Neural Operator Viewpoint

The same logarithmic transformation that turns proportional delay into translation also suggests why Fourier Neural Operator (FNO) architectures can be a natural computational language for learned input-output maps associated with (3). On the full line, the principal operator is represented by the Fourier multiplier (13); on finite history windows, Hermite coefficients such as (59) give a complementary localized representation of the history. An FNO is a neural-operator architecture in which part of the learned map is parametrized in Fourier variables; it is mentioned here only because translations are especially simple in frequency space. Thus an FNO-type model could use Fourier modes to parametrize the translation-invariant part of the continuation map, while separate channels or lifted variables encode the endpoint trace and non-modal residual history. This observation is only a modelling motivation: the exact spectrum, approximate spectrum, and growth bound are the analytic results proved above, not consequences of a neural approximation scheme; see [13,14,15] for the FNO and neural-operator framework.

9. A Model Stability Example

Take
v = 1 , L = 1 , B = 2 , C = 1 .
Then
m ( μ ) = μ 2 + e μ .
By Theorem 3,
s ( L + ) = ω 0 ( L + ) = 1 , T ( t ) = e t .
The point spectrum is m ( μ < 0 ) , while the boundary approximate spectrum is
m ( i ξ ) = 2 + e i ξ + i ξ , ξ R .
This example illustrates why stability should be formulated at the operator level, using the full half-line spectral image, rather than only through the zeros of m. The zeros of m describe stationary modal solutions of the homogeneous equation, whereas the spectrum of L + describes the possible exponential rates of the whole evolution semigroup.

10. Scope and Limitations

The restriction 1 p < is essential for the present formulation. On L ( 0 , ) the left-translation semigroup is not strongly continuous in the usual norm, so the generator and growth-bound statements require a different state space, such as C 0 ( 0 , ) or weak-star semigroup methods. The assumption v > 0 is also structural: for the right-transport sign one must impose an inflow boundary condition at x = 0 , and that boundary condition changes both the resolvent and the spectrum. Complex transport speeds are outside the ordered half-line translation model, since x + v t no longer defines a real half-line flow. Finally, multiple shifts or general bounded perturbations may still be treatable by Wiener–Hopf methods, but the scalar symbol is then replaced by a more complicated exponential polynomial or by an operator-valued symbol; the exact norm identity (41) is special to the single scalar shift commuting with the translation semigroup.
The representation and approximation discussion is also limited in scope. Hermite functions, and their half-line counterparts the Laguerre functions, form natural orthonormal bases for spectral approximations on L 2 ( 0 , ) [1], while FNO-type models exploit frequency-domain multipliers and translation-invariant structure [13,14,15]. In both cases, a priori knowledge of the exact spectrum, such as Theorem 2, is useful for understanding approximation capabilities and possible convergence mechanisms in half-line domains. A detailed numerical analysis or learning theory for such schemes is beyond the scope of the present work.

11. Conclusion

The Eulerian pantograph equation becomes a constant-shift equation after a logarithmic change of variables. The main result of the paper concerns the left-transport maximal half-line realization on L p ( 0 , ) , 1 p < : under this realization, the spectrum is m ( { μ < 0 } ) ¯ and the semigroup norm is exp ( ( B + | C | ) t ) . These formulas give the sharp stability threshold B + | C | < 0 for that half-line operator. The other viewpoints serve a different role: the full-line Fourier multiplier supplies a comparison boundary curve, Mellin roots identify modal histories, and Hermite functions provide a practical basis for representing histories and translations. The link to FNO-style operator learning is therefore a modelling motivation rather than a source of the spectral theorem; neither the Hermite nor the FNO representation diagonalizes the half-line problem.

Author Contributions

The author is solely responsible for the conceptualization, methodology, formal analysis, writing, review, and editing of this work.

Funding

This work was supported by the Ministry of Economic Development of the Russian Federation in accordance with the subsidy agreement (agreement identifier 000000C313925P4H0002; grant No. 139-15-2025-012).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. G. Szego, Orthogonal Polynomials, 4th ed., American Mathematical Society Colloquium Publications, Vol. 23, American Mathematical Society, Providence, RI, 1975.
  2. G.B. Folland, Harmonic Analysis in Phase Space, Annals of Mathematics Studies, Vol. 122, Princeton University Press, Princeton, NJ, 1989.
  3. I.C. Gohberg and M.G. Krein, Introduction to the Theory of Linear Nonselfadjoint Operators, Translations of Mathematical Monographs, Vol. 18, American Mathematical Society, Providence, RI, 1969.
  4. K.-J. Engel and R. Nagel, One-Parameter Semigroups for Linear Evolution Equations, Springer, 2000.
  5. J.K. Hale and S.M. Verduyn Lunel, Introduction to Functional Differential Equations, Springer, 1993.
  6. O. Diekmann, S.A. van Gils, S.M. Verduyn Lunel, and H.-O. Walther, Delay Equations: Functional-, Complex-, and Nonlinear Analysis, Springer, 1995.
  7. W. Michiels and S.-I. Niculescu, Stability and Stabilization of Time-Delay Systems: An Eigenvalue-Based Approach, SIAM, 2007.
  8. T. Kato and J.B. McLeod, The functional-differential equation y(x) = ay(λx) + by(x), Bull. Amer. Math. Soc. 77 (1971), 891–937.
  9. J.R. Ockendon and A.B. Tayler, The dynamics of a current collection system for an electric locomotive, Proc. R. Soc. Lond. A 322 (1971), 447–468.
  10. A. Iserles, On the generalized pantograph functional-differential equation, European J. Appl. Math. 4 (1993), 1–38.
  11. S.N. Ethier and T.G. Kurtz, Markov Processes: Characterization and Convergence, Wiley, New York, 1986.
  12. V.N. Kolokoltsov, Markov Processes, Semigroups and Generators, De Gruyter, Berlin, 2011.
  13. Z. Li, N. Kovachki, K. Azizzadenesheli, B. Liu, K. Bhattacharya, A. Stuart, and A. Anandkumar, Fourier Neural Operator for Parametric Partial Differential Equations, arXiv preprint arXiv:2010.08895, 2020; ICLR 2021.
  14. K. Azizzadenesheli, N. Kovachki, Z. Li, M. Liu-Schiaffini, J. Kossaifi, and A. Anandkumar, Neural operators for accelerating scientific simulations and design, Nat. Rev. Phys. 6 (2024), 320–328. [CrossRef]
  15. N.B. Kovachki, S. Lanthaler, and A.M. Stuart, Operator learning: Algorithms and analysis, in Handbook of Numerical Analysis, Vol. 25, Elsevier, 2024, pp. 419–467. [CrossRef]
  16. F.A. Rihan, Continuous Runge–Kutta schemes for pantograph type delay differential equations, Partial Differ. Equ. Appl. Math. 11 (2024), 100797. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings