patterns and structure in systems governed by linear second-order differential equations

76
Acta Applicandae Mathematicae 6 (1986), 109-184. 109 © 1986 by D. Reid.el Publishing Company. Patterns and Structure in Systems Governed by Linear Second-Order Differential Equations ROBERT CARROLL Department of Mathematics, University of Illinois at Champaign- Urbana, 273 Altgeld Hall, 1409 West Green Street, Urbana, IL 61801, U.S.A. (Received: 2 October 1984; revised: 1 May 1985) Abstract. This article represents a survey of transmutation ideas and their interaction with typical physical problems. For linear second-order ditterential operators P and O one deals with canonical connections B: P---)O (transmutations) satisfying QB = BP and the related transport of 'structure' between the theories of P and O. One can study in an intrinsic manner, e.g., Parseval formulas, eigenfunction expansions, integral transform, special functions, inverse problems, integral equations, and related stochastic filtering and estimation problems, etc. There are applications in virtually any area where such operators arise. AIMS (MOS) subject classifications (1980). 33A45, 34A55, 34B25, 35A22, 35P10, 35P25, 35R30, 42A38, 42A85, 43A90, 44A05, 45B05, 45D05, 45E10, 47A68, 47B35, 60G35, 60G60, 62M15, 62M20, 73D30, 81F15, 86A15, 93E10, 93Ell Key words. Transmutation, transformation operators, Parseval formulas, eigenfunction expansions, Paley-Wiener theory, Riemann-Liouville and Weyl integrals, special functions, Gelfand-Levitan and Mar~enko equations, generalized translation, generalized convolution, Volterra operators, Toeplitz operators, Wiener-Hopf equations, Bergman-Gilbert operators, Kontorovi~-Lebedev inversion, generalized axially symmetric potential theory, canonical equations, deBranges spaces, random evolutions, scattering theory, inverse problems, filtering, smoothing, innovations, Darboux- Christoffel formulas, generating functions, reproducing kernels, random fields, linear stochastic estimation, Spectral measures, orthogonai polynomials, least squares, etc. 1. Introduction Given that many natural processes are governed by second-order linear differen- tial equations, and related integral equations (at least to a first approximation) it is certainly no surprise to see that certain mathematical patterns and structures recur frequently in physics and applied mathematics. We will try to weave the theme of transmutation or intertwining of operators through certain areas in pure and applied mathematics (quantum scattering theory, linear stochastic estimation, special function theory, inverse problems in geophysics, orthogonal functions and integral transforms, etc.). Transmutation (cf. [81]) is of course a simple idea. One takes here two second-order ordinary differential operators P and Q (we usually work on [O, oo)) and looks for B such that BP = QB, acting on suitable objects (we write B: P---> Q). Usually B will be an integral operator with a distribution kernel and there will be an inverse ~ --- B -1 in the sense of Volterra operators in

Upload: robert-carroll

Post on 06-Jul-2016

214 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: Patterns and structure in systems governed by linear second-order differential equations

Acta Applicandae Mathematicae 6 (1986), 109-184. 109 © 1986 by D. Reid.el Publishing Company.

Patterns and Structure in Systems Governed by Linear Second-Order Differential Equations

ROBERT CARROLL Department of Mathematics, University of Illinois at Champaign- Urbana, 273 Altgeld Hall, 1409 West Green Street, Urbana, IL 61801, U.S.A.

(Received: 2 October 1984; revised: 1 May 1985)

Abstract. This article represents a survey of transmutation ideas and their interaction with typical physical problems. For linear second-order ditterential operators P and O one deals with canonical connections B: P---)O (transmutations) satisfying QB = BP and the related transport of 'structure' between the theories of P and O. One can study in an intrinsic manner, e.g., Parseval formulas, eigenfunction expansions, integral transform, special functions, inverse problems, integral equations, and related stochastic filtering and estimation problems, etc. There are applications in virtually any area where such operators arise.

AIMS (MOS) subject classifications (1980). 33A45, 34A55, 34B25, 35A22, 35P10, 35P25, 35R30, 42A38, 42A85, 43A90, 44A05, 45B05, 45D05, 45E10, 47A68, 47B35, 60G35, 60G60, 62M15, 62M20, 73D30, 81F15, 86A15, 93E10, 93Ell

Key words. Transmutation, transformation operators, Parseval formulas, eigenfunction expansions, Paley-Wiener theory, Riemann-Liouville and Weyl integrals, special functions, Gelfand-Levitan and Mar~enko equations, generalized translation, generalized convolution, Volterra operators, Toeplitz operators, Wiener-Hopf equations, Bergman-Gilbert operators, Kontorovi~-Lebedev inversion, generalized axially symmetric potential theory, canonical equations, deBranges spaces, random evolutions, scattering theory, inverse problems, filtering, smoothing, innovations, Darboux- Christoffel formulas, generating functions, reproducing kernels, random fields, linear stochastic estimation, Spectral measures, orthogonai polynomials, least squares, etc.

1. I n t r o d u c t i o n

Given that many natural processes are governed by second-order linear differen- tial equations, and related integral equations (at least to a first approximation) it is certainly no surprise to see that certain mathematical patterns and structures

recur frequently in physics and applied mathematics. We will try to weave the

theme of t ransmutat ion or intertwining of operators through certain areas in pure

and applied mathemat ics (quantum scattering theory, linear stochastic estimation, special function theory, inverse problems in geophysics, orthogonal functions and integral transforms, etc.). Transmutat ion (cf. [81]) is of course a simple idea. One takes here two second-order ordinary differential operators P and Q (we usually work on [O, oo)) and looks for B such that B P = Q B , acting on suitable objects (we write B: P---> Q). Usually B will be an integral operator with a distribution

kernel and there will be an inverse ~ --- B -1 in the sense of Volterra operators in

Page 2: Patterns and structure in systems governed by linear second-order differential equations

110 ROBERT CARROLL

C O (Schwartz topology) or L plo~ (we are not dealing however with operator similarity in any L p space). There are generally many transmutations P--> Q characterized, e.g., by their action on suitable generalized eigenfunctions, or by domains, or by various minimization properties, or as solutions of certain Cauchy problems, etc. Given the 'categorical' nature of the matter (e.g., roughly one might think of the differential operators as functors and transmutations as natural transformations) it is perhaps not surprising to see transmutation methods occupy (implicitly or explicitly) a pervasive role in the study of the operators P and Q as above (or in the study of related first-order systems). In fact whole areas of work in, e.g., quantum scattering theory and linear stochastic estimation revolve around this theme in the sense that transmutation methods (often implicit) are one of the principal tools used in constructing the theory. On the other hand, the use of transmutation methods to study eigenfunction expansions (via what were called transformation operators) goes back to the Russian school in the early 1950s (cf. [99, 149, 150, 166, 173]). In particular, in these studies one finds that via transmutation methods a differential operator Q, with some unknown features can be investigated in terms of another operator P (e.g., P = D2), about which everything is known. The transmutation machine not only provides a unifying structure and reveals significant patterns for such work, especially in relation to inverse problems, but it serves also as the vehicle to prove important theorems. We mention also a similar role of transmutation techniques in unifying and studying many results and patterns involving special functions (cf. [27, 29, 48, 49, 50, 53]). Although we have summarized and developed some of the trans- mutation material in book form (see [28, 29]) and in summary articles (see [30, 31]) new results and points of view have continued to emerge. There seems now to be some stabilization concerning the main lines of development and it appears that a systematic exposition of the transmutation theory should be possible and desirable (see [32] for what we hope will be, at least partially, a definitive treatment). We refer to [27-66] for the author's work on transmutation and in this article we will try to survey some of the main directions; in fact this also represents a survey of the principal material in [32].

Let us emphasize that we are trying to show the unifying structure and patterns in various kinds of problems without giving an exhaustive survey of the problems themselves. In fact, the use of transmutation methods has also been helpful as a guide and tool in developing new results about (for example) geophysical inverse problems (indicated later); thus the transmutation machine goes beyond mere unification in its usefulness. Let us remark that, relative to inverse problems, although transmutation methods are particularly suited to one-dimensional and certain three-dimensional problems, inverse problems in higher dimensions are only partially amenable to transmutation techniques and other methods are necessary (cf. [214-218, 175]); also this article is not designed to be a survey of inverse problems. Similarly, in dealing with singular differential equations and special functions we are concerned mainly with special functions arising from the

Page 3: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 111

radial Laplace-Beltrami operator in a noncompact Riemannian symmetric space of rank one - we have not explored the higher rank situations here nor have we treated special functions which arise, e.g., from combinatorics; even the general orthogonal 'polynomials' of Section 6 involve an underlying differential equation. Thus, to a specialist in any one area, the survey will seem incomplete and I can only ask that such a reader look at the whole picture. It is too much to expect that everyone's favorite result should be included. We generally refer to trans- mutation techniques as any of a variety of constructions and operations arising basically from a connection between generalized eigenfunctions (e.g., q~A°(y)= (fl(y,x), ~0xe(x))) or from a spectral form of kernel (here, e.g., /3(y, x )= ( l~(x), ~0°(y))~). One emphasizes and isolates what is intrinsic and canonical; this leads to machinery which applies generally to any admissible P and Q and permits whole theories to be transported back and forth. There will be a lot of notation - things need names and we have tried to follow some standard notation where possible. In any one field however there will of course necessarily be deviations from standard notation. Given the large amount of interaction be- tween various disciplines, in the hope of producing a readable report, we have decided to try to develop one theme at a time with only occasional connecting remarks. The connections will be evident as one continues reading and we have included some summary comments from time to time. Another feature of our presentation is to avoid frequently a precise description of the domain where various operators are acting. This gives some results a formal appearance but the alternative of specifying domains would bury the material in a maze of essentially trivial notation. Moreover, various operators are considered at different times to act on different objects (e.g., cosine transforms extend to distributions) so it is best to simply realize that the theory is certainly not vacuous and fill in the appropriate domain when needed or desired.

Let us remark that the transmutation theme might lend itself to some sort of categorical analysis of interpretation in a conceptually interesting manner. There are only a relatively small number of basic ingredients, namely the operators P and Q, the intertwining operators B and their kernels characterized by con- nections of generalized eigenfunctions, spectral pairings, minimization, Cauchy problems, Goursat problems, etc., certain critical structural equations such as the Gelfand-Levitan (GL) and Marrenko (M) equations, the role of analyticity, spectral asymptotics, and Paley-Wiener ideas in dealing with the eigenfunctions and triangularity of kernels (the latter being related to the underlying hyperbolic equations), and finally the connection to stochastic processes and filtering is an underlying feature. The theory is quite sensitive; via transmutation kernels it 'sees' the spectrum and the coefficients of the operators! Further examination of the precise nature of this sensitivity is probably worth pursuing. Thus, giving categorical notions linking the above concepts one might feel that the theory of second-order linear differential operators with regular singular points could be embalmed in a collection of arrows and diagrams. Although there seems to be

Page 4: Patterns and structure in systems governed by linear second-order differential equations

112 ROBERT CARROLL

little danger that this will happen, the connections between the various in- gredients just indicated could be developed further. For example, the theory of deBranges spaces (cf. [84]) as used in [87-89, 7] binds together certain ideas (cf. Section 7). One should probably not expect one all-embracing guiding directive to emerge however; there seems to be too much going on. Also let us remark that the manner in which transmutation ideas are involved in the various applied areas indicated differs generally in nature and in depth. This is related to the kind of information involved in the theory, what is measured or sought, the 'level' (differential or integral equations for example) at which one works, etc.

We will organize this survey around the following main subthemes: (A) Parseval theorems. A technique of Mar~enko [165] is exhibited which

connects operators Q = D 2 - q with P = D 2 via a transmutation Bh in such a way that general Parseval formulas and eigenfunction expansion theorems for Q can be obtained via the known Fourier theory for P. Extensions to singular operators are indicated also following [29, 34].

(B) Inverse problems. Some formulas from quantum scattering theory are indicated following [69, 93] and some transmutation techniques for treating one-dimensional inverse problems in geophysics are developed following [36- 42]. We discuss also some other techniques for geophysical inverse problems in 1 and 3 dimensions.

(C) Stochastic estimation. Some ideas from linear stochastic estimation involv- ing smoothing and filterning are sketched. Various integral equations arising in filtering theory for example are of GL type and their structure can be studied in considerable detail with a view to computation; in particular one obtains partial differential equations for the filtering kernels. The spectral representation of observation processes leads to a differential equation Q y ± = - A 2 y ± for the spectral innovations processes y~: and establishes further contact with scattering and transmutation theory (cf. here [32, 51, 52, 118, 158, 159]).

(D) General transmutations. Operators of the form Qu = (Aou')'/A o arising from the radial Laplace-Beltrami operator in rank one noncompact symmetric spaces will be of inmportance for special functions. We indicate how Paley- Wiener techniques, contour integration, and hyperbolic differential equations lead to general triangularity results for kernels and this yields canonical con- nection formulas of Riemann-Liouville and Weyl-type between special func- tions. We discuss generalized translation, generalized convolution, spectral pairings for transmutation kernels, general GL and M equations, and show how transmutation kernels can be characterized in different ways. In particular, one can characterize such kernels via minimization (with the GL or M equations arising as 'Euler' equations). There is also an intrinsic connection between this minimization and least squares estimation when there is an underlying stochastic process. Relations between connection formulas and general Goursat problems are also indicated.

(E) Special functions. We consider first various special functions arising when

Page 5: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 113

transmuting operators of the form x2~"+ x2[A 2 - tj(x)]~¢ = (v2-¼)~o with v as a spectral variable (instead of k - A which is fixed here). Such operators arise in quantum scattering theory and in geophysics for example, and their study here involves as particular cases a study of the Bergman-Gilbert operator as a transmutation, general Kontorovi~-Lebedev inversion theorems (e.g., a new Whittaker inversion theorem), some new results on generating functions via transmutation kernels, etc. Some further information on special functions of the type indicated in (D) is also included along with new results in the spirit of general 'orthogonal polynomials'. We also show via 'elliptic transmutation' how one can give for example a canonical (hence extendable) presentation of generalized axially symmetric potential theory (GASPT) with its related general- ized Hilbert transforms and special functions.

(F) Systems o[ equations. We sketch briefly some developments involving 'canonical' systems of equations following [6, 7, 87, 88, 163, 164] (cf. also [94, 110, 148]). In particular, one deals with equations J D x U - V U = AU in the context of deBranges spaces and reproducing kernels to produce expansion theorems, GL and M equations, scattering theory, etc. (see [32, 63, 156]).

(G) Let us mention two topics which we omit in this article but sketch briefly in [32]. These are first the ideas of random evolutions (going back to M. Kac) where, e.g., given vn = Av and T(t) a certain randomized time based on a Poisson process with intensity a, it follows that u = E[v(T(t))]--~(t) satisfies u"+2a( t )u '= Au (cf. [133]). Thus, E =expectation transmutes D 2 and D2+ 2aD via a random time. The subject was developed further in [111, 195], for example, to which we refer for further references. Another area involving 'differential' transmutations B =/3Dx + a related to Darboux transformations is partially developed in [235]. The motivation here involves the study of differen- tial equations and special functions arising in the theory of black holes (cf. [73]). There are connections to isospectral transforms, Crum transforms, etc. (cf. also [205]).

2. Parsevai Formulas

We sketch first a technique of Mar~enko [165, 166] for obtaining Parseval formulas and (generalized eigenfunction expansion theorems for Q --- D 2 - q on [O, o0). This shows how transmutation ideas enter into such investigations (cf. also [99, 149-151, 167, 173, 174]). In this connection we can use the following general result of transmutation (cf. [29, 33, 81, 115, 160, 167]).

THEOREM 2.1. Let P and Q be second-order ordinary differential operators on [O, o0, A and C linear operators commuting with P (with action on suitable functions), and extend all [unctions to be even in x on (-0% oo). Assume the Cauchy problem (y ~> 0)

P(Dx)q~ = Q(Dr)q~; q~(x, 0) = Af(x); tOy(x, 0) = Cf(x) (2.1)

Page 6: Patterns and structure in systems governed by linear second-order differential equations

114 ROBERT CARROLL

has unique solutions (in some suitable class of [unctions q~). Then defining B/(y) = ~0(0, y) it follows that Blff = QBf.

This follows immediately since if O(x, y)= P(D~)q~(x, y) then [ P ( D ~ ) - O(Dy)]O = 0 with qJ(x, 0) = Atff(x) and ~y(x, 0) = Clff(x). Hence,

B/if(y) = tp(0, y) = P(D~)q~(x, y)lx=o = O(Dy)q~(0, y ) = on f (y ) .

Let now ~0AOh be the solution of

O~0 = - - ) k 2 ~ 0 ; O = D 2 - q ; q~xOh(0) = 1; D~q~°h(O) = h (2.2)

where q can be complex. The corresponding eigenfunction of D 2 = P is ~0eh = cos )tx + h[sin )tx/)t]. One now constructs a Riemann function R for (2.1) with q e C 1 (here D2q~ = Q(Dy)q~) by successive approximations for example. Setting K(x, y, ~) = - [Re(~, 0, x, y) + R~(~, 0, x, y)] one can pass to q ~ C O and take x = 0 to obtain

Bf(y) -- [(y) + K(y , 0 [ ( 0 d~: (2.3) Y

(with K(y, 0 = K(0, y, ~)). Some further analysis then yields

T H E O R E M 2.2. Set

Kh(y, x) = h + K(y, x) + K(y, - x ) + h [ g ( y , ~) - K(y, - 0 ] d~.

Then one has a transmutation Bh (OBh = BhD 2 acting say on [ with ['(0) = 0), with kernel ¢th(y, x) = 6(x - y) + Kh(y, x), such that

q~°h(y) = cos )ty + Kh(y, X) COS Ax dx. (2.4)

Bh has a Volterra type (transmutation) inverse ~h (D2Nh = NhO acting say on functions f with f'(O) = h[(O)) with kernel Nh = yh(X, y) = ~(X -- y) + Lh(x, y). For q ~ C n one has, e.g., Kh ~ C n+l and the kernels Kh and Lh satisfy Goursat-type problems ( 0 = D 2 - q)

D~Kh(y, x) = O(Dy)Kh ; DxKh(y, 0) = 0;

(2.5)

Io' Kh(y, y) = h +{- q(n) dn;

D~Lh(x, y) = O(D,)Lh(X, y); DyLh(x, O) = hLh(X, 0);

Lh(x, x) = -- h - 1 q(ot) da. (2.6)

C O M M E N T 2.3. Transmutations can arise via Cauchy problems (Theorem 2. I).

Page 7: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 115

The actual construction of kernels can be achieved via Riemann functions and the kernels satisfy Goursat problems (Theorem 2.2).

We note that this procedure for P--~ D 2--~ Q allows one to transmute P ~ Q with no concern for identity of spectra, etc. Now define for [ e K 2= L 2 with compact support

Io Io ,~hf(Jt) = f(X)~OX,h(X) dx; ~f(A) = f(x) cos Ax dx = Cf(A); (2.7)

i0 o PF(x) = (2Dr) F(A) cos Ax dA.

Thus, P = ~-1 and one wants to determine a spectral 'function' R °, the Mar- ~enko generalized spectral function (which is actually a distribution in general),

such that one has a Parseval formula

of(X)g(x) dx = (R °, ~d(A )~hg()t))j, (2.8)

(f, g ~ K 2) from which an easy limiting argument for g,,(x)---> 8(x - y) yields

f(y) = (R ° , .~d(h)~0xO, h(y))x. (2.9)

Here one locates R ° as follows. Write K 2 = 0 K2(o ") where [ ~ K2(o -) means supp [ c [0, o-] and (by Paley-Wiener) ~K2(cr) consists of even entire functions g(A) with g ¢ L 2 for A real and (*) Ig(A)l-< c exp(cr[Im h[). Let Z(tr) denote entire even functions satisfying (*) with g ~ L 1 for A real. Put inductive limit type topologies on Z = U Z(o') and ~ K 2= U ~K2(or). Evidently Z c ~ K 2 and gl, g2 ~ ~ K 2 implies glg2 ~ Z. We will see that R ° in (2.8)-(2.9) belongs to Z' and when q and h are real (and suitable) (2.8)-(2.9) reduce to the standard L 2 pairings with R ° - d t o on ( - ~ , 0o) (spectral measure). The cosine transform is defined in Z' via a standard Parseval formula (CT, f )= (T, Cf). We sketch now the construction of (2.8)-(2.9) in order to illustrate how transmutation ideas play an intrinsic and fundamental role. Thus, first define

(fib(y, x), g(y)) = g(x) + f~ Kh(y, x)g(y) dy. (2.10) B*g(x)

Then for, say g e K2(cr), we see that B * g e K2(cr) and

( O ) ~ B * g = (cos)~x, (/3h(y, X), g(y))) = ((~Sh(y, X), COS AX), g(y))

= (~P~h(Y), g(Y)) = ~hg.

Thus Paley-Wiener type results for ~ can be passed to -~h - in particular, for f, g ~ K 2 we see that ,.~hf,.~hg E Z.

The next ingredient concerns generalized translation. These special trans- mutations can be defined quite generally as solutions of

Q(D,,)U = Q(Dy)U; U(x, 0) = Af(x); Uy(x, 0) = Cf(x) (2.11)

Page 8: Patterns and structure in systems governed by linear second-order differential equations

116 ROBERT CARROLL

with (Af) ' (O)= Cf(O) (cf. Theorem 2.1). Here, upon knowing (2.8)-(2.9), one might consider, e.g.,

U(x, y ) = T ~ ( x ) = (f(A)~OOX,h(X)~OOX,h(y), R ° ) x , (2.12)

where f = 3~f. Formally this U satisfies (2.11) with U(x, O) = f (x) and Uy(x, O) = hf(x) (so f'(0) = hf(O) is indicated - note also U(0, y) = f(y)). Thus with A = 1, C = h, and f = 8. (8. ~ 8 in ~') one sets 'experimentally' in (2.11)

f U (x, y) = dX (2.13)

(where R~()t) is to be determined). Such a generalized translation can be con- structed also via Riemann functions as before and some routine calculation shows that U~(x, y)---~ 8 ( x - y ) (cf. also (2.22) for an alternative proof). Now (2.13) leads to a determination of R, via 8,(x) = U~(x, O) = Ig' R n ( l ) ~ ° h ( x ) d;t. Indeed, since ~h~0~Oh = COS ;ty we have

Io' Io ~h~n(y) = 8n(y) + Lh(y, X)8,(X) dx = Rn(A) cos ,~y da (2.14)

and one obtains formally

f R,(~t) = (2hr) cos AyNhS~(y) dy.

Hence, (2.13) is permitted and

I : f(x)g(x) dx = lim(Un(x, f(x)g(y)) Y),

I: = lira R~(A)~'(A)~hg(A) dA (2.15)

= lim(R.(Jt), ~hf.~hg)x = (R ° , ~hfff2hg).

T H E O R E M 2.4. R . ~ R ° in Z' weakly so that the Parseval formula (2.8) holds (with the inversion (2.9)) and explicitly R ° = (2/Ir)[1 + CLh(y, 0)]. When q and h are real R ° is a spectral measure on (-oo, oo) and one recovers the classical L 2

theory.

COMMENT 2.5. Given the operator D z about which everything is known one can discover the spectral theory and expansion theorem for Q = D2-q with eigenfunctions o q~x,h by explicit and fundamental use of transmutation methods. Paley-Wiener information is, in fact, related to the triangularity of kernels (which arise here also from the hyperbolic nature of the underlying partial differential equations). The spectrum of (Q, q~Oh) can be quite general and is determined by Lb. There are various hypotheses on q which will produce acceptable trans- mutation kernels Lh (cf. also Theorem 2.6) but the method is thoroughly transmutational in nature; the machinery runs via properties of eigenlunctions

Page 9: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 117

and transmutation kernels (e.g., q~h(x) is entire in A of exponential type x, Lh(y, 0) is well defined, etc.) and, in fact, from (2.5) for example q is determined by Kh(y, y). One is tempted to think of the 'connection' D2--* Q as the natural habitat for hypotheses on Q (not q).

Let us indicate very briefly how this procedure can be extended to singular operators and special functions following [29, 34] (the notation is also needed later so we accomplish several goals). Thus, modeling operators Q on the radial Laplace-Beltrami operator in noncompact, rank one, Riemannian symmetric space we write (x ~ [0, ~))

Ou = (Aou')'/Ao + p~u - q(x)u. (2.16)

(Here po = ½ lim A~/Ao as x--> o0 is assumed to exist; its insertion in Q explicitly is basically a technical device to adjust spectra.) Typical (real) Ao here are Ao = x2"+l(po =0) and Ao = shEm+lx (Po = m + l ) , and we refer to [16, 17, 29, 34, 70, 71, 95, 98, 140, 150, 210, 222] for various types of hypotheses and detailed analysis. Generally A Q = x 2"+1 Co(x) for suitable positive Co and q is a suitable (complex) potential - for convenience we assume here that q has no strong singularities [Mx 2 near x = 0 in order that there should always exist spherical functions ~0°(x) satisfying (6) Qq~=-AEq~ with ~0x°(0) = 1 and D~q~°(0) = 0. Set lq°(x) = Ao(x)tp°~(x) and define

I; ~f(A) -- f(A) = f(x)l)°(x) dx. (2.17)

For comparison let Pu = (Aou')'/Ao + p2u (i.e., Ap = Ao with Q = P - q) and define Jost solutions ~ a ( x ) of Pq~=-A2~ which are asymptotic as x - - ~ to A~V2(x) exp(+iAx). One can write

~o~ (x) = ce()t)~P(x) + cp(--A)~-PA(x) (2.18)

and define ~ f as in (2.17) with fl~ = Atop[; one has for general classes of Ap (= Ao here) an inversion f = ~ f in the form (cf. [29])

I; [(x) = ~f(A)~xe(x) dr(A); dv = R0 dA = dX/2~rlo,(x)l z. (2.19)

We assume Ro is known now although if not there are techniques for 'discover- ing' it via a transmutation Be: Dz--*P (cf. [29]). Let now B: p..o, O be the transmutation characterized by B~0~ e = ~0~ ° (further details appear in Sections 4 and 5). Because of the identity Ae = A o , B will have a kernel /3(y, x )= 8(x - y) + K(y, x) and @ = B -1 has kernel 3,(x, y) = 6(x - y) + L(x, y) (with tri- angularity as before). We will assume Ae(x)L(x, y)A~l(y) is continuous for 0 ~ y ~< x and define [(x, y) = L(x, y)a~'(y) with [(x, 0) = f(x). This is known to be realistic for important classes of q, Ao, etc. (cf. [29]) and will be our substitute for more explicit hypotheses on q, Ao, etc. One can define spaces analogous to

Page 10: Patterns and structure in systems governed by linear second-order differential equations

118 ROBERT CARROLL

K 2, ~ K 2, Z, etc. in which the transforms act and which are adapted to

Paley-Wiener type interaction (here the space analogous to Z will be called W), The Parseval formula we want now is to have the form

I; (R °, = Ag2f(x)A 2g(x) dx. (2.20)

One uses the same ingredients as before for Theorem 2.4 - thus, with 8, as before write 8 , ° = 6,[Ao and experimentally set

TY,,8°,(x) = (R,~(A), ¢pA°(x)¢x°(y))v (2.21)

where ( , )v denotes the P-spectral pairing based on dv in (2.19). Now via direct

constructions as before or from the formula (cf. [29, 32, 150])

(TY,,f(x), Ao(x)g(x)) = (Ao(x)f(x), T~Yg(x)) (2.22)

one sees that TY,,8°,(x)~ 8(x - y)lAo(x). On the other hand for y = 0 (2.21) gives

8°(x) = (R.~(A), q~°(x))~ so ~ 6 ° ( y ) = (R~(A), q~xP(y))v = ~ R ~ ( ~ = $-1) .

Hence,

R~ = ~ ~ 8 ° = ~[8,°(x) + (L(x, y), 6,°(y))] ~ 1 + ~ f.

Consequently, multiplying (2.21) by Ao(x)f(x)Ao(y) g (y), integrating, and taking limits we have

T H E O R E M 2.6. R~Ro--~ R ° = Ro[I +~(] weakly in a certain space W' and (2.20) holds with ~ f ~ g ~ W. This leads to f(x) = ~ ( ~ f ) = (~f(A)q~a°(x), R °) for f as indicated.

C O M M E N T 2.7. The transmutation machinery of Comment 2.5 can be exten- ded to determine the spectral theory and expansion theorem for singular (Q, ~0~ °)

in terms of a known singular operator (P, q~x e) (Ae = Ao, Q = P - q). In fact the method extends to A o = ApCo for suitable positive Co (cf. Section 6) and prototypical are the known situations Ap = x 2"+1, Ae = sh2'~+~x, etc.

R E M A R K 2.8. Let us make a few comments here about Darboux-Christoffel- type formulas which play an important role in various contexts (cf. Theorems 4.8 and 4.15 for example as well as Section 7 for systems). Thus, let Qu = (Aou')'/Ao + 0~u = - A2u for simplicity with q~O, f / o , etc. as above and do) o =

I I dA/21r[co[ 2 = tb o da. For W(q~, q~) = q~xq~,- q~q~ one easily obtains

Io AoW(q~x, q~)(T) = ST(A, /z) = (A 2 --/x 2) f~Ox(X)q~°~(X) dx.

One defines a reproducing kernel

= fix (x)~p~,(x) dx. (2.23) At(A, /x) = [~r(A, ~)/(A 2 - /x2)] o o

Page 11: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 119

Thus, dtoo being known, one can set fr(;t) = f~ q~°(x)f(x) dx for suitable f and it is easily checked that ~fr()QAT(A, /z)dto o = fr(/~). NOW note that from the inversion formulas ~ = I and ~ = I acting on suitable objects one has formally

Io Io fl°(x)q~°(x) dx = 6(A -/x)/tbo and I~°(x)~0°(y) dto o = 6 ( x - y).

Thus, ¢$-r()t,/z)¢ho ~ ()t 2 - tx2)8()t-/.t) and, hence, in its action on suitable func- tions 8t()t, / . t )~0 for A, /x real. This is useful in establishing various results involving formulas of the type (Qq~O, ~o,xl =~q~,,, o Q.f~o) for example (note

IoT Oq~°fl° dX= Ior "~°r~*n° dx + ST(A, ~ ,

Further, let us show how AT(;t, t~)&o ~ ~()t - tz) in its action on analytic f of the type ~ f which arise naturally in the theory. Thus, use (2.18) with ~ o _ A~ 1/2 exp(i)tx) to obtain ( c - = co(-A) etc.)

A T ( A , ~) ( ) t2 _ ~.£2) = A o W ( ~ A ' ~otx ) ~ cxcp. exp[i(A +/~) T]i(lz - A) -

- cxc-~ exp[i(A - / z ) T]i(A +/x) +

+ c.c-~ exp[i(/z - A) T]i(A +/x) +

+ cxc~, exp[- i(A + p.) T]i(A -/~).

Now one need not assume a priori knowledge of d~o but if we simply try Er(/z) = $~ AT(A,/~)f(A) dA/2~rlcol 2 there follows

f =r(l~)~[ic, c , r /2zr][ = f(X)e-ar__ dA [ic-e-,~,T/27r] f(X) e a r d x J -~ c o ( X ) ( x - ~ ) ~ c o ( - X ) ( x - t~)"

(2 .24)

Now typical situations involve, e.g., co(-)t) analytic for Im A > 0 and 1/c~ polynomially bounded so that, using distribution arguments when necessary, one obtains by contour integration ~a-(/~) ~ f(/~) (note f is even).

REMARK 2.9. In this paper we will not dwell extensively on various aspects of transmutation in connection with special functions arising from singular differen- tial operators Q (see, however, Examples 5.1 and 5.7, Theorems 6.14 and 6.15, and assorted formulas in the text). Generally speaking, one is dealing with 'isomorphic' theories of integral transforms etc. based on the various spherical functions and Jost solutions and some of this is indicated or suggested in Section 5. Thus, the theories of the Fourier cosine transform, Hankel transform, general- ized Mehler transform, Fourier-Jacobi transform, etc. are all basically equivalent and the ingredients can be transported back and forth via transmutation opera- tors. Many connection formulas between special functions of the type involving Riemann-Liouville and Weyl type fractional integrals (or Erd61yi-Kober opera- tors) are also transmutation formulas (cf. Example 5.7 and Theorem 6.18).

Page 12: Patterns and structure in systems governed by linear second-order differential equations

120 ROBERT CARROLL

3. Inverse Problems in Quantum Scattering Theory and Geophysics

Since there are already available a number of excellent surveys of Gelfand- Levitan-Mar~enko methods in quantum scattering theory we will only sketch this briefly (of. [29, 69, 79, 93, 135, 165, 175-177]). Take q real with some sort of condition like ~o ® xlq(x)l dx < oo (which can be relaxed) and denote by 0x ° the solution (called regular in physics) of (t) O u = - A 2 u satisfying 0x°(0)=0 and D,,O°(O) = 1 ( O = D 2 - q ) . One has Jost solutions of (t) dP~°~(x)-exp( + i)tx) as x ~ 00. In physics A ~ k with k 2 = E (energy) and we omit for the moment the angular momentum term l(l + 1)/x 2 (cf. Section 6); the equation 0") comes from a radial Schr6dinger-type equation with a change of variables. We suppose q is unknown here and one performs experiments to determine the phase shift 3(A) produced by the potential upon incident waves. This phase shift can then be used to determine the spectral measure for (Q, 0 °) (we assume here for simplicity that there are no bound states - discrete eigenvalues). Thus, first ones writes

O°x(x) = F(-A)cbx°(x)- F(A)OP°-~,(x)/2iA, (3.1)

where W(¢, ° , ~_°x) = - 2iX and F(A) = - W(O ° , dP°). Then

and

F(X) --IF(X) I exp(-i~(;t))

F(A) = exp[-(2/~r) 8(/x)/z dp./(/z 2 - ;t2)].

Moreover, one can show with a routine contour integral argument that the spectral measure is

dto(X) = 2A 2 dX/~riF(X)lL (3.2)

In various ways a connection formula can be derived in the form

Io' 0f (y ) = [sin )ty/1] + K(y, x)[sin ~tx/~t] dx (3.3)

(e.g., using techniques of Section 2 or Paley-Wiener arguments - the latter is discussed below). Then write dco =dcr+(2 /~r )12d l and one obtains from (3.3) (cf. Section 5) a GL equation (x < y)

g ( y , x) + l l (y, x) + K(y, 011(~, x) d~ = 0, (3.4)

I; l l(x, y) = [sin )tx//t][sin/ty/~] dcr(1). (3.5)

We know K exists and one easily shows that the Fredholm equation (3.4) has unique solutions. Some further calculation then yields the potential via

Page 13: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 121

q(x) = 2DxK(x, x). (3.6)

This is very neat and the formulas (3.3)-(3.4) have a canonical transmutational nature (cf. Section 5). Even neater is the manner in which the transmutation machine can be used in geophysical inverse problems. Thus, assume the earth is flat and stratified vertically downward (x ~> 0). One considers SH shear waves satisfying

p(x)v, = (Ix(x)vx)x, (3.7)

where p is density and g is a shear modulus. Given an impulsive input v,(O, x) (or vx(t, 0)) the object is to determine p and tt from the reflection readout data G(t) = v(t, 0). Somewhat more complicated input data will accomplish this (cf. below) but the best one can do from this experiment is determine the acoustic impedance A = (/9//.) 1/2 as a function of travel time y = Jd (p/g)llz d~: (cf. [1, 2, 8, 12-14, 23, 26, 29, 36-42, 103, 113, 107, 209, 155-157, 206, 207, 214-217]). The treatment here is based on work of the author and F. Santosa [36--42]. Thus, change the variables in (3.7) to obtain

v, = (Avy)y/A = Q(Dy)v; v,(O, y) = ~(y); v(t, O) = G(t) (3.8)

and v = 0 for t < 0. We will assume 0 < a <~ A ~</3 < 0% A ~ A~o rapidly as y ~ o0, A(0) = 1 (which can always be achieved by a change of variables), and A e C 1. It would be nice to be able to assume A e C ° or A piecewise continuous but this doesn't seem possible at all stages of the analysis with any of the known exact techniques. Let ¢ o be the solution of (11) Qu = -/~2// satisfying ¢°(0) = 1 and Dxq~°(0) = 0. Let ~ o be 'Jost' solutions of (11) so that ~ o ( y ) _ A~1/2 e±i~y as y---~ o0. We write as in (2.18)

~O(y) = co(;t)cbOa(y) + Co(_A)~o (y). (3.9)

Now q~x ° and D ° can be constructed via formulas of the type (q = - A' /A)

Io' q~O(y) = cos Ay + [sin A(y - n)lX]q(n)D,~q,°(n) dn, (3.10)

~ ( y ) = A2 ~12 e ~" + [sin A(r I - y ) / A ] q ( r l ) D ~ ( r l ) dn. (3.11)

Solutions can be found in the form ~o ° = ~ q~,(A, y) for example where the q~, are determined recursively. One finds that q~A°(y) is entire in A of exponential type y with I~o~°(y)l-< c eyllmMe I~ Iqldn while ~O(y) is analytic in the upper half plane with a bound there of the form I~°(y)l~<ce-Y~mAe*S7 Iqlo'~. From A(y) W(4~Ao, ~ o ) = -2 iA we have D x ~ ° ( 0 ) = 2iAco(-A) and Aco(-A) is analy- tic for Im A > 0 while in general I1/Co(-;t)l<-c for Im A 1>0. There are no discrete eigenvalues and a variation of standard contour integral arguments gives the spectral measure

Page 14: Patterns and structure in systems governed by linear second-order differential equations

122 R O B E R T C A R R O L L

dto = dA/2~rlco(A)l 2 = ~b dA (A 1> 0). (3.12)

(One remarks here that it is analyticity and asymptotic properties of eigen- functions which lead to this kind of result and generally such properties along with properties of transmutation kernels make the machinery work.) One has now a Parseval formula

Io I0 A(y)f(y)g(y) dy = (L ~)o, ; f = ~ f ( x ) = A(y)/(y) ,p°(y) dy (3.13)

and the corresponding inversion holds (cf. (2.19)). Now for (3.8) the solution can be written as

v(t, y) = (~o°(y), [sin At/A]), (3.14)

and it is interesting to note here that a Riemann function for (3.8) has the form R(y, t, ~, ~-) = (q~°x(y)q~°(~), [sin A( t - I-)/A])o,. From (3.14) G(t) = v(t, O) = (1, sin At/A),o from which we obtain

THEOREM 3.1. The spectral measure for (0, q~°x) is determined directly from O( t) via

io o ~(A) = (2MTr) G(t) sin At dr. (3.15)

COMMENT 3.2. In inverse quantum scattering theory of one-dimensional in- verse geophysical problems one performs an experiment to determine spectral information for the operator O governing the response of the system. This spectral information will then be used to determine the coefficients of O.

The result (3.15) appears to say that one must read for a long time in order to determine ~(A) but in fact one can expect fairly rapid stabilization. Next from the fact that X(Y, A)=(2i /A)[q~(y)-cosAy] is entire of exponential type y (and X e L~ for A real) we obtain via Paley-Wiener ideas

X(Y, A) = g (y , ~) e i~ d~. (3.16) y

Here K(y, x) is odd in x with K(y, 0) = 0 and (3.16) can be written (for/~(y, x) =Kx(y ,x ) ) (O)~o°(y)=[1-K(y ,y )]cosAy+[ .~K(y ,x )cosAxdx . Using this with (3.10) one obtains after some calculation

1 - K(y, y) = A-11a(y). (3.17)

Thus, knowledge of K(y, y) will determine A(y) and one is dealing here with a transmutation B: cos Ax--~ ~O(y) with kernel ~(y, x) of the form

~(y, x) = A-1/2(y)~(x - y) +/~(y, x). (3.18)

In order to determine K(y, x) one uses an integral form of the canonical GL

Page 15: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 123

equation (cf. Section 5) which we simply display here (cf. Theorem 3.10) as (x < y)

I0' K(y , x )+ T ( y , x ) = K(y,'o)T~Co, x) drl, (3.19)

I; r ( y , x) = [sin Ax/A] cos Ay do-(1) (3.20)

(do '=d~o-(2/~r)dA). This equation (3.19) has a unique solution and in fact K can be obtained numerically using computer techniques (cf. [206, 207]). Then

T H E O R E M 3.3. The inverse problem (3.8) [or A(y) can be solved uniquely via the GL equation (3.19) using (3.17).

Now the GL equation has a version in the time domain which is very useful. Set

I; G( t )= [sinM/~t][d~+(2/Ir)dA]=l+Gr(t) (t > 0). (3.21)

Here 1 = Y(t) (Heaviside function) represents the response when A = 1 to a

delta function input - i.e., v(t, y) = Y ( t - y) with v, = 8 ( t - y ) ~ 8(y) as t ~ 0 (or vy = - ~ ( t - y ) ~ - ~ ( t ) as y--~ 0). This response is then present in all situations for variable A. It is now easily seen from (3.20)-(3.21) that

Ty(y, x) = ½[G'r(y + x) - G'(]y - x])], (3.22)

K(y,x)+~ar(y+x)-G,(y-x)]=½ g(y,s)[a'~(x+s)-a'r(Ix-sl)]ds

(3.23)

(the latter for x < y). This form of the GL equation can be used for a stability result. Thus if one has polluted data G*(t) = 1 + G*(t) with corresponding kernel K* satisfying (3,23) (and A* determined by (3.17)) we write • = G, - (3, with AK = K * - K and use (3.23) to obtain estimates of AK in terms of • and •'. Let II/ll ,y = supl/(s)l for 0 <~ s <~ y and then

T H E O R E M 3.4. For Ile'llc~(2~) sufficiendy small one has IIAK(y, ")[l~y < - c[[I,[l~,=y +ll,'llLl(2y>]. Consequently an estimate on AA = A * - A results [rom (3.17).

COMMENT 3.5. The GL machinery for either quantum scattering or geophy- sics takes spectral information and produces coefficients. The geophysical inverse problem is in fact stable (with reasonable norms) and one remarks here that this is exceptional - most inverse problems are not well posed.

One considers next a transmission problem where the readout occurs at some > 0 corresponding to 9 = y(~). The model we treat here is a kind of subproblem

Page 16: Patterns and structure in systems governed by linear second-order differential equations

124 ROBERT CARROLL

arising from some problems in spherically symmetric scattering and one can envision also problems in one-dimensional tomography for example leading to transmission data. We assume A(y) = A= for y ~ ~ and set H(t) = v(~, t) for the transmission readout. If one can obtain G(t)= v(0, t) of course it will lead directly to a solution of the inverse problem as before. If not we use H(t) and in fact one obtains interesting mathematical information from H(t) which is not available from G(t). Thus from (3.14)

n( t ) = (q~o(~), [sin )tt/A]),, (3.24)

from which ~7(y)d~/)~ = (2/rr) ~ H(t) sin At dt and consequently from (3.15)

Io Io ~°.(9) G(t) sin •t dt = H(t) sin At dt. (3.25)

The obvious deconvolution problem suggested by (3.25) is, however, not the best approach and we use the following splitting technique together with the trans- mutation machine ((3.25) is used later in another way - cf. (3.30)). First remove the 1/I factor in (3.24) by working with

g ' ( t ) = (~o(~), cos 17),o = q,°(p)o~ e ~'' dX. (3.26)

If we write now ' t~°(y) = ~°(y ) / co ( -1 ) and

Hx(t) = (1/4w) ~ ( ~ ) e -ix' d)t (3.27) o ~

then H'(t) = H~(t)+ H~(-t) where H~(t) = 0 for t < 0 (in fact Hx(t) = 0 for t < by a contour integral argument). Here H ' is considered as an even function by virtue of the cosine representation in (3.26). Hence ½~x°(~) = ~H1 =/7/1 (Fourier transform) and since A(y) = A~ for y 1> ~ with ~o()~) = A71/2 exp(i)t~) one has

T H E O R E M 3.6. The transmission readout HI = H' for t > 0 determines Co(-A) via [1/ Co(- A ) ] = 2 A~/2 exp(-iA~)/2/l()t). This determines a splitting of the spectral measure (go(A) -- co(-A) for A real) in the form go = [1/2~'1col a] -- (2/Tr)A l/ ll z.

R E M A R K 3.7. Although we have promised to refrain from intertwining remarks in the text, we feel compelled here to mention words like Wiener filter, Hardy spaces, etc. and refer to Sections 4, 7 for further details. Note also that one expects rapid stabilization of HI so computation is possible in a finite time.

Now split G'(t) in the form G'(t) = Gl(t) + GI ( - t) where Gl(t) = 0 for t < 0 is

Gl(t) = (1/4~-) W°(0) e -'xt dA. (3.28) o v

Putting l /co(-A) into (3.28) from Theorem 3.4 and rearranging one obtains an interesting finite domain of dependence relation

Page 17: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 125

I" ~+t

Gl(t) = Jy Hl ( r )K( t - r) dr, (3.29)

where K, however, involves the unknown ~°(0). This form suggests a procedure bo be indicated below where one obtains A by making data observations only on specific finite intervals of time. Even with stabilization of readouts one is not thrilled in practice by being obliged to use (3.15) or Theorem 3.4 to compute ~b. In passing let us write Y~(t) =S_~® Hi(r+/)Hl( ' r ) d r so o~y{= I#,1 =. Then from G'(t) = Sg' ¢b cos At dA and with an adjustment of 2 for the cosine representation one obtains (note also ALnHl(t) = 8 ( t - y) + hi(t))

THEOREM 3.8. For t > 0 one has G'(t)= Gift)= A~Y{(t) and stability can be obtained via Theorem 3.4 from estimates

( ;; ) h( t )= hff'r) d z , Ile'll L H0,er, ~< ctlA h,llLl(y ~) ;

REMARK 3.9. Returning to (3.25) one can multiply by (2/¢r)sin )tr and in- tegrate to obtain after some calculation, for r >

I0' N(~')=½[G(¢+~')+G(~--~)]+½ K(~,s)[G'(~ ' -s) -G'(r+s)]ds .

(3.30)

This is actually part of the canonical extended GL equation (cf. Section 5) which can be derived canonically as follows. Recall (3.14) and use (3.15) to obtain

I; [ I0 ] v(t, y) = (q~O(y), [sin At~X]),, = G(r) (2/7r) ~0°(y) sin At sin a r dX dr.

(3.31)

Now/3(y, x) in (3.18) has in fact the canonical form

f ¢t(y, x) = (2/~r) ~O(y) cos ,~x d l .

We treat G as odd now in (3.3 I) because of the representation (3.21) and (3.31) becomes v(t, y)=½Cl(y, . )* G. Then using (3.18) one obtains after some cal- culation

THEOREM 3.10. The extended GL equation has the form (~'> 0)

H(-r) - K(~, ~')= IN()7, r )+½g(y , . )* G' (3.32)

where gr(~, ~-)=½[G(r+9)+ G ( r - ~ ) ] and we treat K05 , ~) as odd in ~ with K(~, 0) = 0, G as odd, and G' as even. Equation (3.32) yields (3.30) for ~" > ~ and (3.23) for 1-< Y-

Page 18: Patterns and structure in systems governed by linear second-order differential equations

126 ROBERT CARROLL

Going back now to (3.29) we conjecture that the following procedure should lead to an effective computational scheme. First one proves an extension formula for K(y, x) from 0~< x <~ y ~< 9 to say 29/> y >I 9 (and appropriate x) (see [41]).

We assume readout data H recorded for 9 ~ t <~ 3 Y- Pick some data G on [0, 2 Y] as a first approximation to determine K on 0 ~< x ~< y ~ Y; extend K to the larger region; using the GL equation determine then G on [29, 49]; from this and the known H data use (3.30) to obtain G data F(G) on [0, 29] again. A fixed point G = F(G) is then the solution of the inverse problems and leads to A via the machinery indicated earlier. Theoretical estimates are possible for this procedure but very unpleasant so one hopes to check first on a computer that an iterative process converges (at least for 9 small).

COMMENT 3.11. The transmission problem contains more structure intrinsic- ally and leads to a splitting of the spectral measure. This will be seen later to be connected with situations arising in filtering theory. The general extended GL equation in the time domain gives a model (extended canonically in Section 5) where ideas of triangularity and causality interact nicely. Much of the interesting mathematics here has a physical interpretation and the physics and mathematics each serve as a guide for the other.

There are several other distinct techniques for treating the one-dimensional geophysical inverse problem with reflection data (cf. in particular [1, 2, 3, 12-14, 23, 26, 103, 107,209, 113, 155-157,208, 214-216]) and we sketch briefly here a technique of layer stripping (cf. [155-157]) which is related to some procedures in linear estimation which are discussed in Section 4 (where relations to trans- mutation are indicated). The application here to seismic problems is due to Levy and Yagle [155, 157]. One takes v as displacement and P as pressure so that the basic equation is /av~ = - P ~ with P =- /zvx . Let y be travel time and A be impedance as before and set w = vt (velocity). Then one obtains a system Wy = - A - 1 p t ; Py = - A w , . Write now ~ = A-X/2p, ¢b = Al/2w, p = ½(xIt + ~) , and

q = ½(~ - ~). Then with 'reflectivity' (A) r = ½Dy log A(y) one has py + p, = - rq;

qy - q, -- - rp . One notes the analogy here to a lossless transmission line problem with • - Z -1/2 V and d~ = Z1/2i with i = current, V = voltage, Z = impedance = (L /C) 1/2, and y = S~ (LC) 1/2 de again represents a travel time. The input now is, e.g., P(0, t) = PoS(t) and one reads, say

w(O, t) = Wo[6(t)+ 2~(t) Y(t)] with Po/wo = A(O) = 1

(thus take w0 = 1, Po = 1, and G ' = 8(t)+2~,( t )Y( t ) to connect this with (3.8)). The downgoing and upgoing waves p(0, t) and q(0, t) then have the form

p(0, t) = ~ ( t )+ ~(t) Y(t); q(0, t ) = - ~ ( t ) Y ( t ) .

Further, write now p(y, t) = ~(y - t) +/5(y, t) Y ( t - y) and q(y, t) = ~(y, t) Y ( t - y) to obtain the so-called fast Cholesky relations (or downward continuation recur- sions)

Page 19: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 127

+ p , = - = r(x) = x) . (3.33)

When the measured waves p(0, t )= g(O and t~(0, t ) = - ~ ( t ) are used as initial

data in (3.33) one obtains, upon discretization, a rapid 'layer stripping' numerical procedure. If Fourier transforms in t are taken in, say, (3.33) one has a frequency domain counterpart referred to as the Shur recursions. There is also a variation of (3.33) arising in linear estimation theory called the Krein-Levinson recursions but the procedure is somewhat different (cf. Section 4, Theorem 4.6). If one considers an impulsive pressure wave obliquely incident to the medium, the layer stripping technique can also be used and data from two incident angles allows one to recover p and /x as functions of x (cf. also [14, 37, 177, 218, 209, 217]).

COMMENT 3.12. Layer stripping techniques are being energetically developed at the present time in various areas (see loc. cit.). They are numerically realistic and embody a nice interaction theoretically between physical and mathematical ideas (el. also [63]).

We mention briefly also some results of the author and Santosa [37, 42] using transmutation methods for solving some three-dimensional inverse problems based on a formulation of Blagov~enskij [14] (whose results in the form of nonlinear integral equations seemed intractable). Our results are also a bit unrealistic for numerical computation but they have a number of interesting features. First let us note (since it is needed below) that if input in the one- dimensional problem (3.8) is taken in the equivalent form vy(t, O)= f(t) (rather than v,(0, y ) = - f ( y ) ) then it is easy to see that

~0 t v(t, y) = v~(t - r, y)f(~') d r (3.34)

where v ~ is the inpulse response wave to a delta function input. Then 0 ( t ) = ~ G~(t - ~-)f(~-)dr and if the input f does not excite all frequencies, the recovery of the impulse response GS(t) (our G(t) previously) from O(t) may be impossible. Now the three-dimensional problem of [14] is a sort of Lamb wave problem for a stratified half-space Xl = x >t 0. The equations for displacements u~, with im- pulsive stresses, are (p = density and (X,/z) represent the Lam6 moduli)

(A -t- I~)uj , j i -t- I.~ui,ij d- A1 uj,jt~li q- lt~l(/g 1,i 31-/'/i,l) ~-- Dui j t ; (3.35)

rl, = 8(x2, xa)8(t) at x = 0; ui(t, x) = gi(t, x2, X3) "~- readout at x = 0. One defines new quantities vi(t, x) =SS u~ dx2 dx3 and w(t, x) = JS X2Ul dx2 dx3

with travel times yl(x) = j~ (p/)t + 2/,) 1/2 d~ and y2(x) = Sff (p/~)1/2 d~. It is enough to consider two vi equations in the form

Vj, n = A ] - I ( A j v j , y j ) y j (j = 1, 2); vi(t, O) = hi(t) (3.36)

where A1 = [p(A + 2/,)] 1/2, A2 = (pp,)l/z, and vj.j(t, O) -- 8(t)/Aj(O) (vi. j denotes

Page 20: Patterns and structure in systems governed by linear second-order differential equations

128 ROBERT CARROLL

the derivative in yj here). The w equation is

wn = (A1 wy,)y,/A1 - B(yl)v2(t, Yz) - D(yl)v2,y~(t, Y2) (3.37)

where D is known but not B and one knows (4k) wl(t, O) = MO)h2(t)/Al(O) with w(t,O) =j( t ) . The vi problems are the same as before and one finds Aj(y~) (j = 1, 2) with dy2/dy~ = A~(yO/Az(y2) determining Y2 = y2(yl). Also from the GL kernels Kj(yj, s) etc. one constructs q~°(yi) etc. which lead to vj explicitly. This allows one to determine D(yl) above but B(yl)= (p /AO[(A~-2A~) /p] I is un- known. To solve (3.37) one thinks first of Wl(t, 0) above as generating a solution w h to the homogeneous equation (which is the v~ equation) and then from (3.34)

wh( t, Yl) = )t(0) h2('r)l)l(/- r, yl) dr. (3.38)

Hence, wh(t, 0 ) = M0)(h~* hz)(t) and we write w = wh+ W i where w i satisfies the inhomogeneous w equation (3.37) with w~(t, 0) = 0 and wi(t, 0) = j ( t ) - M0)(hl* h2)(t). After some calculations (using the principle of no incoming waves from ~), one arrives at the following (horrible!) integral equation for B (F(M is known)

F(M = ~x°(~)Wxe(y)B(y)Ao d)~ (3.39)

where, e.g., ~O(y) = ~O(y)/co(_)t ) and Ao(~) d~ = Ae(y) dy determines ~ = ~(y) or y = y(y). Here A -- A for the vl or v2 equations. Equation (3.39) can actually be handled quite effectively by transmutation methods and motivates a certain amount of work on integral transforms with kernels ~ o (cf. [29, 43]). Indeed, taking Fourier transforms in (3.39) we get

f(t) = B(y)(~(y, t) dy = (1/2¢r) B(y)Ae(y) e-a 'qt~°(9)*e(y) dA dy. o o

(3.40)

From general transmutation theory (cf. Section 5), there is a transmutation /3o: D2"-* O adjoint to Bo:cos)tx--->q~°~ such that / 3 o [ 2 e ~ X ] = ~ ° ( y ) . Also ~o(Y, x) = kernel /3o has the form

(11) rio(g, x) = (cos ,~x, q~f(~))..

= ao ' /2(0)aZ)~/2ff )a(x- 9) + gQ(~, x) (~o = o~o)

with / (o(Y, x) = 0 for x < ~ (anticausality). Thus, e.g.,

I; * 0 ( 9 ) = 2 /3o(Y, x) e "x dx = o~[2fio(~,.)]. (3.41)

From (3.40) :Td(y, • ) -- q,o(~)q~f(y) (recall y = y(~)) so it follows that

Page 21: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 129

t)(y, t) = 4ae(y)[fio(L" )* fie(y, )](t) (3.42)

I ' f i = 4Ae(y) r,(y, s)~o(y, t - s) ds.

Using (IlL one arrives at a Volterra-type integral equation

Io r ( ' )

[(T) = B(~') + B(y)/((y, T) dy. (3.43)

where T(~-) is a known monotone function of ~'. This can be solved in various contexts by variation of Volterra techniques and yields a unique solution B. Then given B(yx), p(Yl) can be determined and, subsequently, p,/~, )~(x) will be calculable from the information we already possess about A~, A2, y2(yl), etc.

COMMENT 3.13. Three-dimensional inverse problems involve many new fea- tures and ill posedness arises naturally. For quantum scattering theory a recent technique of R. Newton (cf. [175]) is very effective. For general problems let us mention, e.g., [156, 157, 155, 215-218] for various points of view and consider- able insight. The version given here for tLe geophysical problem seems to be an improvement over that of Blagove~enskij (who arrives at a system of nonlinear integral equations) and it shows how transmutation methods are useful; however it is not recommended for computation.

REMARK 3.14. Referring back to the one-dimensional problem, from (3.14) one has

vt(t, y) = (~px°(y), cos At),, = fi(y, t) = A-l(y)y(t , y)

with

kernel B -1 = y(t, y) = A1/2(y)8(t- y) + L(t, y).

Hence,

G'(t) = vt(t, O) = ~(t) + L(t, O)

(recall A(0) = 1) and one can write tb(A) = (2/zr)[1 + ~cL(t, 0)]. This is exactly the same as the result in Theorem 2.4.

4. Linear Stochastic Estimation

We will sketch first some ideas in linear stochastic estimation which involve integral equations of GL type and lead to partial differential equations and ordinary differential equations of the type found in transmutation and scattering theory. There are many very strong connections between these theories and also the type of minimization which characterizes certain transmutation kernels has a direct correspondence to linear least squares estimation when there is an under- lying stochastic model. We will extract from many sources; in particular the Kailath 'school' has been particularly influential. Thus let us cite [86, 89,

Page 22: Patterns and structure in systems governed by linear second-order differential equations

130 ROBERT CARROLL

117-132, 144-146, 158, 159, 188-191, 196, 197, 212, 237, 239, 242] tor major source material and in our survey we will not usually pinpoint a specific origin for a result or point of view. We do not touch upon nonlinear stochastic filtering or upon stochastic differential equations (beyond the most elementary considera- tions). Also neglected here is the subject of Kalman-Bucy filtering.

Let us first give a few background ideas and notation from probability theory, following [239]. Thus, generally we will want to deal with stochastic processes X, ( = X,(to), to ~ f~, t ~ T, etc.) with EX, = Sa Xt(to) dP(to) = 0, EIX, I 2 < % and X, mean square continuous in the sense that ElXt+h-Xtl2"--')O as h---~0. We can assume Xd" ) is measurable and separable with autocorrelation R(t, s) = EX, ffs continuous and nonnegative definite (for convenience, let us also assume the Xt to be Gaussian). We recall that X, is called (wide sense) stationary if R(t, s)= R ( t - s ) is a function of t - s (with EIX,12< ~). Let Hx be the Hilbert space generated by Xt, t c 7 ~, via completion of finite sums ~ otjX(tj, to) in the topology determined by II = El YI = (here Xdt0) = X(t, to)). Then, e.g., Sb f(t)X, dt (limit in Hx) exists if and only if ~Sf(t)f(s)R(t, s)dtds exists as a Riemann integral. For stationary processes with, say, R e L °°, there is a finite Borel measure such that

R(r) = (1/2 zr) e -'x" dF(h) (4.1) o o

and for convenience here we will usually assume F(dh) = dF(M =/~(h) d;t (/~ = ~R). Associated with such a stationary process is a spectral process with orthogonal increments X, such that

)fb - X. = (l/2rr) ~ e i"' dh Xt dt; E dX~ d)~ = 3~F(dA)121r,

(4.2)

x, = J_~ e -~xt dXx. (4.3)

Then Hx ~ L2(dF/21r) under the correspondence Y = J r/(h) dY<x with Y~ Hx and 7/~ L2(dF/27r). A (Gaussian) white noise X, is defined, e.g., via limiting procedures to satisfy EXt÷~Xt = 8(7) and there will then be a related process ~t with orthogonal increments such that for f c L 2

X(f)= f(t)dtd,, (X(f)-If(t)X, dt; Io X, ds). (4.4)

Using the spectral processes indicated in (4.3) one can find another white noise ~x such that for h and /~ = ~Th belonging to L 2

Page 23: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 131

We recall that a (real) Brownian motion (or Wiener process) is a Gaussian X, with EX, Xs = R(t, s) = min(t, s). Then X, has orthogonal increments and one can define .~'(f)= ~[(t)dXt directly (stationarity is not needed in this construction). We note that )~t is a white noise formally since Ef(S(s =D~D,R(t, s) = DsDt min(t, s) = 6 ( t - s).

Now given Fix generated by X, (re 7") the linear least squares estimator ~" c Hx of Y is determined by

El ~,_ y[Z= min E I Z - YI z. (4.6) Z e Hx

An equivalent characterization of Y follows from the orthogonality property characteristic of Hilbert space projections

E(~" - Y)X, = 0 (t e T). (4.7)

In particular, suppose now we have a signal Z~ (of the type Xt above) perturbed by a white noise N, with observations Y, = Z, + N~ (assume real processes for convenience). One can develop a theory under various hypotheses here (e.g., N.I_ Z, for t > s will do) but for simplicity we assume N,_LZs for all s, t (i.e., EN~Zs = 0). Since EN~N~ = 6( t - s) we have

R(t, s) = EY, Y~ = 6 ( t - s)+ K(t, s); K(t, s) = EZ, Z~ (4.8)

where K(t, s) is continuous say on [0, t ]x[0, T]. Consider the problem of smoothing: Given H~, = the Hilbert space generated by Y, for 0 ~< t ~< T, find ,Y( t]T)cH~, such that E I Z , - 2 ( t l T ) I 2 represents a minimum as in (4.6); equivalently from (4.7) we want

E(Zi-2(tl T))Y~ = 0 (0~ < s ~ < T). (4.9)

One shows that (H(t, s) = H(t, s, T))

2(tl T) = H(t, s)Y~ ds, (4.10)

T

K(t, r)= H(t, ~')+ fo H(t, s)K(s, 1") ds. (4.11)

(Equation H(1 + K) Fredholm

Io' 2(tl t) = h( t, s) Y~ ds,

K(t, "r) = h(t, ~') + h(t, s)K(s, ~') ds

(thus, H(t, s, t) --- h(t, s)). Here K(t, s)

(4.11) being a consequence of the orthogonality (4.9).) Thus, K = or ( 1 - H)(1 + K ) = 1 (in obvious notation); H(t, s, T) is called the resolvant of K. When T = t one refers to filtering and we write

(4.12)

(4.13)

is symmetric and one sees that

Page 24: Patterns and structure in systems governed by linear second-order differential equations

132 ROBERT CARROLL

H(t, s, T) = H(s, t, T) = H ( T - s, T - t, T) while from H = K(1 + K) -1 we can write (4.11) in the form (0) K(t, ~') = H(t, 1")+~o T K(t, s)H(s, "r)ds.

T H E O R E M 4.1. The smoothing and filtering kernels H(t , s, T) and h(t, s), which locate Z(t l T) and Z(t[ t) in H(, and H~, respectively, are solutions of the integral equations (4.11) ( - - (0 ) ) and (4.13).

C O M M E N T 4.2. After only minimal concern with probabilistic notions, one arrives at integral equations for the filtering and smoothing kernels. Much of the remaining analysis involves studying the structure of these equations and devising techniques to solve them. The connection of such integral equations with underlying differential equations will allow one to establish contact with trans- mutation techniques for differential operators.

The similarity of (4.13) to a GL equation is apparent and we will develop this point later. Generally speaking in linear estimation theory one wants to solve such integral equations practically by devising computational schemes to obtain the filtering and smoothing kernels.

R E M A R K 4.3. Referring back to Remark 3.7, we recall the splitting of tb = (1/27r)(1/co(A)co(-A)) where c o ( - h ) is analytic for Im h > 0 etc. This is some- what more general but is clearly related to the classical situation in Wiener filtering. Thus one recalls first a theorem stating that if S(A)>/0, S c L 1, and IS® Ilog S(A)I dA/(1 + h 2) < oo then there exists ~ e L 2, [~[2 = S, ~(h) = ff(-A) for A real, ~(a) = J~ c(t) e m dt, and ~(h) ~ 0 for Im h > 0 (with c real for S even). Let S(A) = S x ( h ) = ~Rx('r) where Rx(~')= EX,+~;g, for some stationary Gaussian X,. Let us think of X, resulting from filtering a white noise N, through a causal filter with transfer function ~. This means that if 1:, ~ Nt is the process with orthogonal increments associated with Nt as in (4.4) (N(f) = ~ f(t) dvt) then

X, = c ( t - s) dv~ = 2(h) e -a ' dvA (4.14) oQ - - ~

(note here c(t-s)=,°~-[~(h)e-i*'/21r] and cf. (4.5)). Given (4.14) with E dfi, d ~ = 8,~, dh/2~-one obtains easily

R×(T) = (1/2~r) I le12 e-iX~ dA

which is consistent with S() t )= J;Rx. Moreover, given d with properties as indicated and suitable growth, we expect ~ = 1/~ = ~ c with c (t) = 0 for t < 0 and then formally one is led to

I0 f Io' 1:, = N~ ds = [1/e(A)] e -u~ ds d R , . (4.15) o o

Thus formally Nt ~ ~, is the result of filtering X, by a filter with transfer function = 1/~ which we express heuristically as N~ = ~ t c ( t - s ) X ~ ds (again t ( t - s ) =

Page 25: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 133

~--[ce-~'/2~']). Equation (4.15) gives EN,+¢N',=6(~') since E d X ~ d ~ , =

S(A)dA/27r. Let now Y, be another stationary Gaussian process and consider ~'(t] t)6 H~¢ determined here, corresponding to (4.9), by the condition E( Y , - ~'(t] t)).~ = 0 for - ~ < s ~< t. It can be shown that

'l/(t I t) = g( t - s )dv~ (4.16) o c

and setting G(A) = J'ff g(t) e ~at dt (which is not the Fourier transform!) one has

t) = I ~ [G(A)/~(A)]e ~ 'd)(~. (4.17) 9(tl

The filter with transfer function (G/?) is called a Wiener filter and g has the form

g(t) = (1/2rr) I~ [ Sxy(A)/~(A)] e -~` dA (4.18)

where Sxv(A) = ~(EX,+, 9,).

COMMENT 4.4. The interaction between integral equations, spectral measures, analytic functions in the Hardy space context, factorization of operators, etc. has led to many fascinating developments in mathematics and physics (cf. [87-89, 7] and Section 7).

One goes next to the concept of innovations process for our situation Y, = Z + Nt as above. Writing Z(t) = Z(t l t ) and Z, = Z(t) etc., define

J(t) =- Y ( t ) - Z(t) = ,~(t) + N(t) (4.19)

where Z ( t ) = Z ( t ) - Z ( t ) represents the portion of Z(t) that cannot be predicted from past observations of Y(s) and J(t) 3_ Y(s) for s ~< t (sometimes innovations or new information processes J(t) are treated in an integral form at the martin- gale level - cf. [131]). In fact, J(t) is a white noise (UJ(t)J(s) = 6 ( t - s)) related to Y(t) by a causal and causally invertible filter ( h - operator of (4.12))

J = (1 - h) Y; Y = (1 - h)-Ij . (4.20)

Here ( 1 - h) -1 is the Volterra-type inverse and J contains the same statistical information as Y (note that white noise can be generated by Gaussian, Poisson, etc. processes and contains statistical information). Innovations processes will be used extensively below. First from (4.11)-(~) and (4.13)

T H E O R E M 4.5. (Bellman-Krein-Siegert). The kernels H(t, s, T) and h(t, s) are related by HT(t,s , T ) = - h ( T , t ) h ( T , s ) with H(t , s , T ) = h ( t , s ) + h(s, t)-So T h(r, t)h(r, s) dr. This equation is often written as H = h+ h * - h * h .

Page 26: Patterns and structure in systems governed by linear second-order differential equations

134 ROBERT CARROLL

Suppose now that Z, is stationary so that K(t, s) = K ( t - s) and define

a(T, t) = H ( T , t, T) = h(Z, t); b(T, t) = a(T, T - t) = IJI(t, O, T). (4.21)

T H E O R E M 4.6. For Z, stationary the a( T, t) can be computed recursively using the Kerin-Levinson recursions

( D r + Ds)a(T, s) = - a ( T , T - s)a(T, O)

where, from (4.13),

a(T, 0) = ~(r) = K(T)- a(r, s)K(s) ds.

Note this can be written ( D r + D s ) a ( r , s ) = - b ( T , s ) R ( T ) with ( D r - D~)b( r , s)= - a ( r , s)l~( T).

One calls an operator with kernel K ( t - s) as above a Toeplitz operator (while an operator with kernel K( t+s ) is called Hankel). The Fredholm resolvant H(t, s, T) of a Toeplitz operator is not Toeplitz but one has

T H E O R E M 4.7 (Sobolev identity). For Z~ stationary has

(D,+ D,)H(t, s, T) = a ( r , t)a(T, s ) - b ( r , t)b(T, s).

The equation in Theorem 4.5 is actually a form of the Darboux-Christottel formula for the a(t, s) and this is made more specific later (see Theorem 4.8). One sees that H(t, s, T) is completely determined by a knowledge of the a(T, t) (cf. also Theorem 4.3). Write next R ( t - s ) = 8 ( t - s ) + K ( t - s ) in (4.8) for Zt stationary with R(r) given as in (4.1). Write (4.3) as

= I e-'X' d ~'~ (V i,., e-iXt). (4.22)

Set J = ( 1 - h) Y as in (4.20) with d - P(,L t) (Krein functions - ef. [146, 120]), Y(t) = J P(,L t)d Ya, so that

Io' So' P()~, t) = e -at - h(t, s) e - i~ ds = e -at - b(t, r) e -i~('-') d r (4.23)

( h ( t , t - ~ = a(t, t - r) '= b(t, r)). From EJ(t)J(s) = ~3(t- s) we obtain from E d Y~ d Y~ = 8A, dF(;t)/2~r the equation

8 ( t - s) = (l/2~r) f_~ P(~, t)P(;t, s) dF(M. (4.24)

Define now P . (~ , t )= e-i"'P(~, t); then

Io' P.(A, t) = 1 - b(t, r) e -a" dr . (4.25)

Page 27: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 135

T H E O R E M 4.8. The Krein functions P and P . satisfy

DiP(A, t) = - lAP(A, t ) - b(t, t )P.(A, t) with DtP,(A, t) = -b ( t , t)P(A, t).

Defining ~'T(A, p.) = fo r P(A, s)/5(/,, s) ds it follows that .~r is a reproducing kernel in the sense that P(A, t )= (1/2rr)j'_~ ,~r(A,/x)P(/z, t)dF(/z) and one has a Dar- boux- Christoffel relation

.~a'r(A, #) = [P(A, T)P(I~, T) - P.(A, T)P.(Ix, T)]/i(Iz - ,~). (4.26)

Further one can write .~'r(A, lz) = S~ S~ [ 8 ( t - s) - H(t , s, T)]e ia' e - i~ ds dt.

C O M M E N T 4.9. The structural equations (Bellman-Krein-Siegert-Sobolev- Levinson, etc.) are important theoretically and also lead to realistic com- putational techniques for determining the filtering and smoothing kernels. The Krein functions are generalizations of orthogonal polynomials and are discussed and extended further in Theorem 4.15 and in Section 6.

We go next to some work of Levy-Tsitsiklis [158-159] which displays very elegantly some relations between linear estimation and scattering theory. Let 1:, = Z~ + N, as before with Z~ stationary, EZ, Ns = 0, etc. One defines even and odd processes Z~( t )=~[Z( t )± Z ( - t ) ] (and similarly for N± and Y±). Evidently

E Z ~ : ( t ) Z ~ ( s ) = K : ~ ( t , s ) = ½ [ K ( t - s ) ± K ( t + s ) ] ; EN.~( t )N+(s)=16( t -s ) (4.27)

and EZ±(t)N±(s) = 0. Let Z,±(t) = Z±(tl t) e ±H{, = the Hilbert space gener- ated by Y~(s) for 0 ~< s ~< t, be the best least squares approximation to Z:~(t) so that 2 ~ ( t ) = Z ± ( t ) - 2 ± ( t ) is orthogonal to ±H~,. One has, corresponding to (4.12)-(4,13)

Io' ,~:~(t I t) = Z±(t) = g~(t, s) Y±(s) ds, (4.28)

I0' g±(t , s) = ½g±(t, s) + g±(t, r)K±(r, s) dr. (4.29)

From (4.29) one obtains now (cf. also Remark 5.19)

T H E O R E M 4.10. I f K± e C ~ one has [ D ~ - V±(t)]g±(t, s) = D~g±(t, s) with Dsg÷(t, 0) = 0 and g_(t, O) = 0 where V±(t) = -2D,g±(t , t).

Fredholm resolvants H~(t ,s , r ) = H ± ( t , s ) exist as before (cf. (4.11)) and satisfy

I: K±(t, s) = IH±(t, s) + g±(t , u)H±(u, s) du (4.30)

(thus (½+ K ± ) ( 1 - / 4 , ) = l). One obtains as before a Bellman-Krein-Siegert for- mula and a version of the Krein-Levinson recursions in the form (cf. Theorems 4.5, 4.6, and 4.7).

Page 28: Patterns and structure in systems governed by linear second-order differential equations

136 ROBERT CARROLL

T H E O R E M 4.11. Under the hypotheses indicated

DTH±( t, s, T) = - g±( T, t)g±(T, s);

Io" H+(t, s) = g±(t, s) + g±(s, t) - g±(r, t)g±(r, s) dr;

DTg+(T, t )+ D,g_(T, t ) = - 2 p ( 2 r ) g + ( T , t);

DTg_(T, t)+ D,g+(r, t)= 20(2r )g_(r , t);

2p(2T) = g+(T, T ) - g_(T, T).

Further p satisfies the Riccati equation 4[p2(2T)?F I~(2T)] = V±( T) and thus p or V± serve as equivalent parameterizations of the Y± process. If a( T, s) is defined as before (cf. (4.21)), one can show also that

g~(T, t) = a(2T, T + t)+ a(2T, T - t) (4.31)

so that it is equivalent to compute a( T, t) or g~( T, t).

One defines now innovations J ~= Y ± - Z ± and evidently EJ~(t)J±(s)= ½8(t- s). We take Yf represented as in (4.22) etc. and suppose dF(A) =/~()t) d& with /~ = 1 + /< = &-[8 + K] (note /~ is even for real Y, Z etc.). Then Y+(t) cos ;tt, Y_(t) - - i sin )tt, and J± - 3,±()t, t) where, e.g.,

Io' y+(1, t) = cos I t - g+(t, s) cos As ds, (4.32)

(1[2¢r) y+(A, t)~/+(A, s)R(1) d l = ~ ( t - s). (4.33) c:o

T H E O R E M 4.12. The spectral innovations functions satisfy

I D a - V±(t)]~/~(h, t) =-A2~/±(A, t); y+(h, 0) = 1;

D,y+()t, 0) = - 2 K ( 0 ) ; y_(A, 0) = 0; Dty_(A, 0) = - iA.

Using Theorem 4.11 one can also show D,y++ 2p(2t)y+=-i)t3,_ and D t y - - 2p(2t)y_ =- /AT+ with

-iAy_(A, t )= W[y+(0, t), 7+(A, t)/7+(0, t)]. (4.34)

R E M A R K 4.13. One can transform the equations of Theorem 4.12 into the vibrating string equations of Kre in -Dym-McKean by writing ~(A, t )= y+(A, t)/y+(0, t )= y(x(t), A) where x(t)= Jd ds/y$(0, s). Then D2y + X2g,(x)y = 0, y(0, A) = 1; Dxy(0, A) = 0 (0 ~ x ~ l = x(oo)) and Iz(x(t)) = ¢+(0, t). In general of course the 'string' theory involves singular measures and refers to 'Feller type' differential equat ions (cf. [89]).

Page 29: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 137

T H E O R E M 4.14. The Sobolev identity corresponding to that of Theorem 4.7 involves

(H+(t, s) = H+(t, s, T)) D,H+(t, s) + D,H_(t, s)= g_( T, t)g+( T, s)

and

D,H_( t, s) + D~H.( t, s) = g+(T. t) g_( T, s).

The structure of H± is close to Hankel + Toeplitz in the sense that

[D 2 - D~]H±(t, s, T) = g±( T, t)Drg±( T, s ) - g.( T, s)Drg±( T, t)

with D~H+(O, s, T) = 0 and H_(0, s, T) = 0.

The y± also play the role of Krein functions as in Theorem 4.8. Define

• ( z ) = Fr~f(Z) = f±(s)3,±(A, s) ds, (4.35)

I/ .~t'T(A, IX) = "/±(ix, ~')3'±(A, r) dr. (4.36)

T H E O R E M 4.15..~t'T(A, IX) acts as a reproducing kernel on the f:~ in the sense that I• '~t'T( A, IX)L(A)/~ dA/rr = L(IX)- Further,

,~'~(,~, Ix) = ± [ a ( t - s ) -

- H~(t, s, T)]T±(A, s) T.(IX, t) ds dt

(T+(A, t) = cos At, T_(A, t) = sin At)

and one has a Darboux-Christoffel formula

,~t± (A, IX) = W[3,±(A, T), y±(/x, T)]/[A 2 - IX2]. (4.37)

C O M M E N T 4.16. The spectral innovations ~,÷(A, t) evidently play the role of O ~0A.h in Section 2 with g+ --Kh and d~o=(2/Tr)/~dA (cf. also Section 5,

Theorem 5.18). The techniques indicated here in estimation theory have also been useful in studying other aspects of integral connection formulas and the underlying differential problems (cf. Section 6).

We mention here also some results of [159] on random fields which can be phrased in terms of transmutation machinery (cf. also [239-241]). Thus, one speaks of random fields on R" as a family of random variables Xz, z ~ R ~, say mean square continuous with EXz = 0 and EIXzI2< ~, such that X~ is homo- geneous and isotropic (so EX~X~, = R(llz-,'lt) where II II denotes the Euclidean norm). As in [159] we consider here only the case n = 2 and let Y(x)= Z(x) + N(x) be observations of a two-dimensional Gaussian random field Z with covariance (Hx- sll = l )

Page 30: Patterns and structure in systems governed by linear second-order differential equations

138 ROBERT CARROLL

EZ(x)Z(s) = k(l) (4.38)

and N(x) is a two-dimensional white Gaussian noise field with EN(x)gr(s)= 6(1)/2M. Assume EZ(x)/~(s) = 0 and that k ( . ) ~ L~(l 1/2 dl) so that

k(l) = Jo(M)/~(A)A dA; /~(A) = Jo(Al)k(l)l dl (4.39) )

(this is a well-known version of (4.1) for higher dimensions). One observes now Y(x) over a disc DR of radius R and we let YR be the Hilbert space generated by Y(x) with [Ixll ~< R so that elements of YR have the form

b = ~o R ~o" b(r, O) Y(r, O)r dr dO.

Write

V(r, O) = 2~-~ Y.(r) e i"°,

Z(r,O) = ~-oo Z.(r) e i"°,

and

N(r, 0) = ~_~ V.(r) e i"°

where, e.g., ¥,,(r)=(1/27r)~o 2~ Y(r, O) e-i"°dO. One obtains then estimation problems for Yn(r) = Zn(r) + V.(r) and EZ. ( r )Z , . ( s ) = 0 = EV,,(r) V,.(s) for n =~ m with EZ~(r )Vm(s )= 0 for any (n, m). Let Y~ be the Hilbert space generated by Yn(r) for 0 ~< r <~ R and then one can show that

I; EZ,,(r),Z,(s) = k,,(r, s )= J,,(hr)J,,(hs)k(h)A dA (4.40)

while EV,,(r) (Z,(s) = 6(1)/27rl (l = Ir- sl). It follows that

T H E O R E M 4.17. If k e C 2 or equivalently if Z( " ) is mean square differentiable, one has for

P,(D,) = D2 + ( l / r ) D - ( n 2 / r 2 ) , P,,(D,)k,,(r, s) = P,(D~)k,,(r, s);

Drko(O, s) = O; kn(O, s) = 0 (n -~ 0).

Next for filtering kernels one has

I? Zn(R I R) = E ( Z , ( R ) I Y~) = g , ( R , s) Y , (s ) ds. (4.41)

From Z_.,(R I R) = Z , (R) - ~ ( R I R) being perpendicular to Y,(s ) for 0 ~< s ~< R we have

I? k,( R, r) = (1/27r)g~(R, r) + g,,(R, s)k ,(r , s) ds. (4.42)

Thus (1/27r) + k, is invertible (assuming say k,, ~ L2(r dr) on [0, R]). One defines

Page 31: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 139

innovations processes L(r) = Y . ( r ) - ff~,(rlr) with E#. (r )~(s ) = (1/27rl) ~ ( r - s) and the previous machinery all has a version here. Thus

T H E O R E M 4.18. Under the hypotheses indicated one has for

V . ( R ) = - 2 D R [ R g . ( R , R)], [ P . ( D R ) - V . (R ) ]g . (R , r) = P . (Dr)g . (R . r);

D.go(R. 0) = 0; g . tR . O) = 0 (n ~ 0).

The Fredholm resolvant H.(r . s. R) satisfies

( H . ( R , s, R) = g . (R , s)),

I? k ~ ( r , s ) = ( l l 2 ~ r ) H ~ ( r , s , R ) + k . ( r , u ) H ~ ( u , s , R ) d u ;

D R H n ( r , s , R ) - - - - R g ~ ( R . r ) g ~ ( R . s ) and 1 - H ~ = ( l - g * ) ( l - g ~ ) .

Further, for k e C 1 one has a new feature in the form (here, g. = g . (R , r) and

o~(R) = R[gn(R. R ) - g~+l(R, R)]) ( D r - ( n / r ) ) k . ( r , s) +

+ (D~ +[(n + 1)/s])k~+z(r, s) = 0;

(/3, + [(n + 1)/r])k~+~ + (D~ - (n / s ) ) k~ = O;

( D R - (n /R) )g . + (D~ + [(n + l)/r])g.+, = -o~(R)g~ ;

and

(D~ - (n/r))g~ + (DR + [(n + 1)/R])g~+, = o.(R)g.+, .

Further one can exhibit a mutual dependence between 0n and V. via a Riccati equation. In the spectral domain we write ~(~)=(1/27r)+ k( t ) and one intro- duces spectral processes with orthogonal increments as before. The cor- respondence Y(x)~e ~("'~ involves an isometry between the Hilbert space generated by the Y(x) and LZ(f,~ d~ d0/27r). In particular ( - v = (~, 0))

EY. ( r ) ?re(s) = 6,.. J~(Ir)J~(,~s)i(1) d l (4.43)

and there is an isometry Y.(r) ~ J~(,~r): Y~ ~ L2(~ all) with (¢~ ~ ¢~(r, ~))

Io ~(r , ,~) = J~(,~r) - g~(r, s)J~(.~s)s ds. (4.44)

Thus we make contact with the singular operators of Section 2. Further

I ~ ~(r , ~ )~ ( s , ~.)fl d~. = (1/27rl) 6 ( r - s). (4.45)

T H E O R E M 4.19. For n > 0 , J:,~ satisfies [P~(D,) - V~(r)J~(r, ~) = -,~z~,,(r, ,~) with l i m n ! 2 ~ ( ~ r ) - ~ . ( r , , ~ ) = l as r--~O and for n < 0 one sets ~ ( r , ~ ) = (-1)"~_.(r, ,~).

Page 32: Patterns and structure in systems governed by linear second-order differential equations

140 ROBERT CARROLL

In terms of calculation the ~, can, in fact, all be generated from each other (cf. [1959]). To give an inverse scattering interpretation to the above set q~n(r, A) = (rA)l/2J',~(r, A) so that

[ D 2, - Vn(r) - ( 1 / r2)( n 2 - I)] q~, = - h 2 ~p, (4.46)

with n!2.(hr)-"-~/2~o,,(r, h ) ~ 1 as r ~ 0 . This is the Schr6dinger equation for a particle with angular momentum n and energy E = h 2. There is then a con- nection to the standard GL machinery with f = I /~IF(A)I 2, where F is the Jost function. Here the Jost function is the same for all n - with varying potential - whereas in physics the potential is constant while the Jost function varies.

COMMENT 4.20. One sees that integral equations (e.g., (4.42)) whose kernels have underlying structure relative to P, lead to solutions with 'related' differen- tial structure. The k, structure is, in fact, a kind of generalized translation and this picture is clarified further in Section 6. In terms of stochastic theory the presence of an underlying Fourier theory for stationary processes is an obvious and natural consequence of the 'displacement' kernels. Similarly the underlying P, translation theory for k, is related to a spectralization of the stochastic process Y, via J,(Ar) etc.

5. G e n e r a l T r a n s m u t a t i o n T h e o r y

We consider operators as in (2.16) with say A o = x2"+lco and q real (again strong singularities in q will be excluded for convenience and m = _1 will lead to operators as in Section 3). Since some of the material here already appears in [29] we will emphasize newer developments and proceed somewhat formally, referring to [29] for details and examples. Let us also base the development primarily on spherical function solutions ~o ° of Q~o =-Aeq~ with q~°(0)= 1 and Dxq~°(0)= 0 (for background information on spherical functions see, e.g., [70, 83, 95, 109, 140-143, 147, 171]). In a general way one can show that the transmutation B: P--~ Q: q~e._+ q~o can be represented by a kernel of the form

/3(y, x) = (R e, ¢~°(y)~e(x))x = (CO(y), f~e(x)) ~ (5.1)

where ~e(x)=Ae(x)q~ex(x) and R e - d v ( R ° - d o ) ) . One considers, e.g., the Cauchy problem (2.1) with A = 1 and C = 0 whose solution can in fact be written as

qffx, y ) = (~(y, ~c), T~f(~))= (~ f(X), ~p~e(x)~p°(y))~ (5.2)

where T~ denotes the generalized translation which can be represented via

U(x, ~) = Tff(~)x = (~f(Z), ~0f(x)q~f (s¢))~ = (f(r/), (flU(r/), q~x p (x)q~xP (~))v) (5.3)

One must naturally be careful in writing down general spectral pairings "as in (5.1)-(5.3) but, in fact, the formal technique can be applied quite generally. Of

Page 33: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS G O V E R N E D BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 141

course many pairings are distributional and represent distributions but this is expected and hopefully a routine matter today. Let us indicate a few typical pairings involving singular operators

EXAMPLE 5.1. Take P = D 2 and O = O,, where O,,u = (x2"+lu')'/x ~''+~. Then q~(x) = cos Ax and Bo[cos Ax] = q~(y) where

q~O(y) = 2 " F ( m + l)Jm(Ay)/(Ay)", (5.4)

13o(y, x) = (cos Ax, qo°(y))v = (2/zrcm) I ~ cos Ax(Ay)-mJm(Ay) dA (5.5)

= [2F(m + 1)y-Z"/F(½)F(m + ~)](y2 _ x2)~,-~/2

(c,, = ½"F(m + 1) and do) = o3 dX with 03 = c2A2"+1). The inverse Y~o = Bo 1 has a kernel To(x, y) = (cos hx, f~a°(y))o, which is manifestly distributional, namely

To(x, y) = c,, (Ay)"+l J,.(hy) cos hx dh (5.6) )

= [ 2 ~ sgn xy2"+lx/F(m + 1 ) F ( - m - ½)](x 2 - y2)U"-3/2.

generalized translation kernel /3(x, ~, 7)=(11f(7) , t, r, q~,(x)~a(~:))~ in (5.3) The for P = D 2 is

/3(x, ~:, 7) = (2/7r) cos Art cos Ax cos XsCdA. )

Thus

/3(x, ~, 7) : ¼[a(x + ~5 + 7) + a(x + ~ : - 7) + a(x - t5 + 7) + a(x - t5 - 7 ) ]

(5.7)

and acting on even functions f (which as we have seen in Theorem 2.1 is a standard procedure in transmuting with operators on [0, oo)) one obtains T~f(~) = ½[f(x+ ~ ) + f ( x - ~ ) ] ; this is, of course, the d'Alembert solution of the wave equation D ] U = D~U with U(x, O) = f(x) and U~(x, 0) = 0. Somewhat more exotic is the kernel of the generalized translation for O,,, namely

y(x, Y, 7 ) = 2mF(m + 1)(xY)-"7"+~/2x

X I,~ A-m+I/2('rlA)I/2jm(AX)Jm(AY)Jm(A7)dA (5 .8 )

= (,pO(x),p ~O(y), n~°(7))~

= [ r ( m + 1)/,,7~r(m + ½)](7/xy)O - z2) wt-l/2

I x - y l < r t < x + ~ while 3 ,=0 for 0<7<lx-yl and 7 > x + y ; here rt = (x 2 + y2_2xyz)l/2 and S~f(x) =

f o r

z = (x 2+ yZ_.q2)/2xy" Then writing (y(x, y, rt), f(7)) we have

S~f(x) = [F(m + 1)/47rF(m + ½)] f ' J_

(1 - Z2)rn-I/2f(7) dz. (5.9) I

Page 34: Patterns and structure in systems governed by linear second-order differential equations

142 ROBERT CARROLL

This gives an idea of typical situations (5.1)-(5.3) for singular operators. Thus, /3(y, x) in (5.1) represents B: ¢e___> q~o and ~ = B- ' has kernel (cf.

Example 5.1)

3'(x, y) = (~f(x), f~°(y)),o. (5.10)

Another important transmutation /~ = ~ # is obtained by adjointness

(±e (x) u(x), ~v(x)) = (Ao(y) v(y),/3u(y)>, (5.11)

/3(y, x) = (fie(x), q~°(y)),o = Ap(x)Ao'(y)'),(x, y). (5.12)

In fact, /3 can be characterized by means of a Cauchy problem (2.1) where C = 0 and A is the operator with kernel (x ~ ~)

= (,v~ (~), a~ (x))~. (5.13) A(~j, x) e e

This kernel A(~, x) has significance in another role as kernel in the general extended GL equation. Indeed, in C°(y) = (/3(y, ~), ~f(~)) take to scalar products with af(x) to obtain (cf. also Theorem 5.4).

T H E O R E M 5.2. The general extended GL equation is

fi(y, x) = (/3(y, ~), A(~, x)).

C O M M E N T 5.3. The main theme here so far in Section 5 is 'spectral pairings'. The formal expressions usually have a distributional meaning and serve also as a guide in demonstrating formulas.

Under typical hypotheses one finds that the ~pO(y) are entire functions of )t of exponential type y and, writing

q~O(y) = (/3(y, x), e l ( x ) ) = ~[/3(y,- )](X) (5.14)

(where ~f(;t) = ([(x), ~0f(x))) one is in the context of Paley-Wiener ideas; there results

/ 3 ( y , x ) = 0 f o r x > y ; / 3 ( y , x ) = 0 for x < y . (5.15)

The latter follows from (5.12) for example and we remark that triangularity results of the form (5.15) can also be established by contour integral arguments using analyticity properties of ~ o and co(±)t) (cf. below). Connection formulas between special functions (such as q~o = Bq~f) using B and /~ now take on the character of Riemann-Liouville or Weyl-type fractional integrals and we will give examples below. Let us deviate, however, to give a new proof of trian- gularity for /3(y, x). We recall from (3.30) that the extended GL equation arises via H'(t) = (q~o(~), cos At)., =/3(~, t) and we can give a general version of this as follows. Thus, consider for simplicity R ° -- dto - & dA with R P -- dv = ~3 dA and recall (5.2). Thus, in Theorem 5.2 we write

(w(x) = ~/~), A(¢, x) = (~f(~), ~f(x)W(X)La~(x).

Page 35: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 143

If one defines then if '0) formally by

t~v'(t) = W(h)¢e~ (t) dv (5.16)

so that W()t) = (~ IYC)()t) then

A(~, x )= T~ITV(t~)Ae(x) (5.17)

and the GL equation becomes

~(y, x) = (/3(y, ~), T~ITv(~))Ap(X) (5.18)

Let us write /3(y, x)A~l(x) = (q~(x), q~O(y))~, = ~p(x, y). Then formally (ef. (5.2)) ~0(x, y) = (/~(y, ~5), T~W(s¢)) and

P(Dx)~ = Q(Dy)~o; ~ox(0, y) = O; q~(0, y) = {1, ~0°(y)),, = 6(y)/zio(y) (5.19)

(note ~[6(y) /Ao(y) ] = (fl~°(y), 6(y) / io(y)) = q~°(0) = 1). Thus, ~o(x, y) =/3(y, x)/ Ae(X) is the impulse response to q~(0, y) = 6(y)/Ao(y ) and /3(y, x) = 0 for y > x by domain of dependence arguments. Further,

q~(x, 0) = (/3(0, so), T~/({~)) = l~/(x). (5.20)

T H E O R E M 5.4. The extended GL equation of Theorem 5.2 can be expressed as the impulse response to initial data 6(y)/Ao(y) as in (5.19) from which/~(y, x) = 0 for x < y results, and (5.20) holds, expressing I7¢ as an impulse response.

COMMENT 5.5. The interaction here between Paley-Wiener type results (or contour integral techniques) for triangularity and the triangularity arising from domain of dependence arguments in hyperbolic differential equations is probably worth investigating further. One hopes for a 'categorical' meaning for some of the ingredients.

For convenience again let us assume R ° - d w - o3 dA and R e ~ du ~ f, dA and set W(A) = (o3/!)). Let ~°~(x) be Jost solutions of O~0 = -A2~o satisfying ~°~(x) A~l/2(x) e ±i~ as x ~ ~ (~e(±ix-Po)~). One writes, as in (3.9) for example, ~o~°(x) = co(A)~°a(x)+co(-A)~°-x(x) and in fairly general circumstances one obtains again (3.12), i.e., d o = ~b dA = dA/27rtco(A)l 2.

T H E O R E M 5.6. Let ~ ° ( x ) = 4p° ( x )/ co ( - A ). Under the hypotheses indicated

/ ~ ¢ f = W(),)q~o; / ~ , f = , o . (5.21)

The latter formula can be proved by analytic continuation as in [29] or via the inversion formula for ~ of (2.17) in Kontorovi~-Lebedev form (cf. [66] for details)

f(x) = (1/2 ~ f 0 t ) q t ° ( x ) dX. (5.22)

Page 36: Patterns and structure in systems governed by linear second-order differential equations

144 ROBERT CARROLL

TO show (5.22) one notes that f (x) = ~ f ( x ) = (f()t), ~p°(x))., can be written in the form (5.22) upon writing out q~o in terms of co(+A), ~ o , and d0J. Typical connection formulas of the type q~o = Bq~e and ~ o =/~We are indicated below

in Example 5.7. We emphasize that our derivation yields such connections for huge classes of special functions simultaneously, in a canonical and intrinsic manner, whereas previously one established such formulas individually, in a few cases, by special arguments using properties of hypergeometric functions etc. (cf. [4, 95, 140]).

E X A M P E 5.7. For Ao = (e x - e - ~ ) 2~+t (e ~ +e-X) 213+1 one has Po = a +/3 + 1 and

(setting q~o _ q~,t3 etc., with F denoting some appropriate combination of gamma functions)

q~°(x) = F(½(p + iA), ½(O - iX), a + 1, - s h 2 x), (5.23)

• ° (x) = (e ~ - e-X)ia-"F(~(/3 - a + 1 - iA), ½(/3 + a + 1 - iA), 1 - iA, - s h -2 x),

I'A~,+~.t3+~,(x)q~+"'t~+"(x) = sh 2x A~,t3(~)q~"~(~)[ch 2x - ch 2~] ~'-s d~,

(5.24)

• ~'°(s) = C ~ + " ' ~ + " ( t ) [ c h 2 t - ch 2s] "-~ sh 2t dt. (5.25)

We observe next that there are a number of factorization type formulas which follow formally immediately from the spectral representation of kernels and which play an important role in the general theory. For example, results of the type ( t ) after (2.10) can be expressed quite generally in the form ~ N * = 2~;

2~N* = ~ where B ~/3(y , x), N = B -~, etc. Similarly for suitable f

/3f(y) = (/3(y, x), f(x))

= ((f~e(x), ~O(y))~, f(x)) = (q~O(y), (~e(x) , f(x)))o, = ~ 3 f (5.26)

and consequently ~ = / ~ - n = ~ . Also one sees easily that (for suitable f)

~*(Apf) = Ao/3f and B*(Aof) = Ap~f. Hence

T H E O R E M 5.8. The factorizations ~B* = ~, ~ * = ~ , ~*Ap = Ao/3, B*Ao = Ae~, and B = ~ with ~3 = ~ all hold with action on suitable objects. For Bo: D2--~Q one defines an 'Abel ' transform F o ( f ) = B * A o f = ~ 3 o f . Then ~Fo( f ) = ~B*oAof = ~ Aof = ~ f for suitable f.

R E M A R K 5.9. The last formula is an analogue of factoring the spherical transform into the composition of a Meilin and a Harish transform in the theory of Lie groups (cf. [147]). Thus, one reason the transmutation machine yields 'good' connection formulas etc. is that it embodies the natural 'symmetries' or structure intrinsic to radial Laplace-Beltrami operators (cf. also [141]).

Transmutation methods have also proved fruitful in dealing with integral transforms of various types related to the ~ - ~ inversion (cf. also (3.39) and

Page 37: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 145

(5.22)). For example one has an inversion (cf. [29, 43, 140, 171])

F(A) = f ( y ) A o ( y ) * ~°(y) dy;

(5.27)

f(x) = (1/2~) [F(A) + F(-~)l~0~°(x) dX.

We will indicate some further examples later in Section 6 in connection with Kontorovi~-Lebedev-type theorems. Let us shown now how one can arrive at a canonical intrinsic Mar~enko (M)-type equation via techniques of possible later use in general operational calculus (the canonical intrinsic nature of the equation is also indicated when we show later that it is the natural minimizing criterion in the characterization of kernels via extremum properties). The M equation in classical scattering theory is an alternate way (to the GL procedure) of working experimental data (e.g., the one-dimensional scattering matrix F ( - M / F ( A ) = S(M in the problem (3.1)-(3.6)) into an inversion technique yielding the potential q(x) (see also [175] for an elegant extension). Using Fourier analysis one connects D 2 and D 2 - q = O by formulas whose only O input is S(A). We gave a preliminary generalization of this in [29, 44] and later obtained the canonical version sketched briefly here (cf. [31, 45, 46, 60]). Thus, let Pu = u " - p u be a Fourier-type operator on (-oo, ~), by which we mean that p is real, even, continuous, positive, and p(x) eEnxC L~(O,m). These hypotheses are stronger than needed but suffice for illustration (cf. [114, 213, 220]). Let q~f (resp. l"f) satisfy (*) Pq~=-h2q~ with q~f(O)=l and Dxq~f(O)=O (resp. x f ( O ) = O and D~Xe(o) = - 1 - thus X e = - oe). One defines ~ P ~ ( x ) - e *i~ as usual to be Jost solutions of (*) and we set Ml()t) = Cp(-h) with

1 M(A) = - -

2ihV(h)

(Cp ~ ~pe and F ~ X~ e = - 0e). Then ~ e = 2i,~[M(,~)~e_ MI(,~)Xe] and one

defines

~ ( x ) = 2iA[M(h)~pP(x) + M1(A)xP(x)]. (5.28)

In terms of full line scattering theory (cf. [69, 93, 135]), we have a transmission coefficient p and a reflection coefficient - A defined by

( _ 1 , M - = M(- ) t ) ) P 4ihMM1

p = ~[MI/M, - M-/M]; (5.29)

A(A) = -½[M-f ~M1 + M-/M] = -[MMT + M-M1]/2MMI

such that @-Px = O~ P + A@ P and there is an inversion

f ' f f (X) - f ( x )~ f ( x ) dx; f i x ) = ~ o(X)f(X) '2f(x) dX. (5.30)

Page 38: Patterns and structure in systems governed by linear second-order differential equations

146 ROBERT CARROLL

Now let O be a 'general' operator of the form (2.16) with howevcr R ° -do~ = 05 d~t on [0, ~). Our philosophy' of the M equation (following Fadecv [93] in part) is to exhibit it as a relation between three transmutations B, /~, and /~ where /~: do~ ~ doo is determined formally via a spectral kernel

~(y, x) = (1/2~) do°(y)o(MEf(x) dA (5.31)

(by contour integration one sees that /3(y, x ) = 0 for x < y and hence we work with a full line theory for P ( - x ) while y/> 0 (y - O) - see [32, 66] for details - the presentation of [60] is improved in [32, 66]). The GL equation is now B = BA where

,4(x, y) = (q~ae(x), q~f(y)), ; d/x = 0)2/tb) dA (5.32)

(here d r = bdA refers to the spectral measure for P relative to q~P). One can show then

T H E O R E M 5.10. Under the hypotheses indicated B = B ~ where Yg(x, s)= kernel Y( (s---~ x) can be written y((x, s) = (1/27r) S_~[ M,(A)/co(-A )]~ P(s)doP(x)p(A) dA.

R E M A R K 5.11. We mention here in connection with the calculations involved in developing the M equation that there is perhaps some independent interest in dealing more extensively with the generalized translation and generalized con- volution determined by (do(f) = ~_~ f(x)~e(x) dx)

:~f(x) = (l/2~r) cb(f)dof(y)Ef(x)p(A) dA; o~

(5.33)

(g * f)(x)= (f* g)(x)= (1/2 w) J_= do(f)do(g)'Zr(x)p(A) dA.

Thus, d0(f* g) = do(f)~(g) etc.

Let now ~ * have kernel ~*(x , s ) = y((s, x). Then the general extended M equation is

B ~ * = / 3 , 4 ~ * =/)(2(,g,9(*) =/~.~'. (5.34)

One shows that kernel BY(* = 0 for x > y and we obtain

T H E O R E M 5.12. The general extended M equation is B Y ( * = / ) ~ from (5.34) and for x > y one obtains an integral equation for fl in the form /3(y, x )+ ~; [3(y, t)[T(t, x) + S(t, x)] d t = 0 where

T(t, x) = (1/27r) ( ~ A(A )dP~( t ) ~ ( x ) dA;

(5.35)

S(t, x) = (1/2~r) J_~ o o ~

SQ( A )(~P ( I)(~P ( x) dA

and so(A) = Co(A)/co(-a) is the only Q input to the connection.

Page 39: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 147

EXAMPLE 5.13. For P = D 2 and Ou = ( A u ' ) ' / A - q u with A as in Section 3 and q suitable (q known) one has/3(y, x) = A-~/2(y)6(x - y) +/~(y , x), /3(y, x) = A-~n(y)6(x - y) + K(y, x), /~(y, x) = A-tie(y) 6(x - y) +/~(y , x), and ,~t(y, x) =

6(x - y) + k(y, x). Consequently the M equation (5.34) has the form (x > y)

A-U2(y)k(y, x) +/~(y . x) + /£(y, Ok(t, x) dt = 0. (5.36)

An integrated form of this would then be used to serve as a recovery vehicle for A (cf. (3.19), remarks later, and Section 6). For A = l with O = D Z - q one has 0 = A() t )= T ( t , x ) and S(t,x)=(1/27r)~2~so()t)ea~X+'~d2t. The equation in Theorem 5.12 becomes then (for/3(y, x) = 6 ( x - y ) + / £ ( y , x)),

O= ff2(y,x)+ S ( y , x ) + I~ (y , t ) S ( t , x )d t .

This is equivalent to the classical M equation since co()OF()O + c o ( - ) O F ( - 1 ) = 1 and S(t, x) will reduce to - I2~ (F(-,~)/F(~)) e mx÷'~ d~.

COMMENT 5.14. The idea of treating the GL and M equations via trans- mutation seems to go back to Fadeev [93] for the quantum scattering situation. We gave a preliminary generalization of this in [29, 44] and later extended this to the present formulation (cf. [3l, 32, 45, 46, 60, 66]). We will see below that our version also arises v ia minimization and thus we believe it to be intrinsic and canonical. The M equation appears to be a greater depth than the GL equation (cf. [236]) but as indicated below they actually have a similar structure (see [32, 66] and cf. also [87, 88]).

R E M A R K 5.15. Let us show how one can write the M-data ~ f i ,~* as an upper-lower factorization /~-l/~ (/~ = BY(*) and compare with the lower-upper factorization B-~/3 of GL data A. This is developed in [32, 66] and extends the presentation of [87, 88] (where P---D 2) in certain ways involving canonical ingredients (e.g., generalized translations) which do not arise explicitly in [87, 88]. One notes here that our M equation is based on qbf and Y~ e , for example, in a nontrivial generalization of structure and it cannot be treated by the Fourier transform as when P = D 2. There is also an interesting interaction between our full line theory for P and the corresponding half line KL theory but we refer for this to [32, 66]. Now one notes that

(1/2 rr) I ~ ~ , f ( x ) ~ ( x ) dx = (1/po-)8()t + Ix) - (Aip2)6()t - Ix)

(this was reported incorrectly in [60] and corrected in [66]). Then in dealing with /3(y, x) on the full axis we identify/3(y, x) with

/3(y, x) = (1/27r) I_~ pM~qr°(y)~,f(x) d)t. (5.37)

Page 40: Patterns and structure in systems governed by linear second-order differential equations

148 ROBERT CARROLL

The action (/3(y, x), ~P(x)) = ~O(y) follows immediately from (5.37) and (5.30) in the full line theory and the factorization /3 =/3Y( follows directly from (5.31) and (5.37) where Y((x, s) (s--* x) is given as above in Theorem 5.10. Now recall the M equation as /3= BY(*= ]3(Y(/~Y(*) (y(*(x, s )= y((s, x)) and write for /3(y, ~) = ker/3(~---~ y)

^

t3(y, 0 = (1/27r)

= (1/2~r) I f o o

r ~ [c~/co]o~e~ (~) J_~ ~(y, x)Xe(x) dx dA

[llco(-A)]*~(O~o°(y) dA = (/3(y, x), Y((~:, x))

(5.38)

and by contour integration/3(y, 0 = 0 for ~:> y. Now an inverse 9~ to /3 can be produced via the kernel ~/(x, y ) = (1/2~r)F_~clF~(x)[tl°(y)/co(-A)]d)t so that in particular ~ o = ~ and ~(x, y ) = 0 for x > y. There is no a priori full line theory for Q so the KL type development is needed here and one uses analytic continuation arguments to show that ~ ' (A , / z )= ( l /27 r ) J '~ l l ° (y )~° (y )dy ~ 8(A-/~) acting on suitable objects. Next, one can explicitly write out the upper-lower factorization /~-t/~ of Y(fi~Y(*. A direct calculation shows that the operator /~}-t/3 has kernel S + T + 8 (cf. Theorem 5.12). We also see that "~(x, y) = ~o(Y)/J(Y, x) and, hence, formally ~J* = Ao/3 and ~ = ¢JAol~J*. One can also calculate the kernel of Y(,4Y(* more directly via (recall W-~(A) = 9/& =

Ico/c~l ~-)

= (1/4,a-) p=[IcoPl(MT)q[Zf(O + (I)f (~:)] [Ef ('r/) + O f ( n ) ] d~..

This decomposition spreads the generalized translation over the whole axis - here one recalls that if ¢¢-l(n)=.~(~W-t(A)q~(n)du (so that W-1(A) = ( ¢V t(n), q~f(n)) = (~ ¢v'-t)(A)) then ,4(~, r/) = T~'d/-l(n) for a certain general- ized translation (cf. (5.17)). Thus the GL and M equations have a similar structure. For the GL equation one writes B-t/~ = A as a lower-upper fac- torization of GL data A given via generalized translation from ¢v" as A(t, x)= T~CV(x). The M equation represents an upper-lower factorization ~/} of M data Y(fi, Y(* where the M data is 'canonically' related to the GL data via Y( and generalized translation (fi,(~:, r l)= T~l'~/-t(n)). Note also that if A o = 1 for illus- trative purposes then /3 = (B-l) * so the GL equation is A = 939J* for ~ = B -1 while the M equation is Y(AY(* = 9}~*. The factorization point of view is useful for computational purposes.

REMA R K 5.16. One can also derive formally (cf. [87, 88] and Section 7) the general GL equation as a factorization, using a Parseval formula as in Section 2, by the following heuristic calculation (with obvious notational abuses). Let

Page 41: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 149

f(A) = if(x), ~o~(x))

= i f ( x ) , ( ~ ( x , ~), ,pf(¢))) = if(x), (B~P)(x)).

For suitable f . g one has (f, ~)o, = i f , g) ( take A o = 1 here for illustration) and, hence,

(A(~, n) = (o3, e e

if, g) = ((f, B~f), (g, U~f )L

= (f, BAB*g).

Consequently, BAB *= I or BA = B * -1= (B-I) =/3 . The same kind of pro- cedure for the M equation as used in [88] relies heavily on the underlying Fourier transform (i .e, P = D 2 is needed) and will not work for more general P.

We turn next to the idea of minimization as a directive in characterizing transmutation kernels (cf. [41, 48, 51, 52, 64-65]). Some motivation comes here from [90, 91] where it is shown how GL equations can be obtained by minimizing

a certain quadratic functional Q(t, K) (cf. also [67]). However, a motivation within 'scattering theory' to consider Q(t, K) was lacking and in [90] this was regarded as unsatisfactory. We will show here how such quadratic functionals Q(t, K) arise as a criterion in characterizing transmutation kernels and, when

there is an underlying stochastic problem as in Section 4, the procedure is essentially equivalent to linear least squares estimation. We will sketch the procedure for P = D 2 and Qu -- (Au')'/A as in Section 3 (a term -qu could also be added in Qu) with B: q~e(x) = cos hx = a(h, x)--~ ~pO(y) = s(h, y). With minor

modifications the same formulation and calculations apply for Q = D 2 - q with s(h, y ) = q~A,h(y)O (and a ( A , x ) = c o s h x ) or for P = D 2 and Q = D 2 - q with a(A, x) = OP(x) = sin hx/h and s(h, y) = 0°(y) as in (3.3) (we assume for con- venience that dto = d~ dh on [0, oo)). Thus, consider the expression (T > 0 arbi- trary)

I/I; E = ~ ( T , , ( 0 = [A-l/2a-s+(,(t ' (y,x),a(h,x))]2doody (5.39)

where ,~ is to run over a suitable class of causal kernels (i.e., ,(t'(y, x ) = 0 for x > y) having the same properties as the GL kernel /( ( = K~(y, x) as in (3.17)- (3.19)). Recall here that /3(y, x ) = A-1/26(x - y ) + / ( ( y , x) from (3.18) so the GL k e r n e l / ( is a minimizing kernel for (5.39). The point here is t h a t / ( can in fact be characterized by this property via the GL equation. Now for an operator A with kernel A(y, x) we write Tr A = J'o T A(y, y) dy (this integral .[ff in ~_ can actually be omitted - it is inserted in order to have a direct comparison to the O(t, K) of [90]). Then, writing ~=[.o~S~[A-l/2a - s]2doJdy (which makes sense) we have

Page 42: Patterns and structure in systems governed by linear second-order differential equations

150 ROBERT CARROLL

= ~ " ~oT`L y = = + 2 A-~/2(y),~(y, x)9~(y, x) dx dy -

- 2 [7- [ y ,~(Y, x)fi(y, x )dx dy + ¢ 0

(5.40)

+ IoT` IoY loY ~(y, x),~(y, ~)gd(~, x) d~ dx dy

where fi(y, x) = (s(A, y), a(A, x))o, (of. (5.12)) and (cf. (5.13)) 9R(y, x) = (a(A, x), a(A, y)),o = 8(x - y) + ~ ( y , x) (the splitting follows from d o = do,+ (2/~) dA). Now fi(y, x ) = A-~ /2 (y )8 (x - y ) + / ( ( y , x) with / ( anticausal so the fi term in (5.40) only contributes A - ~ / 2 ( y ) 8 ( x - y ) which is cancelled by a contribution from ~. It results that ( l l )=_=~+Tr{A-~ /2 (y ) [~f~+12 .~*]+~( l+fD~*} . One writes ,(t = ,~o + ~J for .(~o a minimizing kernel and J an admissible causal kernel. An elementary variational procedure gives as the 'Euler' equation for x < y

.~o(Y, x) + A-1/2(y)12(y, x) + Io ,~0(Y, ~)12(~, x) d~ = 0 (5.41)

which is the canonical GL equation (from which (3.19) follows). Since one has unique solutions of (5.41) it follows that

T H E O R E M 5.17. The GL kernel/((y, x) = ,~o(y, x) is characterized via the GL equation as the solution of minimizing =~ over a suitable class of admissible causal

COMMENT 5.18. The result in Theorem 5.17 seems to be essentially theoreti- cal in nature and not adopted to computational procedures of use in practice. The fact that the GL kernel arises out of a minimizing procedure as a kind of Euler equation seems however to be of interest and when there is an underlying stochastic problem we show later that this minimization is essentially equivalent to linear least squares estimation in locating the best approximation in a certain Hilbert space. Some further minimization results in the spirit of approximation are indicated in Section 6 (see also Remark 5.24).

One can characterize the kernel 3'(x, y) for ~ = B -1 or the kernel fi(y, x) for /3 in a similar manner. In fact, the latter characterization leads to a derivation of the general M equation as a minimizing criterion. Thus let P = D 2 - p be a Fourier type operator with B: q~e and /): ~ ~ W(A)q~ ° (say O u = (Au ' ) ' /A -qu as above for suitable A and q with do)= tb dh). Then fi(y, x ) = A-~/2(y) 8(x - y) + / ( ( y , x) with K anticausal and we consider

I:Io [A-~/2a - Ws + (,(~(y, x), a(A, x))] 2 d~ dy (5.42)

where d/~ = (D2/cb)dA as in (5.32). A direct calculation now as above for ~ yields the canonical GL equation for /((y, x) = ,(~o(Y, x) as the Euler variational equa-

Page 43: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 151

tion and thus characterizes/£. However, somewhat more can also be done. Thus we think of / ) = / ) ~ ( as in Theorem 5.10 and, with suitable A, q, one has fl(y, x) = A-l/2(y) ~(x - y) + Ill(y, x) with /~ anticausal. Then also ~(x, s) = 6 ( x - s ) + h ( x , s ) (with h(x , s )=O for s < x ) and, in (5.32), f i , (x ,y)= 6 ( x - y)+ (~(x, y). In particular, this leads to the equation

K ( y , x ) = I £ ( y , x ) + A - ~ / 2 ( y ) h ( y , x ) + K ( y , s ) h ( s , x ) d s .

Now writing out ~ as in (5.40) and (11) we obtain first _ = - - ~ + Tr{A-1/2(y)[,(~l) + 1~,~ ~*] + ,~'(1 + 1)),(t ~} as expected (where ~ does not depend on .~'). Now think of the trial ,~ as arising from a construction as in (5.43) with trial anticausal ,~' (i.e., think of trial ~ = ~ with kernel g = A - 1 / 2 ( y ) 6 ( x - y ) + ,~t'(y, x) etc.). Then the operator ,~t = ~fA~* of (5.34) with kernel .~t'(y, x ) = 6(x - y) + k(y, x) arises naturally in the calculation and one has eventually

"2' = ~ + Tr ,(t'(1 + k),(t'* + 2 Tr A-~/2(y)k,(t '* (5.43)

(~ independent of ,(t'). A variational argument as before leads now to an Euler equation for the minimizing ,(~'o, namely, for x > y (cf. (5.36))

A-1/2(y)k(y, x) + ,~t'o(y, x) + M~o(y, s)k(s, x) ds = 0.

T H E O R E M 5.19. The kernel I~(y, x) of fl(y, x) = A-t/ :(y) 6(x - y)+ /~ (y , x) is characterized via minimization as the (unique) solution o[ the canonical M equation of Theorem 5.12 (i.e., kernel/).~t '= 0 [or x > y).

Let us go now to the context of Section 4, Theorem 4.12, and suppose we have an underlying stochastic process Y÷(t) = Z÷(t)+ N÷(t) etc., with y+(A, t) = ~OOh(t) satisfying Theorem 4.12 in the form Q(Dt)~Qh=--)t2~Oh, Q = D 2 - q with q = V+, h = -2K(0) , and from (4.33) d o = o3 dA with o3 = (2/Ir)/~. The minimiz- ing procedure of (5.39), for example, can be also applied to Bh:cos Ax--~

o . a(A, x)--~ s(A, (cf. Theorem q~x,h Y) 2.2) where ~h(Y, X) = t~(X -- y) d- Kh(y, x). From (4.32) we have Kh(y, x)=--g+(y , x) and the GL equation for Kh is then from (4.29), setting K+(t, s) = ½1)(t, s), for s < t

I' l~(t, s) + Kh(t, s) + Kh(t, z)~(r, s) d r = 0 (5.44)

(which has the same form as (5.41) for example with A = l). Here one wants then by analogy (recall from Section 4, o~(6 + K) = R)

~l(y, x) = (cos Ax, cos Ay),, = (2/rr) cos Ax cos AyR dA )

= R ( t + s)+ R ( t - s) = 6(t+ s)+ 6 ( t - s)+2K+(t, s) (5.45)

= 6 ( t - s ) + ~ ( t , s)

Page 44: Patterns and structure in systems governed by linear second-order differential equations

152 ROBERT CARROLL

(for s, t > 0 the 60+ s) term can be dropped). Thus, everything fits together and we want to give the minimization of =~ a meaning in the stochastic theory - one expects it is related to least squares estimation of course and we will spell this out precisely. In this connection we first observe that the discovery of the filtering kernel g+ (i.e., -Kh) is equivalent in 'stochastic geometry' to locating Z,+(tl t) in +H,~ (cf. (4.28)). Next, using this information it is easy to see that in fact

I/Io = (l/or) [',/+- cos at + (g+(t, ~-), cos )t~-)]2/~ d)t dt

(5.46)

= 2 E [J+( t ) - Y+( t) + ( g+( t, r), Y+(r))]z dt

where g÷-- ,9~h for an admissible $~h. Hence, minimizing ~ corresponds to locating Z÷ = J ÷ - Y ÷ in stochastic geometry (i.e., in a least-squares sense). Recall here from (4.3) etc. one knows that X = ~ ~(A)dYx gives an isometry between Hv and L2(/~ dA/21r).

T H E O R E M 5.20. When there is an underlying stochastic process the correspond- O ing minimization of ~ for Bh: cos Ax q~,h is equivalent in stochastic geometry to

linear least-squares estimation and serves to locate Z+(t] t) in +H ~.

R E M A R K 5.21. Let us show here how a connection formula ~0x°(y) = (/3(y, x), q~(x)) plus, e.g., a spectral form for/3(y, x) leads to intertwining via the GL equation (see also Theorem 6.6 and cf. Theorem 4.10). We recall the construction in Section 2 where a kernel Kh was constructed via a Riemann function and shown to transmute because of the Cauchy problem charac- terization in Theorem 2.1. Then in addition it followed that Kh satisfied a Goursat problem as in Theorem 2.2 and provided a connection between cos )tx and o q~x.a. Here we start with a connection and for simplicity take the model Qu = u " - q(x)u with B: D 2 ~ Q: cos Ax---~ q~(y) and /3(y, x) = kernel B = 8 ( x - y ) + / £ ( y , x ) where / ( ( y , x ) = 0 for x > y . Thus, q~x°(y)=cos)tx+ S~/£(y, ~) cos A~ d~ and one obtains a GL equation immediately in the form

fi(y, x) = (q~O(y), cos Xx)~, = ~ (y , x) + /~(y, ~)~(~, x) d# (5.47)

where ~(y, x) = (cos)ty, cos hx)~, = 8(x - y) + II(y, x). Now by analysis such as that leading to (3.17) or that in Theorem 2.2 one knows that / ((y, y ) = 1 y 2 Sd q(x)dx (this is dependent only on the connection and on the differential equation (D z - q)¢O = _)t2q~xo). Now formally if one deals with functions f (x)= (f(h),cos Xx)~ where f = ~ c [ then QB[= o(f(h) , ¢~(y))v = (f(~t),-h2°(y))v while BD2f = B( f ( l t ) , - h 2 cos )tx)v = ( f ( h ) , - hZq~(y))v. Thus, for such f, given that (f, - h 2 cos hx), makes sense etc., B is a transmutation. We can arrive at this conclusion also in another way via (5.47) and a Goursat problem as in Theorem 4.10 (incidently, we will produce here a sketch of a proof of Theorem 4.10).

Page 45: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 15 3

Thus, in (5.47) one can deduce that ~(y, x) = 0 for x < y by several arguments (e.g., /3(y, x) = y(x, y) or a contour integral - Paley-Wiener argument based on the form of/3(y, x) as a spectral pairing). Hence, for x < y (5.47) becomes

0 = fl(y, x) + /~(y , x) + /~(y, ~:)~(~, x) dE. (5.48)

Evidently, D ~ = D~fL Or(0, x) = 0, and we can set K,(y, 0) = 0. Writing n / ~ = /~yr -/~xx (recall here g ' (y , y) = lq(y) and note that R ' (y , y) = Ry(y, y) + /~¢(y, y)) there results 0 = n / ~ + q(y)l~(y, x) + So y II/~(y, ~)lq(~, x) d~?. It follows that II/~(y, x)/q(y) satisfies (5.48) which we can assume to have a unique solution. Consequently III~/q = / ~ and one obtains

T H E O R E M 5.22. Given a connection ~o~(y) = cos Ay +So y/~(y, x) cos Ax dx as indicated it follows that B with kernel /3(y, x ) = 8 ( x - y ) + / ~ ( y , x) is a trans- mutation B: D2--~ Q (acting on/unctions with :'(0) = 0). The kernel I~ satisfies the Goursat problem Q(Dy)/~(y, x) = D~/~(y, x) with q(y) = 2DriP(y, y) and R~(y, 0) = 0.

We note also that if in fact we express/3(y, x) = (~O(y), cos Ax)~ then /~(y, x) automatically satisfies the differential equation in Theorem 5.22 for y :~ x (and /~x(y, 0) = 0). In any event we see that connections of the type with which we are dealing automatically are transmutation formulas.

C O M M E N T 5.23. We see that there are various ways of characterizing or thinking of transmutation kernels. One can begin with Cauchy problems as in Theorem 2.1 or one can begin with a suitable eigenfunction connection (obtained via Paley-Wiener ideas or wherever) and show via a GL equation and a Goursat problem for the kernel that the connection represents a transmutation acting on suitable objects. The Goursat problem is of course exactly what arises if one simply writes out formally the condition for QB[ = BP[ acting on suitable [. We have seen also that our eigenfunction connection kernels are characterized by minimization. Formally we note also that if f(x)--(Pf(A), q~e(x))~ and B: ~0 P --~ ~0~ ° then whenever the spectral integrals make sense B P f = QBf (cf. Remark 6.19).

R E M A R K 5.24. One can give still another interpretation of the minimization procedure for E. Thus, for simplicity take Q --- D 2 - q and P = D e with B: P Q: cos hx ~ ~ox ° , /3(y, x) = 8(x - y) + /~(y , x),/3(y, x) = 8(x - y) + /~(y , x), and ~/(x, y) = 8 ( x - y) + L(x, y) where L(x, y) = /~ (y , x). We think of f(h, y) = ~0x°(y) - cos hy - (.~'(y, ~), cos h~:) in an expression like (5.37) as f(h, y) = ~f(x, y) so that by Parseval relations of the form (2.20) for example (with ~ = ~ and A o = 1)

Io Io Io'f -= = Ifl(x, y)l 2 dco dy --- If(x, y)l z dx dy. (5.49)

Page 46: Patterns and structure in systems governed by linear second-order differential equations

154 ROBERT CARROLL

Thus,

f(x, y) = (f(A, y), q~°(x)),,,

= (,~o(y), q~O(x)L ' _ (cos Xy, q, ~°(x)),,, - & ( y , O, (cos x~, ,p ~°(x)),,,).

Since

(cos xy, q,°~ (x)L , = ~(x - y) + g ( x , y)

one obtains

f(x, y) = - L ( y , x ) - ~)(y, x ) - (,(t(y, ~), L(~, x)).

But (1 +/~)-1 = 1 + L which means that for x < y

L' 0 = L(y, x) + / ( ( y , x) + / ((y, 0L(~ , x) d~ (5.50)

(thus f(x, y) = 0 for ,~ = / ( ) . Consider then formally, for

(,~(y, ~), L(~, x)) = I f *~(y' ~)L(~¢' x) d~,

I0 Io = [L + ,(t + ~ L ] 2 dx dy

= 2 Tr[(L + LL*) + .~L]~* + Tr LL* + Tr[.(t + ~LL*].(t*.

Setting ,(t = ,(to + e J, and using the invertibility of 1 + L, one obtains

T H E O R E M 5.25. Minimization of ~ via (5.49) leads to the criterion (5.50) ~o + L + / ( o L = 0, which characterizes K.

R E M A R K 5.26. In terms of classifying 'all' transmutations between say P = D 2 and O = D 2 - q, one thinks first of the Bh in Theorem 2.2 with (*) q~h(Y)= CosAY+SoYKh(y,x) cos)Ixdx (h¢oo) and the transmutation B~ given via 0x°(y) = [sin )iy/h] + S~ Koo(y, x)[sin )ix/A] dx (cf. (3.3)). The boundary conditions q~,(0) = 1 and Dx~O~h(O) = h (h ¢ ~) plus 0°(0) = 0 with DxO°(O) = 1 exhaust the possible domains determined by boundary conditions. (Recall also that for h ¢ ~ the transmutation Bh is really taking cos )ix + h[sin )ix/A]--> q ~ h - Kh contains a factor h.) On the other hand, if we think of Bh : cos )ix--> o ~0x,h then we have an invertible transmutation for any h 4: oo with kernel Kh + ~ which mixes the boundary conditions. However, one has a different kind of transmutation situation if it is required to mix cos )ix and 0 ° or [sin )ix/)i] and o q~x.h. To see this take c o s ) i x = q~°(x)+~d L(x,~?)q~A°(~)d~, for example, (q~x ° = o q~x.o and L = Lo) and integrate to get

[sin )iy/)i] = Io y q~°(,)[1 + I~ y L(x. , ) d x ] d , = I f ~°a°(')l(x' ~) d , . (5.51)

The kernel ! does not have the form 8(x - ¢) + ,e(x, ¢); it is a smoothing kernel

Page 47: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 155

(cf. (5.5)) and its inverse will involve a derivative. To see a typical form for a related inverse look at [sin Ax/A] = O°(x)+~g/~(x, 00~° (0 d~ and differentiate to get formally

cos Ax = D~O°(x) + L~(x, x)O°(x) + D~L~(x, ~)0°(~) d~ (5.52)

(which should invert the smoothing transmutation cos Ax--~ 0f(y)) . One can see what is happening from looking at spectral integrals. Thus, formally for (5.51) with

~ : [sin Ax/A]~ q~o

and

and

/) = ~-1: q~o___, [sin Ax/A], ~(x, y)

= [sin Ay/A], q~°(x)). (d~ = (2/'rr)A 2 dA

/3(y, x) = (tp°(x), [sin Ay/A])o~ (do) = (2/7r) dA + d~r).

Taking P = O = D 2 one has

-)(x, y) = (2/~r) A sin Ay cos Ax dA - (2/Tr)~'(x - y); )

(5.53)

I; ~(y, x) = (2/~) cos Ax[Sin Ay/A) dA = Y ( y - x) (= 0 for x > y)

There are other transmutations of course, in particular those obtained by adjointness. Thus, e.g., given B: cos Ax--~ ~O(y) one defines t} = (B-l) * and if the spectral theory for (O, ~0 °) involves a measure do)= & dA on [0,~) then /~[cos Ax] = W(A)q~°(y) where W(A)= ~5/~ = (7r/2)~. The kernel for /3 has the form ~(y, x)=(cosAx, q~°(y)W(A))~ (dv=(2/Tr)dA) and, more generally, any spectral pairing fix(Y, x ) = ( c o s Ax, q~°(y)x(A))v which makes sense gives rise formally to a transmutation Bx: cos Ax--~ X(A)~°(y). Indeed, take the domain to be, e.g., functions of the form f(x) = (f(A)X(A), cos Ax)~ for suitable f = ~ c [ and then formally Bf(y) = (fx, ~A°(Y))~ with B[cos /~x]= (8(A- /~) , Xg~°(y))^ = X~°(y). This is essentially the same as looking at solutions of Cauchy problems as in Theorem 2.1 with (p(x, y) = (f(A)x(A) cos Ax, <pO(y))~ and ~(x, 0) = Af(x) =

cos = ( f ( O , (cos cos = ( f ( O , A(x, 0) . For [ ' (0) = 0

and f(x) vanishing for large x, one has formally commutativity of A and P = D 2. We leave open the question of characterizing all possible transmutations.

6. Special Functions

We have already shown in Section 5 how the transmutation machine can be used to generate information about certain special functions and integral transforms

Page 48: Patterns and structure in systems governed by linear second-order differential equations

156 ROBERT CARROLL

and some further comments about the corresponding operators will appar below. First, however, we go to another class of operators which arise both in physics and in the study of special functions. As prototypical equations here one considers (q~ = ru)

Oru = r2u, + 2fur + r2[k 2 - ~(r)]u = pflu;

r2Anu + r2F(r2)u = 0.

r2q~" + r2[k 2 - q(r)]~ = tz2~;

(6.1)

(6.2)

Equation (6.1) arises in quantum scattering theory at fixed energy k 2 from a one-dimensional Schr6dinger operator and /x 2= l(l + 1)= v 2 - ¼ involves (com- plex) angular momentum (cf. [15, 25, 69, 77, 79, 93, 97, 24, 9, 152, 162, 176, 178, 187, 198, 199, 200]). The equation (6.2) arises in many areas, in particular in three-dimensional scattering problems in acoustics and geophysics, and can be studied via integral operators of Bergman-Gilbert-type for example which in- volves transmutations in the radial variable cf. [9, 74-76, 104-106, 32, 116, 139, 223]). First consider (6.2) and write (F = F(r2))

/5"u = r2(r "-t u')'/r"-l; Q"u = P"u + r2Fu. (6.3)

The Laplace operator z~, has the property that r2A,u = P " u + f l ~ u where l-It does not depend on r. Hence, if one can transmute via B: /5 , ~ O" it follows that B: r2A,---~ r2A, + r2F (since B will commute with fl~). The Bergman-Gilbert operator has this property in fact but it was originally designed to express some solutions of (A, + F)w = 0 in terms of a solution of &,h = 0. Thus, e.g.,

f' u(r, .) = h(r, ")+ a" - lG(r , 1 - o-2)h(xo "2) do" (6.4)

(x = (xl . . . x,) - n >~ 2) where G is the Bergman kernel. For our purposes it will be convenient to change variables and use the differential equation for G to express the radial action in the form (for suitable h = h(r))

u(r) = h(r)+(p~-3I£(r, p), h(p)) (6.5)

where /£(r, p) = K(r, p) Y ( r - p) and for (P~,)* 0 = (p20)"- (n - 1)(p0)',

[07 -- (/5~)*][p,,-3/~] = _r2F(r2)6(r_ p); K(r, r) = -½ F(p2)p dp/r n-2.

(6.6)

refer to the operator /3h= u in (6.5) with kernel / 3 = / 3 ( r , p ) = W e

6 ( r - p) + p"-3K(r, p) as the Bergman-Gilbert (BG) operator and one sees easily via (6.6) that /~ is a transmutation, acting on suitable h. We note also, as indicated above, that /3[p2A,] = r2[A, + F]/~.

T H E O R E M 6.1. The BG operator B determines a transmutation pn ~ O" and the kernel ~(r, p) can be characterized by

Page 49: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 157

fc c+i~ /3(r, p) = (1/27ri) p - ~ - ' O ° ( r ) do" (6.7)

where ~ o is the solution of O"u = o " ( o . + n - 2 ) u with u - r ~ as r---~O. Further

B(p~) = O°(r) and the integral in (6.7) arises from an inverse Mellin transform.

E X A M P L E 6.2. For n = 3, ~ = 0, O" = xZD 2 + 2xD + k2x 2 (i.e., F = k 2) one has for u = o.+~ and z = kx ( u 2 - 4 t = ~r(o.+ 1))

~O°(x) = 2"+l/2k-~F(o " + 3)z-~/2J~(z), (6.8)

K(r, p) = - ( k/2)(p/r)l/2 Jl[ kr( l - p/r)I/z]/[ 1 - p/r] 1/2, (6.9)

M[pK(r , p)] = -k-"(kr)-1/2s,,+3/2.~+l/2, (6.10)

where M denotes Mellin transform and s,,.t3 refers to the standard Lommel

function. Expressions like (6.9) are related to the study of transmutation kernels as generating functions and will be discussed briefly later (cf. Remark 6.20).

The construction of /£ as in (6.6) can be carried out directly without inter- vention of the Bergman theory. In the same spirit one constructs an analogous

exterior transmutation in [74, 76] for example. Thus suppose one wants solutions

of A,u + k2(1 - q ) u = 0 in some exterior region, satisfying the Sommerfeld radia- tion condition as r--* oo in the form lim ?"-IV2[Dru - iku] = 0 as r---, ~. A solution is sought in the form

f/ u(r , . )= Beh(r," ) h(r, )+ s "-~'~ " = • " r~Ar, s)h(s, " ) ds (6. l 1)

where h satisfies the Helmholz equation (~, + k2)h = 0. The kernel K~ can be

constructed, for example, by successive approximations as the solution of a Goursat type problem

OrK~(r, s )= OJ, K~(r, s); 2r"-2K,(r , r )= k2sq(s) ds (6.12)

where 0~,u = s2u"+(n - 1)su '+s2kZu and 0 = 0 " with F = k 2 ( l - q ) .

T H E O R E M 6.3. The kernel constructed from (6.12) represents a transmuta- tion Be: £)1._.~ £) with u = B~h+( I~ ( r , s), h(s)) (h suitable), and /£~(r, s )=

s"-3K,(r , s ) Y ( s - r). This kernel ICe then works in (6.11).

C O M M E N T 6.4. The Bergman kernel has played an important role in pure and applied mathematics (see, e.g., [9, 74-76, 104-106, 223]). Kernels of the type indicated in Theorem 6.3 are useful in various acoustical scattering problems (cf. [74-76]). The role of Goursat problems in constructing transmutations is illus- trated again in Theorems 6.1 and 6.3.

Consider now (6.1) (q real) and we will follow a method of [25, 24] (note here that the technique of [152, 162] for example introduces an additional parameter, arising in describing self adjoint realizations of O; the kind of results which we

Page 50: Patterns and structure in systems governed by linear second-order differential equations

158 ROBERT CARROLL

want would then contain an unnecessary parameter inextricably bound up in the formulas). We take t z2= v 2-¼ and use v as spectral parameter. Assumptions such as $ °xl ldx< and even $ x21 ldx< are made but this can be weakened (or strengthened in order to enlarge domains of analyticity). The desideratum here is to obtain the right asymptotic behavior of certain eigen- functions in order to be able to perform certain calculations. One constructs 'regular' solutions ¢(v, k, x) of the q~ equation in (6.1), q~(v, k, X ) ~ X v+l12 a s

x---~0, and Jost solutions f ( v ,+k , x ) - e ~:ikx as x--->~ (we follow the 'Italian' notation here f ( v , - k , x ) - e ik~, etc.). These can be constructed via integral equations as for ¢ o , ~ o in (3.10)-(3.11). One defines also f ( v ,+k )= W(f(v, + k, x), q~(v, k, x)).

EXAMPLE 6.5. When ~ = 0 we have

~0o(V, k, x) = 2~F(v + 1)k-~xl/Ej~(kx);

fo(v, - k , x) = (Tr/2)l/2i~+Z/E(kx)l/2H~(kx); (6.13)

fo( v, - k) = 2 ~(Tr/2)l/EF( v + 1)k-~+l/2 i ~-ln

One can verify easily that f is entire in v while ~ is analytic for Re v > 0, ~o(v, - k , x) = q~(v, k, x), ff(~,/~, x) = q~(v, k, x) , / (~ , -/~, x) = f(v, k, x), f ( - v , k, x ) = f ( v , k , x ) , f ( v , - k ) f ( - v , k ) - f ( v , k ) f ( - v , - k ) = 4 i v k , and setting f ± = f(v, +k) with if: = f(±v, k)

q~(v, k, x) = [ /+ f (v , -k , x ) - f _ f ( v , k, x)]/2ik; (6.14)

f( v, k, x) = [f-q~( v, k, x ) - f f ~ ( - v , k, x ) ]/(-2 v)

Upon writing the Green's function as

G(v, k, r, r')=-q~(v, k, r<)f(v,-k, r>)/f(v,-k) (6.15)

(r< = min(r, r') and r> = max(r, r')) and doing some contour integration, where the asymptotic properties of q~ and f in v for Re v >t 0 come into play (the prototypi- cal asymptotic behavior is exhibited with Example 6.5 in (6.13)), the spectral measure dp for the functions g = fir can be expressed as

dp(v) = 2iv 2 dv/Trf(v, - k ) f ( - v , - k ) (v e [0, i~)); (6.16)

= ~ 8(v-vi) /M=(vj ,k) ( v e Z )

where Z denotes the zeros (if any) of f(v, - k ) in Re v > 0 (M is a normalization factor).

T H E O R E M 6.6. Relative to dp of (6.16) and g = f/r one has g(v, - k , r)g(v, - k , s) dp = ~(r - s). Thus (for suitable h) from ~h(v) = l~(v) =

~ h(s)g(v, - k , s) ds one recovers h by h(r) = (/~(v), g(v, - k , r))p.

Now let 01 = 0 ~ be an operator of type (6.1) with potential ql

Page 51: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 159

T H E O R E M 6.7. Define /3(r, s) = ( g ( v , - k , r), g l ( v , - k , s))o and /3(r, s) = (g(v, - k , r), g l ( v , - k , s))p~. Then B: Or--* O and O] = /~ - l : t ) ~ Ol are trans- mutations with

and

/~ [g l ] ( r ) ----- (~ ( r , S), gl(v, - k , s)) - g(v, - k , r)

~[g](s) = (/3(r, s), g( v, - k , r)) = g,( v, - k , s).

Further, /3(r ,s)=O for s> r , /~(r,s)--O for r>s , and, writing /~(r ,s)= 6(r - s) + I£(r, s) for example,/~(r, s) satisfies a Goursat-type problem (from which intertwining follows):

Orb(r, s)= O'er(r, s~; ~Dr+ l/r)g:~r, r)= ~[~,(r~-~(r)].

Define also transmutations B ,= ~*, so Bf(r) = ([3(r, s), f(s)), and ~ -- [~* = B -t, so ~ f ( s ) = (~(r, s), f(r)). Then with (S~ as in Theorem 6.6 one has for suitable f, g:

(&) B f = (~61f and (~3 g = (~31~ g .

Suppose next that f ( v , - k ) has no zeros for Re u > 0 so that dp(u)= f i (v)dv and from properties of f ( : ~ v , - k , x) and q~(+v, k, x) one obtains

T H E O R E M 6.8, Given f ( v , - k ) = O for Re v > 0 with dp=~b(v)du one can invert t~( u) = (~6h( v) from Theorem 6.6 in the form ( h suitable)

t . l o o

h(r)

where qt(v, k, r)= ~p(v, k, r ! / f (v , -k ) r . If O and Ol have both absolutely con- tinuous spectral measures as above then B[gl( v , - k , . )](r) = (f~/fh)g( v , - k , r) and B[W1(v, k, s)](r) = (/3(r, s), Wl(v, k, s)) = ~(v , k, r).

There are obvious analogies here with Theorem 5.6 for example. The inversion (6.17) is a generalized Kontorovi(z-Lebedev (KL) theorem (cf. here [116, 139]) and for (~ with ~ = 0 we see from (6.13) that f l v , - k ) has no zero for Re v > 0 while dp(v)= - ( v/ lrk ) sin ,rv dr . The version of the KL theorem obtained from (6.17) can then be written as

f S G(v) = . G(s)H~(ks) ds; rG(r) = ~vd(v)J~(kr) de. (6.18) &

It turns out that the general KL procedure can also be extended to Coulomb potentials, for example, even though the asymptotic behavior used in calculating with (6.15) is somewhat different (see [47] and cf. also [238]). Thus take 0 as in (6.1) with ~ = a/x and set v = 1+½ with K = - a / 2 i k = in. Then, with M,,~ and W~,~ denoting the standard Whittaker functions, it follows that for the q~ equation in (6.1)

q~=(-2ik)-t-~M_~,.~(-2ikx); f~= W_,,.~(-2ikx). (6.19)

Page 52: Patterns and structure in systems governed by linear second-order differential equations

160 ROBERT CARROLL

The appropriate methods above can be used, with some care required for asymptotic estimates (cf. [136]), and we have a version of (6.17) as follows.

T H E O R E M 6.9. Define, for suitable f, a Whittaker transform ~ f and then the inversion (6.17) takes the form

I ~ f ( v ) = flu) = f(s) W_, . . . ( - 2iks) ds/s; )

(6.20)

rf(r) = (1/2~rk) F(v + ~ + in) /F(2v+ 1)vf(v)M_,n,v(-2ikr) dr.

One can also extend the techniques of generalized translation, generalized convolution, Cauchy problems, GL equations, etc. as in Section 5 to the 0 - type operators and we refer to [50, 55, 62] for details. Let us refer to operators 0 and 0~ of the form (6.1), with prototypical asymptotic behavior as in (6.13), and in order to transplant the method of Theorem 2.1 we treat r = 1 or s = 1 as lines of evaluation (note that 0 is not suitable for evaluation of q~/r ~ r~-l/2). A change of variables ~ = log r and ~ = log s with rDr = 19, etc., transforms the problem (O)O[.~(r, s) = Orq~(r, s); p(1, s) = Af(s); D,~(1, s) = Cf(s) ( 0 < r, s < ~ ) into a Cauchy problem for -~ ~> 0 (or ~ ~ 0) with data on -oo < ~ < oo. Thus,

T H E O R E M 6.10. Let A and C be linear operators commuting with O~ and q~ be the unique solution of (O). Then Bf(r)= q~(r, 1) determines a transmutation Ol ~ O. Further, given g(v, - k , 1) ~ 0, this procedure with 01 = 0 yields a generalized translation q~(x, y) = U(x, y), with A = 1 and Cf(s) = (F(s, or), f(~)) where

i f = (SJf)U(r, s) = ( [ f (v ) /g (v , -k , 1)], g ( v , - k , r )g (v , - k , s)) o

and

F(s, o-) = (g(v, - k , s)g(v, - k , o'), Dg(v, - k , 1)/g(v, - k , 1))p

with Cf(I) = ['(1).

R E M A R K 6.11. One can show explicitly how B and /3 arise in this way via Cauchy problems and produce a GL equation in the form /3(r, t)=(/3(r, s), A(s, t)) where A(s, t )= ( g l ( v , - k , s), g , ( v , - k , t))o. Other machinery and results are also available, corresponding to the previous development in Section 5. For example, one proves (cf. (2.22)), for T~f(s)= U(r, s) as in Theorem 6.10, (T~f(s), h(s))= if(s), T~h(s)) and, setting (f* h)(r)= (T~f(s), h(s)), it follows that (f* h) ~ = fh/g(v, - k , 1) where f = 05f.

C O M M E N T 6.12. We emphasize again that the theory is based on analyticity and asymptotic properties of various eigenfunctions and the existence of certain transmutation kernels. Potentials are recovered again as in Theorem 6.7 and should probably be relegated to a secondary role. The role of Jost solution and 'regular' solution is interchanged here with the v spectral variable but the

Page 53: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 161

constructions are otherwise basically the same. One is able however to deal with different classes of integral transforms and special functions as in the KL theory (the integral transforms arising from the special functions in Section 5 are, e.g., the Hankel or generalized Mehler transform). After some early interest in scattering at fixed energy in physics it was apparently not pursued too extensively because of the difficulty in extracting physical information from the complex momentum plane (cf. [176].

Another area involving special functions, whose development was only begun in [29, 58], concerns 'elliptic transmutation' and we will sketch some results.

EXAMPLE 6.13. If P = D 2 and Q = - D 2, one cannot deal with a Cauchy problem as in Theorem 2.1 but a half-plane Dirichlet problem (for suitable data) makes sense. Thus, consider P(Dx)tg = Q(Dy)q~ in the form Aq~=0 with ~o(x, O)= f(x). For D2u =--/~2U take u = q~P(x)= cos Ax while for - D 2 u =--A2/,¢

one tries, e.g., an 'eigenfunction' frO(y) = e-~y so at least ~b°(0) = 1. The natural inversion for 4 ° is, of course, the Laplace transform which introduces a 'dis- parity' in spectra for P and Q. However, given that our eigenfunctions are entire and that identity of spectra is of no importance for transmutation one is only concerned with being able to shift contours appropriately in spectral integrals for kernels etc. in order to utilize the appropriate inversion formulas when needed. In the present situation we try for B: D 2 ~ - D 2 : qoxr'---* fO

t ~ /3(y, x) = (q~e(x), f x°(y))v = (2/7r) Jo cos Axe -xy dA 2 y/ fr(x 2 + y2) (6.2 1)

Since TYxf(X) = 1 ~[f(x + y)+ f ( x - y ) ] is a standard generalized translation for D 2 for the half-plane Dirichlet problem we extend f to be even and consider (cf. (5.2))

x I f f(~:) rise qffx, y) = (/3(y, ~), T~ f(~)) = ( TJ3(y, ~¢), f(~)) = (4/~r) o~ (x -- ~5 ~- y2 (6.22)

(y>0). This is, of course, the well-known Poisson integral formula. In this connection we recall also that the conjugate harmonic function to q~ is

f~ (-xz ~)f(~?) d~¢ (6.23) 6(x, y) = (1/70 J_oo (x - ~)2+ y2

and as y ~ 0, @(x, y ) ~ (1 /1r)[Pf(1 /¢)*f] (x)=-~f where ,~9 denotes the Hilbert transform (cf. [22, 180, 181, 224] for Hilbert transforms in a distribution context).

The above 'formulation' can in fact be generalized in a canonical way and one obtains for example most of generalized axially symmetric potential theory (GASPT) in a transmutational (and hence extendable!) manner (cf. [104, 85, 182, 183, 227-234]).

Page 54: Patterns and structure in systems governed by linear second-order differential equations

162 ROBERT C A R R O L L

Thus take P - - P,. = De + [ ( 2 m + l ) / x ]D(m >-½) and O = - D z with

f ~ kmy x2m+l

/3(y, x) = ( l~f (x)~°(y))~ = c~ (Ax)m+'Jm(Ax) e -~y dA - ) (X 2 .31_ y2)m+3/2

(6.24)

T y - P m is known (cf. (5.8)) and one obtains

T H E O R E M 6.14. With /3(y, x) given by (6.24) and T y by (5.8) the function ¢(x, y )= ( /3 (y , ~c), T~f(~)) satisfies P, , (Dx) ,p=-DZq~ with ¢(x, O)= f(x) and can be written as q~(x, y) = ~,~ P(y, x, sc)~2m+lf(s c) ds c where P(y, x, ~c) = T~[/3(y, ~)~-2m-l] : (~X)--m. ~(7 e -yt J,~(xt)J,,(~t)t dt.

One is led now to G A S P T and pseudoanalytic functions in a canonical transmutational f ramework (cf. [10, 85, 104, 182, 183, 223, 227-234]). Thus conjugate to ~o(x, y) in Theorem 6.14 is a function

q/(x, y) = x 2"+' O(y, x, sc)f(sq~ 2m+' ds t )

(Q is constructed below canonically) and (q~, t~) satisfy the generalized C a u c h y - Riemann equations

~x = x2'~+~ q)y ; ~by = -x2m+tq~x. (6.25)

To produce the 'intrinsic' linking between P ( y , x , ~) and Q ( y , x , ~:) we set )~O(y) = e-ay/A so )~°(0) = l/A and Dy)~°(0) = - I. Define a formal t ransmutat ion B: P = P,, ,--~-D 2 = O via

/3(y, x) = (ll~e(x),)?°(y))v = F(m + 1)x2m+'/-,/~-F(m + l)(x 2 + y2),,+,/2 (6.26)

(Bf(y) = (fl(y, x), f(x)); B,~f = 20). Then one has

T H E O R E M 6.15. Define

(.~I(,¢j, x, y) = T}[/3(y, s~)s c -z ' ' - l ] = (~:x)-" I o J,,(~t)J,.(xt) e - y t dt.

Then P(y, x, ~j) = -Dy(.~(~:, x, y) and O(y, x, ~) = Dx(~(~, x, y). One has P~(~ =

Oy(g and (~s~ is a ' fundamental' solution with a logarithmic singularity at (y = O, x = ~). Explicitly ( O , denotes the Legendre function of second kind) (~(~:, x, y) = ( l/7.g)(~x)-m-I/2Om_l/2[(x2 + y2 + ~2)/2~x]"

R E M A R K 6.16. The conjugate kernel leads to a general Hilbert transform which has been studied extensively in connect ion with Erd61yi-Kober (EK) operators (cf. [172, 192-194, 224]). Thus, the so-called conjugate Hankel transform is

Hmf(x) = lim O(y, x, s c f ~c ~:- dsC. (6.27) y--~(I

Page 55: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 163

The canonical transmutational form of q~ and ~O above for P - - P,, suggests the development of other such Hilbert transforms as P varies. Another type of generalized Hilbert transform studied in [10, 28, 81, 138] arises when transmut- ing Q = - D 2 into P = P,, for m <-½; the canonical formulation is indicated in [29].

COMMENT 6.17. GASPT was an important area of work in the 50s and 60s under the aegis of A. Weinstein (cf. [10, 85, 104, 182, 183, 223, 227-234]). There are numerous applications to physics and one imagines similar applications available from our canonical formulation in various Riemannian symmetric spaces, There should also be considerable value in further adapting transmutation methods by the study of EK type operators.

Let us mention here in connection with special functions some transmutation type operators of EK type which arises when studying certain singular pseudo- differential (psdo) operators in a canonical way (cf. [29, 92, 134, 137, 169, 211]). Thus, let a(x,A) be a classical symbol acting by Fourier transform (i.e., A(x, D)u = (1/27r) J'_~= e iax a(x, A)o~u(A) dA where ~u = (u(lj), e -i*~) here - cf. [221]). In view of the half-line (radial) nature of our operators, take a(x, A) even in x (and for convenience say even in A- odd in A is also a canonical situation). In a standard way one can also assume a(x, A) of compact support in x and 0 for say [A[ ~< ½. Let ,~c" denote the cosine transform and B o : D 2--> Q: cos Ax--~ q~O our standard transmutation (here Q can be as in (2.16) with R ° - d t o = & d A ) . Define now ti(~', A) =(1/lr)~ca(x, A)(x -~ ~') and ti(~, A) = f i (~- A, A) + fi(~'+ A, A). One sets then (/3o = (Bol) * as in (5.l 1))

fi,(y, Q) = BoA(x, DBo'; ,~(y, Q) = BoA(x, D)B~)'. (6.28)

T H E O R E M 6.18. Let fi = Cu and dw o = &dA. Then

A(y, Q) = j6~ J,7 a(~, 2t)~(,~),p~'(y)a(z) d~'dA;

A(y, Q ) = J'~7 J',~ fi(~', Z)oS(~')~C°(y)fi(Z) d~" dZ.

Further if one takes Q = Q,,, (A o = x 2"+1, q = 0 , and oS(A)--c~A 2''+1) then emSo S(7 a(~', A)cP?(y)a(A)A~ 2'n+l-~ d~dA cor- operators of the form A~,(y, Q ) = 2

respond to operators H~A(y, D)II~ 1 where II~, = ~A-~',.~c • (I12,0+1 = (*rc2/2)Bo and Ilo =/3o). Thus, II~, 'interpolates' between Bo and Bo and Ilm+l/2, for example, is an EK operator which is a sum of a Riemann-Liouville and a Weft- type fractional integral.

R E M A R K 6.19. In connection with interpolation let P and O be general operators with d r = bdA and d o = & dA and W(A)= dJ/b. Define say B,,:P--> 0 via

/3~(y, x) = (.O~(x), W(A)~q~°(y))~. (6.29)

Thus /3o(y, x) =/3(y, x) and /3~(y, x) =/3(y, x). If we take f(x) = (fOr), q,~(x))~

Page 56: Patterns and structure in systems governed by linear second-order differential equations

164 ROBERT CARROLL

with say f(A) = ~f(A) then since formally (~e(x) , ~P(x)) = 6(A -/~)/9(A) we have first

( B ~ ) ( y ) = (W(X)°~°(y) , ~(;t - t,)/,;(a))~ = W ( ~ ) ~ ( y )

and then formally (cf. Remark 5.19)

QB,,f = OB~(f(A), ~o~e(x)) = O(f(A), W%o°(y)) = (f(a) W~(A), - A z ~ ° ( y ) ) ,

while evidently

S,,Pf = B~(f(;o,- X2~0f(x)L = (f( ,~) ,- ,X 2 W%o°~(y))~.

Thus, formally B~ is a transmutation, acting on f as indicated such that the pairings make sense. Generally, however, W e will not have any useful analyticity to exploit for triangularity-type results - except for a = 0 or 1. For P = D 2 with b 21Ir and Q= Qm with & _2.2m+1 c27r2 Aa,.+I = = c , . n we have W ( A ) = ( m ] ) -- a=A 2"+1. Now generally B~ = ~ W ~ = ~ W " - I ~ and, in particular, for D 2 and Q,. , Be = ~(a.,A(2"+l)("-l))~ so (since ~ -- ~ c here) up to a constant B~ - l-I,, in Theorem 6.18 with - / , = ( 2 m + 1 ) ( a - 1) (thus, /* = m + ½ - o l = ½). We note also

here that the objects on w h i c h / ) and /3 act as transmutations can be represented in the form f(x) = (l/2~r) ~2oof(A)We(x) dA where f(A) = ~f(A) (recall here (5.22)). Thus, /3*x e = qro a n d / ) ~ e = dOo so as above (cf. also Remark 5.19)

F (/3/)(y) = (l/2rr) f ( A ) * ° ( y ) da o 0

with

F (/3/)(y) = (1/2 z r) [(A)[d~°~(y)/ce(-A)] dA 0 o

and when everything makes sense Qf~f = BPf with QBf = BPf.

R E M A R K 6.20. We indicate next a few results (cf. [53]) about generating functions arising in a transmutation context as transmutation kernels. Thus, in Example 6.2 one can write for example (cf. [162, 198])

K(r, p) = -(rp) -1/2 ~. (kp/2)"J,. (kr)/(m - 1)I 1

(6.30)

which exhibits K as a generating function for the Bessel functions. This sort of situation will often occur when using the Mellin transform and is related to interpolation formulas in complex analysis. As an analogue of (6.30), we consider the Whittaker inversion of Theorem 6.9. One proceeds formally via contour integration and residue theorems to obtain an apparently new generating function for certain Whittaker functions. Thus, one has a transmutation kernel (15_ D(r2D), 0 = /5 + r2(k 2 _ a/r))

Page 57: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 165

p) = (1/2 ~rir) f (2ikp)-'~-~J~,,.~.l/2(2ikr)F(2o. + 2) do" (6.31)

where ~)~K,a(z) = MK,a(z)/F(1 + 28). Consequently, (/~ = 2ikp, ~ = 2ikr) formally

oo

/~(r, p) = (1/2r) ~ tWz( - 1)"~l~K.,/z{,+.)(f)r(½(n + 2) -- K)/n!r( - ½n - K). 0

(6.32)

This procedure can be extended, of course, to obtain new types of generating functions for q)=°(r) of type Y, c,,~P(p)(O~(r) where ~P(p) is no longer a power of p. Connections of the transmutation approach to the classical developments in [198, 170, 184, 225, 226] will also appear in [53]. Another feature of [53] is to give a complete generalization of the relation (6.30) involving K(r, p) of (6.9) ( f 3 = 8 + K ( r , p ) Y ( r - p ) ) and ( f 3 - 1 - ~ = 8 + L ( r , p ) Y ( r - p ) ) L ( r , p ) = (k /2) [1- p/r]-~/2ll[k(p/r)l/z(1- p/r)J/2]. Recall /~ is given by (6.7) and using our general KL method one obtains for the model problem of Examples 6.2 and 6.5

Zl(r, p) = r~( - iv/rr)go(v,-k, P )dv / fo (v , - k )

= ( l /2 f /2 ) (k/2)"r~'H~(kp) d v/F(~,)

Writing ~(r, P) = (1/2m)(ro) -~2 I'-T~ (kr/2)~F( 1 - v)[J-~(kP) - e-~"~J~(kP)] dv and evaluating this by residues at 1 - ~ , = - n ( v = n + 1) one obtains (-A-)-~(r, p) = (tO) -l/2 ~T(kr/2)mJm(ko)/(rn - 1)! = L(r, P) for p < r. Thus (note that fl(p, r )+ L(r, 0)= 0 for O> r so ~(r, 0) is triangular and /~(0, r) contributes a term 6 ( r -P ) ) for our model operator of Example 6.5 with fl(r, p) = ker / ) , B:/5_+ 0o, given as 6 ( r - p ) + K(r, p ) Y ( r - p ) , one has the expansion (6.30) expressing K(r, P) as a generating function for 0 < r and the kernel "~(r, 0) for ~ -=/)-~ can be constructed via KL theory in the form (6.33) from which

~(r, O) = 8 ( r - P) - [(rP)-~n] 2~ri] (kr/2)~F(1 - ~,) e-"~J~(kO) d~,Y(r - P).

The latter integral represents ~(r, p) as a generating function for P < r via (~') above. One can generalize this situation as follows. Let [, q~, etc. refer to a general 0 type operator and set ( 0 0 ) 13(r,o)--(1/21ri)~o-~-~q~(~, k, r)do"/r with (AA) "~(r, p) = -(i/rr) ~i_~ vr"f(v, - k , p) dr~of(v, - k ) . Note from q~(v, k, r)

r ~+1/2 for large ~, we see that /~ ( r ,p )=0 for p > r. Now using (6.14) for - k one obtains

~(r, p) = (i/2 rr) r ' [{[(-~,,-k)cg(v, k, p ) / p f ( v , - k ) } - ~#(-v, k, p)/p] dr.

(6.34)

Page 58: Patterns and structure in systems governed by linear second-order differential equations

166 ROBERT CARROLL

For p < r (where /3(0, r) = 0) we can write

I; ( A ) ~ ( r , o) = - ( 1 / 2 ~ ' i ) ,j~-l/2[f(-v, -k)/f(v, -k)]q,(v, k, O) dv/o

= L ( r , P).

We recall f ( v , - k ) is analytic for Re v > 0 so formally (A) can be evaluated by residues upon closing contours to the right - provided f(v, - k ) ~ 0 for Re u > 0, which is the requirement for absolutely continuous spectrum. Recall here f ( - v , - k ) = W ( f ( - v , - k , x), q~(-v, k, x)) will have poles determined by those of ~ ( -v , k, x) for Re v > 0 (since f ( - v , - k , x) is analytic in v). Various situations are possible (cf. [11, 79, 97, 178]). Typically in physics (simple) poles can occur for ~o(-v, k, x) when 1 - 2 v = - n ( n = 0 , 1 . . . . ) and if, e.g., x~t(x) is analytic at

! 3 (there are other situations when, e.g., x = 0 then the only poles are at u = 2, ~, • • • the only poles are at v = 1, 2 . . . . ). Thus write for such typical situations f2 = lim(v---> v n ) f ( - v , - k ) ( v - v~). Then

T H E O R E M 6.21. Under the hypotheses indicated let [~: P ~ O be given formally via the kernel ( N ) , B: p"---~ ~°~(r); then the kernel ~(r, p) for ~ = [j-1 is given by (AA) and with L(r, p) as in (A)~/(r, p) = ~(r- p) + L(r, p) Y ( r - p) so that for p < r, ~,(r, p) is expressed via the integral for L(r, p) in (A) as a generating function L(r, p) = E~ rn/2f2~(v., k, p)/pf(v., -k) .

Another development of GL type arises as follows. Define ( - v - ½ = - o r - 1)

~(~, p) = (i/2 7r) p,~[~.-,/zf(_~,, -k) / f (v , - k ) - ¢--~-~/2] dv = ~(p, ~)

(6.35)

= ( i /2~r) ~ [ p ~ ' f ( - ,,, - k ) / f ( v , - k ) - o - ~ - ~ 1 d r .

T H E O R E M 6.22. From ~°(r) = (el(r, 0), 0 ~) there is a general GL equation (for P and Q) in the form ~,(~,, r) = (~(r, O), ~(0, ~))where ~ is given by (6.35), ~ by (1~), and ~, by (AA). Further

I? ~l(~,r)=(l/2~ri) ~ ~ ' r -~ ' -~dv+F(~,r )=~(~-r)+F( 'o , r ) ;

(6.36)

F(rl, r) = - (1 /27 r i ) ,~ Tl°~r°'[f(-u, -k)/ f(v, - k ) ] d v

In typical situations as above we have then F(r/, r )= ~ (Tir)"/2f2[f(v,,-k). We go now to some new results related to orthogonal polynomials. There are

various treatments of orthogonal polynomials of which we mention [5, 72, 96, 100-102, 219]. One way of developing the theory (cf. [72]) is to start with a weight function /2(x) (or suitable d/z(x)= f idx) on say (a, b) and define a moment functional L(f )=~f(x)d lz (x) . The moments /~, = L ( x n) are then

Page 59: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 167

known and one looks for polynomials P.(x) of degree n such that say

S b P. (x)Pm(x)dtz(x)= 6,. . . Various equivalent formulations are possible. For example it is enough to show that (t) L(Tr(x)P,~(x))--0 for polynomials ~r of degree m < n while L('rr(x)P,,(x)):p 0 for m = n. Alternatively, one need only show (+?) L(x"P,,(x)) =/<, ,&, , with /<, :p 0. Now extend the idea of 'polynomial' and try to produce orthogonal functions relative to a given measure on [0, ~) for example. The machinery must be different at various places and it turns out that

one can magically proceed via transmutation ideas in an intrinsic and canonical manner. This is connected, or course, to the extensions of Krein (continuous analogues of orthogonal polynomials - cf. [5, 67, 100-102, 120, 146, 32]) but

our methods have a different flavor and cover more general situations. For the

Krein functions let us recall the differential equations in Theorem 4.8; these also arise heuristically from extending certain recursion relations for polynomials

orthogonal on the unit circle (cf. [5]). Thus, consider U n + [ = a, x u , + b , v , ; v , + l = b , x u , + a , v , with say Uo=Uo(X)=l , Vo=Vo(x )=l , a n = d , , and a ~ - Ib, I 2 > 0 (x = e i°) and extend this to D,u = iAu + b(t)v; D,v = b(t)u as in [5]; this is equivalent to the equations in Theorem 4.8. Generally, we think of (x, n)--~ (A, t) in passing from discrete situations to the continuous analogue.

Now the classical techniques for orthogonal polynomials cannot be directly extended since certain procedures simply don't make sense. In order to circum- vent this, at the same time give perhaps a more meaningful and canonical

procedure, we proceed as follows. Let us work with the analogues of polynomials on the real line or cosine type polynomials (cf. Theorem 4.15) rather than the classical Krein function situation of Theorem 4.8. Thus, in the role of polynomial (of degree t!) we write (this is a model case - the kernel form will be extended

later)

I' -~'tA, t) = cos At + c ( t , s ) c o s A s d s (6.37)

and for moment functional write (dtx(A) on [0, oo) being given)

L(cos At) = cos At dtx(A) = g(t) (6.38) I

(one recognizes g(t) as G'(t) in the geophysical problem - cf. (3.21), (6.50), and Theorem 5.4). Note also that a more general q~f(x) can be used in the role of

cos Ax (see below). Now one expects that the orthogonal functions [(A, t) satisfying )'~ f(A, t)f(A, s )d tz(A)= 6 ( t - s ) will arise from a GL kernel /3(t, s ) = 6 ( t - s ) + K(t , s) for example (in the model case). Thus, one expects

f(A, t) = cos At+ K(t , -r) cos A~'d~'. (6.39)

Given that such f exist and are orthogonal one can characterize K, for example by minimization, with a condition analogous to ( i t ) of the form

Page 60: Patterns and structure in systems governed by linear second-order differential equations

168 ROBERT CARROLL

I ~ cos Xsf(X, t) dr,(A) 0, s < t (6.40) for )

(which says that/3(t, s) = (f(A, t), cos ,~s)~, = 0 for s < t). Now using (6.39)-(6.40) one obtains a GL equation; for s < t

I' ~(t, s) = 0 = (cos At, cos As), + K(t, ¢)(cos M', cos As)~ ds. (6.41)

J

Here one can determine 91(t, s )=(cosAt , cos)ts)~ in terms of the moment functional! Thus, as with the time domain GL equation of the geophysical problem 91(t, s) = ~ ( t - s) + f~(t, s) (cf. (3.23)), where we write dtx = (2/~r) dA + do" (see below for other measures) and (@A) Ig cos At dot(A) = gr(t) so that (extend- ing gr to be even)

I f [ c o s A(t+ s )+cosA( t - s ) ]do '=½[g , ( t+ s)+ gr([t--Sl) ]. (6.42) ~(t , S) ----- ½

T H E O R E M 6.23. Given f(A, t) as in (6.39) with (6.40) it follows that the kernel K(t, s) in (6.39) satisfies a GL equation

Io' (s < t), f~(t, s) + K(t, s) + K(t, ~')f~(~', s) d r = 0

where the symmetric kernel ll(t, s) is given in terms of the moment functional via (6.42).

This theorem is extended and refined below. For now, given (6.39) and the GL equation, we proceed as in Theorem 5.20. First from (6.39) by writing formally (mA) K(t, ~-) = (2/~) J'(~ If(A, t) - cos At] cos M- dA one concludes that K,(t, O) = 0 and then for I l K = K t t - K~, m K + g(t)fZ(t, I") +~dmK(t, ~:)II(~c, ~-) d~ = 0 where q(t) = 2D, K(t, t). Note here ~,, = f l , , and we assume f l is say twice continuously differentiable. Given unique solutions of the GL equation we obtain

T H E O R E M 6.24. Given the hypotheses of Theorem 6.23 with unique solutions of the GL equation and l-I twice differentiable one has O(D~)K(t,-r) = D2K(t, ~) where O(Dt) = D~ - q(t) and q(t) = 2DtK(t, t) with K,(t, O) = O. Moreover, (6.39) determines a transmutation B: D2--~ C) acting on functions with g'(O) = O.

We remark here that to determine the a,,. such that P , , ( x ) = ~ a., .x" represents the orthogonal polynomials relative to d/~, given say (6.34) one writes (tzk = L(xk))L(xkP,(x))= K,~k, =~(qa,,,,/xk+,, which is a kind of discrete GL equation (cf. [67] - a somewhat more general situation can also be treated). On the other hand, we note in (HA) that existence of K is guaranteed, e.g., if f(A, t ) - c o s At has a general Fourier Cosine transform (for triangularity we want say [(A, t) to be entire of exponential type t etc.). In any event, there is a clear analogy between solving for the GL kernel and a coefficient determining pro- cedure in the discrete case. A direct calculation gives

Page 61: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 169

T H E O R E M 6.25. Given dl.~ one solves the GL equation in Theorem 6.23 to get K(t, ~') and then defines f(A, t) by (6.39). The f(A, t) are then orthogonal and in fact for f of the form (6.39) the GL equation is equivalent to orthogonality. Further, one has Q(D,)f(A, t) = -A2f(A, t) with f(A, 0) = 1 and f'(A, 0) = h = -g,(0).

COMMENT 6.26. In earlier sections we had in a sense too much structure available; in the development here and below one can see better what properties are actually being used and how they relate to one another. There are two sets of functions and two measures to play with in writing e.g., f = q~P +~d Kq~ e dx, f ~ do , ~o e ~ dr , etc., (cf. [67]).

In the spirit of Theorem 5.11 for example consider now the minimization

-,o = = or(A, t ) - c o s A t - ~(t , s) cos As ds dw dt (6.43)

(,~' in a suitable class of causal kernels) where zr(A, t) is some general function with (0) (rr(A, t), cos As),, = 8 ( t - s ) + 6 ( t , s). The standard minimization pro- cedure for E,o yields then (assume ~,o=SorS~[1r(A, t )-cosAt]2dtodt makes sense)

~, = +

+~o T

(here again ~ =

io fo ' io io ' 2 ,~ ( t , s )O( t , s )dsd t -2 ,~(t ,s)&(t ,s)dsdt+

o" ,eft(t, s),~( t, s) ds d t +

[o' I f ,~'( t, s)~( s, r),~'( t, r) d r ds dt

3 + 1~ as above). Hence, as in Section 5.

(6.44)

T H E O R E M 6.27. Assume 7r(A, t) is a suitable general function satisfying (0) ^

with &( t, s) = 0 for s < t and so that =.0, makes sense. Then the best least squares approximation for =-~, involves a ,~o(t, s) satisfying the GL equation of Theorem 6.23 for s < t so that min E,o -- So T j'~ [Tr(A, t) - f()t, t)] 2 dto dt.

Let us observe next what happens upon minimizing

12 ,--v ~' = ~r(A, t ) - c o s A t - ,~(t, s) cos As ds dv dt (6.45)

where dv is the P = D 2 measure relative to which the ~Ae(x)---cosAx are orthogonal and 7r(A, t) is again some general function, not necessarily represen- ted in the form (6.39) Off runs over a suitable class of causal kernels). Let us write ( 00 ) 6 ( t - s) + a(t, s) = (Tr(A, t), cos As)~ (a need not be triangular) and set ~,~'~ = .[o T .f~ [~r(A, t) - cos At] 2 d v dt (assumed to exist). Writing out ~v now one obtains

Page 62: Patterns and structure in systems governed by linear second-order differential equations

170 ROBERT CARROLL

. , , = ~.,,, + 2 , ~ ( t , s ) 6 ( t - s ) d s d t -

io io ' - 2 .~.( t ,s)[~(t-s)+a(t ,s)]dsdt+

I;Io' + ~(t, s),~t'(t, s) ds dt (6.465

Io'Io = ~ + [,~(t, s) - a ( t , s)] 2 ds d t -

- I f I 2 a 2 ( t , s ) dsdt.

This is clearly analogous to a procedure characterizing the Fourier coefficients in classical trigonometrical expansions and one has

T H E O R E M 6.28. Given a general "tr(A, t) with (00) the coefficients ~f(t, s ) = ct(t, s) for s ~ t provides the minimum value for ~ and one has a Bessel inequality for suitable It(A, t), Jo y [.~ a2(t, s) ds dt ~< SoT j~ [Tr(A, t) - cos At] 2 du dt.

This result can be thought of as a best least-squares approximation to zr(A, t) by entire functions of exponential-type t of the form cos At+~d ,~(t, s )cos As ds. Since essentially any such (even) function has this form one obtains equality in the Bessel inequality for 7r(A, t) = f(A, t) = cos At+~d a(t, s) cos As ds. One notes also that in analogy to the conditions (t) and ( t t ) for 'polynomials' of the form (6.375 the condition ~t] ~ 1r(A, s)f(A, t) dig = 0 (s < t) is equivalent to (6.40); simply invert the formula (6.37). We remark also that the role of the 'kernel polynomial' K,(z, x) = ~, Pm(z)P,,(x) is played here by ,~T(A,/x) = JoY f(A, 0f(A, t) dt (cf. ear- lier remarks on the Darboux-Christoffel formula etc. in (4.40)-(4.415 and Theorem 4.8).

C O M M E N T 6.29. It should be worthwhile to continue the program of extending ideas from orthogonal polynomial theory to more general orthogonal functions via transmutation machinery (cf. [48]).

The above procedures apply very well when d to=(2 /Tr )dA+dt r with d~ suitably finite. When dw grows more rapidly the situation changes and at least two procedures suggest themselves. As a model take the case of Example 5.1 where dto = tbdA with tb = 2 2m+l c,,A for Q = Q,,. For B: D2--~ Qm the trans- mutation kernel is given by (5.5) (with inverse kernel (5.65) and clearly /3 = /3o(Y, x) does not have the form 3(x - y) + K(y, x) with K a function. We note that in this situation the kernel A(~, x) in the general GL equation of Theorem 5.2 has the form

I2 A(~, x) = ( q , f ( 0 , ~ f ( x ) L ; c~ cos ~ cos ,~x,~ 2"÷~ d,~

-- -~m[Ix - ~1 - ~ - ~ + Ix + ~1 -~m--'] (6.47)

Page 63: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 17 1

where /3., = 2~/Tr/F(m + 1 )F ( - m - I ) and ]yl -~ ~ y+t~ + y7_~ for pseudofunctions

y~O. One could now try to duplicate some of the previous machinery in a

distribution context where objects such as (5.5), (5.6), and (6.47) were prototypi- cal. Another approach, which we prefer here, is to refer a measure dw with growth ~ 2 " , + 1 to O., = P as a point of departure and replace cos ax by ~o~(x)=(1/c,,)J,,(Ax)/(ax)., in the preceding machinery (cf. the material on random fields in Section 4). We note first in this connection that for dw = c~nA2m+l[dA + do']

£; A(~:, x) = 6(x - ~) + x 2m+' [Jm(Ax)/(Ax)m][Jm(A~)/(A,~)m]A 2m+' do- (6.48)

(note (q~f(~), f~f(x))~ = 6(x ~) for du 2.2m+l - = c . , a dA). Thus, for say do-= d-dA

with suitable 6-, the term f~(~, x)Ae(x)= A(~, x ) - ~ ( x - ~ ) will be a function. One knows also (cf. [29, 34]) that if B: P---~ O: q~f--~ ~0~°(Ap = x 2",+1 and A o =

x2",+~Ao say) then there is a related transmutation /3: [i___, 0 where, e.g., if

Qu = (Aou')'/A o + q(x)u,

A~2Qu = O[A~/2u]; Qw = w"+ ftw; (I = q-Aot/2(A~2) ".

Then [3=A~2(y)B(x--+y)x-.,-1/2: [9~ Q. Now the function q will generally

have singularities (e.g., for P = P. , , /~ = - ( m 2 - 4~)/x 2) but/3 = kernel /~ will have

the form /3(y, x) = 6 ( x - y) + /~(y , x) with /~ causal. It follows that /3(y, x) = A~l/2(y) 3 ( x - y ) + K(y, x) where K(y, x) = AoJ/Z(y)/((y, x)x "+~/2, which is

reminiscent of the geophysical situation (cf. (3.18)). Further, by Volterra inver- sion y(x, y) = A~2(y) 3 ( x - y )+ L(x, y) and since /3(y, x) = Ap(x)Aot(y)y(x, y) (el. (5.12)) we have /3(y, x ) = A J / Z ( y ) 6 ( x - y ) + / £ ( y , x). Thus, given the GL equation in Theorem 5.2 one knows A(~, x ) = 8(x-~)+Ap(x)l)(~, x) as in (6.48), even though no comparison of measures was made. In any event given measures do~ with growth as in (6.48) we will try to find orthogonal 'polynomials' /(A, t) in the form (A ~ A o 1/2)

I' f(A, t )= A(t)~of(t)+ K(t, r)q~f(r)dr (6.49)

where A(~:,x) has the form (6.48) (A(~: ,x)= 8(x-£)+f~(!Lx)Ae(x)). For moment functional now we specify (cf. (6.38))

L(Of(t)) = f~f(t) dto(A) = g(t) = Ap(t)17V(t) (6.50)

( W = ~b/h with dw = & dA and VC(t)=J'~T W(A)~0~(t)du). The relation between the moment functional and the kernel A(s c, x) has an apparently different form now than in (6.42). Thus, recall (5.17) (i.e., A(£,x)=Ae(x)T~ff ' (£)) to write o3 = (1 + 6-)~3 dA and

A(~:, x) = 6(x - ~) + Ae(x)r~£(~); £(t) = ~f(t)d-(a) dr. (6.51) I

Page 64: Patterns and structure in systems governed by linear second-order differential equations

172 ROBERT CARROLL

One notes that (6.42) is, of course, a form of generalized translation for D 2= P and, thus, we have produced the proper 'canonical' formula. Hence, again the moment functional determines the kernel A(~, x) via generalized translation. Now (following Theorem 6.21) suppose f(A, t) is given by (6.49) with (cf. (6.40))

fo~Pf(s)f(A, t) dto(h) = (6.52) 0

for s < t . Then, using A ( ! j , x ) = 3 ( x - ~ ) + l ) ( ~ , x ) A p ( x ) and taking scalar products in (6.49) with l)P(s), for s < t one has

Io 0 = A(t)l l(t , s)Ap(s) + g ( t , s) + g ( t , r)a(r, s)aj,(s) dr. (6.53)

THEOREM 6.30. Given (6.49) with (6.52) and the kernel A(~, x) determined from the moment functional via (6.51) it follows that the kernel K in (6.49) satisfies a GL type equation (6.53) for s < t.

Now (6.53) contains two unknowns A(t) and K(t, r). When, in fact, there is an underlying A operator as above we know A = A o ~/2. In practice one uses an integrated form of such a GL equation as in the geophysical problem to obtain an equation involving K alone, which can then be solved for K (with A later determined via K by a separate argument). One way around this here is to write ( ~t) A( t) I( ( t, s) = K ( t, s); ~( t, s)Ap( s) = O( t, s). Now (~,(0, s) = 0 and from (6.49)

( f = f /A)

t) - ~ f ( t ) = [ ' £ ( t , T)~P(~ ") dT; (6.54)

I~ If(A, - ~e(t)]~P(T) dr(A) = / ( ( t , T)ApI(T). t) }

Hence, (/(/Ae)~(t, 0 )= 0 and /((t, 0)= 0 (for m > -~). There results (rewriting (6.53) in terms of /( and 1~)

THEOREM 6.31. Given (6.49) with (-k) and (6.53) where (6.53) has unique solutions, and (l is twice continuously differentiable, one has (for q = 2/('(t, t))

[P(Dt ) - q(t)]I((t, x) = P*(D~)I((t, s)

(also (/(/Ap(-r))~(t, 0) = 0 and Ii:(t, O) = 0 - m > -½). Further, from (6.54), P(Dt)f = -A2f+ q(t)f.

Now from [32], if we are dealing with the situation above where fl = A ~ l / 2 8 + K and t C ° A = A ~ l n ~ P + S K ~ d x (with suitable K) then for Q u = (Aou')'/Ao + ClU (Ao = AoAp = Aox 2"+1) one has in fact

q(y) = 2[A~2(y)K(y, y)] '= 2/('(y, y) (6.55)

= - [ 4 + lz(Ao/Ao)' 2 _ ~(Ao/Ao)l " - ( A 6 / A o ) ( ( m + ½)/y)]

Page 65: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 173

( Q * ( D x ) K ( y , x ) - - Q ( D y ) K ( y , x) for x < y and from (6.54), for m > 0 at least,

our K will be suitable).

Now write Qof = (AvAof ' ) ' /AeAo = [(A;,/Ap) + (A[~/Ao)]f ' + f" and one ob- tains ( f= A~,/2f)Aol/Epf = Qof + qof;

~)/ t) + ~( Ao/ Ao) q o = [ ( A b / A o ) ( ( m + l 1 , 1 , 2 - z ( A o / A o ) ]f.

We note that (6.55) represents 2K'(y, y) as q = - ~ + qo. Now use Theorem 6.31 and the above to obtain Qof + ~f = Abl/2pf+ (t~ - qo) f = - )t 2 f + ( q + cl - qo) f = - A z f . For simplicity take ~ = 0 to obtain a typical theorem

THEOREM 6.32. The connection (6.49) (with A = A ~ 1/2) will arise from an underlying differential operator Q = Qo (Ao = A o A e ) with B: q~P---> f in (6.49) representing a transmutation B: P = Qm --> Q provided A o is determined from the equation C " + ( ( 2 m + 1 ) / t ) C ' - q C = 0 where C = A~/2= 1/A and q is known by first solving (uniquely) the GL equation (6.53) in the form 0 = ~ ( t , s ) + K ( t , s ) + S d g ( t , r ) ( l ( r , s ) d z ( s < t ) for g and then using (6.55) to determine q = 2I~'(t, t). The resulting f()t, t) constructed via (6.49) are then ortho- gonal relative to dto.

COMMENT 6.33. The equation for C in Theorem 6.31 is of a standard form and will have solutions for quite general (reasonable) q (cf. [57]). We have omitted any details concerning hypotheses on 6- involving the differentiability of

which would guarantee the existence of an underlying differential problem. The role of Goursat problems and techniques from linear estimation theory is apparent. We leave open also various questions about other choices of q above.

7. Systems of Equations

We will sketch some developments for systems following [6, 7, 87, 88, 154, 163, 164]. The paper [88], which we follow in part, is especially illuminating and it also treats various other topics in the system context such as scattering theory via the M equation, band extensions, entropy, Lax-Phillips scattering, characteristic operator functions, etc. We go first for background to [6, 163, 164], for example, for canonical equations (cf. also [78, 108, 154] - let us mention explicitly the enormous contributions of M. Krein to this area as well as many other areas touched upon in this article). Thus, let H be a separable Hilbert space and J an operator in H such that (*) J * = - J and j 2 = _ i . Set P±=[I :~iJ ] /2 with P ÷ + P _ = I and J = [ i P + - i P _ ] ; the P~: are projections and we write H~: = P~H. Consider (**) JDrx - Vx = f where x(r) ~ H, f(r) c H, and V(r) c B ( H ) = bounded linear operators in H( V 6 L=(0, oo; B(H)) and eventually also V ~ L 1 is used). Assume also V(r) to be self-adjoint and consider the operator (0) Ao = JDr - V in L2(0, oo; H) defined on D(Ao) = {absolutely continuous vector functions x with compact support such that Aox ~ L2(0, 0% H) and x(0)= 0}. One knows, e.g., there exists a J unitary operator U(r) ~ B ( H ) satisfying J D r U -

Page 66: Patterns and structure in systems governed by linear second-order differential equations

174 ROBERT CARROLL

V U = 0; U(0) = I (J unitary means U*JU = UJU* = J) and g e L2(0, 0% H) with compact support is in R(Ao) if and only if S~ U*(r)g(r) dr = 0. One can also assume that JV = - V J without loss of generality. It is easy to see that Ao in ($) is symmetric in ~ = L2(0, oo;/-t) and D(A*) = {x ~ ~ which are locally absolutely continuous with Aox ~ ~}. By standard procedures one finds symmetric exten- sions Ap of Ao as restrictions of A* to domains D(Ap) = {x e D(A*); P~x(O) = x(0) or x(0) e P¢H -- S~} where S) c H is a (-/,/)-neutral subspace characterized by [x, y] (= i[(Aox, y ) - ( x , * Ao y)]) = ( ( - iJ)x(O), y(0)) -- 0 for x(0), y(0) c ,~. In order to have a self-adjoint extension of Ao it is necessary and sufficient that dim H ÷ = dim H_ and then P ¢ = ½ [ I + K + K * ] = P where K: H+---~H_ is an isometry onto (P* = P). Note also JP + PJ = J (i.e., JP = QJ = ( I - P)J) in the self-adjoint case with K*K = P÷ and KK* = P_. In general, ,~ = PH is charac- terized by PJP = 0. Further, one notes that D(A*p) involves y(0) c H - J P H and self-adjointness requires P H = H-JPH ((J/~,/~) = 0 for /~ = Ph). Consider now (11) [ A o - A]U(x, 3,) = 0; U(0, A) = I with U(x, A) e B(H) and A real momen- tarily; thus U ' + A J U + J V U = O . Evidently U*JU= U J U * = J (as for U = U(x, 0) above). Now write ~(x, A) = U(x, A)P (so q~ satisfies (11) with ~(0, A) = P) and set

Io Io f(A) = q~([, A) = P U*(x, A)f(x) dx = **(x, A)f(x) dx (7.1)

for H valued f e K 2= {L 2 with compact support}. This function q~(f, A) is a directing functional in the sense of Krein satisfying in particular the condition that ( A o - ;t)g = f if and only if q)([, A) = 0. The spectral theory can be built up from these considerations but we proceed differently following [88].

Now set Uo(x, A)= e -~Jx and l)(x, )t)= UolU = e~JXU(x, )t) (this is called a normalized matrizant in the finite-dimensional situation), One obtains by iterative procedures ('k)l)(t, A) = I + S~ e2X~Jw(t, s)ds where

w(t, s) + JV(s) = V(u) Jw(u, u - s) ds (7.2)

and with hypotheses as indicated one can write IIU(t, A)II <~ v(t)e I~mAl' where v(t) = e s,;llv~s)llas. Now note that e ~ = P+ e ~'~ + P_ e - ~ and set

w+(t, ( t - u)/2) = P+w(t, ( t - u)/2)P+ + P_w(t, ( t - u)/2)P_; (7.3)

w_(t, (t+ u)/2) = e+w(t, (t+ u)/2)P_+ e_w(t, (t+ u)/2)e+

T H E O R E M 7.1. Under the hypotheses indicated one can write U( t ,A)= Uo(t, A)+ St K(t, s)Uo(s, ~)ds where K(t, s ) = ½[w+(t, ( t - s ) / 2 ) + w_(t, (t+ s)/2)].

This is, of course, a transmutation type formula and it can also be expressed somewhat differently as in [163, 88]. Let us indicate a model situation.

Page 67: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 175

EXAMPLE 7.2. For illustrative purposes one can take (1 could also

" + = ½ ( i - ~ ) and " - = ½ ( - i ~)

be I.)

SO

I = P + + P _ ,

and

J = iP+- iP_

e -Ix~ = Uo = P+ e -ixx + P e i"x = //cos Ax -s in Ax \ | - \s in Ax cos A x /

Also e . g . ,

with r * = r , s * = s ,

and thus J V = - VJ. Further, one checks easily that PJP = 0 knd JP = QJ with P* = P and PH_I. JPH. In addition (6) (P - Q) Uo(-X, A) = Uo(x, A)(P - Q). We will assume (6) holds now in the remaining discussion. It clearly extends to 2n dimensions and thence to any separable H essentially as a choice of basis vectors. Note also that H + = X [ H - J H J ] = P ÷ H P + + P _ H P _ with H _ = ½ [ H + J H J ] = P÷HP- + P_HP÷ gives a decomposition into J commuting and J anticommuting parts (e.g., JH+ = ½[JH + HJ] = ½[ H - JHJ]J = H+J).

Now assume the property (6) and write (¢,¢,)

I£(t, s) = K(t , s) + K(t , - s ) ( P - Q)

= ½[w(t, ( t+ s)/2) + w(t, ( t - s)/2)JP

+ ½J[ w( t, ( t + s ) /2 ) - w( t, ( t - s)/2)]JQ.

Then an elementary calculation yields

Io* U(t, It) = Uo(t, A) + I£(t, s) Uo(s, ~) ds. (7.4)

T H E O R E M 7.3. Under the hypotheses indicated plus (6) and smoothness on V as needed one has (7.4) with (011,) and this represents a transmutation JDs---~ J D , - V(t) with V(t) = Jff2(t, t) - / ~ ( t , t)J. Thus, I~ appears as the solution of a 'Goursat' problem JD, ff2- V(t)I~ = - D s K J with K(t , O) = O.

The spectral theory can now be presented in various ways. In [6] for example (cf. also [88, 163, 164]) one takes qb= UP with l-l= U o l U and sets G(A)-- lim ll(x, A) as x ~ ~ so by (~')

Page 68: Patterns and structure in systems governed by linear second-order differential equations

176 R O B E R T C A R R O L L

G(A) = I + I o e 2~j w(o~, s) ds = fI~(A) = A(A) (7.5)

where w(o% s) can be assumed to make sense (assume here V ~ LI (H) also). One can define on P H (A1) A(A) = [PG*(A) G(A)P] -1 and note also that [ ' ~ * J [ ' ~ : I.

Let a L2(,~), ,~ = PH, be determined by the norm

llfll,, = d ,q oo

(in fact L2(~) = a L2(~)) since IIAII is bounded above and below independently of k). One has then (see (7.1) for f(A) = alp(f, A))

T H E O R E M 7.4. With hypotheses as indicated f ( x ) = (1/70 [ ~ ~(x , A)A(A)f(A)dA

for f~ L2(,~) and S~ [Ifll = dx = (1/-tr) J'_~ (A(A)f, f ) dh.

R E M A R K 7.5. We will indicate here some of the ideas which can go into a

proof of this theorem; all details are not spelled out but the essential is present. It

is profitable here to use the technique of [7, 88] which refines the approach of [6,

163, 164] although dealing only with finite-dimensional situations. This is achieved in particular by splitting off the space PH in a 2n x 2n situation to deal

with 2 blocks of n x n matrices. Thus, in Example 7.2 think of P with I, - 1 and U = (A oC) SO that UP ~ (A) = X . Then one can work with X in H or U in PH

equivalently. First, however, let us record a few formulas. We recall J D ~ U - V U = AU (and 1~' = ee~JVJl~). Set now F#(A) = F(A*)* and one obtains

Io' j - cr ju, , = - c ry , ds . (7.6)

In particular, for ~ * = h one has ('k) J - U # ( t , h ) J U ( t , h ) = O and U - 1 =

- J U # J . Setting A = to* and ~* = to one has also

i' [ J - U,oJUo,]/(to* * - to) = U*(s, to) U(s, to) ds >i O.

Consider now

A~(A) = [J - U~JU~,,]I2~r(A - / x * ) . (7.7)

One can calculate with such objects as reproducing kernels and relate the matter (following [7, 88] directly to the idea of deBranges spaces, etc. (cf. [84, 88]). We will do this differently however (as in [88]) where we use n x n blocks A , B , F = A + i B , E = A - iB, and X = (A). Define for suitable f ~ K 2 (K 2 --

L2(H) with compact s u p p o r t - R z" ~ H here and f ~ (fl , f2) as a column vector)

f ' (A) = X#(s , A)f(s) ds; f(A) = X~o(S, A)f(s) ds (7.8) )

where Xo = UoP = (cos hxI, , sin hxln) as a column vector (Uo = e -xj~ with J =

Page 69: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAl EQUATIONS

( 9 ~) - cf. Example 7.2). Note also V ~ (s R) with R* = R, S* (7.4) with X = UP, Xo = G~P one has, e.g.,

I' X = X. + I<(t, s)Xo(s, A) ds.

)

The inversion formula we will obtain below, following [88] is then

f(x) = (l/Tr) X(s, A)A~(A)f*(A) dA

177

= S and from

(7.9)

(7.1(})

with

A,(A) = [E#(t, A)E(/, A)] -~ (=[F~(t , A)F(t, A)] -1)

and A==l imA, as t-+0o. Let us note here in the model situation described in

Example 7.2.

(A 00) P U * = ( A* O * ) a n d P U * U P = E * E = A * A + B * B UP= B ,

(since B*A = A*B from J = U*JU). Thus, A ~ A in (AE) (note G ~ and ~*f l = U* U). We remark also that notation (X, X) or X*X is used interchang- ably at times. The Parseval formula at level t in the form

Io'(f(s), g(s))dS= Io ' f*(s)g(s)ds=l I~_ (f"(A),AAA)g"(A))dA i7.11)

extends then to the corresponding formula with t = ~. One constructs U etc., as before and the entries in U(t, A) are entire functions of A of exponential type t with the n × n blocks A, B, C, D invertible, One refers to W,, (Wiener algebra) as the set of m × m matrix functions F ( A ) = c p +/~v(A) where cv is constant and kv6L~×,,(R) (/~F=J'2~kve ixxdx=o~kv). Thus, c v = F ( ~ ) and kF= o~-L[F- cF]. If Cv = I, one refers to W ~ and W+ (resp. W_) refers to F such that o~-lF(x) = 0 for x < 0 (resp. x > 0). One also writes W, r = W I f-I W~. This, one

is dealing with functions F ~ W+ (resp. W_) analytic for lm )t > 0 (resp. Im A < 0). One shows easily that I~(A, t )= Uo I U ~ W I for example. One says now (C+ denotes Im A > 0 , ( 7 _ - I m A < 0 ) that a pair of n × n matrix valued entire functions (E+,E_) is a deBranges pair if ( 0 0 0 ) E+E~+ = E - E ~- on C; det E+ :p 0 on C+ ; det E_ -~ 0 on (7._ ; and E = E¥ ~ E_ is inner on C+. Here £ is ] inner if it is meromorphic with £ J £ * ~< ] at points of analyticity while YJE* = J on R - for J = I one speaks of inner. Let us denote by S32 (resp..q,2) the Hardy spaces over C+ (resp. C_) of n-vector functions (f~(A)) = f(A) (i.e., the entries, say for ~2, f~(A) are analytic in C+ and sup.>o$lf~(~:+ i'0)lZd~ : < ~ - equivalently, //CA) =J'~ F(x)e ix~ dx with F c L2). Now with a deBranges pair (E+, E_) as indicated one associates a deBranges space B(E+, E_) of n × l vector valued entire functions f such that E-~lf6 ,(22-E,~2. One has then (cf. [88])

Page 70: Patterns and structure in systems governed by linear second-order differential equations

178 ROBERT CARROLL

T H E O R E M 7.6. Let (E+, E_) be a deBranges pair. Then B = B(E+, E_) is a reproducing kernel space relative to the inner product (f , g)=~2+ ( E ¥1f , E ¥1g ) d A with reproducing kernel A,o(A) = [E+(A)E*(w)- E_(Z)E*_(o))]/[-2wi(A - w*)]

(i.e., for h ~ ,~) ~ C" ~ PH, A,oh c B and for f ~ B, (f, A,oh)B = (f(w), h)).

In the present situation one will have a deBranges pair (F #, E #) = (A # - iB #, A # + iB# ) - (E+, E_). To see how this works one can show first that (2~= E+IE 7, E+IA,,(A)h 6,~') 2 and is perpendicular to ]LC02 for ~oe C+ (and R). Next, E~Jf¢,q)2-~,,~32 if and only if fcE+,~)eAE_,~t 2 and arguing as above for

E_tA.,(A)h with o ) c C _ one obtains A,o(A)hcB for o) e C. Finally, using E+E~+ = E E*_. one obtains

(f, Ao, h)B = ( I ~ [ETt(A)f(A)]/[21ri(A-o))]dA, E*(o~)h ) -

-(I~+[E2t(A)f(A)]/[2rri(A-o))]dA, E*_(~o)h) (7.12)

= (f(o)), h).

Now one can use (F #, E #) as (E+, E_) to define a deBranges space B~ so that (recall F ~ * = F , . and cf. (7.655

A~(A) = [F#(t, A)F#*( t , / x ) - E#(t, A)Ee*(t , /x)]/(-2wi(A - /x*) )

= [X#(t, A)JX#*(t,/,t)]/[- 7r(A - ~t*)] (7.13)

I' = (l/rr) X#(s,A)X(s,I ,~*)ds

I

(recall PJP = 05. Define now f*' as in (7.8) and one obtains

THEO' - 'EM 7.7. The map f----~ f" determined by (7.87 maps L2(O, T)--* BT , 1 -- 1 onto wtm HfAII~ = r~lf][[2 and the inverse map is given by (7.105 with Parseval formula (7.1 1). One has also A=(A) = I -/~(A) ( > 0 for A E R) with h ~ L I.

To show that (7.10) is the correct inverse one writes heuristically, using (7.13)

= (Io' X#(s, ~)[ (1/ ~S IT=

and Theorem 7.6

(].A(p,), h) = I (F# - ' f A, F#-'A~,(A)h) dA

f ([F-' F*-l]f A, A~(ASh)dA

ff t# • (A• A,f , h) dA

; ([( l /w) fo X#(s ,A)X(s , A,f~', h) dA

X(s, Z)A,fA dA] ds, h)

(7.14)

Page 71: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 179

This shows that (7.10) is formally the correct formula for fAc B, and the extension for t ~ is immediate. The GL equation for the present context goes as follows (following [88]) for the /~ of (7.4) (cf. also Remark 5.16). Thus, A~(A) = 1 -/~()t) from Theorem 7.7 and /~ =j'_~ h(s)e ~ ds = ~h. Set Hg = h* g (and ( 6 t l ) Nf(s) is defined by (f = (ft, f2)) x/2Nffs) = f t f s ) - if2(s) for s > 0 with x/2Nf(s) = f l ( - s ) + if:(-s) for s < 0. Then (cf. (7.8)) f(M = Y(Nf)/ , /2. We write ~( t , s ) = ker N * H N = ker ,~. Then, recalling (7.4) in the transmutational form U = ( I + / ~ ) U o so that X = ( I + / ~ ) X o as in (7.9) one has

f*(A) = (X, f ) = I x # f = ((I +/~)Xo, f )

= (Xo, ( I + / ~ * ) f ) ~- [ ( I + K*)f]" = [N(I+/~*)f]^/- , /2.

We write the Parseval formula determined by Theorem 7.7 in the form

I S I ( f ,g) ds=(1/~r) (f*, a~g*) da = (1/2~') ( [N(I + ~?*)f] ̂ ,

-/~)[N(I + K*)g] ~) d~t = f [N(I + l£*)f, (! - H)[N(I + K*)]g) ds (7. l (! 5)

= I (f' (I + K)N*(I - H)[N(! + K*)]g) ds.

It follows that ( I+ I ~ ) [ N * ( I - H ) N ] ( I + I£*) - - I which is the GL equation in factorized form. Writing N*(I - H ) N = I - N * H N = I - 5~ one has

T H E O R E M 7.8. The GL equation for I~ of (7.4) ( I + / ~ = ( I+ /~) -~) is given by (I + I~i)~(l + I~*) = I or (I + I~)(I + £*) = N which exhibits I + g (resp. I + I~*) as lower (resp. upper) triangular factors of the positive operator I - ~ (relative to a chain of projections Pr : f ~ f (0<~ s<~ T) and f ~ O (s >~ T).

One can connect this framework to readout impulse responses and the spectral representation of kernels as in the geophysical situation but we omit the details (cf. [32, 63]). There are also applications 1o Dirac equations etc. but we will not pursue this (the unified GL, M, etc. equations of [156] are spectralized in [63]).

Re|erences

1. Alekseev, A.: hr . Akad. Naak SSSR, Set. Geofiz. 11 (1962), 1514-1531. 2. Alekseev, A.: Some Methods and Algorithms [or the Interpretation of Geophysical Data, Izd.

Nauka, Moscow, 1967, pp. 9-84. 3. Askey, R.: Orthogonal Polynomials and Special Functions, SIAM, Philadelphia, 1975. 4. Askey, R. and Fitch, J.: J. Math. Anal. Appl. 26 (1969), 411-437. 5. Atkinson, F.: Discrete and Continuous Boundary Problems, Academic Press, N.Y., 1964. 6. Adamyan, V.: DANSSSR, 178 (1968), 9-12. 7. Alpay, D. and Dym, H.: Integ. Eqs. Oper. Theory 7 (1984), 589-641. 8. Bamberger, A., Chevant, G., and Lailly, P.: Appl. Math. Optim. 5 (1979), 1-47. 9. Bergman, S.: Integral Operators in the Theory of Linear Partial Differential Equations, Springer,

Berlin, 1961.

Page 72: Patterns and structure in systems governed by linear second-order differential equations

180 ROBERT CARROLL

10. Bers, L.: Mathematical Aspects of Subsonic and Transonic Gas Dynamics, Wiley, N.Y., 1958. 11. Bessis, D.: Nuovo Cim. 33 (1964), 797-808. 12. Blagove~enskij, A.: Topics in Math. Physics (Ed. M. Birman), vol. 3, 1969, pp. 55-67. 13. Blagove~enskij, A.: Trudy Mat. Inst. Steklov 115 (1971), 8-38. 14. Blagove~enskij, A.: Trudy Mat. Inst. Steklov 115 (1971), 39-69. 15. Bottino, A., Longoni, A., and Regge, T.: Nuovo Cim. 23 (1962), 954-1004. 16. Braaksma, B.: Int. Conf. Diff. Eqs., Academic Press, N.Y., 1975, pp. 40-52. 17. Braaskma, B. and DeSnoo, H.: Springer Lect. Notes 415 1974, pp. 62-77. 18. Bragg, L.: J. Math. Mech. 18 (1969), 607-616. 19. Bragg, L.: SIAMJ. Math. Anal. 7 (1976), 1-12. 20. Bragg, L. and Dettman, J.: SIAM J. Appl. Math. 16 (1968), 459--467. 21. Bragg, L. and Dettman, J.: Proc. Amer. Math. Soc. 21 (1969), 50-56. 22. Bremerman, H.: Distributions, Complex Variables, and Fourier Transforms, Addison Wesley,

N.Y., 1965. 23. Bube K. and Burridge, R.: SIAM Review 25 (1983), 497-559. 24. Burdet, G., Giffon, M., and Predazzi, E.: Nuovo Cim. 36 (1965), 1337-1347. 25. Burdet, G., Giffon, M., and Goldberg, J.: Nuovo Cim. 44A (1966), 138-146. 26. Burridge, R.: Wave Motion 2 (1980), 305-323. 27. Carroll, R.: CR Royal Soc. Canada 7 (1985), 39--43. 28. Carroll, R.: Transmutation and Operator Differential Equations, North-Holland, Amsterdam,

1979. 29. Carroll, R.: Transmutation, Scattering Theory, and Special Functions, North-Holland, Am-

sterdam, 1982. 30. Carroll, R.: Spectral Theory Differential Equations, North-Holland, Amsterdam, 1981, pp.

81-92. 31. Carroll, R.: Differential Equations, Math. Studies #92, North-Holland, Amsterdam, 1984, pp.

87-104. 32. Carroll, R.: Transmutation Theory and Applications, North-Holland, Amsterdam, 1985, Math.

Studies #117. 33. Carroll, R.: Anais Acad. Brasileira Ciencias 54 (1982), 271-280. 34. Carroll R.: Rend. Acad. Lincei 72 (1982), 65-70. 35. Carroll R.: Osaka J. Math. 19 (1982), 815-831 and 833-861. 36. Carroll R. and Santosa, F.: Math. Meth. Appl. Sci. 3 (1981), 145-171. 37. Carroll R. and Santosa, F.: Math. Meth. Appl. Sci. 4 (1982), 33-73. 38. Carroll R. and Santosa, F.: Applicable Anal. 13 (1982), 271-277. 39. Carroll R. and Santosa, F.: Conf. Inverse Scattering, SLAM, Phila., 1983, pp. 230-244. 40. Carroll R. and Santosa, F.: CR Royal Soc. Canada $ (1983), 223-228. 41. Carroll R. and Santosa, F.: J. Acoustic. Soc. Amer. 76 (1984), 935-941. 42. Carroll R. and Santosa, F.: CR Acad. Sci. Paris 292 (1981), 23-26. 43. Carroll R.: Rev. Roumaine Math. Pures Appl. 29 (1984), 410--426. 44. Carroll R.: Rocky Mount. J. Math. 12 (1982), 393-427. 45. Carroll R.: CR Royal Soc. Canada 5 (1983), 87-90. 46. Carroll, R.: Applicable Anal. 12 (1981), 153-157. 47. Carroll R.: Applicable Anal. 16 (1983), 85-90. 48. Carroll R.: Bull. Un. Mat. Ital., to appear. 49. Carroll R. and Gilbert, J.: Math. Ann. 258 (1981), 39-54. 50. Carroll R.: Math. Meth. Appl. Sci. 6 (1984), 467-495. 51. Carroll R.: Applicable Anal. 17 (1984), 217-226. 52. Carroll R.: Proc. Japan Acad. 60 (1984), 82-85. 53. Carroll R. and Berkopec, T.: Funk. Ekvac., to appear. 54. Carroll R.: Applicable Anal. 8 (1979), 253-263. 55. Carroll R.: Applicable Anal. 17 (1983), 51-62. 56. Carroll R.: J. Math. Anal. Appl. 92 (1983), 410-426. 57. Carroll, R. and Showalter, R.: Singular and Degenerate Cauchy Problems, Academic Press,

N.Y., 1976.

Page 73: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 181

58. Carroll, R.: Proc. Royal Sac. Edinburgh 91A (1982), 315-334. 59. Carroll, R.: Comm. Partial Diff. Eqs. 6 (1981), 1407-1427. 60. Carroll, R.: Applicable Anal. 18 (1984), 39-54. 61. Carroll, R.: J. Math. Pures Appl. 63 (1984), 1-14. 62. Carroll, R.: Proc. Japan Acad. 59 (1983), 51-54. 63: Carroll, R.: Some spectral formulas for systems and transmission lines, to appear. 64. Carroll, R.: CR Royal Sac. Canada 6 (1984), 85-88. 65. Carroll, R. and Dolzycki, S.: J. Math. Physics 25 (1984), 91-93. 66. Carroll, R. and Dolzycki, S.: Applicable Anal., 19 (1985), 189-200 67. Case, K.: Advances Math. Supp. 5 (1978), 25-43. 68. Case, K. and Kac, M.: J. Math. Phys. 14 (1973), 594-603. 69, Chadan, K. and Sabatier, P.: Inverse Problems in Quantum Scattering Theory, Springer, N.Y.,

1977. 70. Chao, M.: Thesis, Washington Univ., 1976. 71. Chebli, H.: J. Math. Pures Appl. 58 (1979), 1-19. 72. Chihara, T.: An Introduction to Orthogonal Polynomials, Gordon and Breach, N.Y., 1978. 73. Chandrasekhar, S.: The Mathematical Theory of Black Holes, Oxford, 1983. 74. Colton, D.: Analytic Theory of Partial Differential Equations, Pitman, London, 1980. 75. Colton, D. and Kress, R.: Quart. J. Mech. Appl. Math. 31 (1978), 9-17 and 32 (1979), 53-62. 76. Colton, D. and Wendland, W.: Proc. Royal Soc. Edinburgh 75A (1975), 97-107. 77. Coudray, C. and Coz, M.: Ann. Phys. 6 (1970), 488-529. 78. Daletskij, Yu. and Krein, M.: Stability o[ Solutions o[ Differential Equations, AMS Translations

Vol. 43, 1974. 79. deAlfaro, V. and Regge, T.: Potential Scattering, North-Holland, Amsterdam, 1965. 80. Deift, P. and Trubowitz, E.: Commun. Pure Appl. Math. 32 (1979), 121-250. 81. Delsarte, J.: CR Acad. Sci. Paris 2116 (1938), 1780-1782. 82. Dettman, J.: Proc. Royal Sac. Edinburgh 79A (1977), 173-182. 83. deSnoo, H.: Proc. Kon. Ned. Akad. Wet. 73 (1970), 222-244. 84. deBranges, L.: Hilbert Spaces of Entire Functions, Prentice-Hall, Englewood Cliffs, N.J., 1965. 85. Diaz, J. and Weinstein, A.: Studies Math. Mech., Academic Press, N.Y., 1954, pp. 97-102. 86. Doob, J.: Stochastic Processes, Wiley, N.Y., 1953, 87. Dym, H, and Iacob, A.: Toeplitz Centen., Birkhauser, Basel, 1982, pp. 233-260. 88. Dym, H. and Iacob, A.: Topics Oper. Theory, Birkhauser, Basel, 1984, pp. 141-240. 89. Dym, H. and McKean, H.: Gaussian Processes, Function Theory, and the Inverse Spectral

Problem, Academic Press, N.Y,, 1976. 90. Dyson, F.: Studies Math. Physics, Princeton Univ. Press, 1976, pp. 151-167. 91. Dyson, F.: J. Optic. Soc. Amer. 65 (1975), 551-558. 92. Erd61yi, A.: Springer Lect. Notes 457, 1975, pp. 151-170. 93. Fadeev, L.: Uspekhi Mat. Nauk 14 (1959), 57-119; Soy. Prob. Math. 31 (1974), 93-180

(translation). 94. Foias, C.: Proc. Inter. Cong. Math. Helsinki 2 (1978), 605-613. 95. Flensted-Jensen, M.: Ark. Mat. 10 (1972), 143-162. 96. Freud, G.: Orthogonal Polynomials, Permagon Press, N.Y., 1971. 97. Froissart, M.: J. Math. Physics 3 (1963), 922-927. 98. Gasymov, M.: Trudy Let. Sk. Spekt. Teor. Oper . . . . . lzd. Elm, Baku, 1975, pp. 20-45. 99. Gelfand, I. and Levitan, B.: Izv. Akad. Nauk SSR 15 (1951), 309-360.

100. Geronimo, J. Trans. Amer, Math. Sac. 260 (1980), 65-82. 101. Geronimo, J. and Case, K.: J. Math. Phys. 201 (1979), 299-301. 102. Geronimo, J. and Case, K.: Trans. Amer. Math. Sac. 258 (1980), 467-494. 103. Gerver, M.: Geophys. J. Royal Astr. Sac. 21 (1970), 337-357. 104. Gilbert, R.: Function Theoretic Methods in Partial Differential Equations, Academic Press, N.Y.,

1969. 105. Gilbert, R.: Constructive Methods [or Elliptic Equations, Springer Lect. Notes 365, 1974. 106. Gilbert, R.: SIAMJ. Math. Anal. 1 (1970), 96-114. 107. Gopinath, B. and Sondhi, M.: Prac. IEEE 59 (1971), 383-392; Bell Syst. Tech. J. 49 (1970),

1195-1214.

Page 74: Patterns and structure in systems governed by linear second-order differential equations

182 ROBERT CARROLL

108. Gokhberg, I. and Krein, M.: Theory and Application of Voltetra Operators in Hilben Space, AMS Translation 14, 1970.

109. Helgason, S.: Groups and Geometrical Analysis, Academic Press, N.Y., 1984. 110. Helton, J.: Bull. Amer. Math. Soc. 7 (1982), 1-64. 111. Hersh, R.: Rocky Mount. J. Math. 4 (1974), 443--477. 112. Heywood, P.: J. London Math. Soc. 42 (1967), 641-645. 113. Howard, M.: Geophys. J. Royal Astr. Soc. 65 (1981), 191-215. 114. Hutson, V.: J. Math. Mech. 14 (1965), 807-819. 115. Hutson, V. and Pym, J.: Proc. London Math. Soc. 24 (1972), 548-576. 116. Jones, D.: J. Inst. Math. Appl. 26 (1980), 133-141. 117. Kailath, T.: IEEE Trans. AC-13 (1968), 646-655. 118. Kailath, T.: IEEE Trans. IT-20 (1973), 146-181. 119. Kailath, T.: SIAMJ. Control 19 (1972), 477--486. 120. Kailath T., Vieira, A., and Morf, M.: SIAM Review 20 (1978), 106-119. 121. Kailath T., Levy, B., Ljung, L., and Morf, M.: SIAMJ. Appl. Math. 37 (1979), 467-484. 122. Kailath T.: IEEE Trans. IT-15 (1969), 665-672. 123. Kailath T.: IEEE Trans. IT-17 (1971), 530-549. 124. Kailath T.: SIAMJ. Control 7 (1969), 68-74. 125. Kailath T., Geesey, R., and Weinert, H.: IEEE Trans. IT-18 (1972), 341-348. 126. Kailath T.: Proc. IEEE 58 (1970), 680-695. 127. Kailath T.: Lectures on Wiener and Kalman Filtering, Springer, N.Y., 1981. 128. Kailath T.: Bell Syst. Tech. J. 50 (1971), 1487-1494. 129. Kailath T., Ljung, L., and Morf, M.: Advances Math. Supp. 5 (1978), 169-184. 130. Kailath T. and Ljung, L.: IEEE Trans. AC-21 (1976), 385-388. 131. Kalian mr, G.: Stochastic Filtering Theory, Springer, N.Y., 1980. 132. Kalman, R. and Bucy, R.: Trans. Asme, Ser. D, Basic Engin. 83 (1961), 95-107. 133. Kaplan, S.: Bull. Amer. Math. Soc. 70 (1964), 264-268. 134. Katrakhov, V.: Sibrsk. ,~ur. Mat. 21 (1980), 86-97; D A N S S S R 25 (1980), 567-570. 135. Kay, I. and Moses, H.: Inverse Scattering Papers, 1955-1963, MathSci. Press, 1982. 136. KazarinotI, N.: Trans. Amer. Math. Soc. 18 (1955), 305-328. 137. Kipriyanov, I. and Katrakhov, V.: Mat. Sbornik 1114 (1977), 49-68. 138. Kober, H.: J. London Math. Soc. 42 (1967), 42-50. 139. Kontorovi~, M. and Lebedev, N.: ~ur. Eksp. Teor. Fiz. 10 (1938), 1192-1206. 140. Koornwinder, T.: Ark. Mat. 13 (1975), 145-159. 141. Koornwinder, T.: Special Functions: Group Theoretical Aspects . . . . Reidel, Dordrecht, 1984,

pp. 1-85. 142. Koornwinder, T.: 'Special Orthogonal Polynomial Systems... Fourier-Jacobi Transform', Math.

Centrum, Amsterdam, preprint, 1985. 143. Koornwinder, T. and Flensted-Jensen, M.: Ark. Mat. 11 (1973), 245-262. 144. Krein, M.: Uspekhi Mat. Nauk 13 (1958), 3-120. 145. Krein, M.: D A N S S S R 97 (1954), 21-24 and 13-16. 146. Krein, M.: D A N SSSR 76 (1951), 21-24; 93 (1953), 617-620; 104 (1955), 637-640. 147. Lang, S.: SL(2, R), Addison-Wesley, 1975. 148. Lax, P. and Phillips, R.: Bull. Amer. Math. Soc. 2 (1980), 261-295. 149. Levitan, B.: Uspekhi Mat. Nauk 6 (1951), 102-143. 150. Levitan, B.: Uspekhi Mat. Nauk 4 (1949), 3-112. 151. Levitan, B.: The Theory o[ Generalized Translation Operators, Moscow, 1973. 152. Levitan, B.: Sel. Math. Soy. 2 (1982), 379-418. 153. Levitan, B.: Inverse Sturm-Liouville Problems, Moscow, 1984. 154. Levitan, B. and Sargsyan, I.: Introduction to Spectral Theory . . . . Moscow, 1970. 155. Levy, B. and Yagle, A.: "Applications of the Shur Algorithm to the Inverse Problem for a

Layered Acoustic Medium' and 'A Layer Stripping Solution of the Inverse Problem for a One Dimensional Elastic Medium', MIT preprints, June and Sept. 1983.

156. Levy, E., Bruckstein, A., and Kailath, T.: SIAMJ. Appl. Math. 45 (1985), 312-335. 157. Levy, B. and ¥agle, A.: MIT preprint, Feb. 1984.

Page 75: Patterns and structure in systems governed by linear second-order differential equations

SYSTEMS GOVERNED BY LINEAR 2ND-ORDER DIFFERENTIAL EQUATIONS 183

158. Levy, B. and Tsitsiklis, J.: 'Linear Estimation of Stationary Stochastic Processes, Vibrating Strings, and Inverse Scattering', IEEE Trans., to appear.

159. Levy, B. and Tsitsiklis, J.: 'An Inverse Scattering Procedure for the Linear Estimation of Two Dimensional Random Isotropic Fields', to appear.

160. Lions, J.: Bull. Soc. Math. France 84 (1956), 9-95. 161. Lions, J.: Equations diff~rentielles op~.rationnelles, Springer, Berlin, 196l. 162. Loeffel, J.: Ann. Inst. H. Poincar~ 8 (1968), 339-447. 163. Melik-Adamyan, F.: Izv. Akad. Nauk Armen. SSR 12 (1977), 10-31. 164. Melik-Adamyan, P.: Izv. Akad. Nauk Armen. SSR 11 (1976), 291-313. 165. Mar~enko, V.: Starm-Liouville Operators and their Applications, Kiev, 1977. 166. Mar~enko, V.: Mat. Sbornik 52 (1960), 739-788. 167. Mar~enko, V.: Trudy Mosk. Mat. Obsc. 1 (1952), 327-420. 168. Mar~enko, V.: Trudy Mosk. Mat. Obsc. 2 (1953), 3-83. 169. McBride, A.: Fractional Calculus and Integral Transforms of Generalized Functions, Pitman

Press, London, 1979. 170. McBride, E.: Obtaining Generating Functions, Springer, N.Y., 1971. 171. Mizony, M.: Trans[ormation de Laplace-Jacobi, Sem. Univ. Claude-Bernard, Lyon, 1980. 172. Muckenhoupt, B. and Stein, E.: Trans. Amer. Math. Soc. 118 (1965), 17-92. 173. Naimark, M.: Trudy Mosk. Mat. Obsc. 3 (1954), 181-270. 174. Naimark, M.: Linear Differential Equations, Moscow, 1969. 175. Newton, R.: Con[. Inverse Scattering, SIAM, Phila., 1983, pp. 1-74. 176. Newton, R.: Scattering Theory o[ Waves and Particles, McGraw-Hill, N.Y., 1966. 177. Newton, R.: Geophys. J. Royal Astr. Soc. 65 (1981), 191-215. 178. Newton, R.: The Complex J Plane, Benjamin, N.Y., 1964. 179. Olver, F.: Asymptotics and Special Functions, Academic Press, N.Y., 1974. 180. Orton, M.: SIAMJ. Math. Anal. 4 (1973), 656-670; Proc. Royal Soc. Edinburgh, 76A (1977),

193-208. 181. Peller, V. and Khruscev, S.: Uspekhi Mat. Nauk 37 (1982), 53-124. 182. Payne, L.: Quart. Appl. Math. 19 (1952), 197-204. 183. Payne, L.: J. Math. Physics 38 (1959), 145-149. 184. Rainville, E.: Special Functions, MacMillan, N.Y., 1960. 185. Ramm, A.: Theory and Applications of Some New Classes of Integral Equations, Springer, N.Y.,

1980. 186. Raphael, L.: 'Equisummability of Eigenfunction Expansions Under Analytic Multipliers', to

appear. 187. Regge, T.: Nuovo Cim. 41 (1959), 951-976. 188. Robinson, E.: Physical Applications of Stationary Time Series, MacMillan, N.Y., 1980. 189. Robinson, E. and Silvia, M.: Deconvolution of Geophysical Time Series in the Exploration [or Oil

and Natural Gas, Elsevier, Amsterdam, 1979. 190. Robinson, E.: Multichannel Time Series Analysis with Digital Computer Programs, Holden-Day,

San Francisco, 1967; second edition, Goose Pond Press, Houston, 1983. 191. Robinson, E.: Migration of Geophysical Data, Inter. Human Resour. Devel. Corp., Boston,

1983. 192. Rooney, P.: Canad. J. Math. 6 (1972), 1198-1216. 193. Rooney, P.: Canad. J. Math. 32 (1980), 1021-1044. 194. Rooney, P.: Applicable Anal. 8 (1978), 175-184. 195. Rosencrans, S.: J~. Diff. Eqs. 13 (1973), 457-467. 196. Rozanov, Yu.: Stationary Random Processes, Holden-Day, San Francisco, 1967. 197. Rozanov, Yu.: Innovations Processes, Halsted-Wiley, N.Y., 1977. 198. Sabatier, P.: J. Math. Phys. 8 (1967), 1957-1972. 199. Sabatier, P.: J. Math. Phys. 7 (1966), 2079-2091. 200. Sabatier, P.: J. Math. Phys. 12 (1971), 1303-1326. 201. Sabatier, P.: CR Acad. Sci. Paris 278 (1974) 545-547 and 603-606. 202. Sabatier, P.: J. Geophys. 43 (1977), 115-137. 203. Sabatier, P.: Geophys. Royal Astr. Soc. 48 (1977), 415-441 and 443-469.

Page 76: Patterns and structure in systems governed by linear second-order differential equations

184 ROBERT CARROLL

204. Sabatier, P.: J. Math. Phys. 19 (1978), 2410-2425. 205. Sabatier, P.: Conf. Inverse Scauering, SIAM, Phila., 1983, pp. 75-99. 206. Santosa, F.: Geophys. J. Royal Astr. Soc. 70 (1982), 229-243. 207. Santosa, F. and Schwetlick, H.: Wave Motion 4 (1982), 99-110. 208. Santosa, F. and Symes, W.: Ptoc. IGARSS, San Francisco, 1983, to appear. 209. Santosa, F. and Symes, W.: 'Determination of Layered Acoustic Media via Multiple Impedance

Profile Inversions from Plane Wave Responses', to appear. 210. Siersma, J.: Thesis, Groningen, 1979. 211. Sneddon, I.: Springer Lect. Notes 457, 1975, pp. 37-79. 212, Sobolev, V.: A Treatise on Radiative Transfer, Van Nostrand, Princeton, 1963. 213. Stone, M. Math. Z. 28 (1928), 654-676. 214. Symes, W.: SIAMJ. Math. Anal. 12 (1981), 421-453. 215. Symes, W.: J. Math. Anal. Appl. 94 (1983), 435-453. 216. Symes, W.: Math. Meth. Appl. Sci. 5 (1983), 131-152. 217. Symes, W.: 'Computational Continuation for Solutions o1 Wave Equations', to appear. 218. Symes, W. and Coen, S.: 'Complete Inversion of Reflection Data for Layered Acoustic Media',

to appear. 219. Szego, G.: Orthogonal Polynomials, Amer. Math. Soc. Colloq. Pub. No. 23, N.Y., 1967. 220. Titchmarsh, E.: Eigenfunction Expansions Associated with Second Order Differential Equations,

Oxiord, 1962. 221. Treves, F.: Introduction to Pseudodifferential and Fourier Integral Operators, Plenum Press, N.Y.,

1980. 222. Trimeche, K.: J. Math. Pures Appl. 60 (1981), 51-98. 223. Vekua, I.: New Methods for Solving Elliptic Equations, North-Holland, Amsterdam, 1967. 224. Walker, J.: Thesis, Univ. ot Texas, 1980. 225. Weisner, L.: Pacific J. Math. 5 (1955), 1033-1039. 226. Weisner, L.: Canad. J. Math. 11 (1959), 141-147 and 148-155. 227. Weinstein, A.: Bull. Acad. Roy. Belgique 37 (1951), 348-358. 228. Weinstein, A.: Quart. Appl. Math. 5 (1948), 429-444. 229. Weinstein, A.: Trans. Amer. Math. Soc. 63 (1948), 342-354. 230. Weinstein, A.: Bull. Amet. Math. Soc. 59 (1953), 20-38. 231. Weinstein, A.: Commun. Pure Appl. Math. 7 (1954), 105-116. 232. Weinstein, A.: Proc. Fifth Syrup. Appl. Math., McGraw-Hill, N.Y., 1954, pp. 137-147. 233. Weinstein, A.: Summa Brasil. Math. 3 (1955), 125-147. 234. Weinstein, A.: Proc. Syrup. Fluid Dynam. Appl. Math., Gordon and Breach, N.Y., 1962, pp.

29-49. 235. Whiting, B.: Differential Equations, North-Holland, Amsterdam, 1984., pp. 561-570. 236. Wheeler, J.: Studies Math. Physics, Princeton Univ. Press, 1976, pp. 351-422. 237. Wiener, N.: Extrapolation, Interpolation, and Smoothing of Stationary Time Series, MI'I Press,

1949. 238. Wimp, J.: Glasnik Mat. 6 (1971), 67-70. 239. Wong, E. and Hajek, B.: Stochastic Processes in Engineering Systems, Springer; N.Y., 1984. 240. Wong, E.: SIAM J. Appl. Math. 16 (1968), 756-770. 241. Yadrenko, M.: Spectral Theory of Random Fields, Kiev, 1980. 242. Yaglorn, A.: Stationary Random Functions, Prentice-Hall, Englewood Cliffs, N.J., 1962.