Mathematical Methods Handbook

Green's functions for ordinary differential equations

Construction and properties of Green's functions for boundary-value and initial-value problems.

In this chapter 4

Tick a unit to add it to your PDF basket.

  1. Green's functions in one dimension

Green's functions in one dimension

4

Theorem

Green's function for a boundary-value problem

Adapted

Defines the Green's function of a second-order two-point boundary-value problem by the homogeneous equation off the source point, continuity, the jump 1/a2(ξ)1/a_2(\xi) in the first derivative and the homogeneous boundary conditions; derives the jump from LG=δLG = \delta, constructs GG explicitly from two homogeneous solutions and their Wronskian, proves that u(x)=∫abG(x,ξ)f(ξ) dξu(x) = \int_a^b G(x,\xi)f(\xi)\,d\xi is the unique solution, and proves the reciprocity relation G∗(x,ξ)=G(ξ,x)G^*(x,\xi) = G(\xi,x) and hence the symmetry of GG for a self-adjoint problem.

Prerequisites: Adjoint and self-adjoint differential operators, The Dirac delta in calculations, Structure of linear equations and the Wronskian, Existence and uniqueness of solutions

Definition(The boundary-value problem, and its Green's function)AdaptedAdapted from Stakgold & Holst (2011), §3.2, (3.2.1)–(3.2.2) pp. 191–192 and (3.2.7)–(3.2.8) p. 194; Riley, Hobson & Bence (2006), §15.2.5, (15.59)–(15.62) and the summary (i)–(iii), pp. 511–513; Arfken, Weber & Harris (2013), §10.1, Eqs. (10.5)–(10.6), p. 448

Throughout, a≤x≤ba \le x \le b is a bounded closed interval and

Lu  =  a2(x) u′′+a1(x) u′+a0(x) u,Lu \;=\; a_2(x)\,u'' + a_1(x)\,u' + a_0(x)\,u ,

where a0,a1,a2a_0, a_1, a_2 are continuous on a≤x≤ba \le x \le b and a2(x)≠0a_2(x) \ne 0 there. (Stakgold and Holst's (3.2.1) asks a little less: continuity of the coefficients on the open interval a<x<ba < x < b, with a2≠0a_2 \ne 0 on the closed one. We follow Hassani in asking for continuity up to the endpoints, because the proof of the jump condition below uses boundedness of a1/a2a_1/a_2 and a0/a2a_0/a_2 on a closed neighbourhood of the source; nothing else in the unit needs the extra strength.) The data are a forcing function ff, piecewise continuous on a≤x≤ba \le x \le b, and two numbers γ1,γ2\gamma_1,\gamma_2 prescribed through two boundary functionals

B1u=α11u(a)+α12u′(a)+β11u(b)+β12u′(b),B2u=α21u(a)+α22u′(a)+β21u(b)+β22u′(b),\begin{aligned} B_1u &= \alpha_{11}u(a) + \alpha_{12}u'(a) + \beta_{11}u(b) + \beta_{12}u'(b) ,\\ B_2u &= \alpha_{21}u(a) + \alpha_{22}u'(a) + \beta_{21}u(b) + \beta_{22}u'(b) , \end{aligned}

whose coefficient rows (α11,α12,β11,β12)(\alpha_{11},\alpha_{12},\beta_{11},\beta_{12}) and (α21,α22,β21,β22)(\alpha_{21},\alpha_{22},\beta_{21},\beta_{22}) are independent, so that the two conditions are genuinely different. The boundary-value problem (BVP) is

Lu=f  (a<x<b),B1u=γ1,B2u=γ2.Lu = f \ \ (a < x < b), \qquad B_1u = \gamma_1, \quad B_2u = \gamma_2 .

The conditions are unmixed when each involves only one endpoint, that is β11=β12=α21=α22=0\beta_{11} = \beta_{12} = \alpha_{21} = \alpha_{22} = 0; then B1u=α11u(a)+α12u′(a)B_1u = \alpha_{11}u(a) + \alpha_{12}u'(a) and B2u=β21u(b)+β22u′(b)B_2u = \beta_{21}u(b) + \beta_{22}u'(b). The completely homogeneous problem is the one with data {0;0,0}\{0;0,0\}.

Unlike an initial-value problem, a BVP may have no solution or many. Since the difference of two solutions with the same data solves the completely homogeneous problem, the alternative is sharp: if the completely homogeneous problem has only u≡0u \equiv 0, the BVP has at most one solution; if it has a nontrivial solution, the BVP has either none or many. For the rest of this unit we assume the completely homogeneous problem admits no nontrivial solution; the other case is the Fredholm alternative.

Green's function. Write x<=min⁡(x,ξ)x_{<} = \min(x,\xi) and x>=max⁡(x,ξ)x_{>} = \max(x,\xi). The Green's function G(x,ξ)G(x,\xi) of the problem (L;B1,B2)(L;B_1,B_2) is, for each fixed source point ξ\xi in a<ξ<ba < \xi < b, the function of xx satisfying

  1. LG=0LG = 0 on a<x<ξa < x < \xi and on ξ<x<b\xi < x < b;
  2. B1G=0B_1G = 0 and B2G=0B_2G = 0, the functionals acting on xx;
  3. GG is continuous at x=ξx = \xi;
  4. ∂G∂x∣x=ξ+−∂G∂x∣x=ξ−=1a2(ξ)\displaystyle \left.\frac{\partial G}{\partial x}\right|_{x=\xi^+} - \left.\frac{\partial G}{\partial x}\right|_{x=\xi^-} = \frac{1}{a_2(\xi)}.

Conditions 1, 3 and 4 are Stakgold and Holst's (3.2.7), and together they are abbreviated by the single equation

LG(x,ξ)=δ(x−ξ),B1G=B2G=0,LG(x,\xi) = \delta(x - \xi), \qquad B_1G = B_2G = 0 ,

their (3.2.8), with δ\delta the Dirac delta, the equation being read in the sense of distributions in xx. The next statement goes one way round this equivalence: it derives 3 and 4 from the delta equation, given 1. The converse — that a function with properties 1, 3 and 4 satisfies LG=δLG = \delta distributionally — is a matter of running the same computation backwards and is not carried out here. Physically, G(x,ξ)G(x,\xi) is the response at xx, under homogeneous boundary conditions, to a unit source concentrated at ξ\xi.

Note that the boundary conditions must be homogeneous for a Green's function to exist at all: GG is to act as an inverse of LL, and an inverse sends 00 to 00, which forces Bi[0]=0B_i[0] = 0 (Hassani's Lemma 20.3.1). Inhomogeneous boundary data are handled afterwards, by superposition.

Theorem(Continuity and the jump condition)AdaptedAdapted from Arfken, Weber & Harris (2013), §10.1, Eqs. (10.8)–(10.9), p. 449; Riley, Hobson & Bence (2006), §15.2.5, Eqs. (15.63)–(15.65) and the summary (iii), pp. 512–513; Hassani (2013), §20.3.1, pp. 619–621, Eq. (20.33)

Let G(⋅,ξ)G(\cdot,\xi) satisfy LG=δ(⋅−ξ)LG = \delta(\cdot-\xi) as a distribution on (a,b)(a,b), and suppose in addition that GG is twice continuously differentiable on each of [a,ξ)[a,\xi) and (ξ,b](\xi,b] — so that, the delta being supported at ξ\xi alone, LG=0LG = 0 in the classical sense on each side — and that GG and ∂G/∂x\partial G/\partial x have one-sided limits at ξ\xi. Both halves of this hypothesis are needed: without the delta equation the conclusion is false, since G≡0G \equiv 0 meets everything else. Then

G(ξ+,ξ)=G(ξ−,ξ),∂G∂x∣ξ+−∂G∂x∣ξ−=1a2(ξ).G(\xi^+,\xi) = G(\xi^-,\xi), \qquad \left.\frac{\partial G}{\partial x}\right|_{\xi^+} - \left.\frac{\partial G}{\partial x}\right|_{\xi^-} = \frac{1}{a_2(\xi)} .

That is: GG is continuous across the source and its first derivative jumps by 1/a2(ξ)1/a_2(\xi). For the self-adjoint form L=(p u′)′+q uL = (p\,u')' + q\,u used by Arfken, a2=pa_2 = p and the jump is 1/p(ξ)1/p(\xi), his Eq. (10.9).

For an operator of order nn with leading coefficient ana_n, Riley, Hobson and Bence obtain the analogue: across x=ξx=\xi every xx-derivative of GG of order n−2n-2 or less stays continuous, and the one of order n−1n-1 jumps by 1/an(ξ)1/a_n(\xi).

Theorem(Existence, uniqueness and explicit construction)AdaptedAdapted from Stakgold & Holst (2011), §3.2, pp. 194–195, construction for unmixed conditions and Eqs. (3.2.9)–(3.2.10); Hassani (2013), §20.3.2, Theorem 20.3.5, p. 621

Assume the completely homogeneous problem admits no nontrivial solution, and let the boundary conditions be unmixed. Then the Green's function exists, is unique, and is given by

  G(x,ξ)  =  u1(x<) u2(x>)a2(ξ) W(u1,u2;ξ)  \boxed{\;G(x,\xi) \;=\; \frac{u_1(x_{<})\,u_2(x_{>})}{a_2(\xi)\,W(u_1,u_2;\xi)}\;}

where

  • u1u_1 is any nontrivial solution of Lu=0Lu = 0 with B1u1=0B_1u_1 = 0 (the condition at x=ax=a),
  • u2u_2 is any nontrivial solution of Lu=0Lu = 0 with B2u2=0B_2u_2 = 0 (the condition at x=bx=b),
  • W(u1,u2;x)=u1(x)u2′(x)−u1′(x)u2(x)W(u_1,u_2;x) = u_1(x)u_2'(x) - u_1'(x)u_2(x) is their Wronskian, which vanishes nowhere.

This is Stakgold and Holst's (3.2.9). The formula does not depend on the normalisation of u1u_1 and u2u_2, because rescaling either one rescales the numerator and the Wronskian by the same factor.

If LL is formally self-adjoint, L=L∗L = L^*, equivalently a2′=a1a_2' = a_1 and L=(a2u′)′+a0uL = (a_2u')' + a_0u, then Abel's formula gives W(u1,u2;x)=C/a2(x)W(u_1,u_2;x) = C/a_2(x) for a constant CC determined by the chosen u1,u2u_1,u_2, so the prefactor is constant and

G(x,ξ)=1C u1(x<) u2(x>),G(x,\xi) = \frac{1}{C}\,u_1(x_{<})\,u_2(x_{>}) ,

their (3.2.10). Uniqueness holds for general (possibly mixed) boundary conditions too, and so does existence; Hassani's Theorem 20.3.5 states existence and uniqueness for a general second-order operator under the same hypothesis that Lu=0Lu=0 with the given homogeneous boundary conditions has no nontrivial solution.

Theorem(The Green's function solves the problem)AdaptedAdapted from Stakgold & Holst (2011), §3.2, Eq. (3.2.14) and Theorem 3.2.1 with Remark 1, pp. 196–197; Arfken, Weber & Harris (2013), §10.1, Eqs. (10.7) and (10.20)–(10.23), pp. 448, 451

Under the same hypotheses, for every piecewise continuous ff the problem

Lu=f  (a<x<b),B1u=0,B2u=0Lu = f \ \ (a<x<b), \qquad B_1u = 0, \quad B_2u = 0

is solvable, and its solution is unique; it is

u(x)  =  ∫abG(x,ξ) f(ξ) dξ.u(x) \;=\; \int_a^b G(x,\xi)\,f(\xi)\,d\xi .

For unmixed conditions this reads, with σ(ξ)=[a2(ξ)W(u1,u2;ξ)]−1\sigma(\xi) = \bigl[a_2(\xi)W(u_1,u_2;\xi)\bigr]^{-1},

u(x)  =  u2(x)∫axσ(ξ) u1(ξ)f(ξ) dξ  +  u1(x)∫xbσ(ξ) u2(ξ)f(ξ) dξ.u(x) \;=\; u_2(x)\int_a^x \sigma(\xi)\,u_1(\xi) f(\xi)\, d\xi \;+\; u_1(x)\int_x^b \sigma(\xi)\,u_2(\xi) f(\xi)\, d\xi .

The map f↦uf \mapsto u is linear, and it inverts LL on the set of twice continuously differentiable functions obeying the two homogeneous boundary conditions: one integral operator with kernel GG answers every forcing function at once. Stakgold and Holst's Theorem 3.2.1 covers inhomogeneous boundary data as well, by adding to the integral a combination of u1u_1 and u2u_2 fixed by γ1,γ2\gamma_1,\gamma_2; the method block below records the recipe.

Theorem(Reciprocity, and symmetry in the self-adjoint case)AdaptedAdapted from Stakgold & Holst (2011), §3.2, Eqs. (3.2.23)–(3.2.26) and the reciprocity principle, pp. 199–200; Arfken, Weber & Harris (2013), §10.1, Eq. (10.15), p. 450; Hassani (2013), §20.3.1, Propositions 20.3.3 and 20.3.4, p. 619

Let L∗L^* be the formal adjoint of LL,

L∗v=a2v′′+(2a2′−a1)v′+(a2′′−a1′+a0)v,L^*v = a_2 v'' + \bigl(2a_2' - a_1\bigr)v' + \bigl(a_2'' - a_1' + a_0\bigr)v ,

defined (for coefficients in C2C^2) by Green's formula

∫ab(v Lu−u L∗v) dx  =  [ J(u,v) ]ab,J(u,v)=a2(vu′−uv′)+(a1−a2′)uv.\int_a^b \bigl( v\,Lu - u\,L^*v \bigr)\, dx \;=\; \Bigl[\,J(u,v)\,\Bigr]_a^b , \qquad J(u,v) = a_2\bigl(vu' - uv'\bigr) + \bigl(a_1 - a_2'\bigr)uv .

Let MM be the set of functions obeying B1u=B2u=0B_1u = B_2u = 0, and let the adjoint boundary conditions B1∗v=B2∗v=0B_1^*v = B_2^*v = 0 define the set M∗M^* of all vv with [J(u,v)]ab=0\bigl[J(u,v)\bigr]_a^b = 0 for every u∈Mu \in M. Let GG be the Green's function of (L;B1,B2)(L;B_1,B_2) and G∗G^* the adjoint Green's function, the solution of

L∗G∗(x,ξ)=δ(x−ξ),B1∗G∗=B2∗G∗=0.L^*G^*(x,\xi) = \delta(x-\xi), \qquad B_1^*G^* = B_2^*G^* = 0 .

Then

G∗(x,ξ)  =  G(ξ,x).G^*(x,\xi) \;=\; G(\xi,x) .

Equivalently: G(x,ξ)G(x,\xi) solves the direct problem in its first argument and the adjoint problem in its second, so it obeys the adjoint boundary conditions in ξ\xi (Hassani's Proposition 20.3.3). In particular, if the problem is self-adjoint — meaning both L∗=LL^* = L and M∗=MM^* = M — then G∗=GG^* = G by uniqueness and

G(x,ξ)=G(ξ,x).G(x,\xi) = G(\xi,x) .

A warning about the star. Throughout this unit G∗G^* means the adjoint Green's function, as it does in Stakgold and Holst. Arfken's (10.15), G(x,t)=G(t,x)∗G(x,t) = G(t,x)^*, uses the same symbol for complex conjugation: he works with a Hermitian LL, for which the adjoint problem is the original one, and records the symmetry of the kernel under conjugation. The two statements agree for a self-adjoint problem with real coefficients, where both reduce to G(x,ξ)=G(ξ,x)G(x,\xi) = G(\xi,x), but the symbol is not doing the same work in the two books.

Stakgold and Holst call this the reciprocity principle: the response at xx to a unit source at ξ\xi equals the response at ξ\xi to a unit source at xx. A formally self-adjoint LL with unmixed boundary conditions is self-adjoint in this sense, and so are the periodic conditions u(a)=u(b)u(a) = u(b), a2(a)u′(a)=a2(b)u′(b)a_2(a)u'(a) = a_2(b)u'(b). An initial-value problem is never self-adjoint, whatever LL is, and its Green's function is not symmetric.

Idea of the proofOriginal

Everything follows from one observation: δ(x−ξ)\delta(x-\xi) is as singular as a second derivative of a kink. If GG itself jumped at ξ\xi, then G′G' would contain a delta and G′′G'' a derivative of a delta, and nothing else in LGLG could cancel it. So the mildest — and, it turns out, the only — possibility is that GG is continuous and G′G' has a step; then G′′G'' carries the delta. Integrating LG=δLG = \delta across the source once measures the size of that step, and dividing by a2a_2 first makes the measurement immediate.

The construction is then just counting. Off the source GG solves a second-order homogeneous equation on each of two intervals, so it has four free constants. There are four conditions: one boundary condition on each side, plus continuity and the jump. The left-hand boundary condition forces the left piece to be a multiple of the single solution u1u_1 obeying it, the right-hand one forces the right piece to be a multiple of u2u_2, and the remaining two conditions are a 2×22\times 2 linear system for the two multipliers whose determinant is the Wronskian — nonzero exactly because u1u_1 and u2u_2 are independent, which is exactly the assumption that the homogeneous problem has only the trivial solution.

That ∫Gf\int Gf solves the problem is then a differentiation: the xx-dependence sits in u1u_1 and u2u_2, which LL annihilates, so the only surviving term comes from differentiating the variable limits of the two integrals, and it collapses to ff because the prefactor was chosen as 1/(a2W)1/(a_2W).

Symmetry is Green's formula applied to GG and G∗G^*. Pairing the two delta equations against each other picks out the two values G∗(ξ,η)G^*(\xi,\eta) and G(η,ξ)G(\eta,\xi), and the boundary term vanishes — because that vanishing is precisely how the adjoint boundary conditions were defined.

Proof(Continuity and the jump condition)AdaptedAdapted from Arfken, Weber & Harris (2013), §10.1, Eqs. (10.8)–(10.9), p. 449; Hassani (2013), §20.3.1, pp. 619–620

Step 1 (normalise the leading coefficient). Since a2a_2 is continuous and nowhere zero on [a,b][a,b], divide LG=δ(⋅−ξ)LG = \delta(\cdot-\xi) by a2a_2:

∂2G∂x2+a1(x)a2(x)∂G∂x+a0(x)a2(x) G  =  δ(x−ξ)a2(x)  =  δ(x−ξ)a2(ξ),\frac{\partial^2 G}{\partial x^2} + \frac{a_1(x)}{a_2(x)}\frac{\partial G}{\partial x} + \frac{a_0(x)}{a_2(x)}\,G \;=\; \frac{\delta(x-\xi)}{a_2(x)} \;=\; \frac{\delta(x-\xi)}{a_2(\xi)} ,

the last equality by the sifting property, which lets the continuous factor 1/a21/a_2 be evaluated at the one point the delta sees (the Dirac delta). The coefficients a1/a2a_1/a_2 and a0/a2a_0/a_2 are continuous, hence bounded on [a,b][a,b]; this is where a2≠0a_2 \ne 0 on the closed interval is used.

Step 2 (why GG cannot jump). Suppose GG had a jump of size JJ at ξ\xi. Then, as distributions, ∂G/∂x\partial G/\partial x contains the term Jδ(x−ξ)J\delta(x-\xi) and ∂2G/∂x2\partial^2G/\partial x^2 the term Jδ′(x−ξ)J\delta'(x-\xi). Collecting everything, the equation of Step 1 takes the form

J δ′(x−ξ)+c δ(x−ξ)+b(x)=0J\,\delta'(x-\xi) + c\,\delta(x-\xi) + b(x) = 0

near ξ\xi, for some constant cc (gathered from the jump of ∂G/∂x\partial G/\partial x and from J a1(ξ)/a2(ξ)J\,a_1(\xi)/a_2(\xi), the first-derivative term seeing the delta only through its value at ξ\xi) and some function bb that is bounded on a neighbourhood of ξ\xi, because GG, ∂G/∂x\partial G/\partial x, a0/a2a_0/a_2 and a1/a2a_1/a_2 are all bounded there.

To extract JJ, test against the shrinking family φε(x)=ε φ((x−ξ)/ε)\varphi_\varepsilon(x) = \varepsilon\,\varphi\bigl((x-\xi)/\varepsilon\bigr), where φ\varphi is smooth, supported in (−1,1)(-1,1), with φ(0)=0\varphi(0) = 0 and φ′(0)=1\varphi'(0) = 1. Then φε(ξ)=0\varphi_\varepsilon(\xi) = 0 and φε′(ξ)=φ′(0)=1\varphi_\varepsilon'(\xi) = \varphi'(0) = 1, so

⟨δ′,φε⟩=−φε′(ξ)=−1,⟨δ,φε⟩=φε(ξ)=0,\langle \delta', \varphi_\varepsilon\rangle = -\varphi_\varepsilon'(\xi) = -1 , \qquad \langle \delta, \varphi_\varepsilon\rangle = \varphi_\varepsilon(\xi) = 0 ,

while ∣φε∣≤εsup⁡∣φ∣\lvert\varphi_\varepsilon\rvert \le \varepsilon\sup\lvert\varphi\rvert on a support of length 2ε2\varepsilon, so ∣∫b φε∣≤2ε2sup⁡∣b∣sup⁡∣φ∣→0\bigl|\int b\,\varphi_\varepsilon\bigr| \le 2\varepsilon^2\sup\lvert b\rvert\sup\lvert\varphi\rvert \to 0. The displayed equation therefore gives −J+0+O(ε2)=0-J + 0 + O(\varepsilon^2) = 0 for every small ε\varepsilon, whence J=0J = 0. One test function of this shape does the whole job: it is blind to δ\delta and to bounded functions at once, which is what is needed — being "not a multiple of δ\delta" would not suffice, since bb is present too.

So GG is continuous at ξ\xi; this is Hassani's conclusion on p. 620, reached there by an explicit integration. Consequently ∂G/∂x\partial G/\partial x has at most a finite jump.

Step 3 (integrate across the source). Integrate the equation of Step 1 over [ξ−ε,ξ+ε][\xi-\varepsilon, \xi+\varepsilon]:

[∂G∂x]ξ−εξ+ε+∫ξ−εξ+εa1a2∂G∂x dx+∫ξ−εξ+εa0a2 G dx  =  1a2(ξ),\left[\frac{\partial G}{\partial x}\right]_{\xi-\varepsilon}^{\xi+\varepsilon} + \int_{\xi-\varepsilon}^{\xi+\varepsilon}\frac{a_1}{a_2}\frac{\partial G}{\partial x}\, dx + \int_{\xi-\varepsilon}^{\xi+\varepsilon}\frac{a_0}{a_2}\,G\, dx \;=\; \frac{1}{a_2(\xi)} ,

for every ε\varepsilon small enough that [ξ−ε,ξ+ε]⊂[a,b][\xi-\varepsilon,\xi+\varepsilon] \subset [a,b]; the right side is 1/a2(ξ)1/a_2(\xi) because the delta's unit mass lies inside the interval.

Step 4 (the two integrals vanish in the limit). By Step 2, GG is continuous and ∂G/∂x\partial G/\partial x is bounded near ξ\xi (it has one-sided limits there, by hypothesis). Each integrand is therefore bounded by some constant KK on the interval, so each integral is at most 2Kε2K\varepsilon in modulus and tends to 00 as ε→0+\varepsilon \to 0^+. Here the continuity of a0,a1,a2a_0, a_1, a_2 is used, and the continuity of GG established in Step 2: had GG jumped, the middle integral would not have vanished.

Step 5 (conclude). Letting ε→0+\varepsilon \to 0^+ leaves

∂G∂x∣ξ+−∂G∂x∣ξ−=1a2(ξ).□\left.\frac{\partial G}{\partial x}\right|_{\xi^+} - \left.\frac{\partial G}{\partial x}\right|_{\xi^-} = \frac{1}{a_2(\xi)} . \qquad \square
Proof(Existence, uniqueness and the formula for GG)AdaptedAdapted from Stakgold & Holst (2011), §3.2, pp. 194–195

Assume unmixed conditions, so that B1B_1 involves only x=ax=a and B2B_2 only x=bx=b.

Step 1 (u1u_1 and u2u_2 exist). The row (α11,α12)(\alpha_{11},\alpha_{12}) is not zero, since the two coefficient rows are independent. Let u1u_1 solve the initial-value problem Lu=0Lu = 0 with u1(a)=α12u_1(a) = \alpha_{12}, u1′(a)=−α11u_1'(a) = -\alpha_{11}; a solution exists and is unique because a2≠0a_2 \ne 0 and the coefficients are continuous (existence and uniqueness). It is not identically zero, because its initial data are not both zero, and

B1u1=α11α12+α12(−α11)=0.B_1u_1 = \alpha_{11}\alpha_{12} + \alpha_{12}(-\alpha_{11}) = 0 .

The same construction at x=bx = b gives a nontrivial u2u_2 with B2u2=0B_2u_2 = 0.

Step 2 (u1u_1 and u2u_2 are independent, so W≠0W \neq 0). If they were dependent, then u2u_2 would be a nonzero multiple of u1u_1, so u1u_1 would satisfy both B1u1=0B_1u_1 = 0 and B2u1=0B_2u_1 = 0: a nontrivial solution of the completely homogeneous problem, contradicting the standing hypothesis. Two solutions of Lu=0Lu=0 are independent if and only if their Wronskian is nonzero at one point, and then it is nonzero everywhere (linear ODE theory); so W(u1,u2;x)≠0W(u_1,u_2;x) \ne 0 on [a,b][a,b].

Step 3 (the shape of GG). On a≤x<ξa \le x < \xi, GG solves Lu=0Lu=0 and satisfies B1G=0B_1G = 0, a condition involving only x=ax = a. Every solution of Lu=0Lu=0 obeying B1u=0B_1u=0 is a multiple of u1u_1: the set of such solutions is at most one-dimensional, since two independent ones would make every solution satisfy B1u=0B_1u=0, in particular u2u_2, again producing a nontrivial solution of the completely homogeneous problem. Hence G(x,ξ)=A u1(x)G(x,\xi) = A\,u_1(x) for x<ξx < \xi, and likewise G(x,ξ)=B u2(x)G(x,\xi) = B\,u_2(x) for x>ξx > \xi, with A,BA,B depending on ξ\xi only.

Step 4 (the two remaining conditions). Continuity at x=ξx=\xi and the jump of 1/a2(ξ)1/a_2(\xi) in ∂G/∂x\partial G/\partial x give

A u1(ξ)−B u2(ξ)=0,−A u1′(ξ)+B u2′(ξ)=1a2(ξ).A\,u_1(\xi) - B\,u_2(\xi) = 0 , \qquad -A\,u_1'(\xi) + B\,u_2'(\xi) = \frac{1}{a_2(\xi)} .

Step 5 (solve). The determinant of this 2×22\times2 system in (A,B)(A,B) is u1(ξ)u2′(ξ)−u1′(ξ)u2(ξ)=W(u1,u2;ξ)u_1(\xi)u_2'(\xi) - u_1'(\xi)u_2(\xi) = W(u_1,u_2;\xi), nonzero by Step 2, so there is exactly one solution. Cramer's rule gives

A=u2(ξ)a2(ξ)W(u1,u2;ξ),B=u1(ξ)a2(ξ)W(u1,u2;ξ).A = \frac{u_2(\xi)}{a_2(\xi)W(u_1,u_2;\xi)} , \qquad B = \frac{u_1(\xi)}{a_2(\xi)W(u_1,u_2;\xi)} .

Substituting into Step 3 and noticing that for x<ξx<\xi the pair (x,ξ)(x,\xi) is (x<,x>)(x_{<},x_{>}) while for x>ξx>\xi it is (x>,x<)(x_{>},x_{<}), both branches become the single formula

G(x,ξ)=u1(x<) u2(x>)a2(ξ) W(u1,u2;ξ).G(x,\xi) = \frac{u_1(x_{<})\,u_2(x_{>})}{a_2(\xi)\,W(u_1,u_2;\xi)} .

Step 6 (uniqueness). Two Green's functions for the same problem differ by a function that solves Lu=0Lu=0 on each side of ξ\xi, is continuous at ξ\xi with continuous derivative there (the jumps cancel), and satisfies B1=B2=0B_1 = B_2 = 0. Such a difference solves Lu=0Lu=0 classically on all of (a,b)(a,b) and meets both homogeneous boundary conditions, hence vanishes identically by hypothesis. This argument uses nothing about unmixed conditions, so uniqueness holds in general.

Step 7 (the self-adjoint form). If a1=a2′a_1 = a_2', then L=(a2u′)′+a0uL = (a_2u')' + a_0u and Abel's formula for the Wronskian of two solutions, W(x)=Cexp⁡(−∫a1/a2)W(x) = C\exp\bigl(-\int a_1/a_2\bigr), becomes W(x)=C/a2(x)W(x) = C/a_2(x) (Stakgold and Holst's (3.1.8)). Hence a2(ξ)W(ξ)=Ca_2(\xi)W(\xi) = C is independent of ξ\xi and G(x,ξ)=u1(x<)u2(x>)/CG(x,\xi) = u_1(x_{<})u_2(x_{>})/C, which is visibly symmetric in xx and ξ\xi. □\square

Proof(The representation formula)AdaptedAdapted from Arfken, Weber & Harris (2013), §10.1, Eqs. (10.20)–(10.23), pp. 451; Stakgold & Holst (2011), §3.2, (3.2.13)–(3.2.14) and Theorem 3.2.1, pp. 195–196

Take unmixed conditions and write σ(ξ)=[a2(ξ)W(u1,u2;ξ)]−1\sigma(\xi) = \bigl[a_2(\xi)W(u_1,u_2;\xi)\bigr]^{-1}, a continuous function of ξ\xi since a2a_2 and WW are continuous and nonvanishing.

Step 1 (split the integral at the source point). For ξ<x\xi < x the formula for GG gives G(x,ξ)=σ(ξ)u1(ξ)u2(x)G(x,\xi) = \sigma(\xi)u_1(\xi)u_2(x), and for ξ>x\xi > x it gives G(x,ξ)=σ(ξ)u1(x)u2(ξ)G(x,\xi) = \sigma(\xi)u_1(x)u_2(\xi). Hence

u(x)=∫abG(x,ξ)f(ξ) dξ=u2(x) I1(x)+u1(x) I2(x),u(x) = \int_a^b G(x,\xi)f(\xi)\,d\xi = u_2(x)\,I_1(x) + u_1(x)\,I_2(x) ,I1(x)=∫axσu1f dξ,I2(x)=∫xbσu2f dξ.I_1(x) = \int_a^x \sigma u_1 f\, d\xi , \qquad I_2(x) = \int_x^b \sigma u_2 f\, d\xi .

Step 2 (first derivative). By the fundamental theorem of calculus, I1′=σ(x)u1(x)f(x)I_1' = \sigma(x)u_1(x)f(x) and I2′=−σ(x)u2(x)f(x)I_2' = -\sigma(x)u_2(x)f(x) at every point where ff is continuous. Differentiating the product,

u′=u2′I1+u1′I2+σu1u2f−σu1u2f⏟= 0=u2′I1+u1′I2.u' = u_2'I_1 + u_1'I_2 + \underbrace{\sigma u_1 u_2 f - \sigma u_1 u_2 f}_{=\,0} = u_2'I_1 + u_1'I_2 .

The two boundary terms cancel exactly because the same function σ(ξ)u1(ξ)u2(ξ)\sigma(\xi)u_1(\xi)u_2(\xi) appears in both; this is the analytic content of the continuity of GG at x=ξx=\xi.

Step 3 (second derivative). Differentiating again,

u′′=u2′′I1+u1′′I2+σ(u1u2′−u1′u2)f=u2′′I1+u1′′I2+σWf.u'' = u_2''I_1 + u_1''I_2 + \sigma\bigl(u_1u_2' - u_1'u_2\bigr) f = u_2''I_1 + u_1''I_2 + \sigma W f .

The surviving term is the jump condition at work: the two boundary terms no longer cancel, and what is left is σWf\sigma W f.

Step 4 (apply LL). Combining Steps 1–3,

Lu=(a2u2′′+a1u2′+a0u2)I1+(a2u1′′+a1u1′+a0u1)I2+a2 σ Wf=I1 Lu2+I2 Lu1+a2σWf.Lu = \bigl(a_2u_2'' + a_1u_2' + a_0u_2\bigr)I_1 + \bigl(a_2u_1'' + a_1u_1' + a_0u_1\bigr)I_2 + a_2\,\sigma\,W f = I_1\,Lu_2 + I_2\,Lu_1 + a_2\sigma W f .

Here Lu1=Lu2=0Lu_1 = Lu_2 = 0, since u1,u2u_1,u_2 solve the homogeneous equation, and a2(x)σ(x)W(x)=1a_2(x)\sigma(x)W(x) = 1 by the definition of σ\sigma. Hence Lu=fLu = f at every point of continuity of ff.

Step 5 (boundary conditions). At x=ax=a the integral I1I_1 vanishes, so u(a)=u1(a)I2(a)u(a) = u_1(a)I_2(a) and, by Step 2, u′(a)=u1′(a)I2(a)u'(a) = u_1'(a)I_2(a). Therefore

B1u=α11u(a)+α12u′(a)=I2(a) [α11u1(a)+α12u1′(a)]=I2(a) B1u1=0.B_1u = \alpha_{11}u(a) + \alpha_{12}u'(a) = I_2(a)\,\bigl[\alpha_{11}u_1(a) + \alpha_{12}u_1'(a)\bigr] = I_2(a)\,B_1u_1 = 0 .

The same computation at x=bx=b, where I2(b)=0I_2(b) = 0, gives B2u=I1(b) B2u2=0B_2u = I_1(b)\,B_2u_2 = 0. This step is where unmixedness is needed: B1B_1 had to involve only the endpoint at which one of the two integrals vanishes.

Step 6 (uniqueness). Any two solutions of the problem differ by a solution of the completely homogeneous problem, which is identically zero by hypothesis. □\square

Proof(Reciprocity and symmetry)AdaptedAdapted from Stakgold & Holst (2011), §3.2, pp. 199–200, proof of (3.2.25)–(3.2.26)

Step 1 (pair the two problems). Fix ξ\xi and η\eta in (a,b)(a,b). Put u(x)=G(x,ξ)u(x) = G(x,\xi), which satisfies LG(x,ξ)=δ(x−ξ)LG(x,\xi) = \delta(x-\xi) and lies in MM, and v(x)=G∗(x,η)v(x) = G^*(x,\eta), which satisfies L∗G∗(x,η)=δ(x−η)L^*G^*(x,\eta) = \delta(x-\eta) and lies in M∗M^*. Form the combination v Lu−u L∗vv\,Lu - u\,L^*v and integrate it over (a,b)(a,b):

∫ab(v Lu−u L∗v)dx=∫abG∗(x,η) δ(x−ξ) dx−∫abG(x,ξ) δ(x−η) dx.\int_a^b \bigl(v\,Lu - u\,L^*v\bigr) dx = \int_a^b G^*(x,\eta)\,\delta(x-\xi)\,dx - \int_a^b G(x,\xi)\,\delta(x-\eta)\,dx .

Step 2 (the right-hand side). By the sifting property, treating the deltas formally as Stakgold and Holst do, the right-hand side is

G∗(ξ,η)−G(η,ξ).G^*(\xi,\eta) - G(\eta,\xi) .

Step 3 (the left-hand side). By Green's formula, the left-hand side equals the boundary term [J(u,v)]ab\bigl[J(u,v)\bigr]_a^b, where J(u,v)=a2(vu′−uv′)+(a1−a2′)uvJ(u,v) = a_2(vu'-uv') + (a_1-a_2')uv.

Step 4 (the boundary term vanishes). u∈Mu \in M and v∈M∗v \in M^*. By the very definition of the adjoint boundary conditions, [J(u,v)]ab=0\bigl[J(u,v)\bigr]_a^b = 0 for every such pair. This is the only place the boundary conditions enter, and it is the step that fails for an arbitrary pair of functions.

Step 5 (conclude). Therefore G∗(ξ,η)=G(η,ξ)G^*(\xi,\eta) = G(\eta,\xi) for all ξ,η\xi,\eta, which is the asserted relation after renaming the variables.

Step 6 (the self-adjoint case). If the problem is self-adjoint, L∗=LL^* = L and M∗=MM^* = M, so G∗G^* solves exactly the problem that defines GG. By the uniqueness proved above, G∗=GG^* = G, and Step 5 becomes G(x,ξ)=G(ξ,x)G(x,\xi) = G(\xi,x). □\square

Remark(Where the hypotheses are used, and what fails without them)Original
  • a2≠0a_2 \ne 0 on the closed interval. Used in Step 1 of the jump proof, to divide by a2a_2 and keep the other coefficients bounded, and again in Step 5, since 1/a2(ξ)1/a_2(\xi) must be finite. At a point where a2a_2 vanishes the equation is singular and the construction breaks down: for L=((1−x2)u′)′L = \bigl((1-x^2)u'\bigr)' on [−1,1][-1,1], the two solutions of Lu=0Lu=0 are 11 and 12ln⁡1+x1−x\tfrac12\ln\frac{1+x}{1-x}, and both boundary requirements "GG finite at ±1\pm1" select the same solution u1=u2=1u_1 = u_2 = 1. Arfken's Exercise 10.1.6 (p. 457) makes exactly this point: the candidates for u1u_1 and u2u_2 are linearly dependent, so no Green's function can be built this way.
  • No nontrivial solution of the completely homogeneous problem. Used in Step 2 and Step 3 of the construction (independence of u1,u2u_1,u_2, hence W≠0W \ne 0), in Step 6 (uniqueness) and in Step 6 of the representation proof. Without it the construction divides by zero. Stakgold and Holst's Example 2 is the model: for u′′+a0u=fu'' + a_0u = f on (0,1)(0,1) with u(0)=u(1)=0u(0)=u(1)=0 and a0=π2a_0 = \pi^2, the homogeneous problem has the solutions Asin⁡πxA\sin\pi x, the problem with f≡1f \equiv 1 has no solution, and the problem with f=x−12f = x - \tfrac12 has infinitely many. What replaces the Green's function is the Fredholm alternative and the modified Green's function.
  • Exactly two boundary conditions. Stakgold and Holst's Remark 1 after Theorem 3.2.1: a third condition of the same type would leave the completely homogeneous problem with only the trivial solution, but would usually leave the inhomogeneous problem with no solution at all. The count four constants / four conditions in the idea block is not an accident.
  • Homogeneous boundary conditions. Required for GG to exist at all (Hassani's Lemma 20.3.1). With B1u=γ1≠0B_1u = \gamma_1 \ne 0, the map f↦uf \mapsto u could not be linear, and f≡0f \equiv 0 would not give u≡0u \equiv 0.
  • Unmixedness. Used only in the construction (to make the left piece a multiple of a single u1u_1) and in Step 5 of the representation proof. Existence, uniqueness and the representation formula themselves hold for general boundary functionals; Stakgold and Holst build GG in that case from the causal solution plus a correction, and their Theorem 3.2.1 is stated for general B1,B2B_1,B_2.
  • Self-adjointness, for symmetry. Only Step 6 of the last proof uses it. Drop it and the symmetry is false: the second example below exhibits a problem with G(x,ξ)≠G(ξ,x)G(x,\xi) \ne G(\xi,x) for which the weaker relation G∗(x,ξ)=G(ξ,x)G^*(x,\xi) = G(\xi,x) still holds. An initial-value problem is never self-adjoint — the adjoint conditions move to the other endpoint — which is why causal Green's functions are one-sided and asymmetric.
Remark(Conventions that differ between books)Original

This unit follows Stakgold and Holst, Arfken, and Riley, Hobson and Bence in writing

LG(x,ξ)=δ(x−ξ),jump in ∂G/∂x = 1a2(ξ).LG(x,\xi) = \delta(x-\xi), \qquad \text{jump in } \partial G/\partial x \ = \ \frac{1}{a_2(\xi)} .

Hassani uses a different normalisation. He works with a Sturm–Liouville weight w(x)>0w(x) > 0, defines the Green's function by

LxG(x,y)=δ(x−y)w(x),L_xG(x,y) = \frac{\delta(x-y)}{w(x)} ,

and consequently obtains the jump 1/(p2(y)w(y))1/\bigl(p_2(y)w(y)\bigr), his Eq. (20.33), with the representation u(x)=∫abw(y) G(x,y)f(y) dyu(x) = \int_a^b w(y)\,G(x,y)f(y)\,dy. His differential operator is the same p2u′′+p1u′+p0up_2u'' + p_1u' + p_0u as ours, so the two kernels are related by the weight alone: since δ(x−y)/w(x)=δ(x−y)/w(y)\delta(x-y)/w(x) = \delta(x-y)/w(y) and LL is linear,

GHassani(x,y)=G(x,y)w(y),G_{\text{Hassani}}(x,y) = \frac{G(x,y)}{w(y)} ,

which is exactly the factor turning our jump 1/p2(y)1/p_2(y) into his 1/(p2(y)w(y))1/\bigl(p_2(y)w(y)\bigr). The two conventions agree when w≡1w \equiv 1. They always agree on the answer: his equation carries the factor 1/w1/w and his representation integral carries the compensating ww, so ∫w GHassanif dy=∫Gf dy\int w\,G_{\text{Hassani}}f\,dy = \int G f\,dy and the solution uu is the same function. What one must not do is mix them — our jump with his representation, or his kernel with our integral — which is wrong by a factor ww. The same caution applies to the sign: many physics texts define the Green's function of −d2/dx2-d^2/dx^2 rather than d2/dx2d^2/dx^2, which flips the sign of GG.

A second point of notation: the second argument of GG is called ξ\xi here, tt by Arfken, zz by Riley, Hobson and Bence, and yy by Hassani. The named and unnamed roles are the same in all four: the first argument is the field point, the second the source point.

Method(Building and using a Green's function)AdaptedAdapted from Stakgold & Holst (2011), §3.2, pp. 194–196; Riley, Hobson & Bence (2006), §15.2.5, pp. 512–513; Arfken, Weber & Harris (2013), §10.1, pp. 450–452

Given Lu=a2u′′+a1u′+a0u=fLu = a_2u'' + a_1u' + a_0u = f on [a,b][a,b] with two homogeneous unmixed conditions:

  1. Check the hypothesis. Confirm a2≠0a_2 \ne 0 on [a,b][a,b] and that Lu=0Lu = 0 with both homogeneous boundary conditions has only u≡0u \equiv 0. If not, stop: use the Fredholm alternative instead.
  2. Find a basis {v1,v2}\{v_1,v_2\} of solutions of Lu=0Lu = 0.
  3. Match each endpoint. Take u1u_1 to be the combination of v1,v2v_1,v_2 obeying the condition at x=ax=a, and u2u_2 the one obeying the condition at x=bx=b. Each is determined up to a scale factor, which does not matter.
  4. Compute W(u1,u2;ξ)=u1u2′−u1′u2W(u_1,u_2;\xi) = u_1u_2' - u_1'u_2 at ξ\xi and the prefactor σ(ξ)=1/(a2(ξ)W(ξ))\sigma(\xi) = 1/\bigl(a_2(\xi)W(\xi)\bigr). If LL is formally self-adjoint, σ\sigma is a constant; a ξ\xi-dependence surviving in a2Wa_2W for a self-adjoint LL signals an algebra error.
  5. Assemble G(x,ξ)=σ(ξ) u1(x<)u2(x>)G(x,\xi) = \sigma(\xi)\,u_1(x_{<})u_2(x_{>}), that is σ(ξ)u1(x)u2(ξ)\sigma(\xi)u_1(x)u_2(\xi) for x<ξx<\xi and σ(ξ)u1(ξ)u2(x)\sigma(\xi)u_1(\xi)u_2(x) for x>ξx>\xi.
  6. Verify the four defining properties: LG=0LG=0 on each side, the two boundary conditions, continuity at x=ξx=\xi, and the jump 1/a2(ξ)1/a_2(\xi). The jump check is the one that catches sign errors.
  7. Integrate for the solution, u(x)=u2(x)∫axσu1f dξ+u1(x)∫xbσu2f dξ,u(x) = u_2(x)\int_a^x \sigma u_1 f\, d\xi + u_1(x)\int_x^b \sigma u_2 f\, d\xi , and note that only this step has to be repeated when ff changes.
  8. Inhomogeneous boundary data. Either subtract a smooth function meeting them — for u(a)=c1u(a)=c_1, u(b)=c2u(b)=c_2 Arfken uses the straight line [c1(b−x)+c2(x−a)]/(b−a)\bigl[c_1(b-x) + c_2(x-a)\bigr]/(b-a) — and solve the resulting problem with homogeneous conditions and a modified ff; or add to the integral the combination γ2B2u1u1(x)+γ1B1u2u2(x)\dfrac{\gamma_2}{B_2u_1}u_1(x) + \dfrac{\gamma_1}{B_1u_2}u_2(x), which is Stakgold and Holst's (3.2.16). The pairing is the crossed one, and it is worth checking: B1u1=0B_1u_1 = 0 kills the first term under B1B_1 and leaves B1u=γ1B_1u = \gamma_1, while B2u2=0B_2u_2 = 0 kills the second under B2B_2 and leaves B2u=γ2B_2u = \gamma_2.
Example(A self-adjoint problem with variable coefficients)Original

Solve (x u′)′=f(x)\bigl(x\,u'\bigr)' = f(x) on 1≤x≤21 \le x \le 2 with u(1)=u(2)=0u(1) = u(2) = 0, and in particular for f(x)=1/xf(x) = 1/x.

  1. Hypotheses. Here a2(x)=xa_2(x) = x, a1(x)=1=a2′a_1(x) = 1 = a_2', so LL is formally self-adjoint, and a2≠0a_2 \ne 0 on [1,2][1,2]. The homogeneous equation (xu′)′=0(xu')' = 0 gives xu′=cxu' = c, hence u=cln⁡x+du = c\ln x + d; the conditions u(1)=u(2)=0u(1)=u(2)=0 force d=0d = 0 and cln⁡2=0c\ln 2 = 0, so c=0c = 0: only the trivial solution. The construction applies.
  2. Endpoint solutions. u1(x)=ln⁡xu_1(x) = \ln x vanishes at x=1x=1; u2(x)=ln⁡(x/2)u_2(x) = \ln(x/2) vanishes at x=2x=2.
  3. Wronskian and prefactor. W=u1u2′−u1′u2=ln⁡xx−ln⁡(x/2)x=ln⁡2x,a2(ξ)W(ξ)=ξ⋅ln⁡2ξ=ln⁡2,W = u_1u_2' - u_1'u_2 = \frac{\ln x}{x} - \frac{\ln (x/2)}{x} = \frac{\ln 2}{x} , \qquad a_2(\xi)W(\xi) = \xi\cdot\frac{\ln 2}{\xi} = \ln 2 , a constant, as it must be for a self-adjoint LL. So σ=1/ln⁡2\sigma = 1/\ln 2.
  4. The Green's function. G(x,ξ)=ln⁡x<  ln⁡(x>/2)ln⁡2={ln⁡x ln⁡(ξ/2)ln⁡2,1≤x≤ξ,ln⁡ξ ln⁡(x/2)ln⁡2,ξ≤x≤2.G(x,\xi) = \frac{\ln x_{<}\;\ln\bigl(x_{>}/2\bigr)}{\ln 2} = \begin{cases} \dfrac{\ln x\,\ln(\xi/2)}{\ln 2}, & 1 \le x \le \xi,\\[2mm] \dfrac{\ln \xi\,\ln(x/2)}{\ln 2}, & \xi \le x \le 2 . \end{cases} It is symmetric, as predicted. Note G≤0G \le 0 throughout, since ln⁡x<≥0\ln x_{<} \ge 0 and ln⁡(x>/2)≤0\ln(x_{>}/2) \le 0.
  5. Check the jump. For x>ξx > \xi, ∂G/∂x=ln⁡ξ/(xln⁡2)\partial G/\partial x = \ln\xi/(x\ln 2); for x<ξx<\xi, ∂G/∂x=ln⁡(ξ/2)/(xln⁡2)\partial G/\partial x = \ln(\xi/2)/(x\ln 2). At x=ξx=\xi the difference is ln⁡ξ−ln⁡(ξ/2)ξln⁡2=ln⁡2ξln⁡2=1ξ=1a2(ξ).✓\frac{\ln\xi - \ln(\xi/2)}{\xi\ln 2} = \frac{\ln 2}{\xi \ln 2} = \frac{1}{\xi} = \frac{1}{a_2(\xi)} . \checkmark
  6. Solve with f(ξ)=1/ξf(\xi) = 1/\xi. u(x)=ln⁡(x/2)ln⁡2∫1xln⁡ξξ dξ+ln⁡xln⁡2∫x2ln⁡(ξ/2)ξ dξ.u(x) = \frac{\ln(x/2)}{\ln 2}\int_1^x \frac{\ln\xi}{\xi}\, d\xi + \frac{\ln x}{\ln 2}\int_x^2 \frac{\ln(\xi/2)}{\xi}\, d\xi . With s=ln⁡ξs = \ln\xi the first integral is 12(ln⁡x)2\tfrac12(\ln x)^2; with s=ln⁡(ξ/2)s = \ln(\xi/2) the second is [12s2]ln⁡(x/2)0=−12(ln⁡(x/2))2\bigl[\tfrac12 s^2\bigr]_{\ln(x/2)}^{0} = -\tfrac12\bigl(\ln(x/2)\bigr)^2. Hence u(x)=ln⁡x ln⁡(x/2)2ln⁡2[ln⁡x−ln⁡(x/2)]=ln⁡x ln⁡(x/2)2ln⁡2⋅ln⁡2=12 ln⁡x ln⁡x2.u(x) = \frac{\ln x\,\ln(x/2)}{2\ln 2}\Bigl[\ln x - \ln(x/2)\Bigr] = \frac{\ln x\,\ln(x/2)}{2\ln 2}\cdot \ln 2 = \frac{1}{2}\,\ln x\,\ln\frac{x}{2} .
  7. Independent check. Integrating (xu′)′=1/x(xu')' = 1/x directly gives xu′=ln⁡x+cxu' = \ln x + c, then u=12(ln⁡x)2+cln⁡x+du = \tfrac12(\ln x)^2 + c\ln x + d; u(1)=0u(1)=0 gives d=0d=0 and u(2)=0u(2)=0 gives c=−12ln⁡2c = -\tfrac12\ln 2, so u=12ln⁡x ln⁡(x/2)u = \tfrac12\ln x\,\ln(x/2). The two routes agree.
  8. A number. At x=1.5x = 1.5: ln⁡1.5=0.405465\ln 1.5 = 0.405465 and ln⁡0.75=−0.287682\ln 0.75 = -0.287682, so u(1.5)=−0.0583225u(1.5) = -0.0583225 to six decimal places. The deflection is negative everywhere, as the sign of GG and the positive source demand.
Example(A problem that is not self-adjoint: GG is not symmetric, but G∗(x,ξ)=G(ξ,x)G^*(x,\xi) = G(\xi,x))Original

Take Lu=u′′+2u′Lu = u'' + 2u' on 0≤x≤10 \le x \le 1 with u(0)=u(1)=0u(0) = u(1) = 0. Here a2=1a_2 = 1, a1=2≠a2′=0a_1 = 2 \ne a_2' = 0, so LL is not formally self-adjoint.

  1. Hypotheses. u′′+2u′=0u'' + 2u' = 0 has general solution A+Be−2xA + Be^{-2x}; the two conditions give A+B=0A + B = 0 and A+Be−2=0A + Be^{-2} = 0, hence A=B=0A=B=0. Only the trivial solution, so GG exists.
  2. Endpoint solutions. u1(x)=1−e−2xu_1(x) = 1 - e^{-2x} vanishes at x=0x=0; u2(x)=e−2x−e−2u_2(x) = e^{-2x} - e^{-2} vanishes at x=1x=1.
  3. Wronskian. W=u1u2′−u1′u2=(1−e−2x)(−2e−2x)−2e−2x(e−2x−e−2)=−2e−2x(1−e−2),W = u_1u_2' - u_1'u_2 = \bigl(1-e^{-2x}\bigr)\bigl(-2e^{-2x}\bigr) - 2e^{-2x}\bigl(e^{-2x}-e^{-2}\bigr) = -2e^{-2x}\bigl(1 - e^{-2}\bigr) , which depends on xx — the signature of a non-self-adjoint LL, since a2=1a_2 = 1 here.
  4. The Green's function. With a2(ξ)W(ξ)=−2e−2ξ(1−e−2)a_2(\xi)W(\xi) = -2e^{-2\xi}(1-e^{-2}), G(x,ξ)=− e2ξ2(1−e−2)  (1−e−2x<)(e−2x>−e−2).G(x,\xi) = -\,\frac{e^{2\xi}}{2\bigl(1-e^{-2}\bigr)}\;\bigl(1 - e^{-2x_{<}}\bigr)\bigl(e^{-2x_{>}} - e^{-2}\bigr) . Direct substitution confirms Gxx+2Gx=0G_{xx} + 2G_x = 0 on each side, G(0,ξ)=G(1,ξ)=0G(0,\xi) = G(1,\xi) = 0, and a jump of exactly 11 in ∂G/∂x\partial G/\partial x at x=ξx=\xi (here 1/a2=11/a_2 = 1).
  5. Symmetry fails. The factor e2ξe^{2\xi} depends on ξ\xi alone, while u1(x<)u2(x>)u_1(x_{<})u_2(x_{>}) is symmetric, so G(x,ξ)G(ξ,x)=e2(ξ−x)≠1for x≠ξ.\frac{G(x,\xi)}{G(\xi,x)} = e^{2(\xi-x)} \ne 1 \quad\text{for } x \ne \xi . Numerically, G(14,34)=−0.0895249G\bigl(\tfrac14,\tfrac34\bigr) = -0.0895249 while G(34,14)=−0.0329344G\bigl(\tfrac34,\tfrac14\bigr) = -0.0329344, and their ratio is e1=2.71828e^{1} = 2.71828. Reciprocity genuinely fails: a unit source at 34\tfrac34 produces a response at 14\tfrac14 nearly three times the response at 34\tfrac34 to a unit source at 14\tfrac14. The drift term 2u′2u' breaks the left–right balance.
  6. But the general relation holds. The formal adjoint is L∗v=v′′+(2a2′−a1)v′+(a2′′−a1′+a0)v=v′′−2v′L^*v = v'' + (2a_2' - a_1)v' + (a_2'' - a_1' + a_0)v = v'' - 2v'. With Dirichlet conditions, J(u,v)=vu′−uv′+2uvJ(u,v) = vu' - uv' + 2uv vanishes at both endpoints whenever uu and vv vanish there, so the adjoint boundary conditions are again v(0)=v(1)=0v(0)=v(1)=0. Solving the adjoint problem the same way, with v1=e2x−1v_1 = e^{2x}-1, v2=e2x−e2v_2 = e^{2x}-e^{2} and W(v1,v2;x)=2e2x(e2−1)W(v_1,v_2;x) = 2e^{2x}(e^2-1), G∗(x,ξ)=(e2x<−1)(e2x>−e2)2e2ξ(e2−1).G^*(x,\xi) = \frac{\bigl(e^{2x_{<}}-1\bigr)\bigl(e^{2x_{>}}-e^{2}\bigr)}{2e^{2\xi}\bigl(e^{2}-1\bigr)} . Rewriting 1−e−2x=e−2x(e2x−1)1 - e^{-2x} = e^{-2x}(e^{2x}-1) and e−2ξ−e−2=e−2ξ−2(e2−e2ξ)e^{-2\xi} - e^{-2} = e^{-2\xi-2}\bigl(e^{2}-e^{2\xi}\bigr) in the formula of item 4 turns G(ξ,x)G(\xi,x) into precisely this expression. So G∗(x,ξ)=G(ξ,x)G^*(x,\xi) = G(\xi,x) exactly, confirming the reciprocity theorem in a case where plain symmetry is false.
  7. Why the adjoint is not the same operator. The adjoint boundary conditions coincide with the original ones here, so the failure of self-adjointness is entirely in LL versus L∗L^*. Multiplying LuLu by the integrating factor e2xe^{2x} turns it into e−2x(e2xu′)′e^{-2x}\bigl(e^{2x}u'\bigr)': the problem can be made self-adjoint, at the price of a weight e2xe^{2x} in the inner product — which is the weight ww of Hassani's convention.
ApplicationOriginal

The Green's function is the influence function of a linear system: the field at xx produced by a unit source at ξ\xi. Once it is known, the response to any distribution of sources is a single integral, and the boundary conditions have already been built in.

  • Statics. A string under tension TT with small transverse load w(x)w(x) satisfies −T u′′=w-T\,u'' = w, and the Green's function of −d2/dx2-d^2/dx^2 on [0,L][0,L] with u(0)=u(L)=0u(0)=u(L)=0 is G(x,ξ)=x<(L−x>)/LG(x,\xi) = x_{<}(L-x_{>})/L: the triangular shape a string takes under a single point load. A beam obeys the fourth-order (EI u′′)′′=w\bigl(EI\,u''\bigr)'' = w instead, so its Green's function is a different function — piecewise cubic, with three derivatives continuous and a jump in the third, by the nnth-order form of the conditions quoted above — but it plays the same role: it is the influence line that structural engineers tabulate so that any load can be handled by integration. The first worked example above is the radial version of this: steady one-dimensional conduction in a shell with a variable conductance xx.
  • Steady transport. For steady diffusion along a rod with source density ff and prescribed end temperatures, (κ(x)u′)′=−f\bigl(\kappa(x)u'\bigr)' = -f; the Green's function is the temperature profile from a unit heat source at one point. The second example is the convective version: u′′+2u′u'' + 2u' is diffusion plus a drift of fixed speed, and the asymmetry of its Green's function is the physical statement that a source influences what lies downstream more than what lies upstream. Reciprocity is a property of pure diffusion, not of advection.
  • Reciprocity as a physical law. G(x,ξ)=G(ξ,x)G(x,\xi) = G(\xi,x) for self-adjoint problems is the one-dimensional case of a family of reciprocity theorems: Maxwell's and Betti's in elasticity (a unit load at AA deflects BB by the same amount as a unit load at BB deflects AA), Rayleigh's in acoustics, and the reciprocity between transmitting and receiving antennas. When a measurement appears to violate it, the model contains a non-self-adjoint term — a flow, a magnetic field, an absorbing boundary — and locating that term is often the point of the test.
  • Quantum mechanics and scattering. With L=−d2/dx2+V(x)−EL = -d^2/dx^2 + V(x) - E, the Green's function is the resolvent kernel ⟨x∣(H−E)−1∣ξ⟩\langle x|(H-E)^{-1}|\xi\rangle. Writing the Schrödinger equation as u=ufree+∫G Vuu = u_{\text{free}} + \int G\,V u is the starting point of the Born series (the Born approximation), and the choice of boundary condition at infinity — outgoing rather than vanishing — selects the scattering Green's function, as in Arfken's boundary-at-infinity example.
  • Reformulating eigenvalue problems. Since GG inverts LL, the eigenvalue problem Lu=λuLu = \lambda u becomes the integral equation u(x)=λ∫abG(x,ξ)u(ξ) dξu(x) = \lambda\int_a^b G(x,\xi)u(\xi)\,d\xi. Arfken stresses the practical gain: the integral operator is bounded while the differential operator is not, which is why the sharp spectral theorems are proved on the integral side (Hilbert–Schmidt theory) and why GG has the bilinear eigenfunction expansion of the next unit.

Theorem

The Fredholm alternative and modified Green's functions

Adapted

States and proves the dichotomy governing a boundary-value problem whose homogeneous problem has nontrivial solutions — either a unique solution for every forcing, or solvability exactly when the forcing is orthogonal to every solution of the homogeneous adjoint problem — gives the model matrix case with a complete proof, and builds the modified Green's function, the pseudoinverse that returns the minimum-norm solution when the problem is solvable and the minimum-norm least-squares solution when it is not.

Prerequisites: Green's function for a boundary-value problem, Adjoint and self-adjoint differential operators, Linear systems and rank, Inner products and norms, Orthogonal projection and least squares

Definition(The three problems, and solvability conditions)AdaptedAdapted from Stakgold & Holst (2011), §3.4, (3.4.1)–(3.4.3), p. 206, and p. 211

Keep the setting of the previous unit, but now for an operator of order pp,

Lu=ap(x)u(p)+⋯+a1(x)u′+a0(x)u,Lu = a_p(x)u^{(p)} + \dots + a_1(x)u' + a_0(x)u ,

with ap≠0a_p \ne 0 on [a,b][a,b], together with pp boundary functionals B1,…,BpB_1,\dots,B_p built from the values of u,u′,…,u(p−1)u,u',\dots,u^{(p-1)} at aa and bb, with independent coefficient rows. Three problems are in play:

(D)Lu=f,  B1u=γ1,…,Bpu=γp;\textbf{(D)}\quad Lu = f,\ \ B_1u = \gamma_1,\dots,B_pu = \gamma_p ;(H)Lu=0,  B1u=⋯=Bpu=0;(A)L∗v=0,  B1∗v=⋯=Bp∗v=0.\textbf{(H)}\quad Lu = 0,\ \ B_1u = \dots = B_pu = 0 ; \qquad \textbf{(A)}\quad L^*v = 0,\ \ B_1^*v = \dots = B_p^*v = 0 .

Here L∗L^* is the formal adjoint and Bi∗B_i^* the adjoint boundary functionals, defined as before by Green's formula

∫ab(v Lu−u L∗v) dx=[J(u,v)]ab,\int_a^b\bigl(v\,Lu - u\,L^*v\bigr)\,dx = \Bigl[J(u,v)\Bigr]_a^b ,

with B1∗v=⋯=Bp∗v=0B_1^*v = \dots = B_p^*v = 0 exactly when [J(u,v)]ab=0\bigl[J(u,v)\bigr]_a^b = 0 for every uu obeying B1u=⋯=Bpu=0B_1u = \dots = B_pu = 0. Problem (H) is the direct homogeneous problem and (A) the homogeneous adjoint problem.

When (H) has nontrivial solutions, (D) usually has none, and the conditions on the data {f;γ1,…,γp}\{f;\gamma_1,\dots,\gamma_p\} that restore solvability are called solvability (or consistency) conditions. Naming them is what this unit does.

Theorem(The alternative for a linear system, the model case)AdaptedAdapted from Stakgold & Holst (2011), §3.4, Theorem (Fredholm Alternative) and the balanced case, pp. 207–209

Let AA be a real m×nm \times n matrix, viewed as a map Rn→Rm\mathbb{R}^n \to \mathbb{R}^m, let A∗A^* be its transpose, viewed as a map Rm→Rn\mathbb{R}^m \to \mathbb{R}^n, and use the Euclidean inner product (w,z)=∑iwizi(w,z) = \sum_i w_iz_i in each space. Then

Au=f  has a solution   ⟺  (f,v)=0  for every v with A∗v=0.Au = f \ \text{ has a solution } \iff (f,v) = 0 \ \text{ for every } v \text{ with } A^*v = 0 .

Equivalently, RAR_A, the range of AA, and NA∗N_{A^*}, the kernel of A∗A^*, are orthogonal complements of one another in Rm\mathbb{R}^m. If upu_p is one solution, every solution is up+uHu_p + u_H with AuH=0Au_H = 0, and conversely; so the solution is unique precisely when Au=0Au = 0 has only u=0u = 0.

In the balanced case m=nm = n: if det⁡A≠0\det A \ne 0 then also det⁡A∗≠0\det A^* \ne 0; neither homogeneous equation has a nonzero solution, nothing at all is imposed on ff, and Au=fAu = f is uniquely solvable whatever ff may be. If det⁡A=0\det A = 0 and AA has a kk-dimensional null space, then so does A∗A^* — though in general a different one — the solvability conditions are the kk conditions (f,v(i))=0(f,v^{(i)}) = 0 for a basis v(1),…,v(k)v^{(1)},\dots,v^{(k)} of the null space of A∗A^*, and when they hold the general solution is up+∑i=1kciu(i)u_p + \sum_{i=1}^k c_iu^{(i)} with u(1),…,u(k)u^{(1)},\dots,u^{(k)} a basis of the null space of AA.

Theorem(The Fredholm alternative for a boundary-value problem)AdaptedAdapted from Stakgold & Holst (2011), §3.4, the alternative theorem for boundary value problems (a)–(b), p. 211, and the completely inhomogeneous case with (3.4.16), p. 213

Consider first homogeneous boundary data, Lu=fLu = f with B1u=⋯=Bpu=0B_1u = \dots = B_pu = 0.

(a) Should (H) admit no nontrivial solution, the same is true of (A), and the inhomogeneous problem is then uniquely solvable — the case handled by the ordinary Green's function.

(b) If (H) has kk independent solutions, then (A) also has kk independent solutions, not necessarily the same ones. Then the problem is solvable if and only if

∫abf v(1) dx=⋯=∫abf v(k) dx=0,\int_a^b f\,v^{(1)}\,dx = \dots = \int_a^b f\,v^{(k)}\,dx = 0 ,

where v(1),…,v(k)v^{(1)},\dots,v^{(k)} are kk independent solutions of (A). When these hold, the general solution is

u=uˉ+∑i=1kci u(i),u = \bar u + \sum_{i=1}^{k}c_i\,u^{(i)} ,

with uˉ\bar u one particular solution, cic_i arbitrary constants and u(1),…,u(k)u^{(1)},\dots,u^{(k)} kk independent solutions of (H).

For inhomogeneous boundary data, Biu=γiB_iu = \gamma_i, the same pairing gives a condition that is no longer homogeneous in the data: for vv a solution of (A),

∫abf v dx=[J(u,v)]ab,\int_a^b f\,v\,dx = \Bigl[J(u,v)\Bigr]_a^b ,

and the right-hand side is completely determined by vv and the numbers γ1,…,γp\gamma_1,\dots,\gamma_p, because once vv satisfies the adjoint conditions, [J(u,v)]ab\bigl[J(u,v)\bigr]_a^b depends on uu only through B1u,…,BpuB_1u,\dots,B_pu. Stakgold and Holst write it out as γ1B2p∗v+⋯+γpBp+1∗v\gamma_1B_{2p}^*v + \dots + \gamma_pB_{p+1}^*v, where Bp+1∗,…,B2p∗B_{p+1}^*,\dots,B_{2p}^* are the complementary adjoint functionals of their §3.3, and state that this condition is sufficient as well as necessary.

If the problem is self-adjoint, (A) is (H), and the solvability condition reads: ff must be orthogonal to every solution of the homogeneous problem itself.

Note(What is proved here, and where the rest is proved)AdaptedAdapted from Stakgold & Holst (2011), §3.4, pp. 210–211; Kreyszig (1978), §8.7, Definition 8.7-1 and Theorems 8.7-2, 8.7-3, pp. 451–453; Evans (2010), §6.2.3, Theorem 4, pp. 302–303, and Appendix D.5, p. 682; Hassani (2013), §18.2, Theorem 18.2.2, p. 551

This unit proves the matrix alternative in full and proves the necessity of the solvability conditions for the boundary-value problem. The sufficiency, and the equality of the two dimensions kk, are not proved here: Stakgold and Holst defer them to their Chapter 5, where the boundary-value problem is converted into an integral equation with kernel GG and the alternative is proved for integral equations — part (a) and (b) of their alternative theorem for the equation ∫abk(x,ξ)u(ξ) dξ−u(x)=f(x)\int_a^b k(x,\xi)u(\xi)\,d\xi - u(x) = f(x), stated on p. 210. That route is the subject of integral equations and Hilbert–Schmidt theory.

The same dichotomy appears in three other guises, all beyond this unit's scope:

  • Operators. Kreyszig defines a bounded linear AA on a normed space to satisfy the Fredholm alternative when exactly one of two cases holds: (I) Ax=yAx = y and A×f=gA^\times f = g are uniquely solvable for all data, and the homogeneous equations have only the trivial solutions; or (II) the two homogeneous equations have the same finite number n≥1n \ge 1 of independent solutions, and the inhomogeneous equations are solvable exactly when the data annihilate those solutions. His Theorem 8.7-2: if TT is a compact linear operator and λ≠0\lambda \ne 0, then T−λIT - \lambda I satisfies the Fredholm alternative.
  • Integral equations. Kreyszig's Theorem 8.7-3 specialises the previous bullet to Fredholm equations of the second kind on a normed space: if the kernel makes TT compact, then T−λIT - \lambda I satisfies the alternative, so either the equation has a unique solution for every datum or the homogeneous equation has finitely many independent nontrivial solutions — with the solvability condition in the annihilation form of his case (II), since a general normed space has no inner product. Hassani's Theorem 18.2.2 is the Hilbert-space version, for a Hilbert–Schmidt KK: either λ\lambda is a regular value, or the equation is solvable exactly when the data lie in the orthogonal complement of the kernel of 1−λ∗K†1 - \lambda^*K^\dagger. In a Hilbert space the two readings coincide, every bounded functional being an inner product.
  • Elliptic partial differential equations. Evans's Theorem 4 of §6.2.3 states precisely (a)/(b) for weak solutions of a second-order elliptic Lu=fLu = f with u=0u = 0 on the boundary, including dim⁡N=dim⁡N∗\dim N = \dim N^* and the criterion (f,v)=0(f,v) = 0 for all v∈N∗v \in N^*; his proof reduces the problem to u−Ku=hu - Ku = h with KK compact and applies the compact-operator alternative of his Appendix D.5.
Definition(The modified Green's function)AdaptedAdapted from Stakgold & Holst (2011), §3.5, (3.5.1)–(3.5.7), pp. 216–217

Let (L;B1,B2)(L;B_1,B_2) be a self-adjoint second-order problem whose homogeneous problem has a one-dimensional space of solutions, spanned by a normalised u1u_1:

Lu1=0,B1u1=B2u1=0,∫abu1(x)2 dx=1.Lu_1 = 0, \quad B_1u_1 = B_2u_1 = 0, \qquad \int_a^b u_1(x)^2\,dx = 1 .

Then Lg=δ(x−ξ)Lg = \delta(x-\xi), B1g=B2g=0B_1g = B_2g = 0 is inconsistent: the solvability condition would require u1(ξ)=∫abδ(x−ξ)u1(x) dx=0u_1(\xi) = \int_a^b\delta(x-\xi)u_1(x)\,dx = 0, which fails for most ξ\xi. The nearest substitute removes exactly the offending component of the source. The modified Green's function gM(x,ξ)g_M(x,\xi) is defined by

LgM=δ(x−ξ)−u1(x)u1(ξ),B1gM=B2gM=0,Lg_M = \delta(x-\xi) - u_1(x)u_1(\xi), \qquad B_1g_M = B_2g_M = 0 ,∫abgM(x,ξ) u1(x) dx=0for every ξ∈(a,b).\int_a^b g_M(x,\xi)\,u_1(x)\,dx = 0 \quad\text{for every } \xi \in (a,b) .

The first line is a consistent problem, since the modified source is orthogonal to u1u_1 by construction. Its solutions form a one-parameter family differing by multiples of u1(x)u_1(x); the second line, the normalisation, selects one of them. Stakgold and Holst note that it is not a solvability condition but a choice, that it picks the solution of minimum norm, and that this solution turns out to be symmetric, gM(x,ξ)=gM(ξ,x)g_M(x,\xi) = g_M(\xi,x) — sufficient for symmetry but not necessary, since adding Cu1(x)u1(ξ)Cu_1(x)u_1(\xi) with CC constant keeps the symmetry and the equation while spoiling the normalisation.

Their motivating case is −u′′=f-u'' = f on 0<x<10<x<1 with u′(0)=u′(1)=0u'(0) = u'(1) = 0, an insulated rod: the solvability condition is ∫01f dx=0\int_0^1 f\,dx = 0, a concentrated unit source violates it, and compensating it by a uniform distribution of sinks of total strength 11 gives −g′′=δ(x−ξ)−1-g'' = \delta(x-\xi) - 1, with normalised solution

gM(x,ξ)=x2+ξ22−x>+13,g_M(x,\xi) = \frac{x^2+\xi^2}{2} - x_{>} + \frac13 ,

their (3.5.5).

Theorem(Solving with the modified Green's function; the pseudoinverse)AdaptedAdapted from Stakgold & Holst (2011), §3.5, (3.5.8)–(3.5.9) and the discussion (a)–(d), pp. 217–220

With (L;B1,B2)(L;B_1,B_2), u1u_1 and gMg_M as above, consider

Lu=f  (a<x<b),B1u=B2u=0.Lu = f \ \ (a<x<b), \qquad B_1u = B_2u = 0 .

(i) If the solvability condition ∫abf u1 dx=0\int_a^b f\,u_1\,dx = 0 holds, the general solution is

u(x)=C u1(x)+∫abgM(x,ξ) f(ξ) dξ,C arbitrary,u(x) = C\,u_1(x) + \int_a^b g_M(x,\xi)\,f(\xi)\,d\xi , \qquad C \text{ arbitrary} ,

and the choice C=0C = 0 gives the solution of minimum norm, because the two terms on the right are orthogonal.

(ii) If the solvability condition fails, the problem has no solution; among all uu satisfying the boundary conditions, those minimising ∥Lu−f∥\lVert Lu - f\rVert in the mean-square norm are the least-squares solutions, and among those, u=∫abgM(⋅,ξ)f(ξ) dξu = \int_a^b g_M(\cdot,\xi)f(\xi)\,d\xi is the one whose norm is smallest.

Part (i) is proved below; part (ii) is quoted, not proved here. Stakgold and Holst establish it for the single problem u′′+λku=fu'' + \lambda_ku = f on (0,1)(0,1) with u(0)=u(1)=0u(0)=u(1)=0 by expanding in the eigenfunctions sin⁡nπx\sin n\pi x: the range of LL is orthogonal to sin⁡kπx\sin k\pi x, so the element of the range nearest ff is ff with its kkth sine coefficient deleted, and gM(x,ξ)=∑n≠k2sin⁡nπξ sin⁡nπxλk−λng_M(x,\xi) = \sum_{n \ne k} \dfrac{2\sin n\pi\xi\,\sin n\pi x}{\lambda_k - \lambda_n}; they conclude from that computation that GMG_M is the pseudoinverse of D2+λkD^2+\lambda_k with those boundary conditions, and refer to their Chapter 9 for the general treatment. A proof for a general self-adjoint problem would need the half of the alternative — that orthogonality to the kernel of the adjoint is sufficient for solvability, equivalently that the range of LL is closed — which this unit does not prove either. Taken together, (i) and (ii) say that the integral operator GMG_M with kernel gMg_M inverts LL in the sense that it returns the minimum-norm solution when there is one and the minimum-norm least-squares solution when there is not: it is the pseudoinverse of LL subject to the given boundary conditions.

Idea of the proofOriginal

One picture explains the whole alternative. A linear map takes its domain onto a subspace, its range. If the range is everything, every datum is attainable and the only question left is uniqueness. If the range is a proper subspace, a datum is attainable exactly when it lies in that subspace — and the clean way to say "lies in a subspace" is "is orthogonal to everything orthogonal to it". For a matrix, what is orthogonal to the range of AA is the null space of A∗A^*, because (Au,v)=(u,A∗v)(Au,v) = (u,A^*v): a vv annihilated by A∗A^* cannot see anything AA produces. So solvability means that ff is orthogonal to the kernel of A∗A^* — and that is the alternative, in one line of inner-product algebra.

Transplanting this to a boundary-value problem needs an inner product and an adjoint. Both are supplied by Green's formula: ∫(vLu−uL∗v)=[J(u,v)]ab\int (vLu - uL^*v) = [J(u,v)]_a^b makes L∗L^* the adjoint of LL, and the adjoint boundary conditions are defined to kill the boundary term, so that ∫vLu=∫uL∗v\int vLu = \int uL^*v for admissible uu and vv. Pairing Lu=fLu=f with a solution of the homogeneous adjoint problem then gives ∫fv=∫uL∗v=0\int fv = \int uL^*v = 0 at once. That is necessity, and it is all that elementary manipulation gives; sufficiency needs compactness and is quoted.

The modified Green's function is what you build when the source you want — a delta — is not in the range. Project it: subtract its component along the null direction. The remainder is in the range, so the modified problem can be solved; and the ambiguity left (any multiple of the null solution) is fixed by demanding that the answer have no null component either. What results is exactly the pseudoinverse: invert on the range, and kill the null space.

Proof(The alternative for a linear system)AdaptedAdapted from Stakgold & Holst (2011), §3.4, proof of the Fredholm Alternative, p. 208

Write RA={Au:u∈Rn}⊆RmR_A = \{Au : u \in \mathbb{R}^n\} \subseteq \mathbb{R}^m for the range and NA∗={v:A∗v=0}⊆RmN_{A^*} = \{v : A^*v = 0\} \subseteq \mathbb{R}^m for the null space of the transpose. The identity to be used throughout is

(Au,v)m=∑i=1mvi∑j=1naijuj=∑j=1nuj∑i=1maijvi=(u,A∗v)n,(Au,v)_m = \sum_{i=1}^m v_i\sum_{j=1}^n a_{ij}u_j = \sum_{j=1}^n u_j\sum_{i=1}^m a_{ij}v_i = (u,A^*v)_n ,

obtained by exchanging the two finite sums; it says that A∗A^*, the transpose, is the adjoint.

Step 1 (necessity). Suppose Au=fAu = f for some uu, and let A∗v=0A^*v = 0. Then

(f,v)m=(Au,v)m=(u,A∗v)n=(u,0)n=0.(f,v)_m = (Au,v)_m = (u,A^*v)_n = (u,0)_n = 0 .

So every ff in the range is orthogonal to every element of NA∗N_{A^*}.

Step 2 (set up the converse). Suppose (f,v)m=0(f,v)_m = 0 for all v∈NA∗v \in N_{A^*}; we must show f∈RAf \in R_A. Since RAR_A is a subspace of the finite-dimensional space Rm\mathbb{R}^m, every vector splits uniquely as its orthogonal projection onto RAR_A plus a remainder orthogonal to RAR_A (orthogonal projection). Write

f=h+h⊥,h∈RA,h⊥⊥RA.f = h + h^{\perp}, \qquad h \in R_A, \quad h^{\perp} \perp R_A .

Step 3 (h⊥h^{\perp} lies in NA∗N_{A^*}). Being orthogonal to the whole range, h⊥h^\perp satisfies (Au,h⊥)m=0(Au,h^{\perp})_m = 0 for every u∈Rnu \in \mathbb{R}^n, so by the adjoint identity (u,A∗h⊥)n=0(u,A^*h^{\perp})_n = 0 for every uu. A vector orthogonal to every vector is zero, so A∗h⊥=0A^*h^{\perp} = 0, that is, h⊥∈NA∗h^{\perp} \in N_{A^*}.

Step 4 (the hypothesis kills h⊥h^\perp). By hypothesis f⊥NA∗f \perp N_{A^*}, and h⊥∈NA∗h^{\perp} \in N_{A^*} by Step 3, so (f,h⊥)=0(f,h^{\perp}) = 0. But h⊥h⊥h \perp h^{\perp} by construction, so

0=(f,h⊥)=(h,h⊥)+(h⊥,h⊥)=∥h⊥∥2,0 = (f,h^{\perp}) = (h,h^{\perp}) + (h^{\perp},h^{\perp}) = \lVert h^{\perp}\rVert^2 ,

whence h⊥=0h^{\perp} = 0 and f=h∈RAf = h \in R_A: the system is solvable.

Step 5 (the solution set). If Aup=fAu_p = f, then Au=fAu = f holds if and only if A(u−up)=0A(u - u_p) = 0, that is, u=up+uHu = u_p + u_H with uHu_H in the null space of AA. Hence the solution is unique exactly when that null space is {0}\{0\}, and otherwise the solutions form a translate of it. □\square

Proof(Necessity of the solvability conditions for the boundary-value problem)AdaptedAdapted from Stakgold & Holst (2011), §3.4, p. 211 and p. 213

Step 1 (pair the problem with an adjoint null solution). Let uu solve Lu=fLu = f with B1u=⋯=Bpu=0B_1u = \dots = B_pu = 0, and let vv solve the homogeneous adjoint problem (A). Form v Lu−u L∗vv\,Lu - u\,L^*v and integrate over (a,b)(a,b). On the left, Lu=fLu = f and L∗v=0L^*v = 0, so the integral is ∫abfv dx\int_a^b f v\,dx.

Step 2 (Green's formula). On the right, Green's formula turns the same integral into the boundary term:

∫abf v dx=∫ab(v Lu−u L∗v)dx=[J(u,v)]ab.\int_a^b f\,v\, dx = \int_a^b\bigl(v\,Lu - u\,L^*v\bigr)dx = \Bigl[J(u,v)\Bigr]_a^b .

Step 3 (the boundary term vanishes). uu satisfies the homogeneous boundary conditions and vv the adjoint ones. The adjoint conditions were defined to be those making [J(u,v)]ab\bigl[J(u,v)\bigr]_a^b vanish for every such uu; so the right-hand side is zero and ∫abfv dx=0\int_a^b fv\,dx = 0.

Step 4 (all kk conditions). Applying Steps 1–3 to each member of a basis v(1),…,v(k)v^{(1)},\dots,v^{(k)} of the solution space of (A) gives the kk stated conditions. They are genuine restrictions on ff only when k≥1k \ge 1; when (A) has only the trivial solution there is nothing to check, which is case (a).

Step 5 (inhomogeneous boundary data). If instead Biu=γiB_iu = \gamma_i, Steps 1 and 2 are unchanged but Step 3 fails: [J(u,v)]ab\bigl[J(u,v)\bigr]_a^b need not vanish. It is, however, determined by the data. Indeed [J(u,v)]ab\bigl[J(u,v)\bigr]_a^b is a bilinear expression in the 2p2p boundary values of uu and those of vv; with vv fixed, it is a linear functional of the boundary values of uu which, by the definition of the adjoint conditions, vanishes on the subspace where B1u=⋯=Bpu=0B_1u = \dots = B_pu = 0. A linear functional vanishing on the common kernel of B1,…,BpB_1,\dots,B_p is a linear combination of B1,…,BpB_1,\dots,B_p, so

[J(u,v)]ab=∑i=1pλi(v) Biu=∑i=1pλi(v) γi,\Bigl[J(u,v)\Bigr]_a^b = \sum_{i=1}^{p}\lambda_i(v)\,B_iu = \sum_{i=1}^p \lambda_i(v)\,\gamma_i ,

a quantity computable from vv and the given γi\gamma_i alone. This is Stakgold and Holst's (3.4.16), with λi(v)\lambda_i(v) written there in terms of their complementary adjoint functionals. Hence the necessary condition ∫abfv dx=∑iλi(v)γi\int_a^b fv\,dx = \sum_i\lambda_i(v)\gamma_i. □\square

Sufficiency is not proved here; see the note above.

Proof(The modified Green's function: consistency, and the representation)AdaptedAdapted from Stakgold & Holst (2011), §3.5, pp. 217–218

Let the problem be self-adjoint with a one-dimensional homogeneous solution space spanned by the normalised u1u_1.

Step 1 (the modified problem is consistent). Because the problem is self-adjoint, the adjoint homogeneous problem is the homogeneous problem itself, so the solvability condition for Lg=sLg = s with homogeneous boundary conditions is ∫abs u1 dx=0\int_a^b s\,u_1\,dx = 0. For the modified source s(x)=δ(x−ξ)−u1(x)u1(ξ)s(x) = \delta(x-\xi) - u_1(x)u_1(\xi),

∫ab[δ(x−ξ)−u1(x)u1(ξ)]u1(x) dx=u1(ξ)−u1(ξ)∫abu12 dx=u1(ξ)−u1(ξ)=0,\int_a^b \Bigl[\delta(x-\xi) - u_1(x)u_1(\xi)\Bigr]u_1(x)\,dx = u_1(\xi) - u_1(\xi)\int_a^b u_1^2\,dx = u_1(\xi) - u_1(\xi) = 0 ,

using the sifting property and the normalisation ∫u12=1\int u_1^2 = 1. So the modified source passes the solvability test. Concluding from this that the problem defining gMg_M really is solvable uses the sufficiency half of the alternative, which this unit quotes rather than proves (see the note above); that is the one place in this proof where something unproved is used. Granted solvability, the solutions differ by multiples of u1u_1, and the normalisation condition fixes the multiple, since ∫(gM+cu1)u1 dx=c\int (g_M + cu_1)u_1\,dx = c.

Step 2 (pair gMg_M against the solution). Let uu solve Lu=fLu = f with the homogeneous boundary conditions, which presupposes ∫fu1 dx=0\int fu_1\,dx = 0. Multiply the equation for gMg_M by uu, the equation for uu by gMg_M, subtract, and integrate in xx over (a,b)(a,b):

∫ab(u LgM−gM Lu)dx=∫abu(x)[δ(x−ξ)−u1(x)u1(ξ)]dx−∫abgM(x,ξ)f(x) dx.\int_a^b\bigl(u\,Lg_M - g_M\,Lu\bigr)dx = \int_a^b u(x)\Bigl[\delta(x-\xi) - u_1(x)u_1(\xi)\Bigr]dx - \int_a^b g_M(x,\xi)f(x)\,dx .

Step 3 (the left side vanishes). Since L∗=LL^* = L and both uu and gM(⋅,ξ)g_M(\cdot,\xi) satisfy the homogeneous boundary conditions, Green's formula makes the left-hand side the boundary term [J(u,gM)]ab\bigl[J(u,g_M)\bigr]_a^b, which is zero.

Step 4 (read off uu). Evaluating the first integral on the right by the sifting property and writing C=−∫abu u1 dxC = -\int_a^b u\,u_1\,dx, the displayed equation becomes

0=u(ξ)+C u1(ξ)−∫abgM(x,ξ)f(x) dx,0 = u(\xi) + C\,u_1(\xi) - \int_a^b g_M(x,\xi)f(x)\,dx ,

that is, u(ξ)=−Cu1(ξ)+∫abgM(x,ξ)f(x) dxu(\xi) = -Cu_1(\xi) + \int_a^b g_M(x,\xi)f(x)\,dx. Relabelling x↔ξx \leftrightarrow \xi and using the symmetry gM(x,ξ)=gM(ξ,x)g_M(x,\xi) = g_M(\xi,x) — which is a property of the normalised choice quoted from the source, whose verification Stakgold and Holst set as their Exercise 3.5.1 and which is not proved here — gives

u(x)=C′u1(x)+∫abgM(x,ξ)f(ξ) dξu(x) = C'u_1(x) + \int_a^b g_M(x,\xi)f(\xi)\,d\xi

with C′=−CC' = -C a constant. Conversely every such function solves the problem, since adding a multiple of u1u_1 changes neither LuLu nor the boundary values.

Step 5 (the choice C′=0C' = 0 is the minimum-norm solution). The integral term is orthogonal to u1u_1: by the normalisation of gMg_M and its symmetry,

∫abu1(x)∫abgM(x,ξ)f(ξ) dξ dx=∫abf(ξ)[∫abgM(x,ξ)u1(x) dx]dξ=0.\int_a^b u_1(x)\int_a^b g_M(x,\xi)f(\xi)\,d\xi\, dx = \int_a^b f(\xi)\left[\int_a^b g_M(x,\xi)u_1(x)\,dx\right]d\xi = 0 .

By the Pythagorean theorem the squared norm of uu is the sum of C′2C'^2 (since ∥u1∥=1\lVert u_1\rVert = 1) and the squared norm of the integral term, so it is least when C′=0C' = 0. □\square

Remark(Where the hypotheses are used, and what goes wrong)Original
  • The adjoint boundary conditions, not just the adjoint operator. Step 3 of the necessity proof uses Bi∗v=0B_i^*v = 0, not merely L∗v=0L^*v = 0. Taking the wrong homogeneous problem is the commonest way to get a wrong solvability condition. In Stakgold and Holst's Example 7, u′=fu' = f on (0,1)(0,1) with the two conditions u(0)=u(1)=0u(0) = u(1) = 0, the boundary term [J(u,v)]01=u(1)v(1)−u(0)v(0)\bigl[J(u,v)\bigr]_0^1 = u(1)v(1) - u(0)v(0) already vanishes for every vv, so the adjoint problem carries no boundary conditions, its solutions are the constants, and the solvability condition is ∫01f dx=0\int_0^1 f\,dx = 0 — which is also obvious by integrating the equation.
  • Self-adjointness, in the modified Green's function. Step 1 of the last proof uses L∗=LL^* = L and the equality of the two sets of boundary conditions, to know that the solvability condition is orthogonality to u1u_1 rather than to some other function v1v_1. Drop it, and the condition on the modified source s(x,ξ)s(x,\xi) is ∫abs(x,ξ)v1(x) dx=0\int_a^b s(x,\xi)v_1(x)\,dx = 0, where v1v_1 spans the solutions of the homogeneous adjoint problem. So it is the second argument that must carry v1v_1. Taking the modified source to be δ(x−ξ)−v1(x) v1(ξ)∥v1∥2\delta(x-\xi) - \frac{v_1(x)\,v_1(\xi)}{\lVert v_1\rVert^2} always works, since the subtracted term integrates against v1v_1 to exactly v1(ξ)v_1(\xi); and the normalisation ∫abgM(x,ξ)u1(x) dx=0\int_a^b g_M(x,\xi)u_1(x)\,dx = 0 (now against u1u_1, which spans the ambiguity) again selects one solution. The resulting gMg_M is not symmetric. The tempting repair u1(x)v1(ξ)/(u1,v1)u_1(x)v_1(\xi)/(u_1,v_1) is available only when (u1,v1)≠0(u_1,v_1) \ne 0, which can fail: in Stakgold and Holst's Exercise 3.5.4, L=D2L = D^2 on (0,1)(0,1) with B1u=u(0)+u(1)B_1u = u(0)+u(1) and B2u=u′(0)−u′(1)B_2u = u'(0)-u'(1), the direct homogeneous problem gives u1=3 (1−2x)u_1 = \sqrt3\,(1-2x) and the adjoint conditions v(1)=v(0)v(1) = v(0), v′(1)+v′(0)=0v'(1)+v'(0)=0 give v1=1v_1 = 1 (both normalised), and ∫01u1v1 dx=0\int_0^1 u_1v_1\,dx = 0. Subtracting v1(x)u1(ξ)v_1(x)u_1(\xi), as one might guess by analogy with the self-adjoint case, leaves ∫01[δ(x−ξ)−v1(x)u1(ξ)]v1(x) dx=1−3 (1−2ξ)\int_0^1[\delta(x-\xi) - v_1(x)u_1(\xi)]v_1(x)\,dx = 1 - \sqrt3\,(1-2\xi), nonzero for all but one ξ\xi: the modified problem would then be inconsistent, which is the very defect it was built to cure.
  • A one-dimensional null space. The definition above assumes k=1k = 1. For k≥2k \ge 2 the modified source is δ(x−ξ)−∑i=1kui(x)ui(ξ)\delta(x-\xi) - \sum_{i=1}^k u_i(x)u_i(\xi) with {ui}\{u_i\} orthonormal, and kk normalisation conditions are imposed; their Exercise 3.5.2 develops the case k=2k = 2.
  • Normalisation of u1u_1. If ∫u12≠1\int u_1^2 \ne 1 the cancellation in Step 1 fails and the modified problem is again inconsistent. The correct source is δ(x−ξ)−u1(x)u1(ξ)/∥u1∥2\delta(x-\xi) - u_1(x)u_1(\xi)/\lVert u_1\rVert^2.
  • Finite dimension, in the matrix proof. Step 2 uses that every vector splits into its projection on RAR_A and a component orthogonal to it. In infinite dimensions this needs the range to be closed, which is exactly what compactness of KK buys in the statements of Kreyszig and Evans, and exactly what fails for a general bounded operator. That is why the sufficiency half of the boundary-value alternative is not elementary.
  • Why the two dimensions agree. For an m×nm\times n matrix, rank-nullity gives dim⁡NA=n−r\dim N_A = n - r and dim⁡NA∗=m−r\dim N_{A^*} = m - r, which agree only when m=nm = n — the balanced case. The boundary-value problem is balanced in the same sense: pp conditions for a ppth-order equation. Stakgold and Holst's Remark 1 of §3.2, that a third boundary condition would usually destroy existence, is the unbalanced case showing itself.
Method(Using the alternative)AdaptedAdapted from Stakgold & Holst (2011), §3.4, pp. 211–213, and §3.5, pp. 216–218
  1. Test the homogeneous problem. Solve Lu=0Lu = 0 with the homogeneous boundary conditions. If only u≡0u \equiv 0, build the ordinary Green's function and stop.
  2. Find the adjoint problem. Compute L∗L^* and J(u,v)J(u,v) from Green's formula, impose B1u=⋯=Bpu=0B_1u = \dots = B_pu = 0, and read off the conditions on vv that make [J(u,v)]ab\bigl[J(u,v)\bigr]_a^b vanish for all such uu. For a self-adjoint problem this step is a formality: the adjoint problem is the original one.
  3. Solve the adjoint homogeneous problem for a basis v(1),…,v(k)v^{(1)},\dots,v^{(k)}.
  4. Write the solvability conditions ∫abfv(i)dx=0\int_a^b f v^{(i)}dx = 0 (homogeneous boundary data), or ∫abfv(i)dx=[J(u,v(i))]ab\int_a^b fv^{(i)}dx = \bigl[J(u,v^{(i)})\bigr]_a^b evaluated from the γ\gamma's (inhomogeneous data). Check them against the physics: they are almost always a conservation law.
  5. If they hold, the solutions form a kk-parameter family. For a self-adjoint problem with k=1k=1, normalise u1u_1, solve LgM=δ(x−ξ)−u1(x)u1(ξ)Lg_M = \delta(x-\xi) - u_1(x)u_1(\xi) with the homogeneous boundary conditions exactly as for an ordinary Green's function — the jump condition will come out automatically satisfied, leaving one free constant — and fix that constant by ∫abgMu1 dx=0\int_a^b g_Mu_1\,dx = 0. Then u=∫gMf dξu = \int g_M f\,d\xi is the minimum-norm solution, and the general one adds Cu1Cu_1.
  6. If they fail, there is no solution. The same formula u=∫gMf dξu = \int g_M f\,d\xi now returns the minimum-norm least-squares solution, which is the exact solution of the problem with ff replaced by its projection f−u1∫fu1f - u_1\int fu_1.
Example(A resonant Neumann problem with variable coefficients)Original

Take Lu=(x u′)′Lu = \bigl(x\,u'\bigr)' on 1≤x≤e1 \le x \le e with the Neumann conditions u′(1)=u′(e)=0u'(1) = u'(e) = 0.

  1. The homogeneous problem. (xu′)′=0(xu')' = 0 gives xu′=cxu' = c; the condition u′(1)=0u'(1) = 0 forces c=0c = 0, so uu is constant, and a constant satisfies both conditions. The homogeneous solution space is one-dimensional, spanned by the constants: k=1k = 1. The ordinary Green's function does not exist.
  2. Self-adjointness and the solvability condition. L=(a2u′)′+0L = (a_2u')' + 0 with a2=xa_2 = x, so LL is formally self-adjoint, and J(u,v)=x(vu′−uv′)J(u,v) = x(vu'-uv') vanishes at both endpoints when u′=v′=0u' = v' = 0 there: the adjoint problem is the same problem. Normalising, ∫1e12dx=e−1\int_1^e 1^2dx = e-1, so u1=(e−1)−1/2u_1 = (e-1)^{-1/2} and the solvability condition is ∫1ef(x) dx=0.\int_1^e f(x)\,dx = 0 . Physically: with both ends insulated there is no steady state unless the net source strength vanishes.
  3. The modified problem. With u1(x)u1(ξ)=1/(e−1)u_1(x)u_1(\xi) = 1/(e-1), (x gM′)′=δ(x−ξ)−1e−1,gM′(1,ξ)=gM′(e,ξ)=0,∫1egM(x,ξ) dx=0.\bigl(x\,g_M'\bigr)' = \delta(x-\xi) - \frac{1}{e-1}, \qquad g_M'(1,\xi) = g_M'(e,\xi) = 0, \qquad \int_1^e g_M(x,\xi)\,dx = 0 .
  4. Integrate once. Away from x=ξx=\xi, (xgM′)′=−1/(e−1)\bigl(xg_M'\bigr)' = -1/(e-1) gives x gM′=−x/(e−1)+kx\,g_M' = -x/(e-1) + k.
    • On (1,ξ)(1,\xi): gM′(1)=0g_M'(1) = 0 forces k=1/(e−1)k = 1/(e-1), so gM′=1e−1(1x−1)g_M' = \dfrac{1}{e-1}\Bigl(\dfrac1x - 1\Bigr).
    • On (ξ,e)(\xi,e): gM′(e)=0g_M'(e) = 0 forces k=e/(e−1)k = e/(e-1), so gM′=1e−1(ex−1)g_M' = \dfrac{1}{e-1}\Bigl(\dfrac{e}{x} - 1\Bigr).
  5. The jump is automatic. The jump in gM′g_M' at x=ξx = \xi is 1e−1(eξ−1ξ)=1ξ=1a2(ξ),\frac{1}{e-1}\left(\frac{e}{\xi} - \frac{1}{\xi}\right) = \frac{1}{\xi} = \frac{1}{a_2(\xi)} , exactly as required — with no constant left to adjust. This is the signature of the modified problem: four conditions have become three, and one free constant survives.
  6. Integrate again and match. Integrating, gM=ln⁡x−xe−1+Ag_M = \dfrac{\ln x - x}{e-1} + A on (1,ξ)(1,\xi) and gM=eln⁡x−xe−1+Bg_M = \dfrac{e\ln x - x}{e-1} + B on (ξ,e)(\xi,e); continuity at x=ξx = \xi gives A=B+ln⁡ξA = B + \ln\xi. Both branches then collapse into gM(x,ξ)=ln⁡x−xe−1+ln⁡x>+B(ξ),x>=max⁡(x,ξ).g_M(x,\xi) = \frac{\ln x - x}{e-1} + \ln x_{>} + B(\xi) , \qquad x_{>} = \max(x,\xi) .
  7. Normalise. ∫1eln⁡x−xe−1dx=3−e22(e−1)\int_1^e \dfrac{\ln x - x}{e-1}dx = \dfrac{3-e^2}{2(e-1)}, using ∫1eln⁡x dx=1\int_1^e\ln x\,dx = 1; and ∫1eln⁡x> dx=(ξ−1)ln⁡ξ+[xln⁡x−x]ξe=ξ−ln⁡ξ\int_1^e \ln x_{>}\,dx = (\xi-1)\ln\xi + \bigl[x\ln x - x\bigr]_{\xi}^{e} = \xi - \ln\xi. Setting the total to zero gives B(ξ)=e2−32(e−1)2+ln⁡ξ−ξe−1B(\xi) = \dfrac{e^2-3}{2(e-1)^2} + \dfrac{\ln\xi - \xi}{e-1}, hence   gM(x,ξ)=ln⁡x−xe−1+ln⁡ξ−ξe−1+ln⁡(max⁡(x,ξ))+e2−32(e−1)2  \boxed{\;g_M(x,\xi) = \frac{\ln x - x}{e-1} + \frac{\ln\xi - \xi}{e-1} + \ln\bigl(\max(x,\xi)\bigr) + \frac{e^2-3}{2(e-1)^2}\;} which is visibly symmetric in xx and ξ\xi, as the theory promises. Numerically the constant is 0.74327980.7432798.
  8. Use it. Take f(x)=1/x−1/(e−1)f(x) = 1/x - 1/(e-1), which satisfies ∫1ef=1−1=0\int_1^e f = 1 - 1 = 0. Then u(x)=∫1egM(x,ξ)f(ξ) dξ=(ln⁡x)22−xe−1+ln⁡xe−1+c,c=32(e−1)−1(e−1)2.u(x) = \int_1^e g_M(x,\xi)f(\xi)\,d\xi = \frac{(\ln x)^2}{2} - \frac{x}{e-1} + \frac{\ln x}{e-1} + c , \qquad c = \frac{3}{2(e-1)} - \frac{1}{(e-1)^2} .
  9. Check directly. Integrating (xu′)′=1/x−1/(e−1)(xu')' = 1/x - 1/(e-1) gives xu′=ln⁡x−x/(e−1)+kxu' = \ln x - x/(e-1) + k; the condition u′(1)=0u'(1) = 0 gives k=1/(e−1)k = 1/(e-1), and then xu′xu' at x=ex=e is 1−e/(e−1)+1/(e−1)=01 - e/(e-1) + 1/(e-1) = 0, so the second condition is met automatically — the solvability condition at work. A further integration reproduces item 8 up to the additive constant, and ∫1eu dx=0\int_1^e u\,dx = 0 pins that constant to the value of cc above, c=0.5342682c = 0.5342682. At x=2x = 2 the solution is u(2)=0.01393678u(2) = 0.01393678.
  10. An inconsistent source. Take instead f(x)=1/xf(x) = 1/x, for which ∫1ef=1≠0\int_1^e f = 1 \ne 0: no solution exists. But GMG_M annihilates constants, because ∫1egM(x,ξ) dξ=0\int_1^e g_M(x,\xi)\,d\xi = 0 for every xx by the normalisation and the symmetry. So GMG_M applied to 1/x1/x gives the same function as GMG_M applied to 1/x−1/(e−1)1/x - 1/(e-1), namely the uu of item 8. That function solves the problem exactly for the projected source, and is therefore the minimum-norm least-squares solution for f=1/xf = 1/x.
ApplicationOriginal

The solvability condition is almost always a conservation law in disguise, and recognising it saves a great deal of fruitless computation.

  • Insulated systems. Steady heat conduction in a rod with both ends insulated, steady diffusion in a sealed vessel, steady flow in a closed loop: in each case the homogeneous problem has the constants as solutions, and the alternative says a steady state exists only if the total source strength is zero. Stakgold and Holst make the point dynamically: with a net source, the time-dependent temperature grows without bound rather than settling. The example above is the version with a variable conductance.
  • Electrostatics with Neumann data. ∇2φ=−ρ/ε0\nabla^2\varphi = -\rho/\varepsilon_0 in a region with ∂φ/∂n\partial\varphi/\partial n prescribed on the boundary has a solution only if the prescribed normal flux integrates to the enclosed charge — Gauss's law reappearing as a solvability condition — and φ\varphi is then fixed only to within an added constant, the null direction.
  • Rigid-body modes in mechanics. A free elastic body, or a truss with no supports, has a stiffness operator whose null space is the rigid translations and rotations. The alternative says an equilibrium exists only for self-equilibrated loads — zero net force and zero net torque — and the displacement is then fixed only up to a rigid motion. Finite-element codes handle this exactly as item 10 above does: they project the load onto the range and return the minimum-norm displacement, which is the pseudoinverse solution.
  • Resonance. For u′′+λu=fu'' + \lambda u = f at an eigenvalue λ=λk\lambda = \lambda_k, the forcing must be orthogonal to the resonant mode or no steady response exists; a driven oscillator forced exactly at its natural frequency grows linearly in time instead. This is why the modified Green's function appears in perturbation theory: in the Rayleigh–Schrödinger expansion for a nondegenerate level, the first-order correction to the state is obtained by applying the reduced resolvent — the modified Green's function of H0−E0H_0 - E_0, with the unperturbed state projected out — to the perturbation, and the solvability condition is exactly the statement that E1=⟨ψ0∣V∣ψ0⟩E_1 = \langle\psi_0|V|\psi_0\rangle.
  • Numerical linear algebra. The matrix case of this unit is the theory behind least squares and the Moore–Penrose pseudoinverse: Au=fAu = f is solvable iff f⊥ker⁡ATf \perp \ker A^{\mathsf{T}}, and otherwise the normal equations ATAu=ATfA^{\mathsf{T}}Au = A^{\mathsf{T}}f return the least-squares solution, with the singular value decomposition supplying the minimum-norm one (the singular value decomposition). Discretising a resonant boundary-value problem produces a nearly singular matrix, and the modified Green's function is what the pseudoinverse converges to.

Theorem

Eigenfunction expansion of Green's functions

Adapted

Derives the bilinear series G(x,ξ;λ)=∑nun(x)un(ξ)‾/(λn−λ)G(x,\xi;\lambda) = \sum_n u_n(x)\overline{u_n(\xi)}/(\lambda_n-\lambda) for the resolvent of a regular Sturm–Liouville problem and the special case G=∑un(x)un(ξ)‾/λnG = \sum u_n(x)\overline{u_n(\xi)}/\lambda_n at λ=0\lambda=0, shows that GG is meromorphic in λ\lambda with simple poles at the eigenvalues whose residues are −un(x)un(ξ)‾-u_n(x)\overline{u_n(\xi)}, and uses that to read the whole spectrum off a closed-form Green's function.

Prerequisites: Green's function for a boundary-value problem, Eigenfunction expansions, Sturm-Liouville eigenvalue problems, Spectral theorem for Hermitian matrices, Classification of isolated singularities, The residue theorem

Definition(The regular problem, its resolvent, and the Green's function of L−λL-\lambda)AdaptedAdapted from Stakgold & Holst (2011), §7.1, (7.1.1)–(7.1.6), (7.1.12), (7.1.15), pp. 409–413; Hassani (2013), §20.4, p. 630

Let p∈C1[a,b]p \in C^1[a,b] with p>0p > 0, let qq and ss be continuous with s>0s > 0 on [a,b][a,b], and consider the formally self-adjoint expression together with its weighted inner product

Lu=−(p u′)′+q u,(f,g)s=∫abs(x) f(x) g(x)‾ dx.\mathcal{L}u = -\bigl(p\,u'\bigr)' + q\,u , \qquad (f,g)_s = \int_a^b s(x)\,f(x)\,\overline{g(x)}\,dx .

Impose unmixed boundary conditions written, as Stakgold and Holst do, with two angles α,β∈[0,π)\alpha,\beta \in [0,\pi):

Bau=u(a)cos⁡α−u′(a)sin⁡α=0,Bbu=u(b)cos⁡β+u′(b)sin⁡β=0.B_au = u(a)\cos\alpha - u'(a)\sin\alpha = 0 , \qquad B_bu = u(b)\cos\beta + u'(b)\sin\beta = 0 .

(β=0\beta = 0 is u(b)=0u(b) = 0 and β=π/2\beta = \pi/2 is u′(b)=0u'(b) = 0; likewise at aa.) The eigenvalue problem is

Lu=λ s u  (a<x<b),Bau=Bbu=0.\mathcal{L}u = \lambda\,s\,u \ \ (a<x<b), \qquad B_au = B_bu = 0 .

The Green's function of L−λs\mathcal{L} - \lambda s, also called the resolvent kernel, is the function G(x,ξ;λ)G(x,\xi;\lambda) with

−(p G′)′+q G−λ s G=δ(x−ξ)  (a<x,ξ<b),BaG=BbG=0,-\bigl(p\,G'\bigr)' + q\,G - \lambda\,s\,G = \delta(x-\xi) \ \ (a<x,\xi<b), \qquad B_aG = B_bG = 0 ,

derivatives taken in xx; this is Stakgold and Holst's (7.1.15). It is the Green's function of the previous construction applied to the operator L−λs\mathcal{L} - \lambda s, whose leading coefficient is −p-p, so the jump condition reads

∂G∂x∣ξ+−∂G∂x∣ξ−=−1p(ξ).\left.\frac{\partial G}{\partial x}\right|_{\xi^+} - \left.\frac{\partial G}{\partial x}\right|_{\xi^-} = -\frac{1}{p(\xi)} .

By the existence theorem it exists exactly when λ\lambda is not an eigenvalue, and then

w(x,λ)=∫abG(x,ξ;λ) f(ξ) dξw(x,\lambda) = \int_a^b G(x,\xi;\lambda)\,f(\xi)\,d\xi

is the unique solution of Lw−λsw=f\mathcal{L}w - \lambda s w = f with the same boundary conditions. Hassani's way of putting it: GG is the kernel of the operator (L−λ)−1(L - \lambda)^{-1}, the resolvent Rλ(L)R_\lambda(L), and GG at λ=0\lambda = 0 is the kernel of L−1L^{-1}. Write G(x,ξ)=G(x,ξ;0)G(x,\xi) = G(x,\xi;0) for that case.

Note(Facts about the spectrum used but not proved here)AdaptedAdapted from Stakgold & Holst (2011), §7.1, item 3 and (7.1.14), p. 412

For the regular problem above the following hold, and are quoted rather than proved:

  • the eigenvalues are real, simple, and can be listed as λ1<λ2<⋯→+∞\lambda_1 < \lambda_2 < \dots \to +\infty, with only finitely many negative;
  • the corresponding normalised eigenfunctions {un}\{u_n\}, with (un,um)s=δnm(u_n,u_m)_s = \delta_{nm}, form an orthonormal basis of the space with inner product (⋅,⋅)s(\cdot,\cdot)_s;
  • hence the completeness relation, valid as an identity between distributions, δ(x−ξ)s(x)=∑nun(x) un(ξ)‾,\frac{\delta(x-\xi)}{s(x)} = \sum_n u_n(x)\,\overline{u_n(\xi)} , Stakgold and Holst's (7.1.20).

Their proof converts the eigenvalue problem into the integral equation v=λKvv = \lambda Kv with the symmetric Hilbert–Schmidt kernel k(x,ξ)=s(x) g0(x,ξ)s(ξ)k(x,\xi) = \sqrt{s(x)}\,g_0(x,\xi)\sqrt{s(\xi)}, where g0g_0 is the Green's function at λ=0\lambda=0, and applies the spectral theory of self-adjoint Hilbert–Schmidt operators; the simplicity of the eigenvalues uses the unmixedness of the boundary conditions. That route is Sturm–Liouville theory and Hilbert–Schmidt theory. Note that the Green's function is used to prove the completeness that is used below to expand it; the two statements are not circular, because the expansion below assumes completeness as given.

Theorem(The bilinear expansion)AdaptedAdapted from Stakgold & Holst (2011), §7.1, (7.1.16) and (7.1.18), p. 413; Hassani (2013), §20.4, (20.42) and (20.44), pp. 631–632; Arfken, Weber & Harris (2013), §10.1, (10.14)–(10.15), p. 450; Riley, Hobson & Bence (2006), §17.5, (17.50)–(17.52), p. 570

Let λ\lambda be different from every eigenvalue. Then

  G(x,ξ;λ)  =  ∑nun(x) un(ξ)‾λn−λ  \boxed{\;G(x,\xi;\lambda) \;=\; \sum_{n} \frac{u_n(x)\,\overline{u_n(\xi)}}{\lambda_n - \lambda}\;}

the bilinear series for the resolvent kernel, and the solution of Lw−λsw=f\mathcal{L}w - \lambda sw = f with the given boundary conditions is

w(x,λ)=∑n⟨f,un⟩λn−λ un(x),⟨f,un⟩=∫abf(ξ) un(ξ)‾ dξ.w(x,\lambda) = \sum_n \frac{\langle f,u_n\rangle}{\lambda_n - \lambda}\,u_n(x) , \qquad \langle f,u_n\rangle = \int_a^b f(\xi)\,\overline{u_n(\xi)}\,d\xi .

In particular, provided 00 is not an eigenvalue,

G(x,ξ)=∑nun(x) un(ξ)‾λn,G(x,\xi) = \sum_n \frac{u_n(x)\,\overline{u_n(\xi)}}{\lambda_n} ,

which is Arfken's (10.14), Hassani's (20.44) and Riley, Hobson and Bence's (17.51). Two consequences are immediate from the form of the series:

  • Symmetry. G(x,ξ;λ)=G(ξ,x;λ‾)‾G(x,\xi;\lambda) = \overline{G(\xi,x;\overline\lambda)}; for real λ\lambda and real eigenfunctions, G(x,ξ;λ)=G(ξ,x;λ)G(x,\xi;\lambda) = G(\xi,x;\lambda). Arfken's (10.15) and Riley, Hobson and Bence's (17.52) record this, and it agrees with the reciprocity proved directly in the construction unit.
  • Where the solution is large. The coefficient of unu_n in ww carries the factor (λn−λ)−1(\lambda_n-\lambda)^{-1}, so driving the system near an eigenvalue amplifies the component of the response along that eigenfunction without limit — resonance, read off the formula.

If an eigenvalue λn\lambda_n is degenerate, the numerator becomes ∑kun(k)(x)un(k)(ξ)‾\sum_k u_n^{(k)}(x)\overline{u_n^{(k)}(\xi)}, summed over an orthonormal basis of its eigenspace, as in Hassani's (20.42). The regular problem of the definition has simple eigenvalues, so a single term suffices there.

Theorem(Poles, residues, and recovery of the spectrum)AdaptedAdapted from Stakgold & Holst (2011), §7.1, pp. 413–415, the residue statement, (7.1.19) and (7.1.22)–(7.1.25); Hassani (2013), §20.4, the residue and (20.43), p. 631

Regard G(x,ξ;λ)G(x,\xi;\lambda) as a function of the complex variable λ\lambda with x,ξx,\xi fixed.

(i) Meromorphy. GG is meromorphic in λ\lambda, with simple poles exactly at the eigenvalues λn\lambda_n, and

Res⁡λ=λnG(x,ξ;λ)=− un(x) un(ξ)‾.\operatorname*{Res}_{\lambda = \lambda_n} G(x,\xi;\lambda) = -\,u_n(x)\,\overline{u_n(\xi)} .

(ii) Closed form. Let v(⋅,λ)v(\cdot,\lambda) solve Lv=λsv\mathcal{L}v = \lambda s v with v(a,λ)=sin⁡αv(a,\lambda) = \sin\alpha, v′(a,λ)=cos⁡αv'(a,\lambda) = \cos\alpha, and let z(⋅,λ)z(\cdot,\lambda) solve the same equation with z(b,λ)=sin⁡βz(b,\lambda) = \sin\beta, z′(b,λ)=−cos⁡βz'(b,\lambda) = -\cos\beta. Then Bav=0B_av = 0, Bbz=0B_bz = 0, both are entire functions of λ\lambda, and

G(x,ξ;λ)=− v(x<,λ) z(x>,λ)C(λ),p(x) W[v,z;x]=p (vz′−zv′)=C(λ),G(x,\xi;\lambda) = -\,\frac{v(x_{<},\lambda)\,z(x_{>},\lambda)}{C(\lambda)} , \qquad p(x)\,W\bigl[v,z;x\bigr] = p\,(vz' - zv') = C(\lambda) ,

where CC, the characteristic function, is entire and independent of xx. The zeros of CC are exactly the eigenvalues, and they are simple.

(iii) Eigenfunctions from residues. Writing vn=v(⋅,λn)v_n = v(\cdot,\lambda_n), zn=z(⋅,λn)z_n = z(\cdot,\lambda_n), these are proportional, vn=knznv_n = k_nz_n with knk_n a nonzero real constant, and the normalised eigenfunction is

un(x)=± vn(x){kn C′(λn)}1/2=±{knC′(λn)}1/2zn(x),u_n(x) = \pm\,\frac{v_n(x)}{\bigl\{k_n\,C'(\lambda_n)\bigr\}^{1/2}} = \pm\left\{\frac{k_n}{C'(\lambda_n)}\right\}^{1/2}z_n(x) ,

Stakgold and Holst's (7.1.25). So a closed-form expression for GG, obtained without any knowledge of the spectrum, determines the eigenvalues as the poles and the normalised eigenfunctions from the residues — the normalisation constant included, which is the part usually computed by a separate integral.

(iv) Completeness as a contour integral. Integrating GG counterclockwise around a circle C∞C_\infty in the λ\lambda plane enclosing all the poles and summing the residues gives

12πi∮C∞G(x,ξ;λ) dλ=−∑nun(x)un(ξ)‾=−δ(x−ξ)s(x),\frac{1}{2\pi i}\oint_{C_\infty} G(x,\xi;\lambda)\,d\lambda = -\sum_n u_n(x)\overline{u_n(\xi)} = -\frac{\delta(x-\xi)}{s(x)} ,

Stakgold and Holst's (7.1.19) with (7.1.20), and Hassani's (20.43). Both authors note that the series does not converge in the ordinary sense; the identity holds in the sense of distributions. Stakgold and Holst add that for a problem with continuous spectrum the same contour formula survives with the sum replaced by an integral over a continuous parameter, because GG then has a branch cut instead of poles.

Idea of the proofOriginal

A Green's function inverts a differential operator; an orthonormal basis of eigenfunctions diagonalises it. Put the two together and the inverse must be diagonal in the same basis, with the reciprocals of the eigenvalues on the diagonal — exactly as a symmetric matrix A=∑λnenenTA = \sum\lambda_n e_ne_n^{\mathsf T} has A−1=∑λn−1enenTA^{-1} = \sum\lambda_n^{-1}e_ne_n^{\mathsf T}. The bilinear series is that identity written as a kernel, and (L−λs)−1(\mathcal{L}-\lambda s)^{-1} replaces λn\lambda_n by λn−λ\lambda_n - \lambda.

Two short routes prove it. Arfken's: expand both the unknown kernel and the delta in the basis, apply L\mathcal{L}, and compare coefficients. Stakgold's and Hassani's: pair the defining equation for GG with unu_n and use the symmetry of L\mathcal{L} to move the operator onto unu_n, which turns (L−λs)G(\mathcal{L}-\lambda s)G into (λn−λ)(\lambda_n-\lambda) times the coefficient; the delta on the other side supplies un(ξ)‾\overline{u_n(\xi)}. The second route is used below, because it needs completeness only at the last step.

The pole structure is then forced: a sum of simple poles with residues −un(x)un(ξ)‾-u_n(x)\overline{u_n(\xi)}. The surprise is that the same information can be extracted from the constructed Green's function, which knows nothing about eigenfunctions. Build GG out of two solutions normalised by initial data independent of λ\lambda; those depend analytically on λ\lambda, so all the λ\lambda-dependence of the poles sits in the one scalar C(λ)=pW[v,z]C(\lambda) = pW[v,z] in the denominator. CC vanishes exactly when vv and zz are proportional — that is, when a single function satisfies the equation and both boundary conditions, which is what an eigenfunction is. Taking the residue, the two pieces v(x<)z(x>)v(x_<)z(x_>) fuse into the symmetric product zn(x)zn(ξ)z_n(x)z_n(\xi): the kink at x=ξx=\xi leaves no trace, because at an eigenvalue the two branches are multiples of the same function.

Proof(The bilinear expansion)AdaptedAdapted from Hassani (2013), §20.4, the computation of $a_n^{(k)}(y)$, pp. 630–631; Stakgold & Holst (2011), §7.1, derivation of (7.1.16), p. 413

Fix ξ∈(a,b)\xi \in (a,b) and let λ\lambda be no eigenvalue, so that G(⋅,ξ;λ)G(\cdot,\xi;\lambda) exists.

Step 1 (expand in the basis). Since {un}\{u_n\} is an orthonormal basis for (⋅,⋅)s(\cdot,\cdot)_s and G(⋅,ξ;λ)G(\cdot,\xi;\lambda) satisfies the boundary conditions,

G(x,ξ;λ)=∑ngn(ξ,λ) un(x),gn=(G(⋅,ξ;λ), un)s=∫abs(x) G(x,ξ;λ) un(x)‾ dx.G(x,\xi;\lambda) = \sum_n g_n(\xi,\lambda)\,u_n(x), \qquad g_n = \bigl(G(\cdot,\xi;\lambda),\,u_n\bigr)_s = \int_a^b s(x)\,G(x,\xi;\lambda)\,\overline{u_n(x)}\,dx .

Step 2 (pair the defining equation with unu_n). Multiply LG−λsG=δ(⋅−ξ)\mathcal{L}G - \lambda sG = \delta(\cdot-\xi) by un(x)‾\overline{u_n(x)} and integrate over (a,b)(a,b). The right-hand side gives un(ξ)‾\overline{u_n(\xi)} by the sifting property. The left-hand side is

∫abun‾ LG dx  −  λ∫abs un‾ G dx=(LG,un) ⁣∗−λ gn,\int_a^b \overline{u_n}\,\mathcal{L}G\,dx \;-\; \lambda\int_a^b s\,\overline{u_n}\,G\,dx = \bigl(\mathcal{L}G,u_n\bigr)_{\!*} - \lambda\,g_n ,

where (LG,un) ⁣∗\bigl(\mathcal{L}G,u_n\bigr)_{\!*} denotes the unweighted integral ∫un‾ LG\int \overline{u_n}\,\mathcal{L}G.

Step 3 (move L\mathcal{L} onto the eigenfunction). For the formally self-adjoint L\mathcal{L}, Lagrange's identity gives un‾ LG−G Lun‾=[p W(G,un‾)]′\overline{u_n}\,\mathcal{L}G - G\,\overline{\mathcal{L}u_n} = \bigl[p\,W(G,\overline{u_n})\bigr]' with W(G,un‾)=G un‾′−G′ un‾W(G,\overline{u_n}) = G\,\overline{u_n}' - G'\,\overline{u_n} — directly: the two terms in qq cancel, and −un‾(pG′)′+G(pun‾′)′-\overline{u_n}(pG')' + G(p\overline{u_n}')' is the derivative of p(Gun‾′−G′un‾)p(G\overline{u_n}' - G'\overline{u_n}), the cross terms p G′un‾′p\,G'\overline{u_n}' cancelling. (This is Stakgold and Holst's (7.1.8), which carries their 1/s1/s because their LL does; multiplying by ss gives the form above.) Hence

∫ab(un‾ LG−G Lun‾)dx=[p (G un‾′−G′ un‾)]ab=0,\int_a^b\bigl(\overline{u_n}\,\mathcal{L}G - G\,\overline{\mathcal{L}u_n}\bigr)dx = \Bigl[p\,\bigl(G\,\overline{u_n}' - G'\,\overline{u_n}\bigr)\Bigr]_a^b = 0 ,

because G(⋅,ξ;λ)G(\cdot,\xi;\lambda) and unu_n both satisfy the same unmixed homogeneous conditions, which make the Wronskian vanish at each endpoint separately. Here the self-adjointness of the problem — both L∗=L\mathcal{L}^* = \mathcal{L} and the matching boundary conditions — is used. Since Lun=λnsun\mathcal{L}u_n = \lambda_n s u_n and λn\lambda_n is real,

∫abun‾ LG dx=∫abG Lun‾ dx=λn∫abs G un‾ dx=λn gn.\int_a^b \overline{u_n}\,\mathcal{L}G\,dx = \int_a^b G\,\overline{\mathcal{L}u_n}\,dx = \lambda_n\int_a^b s\,G\,\overline{u_n}\,dx = \lambda_n\,g_n .

Step 4 (solve for the coefficient). Steps 2 and 3 combine to (λn−λ)gn=un(ξ)‾\bigl(\lambda_n - \lambda\bigr)g_n = \overline{u_n(\xi)}. As λ\lambda is no eigenvalue, λn−λ≠0\lambda_n - \lambda \ne 0 and

gn(ξ,λ)=un(ξ)‾λn−λ.g_n(\xi,\lambda) = \frac{\overline{u_n(\xi)}}{\lambda_n - \lambda} .

Substituting into Step 1 gives the bilinear series.

Step 5 (the solution series). For w=∫abG(⋅,ξ;λ)f(ξ) dξw = \int_a^b G(\cdot,\xi;\lambda)f(\xi)\,d\xi, insert the series and integrate term by term:

w(x,λ)=∑nun(x)λn−λ∫abun(ξ)‾ f(ξ) dξ=∑n⟨f,un⟩λn−λ un(x).w(x,\lambda) = \sum_n \frac{u_n(x)}{\lambda_n-\lambda}\int_a^b \overline{u_n(\xi)}\,f(\xi)\,d\xi = \sum_n\frac{\langle f,u_n\rangle}{\lambda_n-\lambda}\,u_n(x) .

Step 6 (symmetry). The series displays G(x,ξ;λ)G(x,\xi;\lambda) as ∑un(x)un(ξ)‾/(λn−λ)\sum u_n(x)\overline{u_n(\xi)}/(\lambda_n-\lambda); interchanging xx and ξ\xi and conjugating sends each term to itself with λ\lambda replaced by λ‾\overline\lambda, so G(x,ξ;λ)=G(ξ,x;λ‾)‾G(x,\xi;\lambda) = \overline{G(\xi,x;\overline\lambda)}. □\square

Proof(Poles, residues and the characteristic function)AdaptedAdapted from Stakgold & Holst (2011), §7.1, pp. 413–415

Step 1 (the two entire solutions). Let v(⋅,λ)v(\cdot,\lambda) and z(⋅,λ)z(\cdot,\lambda) be as in the statement. Each is the solution of an initial-value problem whose data do not involve λ\lambda and whose equation depends on λ\lambda analytically. That vv, zz and their xx-derivatives are then entire functions of λ\lambda is quoted from Stakgold and Holst, not proved here: the argument converts the initial-value problem into a Volterra integral equation and sums its Neumann series, which converges for every complex λ\lambda, and neither the Volterra form nor the convergence of that series is among this unit's prerequisites. Everything below uses only the conclusion. The choice of initial data makes Bav=0B_av = 0 and Bbz=0B_bz = 0: for instance Bav=sin⁡αcos⁡α−cos⁡αsin⁡α=0B_av = \sin\alpha\cos\alpha - \cos\alpha\sin\alpha = 0.

Step 2 (the shape of GG). For x<ξx < \xi, GG solves the homogeneous equation and satisfies the condition at aa, so it is a multiple of vv; for x>ξx>\xi it is a multiple of zz. Continuity at x=ξx=\xi forces the common form G=A v(x<,λ)z(x>,λ)G = A\,v(x_{<},\lambda)z(x_{>},\lambda) with AA depending on ξ\xi and λ\lambda but not on xx.

Step 3 (the jump fixes AA). The jump condition is [∂G/∂x]ξ−ξ+=−1/p(ξ)\bigl[\partial G/\partial x\bigr]_{\xi^-}^{\xi^+} = -1/p(\xi), since the leading coefficient of L−λs\mathcal{L}-\lambda s is −p-p. Computing the two one-sided derivatives,

A[v(ξ,λ)z′(ξ,λ)−v′(ξ,λ)z(ξ,λ)]=−1p(ξ),A\bigl[v(\xi,\lambda)z'(\xi,\lambda) - v'(\xi,\lambda)z(\xi,\lambda)\bigr] = -\frac{1}{p(\xi)} ,

and the bracket is the Wronskian W[v,z;ξ]W[v,z;\xi]. By Abel's formula for a formally self-adjoint operator, p(x)W[v,z;x]p(x)W[v,z;x] is independent of xx; call it C(λ)C(\lambda). Then A C(λ)/p(ξ)=−1/p(ξ)A\,C(\lambda)/p(\xi) = -1/p(\xi), so A=−1/C(λ)A = -1/C(\lambda) and

G(x,ξ;λ)=−v(x<,λ) z(x>,λ)C(λ).G(x,\xi;\lambda) = -\frac{v(x_{<},\lambda)\,z(x_{>},\lambda)}{C(\lambda)} .

Being a Wronskian of entire functions times pp, CC is entire.

Step 4 (zeros of CC are the eigenvalues). If C(μ)=0C(\mu) = 0 then W[v,z;x]W[v,z;x] vanishes identically, so v(⋅,μ)v(\cdot,\mu) and z(⋅,μ)z(\cdot,\mu) are linearly dependent. Neither vanishes identically, because their initial data (sin⁡α,cos⁡α)(\sin\alpha,\cos\alpha) and (sin⁡β,−cos⁡β)(\sin\beta,-\cos\beta) are not both zero for α,β∈[0,π)\alpha,\beta \in [0,\pi). Hence v(⋅,μ)v(\cdot,\mu) is a nonzero multiple of z(⋅,μ)z(\cdot,\mu) and therefore satisfies both boundary conditions as well as the equation: μ\mu is an eigenvalue. Conversely, the bilinear series shows GG is singular at each λn\lambda_n, and the only possible source of a singularity in Step 3 is a zero of CC; so C(λn)=0C(\lambda_n) = 0. The bilinear series also shows the poles are simple, so the zeros of CC are simple.

Step 5 (the residue). Fix nn and abbreviate vn=v(⋅,λn)v_n = v(\cdot,\lambda_n), zn=z(⋅,λn)z_n = z(\cdot,\lambda_n), with vn=knznv_n = k_nz_n from Step 4. Since C(λn)=0C(\lambda_n) = 0 and C′(λn)≠0C'(\lambda_n) \ne 0,

Res⁡λ=λnG=−vn(x<) zn(x>)C′(λn)=−kn zn(x<) zn(x>)C′(λn)=−kn zn(x) zn(ξ)C′(λn),\operatorname*{Res}_{\lambda=\lambda_n} G = -\frac{v_n(x_{<})\,z_n(x_{>})}{C'(\lambda_n)} = -\frac{k_n\,z_n(x_{<})\,z_n(x_{>})}{C'(\lambda_n)} = -\frac{k_n\,z_n(x)\,z_n(\xi)}{C'(\lambda_n)} ,

the last step because zn(x<)zn(x>)=zn(x)zn(ξ)z_n(x_<)z_n(x_>) = z_n(x)z_n(\xi) whichever of x,ξx,\xi is the larger. The discontinuity of ∂G/∂x\partial G/\partial x at x=ξx=\xi has left no trace: at an eigenvalue the two branches are multiples of one and the same function.

Step 6 (identify the eigenfunction). Comparing with the residue −un(x)un(ξ)‾-u_n(x)\overline{u_n(\xi)} read off the bilinear series, and recalling that for a real problem the eigenfunctions may be taken real,

un(x)un(ξ)=kn zn(x)zn(ξ)C′(λn)for all x,ξ,u_n(x)u_n(\xi) = \frac{k_n\,z_n(x)z_n(\xi)}{C'(\lambda_n)} \quad\text{for all } x,\xi ,

so un=±{kn/C′(λn)}1/2znu_n = \pm\{k_n/C'(\lambda_n)\}^{1/2}z_n, equivalently un=±vn/{knC′(λn)}1/2u_n = \pm v_n/\{k_nC'(\lambda_n)\}^{1/2}. The sign is the usual arbitrary phase of an eigenfunction.

Step 7 (the contour integral). Let C∞C_\infty be a large circle in the λ\lambda plane enclosing all the poles. Summing residues,

12πi∮C∞G(x,ξ;λ) dλ=∑nRes⁡λnG=−∑nun(x)un(ξ)‾=−δ(x−ξ)s(x),\frac{1}{2\pi i}\oint_{C_\infty} G(x,\xi;\lambda)\,d\lambda = \sum_n\operatorname*{Res}_{\lambda_n}G = -\sum_n u_n(x)\overline{u_n(\xi)} = -\frac{\delta(x-\xi)}{s(x)} ,

by the completeness relation quoted in the note. Stakgold and Holst and Hassani both record that the last series diverges pointwise and the identity is to be read distributionally. □\square

Remark(Where the hypotheses are used, and what the series does and does not do)Original
  • λ\lambda not an eigenvalue. Used in Step 4 of the first proof to divide by λn−λ\lambda_n-\lambda, and it is also exactly the condition for GG to exist (Hassani states the equivalence explicitly). At λ=λn\lambda = \lambda_n the resolvent does not exist and its substitute is the modified Green's function, whose bilinear series is the same one with the offending term deleted.
  • Zero as an eigenvalue. The λ=0\lambda=0 series ∑unun/λn\sum u_nu_n/\lambda_n is the special case λ=0\lambda=0 and requires 0∉{λn}0 \notin\{\lambda_n\}. Arfken flags this explicitly and declines to pursue it; the insulated-rod problem of the previous unit is the standard instance.
  • Self-adjointness. Step 3 of the first proof uses both L∗=L\mathcal{L}^*=\mathcal{L} and the fact that GG and unu_n satisfy the same boundary conditions. For a non-self-adjoint problem the expansion needs the eigenfunctions of LL in one argument and those of L∗L^* in the other, and the eigenfunctions need not be complete at all.
  • Convergence. The series converges in the mean-square sense for each fixed ξ\xi, since it is the expansion of a function in an orthonormal basis. Pointwise convergence is better than that because the coefficients decay and the eigenfunctions stay bounded: for a regular problem λn∼c n2\lambda_n \sim c\,n^2 and the normalised unu_n are bounded uniformly in nn and in xx — both facts belong to Sturm–Liouville theory and are used here, not proved — so the terms are O(n−2)O(n^{-2}) uniformly and the series converges absolutely and uniformly, with GG continuous. It cannot, however, be differentiated twice term by term: the result would be the completeness relation, a distribution, not a function — which is precisely the kink at x=ξx=\xi reappearing.
  • Practical weight. Arfken is blunt that the bilinear series is of "dubious value as a computational tool": computing a few eigenfunctions and summing a slowly converging series is usually worse than solving the two-point problem in closed form. Its value is structural — symmetry, resonance, the pole picture — and in the reverse direction of part (iii), where a closed-form GG hands over the whole spectrum.
  • Where simplicity of the eigenvalues matters. Steps 5 and 6 of the second proof assume each eigenvalue has a one-dimensional eigenspace, which holds for the unmixed conditions above. With periodic conditions eigenvalues can be double, and the residue is then the sum over an orthonormal basis of the eigenspace, as in Hassani's (20.42).
Remark(Conventions)Original

Four books, four normalisations of the same object. This unit uses Stakgold and Holst's: the equation carries no weight on the delta, the weight sits in the inner product, and the solution is ∫Gf dξ\int Gf\,d\xi.

Source Eigenvalue problem Equation for GG Solution
here, Stakgold–Holst Lu=λsu\mathcal{L}u = \lambda s u (L−λs)G=δ(\mathcal{L}-\lambda s)G = \delta ∫Gf dξ\int G f\,d\xi
Arfken Lφn=λnφnL\varphi_n = \lambda_n\varphi_n LG=δLG = \delta ∫Gf dt\int Gf\,dt
Riley–Hobson–Bence Lyn=λnρ ynLy_n = \lambda_n\rho\,y_n LG=δLG = \delta ∫Gf dz\int Gf\,dz
Hassani Lxu=λuL_xu = \lambda u (Lx−λ)Gλ=δ/w(L_x-\lambda)G_\lambda = \delta/w ∫w Gf dy\int w\,Gf\,dy

All four produce the same bilinear series ∑un(x)un(ξ)‾/(λn−λ)\sum u_n(x)\overline{u_n(\xi)}/(\lambda_n-\lambda), each in its own symbols, with eigenfunctions normalised in the inner product that goes with the weight.

Two cautions, about the weight and about the sign.

The weight. Hassani's 1/w1/w on the delta does not make his kernel ours divided by ww: his (20.24) defines Lx=1wddx(pddx)+qL_x = \frac1w\frac{d}{dx}\bigl(p\frac{d}{dx}\bigr) + q, with the 1/w1/w already inside the operator, so multiplying (Lx−λ)Gλ=δ/w(L_x-\lambda)G_\lambda = \delta/w through by ww returns the same unweighted delta the other three rows carry. (Take p=1p=1, q=0q=0, w=s=2w=s=2 on (0,1)(0,1) with Dirichlet conditions at λ=0\lambda=0: ours solves −G′′=δ-G''=\delta, giving G=x<(1−x>)G = x_<(1-x_>); his solves 12 ∂x2Gλ=δ/2\tfrac12\,\partial_x^2G_\lambda = \delta/2, giving Gλ=−x<(1−x>)G_\lambda = -x_<(1-x_>). The two differ by a sign — the sign discussed next — and by nothing else; there is no factor 22 anywhere.) Where the weight really sits is on the source: his equation multiplied through by ww reads [(pu′)′+qwu−λwu]=wf\bigl[(pu')' + qwu - \lambda wu\bigr] = wf when the forcing is ff, so it is wfwf, not ff, that his representation u(x)=∫w Gλf dyu(x) = \int w\,G_\lambda f\,dy is matched to. Dropping his kernel into our integral ∫Gf dξ\int G f\,d\xi therefore loses that ww: the mistake is a factor ww in the forcing, not in the kernel.

The sign. Arfken writes LL for the self-adjoint (pu′)′+qu(pu')' + qu, whose eigenvalues decrease to −∞-\infty, whereas L=−(pu′)′+qu\mathcal{L} = -(pu')'+qu used here has eigenvalues increasing to +∞+\infty: the two spectra run in opposite directions. They are related by a plain change of sign, λnArfken=−λn\lambda_n^{\text{Arfken}} = -\lambda_n, only when q≡0q \equiv 0, for only then is (pu′)′+qu(pu')'+qu the negative of −(pu′)′+qu-(pu')'+qu; with q≠0q \ne 0 the two operators are genuinely different and the eigenvalues are not sign-flips of one another. Hassani's LxL_x of (20.24) carries Arfken's sign too, so the same caveat applies to his row.

Method(Reading the spectrum off a Green's function)AdaptedAdapted from Stakgold & Holst (2011), §7.1, pp. 413–415
  1. Build G(x,ξ;λ)G(x,\xi;\lambda) in closed form, keeping λ\lambda as a parameter: solve Lu=λsu\mathcal{L}u = \lambda su twice, once with the initial data at aa that enforce Bau=0B_au=0 and once with the data at bb that enforce Bbu=0B_bu = 0, giving v(⋅,λ)v(\cdot,\lambda) and z(⋅,λ)z(\cdot,\lambda). Use the data of part (ii) literally, (sin⁡α,cos⁡α)\bigl(\sin\alpha,\cos\alpha\bigr) at aa and (sin⁡β,−cos⁡β)\bigl(\sin\beta,-\cos\beta\bigr) at bb: they must not involve λ\lambda.
  2. Compute the characteristic function C(λ)=p (vz′−zv′)C(\lambda) = p\,(vz'-zv'), which must come out independent of xx; if it does not, the operator was not in formally self-adjoint form.
  3. Assemble G=−v(x<,λ)z(x>,λ)/C(λ)G = -v(x_{<},\lambda)z(x_{>},\lambda)/C(\lambda).
  4. Find the eigenvalues as the zeros of CC. They are the poles of GG, and for a regular problem they are real and simple. This reading depends on step 1 having been followed: if vv or zz was rescaled by a factor depending on λ\lambda — easily done when a convenient closed form is picked up instead — then CC acquires extra zeros that are not eigenvalues, as item 7 of the example shows. The check is to confirm that GG really has a pole at each candidate.
  5. Normalise the eigenfunctions by un=±vn/{knC′(λn)}1/2u_n = \pm v_n/\{k_nC'(\lambda_n)\}^{1/2}, where vn=knznv_n = k_nz_n; no separate normalisation integral is needed.
  6. Or go the other way: given the spectrum, write G(x,ξ;λ)=∑un(x)un(ξ)‾/(λn−λ)G(x,\xi;\lambda) = \sum u_n(x)\overline{u_n(\xi)}/(\lambda_n-\lambda) and w=∑⟨f,un⟩un/(λn−λ)w = \sum\langle f,u_n\rangle u_n/(\lambda_n-\lambda). Use this to locate resonances and to see which modes a given forcing excites, rather than to compute GG numerically.
Example(An Euler operator on [1,e][1,e]: closed form, series, poles and residues)Original

Take

Lu=−(x u′)′  on 1≤x≤e,u(1)=u(e)=0,s(x)=1x.\mathcal{L}u = -\bigl(x\,u'\bigr)' \ \ \text{on } 1 \le x \le e , \qquad u(1) = u(e) = 0 , \qquad s(x) = \frac1x .

So p(x)=xp(x) = x, q=0q = 0, and α=β=0\alpha = \beta = 0 in the angle notation.

  1. The substitution that trivialises it. Put t=ln⁡xt = \ln x, so x d/dx=d/dtx\,d/dx = d/dt and tt runs over [0,1][0,1]. Then (xu′)′=1xutt\bigl(xu'\bigr)' = \frac1x u_{tt} and δ(x−ξ)=δ(t−τ)/x\delta(x-\xi) = \delta(t-\tau)/x with τ=ln⁡ξ\tau = \ln\xi, so the eigenvalue problem −(xu′)′=λu/x-\bigl(xu'\bigr)' = \lambda u/x becomes −utt=λu-u_{tt} = \lambda u with u=0u = 0 at t=0,1t = 0,1.
  2. Spectrum. Hence λn=n2π2\lambda_n = n^2\pi^2 for n=1,2,…n = 1,2,\dots, with eigenfunctions sin⁡(nπt)\sin(n\pi t). Normalising in (⋅,⋅)s(\cdot,\cdot)_s: ∫1eu2 dxx=∫01u2 dt\int_1^e u^2\,\frac{dx}{x} = \int_0^1u^2\,dt, so un(x)=2 sin⁡(nπln⁡x),λn=n2π2.u_n(x) = \sqrt2\,\sin\bigl(n\pi\ln x\bigr) , \qquad \lambda_n = n^2\pi^2 .
  3. The Green's function at λ=0\lambda = 0, built without eigenfunctions. The homogeneous equation (xu′)′=0(xu')'=0 gives u=cln⁡x+du = c\ln x + d; take u1=ln⁡xu_1 = \ln x (zero at x=1x=1) and u2=ln⁡x−1u_2 = \ln x - 1 (zero at x=ex=e). Their Wronskian is W=u1u2′−u1′u2=ln⁡xx−ln⁡x−1x=1xW = u_1u_2' - u_1'u_2 = \frac{\ln x}{x} - \frac{\ln x - 1}{x} = \frac1x, and the leading coefficient of L\mathcal{L} is a2=−xa_2 = -x, so a2(ξ)W(ξ)=−1a_2(\xi)W(\xi) = -1 and G(x,ξ)=u1(x<)u2(x>)−1=ln⁡x< (1−ln⁡x>).G(x,\xi) = \frac{u_1(x_{<})u_2(x_{>})}{-1} = \ln x_{<}\,\bigl(1 - \ln x_{>}\bigr) . Checks: −(xG′)′=0-\bigl(xG'\bigr)' = 0 on each side; GG vanishes at x=1x=1 and x=ex=e; GG is continuous at x=ξx=\xi; and the jump in ∂G/∂x\partial G/\partial x there is −1ξln⁡ξ−1−ln⁡ξξ=−1ξ=−1p(ξ)-\frac{1}{\xi}\ln\xi - \frac{1-\ln\xi}{\xi} = -\frac1\xi = -\frac{1}{p(\xi)}, as required.
  4. The bilinear series. The theorem predicts ln⁡x< (1−ln⁡x>)=2π2∑n=1∞sin⁡(nπln⁡x) sin⁡(nπln⁡ξ)n2.\ln x_{<}\,\bigl(1-\ln x_{>}\bigr) = \frac{2}{\pi^2}\sum_{n=1}^{\infty}\frac{\sin(n\pi\ln x)\,\sin(n\pi\ln\xi)}{n^2} . At x=1.5x = 1.5, ξ=2\xi = 2: the left side is ln⁡1.5 (1−ln⁡2)=0.4054651×0.3068528=0.12441811\ln 1.5\,(1-\ln 2) = 0.4054651\times0.3068528 = 0.12441811; summing 40004000 terms of the right side gives 0.124418110.12441811. (At x=ξx = \xi the identity is the classical ∑n−2sin⁡2nπt=π22t(1−t)\sum n^{-2}\sin^2 n\pi t = \tfrac{\pi^2}{2}t(1-t).)
  5. Solving with it. For f(x)=1/xf(x) = 1/x, substituting τ=ln⁡ξ\tau = \ln\xi turns u(x)=∫1eG(x,ξ)f(ξ) dξu(x) = \int_1^e G(x,\xi)f(\xi)\,d\xi into ∫01t<(1−t>) dτ\int_0^1 t_{<}(1-t_{>})\,d\tau, which is 12t(1−t)\tfrac12 t(1-t); that is u(x)=12 ln⁡x (1−ln⁡x),u(2)=0.10634708.u(x) = \tfrac12\,\ln x\,\bigl(1 - \ln x\bigr) , \qquad u(2) = 0.10634708 . Direct check: −(xu′)′=−1xutt=1x=f(x)-\bigl(xu'\bigr)' = -\tfrac1x u_{tt} = \tfrac1x = f(x), and u(1)=u(e)=0u(1)=u(e)=0.
  6. The same answer as a series. Here ⟨f,un⟩=∫1e1ξ2sin⁡(nπln⁡ξ) dξ=2∫01sin⁡nπτ dτ=2 (1−(−1)n)nπ\langle f,u_n\rangle = \int_1^e \frac1\xi\sqrt2\sin(n\pi\ln\xi)\,d\xi = \sqrt2\int_0^1\sin n\pi\tau\,d\tau = \dfrac{\sqrt2\,\bigl(1-(-1)^n\bigr)}{n\pi}, so u(x)=∑n⟨f,un⟩λnun(x)=4π3∑n oddsin⁡(nπln⁡x)n3,u(x) = \sum_n\frac{\langle f,u_n\rangle}{\lambda_n}u_n(x) = \frac{4}{\pi^3}\sum_{n\ \text{odd}}\frac{\sin(n\pi\ln x)}{n^3} , and the classical sum ∑n oddn−3sin⁡nπt=π38t(1−t)\sum_{n\ \text{odd}}n^{-3}\sin n\pi t = \tfrac{\pi^3}{8}t(1-t) reproduces item 5 exactly.
  7. The resolvent and its poles. Keeping λ\lambda, the same substitution gives −gtt−λg=δ(t−τ)-g_{tt} - \lambda g = \delta(t-\tau), so with k=λk = \sqrt\lambda, G(x,ξ;λ)=sin⁡(k t<) sin⁡(k(1−t>))k sin⁡k,t=ln⁡x, τ=ln⁡ξ.G(x,\xi;\lambda) = \frac{\sin\bigl(k\,t_{<}\bigr)\,\sin\bigl(k(1-t_{>})\bigr)}{k\,\sin k} , \qquad t = \ln x,\ \tau = \ln\xi . In the language of part (ii), v=sin⁡ktv = \sin kt satisfies the condition at x=1x=1 and z=sin⁡k(1−t)z = \sin k(1-t) the one at x=ex=e. These are not the initial-value normalisations part (ii) prescribes. With α=β=0\alpha=\beta=0 those ask for v(1,λ)=0v(1,\lambda)=0, v′(1,λ)=1v'(1,\lambda)=1 and z(e,λ)=0z(e,\lambda)=0, z′(e,λ)=−1z'(e,\lambda)=-1 (primes in xx, and d/dx=1x d/dtd/dx = \frac1x\,d/dt), which give vii=sin⁡ktk,zii=ek sin⁡(k(1−t)).v_{\mathrm{ii}} = \frac{\sin kt}{k} , \qquad z_{\mathrm{ii}} = \frac{e}{k}\,\sin\bigl(k(1-t)\bigr) . The factors kk and k/ek/e relating them to v,zv,z depend on λ\lambda, not merely on scale. For GG itself and for the residues this is harmless — rescaling vv and zz rescales C=p W[v,z]C = p\,W[v,z] by the same product, and the residue formula of part (iii) is invariant under it, as item 8 will use. It is not harmless for part (i)'s reading of CC. Because p Wx[v,z]=Wt[v,z]p\,W_x[v,z] = W_t[v,z] under t=ln⁡xt=\ln x, the convenient pair gives C(λ)=−ksin⁡k,C(\lambda) = -k\sin k , whose zeros include k=nπk = n\pi, that is λ=n2π2\lambda = n^2\pi^2 — the eigenvalues, recovered without ever solving the eigenvalue problem — but also λ=0\lambda = 0, since −ksin⁡k=−λ+λ2/6−…-k\sin k = -\lambda + \lambda^2/6 - \dots has a simple zero there. That zero is spurious: λ=0\lambda = 0 is not an eigenvalue, and GG has no pole there but tends to the ln⁡x<(1−ln⁡x>)\ln x_<(1-\ln x_>) of item 3. The normalisation of part (ii) is what removes the trap, since Cii(λ)=ek2(−ksin⁡k)=−esin⁡kk⟶−e≠0as λ→0.C_{\mathrm{ii}}(\lambda) = \frac{e}{k^2}\bigl(-k\sin k\bigr) = -\frac{e\sin k}{k} \longrightarrow -e \ne 0 \quad\text{as } \lambda \to 0 . The moral for step 4 of the method: read eigenvalues off the zeros of CC only when vv and zz carry part (ii)'s λ\lambda-independent initial data; a rescaling by a function of λ\lambda can manufacture zeros that are not eigenvalues.
  8. Residues return the normalised eigenfunctions. Here the convenient pair v,zv,z of item 7 may be used together with its own C=−ksin⁡kC = -k\sin k: replacing (v,z)(v,z) by (av,bz)(av,bz) sends C↦abCC \mapsto abC, kn=vn/zn↦(a/b)knk_n = v_n/z_n \mapsto (a/b)k_n and zn↦bznz_n \mapsto bz_n, so the combination knzn(x)zn(ξ)/C′(λn)k_nz_n(x)z_n(\xi)/C'(\lambda_n) is unchanged. Now C′(λ)=−ddλ(ksin⁡k)=−sin⁡k+kcos⁡k2kC'(\lambda) = -\frac{d}{d\lambda}\bigl(k\sin k\bigr) = -\frac{\sin k + k\cos k}{2k}, which at k=nπk = n\pi is −12(−1)n-\tfrac12(-1)^n. Also zn(t)=sin⁡nπ(1−t)=−(−1)nsin⁡nπtz_n(t) = \sin n\pi(1-t) = -(-1)^n\sin n\pi t, so kn=vn/zn=−(−1)nk_n = v_n/z_n = -(-1)^n and Res⁡λ=λnG=−knzn(t)zn(τ)C′(λn)=−(−1)2nsin⁡nπt sin⁡nπτ12=−2sin⁡(nπln⁡x)sin⁡(nπln⁡ξ),\operatorname*{Res}_{\lambda=\lambda_n}G = -\frac{k_nz_n(t)z_n(\tau)}{C'(\lambda_n)} = -\frac{(-1)^{2n}\sin n\pi t\,\sin n\pi\tau}{\tfrac12} = -2\sin(n\pi\ln x)\sin(n\pi\ln\xi) , which is −un(x)un(ξ)-u_n(x)u_n(\xi), normalisation included. Numerically at x=1.5x=1.5, ξ=2\xi=2, n=2n=2: multiplying GG by λ−λ2\lambda - \lambda_2 at λ=4π2+10−6\lambda = 4\pi^2 + 10^{-6} gives 1.04866881.0486688, against the predicted −u2(1.5)u2(2)=1.0486688-u_2(1.5)u_2(2) = 1.0486688.
  9. Resonance. The solution of Lw−λsw=f\mathcal{L}w - \lambda sw = f with f=1/xf = 1/x is ∑n⟨f,un⟩un/(λn−λ)\sum_n\langle f,u_n\rangle u_n/(\lambda_n-\lambda). Only odd nn contribute, so pushing λ\lambda towards 4π24\pi^2 — an even eigenvalue — leaves ww bounded, while pushing it towards π2\pi^2 makes ww blow up along u1u_1. Whether a near-resonance is felt depends on whether the forcing overlaps the mode, which is exactly what the numerator ⟨f,un⟩\langle f,u_n\rangle records.
ApplicationOriginal
  • Reading a spectrum from a response function. Part (iii) is the mathematics behind spectroscopy in its broadest sense. A measured frequency response is a resolvent; its poles in the complex frequency plane are the natural frequencies of the system and the residues give the mode shapes together with their normalisation. Experimental modal analysis of a structure, impedance spectroscopy of a circuit, and the extraction of resonance parameters from a scattering amplitude are all this procedure. The pole--residue form ∑un(x)un(ξ)/(λn−λ)\sum u_n(x)u_n(\xi)/(\lambda_n-\lambda) is what a fitting routine fits.
  • Resonance and mode selection. The factor ⟨f,un⟩/(λn−λ)\langle f,u_n\rangle/(\lambda_n-\lambda) says that a drive excites a mode in proportion to its overlap with that mode and inversely with the detuning. An organ pipe blown at a node of a given harmonic does not sound it; a load applied at a nodal line of a plate mode does not excite it; a laser cavity tuned between two longitudinal modes couples weakly to both. Engineers use the same formula backwards, placing actuators where ⟨f,un⟩\langle f,u_n\rangle is large for the mode they want and small for the one they fear.
  • Quantum mechanics. With L=−ℏ22md2dx2+V\mathcal{L} = -\frac{\hbar^2}{2m}\frac{d^2}{dx^2} + V, the resolvent (H−E)−1(H-E)^{-1} is the energy Green's function, the bilinear series is the spectral decomposition ∑nψn(x)ψn(ξ)‾/(En−E)\sum_n\psi_n(x)\overline{\psi_n(\xi)}/(E_n-E), and the poles on the real axis are the bound-state energies with residues giving the wavefunctions. Continuing to complex EE turns a continuous spectrum into a branch cut, and resonances appear as poles on the second sheet — the continuous-spectrum version Stakgold and Holst point to. The contour formula of part (iv) is the completeness relation ∑n∣ψn⟩⟨ψn∣=1\sum_n|\psi_n\rangle\langle\psi_n| = 1 in disguise, and the same contour integral with an extra factor e−iEt/ℏe^{-iEt/\hbar} yields the propagator.
  • Heat and diffusion. Expanding the initial datum in eigenfunctions and attaching e−λnte^{-\lambda_nt} to each solves the heat equation, with the slowest mode λ1\lambda_1 controlling the long-time behaviour; a negative λ1\lambda_1 signals instability. The Green's function of the time-dependent problem is the Laplace transform of the resolvent, which is why the poles of G(⋅,⋅;λ)G(\cdot,\cdot;\lambda) are the decay rates (Green's functions for the wave and heat equations).
  • Converting to an integral equation. Because GG inverts L\mathcal{L}, the eigenvalue problem becomes u(x)=λ∫abG(x,ξ)s(ξ)u(ξ) dξu(x) = \lambda\int_a^b G(x,\xi)s(\xi)u(\xi)\,d\xi. Arfken's reason for preferring this form is that the integral operator is bounded while the differential operator is not, so stronger theorems apply; it is also the form a numerical scheme can discretise stably, since discretising GG gives a well-conditioned matrix where discretising d2/dx2d^2/dx^2 gives one whose condition number grows like the square of the mesh refinement.

Method

Causal Green's functions for initial-value problems

Adapted

Builds the retarded Green's function G(t,τ)=H(t−τ) uτ(t)G(t,\tau) = H(t-\tau)\,u_\tau(t) of a linear initial-value problem, proves that u(t)=∫atG(t,τ)f(τ) dτu(t) = \int_a^t G(t,\tau)f(\tau)\,d\tau solves it with zero initial data, specialises to the impulse response of a constant-coefficient system so that the solution becomes a convolution with transfer function G^(ω)\hat G(\omega), works the damped oscillator in full, and shows that vanishing before the impulse makes G^\hat G analytic in the upper half-plane.

Prerequisites: Green's function for a boundary-value problem, The convolution theorem, Existence and uniqueness of solutions, The Dirac delta in calculations, The damped and driven harmonic oscillator, The Fourier transform, Differentiation under the integral sign, Cauchy's integral formula, Classification of isolated singularities

Definition(Causal and advanced Green's functions)AdaptedAdapted from Stakgold & Holst (2011), §2.5, Example 10, (2.5.47)–(2.5.49), pp. 176–177, and §3.2, (3.2.11), p. 195; Arfken, Weber & Harris (2013), §10.1, pp. 452–453

Let

Lu=ap(t) u(p)+⋯+a1(t) u′+a0(t) u,Lu = a_p(t)\,u^{(p)} + \dots + a_1(t)\,u' + a_0(t)\,u ,

with continuous coefficients and ap≠0a_p \ne 0, and consider the initial-value problem

Lu=f  (t>a),u(a)=u′(a)=⋯=u(p−1)(a)=0.Lu = f \ \ (t > a), \qquad u(a) = u'(a) = \dots = u^{(p-1)}(a) = 0 .

All pp accessory conditions sit at one endpoint. The causal (or retarded) Green's function, which Stakgold and Holst call the causal fundamental solution, is the function G(t,τ)G(t,\tau) with

LG(t,τ)=δ(t−τ),G(t,τ)=0  for t<τ,LG(t,\tau) = \delta(t-\tau) , \qquad G(t,\tau) = 0 \ \text{ for } t < \tau ,

derivatives taken in tt. Unpacked as in the boundary-value construction, this says: GG solves LG=0LG = 0 on each side of τ\tau; G,∂tG,…,∂t p−2GG, \partial_tG,\dots,\partial_t^{\,p-2}G are continuous at t=τt=\tau; ∂t p−1G\partial_t^{\,p-1}G jumps there by 1/ap(τ)1/a_p(\tau); and GG vanishes to the left. Because GG is zero for t<τt<\tau and continuous up to order p−2p-2, all those derivatives vanish at τ+\tau^+ as well.

The advanced Green's function is the other one-sided choice,

LGadv(t,τ)=δ(t−τ),Gadv(t,τ)=0  for t>τ.LG_{\mathrm{adv}}(t,\tau) = \delta(t-\tau), \qquad G_{\mathrm{adv}}(t,\tau) = 0 \ \text{ for } t > \tau .

When tt is time, GG is the response at time tt to a unit impulse delivered at the earlier time τ\tau: an effect that does not precede its cause. In engineering it is the impulse response, and Stakgold and Holst use that name too. For constant coefficients GG depends only on the elapsed time, G(t,τ)=G0(t−τ)G(t,\tau) = G_0(t-\tau).

Method(Construction and the solution formula)AdaptedAdapted from Stakgold & Holst (2011), §2.5, (2.5.48)–(2.5.49), pp. 176–177; Stakgold & Holst (2011), §3.1, (3.1.9) and (3.1.13), pp. 188–190; Stakgold & Holst (2011), §3.2, (3.2.11), p. 195

Let uτu_\tau be the solution of the homogeneous initial-value problem

Luτ=0  on the whole interval where the coefficients are defined,Lu_\tau = 0 \ \ \text{on the whole interval where the coefficients are defined},uτ(τ)=uτ′(τ)=⋯=uτ(p−2)(τ)=0,uτ(p−1)(τ)=1ap(τ),u_\tau(\tau) = u_\tau'(\tau) = \dots = u_\tau^{(p-2)}(\tau) = 0, \qquad u_\tau^{(p-1)}(\tau) = \frac{1}{a_p(\tau)} ,

which exists and is unique because an initial-value problem for a linear equation with continuous coefficients and nonvanishing apa_p has exactly one solution. Following Stakgold and Holst's (3.1.10), uτu_\tau is posed on both sides of τ\tau, not only on t>τt > \tau; the advanced Green's function below needs its values for t<τt < \tau. Then:

(i) The causal Green's function exists, is unique, and is

  G(t,τ)=H(t−τ) uτ(t)  \boxed{\;G(t,\tau) = H(t-\tau)\,u_\tau(t)\;}

with HH the Heaviside step. For p=2p=2 this is G(t,τ)=H(t−τ)uτ(t)G(t,\tau) = H(t-\tau)u_\tau(t) with uτ(τ)=0u_\tau(\tau) = 0, uτ′(τ)=1/a2(τ)u_\tau'(\tau) = 1/a_2(\tau). The advanced Green's function is Gadv(t,τ)=−H(τ−t) uτ(t)G_{\mathrm{adv}}(t,\tau) = -H(\tau-t)\,u_\tau(t), and the two differ by the homogeneous solution uτu_\tau.

(ii) For ff piecewise continuous, the initial-value problem with zero initial data has the unique solution

u(t)=∫abG(t,τ) f(τ) dτ=∫atuτ(t) f(τ) dτ,u(t) = \int_a^{b} G(t,\tau)\,f(\tau)\,d\tau = \int_a^{t} u_\tau(t)\,f(\tau)\,d\tau ,

Stakgold and Holst's (3.1.9), where bb is any point with b>tb > t (the problem is posed on t>at > a, with no right-hand endpoint; bb is introduced only to make the comparison). The upper limit collapses from bb to tt because GG vanishes for τ>t\tau > t: the value of uu at time tt uses only the forcing up to time tt. Arfken's Example 10.1.2 is the instance u′′+u=fu'' + u = f, u(0)=u′(0)=0u(0) = u'(0) = 0, with G(t,τ)=sin⁡(t−τ)G(t,\tau) = \sin(t-\tau) for t>τt > \tau and 00 otherwise, and he notes that this is exactly causality.

(iii) If the coefficients are constant, then uτ(t)=v(t−τ)u_\tau(t) = v(t-\tau) with vv the solution for τ=0\tau = 0, so

u(t)=∫atv(t−τ) f(τ) dτ,u(t) = \int_a^{t} v(t-\tau)\,f(\tau)\,d\tau ,

their (3.1.13): the response is the convolution of the forcing with the impulse response.

(iv) Step response. Let F(t,τ)F(t,\tau) solve LF=H(t−τ)LF = H(t-\tau) with F=0F = 0 for t<τt<\tau. Then −∂F/∂τ=G-\partial F/\partial\tau = G, and the solution can also be written

u(t)=F(t,a) f(a)+∫atF(t,τ) f′(τ) dτ,u(t) = F(t,a)\,f(a) + \int_a^{t} F(t,\tau)\,f'(\tau)\,d\tau ,

Stakgold and Holst's (3.1.15), convenient when ff is given as a sequence of steps.

(v) No symmetry. An initial-value problem is never self-adjoint: whatever LL is, the adjoint boundary conditions move to the other endpoint, so they never coincide with the original ones (Stakgold and Holst's Example 6). Correspondingly G(t,τ)≠G(τ,t)G(t,\tau) \ne G(\tau,t) — one of them is zero whenever t≠τt \ne \tau — and the reciprocity of the self-adjoint boundary-value problem fails completely. Arfken makes the same observation.

Method(Transfer function, and what causality does to it)AdaptedAdapted from Arfken, Weber & Harris (2013), §20.5, Eqs. (20.104)–(20.106) and (20.110)–(20.113), pp. 999–1001; Arfken, Weber & Harris (2013), §12.8, Eqs. (12.116)–(12.118), pp. 591–593

Let LL have constant coefficients and let G0(t)G_0(t) be the impulse response, so LG0=δLG_0 = \delta and G0(t)=0G_0(t) = 0 for t<0t<0. Define the transfer function (or susceptibility, or frequency response) by the Fourier transform

G^(ω)=∫−∞∞G0(t) eiωt dt=∫0∞G0(t) eiωt dt.\hat G(\omega) = \int_{-\infty}^{\infty} G_0(t)\,e^{i\omega t}\,dt = \int_0^{\infty} G_0(t)\,e^{i\omega t}\,dt .

Then, with P( ⋅ )P(\,\cdot\,) the characteristic polynomial of LL, that is L=P(d/dt)L = P(d/dt),

G^(ω)=1P(−iω),\hat G(\omega) = \frac{1}{P(-i\omega)} ,

and the solution of Lu=fLu = f with zero data in the far past is the convolution u=G0∗fu = G_0 * f, equivalently u^(ω)=G^(ω) f^(ω)\hat u(\omega) = \hat G(\omega)\,\hat f(\omega) (the convolution theorem). Three consequences:

  1. Causality in the time domain. G0(t−τ)=0G_0(t-\tau) = 0 for τ>t\tau > t, so the output at time tt is built only from inputs at earlier times, u(t)=∫−∞tG0(t−τ)f(τ) dτu(t) = \int_{-\infty}^t G_0(t-\tau)f(\tau)\,d\tau. These are Arfken's Eqs. (20.105)–(20.106); he derives them by imposing that a cause precede its effect.
  2. Causality in the frequency domain. Because the integral runs only over t≥0t \ge 0, eiωte^{i\omega t} is bounded there when Im⁡ω≥0\operatorname{Im}\omega \ge 0, so G^\hat G extends to a function analytic in the upper half-plane Im⁡ω>0\operatorname{Im}\omega > 0 (assuming G0G_0 is bounded and integrable, as it is for a stable system). All the poles of G^\hat G, which are the zeros of P(−iω)P(-i\omega), lie in the closed lower half-plane. Neither cited passage of Arfken states this step: his §12.8 assumes analyticity in the upper half-plane as a hypothesis, and his §20.5 uses the opposite transform sign, which would put the analyticity in the lower half-plane. The bridge from one-sidedness to analyticity is supplied by Step 4 of the second proof below, and the sign clash is spelt out in the remark on conventions.
  3. Real and imaginary parts are not independent. Writing G^=u+iv\hat G = u + iv on the real axis and assuming G^→0\hat G \to 0 fast enough at infinity, Cauchy's formula on a contour closed in the upper half-plane gives the dispersion relations, the Hilbert-transform pair u(ω0)=1π P ⁣ ⁣∫−∞∞v(ω)ω−ω0 dω,v(ω0)=−1π P ⁣ ⁣∫−∞∞u(ω)ω−ω0 dω,u(\omega_0) = \frac{1}{\pi}\,\mathrm{P}\!\!\int_{-\infty}^{\infty}\frac{v(\omega)}{\omega-\omega_0}\,d\omega , \qquad v(\omega_0) = -\frac{1}{\pi}\,\mathrm{P}\!\!\int_{-\infty}^{\infty}\frac{u(\omega)}{\omega-\omega_0}\,d\omega , Arfken's (12.118), where P\mathrm{P} denotes the Cauchy principal value. In optics these are the Kramers–Kronig relations: refraction and absorption determine one another. Arfken attributes this pair to causality alone, which is why it constrains a response function whatever the underlying interaction happens to be; he derives the corresponding interdependence directly from the transfer function in his Eqs. (20.111)–(20.113). The derivation of the pair itself from analyticity is dispersion relations.
Idea of the proofOriginal

Think of the forcing as a line of hammer blows. A blow of strength f(τ) dτf(\tau)\,d\tau delivered at time τ\tau leaves the system, immediately afterwards, with every state variable unchanged except the highest one, which receives a kick of size f(τ)dτ/ap(τ)f(\tau)d\tau/a_p(\tau) — that is the jump condition. After that the system runs freely. So the response to one blow is uτ(t)u_\tau(t) scaled by f(τ)dτf(\tau)d\tau, and the response to all of them is the sum, which is the integral. The only reason the upper limit is tt and not bb is that blows yet to come have not been struck.

That is why the boundary-value apparatus simplifies so much here. In a boundary-value problem the two conditions sit at opposite ends and have to be met by two different branches of GG; here both conditions sit at the left end, they force the left branch to vanish identically, and the right branch is then fixed by continuity and the jump alone — with nothing left over. Stakgold and Holst put it that causality removes all arbitrariness from the fundamental solution.

For constant coefficients the system cannot tell what time it is, only how long ago the blow landed, so GG depends on t−τt-\tau and the superposition becomes a convolution. A convolution is a product after Fourier transform, and the multiplier is the transfer function. The last step is pure complex analysis: a function that is the transform of something supported on t≥0t\ge0 cannot be an arbitrary function of ω\omega — the integral still converges when ω\omega is pushed upward into the complex plane, so the transfer function is analytic in the whole upper half-plane, and analyticity ties its real and imaginary parts together.

Proof(The causal Green's function and the solution formula)AdaptedAdapted from Stakgold & Holst (2011), §2.5, Example 10, pp. 176–177, and §3.1, pp. 188–190

Take p=2p = 2 for concreteness and indicate the general case at the end; write Lu=a2u′′+a1u′+a0uL u = a_2u'' + a_1u' + a_0u.

Step 1 (the one-sided condition and the initial conditions are the same condition). The definition imposes G=0G = 0 for t<τt < \tau; what the problem imposes is instead the pp homogeneous initial conditions G(a,τ)=∂tG(a,τ)=0G(a,\tau) = \partial_tG(a,\tau) = 0 at t=at=a. On [a,τ)[a,\tau) these are equivalent. One way: G≡0G \equiv 0 there certainly satisfies them. The other way: on [a,τ)[a,\tau), GG solves LG=0LG = 0 with vanishing data at t=at=a, and by uniqueness for the initial-value problem (existence and uniqueness) the only such solution is G≡0G \equiv 0. So nothing is lost by taking either as the definition, and we may use both. This equivalence has no analogue in a boundary-value problem, and it is exactly where the two conditions being at the same end is used.

Step 2 (matching at τ\tau). Continuity of GG at t=τt=\tau forces G(τ+,τ)=0G(\tau^+,\tau) = 0. The jump condition forces ∂tG(τ+,τ)−∂tG(τ−,τ)=1/a2(τ)\partial_tG(\tau^+,\tau) - \partial_tG(\tau^-,\tau) = 1/a_2(\tau), and the second term is 00 by Step 1, so ∂tG(τ+,τ)=1/a2(τ)\partial_tG(\tau^+,\tau) = 1/a_2(\tau).

Step 3 (the right branch is uτu_\tau). For t>τt>\tau, GG solves LG=0LG = 0 with the initial data just computed at t=τt=\tau. That is exactly the problem defining uτu_\tau, which has one and only one solution. Hence G(t,τ)=uτ(t)G(t,\tau) = u_\tau(t) for t>τt>\tau and 00 for t<τt<\tau, which is H(t−τ)uτ(t)H(t-\tau)u_\tau(t). Existence and uniqueness of GG follow from existence and uniqueness for that initial-value problem.

Step 4 (the advanced solution). Put Gadv=−H(τ−t)uτ(t)G_{\mathrm{adv}} = -H(\tau-t)u_\tau(t). It solves LG=0LG=0 on each side of τ\tau, vanishes for t>τt>\tau, is continuous at τ\tau because uτ(τ)=0u_\tau(\tau)=0, and its derivative jumps there by 0−(−uτ′(τ))=1/a2(τ)0 - \bigl(-u_\tau'(\tau)\bigr) = 1/a_2(\tau). So it is the advanced Green's function, and G−Gadv=uτ(t)[H(t−τ)+H(τ−t)]=uτ(t)G - G_{\mathrm{adv}} = u_\tau(t)\bigl[H(t-\tau)+H(\tau-t)\bigr] = u_\tau(t), a solution of the homogeneous equation, as it must be.

Step 5 (the integral solves the problem). Set u(t)=∫atuτ(t)f(τ) dτu(t) = \int_a^t u_\tau(t)f(\tau)\,d\tau and differentiate, using the rule for an integral with a variable limit and a parameter in the integrand (differentiation under the integral sign); the integrand and its tt-derivatives are continuous in (t,τ)(t,\tau), which is what that rule needs. The boundary term at τ=t\tau = t involves ut(t)u_t(t), which is 00:

u′(t)=ut(t)⏟= 0f(t)+∫at∂tuτ(t) f(τ) dτ=∫at∂tuτ(t) f(τ) dτ.u'(t) = \underbrace{u_t(t)}_{=\,0}f(t) + \int_a^t \partial_tu_\tau(t)\,f(\tau)\,d\tau = \int_a^t \partial_tu_\tau(t)\,f(\tau)\,d\tau .

Step 6 (the second derivative is where the source appears). Differentiating again, the boundary term now involves ∂tuτ(t)\partial_tu_\tau(t) at τ=t\tau = t, which is 1/a2(t)1/a_2(t):

u′′(t)=f(t)a2(t)+∫at∂t2uτ(t) f(τ) dτ.u''(t) = \frac{f(t)}{a_2(t)} + \int_a^t \partial_t^2u_\tau(t)\,f(\tau)\,d\tau .

Step 7 (apply LL). Combining Steps 5 and 6,

Lu=a2(t)f(t)a2(t)+∫at[a2∂t2uτ+a1∂tuτ+a0uτ]f(τ) dτ=f(t)+∫at(Luτ)(t) f(τ) dτ=f(t),Lu = a_2(t)\frac{f(t)}{a_2(t)} + \int_a^t \Bigl[a_2\partial_t^2u_\tau + a_1\partial_tu_\tau + a_0u_\tau\Bigr]f(\tau)\,d\tau = f(t) + \int_a^t \bigl(Lu_\tau\bigr)(t)\,f(\tau)\,d\tau = f(t) ,

since Luτ=0Lu_\tau = 0. The initial conditions hold because both integrals in Steps 5 and 6 are empty at t=at = a. Uniqueness is uniqueness for the initial-value problem.

Step 8 (general order). For order pp the same computation runs with pp differentiations: the first p−1p-1 boundary terms vanish because uτ(j)(τ)=0u_\tau^{(j)}(\tau) = 0 for j≤p−2j \le p-2, and the ppth produces uτ(p−1)(t)f(t)=f(t)/ap(t)u_\tau^{(p-1)}(t)f(t) = f(t)/a_p(t), which apa_p turns into ff. Stakgold and Holst verify the same formula distributionally, pairing E=H(t−τ)uτ(t)E = H(t-\tau)u_\tau(t) against a test function and using Green's formula; every term of the resulting boundary expression vanishes except the one carrying uτ(p−1)(τ)ap(τ)=1u_\tau^{(p-1)}(\tau)a_p(\tau) = 1. □\square

Proof(Transfer function and analyticity in the upper half-plane)AdaptedAdapted from Arfken, Weber & Harris (2013), §20.5, (20.104)–(20.110), pp. 999–1000

Let the coefficients be constant, L=P(d/dt)L = P(d/dt) with P(ζ)=apζp+⋯+a0P(\zeta) = a_p\zeta^p + \dots + a_0, and let G0G_0 be the impulse response.

Step 1 (transform the defining equation). The equation LG0=δLG_0 = \delta holds in the sense of distributions, and it has to: G0G_0 is not pp times classically differentiable at t=0t = 0 — the jump in G0(p−1)G_0^{(p-1)} there is precisely what produces the delta. So the rule to use is the distributional one. For a tempered distribution gg and the convention g^(ω)=∫g(t)eiωtdt\hat g(\omega) = \int g(t)e^{i\omega t}dt, the transform of the distributional derivative is g′^=−iω g^\widehat{g'} = -i\omega\,\hat g, hence g(k)^=(−iω)kg^\widehat{g^{(k)}} = (-i\omega)^k\hat g. (No decay hypothesis enters; decay is what Step 4 will need, for a different purpose.) Transforming LG0=δLG_0 = \delta and using δ^=1\hat\delta = 1,

P(−iω) G^(ω)=1,G^(ω)=1P(−iω).P(-i\omega)\,\hat G(\omega) = 1 , \qquad \hat G(\omega) = \frac{1}{P(-i\omega)} .

Step 2 (the solution is a convolution). Transforming Lu=fLu = f the same way gives P(−iω)u^=f^P(-i\omega)\hat u = \hat f, so u^=G^f^\hat u = \hat G\hat f, and by the convolution theorem u=G0∗fu = G_0 * f, that is u(t)=∫−∞∞G0(t−τ)f(τ) dτu(t) = \int_{-\infty}^{\infty}G_0(t-\tau)f(\tau)\,d\tau.

Step 3 (causality truncates the convolution). G0(t−τ)=0G_0(t-\tau) = 0 unless τ≤t\tau \le t, so the integral runs only over τ≤t\tau \le t. Arfken runs this step in reverse, taking the vanishing of the kernel for τ>t\tau > t as the definition of a causal system.

Step 4 (analytic continuation upward). Assume the system is stable, so that G0G_0 is bounded and absolutely integrable on [0,∞)[0,\infty). For complex ω=σ+iη\omega = \sigma + i\eta with η>0\eta > 0,

∣G0(t)eiωt∣=∣G0(t)∣ e−ηt≤∣G0(t)∣(t≥0),\bigl|G_0(t)e^{i\omega t}\bigr| = \bigl|G_0(t)\bigr|\,e^{-\eta t} \le \bigl|G_0(t)\bigr| \qquad (t \ge 0) ,

so the integral ∫0∞G0(t)eiωtdt\int_0^\infty G_0(t)e^{i\omega t}dt converges absolutely and uniformly on {Im⁡ω≥0}\{\operatorname{Im}\omega \ge 0\}, and converges even better as η\eta grows. Differentiating under the integral sign (legitimate by the same uniform bound, with the extra factor tt absorbed by e−ηte^{-\eta t} for η>0\eta>0) shows G^\hat G is holomorphic there. Here the one-sidedness is everything: had G0G_0 been nonzero for t<0t<0, the factor e−ηte^{-\eta t} would have grown on that part and nothing would converge.

Step 5 (poles). By Step 1 the singularities of G^\hat G are the zeros of P(−iω)P(-i\omega), that is ω=iζj\omega = i\zeta_j where ζj\zeta_j runs over the roots of PP. Stability means every ζj\zeta_j has Re⁡ζj<0\operatorname{Re}\zeta_j < 0, hence every pole has Im⁡ω=Re⁡ζj<0\operatorname{Im}\omega = \operatorname{Re}\zeta_j < 0: all poles lie strictly below the real axis, consistent with Step 4. □\square

The passage from analyticity in the upper half-plane to the Hilbert-transform pair is Arfken's §12.8 and is not repeated here; it is dispersion relations.

Remark(Where the hypotheses are used, and what differs from the boundary-value case)Original
  • All conditions at one endpoint. Used in Step 1 of the first proof. Move one condition to the other end and the left branch no longer vanishes; one gets the two-sided Green's function of the previous units instead, and the solution at tt then depends on the forcing at later times — perfectly sensible for a steady-state problem in space, nonsense for a problem in time.
  • Zero initial data. The formula u=∫atGfu = \int_a^tGf solves the problem with u(a)=⋯=u(p−1)(a)=0u(a) = \dots = u^{(p-1)}(a) = 0. Nonzero initial data are handled by superposition: add the solution of the homogeneous equation with those data. Stakgold and Holst's Exercise 1.4.5 (pp. 89–90) writes out both pieces for mu¨+ku=fm\ddot u + ku = f with u(0)=αu(0)=\alpha, u˙(0)=β\dot u(0)=\beta.
  • ap≠0a_p \ne 0. The jump is 1/ap(τ)1/a_p(\tau), so a zero of the leading coefficient at τ\tau destroys the construction, as it does for boundary-value problems.
  • Stability, for the frequency-domain statements. Step 4 of the second proof needs G0G_0 integrable on [0,∞)[0,\infty). For an undamped oscillator, G0(t)=sin⁡ω0t/mω0G_0(t) = \sin\omega_0t/m\omega_0 does not decay, G^\hat G has poles on the real axis at ±ω0\pm\omega_0, and the transfer function exists only as a distribution. The standard repair is to give the poles a small imaginary part — add an infinitesimal damping — which is the same device as the iϵi\epsilon prescription that selects the retarded propagator in field theory.
  • Retarded versus advanced is a choice, not a theorem. Both solve LG=δLG=\delta; the differential equation does not know the arrow of time. What picks the retarded one is the physical requirement that nothing respond before it is struck. For an equation in a space variable the opposite choice may be the right one, and in scattering theory the advanced Green's function describes the time-reversed process.
  • No symmetry, no eigenfunction expansion. Because the problem is not self-adjoint (Stakgold and Holst's Example 6), G(t,τ)≠G(τ,t)G(t,\tau) \ne G(\tau,t) and the bilinear series of the previous unit does not apply. The frequency-domain representation G^(ω)=1/P(−iω)\hat G(\omega) = 1/P(-i\omega) is its replacement: the poles are still the natural frequencies, but they are complex, and their imaginary parts are decay rates rather than a discrete real spectrum.
Remark(Sign conventions in the transform)Original

This unit uses g^(ω)=∫g(t)eiωt dt\hat g(\omega) = \int g(t)e^{i\omega t}\,dt, the convention under which a causal response function is analytic in the upper half-plane and its poles lie below the real axis. It is the convention of the Kramers–Kronig literature and of Arfken's §12.8, where the dispersion relations are derived for a function analytic in the upper half-plane.

Arfken's §20.5 uses the opposite sign, φ(ω)=∫0∞Φ(t)e−iωt dt\varphi(\omega) = \int_0^\infty\Phi(t)e^{-i\omega t}\,dt (his Eq. (20.110)), under which a causal Φ\Phi makes φ\varphi analytic in the lower half-plane and the poles sit above the real axis; he notes only that the resulting constraints on the real and imaginary parts are similar to those of §12.8. Both are correct; mixing them flips the half-plane and the sign of every dispersion integral. Whenever a text asserts "causality implies analyticity in the upper half-plane", check which transform it means. The engineering alternative is the Laplace transform gˉ(s)=∫0∞g(t)e−stdt\bar g(s) = \int_0^\infty g(t)e^{-st}dt, for which causality is automatic, stability is "all poles in Re⁡s<0\operatorname{Re}s<0", and Gˉ(s)=1/P(s)\bar G(s) = 1/P(s); the substitution s=−iωs = -i\omega converts to the convention used here.

Method(Solving an initial-value problem with the causal Green's function)AdaptedAdapted from Stakgold & Holst (2011), §3.1, pp. 188–191; Arfken, Weber & Harris (2013), §10.1, pp. 452–454, and §20.5, pp. 999–1001

Given Lu=fLu = f for t>at > a with pp initial conditions at t=at=a:

  1. Split off the initial data. Write u=uh+upu = u_{\mathrm{h}} + u_{\mathrm{p}}, where uhu_{\mathrm{h}} solves Luh=0Lu_{\mathrm{h}}=0 with the given initial data and upu_{\mathrm{p}} solves Lup=fLu_{\mathrm{p}}=f with zero data. Only the second needs a Green's function.
  2. Find the impulse response. Solve Luτ=0Lu_\tau = 0 with uτ(j)(τ)=0u_\tau^{(j)}(\tau) = 0 for j≤p−2j \le p-2 and uτ(p−1)(τ)=1/ap(τ)u_\tau^{(p-1)}(\tau) = 1/a_p(\tau). For constant coefficients, solve once at τ=0\tau = 0 and translate: uτ(t)=v(t−τ)u_\tau(t) = v(t-\tau).
  3. Check the normalisation. uτ(τ)=0u_\tau(\tau)=0 and uτ′(τ)=1/a2(τ)u_\tau'(\tau)=1/a_2(\tau) for a second-order problem. Forgetting the 1/a21/a_2 is the commonest error; it rescales the whole answer.
  4. Integrate. up(t)=∫atuτ(t)f(τ) dτu_{\mathrm{p}}(t) = \displaystyle\int_a^t u_\tau(t)f(\tau)\,d\tau, or ∫atv(t−τ)f(τ) dτ\int_a^t v(t-\tau)f(\tau)\,d\tau in the constant-coefficient case. Substituting s=t−τs = t-\tau usually makes the integral easier, since the exponentials and trigonometric functions then depend on ss alone.
  5. Piecewise forcing. If ff is switched on and off, split the integral at the switching times; the Green's function itself does not change. Equivalently use the step response FF and Stakgold and Holst's form u=F(t,a)f(a)+∫atF(t,τ)f′(τ) dτu = F(t,a)f(a) + \int_a^tF(t,\tau)f'(\tau)\,d\tau, which turns a staircase forcing into a finite sum.
  6. For constant coefficients, consider the frequency domain instead. Read off G^(ω)=1/P(−iω)\hat G(\omega) = 1/P(-i\omega) with no work at all, multiply by f^\hat f, and invert — or just use G^\hat G directly to answer questions about resonance, bandwidth and phase lag, which is what it is really for.
Example(The damped oscillator under a pulse)Original

Take a mass on a spring with linear damping,

mu¨+c u˙+k u=f(t),u(0)=u˙(0)=0,m\ddot u + c\,\dot u + k\,u = f(t), \qquad u(0) = \dot u(0) = 0 ,

and the particular values m=1m = 1, c=2c = 2, k=5k = 5 (SI units throughout).

  1. Impulse response. Here a2=ma_2 = m, so uτu_\tau solves mu¨+cu˙+ku=0m\ddot u + c\dot u + ku = 0 with uτ(τ)=0u_\tau(\tau)=0, u˙τ(τ)=1/m\dot u_\tau(\tau) = 1/m. With γ=c/2m\gamma = c/2m and ωd=k/m−γ2\omega_d = \sqrt{k/m - \gamma^2} — Arfken's ω1\omega_1 in his Example 20.8.5 — the underdamped solution is G(t,τ)=H(t−τ) 1m ωd e−γ(t−τ) sin⁡[ωd(t−τ)].G(t,\tau) = H(t-\tau)\,\frac{1}{m\,\omega_d}\,e^{-\gamma(t-\tau)}\,\sin\bigl[\omega_d(t-\tau)\bigr] . Check of the normalisation: at t=τt = \tau the value is 00, and the tt-derivative there is 1mωd⋅ωd=1m\frac{1}{m\omega_d}\cdot\omega_d = \frac1m, as required.
  2. Numbers. γ=1\gamma = 1, k/m=5k/m = 5, ωd=5−1=2\omega_d = \sqrt{5-1} = 2, so G(t,τ)=12 e−(t−τ)sin⁡[2(t−τ)](t>τ).G(t,\tau) = \tfrac12\,e^{-(t-\tau)}\sin\bigl[2(t-\tau)\bigr] \quad (t>\tau) .
  3. A rectangular pulse. Let f(t)=1f(t) = 1 for 0≤t≤10 \le t \le 1 and f(t)=0f(t) = 0 afterwards. Substituting s=t−τs = t-\tau and using ∫e−ssin⁡2s ds=−15e−s(sin⁡2s+2cos⁡2s)\int e^{-s}\sin 2s\,ds = -\tfrac15e^{-s}\bigl(\sin 2s + 2\cos 2s\bigr), which is checked by differentiating, u(t)=12∫0te−ssin⁡2s ds=15−e−t(sin⁡2t+2cos⁡2t)10(0≤t≤1),u(t) = \tfrac12\int_0^{t}e^{-s}\sin 2s\,ds = \frac15 - \frac{e^{-t}\bigl(\sin 2t + 2\cos 2t\bigr)}{10} \qquad (0 \le t \le 1) , u(t)=12∫t−1te−ssin⁡2s ds=e−(t−1)(sin⁡2(t−1)+2cos⁡2(t−1))−e−t(sin⁡2t+2cos⁡2t)10(t≥1).u(t) = \tfrac12\int_{t-1}^{t}e^{-s}\sin 2s\,ds = \frac{e^{-(t-1)}\bigl(\sin 2(t-1) + 2\cos 2(t-1)\bigr) - e^{-t}\bigl(\sin 2t + 2\cos 2t\bigr)}{10} \qquad (t \ge 1) .
  4. Checkable numbers. u(1)=15−e−1(sin⁡2+2cos⁡2)/10=0.19716719u(1) = \tfrac15 - e^{-1}(\sin 2 + 2\cos 2)/10 = 0.19716719, and u(3)=−0.03610410u(3) = -0.03610410. Integrating the differential equation numerically from t=0t=0 to t=3t=3 with the same pulse reproduces both to eight decimal places. The sign of u(3)u(3) is the system ringing back through zero after the push stops.
  5. Sanity at the two ends. For small tt, expanding the first formula gives u(t)=12t2−13t3+O(t4)u(t) = \tfrac12t^2 - \tfrac13t^3+O(t^4): initial acceleration f/m=1f/m = 1, exactly as Newton requires, with the damping entering only at third order. If instead the pulse never ended, u→1/5=f/ku \to 1/5 = f/k, the static deflection.
  6. Transfer function. With G^(ω)=1/P(−iω)\hat G(\omega) = 1/P(-i\omega) and P(ζ)=mζ2+cζ+kP(\zeta) = m\zeta^2 + c\zeta + k, G^(ω)=1k−mω2−icω=15−ω2−2iω.\hat G(\omega) = \frac{1}{k - m\omega^2 - ic\omega} = \frac{1}{5-\omega^2-2i\omega} . Its poles are the roots of ω2+2iω−5=0\omega^2 + 2i\omega - 5 = 0, that is ω=±2−i\omega = \pm 2 - i: both strictly in the lower half-plane, so G^\hat G is analytic in the upper half-plane, as causality demands. Their real parts ±ωd=±2\pm\omega_d = \pm2 are the ringing frequency, their common imaginary part −γ=−1-\gamma = -1 the decay rate.
  7. Resonance from the formula. ∣G^(ω)∣2=[(k−mω2)2+c2ω2]−1|\hat G(\omega)|^2 = \bigl[(k-m\omega^2)^2 + c^2\omega^2\bigr]^{-1} is largest at ω2=k/m−2γ2=3\omega^2 = k/m - 2\gamma^2 = 3. There the bracket is c2ωd2=16c^2\omega_d^2 = 16, so ∣G^∣2=1/(c ωd)2=1/16=0.0625|\hat G|^2 = 1/(c\,\omega_d)^2 = 1/16 = 0.0625 and the amplitude itself is ∣G^∣=1/(c ωd)=1/4|\hat G| = 1/(c\,\omega_d) = 1/4. (A numerical scan of ∣5−ω2−2iω∣−2|5-\omega^2-2i\omega|^{-2} in steps of 10−310^{-3} peaks at ω=1.732\omega = 1.732 with value 0.06250.0625.) So the peak response is at ω=3=1.7320508\omega = \sqrt3 = 1.7320508, slightly below the ringing frequency ωd=2\omega_d = 2 and further below the undamped ω0=5=2.2360680\omega_0 = \sqrt5 = 2.2360680 — three distinct "resonant frequencies" that coincide only when the damping vanishes. At zero frequency G^(0)=1/k=0.2\hat G(0) = 1/k = 0.2, the static compliance of item 5, and this also equals ∫0∞G0(t) dt\int_0^\infty G_0(t)\,dt.
  8. Advanced solution, for contrast. Gadv(t,τ)=−12e−(t−τ)sin⁡[2(t−τ)]G_{\mathrm{adv}}(t,\tau) = -\tfrac12e^{-(t-\tau)}\sin[2(t-\tau)] for t<τt<\tau and 00 for t>τt>\tau also satisfies LG=δ(t−τ)LG = \delta(t-\tau). Used in place of GG it would predict a mass that begins oscillating — with exponentially growing amplitude as one runs backwards — before the hammer strikes. The mathematics permits it; physics does not.
ApplicationOriginal

The causal Green's function is the impulse response, and essentially every linear time-invariant system is specified by it.

  • Mechanical and electrical systems. The damped oscillator above is simultaneously a mass–spring–dashpot, a series RLCRLC circuit with L,R,1/CL,R,1/C in place of m,c,km,c,k — Arfken's "RLCRLC Analog" of p. 1022 — a galvanometer, and an accelerometer. Its transfer function is the complex impedance or compliance, and the pole locations are what a control engineer moves to tune a response. Riley, Hobson and Bence obtain the impulse response of the first-order system Tx˙+x=δ(t)T\dot x + x = \delta(t) both as a limit of rectangular pulses of shrinking width and directly by Laplace transform, which is the simplest instance of the whole scheme.
  • Signal processing. A filter is the convolution operator u=G0∗fu = G_0 * f; its frequency response is G^\hat G. Arfken's high-pass filter with φ(ω)=iωRC/(1+iωRC)\varphi(\omega) = i\omega RC/(1+i\omega RC) is one line of circuit analysis away from the general theory. Causality is the reason an ideal brick-wall filter is unrealisable: a frequency response that is exactly zero on an interval cannot come from a function analytic in a half-plane, so a real filter must trade sharpness against phase distortion and pre-ringing.
  • Response theory in physics. In linear response, the perturbation ff is an applied field and G0G_0 is the retarded correlation function; G^\hat G is the generalised susceptibility — electric polarisability, magnetic susceptibility, dielectric function, conductivity. Causality forces it to be analytic in the upper half-plane, hence the Kramers–Kronig relations: measure absorption across the whole spectrum and the refractive index follows, and vice versa. This is the standard way optical constants are extracted from reflectivity data, and the same logic constrains scattering amplitudes in particle physics.
  • Field theory and electromagnetism. The retarded Green's function of the wave operator gives the Liénard–Wiechert potentials: the field at (r,t)(\mathbf{r},t) depends on the source at the retarded time t−∣r−r′∣/ct - |\mathbf{r}-\mathbf{r}'|/c. The choice of retarded over advanced is the same choice made in item 8 above, and the iϵi\epsilon prescription that implements it is the shift of poles described in the remarks (Green's functions for the wave and heat equations).
  • Numerics and identification. Duhamel's formula of part (iv) is the basis of step-response methods in structural dynamics and in control: excite with a step, record FF, and every other input is handled by one integral against f′f'. Conversely, measuring the response to an approximate impulse — a hammer tap, a chirp, a pseudorandom sequence — and deconvolving gives G0G_0 experimentally, which is system identification.