Phil Lucht Math & Physics Archive
Home / Math and Physics Files / Math / Sneddon

Hankel and Modified Hankel Transforms, as per Sneddon

DOCX · 40.0 KB
Open DOCX file

Working notes by Phil dated 7.27.10, resuming Sneddon at page 29. They write the Hankel transform as a self-inverse operator Cν, explain the curly-bracket notation with dummy arguments and operator products, and rescale to a symmetric kernel Kν with (xμ)^1/2. They then begin Sneddon's modified Hankel transform Sη,α. Equations are partly garbled in the extracted text, and only the first part was seen.

AI-written summary; may contain errors. This description is approximate.

Extracted text (machine-read; may contain errors)
Hankel and Modified Hankel Transforms, as per Sneddon PhL 7.27.10 Resuming Sneddon on page 29: the Hankel stuff 1. The Regular Hankel transform and its usual matrix operator notation. In my transforms.doc, I write it this way: Fν(μ) = !Syntax Error, Idx xJν(μx) f(x) f(x) = !Syntax Error, Idμ μJν(μx) Fν(μ) One can define a kernel Cν that works in both directions like so: [ note that ν is just a fixed label. I put it on C because I have put it on F and want to be consistent.] Fν(μ) = !Syntax Error, Idx xJν(μx) f(x) f(x) = !Syntax Error, Idμ μJν(μx) Fν(μ) Fν(μ) = !Syntax Error, Idx Cν(μ,x) f(x) f(x) = !Syntax Error, Idμ Cν(x,μ) Fν(μ) Cν(μ,x) = xJν(μx) Cν(x,μ) = μJν(μx) Fν = Cνf f = CνF ν Cν2 = 1 Cν = Cν-1 The operator Cν has lots of nice properties as you see, but it is missing one property, namely Cν ≠ CνT ie Cν(μ,x) = xJν(μx) ≠ μJν(μx)= Cν(x,μ) which is to say, this kernel is not symmetric. I know from Stak Ch 3 that you WANT kernels to be symmetric if possible because then lots of "theory" becomes nice. Recall from Chap 3 meta meta: 3.3 The Spectrum of a self-adjoint H-S operator. (p 212) If the kernel k(x,y) is symmetric, then the operator K is self-adjoint (as well as symmetric). In this case the following facts are true: (but the last two items also require that K be HS. ) (1) The eigenvalues of K are all real (2) the EF's of different EV's are orthogonal (3) the multiplicity of any non-zero EV μ is finite. (4) if number of EV's is ∞, then μ=0 is the only possible limit point. These "facts" refer to the spectrum of the operator K being "nice" when K is symmetric. In a later section below we will come up with a "symmetric version" of our Hankel Transform, but first we want to work on notation which is a little treacherous. 2. The Regular Hankel using {...} notation; why this notation is useful. We could use the following alternate notation for the above transform: Fν = Cνf f = CνF ν Fν(μ) = Cν{f(x); μ} f(x) = Cν{Fν(μ);x } The first line shows the usual matrix notation where we think of Fν and f as "vectors" and we think of the operator Cν as a "matrix", both of infinite dimension. Remember ν is not an index on a vector, it is just a label, and we could write it as F(ν)(μ) perhaps to better show this, but that is too much work. The second line needs some comment. The curly bracket has two arguments. The first argument is a function. The argument of this function is a dummy argument! The second argument in {...} is the variable of the function we are talking about, which appears on the LHS. The purpose of the dummy argument is to allow us to write out a function that does not have a name. Suppose we had instead this notation Fν(μ) = Cν{f; μ} and suppose f(x) = x2. The function "x2" has no name, so our notation cannot handle it! We could have to write something like Fν(μ) = Cν{the squared function; μ} But using the dummy argument notation we can say Fν(μ) = Cν{f(x); μ}= Cν{f(s); μ}= Cν{f(z); μ} Fν(μ) = Cν{x2; μ} = Cν{s2; μ} = Cν{z2; μ} where we emphasize that the name given to the dummy argument is irrelevant. We just have to have some name for this variable so we can express a nameless function! How do you handle a product of two functions? So we restate from above Fν = Cνf f = CνF ν Fν(μ) = Cν{f(x); μ} f(x) = Cν{Fν(μ);x } Now suppose we have f(x) = a(x) b(x). How would we write things out in our purely matrix notation? We cannot say f = ab where a,b,f are all vectors because such a notation has no meaning in a matrix and vectors sense. Thus you cannot say Fν = Cνab ab = CνFν because that means nothing. We could perhaps invent a notation f = a#b => f(x) = a(x) b(x) and then say Fν = Cνa#b a#b = CνFν We hesitate to use the notation a*b because this usually means a convolution thing. Recall from Stak Ch 5 notes Using symbolic functions, we can say (f1*f2)(x) = h(x) = ∫f1(x-y)f2(y) dy = ∫f2(x-y)f1(y) dy where we see the usual "convolution integral" h(g1) = ∫dg f1(g) f2(g1g-1) in group notation. The notation axb is really reserved to mean a direct product thing. That is to say, this notion of f(x) = a(x) b(x) is more f = a b, a direct product thing, where fxy = axby and then fxx = axbx = a(x)b(x). But "f" is then really a matrix, and the function f(x) is the diagonal of the matrix "f" . Sometimes people might say [ab](x) = [a](b(x)) = a(b(x)), but that is certainly not what we are dealing with here. So we might consider plowing ahead with our invented notation f = a#b to mean f(x) = a(x) b(x) . But then suppose one of our two product functions has no name. Suppose f(x) = x2 b(x). Then we are back to saying f = (the squared function) # b which is pretty unsightly. On the other hand, f(x) = a(x) b(x) is a perfectly fine function, so there is no confusion about the matrix meaning of something like Fν = Cνf. So our problem here is that our compact notation simply cannot handle the situation! This is where the {...} notation does well. We can simply write Fν(μ) = Cν{f(s); μ} f(x) = Cν{Fν(r);x } Fν(μ) = Cν{a(s)b(s); μ} a(x)b(x) = Cν{Fν(r);x } where here I make sure to display oddball dummy parameters like r and s which have nothing at all to do with the arguments μ and x. If one (or both) of the functions has no name, we again have no problem with the {...} notation Fν(μ) = Cν{s2b(s); μ} x2b(x) = Cν{Fν(r);x } Fν(μ) = Cν{s2ln(s); μ} x2ln(x) = Cν{Fν(r);x } How does the {...} notation deal with matrix products? So we like this {...} notation for the above applications. But then how do we express something like matrix multiplication (product of operators) using the {...} notation. Recall for example that we had Cν2 = 1 Cν = Cν-1 Let's start with Cν2 = 1 and apply this to a vector Cν2f = 1f = f Cν2{f(s); μ} = f(μ) But we might write things like this Cν[Cνf] = f Cν{ [Cνf](s) ; μ} = f(μ) // where [Cνf](s) is a function of s, call it g(s) But we know that g(s) = [Cνf](s) = Cν{ f(r); s } so we can combine these to get Cν{ Cν{ f(r); s } ; μ} = f(μ) Now both r and s are dummy variables and it helps I think to have them be different to avoid confusion. So we have now done this elaboration: Cν2 = 1 Cν2f = f Cν{ Cν{ f(r); s } ; μ} = f(μ) and we can go on to write these using Cν = Cν-1 in the following manners Cν-1{ Cν{ f(r); s } ; μ} = f(μ) Cν-1Cν = 1 Cν{ Cν-1{ f(r); s } ; μ} = f(μ) and we could invent an identity operator which says 1 { f(r); s } = f(s) More generally, here is how you "compose" matrix products in the {...} notation: A f = BC f A{ f(r); μ } = B{ C { f(r); s } ; μ} A f = BCD f A{ f(r); μ } = B{ C { D { f(t); r }; s } ; μ} where t,r,s are all dummy variables. More systematically we might write B f = A1A2A3 f B{ f(r); μ } = A1{ A2 { A3 { f(x3); x2 }; x1 } ; μ} where now the xi are the dummy variables. It seems clear how to extend this to an arbitrary product. Now as a quick exercise, let's apply A1-1 to the last equation: A1-1B f = A1-1A1A2A3 f = A2A3 f A1-1{ B{ f(r); s } ; μ } = A1-1{A1{ A2 { A3 { f(x3); x2 }; x1 } ; s}; μ} = A1-1{A1{q(s) ; μ} where q(s) = A2 { A3 { f(x3); x2 }; x1 } ; s} = q(μ) // from above that Cν-1{ Cν{ f(r); s } ; μ} = f(μ) = A2 { A3 { f(x3); x2 }; x1 } ; μ} So to summarize, A1-1B f = A2A3 f A1-1{ B{ f(r); s } ; μ } = A2 { A3 { f(x3); x2 }; x1 } ; μ} Finally, we would like to have some definition of or rule for the product of script operators. Suppose we have ABf = g A{ B{ f(r); s } ; μ} = g(μ) Let's now define the product of script operators like this: AB { f(r); μ} ≡ A{ B{ f(r); s } ; μ} (AB)f = A (Bf) Then for example we would have A{ B{ f(r); s } ; μ} = AB { f(r); μ} A{ A-1{ f(r); s } ; μ} = A A-1 { f(r); μ} = 1 { f(r); μ } = f(μ) So now we have a perfectly streetable meaning for both these products C = AB C = AB 3. The Symmetric Regular Hankel Transform In my transforms.doc, I write it this way: Fν(μ) = !Syntax Error, Idx xJν(μx) f(x) f(x) = !Syntax Error, Idμ μJν(μx) Fν(μ) But recall that you can rescale things so this transform looks instead like this: Gν(μ) = !Syntax Error, Idx (xμ)1/2Jν(μx)g(x) g(x) = !Syntax Error, Idμ (xμ)1/2Jν(μx) Gν(μ) 2.1.23 The required scaling is seen to be x f(x) = x1/2g(x) and Gν(μ) = μ1/2 Fν(μ) which is to say g(x) = x1/2 f(x) Gν(μ) = μ1/2 Fν(μ) Let's verify this to make sure no errors. Start with the second pair and insert: Gν(μ) = !Syntax Error, Idx (xμ)1/2Jν(μx)g(x) g(x) = !Syntax Error, Idμ (xμ)1/2Jν(μx) Gν(μ) μ1/2 Fν(μ) = !Syntax Error, Idx (xμ)1/2Jν(μx) x1/2 f(x) x1/2 f(x) = !Syntax Error, Idμ (xμ)1/2Jν(μx) μ1/2 Fν(μ) Fν(μ) = !Syntax Error, Idx (x)1/2Jν(μx) x1/2 f(x) f(x) = !Syntax Error, Idμ (μ)1/2Jν(μx) μ1/2 Fν(μ) Fν(μ) = !Syntax Error, Idx x Jν(μx) f(x) f(x) = !Syntax Error, Idμ μ Jν(μx)Fν(μ) QED Now that we have done this, let's restate the symmetric Hankel transform using f instead of g stuff, with the understanding that these are not the same f and F which appeared above: Fν(μ) = !Syntax Error, Idx (xμ)1/2Jν(μx)f(x) f(x) = !Syntax Error, Idμ (xμ)1/2Jν(μx) Fν(μ) Why would you want to write the thing with (xμ)1/2 inside? The reason is that this causes the kernel to be symmetric . We can write, as we did above (none of these lines involves the symmetry of K) Fν(μ) = !Syntax Error, Idx (xμ)1/2Jν(μx)f(x) f(x) = !Syntax Error, Idμ (xμ)1/2Jν(μx) Fν(μ) Fν(μ) = !Syntax Error, Idx Kν(μ,x) f(x) f(x) = !Syntax Error, Idμ Kν(x,μ)Fν(μ) Kν(μ,x) = (xμ)1/2Jν(μx) Kν(x,μ) = (xμ)1/2Jν(μx) Fν = Kν f f = Kν Gν and now we have the new fact that Kν(μ,x) = Kν(x,μ) Thus, all our rules above for matrix Cν apply for Kν except Kν is also symmetric. So Kν2 = 1 Kν = Kν-1 and now Kν = KνT This extra last fact does not affect anything we did in the previous section with C, so we can just quote a few items from above and change from C to K where appropriate: Fν = Kνf f = KνF ν Fν(μ) = Kν{f(x); μ} f(x) = Kν{Fν(μ);x } 2.1.23 left 2.1.24 // I use K in place of Sned's H Fν(μ) = Kν{a(s)b(s); μ} a(x)b(x) = Kν{Fν(r);x } Kν{ Kν{ f(r); s } ; μ} = f(μ) Kν-1{ Kν{ f(r); s } ; μ} = f(μ) Cν-1Cν = 1 Kν{ Kν-1{ f(r); s } ; μ} = f(μ) 1 { f(r); s } = f(s) A f = BC f A{ f(r); μ } = B{ C { f(r); s } ; μ} A f = BCD f A{ f(r); μ } = B{ C { D { f(t); r }; s } ; μ} (AB)f = A (Bf) AB { f(r); μ} ≡ A{ B{ f(r); s } ; μ} We have already learned about the product of script operators and the notion of the dummy variables and the usefulness of the curly bracket notation, so there is not much else to be said. 4. The Modified Hankel Transform: Sη,α f(μ) [30] Now he talks about a modified Hankel which has a different power and J order. This thing is not exactly self-reciprocal, but has a similar result. Here is this new animal (second line) Fν(μ) = !Syntax Error, Idx x Jν(μx) f(x) // my original Hankel form Fη,α(μ) ≡ 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx) f(x) ≡ Sη,α f(μ) // = modified Hankel 2.1.25 where we have now defined the integral operator Sη,α in this way. Notice that this is more a matrix notation than the operator notation we used above. We could write ( hard to see script on S) Sη,α f(μ) = [Sη,α f](μ) = [Sη,α f]μ = Sη,α { f(s); μ } The power used to be x, it is now modified to be 1-α, and instead of Jν we have J2η+α. You recover the original if α = 0 and 2η = ν. [ I am back filling in now on 7.26.10] Start with the original symmetric Hankel form above, then set ν = 2η+α, Gν(μ) = !Syntax Error, Idx (xμ)1/2Jν(μx)g(x) = Hν{ g(x); μ } G2η+α(μ) = !Syntax Error, Idx (xμ)1/2J2η+α(μx)g(x) = μ1/2 !Syntax Error, Idx x1/2 J2η+α(μx)g(x) Next, define f(x) by x1/2g(x) = x1-α f(x) => g(x) = x1/2-α f(x) f(x) = x-1/2+α g(x) so we then have G2η+α(μ) = μ1/2 !Syntax Error, Idx x1/2 J2η+α(μx)[ x1/2-α f(x)] = μ1/2 !Syntax Error, Idx x1-α J2η+α(μx)f(x) Now multiply both sides by 2α μ-1/2-α to get 2α μ-1/2-α G2η+α(μ) = 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx)f(x) ≡ Sη,α f(x) where we have now recognized our Sη,α operator object. The LHS is now 2α μ-1/2-α G2η+α(μ) = 2α μ-1/2-α H2η+α{ g(x); μ } = 2α μ-1/2-α H2η+α{ x1/2-α f(x); μ } So we have shown that Sη,α f(x) = 2α μ-1/2-α H2η+α{ x1/2-α f(x); μ } // which is 2.1.26 or using the same notation on both sides: Sη,α { f(s); μ } = 2α μ-1/2-α H2η+α{ s1/2-α f(s); μ } or H2η+α{ s1/2-α f(s); μ } = 2-α μ1/2+α Sη,α { f(s); μ } Here we are just stating the connection between the modified and regular symmetric Hankel transforms. It is just a matter of scaling of the functions, as when we went from original to symmetric Hankel. Now we could apply H2η+α-1 = H2η+α to both sides to get x1/2-α f(x) = H2η+α-1 { 2-α μ1/2+α Sη,α { f(s); μ }; x} or x-α f(x) = 2-α x-1/2H2η+α-1 { μ1/2+α Sη,α { f(s); μ }; x} // which is p30A or f(x) = 2-α x-1/2+αH2η+α { μ1/2+α Sη,α { f(s); μ }; x} (*) Now recall our S definition from above, Sη',α' { g(s); x } = 2α' x-1/2-α' H2η'+α'{ μ1/2-α' g(μ); x } Make the replacements η' = η+α and α' = -α. to get Sη+α,-α { g(s); x } = 2-α x-1/2+α H2η+α{ μ1/2+α g(μ); x } Now for function g use this g(μ) = Sη,α { f(s); μ } Then we have Sη+α,-α { Sη,α { f(r); s }; x } = 2-α x-1/2+α H2η+α{ μ1/2+α Sη,α { f(s); μ }; x } But the RHS of this equation is the same as the RHS of (*), so we then have shown that f(x) = Sη+α,-α { Sη,α { f(r); s }; x } = Sη+α,-α { Sη,α f(s); x } // which is p30B where after the last = we have revered to Sned's earlier non-script notation. Let's now ignore this and go back to f(x) = Sη+α,-α { Sη,α { f(r); s }; x } Recall our rule for multiplying script operators, (AB)f = A (Bf) AB { f(r); μ} ≡ A{ B{ f(r); s } ; μ} so we then have f(x) = Sη+α,-α { Sη,α { f(r); s }; x } = Sη+α,-α Sη,α { f(r); x} or 1 { f(r); x } = Sη+α,-α Sη,α { f(r); x} or 1 = Sη+α,-α Sη,α where all three operators are script. Back in our matrix notation this would be 1 = Sη+α,-α Sη,α // which is p30C which we can compare to the non-modified Hankel result which was 1 = Kν Kν Inverting these last two we get Sη,α-1 = Sη+α,-α // which is 2.1.27 Kν-1 = Kν Remember all the time that things like ν, η, α are all just labels, not vector or matrix indices. Now let's take this 2.1.27 result and write it out a bit Sη,α g(μ) = 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx) g(x) Sη,α-1 g(μ) = Sη+α,-α g(μ) = 2-α μα !Syntax Error, Idx x1+α J2η+α(μx) g(x) Suppose we have Fη,α(μ) = Sη,α f(μ) We can then invert to get f(μ) = Sη,α-1 Fη,α(μ) = Sη+α,-α Fη,α(μ) = 2-α μα !Syntax Error, Idx x1+α J2η+α(μx) Fη,α(x) so here then is our "modified Hankel transform pair" Fη,α(μ) = 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx) f(x) = Sη,α { f(r); μ } = Sη,α f(u) f(x) = 2-α xα !Syntax Error, Idμ μ1+α J2η+α(μx) Fη,α(μ) = Sη+α,-α { Fη,α(r); x } = Sη+α,-α Fη,α(x) where I have tried to show all the different notations. 5. Comments: (1) all we have done is a little rescaling of the functions in the regular Hankel transform. And we had a chance to exercise our various notations. (2) We have two labels η and α instead of the usual one label ν. Thus, we have the possibility of keeping Jν with a constant ν, but adjusting the power inside the integral. (3) This "modified Hankel transform" is not some highly standardized thing you find in books on integral transforms. It is a specific version used by Erdelyi and Kober in 1940 and it will have some usefulness no doubt down our roadway. (4) This modified Hankel thing is just one example of an "operator", Sη,α g(μ) = 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx) g(x) sη.α(μ,x) = 2α μ-α x1-α J2η+α(μx) = 2α x (xμ)-α J2η+α(μx) Each kernel function you can think of course implies an operator, and I would normally use the same letter for the kernel function as for the operator (Stak used k and K). This particular kernel is not symmetric, and it can be related to that symmetric Hankel operator. We shall soon see other operators with other kernels which are algebraic and power functions rather than Bessel functions, such as the upcoming Erdelyi-Kober operators I and K. Once we have mastered the notation, I don't think any such operator should be "rocket science". 6. Application to a Smythian Form for the potential. [ wrong, see section 6A for right ] Here is one way to write one of my "Smythian forms" in cylindricals, where z is non-osc: V(ρ,θ,z) = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk An(k) Jn(kρ) e-kz = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk k1-2n [ k2n-1An(k)] Jn(kρ) e-kz = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk k1-2nψn(k) Jn(kρ) e-kz // which is p 31 A where we just change the definition of our "coefficient" to ψn(k) = t2n-1An(k) . Now keep processing this thing a bit, while keeping this in mind: Sη,α g(μ) = 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx) g(x) Sη,2α g(μ) = 22α μ-2α !Syntax Error, Idx x1-2α J2η+2α(μx) g(x) We want 2η + 2α = n which says η+α = n/2 and η = n/2-α . Then we have Sn/2-α,2α g(μ) = 22α μ-2α !Syntax Error, Idx x1-2α Jn(μx) g(x) Now go back to our potential in the third line above, V(ρ,θ,z) = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk k1-2n Jn(kρ) ψn(k) e-kz At this point, despite Sned, we have to set α = n so we get the correct power. Then we have Sn/2-α,2α g(μ) = 22α μ-2α !Syntax Error, Idx x1-2α Jn(μx) g(x) S-n/2,2n g(ρ) = 22n ρ-2n !Syntax Error, Idk k1-2n Jn(ρk) g(k) Our potential is then V(ρ,θ,z) = Σn=0∞ cos(nθ + εn) { !Syntax Error, Idk k1-2n Jn(kρ) ψn(k) e-kz } = Σn=0∞ cos(nθ + εn) 2-2n μ2n { 22n μ-2n !Syntax Error, Idk k1-2n Jn(kρ) ψn(k) e-kz } = Σn=0∞ cos(nθ + εn) 2-2n ρ2n S-n/2,2n{ψn(k) e-kz ; ρ } so I think 2.1.35 is wrong! This is the first real problem I have found. It makes no sense to have some α just floating around in this 2.1.35, it has no meaning. Once I set α = n, you cannot then remove it from the sum as he has done. In my corrected form, we are still expressing the potential in terms of the modified Hankel transform with certain labels, so that fact is still true. Idea: Perhaps he has a typo in p 31A . So I will now redo this section assuming so! 6A. Application to a Smythian Form for the potential. Here is one way to write one of my "Smythian forms" in cylindricals, where z is non-osc: V(ρ,θ,z) = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk An(k) Jn(kρ) e-kz = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk k1-2α [ k2n-1An(k)] Jn(kρ) e-kz = Σn=0∞ cos(nθ + εn) !Syntax Error, Idk k1-2αψn(k) Jn(kρ) e-kz // which is p 31 A where we just change the definition of our "coefficient" to ψn(k) = t2α-1An(k), where α is just some fixed number we use . Now keep processing this thing a bit, while keeping this in mind: Sη,α g(μ) = 2α μ-α !Syntax Error, Idx x1-α J2η+α(μx) g(x) Sη,2α g(μ) = 22α μ-2α !Syntax Error, Idx x1-2α J2η+2α(μx) g(x) We want 2η + 2α = n which says η+α = n/2 and η = n/2-α . Then we have Sn/2-α,2α g(μ) = 22α μ-2α !Syntax Error, Idx x1-2α Jn(μx) g(x) Sn/2-α,2α g(ρ) = 22α ρ-2α !Syntax Error, Idk k1-2α Jn(ρk) g(k) Now go back to our potential in the third line above, V(ρ,θ,z) = Σn=0∞ cos(nθ + εn) { !Syntax Error, Idk k1-2α Jn(kρ) ψn(k) e-kz } = Σn=0∞ cos(nθ + εn) 2-2α ρ2α ( 22α ρ-2α !Syntax Error, Idk k1-2α Jn(kρ) ψn(k) e-kz ) = Σn=0∞ cos(nθ + εn) 2-2α ρ2α Sn/2-α,2α { ψn(k) e-kz ; ρ } = 2-2α ρ2α Σn=0∞ cos(nθ + εn) Sn/2-α,2α { ψn(k) e-kz ; ρ } // which is 2.1.35 Now if we do this all over again with ∂z V(ρ,θ,z), everything is the same except our power of k increases by 1, and we have an overall minus sign. We absorb the power increase by saying k1-2α k = k1-(2α-1) so all we have to do is replace 2α → 2α - 1 in our result and add the minus, so [ α → α - 1/2 ] ∂z V(ρ,θ,z) = 2-2α+1 ρ2α-1 Σn=0∞ cos(nθ + εn) Sn/2-α+1/2,2α-1 { ψn(k) e-kz ; ρ } and if we then set z = 0, this gives 2.1.37.