Each result cited is universally quantified over the data in its own statement.
Conventions. Natural numbers, factorials and binomial coefficients are read in R through the canonical map, as in The Real Numbers: Standing Notation and Background §numbers. The arithmetic and order manipulations of real numbers, natural powers and finite sums made below without further comment (reindexing a finite sum along a bijection, splitting off or adding zero terms, regrouping, the triangle inequality for finite sums, and the power rules (ab)k=akbk, akal=ak+l, (ak)l=akl, ∣ak∣=∣a∣k with a0=1) are those in force by The Real Numbers: Standing Notation and Background §background. The data v,w≥0 and n∈N0 of the statement are arbitrary, so every claim, once proved, is available for every choice of nonnegative variances, every degree and every point, and it is used in that form below. For m∈N0 and j∈Jm put
am,j=2jj!(m−2j)!m!,
so that by Hermite Polynomials with a Given Variance §hermite, for every real u≥0 and every t∈R,
Hmu(t)=j∈Jm∑am,j(−u)jtm−2j.
We call this the defining formula. Note am,0=m!/m!=1 for every m. The set Jm is downward closed in N0 (if 2j≤m and i≤j then 2i≤m), finite and nonempty, so Jm={0,1,…,ℓm} with ℓm its largest element. We also use the factorial rule (F): for every k∈N, k!=k(k−1)!, where (k−1)!=0!=1 if k=1; for k=1 this reads 1!=1=1⋅0! by Recursion for the Factorial of a Natural Number §recursion, and for k≥2 it is the recursion of Recursion for the Factorial of a Natural Number §recursion applied to k−1.
Derivatives of powers. By claim 1 of One-Dimensional Derivatives, Partial Derivatives, and Smoothness on the Real Line, R is an interval every point of which is an interior point. Let e∈N0 and t∈R. If e=0 the map x↦xe is the constant 1, which is differentiable at t with derivative 0 by claim 1 of Sum, Constant Multiple, and Product Rules for One-Dimensional Derivatives; if e=1 its derivative at t is 1=1⋅t0, and if e≥2, writing e=S(e−1), its derivative at t is ete−1, both by claim 1 of Derivative of a Polynomial Function on the Real Line. By claim 2 of One-Dimensional Derivatives, Partial Derivatives, and Smoothness on the Real Line these derivatives are the partial derivatives ∂1: so ∂1(x↦xe)(t) is 0 if e=0 and ete−1 if e≥1. Consequently, for real numbers λj (j∈Jm) and exponents ej∈N0, the function x↦∑j∈Jmλjxej, which after the enumeration k↦k−1 of Jm by [ℓm+1] is a finite linear combination indexed by [ℓm+1], is differentiable at every t with derivative ∑j∈Jmλj∂1(x↦xej)(t), by Derivative of a Finite Linear Combination of Real Functions (with I=R, and t−1<t<t+1), and this is again its partial derivative ∂1 at t by claim 2 of One-Dimensional Derivatives, Partial Derivatives, and Smoothness on the Real Line. We refer to this as termwise differentiation.
Claim 1. Since 2j≤m is required, J0=J1={0}, J2=J3={0,1} and J4={0,1,2}. Further a2,1=2⋅1⋅0!2!=1, a3,1=2⋅1⋅1!3!=3, a4,1=2⋅1⋅2!4!=6 and a4,2=4⋅2!⋅0!4!=3. The defining formula therefore gives, for every t, H0v(t)=t0=1, H1v(t)=t, H2v(t)=t2+(−v)=t2−v, H3v(t)=t3+3(−v)t=t3−3vt and H4v(t)=t4+6(−v)t2+3(−v)2=t4−6vt2+3v2. For the variance 0 one has (−0)0=1 and (−0)j=0 for j≥1, so only j=0 contributes and Hn0(t)=an,0tn=tn.
Claim 2. Each summand t↦an,j(−v)jtn−2j of the defining formula is a scalar multiple of a power (of the constant 1 when n−2j=0), hence a polynomial function on R by claims 1 and 2 of Constants, Powers, Sums, Scalar Multiples and Products of Polynomial Functions. Along the enumeration Jn={0,…,ℓn} let B be the set of k∈N such that k>ℓn+1 or the partial sum t↦∑j=0k−1an,j(−v)jtn−2j is a polynomial function. The partial sum with k=1 is the summand j=0, so 1∈B. If k∈B and k+1≤ℓn+1, then k≤ℓn, so k∈Jn and the partial sum up to k is the partial sum up to k−1 plus the summand j=k, a polynomial function by claim 2 of that lemma; if k+1>ℓn+1 there is nothing to show. So B is closed under successors, and B=N by Principle of Induction for the Natural Numbers. Taking k=ℓn+1 shows that Hnv is a polynomial function. By claim 2 of Polynomial Functions on the Real Line are Smooth, Hnv is of class Ck on R1 for every natural number k, in particular of class C2. For i∈{0,…,n} put bi=an,j(−v)j if i=n−2j for some j∈Jn (such a j is unique, namely j=(n−i)/2), and bi=0 otherwise. The map j↦n−2j is a bijection from Jn onto the set of those i∈{0,…,n} with n−i even, so reindexing and adding the zero terms gives Hnv(t)=∑i=0nbiti for every t; and bn=an,0(−v)0=1. Finally let t∈R and 0≤i≤n. If ∣t∣≤1 then ∣t∣i≤1; if 1≤∣t∣ then ∣t∣i≤∣t∣n, by claim 1 of Growth Bound for a Polynomial Function on the Real Line when i≥1 and because ∣t∣0=1≤∣t∣n when i=0. In either case ∣t∣i≤1+∣t∣n, and with M=∑i=0n∣bi∣,
∣Hnv(t)∣≤i=0∑n∣bi∣∣t∣i≤M(1+∣t∣n).
Claim 3. By claim 1, H0v is the constant 1, so (H0v)′(t)=0 by the case e=0 above. Let n∈N. Termwise differentiation of the defining formula gives, for every t,
(Hnv)′(t)=j∈Jn, 2j≤n−1∑an,j(−v)j(n−2j)tn−2j−1,
the indices j∈Jn with 2j=n contributing 0 (their power is the constant t0). The index set on the right is exactly Jn−1. For j∈Jn−1 one has n−2j≥1, so (F) gives (n−2j)!=(n−2j)(n−1−2j)! and n!=n(n−1)!, whence
an,j(n−2j)=2jj!(n−1−2j)!n!=n2jj!((n−1)−2j)!(n−1)!=nan−1,j.
Since tn−2j−1=t(n−1)−2j, the defining formula for Hn−1v gives (Hnv)′(t)=n∑j∈Jn−1an−1,j(−v)jt(n−1)−2j=nHn−1v(t).
Claim 4. If n=0, claims 1 and 3 give tH0v(t)−v(H0v)′(t)=t=H1v(t). Let n∈N; by claim 3, v(Hnv)′(t)=nvHn−1v(t), so both assertions of claim 4 reduce to
Hn+1v(t)=tHnv(t)−nvHn−1v(t),
which we prove by comparing the three sums written over the common index set Jn+1. For j∈Jn+1 put Dj=2jj!(n+1−2j)!, a positive real number, so that an+1,j=(n+1)!/Dj.
First, tHnv(t)=∑j∈Jnan,j(−v)jtn+1−2j. Here Jn⊆Jn+1, and every j∈Jn+1∖Jn satisfies n+1−2j=0. For j∈Jn, (F) gives (n+1−2j)!=(n+1−2j)(n−2j)!, so an,j=(n+1−2j)n!/Dj; and for j∈Jn+1∖Jn the number (n+1−2j)n!/Dj is 0. Hence, adding zero terms,
tHnv(t)=j∈Jn+1∑Dj(n+1−2j)n!(−v)jtn+1−2j.
Second, −nvHn−1v(t)=∑i∈Jn−1nan−1,i(−v)i+1tn+1−2(i+1). The map i↦i+1 is a bijection from Jn−1 onto Jn+1∖{0}, since 2i≤n−1 if and only if 2(i+1)≤n+1. For j=i+1, (F) gives j!=j(j−1)!, 2j=2⋅2j−1 and n!=n(n−1)!, and (n−1)−2(j−1)=n+1−2j, so nan−1,j−1=2jn!/Dj; this expression is 0 for j=0. Hence
−nvHn−1v(t)=j∈Jn+1∑Dj2jn!(−v)jtn+1−2j.
Adding the two displays termwise and using (n+1−2j)n!+2jn!=(n+1)n!=(n+1)!, by Recursion for the Factorial of a Natural Number §recursion, gives ∑j∈Jn+1an+1,j(−v)jtn+1−2j=Hn+1v(t).
Claim 5. The second derivative (Hnv)′′ is the partial derivative of the function (Hnv)′. If n=0, (H0v)′ is the zero function by claim 3, a constant function, which is differentiable at every point with derivative 0 by claim 1 of Sum, Constant Multiple, and Product Rules for One-Dimensional Derivatives (with I=R), this derivative being its partial derivative ∂1 by claim 2 of One-Dimensional Derivatives, Partial Derivatives, and Smoothness on the Real Line; so both sides of claim 5 vanish. If n=1, (H1v)′=1⋅H0v is the constant 1, so (H1v)′′=0 and the left side is −t=−1⋅H1v(t) by claim 1. Let n≥2. By claim 3, (Hnv)′ is the function nHn−1v, and by claim 1 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set (scalar multiples, on R1, which is open by claim 1 of Polynomial Functions on the Real Line are Smooth) and claim 3 again, (Hnv)′′(t)=n(Hn−1v)′(t)=n(n−1)Hn−2v(t). Therefore, using claim 4 in its second form with n−1∈N in place of n,
v(Hnv)′′(t)−t(Hnv)′(t)=−n(tHn−1v(t)−(n−1)vHn−2v(t))=−nHnv(t).
Claim 6. Let r,t∈R. For j∈Jn, (−r2v)j=(r2)j(−v)j=r2j(−v)j and (rt)n−2j=rn−2jtn−2j, and r2jrn−2j=rn. The defining formula with variance r2v≥0 therefore gives Hnr2v(rt)=∑j∈Jnan,jrn(−v)jtn−2j=rnHnv(t).
Claim 7. For m,j∈N0 with j≤m write C(m,j)=(jm). From the factorial formula and (F) one obtains: C(m,0)=C(m,m)=1; Pascal's rule C(m+1,j)=C(m,j)+C(m,j−1) for 1≤j≤m, because j!(m−j)!m!+(j−1)!(m+1−j)!m!=j!(m+1−j)!m!((m+1−j)+j)=j!(m+1−j)!(m+1)!; and, for m≥1, jC(m,j)=mC(m−1,j−1) for 1≤j≤m and (m−j)C(m,j)=mC(m−1,j) for 0≤j≤m−1, because both sides equal (j−1)!(m−j)!m!, respectively j!(m−j−1)!m!.
Fix s,t∈R and abbreviate Aj=Hjv(s), Aj′=(Hjv)′(s), Bk=Hkw(t), Bk′=(Hkw)′(t), and Gm=∑j=0mC(m,j)AjBm−j for m∈N0. By claim 3, A0′=B0′=0, Aj′=jAj−1 and Bk′=kBk−1 for j,k≥1; by claim 4, Aj+1=sAj−vAj′ and Bk+1=tBk−wBk′ for all j,k∈N0.
Recursion for G. Let m∈N. By Pascal's rule and C(m+1,0)=C(m,0), C(m+1,m+1)=C(m,m),
Gm+1=j=0∑mC(m,j)AjBm+1−j+i=0∑mC(m,i)Ai+1Bm−i,
the second sum arising from the terms C(m,j−1)AjBm+1−j, 1≤j≤m+1, by the shift i=j−1. Inserting Bm+1−j=tBm−j−wBm−j′ in the first sum and Ai+1=sAi−vAi′ in the second gives Gm+1=(s+t)Gm−vX−wY with X=∑j=0mC(m,j)Aj′Bm−j and Y=∑j=0mC(m,j)AjBm−j′. In X the term j=0 vanishes, and for 1≤j≤m, C(m,j)Aj′=jC(m,j)Aj−1=mC(m−1,j−1)Aj−1, so after the shift i=j−1, X=m∑i=0m−1C(m−1,i)AiBm−1−i=mGm−1. In Y the term j=m vanishes, and for 0≤j≤m−1, C(m,j)Bm−j′=(m−j)C(m,j)Bm−1−j=mC(m−1,j)Bm−1−j, so Y=mGm−1. Hence
Gm+1=(s+t)Gm−m(v+w)Gm−1(m∈N).
Induction. The quantities Gm depend on the fixed points s,t; write Gm(s,t)=∑j=0mC(m,j)Hjv(s)Hm−jw(t) for m∈N0 and s,t∈R, so that the recursion for G holds for every pair s,t. Let A be the set of m∈N such that, for all s,t∈R, Gm−1(s,t)=Hm−1v+w(s+t) and Gm(s,t)=Hmv+w(s+t). By claim 1, for all s,t∈R, G0(s,t)=C(0,0)H0v(s)H0w(t)=1=H0v+w(s+t) and G1(s,t)=H0v(s)H1w(t)+H1v(s)H0w(t)=t+s=H1v+w(s+t), so 1∈A. Let m∈A and s,t∈R. The recursion for G at the points s,t and claim 4 in its second form, for the variance v+w≥0, the degree m∈N and the point s+t, give
Gm+1(s,t)=(s+t)Hmv+w(s+t)−m(v+w)Hm−1v+w(s+t)=Hm+1v+w(s+t);
as s,t were arbitrary, m+1∈A. By Principle of Induction for the Natural Numbers, A=N. Taking m=1 gives claim 7 for n=0, and taking m=n gives it for n∈N.
Claim 8. Assume v>0, so that (v) is a variance vector in R1; let ρ be the diagonal Gaussian density with variances (v) and λ1 Lebesgue measure on B(R1). By the definition of γv it is the measure with density ρ with respect to λ1, so by claim 3 of Image Measures, Measures with Densities, and Change of Variables a Borel f:R→R is integrable with respect to γv if and only if fρ is integrable with respect to λ1, and then ∫fdγv=∫fρdλ1. By The Diagonal Gaussian Density on Euclidean Space: Regularity, Gradient, Normalization, Second Moments and Exponential Moments of Diagonal Quadratic Forms §regularity, ρ is smooth, positive and Borel, and by The Diagonal Gaussian Density on Euclidean Space: Regularity, Gradient, Normalization, Second Moments and Exponential Moments of Diagonal Quadratic Forms §gradient, whose scaling map is y↦y/v in dimension 1, ∂1ρ(y)=−v−1yρ(y) for every y.
Step 8a (polynomials are integrable). Every polynomial function p on R, p(x)=c0+∑k=1Nckxk, is a finite linear combination of the monomials y↦yk (k∈N0) on R1, so by Polynomial Functions Are Dense in the Square-Integrable Functions of a Diagonal Gaussian Measure on Euclidean Space §integrable, with dimension 1, variance vector (v) and exponent 1, p is continuous and Borel and ∫∣p∣dγv<∞ (since ∣p∣1=∣p∣ by Properties of Real Powers of Nonnegative Real Numbers §agreement); hence p is integrable with respect to γv, by the criterion of Measure Spaces and the Lebesgue Integral: Standing Notation §integral. Products and linear combinations of polynomial functions are polynomial functions by Constants, Powers, Sums, Scalar Multiples and Products of Polynomial Functions; in particular every Hmv, every product HmvHnv, and y↦yp(y) for a polynomial function p, are Borel and γv-integrable. Moreover, for a polynomial function p, its partial derivative p′=∂1p exists everywhere and is a polynomial function, by claim 2 of Derivative of a Polynomial Function on the Real Line together with claims 1 and 2 of One-Dimensional Derivatives, Partial Derivatives, and Smoothness on the Real Line.
Step 8b (Gaussian integration by parts). Let p be a polynomial function on R. We show
∫Rp′dγv=v−1∫Ryp(y)γv(dy).
Let χR (R>0) be the cutoffs of Scaled Cutoffs and the Second-Moment Test Functions: Uniform Derivative Bounds and Agreement on a Ball §cutoff in dimension q=1, with the constant M1≥0 given there; on R1 the Euclidean norm is the absolute value by One-Dimensional Test Functions: Scalars, Derivatives, and the Difference Quotient of the Derivative §scalars. The set U=R1 is open by claim 1 of Polynomial Functions on the Real Line are Smooth, so Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set applies on it. The function f=pρ is smooth on R1 by claim 2 of Polynomial Functions on the Real Line are Smooth, The Diagonal Gaussian Density on Euclidean Space: Regularity, Gradient, Normalization, Second Moments and Exponential Moments of Diagonal Quadratic Forms §regularity and claim 3 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set, hence of class C1 by Smooth Map on a Euclidean Open Set (with k=1), and by claim 1 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set and the formula for ∂1ρ, ∂1f=(p′−v−1yp)ρ. For m∈N the cutoff χm is smooth and compactly supported, so Integration by Parts on Euclidean Space Against a Compactly Supported Function of Class C1 §parts gives that f∂1χm and (∂1f)χm are integrable with respect to λ1 and
∫R(p′−v−1yp)ρχmdλ1=−∫Rpρ∂1χmdλ1.
By Step 8a, ∣p∣ρ and g=∣p′−v−1yp∣ρ are integrable with respect to λ1. Since ∣∂1χm∣≤M1m−1, Linearity and Monotonicity of the Lebesgue Integral §integrable bounds the absolute value of the right side by M1m−1∫∣p∣ρdλ1, which tends to 0 as m→∞ by claim 3(a) of Real Powers Through the Exponential, and Elementary Asymptotic Tools: Monotonicity, Null Sequences of Negative Powers, Exponential Domination, Integer Rounding, and Square-Root and Exponential Inequalities and Arithmetic of Limits of Real Sequences §scalar. On the left, ∣(p′−v−1yp)ρχm∣≤g because 0≤χm≤1, and for each y one has χm(y)=1 for every m≥∣y∣, such m existing by the Archimedean property, so the integrands converge pointwise to (p′−v−1yp)ρ; they are Borel, being integrable. By Dominated Convergence Theorem the left side converges to ∫(p′−v−1yp)ρdλ1, which is therefore 0 by uniqueness of limits. By claim 3 of Image Measures, Measures with Densities, and Change of Variables this says ∫(p′−v−1yp)dγv=0, and linearity (Linearity and Monotonicity of the Lebesgue Integral §integrable), all integrands being γv-integrable by Step 8a, gives the display.
Step 8c (two identities). Write I(m,k)=∫HmvHkvdγv. First, I(0,0)=∫1dγv=γv(R)=1 by Diagonal Gaussian Measures on Euclidean Space §measure. Second, let k∈N. By claim 4 (first form, degree k−1), Hkv(y)=yHk−1v(y)−v(Hk−1v)′(y), and Step 8b with p=Hk−1v gives ∫yHk−1vdγv=v∫(Hk−1v)′dγv; by linearity ∫Hkvdγv=0. Since H0v=1, this is I(0,k)=I(k,0)=0. Third, let m,k∈N and p=HmvHk−1v. By claim 1 of Constants, Coordinate Functions, Sums and Products of Ck Functions on a Euclidean Open Set and claim 3, p′=mHm−1vHk−1v+Hmv(Hk−1v)′. Using claim 4 for Hkv, then Step 8b and linearity,
I(m,k)=∫ypdγv−v∫Hmv(Hk−1v)′dγv=v∫p′dγv−v∫Hmv(Hk−1v)′dγv=vmI(m−1,k−1).
Step 8d (induction). Let A be the set of m∈N such that for every k∈N0, I(m−1,k)=(m−1)!vm−1 if k=m−1 and I(m−1,k)=0 if k=m−1. By Step 8c, I(0,0)=1=0!v0 and I(0,k)=0 for k≥1, so 1∈A. Let m∈A and k∈N0. If k=0, then k=m and I(m,0)=0 by Step 8c. If k≥1, Step 8c and m∈A give I(m,k)=vmI(m−1,k−1), which is vm(m−1)!vm−1=m!vm when k−1=m−1, by (F), and 0 otherwise. So m+1∈A, and A=N by Principle of Induction for the Natural Numbers. Applying this to m+1∈A for the m of the statement gives the displayed formula of claim 8, and the case m=0, n∈N is the final assertion. Borel measurability and integrability of Hmv and HmvHnv were shown in Step 8a.
Claim 9. Assume v>0 and r2+s2=1, and let t,y∈R. The numbers r2v and s2v are nonnegative and r2v+s2v=v. Claim 7 with the variances r2v, s2v and the points rt, sy, followed by claim 6 (with r and with s), gives
Hnv(rt+sy)=j=0∑n(jn)Hjr2v(rt)Hn−js2v(sy)=j=0∑n(jn)rjsn−jHjv(t)Hn−jv(y).
For fixed t the right side, as a function of y, is a linear combination of the polynomial functions Hn−jv, hence a polynomial function by Constants, Powers, Sums, Scalar Multiples and Products of Polynomial Functions, and so it is Borel and γv-integrable by Step 8a. By linearity and claim 8 with m=0, ∫Hn−jvdγv=0 unless n−j=0, in which case it equals ∫H0vdγv=1. Hence
∫RHnv(rt+sy)γv(dy)=(nn)rns0Hnv(t)=rnHnv(t).