TheoremBase

Claims 1-6 are read off the explicit coefficient formula, using termwise differentiation of powers and factorial identities for the derivative and the three-term recursion. The addition formula follows by induction from a Pascal-rule recursion for the binomial convolution, and orthogonality and the Mehler identity follow from Gaussian integration by parts for polynomials, proved with compactly supported cutoffs and dominated convergence.

Proof

Each result cited is universally quantified over the data in its own statement.

Conventions. Natural numbers, factorials and binomial coefficients are read in R\mathbb{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(ab)^{k}=a^{k}b^{k}, akal=ak+la^{k}a^{l}=a^{k+l}, (ak)l=akl(a^{k})^{l}=a^{kl}, ∣ak∣=∣a∣k|a^{k}|=|a|^{k} with a0=1a^{0}=1) are those in force by The Real Numbers: Standing Notation and Background §background. The data v,w≥0v,w\ge0 and n∈N0n\in\mathbb{N}_{0} 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∈N0m\in\mathbb{N}_{0} and j∈Jmj\in J_{m} put

am,j=m!2j j! (m−2j)!,a_{m,j}=\frac{m!}{2^{j}\,j!\,(m-2j)!},

so that by Hermite Polynomials with a Given Variance §hermite, for every real u≥0u\ge0 and every t∈Rt\in\mathbb{R},

Hmu(t)=∑j∈Jmam,j (−u)j tm−2j.H^{u}_{m}(t)=\sum_{j\in J_{m}}a_{m,j}\,(-u)^{j}\,t^{m-2j}.

We call this the defining formula. Note am,0=m!/m!=1a_{m,0}=m!/m!=1 for every mm. The set JmJ_{m} is downward closed in N0\mathbb{N}_{0} (if 2j≤m2j\le m and i≤ji\le j then 2i≤m2i\le m), finite and nonempty, so Jm={0,1,…,ℓm}J_{m}=\{0,1,\dots,\ell_{m}\} with ℓm\ell_{m} its largest element. We also use the factorial rule (F): for every k∈Nk\in\mathbb{N}, k!=k (k−1)!k!=k\,(k-1)!, where (k−1)!=0!=1(k-1)!=0!=1 if k=1k=1; for k=1k=1 this reads 1!=1=1⋅0!1!=1=1\cdot0! by Recursion for the Factorial of a Natural Number §recursion, and for k≥2k\ge2 it is the recursion of Recursion for the Factorial of a Natural Number §recursion applied to k−1k-1.

Derivatives of powers. By claim 1 of One-Dimensional Derivatives, Partial Derivatives, and Smoothness on the Real Line, R\mathbb{R} is an interval every point of which is an interior point. Let e∈N0e\in\mathbb{N}_{0} and t∈Rt\in\mathbb{R}. If e=0e=0 the map x↦xex\mapsto x^{e} is the constant 11, which is differentiable at tt with derivative 00 by claim 1 of Sum, Constant Multiple, and Product Rules for One-Dimensional Derivatives; if e=1e=1 its derivative at tt is 1=1⋅t01=1\cdot t^{0}, and if e≥2e\ge2, writing e=S(e−1)e=S(e-1), its derivative at tt is e te−1e\,t^{e-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\partial_{1}: so ∂1(x↦xe)(t)\partial_{1}(x\mapsto x^{e})(t) is 00 if e=0e=0 and e te−1e\,t^{e-1} if e≥1e\ge1. Consequently, for real numbers λj\lambda_{j} (j∈Jmj\in J_{m}) and exponents ej∈N0e_{j}\in\mathbb{N}_{0}, the function x↦∑j∈Jmλjxejx\mapsto\sum_{j\in J_{m}}\lambda_{j}x^{e_{j}}, which after the enumeration k↦k−1k\mapsto k-1 of JmJ_{m} by [ℓm+1][\ell_{m}+1] is a finite linear combination indexed by [ℓm+1][\ell_{m}+1], is differentiable at every tt with derivative ∑j∈Jmλj ∂1(x↦xej)(t)\sum_{j\in J_{m}}\lambda_{j}\,\partial_{1}(x\mapsto x^{e_{j}})(t), by Derivative of a Finite Linear Combination of Real Functions (with I=RI=\mathbb{R}, and t−1<t<t+1t-1<t<t+1), and this is again its partial derivative ∂1\partial_{1} at tt 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≤m2j\le m is required, J0=J1={0}J_{0}=J_{1}=\{0\}, J2=J3={0,1}J_{2}=J_{3}=\{0,1\} and J4={0,1,2}J_{4}=\{0,1,2\}. Further a2,1=2!2⋅1⋅0!=1a_{2,1}=\frac{2!}{2\cdot1\cdot0!}=1, a3,1=3!2⋅1⋅1!=3a_{3,1}=\frac{3!}{2\cdot1\cdot1!}=3, a4,1=4!2⋅1⋅2!=6a_{4,1}=\frac{4!}{2\cdot1\cdot2!}=6 and a4,2=4!4⋅2!⋅0!=3a_{4,2}=\frac{4!}{4\cdot2!\cdot0!}=3. The defining formula therefore gives, for every tt, H0v(t)=t0=1H^{v}_{0}(t)=t^{0}=1, H1v(t)=tH^{v}_{1}(t)=t, H2v(t)=t2+(−v)=t2−vH^{v}_{2}(t)=t^{2}+(-v)=t^{2}-v, H3v(t)=t3+3(−v)t=t3−3vtH^{v}_{3}(t)=t^{3}+3(-v)t=t^{3}-3vt and H4v(t)=t4+6(−v)t2+3(−v)2=t4−6vt2+3v2H^{v}_{4}(t)=t^{4}+6(-v)t^{2}+3(-v)^{2}=t^{4}-6vt^{2}+3v^{2}. For the variance 00 one has (−0)0=1(-0)^{0}=1 and (−0)j=0(-0)^{j}=0 for j≥1j\ge1, so only j=0j=0 contributes and Hn0(t)=an,0tn=tnH^{0}_{n}(t)=a_{n,0}t^{n}=t^{n}.

Claim 2. Each summand t↦an,j(−v)jtn−2jt\mapsto a_{n,j}(-v)^{j}t^{n-2j} of the defining formula is a scalar multiple of a power (of the constant 11 when n−2j=0n-2j=0), hence a polynomial function on R\mathbb{R} by claims 1 and 2 of Constants, Powers, Sums, Scalar Multiples and Products of Polynomial Functions. Along the enumeration Jn={0,…,ℓn}J_{n}=\{0,\dots,\ell_{n}\} let B\mathcal{B} be the set of k∈Nk\in\mathbb{N} such that k>ℓn+1k>\ell_{n}+1 or the partial sum t↦∑j=0k−1an,j(−v)jtn−2jt\mapsto\sum_{j=0}^{k-1}a_{n,j}(-v)^{j}t^{n-2j} is a polynomial function. The partial sum with k=1k=1 is the summand j=0j=0, so 1∈B1\in\mathcal{B}. If k∈Bk\in\mathcal{B} and k+1≤ℓn+1k+1\le\ell_{n}+1, then k≤ℓnk\le\ell_{n}, so k∈Jnk\in J_{n} and the partial sum up to kk is the partial sum up to k−1k-1 plus the summand j=kj=k, a polynomial function by claim 2 of that lemma; if k+1>ℓn+1k+1>\ell_{n}+1 there is nothing to show. So B\mathcal{B} is closed under successors, and B=N\mathcal{B}=\mathbb{N} by Principle of Induction for the Natural Numbers. Taking k=ℓn+1k=\ell_{n}+1 shows that HnvH^{v}_{n} is a polynomial function. By claim 2 of Polynomial Functions on the Real Line are Smooth, HnvH^{v}_{n} is of class CkC^{k} on R1\mathbb{R}^{1} for every natural number kk, in particular of class C2C^{2}. For i∈{0,…,n}i\in\{0,\dots,n\} put bi=an,j(−v)jb_{i}=a_{n,j}(-v)^{j} if i=n−2ji=n-2j for some j∈Jnj\in J_{n} (such a jj is unique, namely j=(n−i)/2j=(n-i)/2), and bi=0b_{i}=0 otherwise. The map j↦n−2jj\mapsto n-2j is a bijection from JnJ_{n} onto the set of those i∈{0,…,n}i\in\{0,\dots,n\} with n−in-i even, so reindexing and adding the zero terms gives Hnv(t)=∑i=0nbitiH^{v}_{n}(t)=\sum_{i=0}^{n}b_{i}t^{i} for every tt; and bn=an,0(−v)0=1b_{n}=a_{n,0}(-v)^{0}=1. Finally let t∈Rt\in\mathbb{R} and 0≤i≤n0\le i\le n. If ∣t∣≤1|t|\le1 then ∣t∣i≤1|t|^{i}\le1; if 1≤∣t∣1\le|t| then ∣t∣i≤∣t∣n|t|^{i}\le|t|^{n}, by claim 1 of Growth Bound for a Polynomial Function on the Real Line when i≥1i\ge1 and because ∣t∣0=1≤∣t∣n|t|^{0}=1\le|t|^{n} when i=0i=0. In either case ∣t∣i≤1+∣t∣n|t|^{i}\le1+|t|^{n}, and with M=∑i=0n∣bi∣M=\sum_{i=0}^{n}|b_{i}|,

∣Hnv(t)∣≤∑i=0n∣bi∣ ∣t∣i≤M (1+∣t∣n).|H^{v}_{n}(t)|\le\sum_{i=0}^{n}|b_{i}|\,|t|^{i}\le M\,(1+|t|^{n}).

Claim 3. By claim 1, H0vH^{v}_{0} is the constant 11, so (H0v)′(t)=0(H^{v}_{0})'(t)=0 by the case e=0e=0 above. Let n∈Nn\in\mathbb{N}. Termwise differentiation of the defining formula gives, for every tt,

(Hnv)′(t)=∑j∈Jn, 2j≤n−1an,j(−v)j(n−2j) tn−2j−1,(H^{v}_{n})'(t)=\sum_{j\in J_{n},\ 2j\le n-1}a_{n,j}(-v)^{j}(n-2j)\,t^{n-2j-1},

the indices j∈Jnj\in J_{n} with 2j=n2j=n contributing 00 (their power is the constant t0t^{0}). The index set on the right is exactly Jn−1J_{n-1}. For j∈Jn−1j\in J_{n-1} one has n−2j≥1n-2j\ge1, so (F) gives (n−2j)!=(n−2j) (n−1−2j)!(n-2j)!=(n-2j)\,(n-1-2j)! and n!=n (n−1)!n!=n\,(n-1)!, whence

an,j (n−2j)=n!2j j! (n−1−2j)!=n (n−1)!2j j! ((n−1)−2j)!=n an−1,j.a_{n,j}\,(n-2j)=\frac{n!}{2^{j}\,j!\,(n-1-2j)!}=n\,\frac{(n-1)!}{2^{j}\,j!\,((n-1)-2j)!}=n\,a_{n-1,j}.

Since tn−2j−1=t(n−1)−2jt^{n-2j-1}=t^{(n-1)-2j}, the defining formula for Hn−1vH^{v}_{n-1} gives (Hnv)′(t)=n∑j∈Jn−1an−1,j(−v)jt(n−1)−2j=n Hn−1v(t)(H^{v}_{n})'(t)=n\sum_{j\in J_{n-1}}a_{n-1,j}(-v)^{j}t^{(n-1)-2j}=n\,H^{v}_{n-1}(t).

Claim 4. If n=0n=0, claims 1 and 3 give tH0v(t)−v (H0v)′(t)=t=H1v(t)tH^{v}_{0}(t)-v\,(H^{v}_{0})'(t)=t=H^{v}_{1}(t). Let n∈Nn\in\mathbb{N}; by claim 3, v (Hnv)′(t)=n v Hn−1v(t)v\,(H^{v}_{n})'(t)=n\,v\,H^{v}_{n-1}(t), so both assertions of claim 4 reduce to

Hn+1v(t)=t Hnv(t)−n v Hn−1v(t),H^{v}_{n+1}(t)=t\,H^{v}_{n}(t)-n\,v\,H^{v}_{n-1}(t),

which we prove by comparing the three sums written over the common index set Jn+1J_{n+1}. For j∈Jn+1j\in J_{n+1} put Dj=2j j! (n+1−2j)!D_{j}=2^{j}\,j!\,(n+1-2j)!, a positive real number, so that an+1,j=(n+1)!/Dja_{n+1,j}=(n+1)!/D_{j}.

First, tHnv(t)=∑j∈Jnan,j(−v)jtn+1−2jtH^{v}_{n}(t)=\sum_{j\in J_{n}}a_{n,j}(-v)^{j}t^{n+1-2j}. Here Jn⊆Jn+1J_{n}\subseteq J_{n+1}, and every j∈Jn+1∖Jnj\in J_{n+1}\setminus J_{n} satisfies n+1−2j=0n+1-2j=0. For j∈Jnj\in J_{n}, (F) gives (n+1−2j)!=(n+1−2j)(n−2j)!(n+1-2j)!=(n+1-2j)(n-2j)!, so an,j=(n+1−2j) n!/Dja_{n,j}=(n+1-2j)\,n!/D_{j}; and for j∈Jn+1∖Jnj\in J_{n+1}\setminus J_{n} the number (n+1−2j) n!/Dj(n+1-2j)\,n!/D_{j} is 00. Hence, adding zero terms,

tHnv(t)=∑j∈Jn+1(n+1−2j) n!Dj (−v)j tn+1−2j.tH^{v}_{n}(t)=\sum_{j\in J_{n+1}}\frac{(n+1-2j)\,n!}{D_{j}}\,(-v)^{j}\,t^{n+1-2j}.

Second, −n v Hn−1v(t)=∑i∈Jn−1n an−1,i(−v)i+1tn+1−2(i+1)-n\,v\,H^{v}_{n-1}(t)=\sum_{i\in J_{n-1}}n\,a_{n-1,i}(-v)^{i+1}t^{n+1-2(i+1)}. The map i↦i+1i\mapsto i+1 is a bijection from Jn−1J_{n-1} onto Jn+1∖{0}J_{n+1}\setminus\{0\}, since 2i≤n−12i\le n-1 if and only if 2(i+1)≤n+12(i+1)\le n+1. For j=i+1j=i+1, (F) gives j!=j (j−1)!j!=j\,(j-1)!, 2j=2⋅2j−12^{j}=2\cdot2^{j-1} and n!=n (n−1)!n!=n\,(n-1)!, and (n−1)−2(j−1)=n+1−2j(n-1)-2(j-1)=n+1-2j, so n an−1,j−1=2j n!/Djn\,a_{n-1,j-1}=2j\,n!/D_{j}; this expression is 00 for j=0j=0. Hence

−n v Hn−1v(t)=∑j∈Jn+12j n!Dj (−v)j tn+1−2j.-n\,v\,H^{v}_{n-1}(t)=\sum_{j\in J_{n+1}}\frac{2j\,n!}{D_{j}}\,(-v)^{j}\,t^{n+1-2j}.

Adding the two displays termwise and using (n+1−2j) n!+2j n!=(n+1) n!=(n+1)!(n+1-2j)\,n!+2j\,n!=(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)\sum_{j\in J_{n+1}}a_{n+1,j}(-v)^{j}t^{n+1-2j}=H^{v}_{n+1}(t).

Claim 5. The second derivative (Hnv)′′(H^{v}_{n})'' is the partial derivative of the function (Hnv)′(H^{v}_{n})'. If n=0n=0, (H0v)′(H^{v}_{0})' is the zero function by claim 3, a constant function, which is differentiable at every point with derivative 00 by claim 1 of Sum, Constant Multiple, and Product Rules for One-Dimensional Derivatives (with I=RI=\mathbb{R}), this derivative being its partial derivative ∂1\partial_{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=1n=1, (H1v)′=1⋅H0v(H^{v}_{1})'=1\cdot H^{v}_{0} is the constant 11, so (H1v)′′=0(H^{v}_{1})''=0 and the left side is −t=−1⋅H1v(t)-t=-1\cdot H^{v}_{1}(t) by claim 1. Let n≥2n\ge2. By claim 3, (Hnv)′(H^{v}_{n})' is the function nHn−1vnH^{v}_{n-1}, and by claim 1 of Constants, Coordinate Functions, Sums and Products of CkC^k Functions on a Euclidean Open Set (scalar multiples, on R1\mathbb{R}^{1}, 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)(H^{v}_{n})''(t)=n\,(H^{v}_{n-1})'(t)=n(n-1)H^{v}_{n-2}(t). Therefore, using claim 4 in its second form with n−1∈Nn-1\in\mathbb{N} in place of nn,

v (Hnv)′′(t)−t (Hnv)′(t)=−n(t Hn−1v(t)−(n−1) v Hn−2v(t))=−n Hnv(t).v\,(H^{v}_{n})''(t)-t\,(H^{v}_{n})'(t)=-n\bigl(t\,H^{v}_{n-1}(t)-(n-1)\,v\,H^{v}_{n-2}(t)\bigr)=-n\,H^{v}_{n}(t).

Claim 6. Let r,t∈Rr,t\in\mathbb{R}. For j∈Jnj\in J_{n}, (−r2v)j=(r2)j(−v)j=r2j(−v)j(-r^{2}v)^{j}=(r^{2})^{j}(-v)^{j}=r^{2j}(-v)^{j} and (rt)n−2j=rn−2jtn−2j(rt)^{n-2j}=r^{n-2j}t^{n-2j}, and r2jrn−2j=rnr^{2j}r^{n-2j}=r^{n}. The defining formula with variance r2v≥0r^{2}v\ge0 therefore gives Hnr2v(rt)=∑j∈Jnan,jrn(−v)jtn−2j=rnHnv(t)H^{r^{2}v}_{n}(rt)=\sum_{j\in J_{n}}a_{n,j}r^{n}(-v)^{j}t^{n-2j}=r^{n}H^{v}_{n}(t).

Claim 7. For m,j∈N0m,j\in\mathbb{N}_{0} with j≤mj\le m write C(m,j)=(mj)C(m,j)=\binom{m}{j}. From the factorial formula and (F) one obtains: C(m,0)=C(m,m)=1C(m,0)=C(m,m)=1; Pascal's rule C(m+1,j)=C(m,j)+C(m,j−1)C(m+1,j)=C(m,j)+C(m,j-1) for 1≤j≤m1\le j\le m, because m!j!(m−j)!+m!(j−1)!(m+1−j)!=m! ((m+1−j)+j)j! (m+1−j)!=(m+1)!j! (m+1−j)!\frac{m!}{j!(m-j)!}+\frac{m!}{(j-1)!(m+1-j)!}=\frac{m!\,((m+1-j)+j)}{j!\,(m+1-j)!}=\frac{(m+1)!}{j!\,(m+1-j)!}; and, for m≥1m\ge1, j C(m,j)=m C(m−1,j−1)j\,C(m,j)=m\,C(m-1,j-1) for 1≤j≤m1\le j\le m and (m−j) C(m,j)=m C(m−1,j)(m-j)\,C(m,j)=m\,C(m-1,j) for 0≤j≤m−10\le j\le m-1, because both sides equal m!(j−1)!(m−j)!\frac{m!}{(j-1)!(m-j)!}, respectively m!j!(m−j−1)!\frac{m!}{j!(m-j-1)!}.

Fix s,t∈Rs,t\in\mathbb{R} and abbreviate Aj=Hjv(s)A_{j}=H^{v}_{j}(s), Aj′=(Hjv)′(s)A'_{j}=(H^{v}_{j})'(s), Bk=Hkw(t)B_{k}=H^{w}_{k}(t), Bk′=(Hkw)′(t)B'_{k}=(H^{w}_{k})'(t), and Gm=∑j=0mC(m,j)AjBm−jG_{m}=\sum_{j=0}^{m}C(m,j)A_{j}B_{m-j} for m∈N0m\in\mathbb{N}_{0}. By claim 3, A0′=B0′=0A'_{0}=B'_{0}=0, Aj′=jAj−1A'_{j}=jA_{j-1} and Bk′=kBk−1B'_{k}=kB_{k-1} for j,k≥1j,k\ge1; by claim 4, Aj+1=sAj−vAj′A_{j+1}=sA_{j}-vA'_{j} and Bk+1=tBk−wBk′B_{k+1}=tB_{k}-wB'_{k} for all j,k∈N0j,k\in\mathbb{N}_{0}.

Recursion for GG. Let m∈Nm\in\mathbb{N}. By Pascal's rule and C(m+1,0)=C(m,0)C(m+1,0)=C(m,0), C(m+1,m+1)=C(m,m)C(m+1,m+1)=C(m,m),

Gm+1=∑j=0mC(m,j)AjBm+1−j+∑i=0mC(m,i)Ai+1Bm−i,G_{m+1}=\sum_{j=0}^{m}C(m,j)A_{j}B_{m+1-j}+\sum_{i=0}^{m}C(m,i)A_{i+1}B_{m-i},

the second sum arising from the terms C(m,j−1)AjBm+1−jC(m,j-1)A_{j}B_{m+1-j}, 1≤j≤m+11\le j\le m+1, by the shift i=j−1i=j-1. Inserting Bm+1−j=tBm−j−wBm−j′B_{m+1-j}=tB_{m-j}-wB'_{m-j} in the first sum and Ai+1=sAi−vAi′A_{i+1}=sA_{i}-vA'_{i} in the second gives Gm+1=(s+t)Gm−vX−wYG_{m+1}=(s+t)G_{m}-vX-wY with X=∑j=0mC(m,j)Aj′Bm−jX=\sum_{j=0}^{m}C(m,j)A'_{j}B_{m-j} and Y=∑j=0mC(m,j)AjBm−j′Y=\sum_{j=0}^{m}C(m,j)A_{j}B'_{m-j}. In XX the term j=0j=0 vanishes, and for 1≤j≤m1\le j\le m, C(m,j)Aj′=j C(m,j)Aj−1=m C(m−1,j−1)Aj−1C(m,j)A'_{j}=j\,C(m,j)A_{j-1}=m\,C(m-1,j-1)A_{j-1}, so after the shift i=j−1i=j-1, X=m∑i=0m−1C(m−1,i)AiBm−1−i=mGm−1X=m\sum_{i=0}^{m-1}C(m-1,i)A_{i}B_{m-1-i}=mG_{m-1}. In YY the term j=mj=m vanishes, and for 0≤j≤m−10\le j\le m-1, C(m,j)Bm−j′=(m−j)C(m,j)Bm−1−j=m C(m−1,j)Bm−1−jC(m,j)B'_{m-j}=(m-j)C(m,j)B_{m-1-j}=m\,C(m-1,j)B_{m-1-j}, so Y=mGm−1Y=mG_{m-1}. Hence

Gm+1=(s+t) Gm−m (v+w) Gm−1(m∈N).G_{m+1}=(s+t)\,G_{m}-m\,(v+w)\,G_{m-1}\qquad(m\in\mathbb{N}).

Induction. The quantities GmG_{m} depend on the fixed points s,ts,t; write Gm(s,t)=∑j=0mC(m,j)Hjv(s)Hm−jw(t)G_{m}(s,t)=\sum_{j=0}^{m}C(m,j)H^{v}_{j}(s)H^{w}_{m-j}(t) for m∈N0m\in\mathbb{N}_{0} and s,t∈Rs,t\in\mathbb{R}, so that the recursion for GG holds for every pair s,ts,t. Let A\mathcal{A} be the set of m∈Nm\in\mathbb{N} such that, for all s,t∈Rs,t\in\mathbb{R}, Gm−1(s,t)=Hm−1v+w(s+t)G_{m-1}(s,t)=H^{v+w}_{m-1}(s+t) and Gm(s,t)=Hmv+w(s+t)G_{m}(s,t)=H^{v+w}_{m}(s+t). By claim 1, for all s,t∈Rs,t\in\mathbb{R}, G0(s,t)=C(0,0)H0v(s)H0w(t)=1=H0v+w(s+t)G_{0}(s,t)=C(0,0)H^{v}_{0}(s)H^{w}_{0}(t)=1=H^{v+w}_{0}(s+t) and G1(s,t)=H0v(s)H1w(t)+H1v(s)H0w(t)=t+s=H1v+w(s+t)G_{1}(s,t)=H^{v}_{0}(s)H^{w}_{1}(t)+H^{v}_{1}(s)H^{w}_{0}(t)=t+s=H^{v+w}_{1}(s+t), so 1∈A1\in\mathcal{A}. Let m∈Am\in\mathcal{A} and s,t∈Rs,t\in\mathbb{R}. The recursion for GG at the points s,ts,t and claim 4 in its second form, for the variance v+w≥0v+w\ge0, the degree m∈Nm\in\mathbb{N} and the point s+ts+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);G_{m+1}(s,t)=(s+t)H^{v+w}_{m}(s+t)-m\,(v+w)\,H^{v+w}_{m-1}(s+t)=H^{v+w}_{m+1}(s+t);

as s,ts,t were arbitrary, m+1∈Am+1\in\mathcal{A}. By Principle of Induction for the Natural Numbers, A=N\mathcal{A}=\mathbb{N}. Taking m=1m=1 gives claim 7 for n=0n=0, and taking m=nm=n gives it for n∈Nn\in\mathbb{N}.

Claim 8. Assume v>0v>0, so that (v)(v) is a variance vector in R1\mathbb{R}^{1}; let ρ\rho be the diagonal Gaussian density with variances (v)(v) and λ1\lambda_{1} Lebesgue measure on B(R1)\mathcal{B}(\mathbb{R}^{1}). By the definition of γv\gamma_{v} it is the measure with density ρ\rho with respect to λ1\lambda_{1}, so by claim 3 of Image Measures, Measures with Densities, and Change of Variables a Borel f:R→Rf:\mathbb{R}\to\mathbb{R} is integrable with respect to γv\gamma_{v} if and only if fρf\rho is integrable with respect to λ1\lambda_{1}, and then ∫f dγv=∫fρ dλ1\int f\,d\gamma_{v}=\int f\rho\,d\lambda_{1}. By The Diagonal Gaussian Density on Euclidean Space: Regularity, Gradient, Normalization, Second Moments and Exponential Moments of Diagonal Quadratic Forms §regularity, ρ\rho 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/vy\mapsto y/v in dimension 11, ∂1ρ(y)=−v−1y ρ(y)\partial_{1}\rho(y)=-v^{-1}y\,\rho(y) for every yy.

Step 8a (polynomials are integrable). Every polynomial function pp on R\mathbb{R}, p(x)=c0+∑k=1Nckxkp(x)=c_{0}+\sum_{k=1}^{N}c_{k}x^{k}, is a finite linear combination of the monomials y↦yky\mapsto y^{k} (k∈N0k\in\mathbb{N}_{0}) on R1\mathbb{R}^{1}, so by Polynomial Functions Are Dense in the Square-Integrable Functions of a Diagonal Gaussian Measure on Euclidean Space §integrable, with dimension 11, variance vector (v)(v) and exponent 11, pp is continuous and Borel and ∫∣p∣ dγv<∞\int|p|\,d\gamma_{v}<\infty (since ∣p∣1=∣p∣|p|^{1}=|p| by Properties of Real Powers of Nonnegative Real Numbers §agreement); hence pp is integrable with respect to γv\gamma_{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 HmvH^{v}_{m}, every product HmvHnvH^{v}_{m}H^{v}_{n}, and y↦y p(y)y\mapsto y\,p(y) for a polynomial function pp, are Borel and γv\gamma_{v}-integrable. Moreover, for a polynomial function pp, its partial derivative p′=∂1pp'=\partial_{1}p 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 pp be a polynomial function on R\mathbb{R}. We show

∫Rp′ dγv=v−1∫Ry p(y) γv(dy).\int_{\mathbb{R}}p'\,d\gamma_{v}=v^{-1}\int_{\mathbb{R}}y\,p(y)\,\gamma_{v}(dy).

Let χR\chi_{R} (R>0R>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=1q=1, with the constant M1≥0M_{1}\ge0 given there; on R1\mathbb{R}^{1} 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=R1U=\mathbb{R}^{1} is open by claim 1 of Polynomial Functions on the Real Line are Smooth, so Constants, Coordinate Functions, Sums and Products of CkC^k Functions on a Euclidean Open Set applies on it. The function f=pρf=p\rho is smooth on R1\mathbb{R}^{1} 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 CkC^k Functions on a Euclidean Open Set, hence of class C1C^{1} by Smooth Map on a Euclidean Open Set (with k=1k=1), and by claim 1 of Constants, Coordinate Functions, Sums and Products of CkC^k Functions on a Euclidean Open Set and the formula for ∂1ρ\partial_{1}\rho, ∂1f=(p′−v−1y p)ρ\partial_{1}f=(p'-v^{-1}y\,p)\rho. For m∈Nm\in\mathbb{N} the cutoff χm\chi_{m} is smooth and compactly supported, so Integration by Parts on Euclidean Space Against a Compactly Supported Function of Class C1C^{1} §parts gives that f ∂1χmf\,\partial_{1}\chi_{m} and (∂1f)χm(\partial_{1}f)\chi_{m} are integrable with respect to λ1\lambda_{1} and

∫R(p′−v−1y p)ρ χm dλ1=−∫Rpρ ∂1χm dλ1.\int_{\mathbb{R}}(p'-v^{-1}y\,p)\rho\,\chi_{m}\,d\lambda_{1}=-\int_{\mathbb{R}}p\rho\,\partial_{1}\chi_{m}\,d\lambda_{1}.

By Step 8a, ∣p∣ρ|p|\rho and g=∣p′−v−1y p∣ρg=|p'-v^{-1}y\,p|\rho are integrable with respect to λ1\lambda_{1}. Since ∣∂1χm∣≤M1m−1|\partial_{1}\chi_{m}|\le M_{1}m^{-1}, Linearity and Monotonicity of the Lebesgue Integral §integrable bounds the absolute value of the right side by M1m−1∫∣p∣ρ dλ1M_{1}m^{-1}\int|p|\rho\,d\lambda_{1}, which tends to 00 as m→∞m\to\infty 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|(p'-v^{-1}yp)\rho\chi_{m}|\le g because 0≤χm≤10\le\chi_{m}\le1, and for each yy one has χm(y)=1\chi_{m}(y)=1 for every m≥∣y∣m\ge|y|, such mm existing by the Archimedean property, so the integrands converge pointwise to (p′−v−1yp)ρ(p'-v^{-1}yp)\rho; they are Borel, being integrable. By Dominated Convergence Theorem the left side converges to ∫(p′−v−1yp)ρ dλ1\int(p'-v^{-1}yp)\rho\,d\lambda_{1}, which is therefore 00 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\int(p'-v^{-1}yp)\,d\gamma_{v}=0, and linearity (Linearity and Monotonicity of the Lebesgue Integral §integrable), all integrands being γv\gamma_{v}-integrable by Step 8a, gives the display.

Step 8c (two identities). Write I(m,k)=∫HmvHkv dγvI(m,k)=\int H^{v}_{m}H^{v}_{k}\,d\gamma_{v}. First, I(0,0)=∫1 dγv=γv(R)=1I(0,0)=\int1\,d\gamma_{v}=\gamma_{v}(\mathbb{R})=1 by Diagonal Gaussian Measures on Euclidean Space §measure. Second, let k∈Nk\in\mathbb{N}. By claim 4 (first form, degree k−1k-1), Hkv(y)=y Hk−1v(y)−v (Hk−1v)′(y)H^{v}_{k}(y)=y\,H^{v}_{k-1}(y)-v\,(H^{v}_{k-1})'(y), and Step 8b with p=Hk−1vp=H^{v}_{k-1} gives ∫yHk−1v dγv=v∫(Hk−1v)′ dγv\int yH^{v}_{k-1}\,d\gamma_{v}=v\int(H^{v}_{k-1})'\,d\gamma_{v}; by linearity ∫Hkv dγv=0\int H^{v}_{k}\,d\gamma_{v}=0. Since H0v=1H^{v}_{0}=1, this is I(0,k)=I(k,0)=0I(0,k)=I(k,0)=0. Third, let m,k∈Nm,k\in\mathbb{N} and p=HmvHk−1vp=H^{v}_{m}H^{v}_{k-1}. By claim 1 of Constants, Coordinate Functions, Sums and Products of CkC^k Functions on a Euclidean Open Set and claim 3, p′=mHm−1vHk−1v+Hmv(Hk−1v)′p'=mH^{v}_{m-1}H^{v}_{k-1}+H^{v}_{m}(H^{v}_{k-1})'. Using claim 4 for HkvH^{v}_{k}, then Step 8b and linearity,

I(m,k)=∫y p dγv−v∫Hmv(Hk−1v)′ dγv=v∫p′ dγv−v∫Hmv(Hk−1v)′ dγv=v m I(m−1,k−1).I(m,k)=\int y\,p\,d\gamma_{v}-v\int H^{v}_{m}(H^{v}_{k-1})'\,d\gamma_{v}=v\int p'\,d\gamma_{v}-v\int H^{v}_{m}(H^{v}_{k-1})'\,d\gamma_{v}=v\,m\,I(m-1,k-1).

Step 8d (induction). Let A\mathcal{A} be the set of m∈Nm\in\mathbb{N} such that for every k∈N0k\in\mathbb{N}_{0}, I(m−1,k)=(m−1)! vm−1I(m-1,k)=(m-1)!\,v^{m-1} if k=m−1k=m-1 and I(m−1,k)=0I(m-1,k)=0 if k≠m−1k\ne m-1. By Step 8c, I(0,0)=1=0! v0I(0,0)=1=0!\,v^{0} and I(0,k)=0I(0,k)=0 for k≥1k\ge1, so 1∈A1\in\mathcal{A}. Let m∈Am\in\mathcal{A} and k∈N0k\in\mathbb{N}_{0}. If k=0k=0, then k≠mk\ne m and I(m,0)=0I(m,0)=0 by Step 8c. If k≥1k\ge1, Step 8c and m∈Am\in\mathcal{A} give I(m,k)=v m I(m−1,k−1)I(m,k)=v\,m\,I(m-1,k-1), which is v m (m−1)! vm−1=m! vmv\,m\,(m-1)!\,v^{m-1}=m!\,v^{m} when k−1=m−1k-1=m-1, by (F), and 00 otherwise. So m+1∈Am+1\in\mathcal{A}, and A=N\mathcal{A}=\mathbb{N} by Principle of Induction for the Natural Numbers. Applying this to m+1∈Am+1\in\mathcal{A} for the mm of the statement gives the displayed formula of claim 8, and the case m=0m=0, n∈Nn\in\mathbb{N} is the final assertion. Borel measurability and integrability of HmvH^{v}_{m} and HmvHnvH^{v}_{m}H^{v}_{n} were shown in Step 8a.

Claim 9. Assume v>0v>0 and r2+s2=1r^{2}+s^{2}=1, and let t,y∈Rt,y\in\mathbb{R}. The numbers r2vr^{2}v and s2vs^{2}v are nonnegative and r2v+s2v=vr^{2}v+s^{2}v=v. Claim 7 with the variances r2vr^{2}v, s2vs^{2}v and the points rtrt, sysy, followed by claim 6 (with rr and with ss), gives

Hnv(rt+sy)=∑j=0n(nj)Hjr2v(rt) Hn−js2v(sy)=∑j=0n(nj) rjsn−jHjv(t) Hn−jv(y).H^{v}_{n}(rt+sy)=\sum_{j=0}^{n}\binom{n}{j}H^{r^{2}v}_{j}(rt)\,H^{s^{2}v}_{n-j}(sy)=\sum_{j=0}^{n}\binom{n}{j}\,r^{j}s^{n-j}H^{v}_{j}(t)\,H^{v}_{n-j}(y).

For fixed tt the right side, as a function of yy, is a linear combination of the polynomial functions Hn−jvH^{v}_{n-j}, hence a polynomial function by Constants, Powers, Sums, Scalar Multiples and Products of Polynomial Functions, and so it is Borel and γv\gamma_{v}-integrable by Step 8a. By linearity and claim 8 with m=0m=0, ∫Hn−jv dγv=0\int H^{v}_{n-j}\,d\gamma_{v}=0 unless n−j=0n-j=0, in which case it equals ∫H0v dγv=1\int H^{v}_{0}\,d\gamma_{v}=1. Hence

∫RHnv(rt+sy) γv(dy)=(nn) rns0Hnv(t)=rnHnv(t).\int_{\mathbb{R}}H^{v}_{n}(rt+sy)\,\gamma_{v}(dy)=\binom{n}{n}\,r^{n}s^{0}H^{v}_{n}(t)=r^{n}H^{v}_{n}(t).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…