TheoremBase

Against a bounded Lipschitz test function, replacing YnY_n by c costs little off the event where YnY_n is far from c, and for the product also off the event where XnX_n is large, which has small probability uniformly by the closed-set bound of the portmanteau theorem; the mapping theorem handles the limits XnX_n + c and cXncX_n.

Proof

Throughout, E′\mathbb{E}' is expectation on (Ω′,F′,P′)(\Omega',\mathcal{F}',P'); Xn+YnX_{n}+Y_{n}, YnXnY_{n}X_{n}, Xn+cX_{n}+c and cXncX_{n} are random variables on (Ω,F,P)(\Omega,\mathcal{F},P), and X+cX+c, cXcX on (Ω′,F′,P′)(\Omega',\mathcal{F}',P') (Arithmetic of Measurable Real- and [0,∞]-Valued Maps (i), Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (iii)); dR(x,y)=∣x−y∣d_{\mathbb{R}}(x,y)=|x-y| (The Distance on the Real Numbers (i), The Distance on the Real Numbers Is a Map with Values the Absolute Differences (i)), so the hypothesis on (Yn)(Y_{n}) says P(∣Yn−c∣>ε)→0P(|Y_{n}-c|>\varepsilon)\to0 for every ε>0\varepsilon>0 (Convergence in Probability (i)); and Convergence in Distribution through Expectations of Bounded Continuous and of Bounded Lipschitz Functions is applied with every (Ωn,Fn,Pn)(\Omega_{n},\mathcal{F}_{n},P_{n}) equal to (Ω,F,P)(\Omega,\mathcal{F},P) and with (Ω′,F′,P′)(\Omega',\mathcal{F}',P') in place of (Ω,F,P)(\Omega,\mathcal{F},P).

Step 1 (reduction). By Convergence in Distribution through Expectations of Bounded Continuous and of Bounded Lipschitz Functions (ii), it suffices to show, for every bounded Lipschitz f:R→Rf:\mathbb{R}\to\mathbb{R}, that Ef(Xn+Yn)→E′f(X+c)\mathbb{E}f(X_{n}+Y_{n})\to\mathbb{E}'f(X+c) and Ef(YnXn)→E′f(cX)\mathbb{E}f(Y_{n}X_{n})\to\mathbb{E}'f(cX). Let ∣f∣≤M|f|\le M and let LL be a Lipschitz constant; the random variables f(⋅)f(\cdot) below are bounded by MM, hence integrable (Bounded Measurable Functions on a Finite Measure Space Are Integrable (i)).

Step 2 (the shifted and scaled sequences). Let g(x)=x+cg(x)=x+c (resp. g(x)=cxg(x)=cx). Since ∣(x+c)−(y+c)∣=∣x−y∣|(x+c)-(y+c)|=|x-y| and ∣cx−cy∣=∣c∣ ∣x−y∣|cx-cy|=|c|\,|x-y| (The Distance on the Real Numbers Is a Map with Values the Absolute Differences (i), Rules of Arithmetic and Order in an Ordered Field (x)), gg is Lipschitz with constant 11 (resp. ∣c∣|c|), so f∘gf\circ g is bounded by MM and Lipschitz with constant LL (resp. L∣c∣L|c|), in particular continuous (A Lipschitz Map is Uniformly Continuous and Continuous (ii)). As f(Xn+c)=(f∘g)(Xn)f(X_{n}+c)=(f\circ g)(X_{n}) and f(X+c)=(f∘g)(X)f(X+c)=(f\circ g)(X) (resp. f(cXn)=(f∘g)(Xn)f(cX_{n})=(f\circ g)(X_{n}) and f(cX)=(f∘g)(X)f(cX)=(f\circ g)(X)), Convergence in Distribution through Expectations of Bounded Continuous and of Bounded Lipschitz Functions (ii) applied to Xn→dXX_{n}\xrightarrow{d}X and the function f∘gf\circ g, gives

Ef(Xn+c)→E′f(X+c),Ef(cXn)→E′f(cX).\mathbb{E}f(X_{n}+c)\to\mathbb{E}'f(X+c),\qquad\mathbb{E}f(cX_{n})\to\mathbb{E}'f(cX).

Step 3 (proof of (i)). For ε>0\varepsilon>0 let Dn={∣Yn−c∣>ε}D_{n}=\{|Y_{n}-c|>\varepsilon\}. Off DnD_{n} the Lipschitz bound gives ∣f(Xn+Yn)−f(Xn+c)∣≤L∣Yn−c∣≤Lε|f(X_{n}+Y_{n})-f(X_{n}+c)|\le L|Y_{n}-c|\le L\varepsilon, and on DnD_{n} this difference is at most 2M2M because ∣f∣≤M|f|\le M. Hence ∣f(Xn+Yn)−f(Xn+c)∣≤Lε+2M 1Dn|f(X_{n}+Y_{n})-f(X_{n}+c)|\le L\varepsilon+2M\,\mathbf{1}_{D_{n}}, and by Rules for Expectations, Variances and Covariances (v), Rules for Expectations, Variances and Covariances (iv), Rules for Expectations, Variances and Covariances (iii), Rules for Expectations, Variances and Covariances (ii) and Rules for Expectations, Variances and Covariances (i)

∣Ef(Xn+Yn)−Ef(Xn+c)∣≤Lε+2M P(Dn).\bigl|\mathbb{E}f(X_{n}+Y_{n})-\mathbb{E}f(X_{n}+c)\bigr|\le L\varepsilon+2M\,P(D_{n}).

Now let δ>0\delta>0. Choose first ε>0\varepsilon>0 with Lε<δ/2L\varepsilon<\delta/2, and then, since P(Dn)→0P(D_{n})\to0, an N1∈NN_{1}\in\mathbb{N} with 2M P(Dn)<δ/22M\,P(D_{n})<\delta/2 for every n≥N1n\ge N_{1}; thus ∣Ef(Xn+Yn)−Ef(Xn+c)∣<δ|\mathbb{E}f(X_{n}+Y_{n})-\mathbb{E}f(X_{n}+c)|<\delta for n≥N1n\ge N_{1}. By Step 2 there is N2∈NN_{2}\in\mathbb{N} with ∣Ef(Xn+c)−E′f(X+c)∣<δ|\mathbb{E}f(X_{n}+c)-\mathbb{E}'f(X+c)|<\delta for n≥N2n\ge N_{2}, so

∣Ef(Xn+Yn)−E′f(X+c)∣<2δ(n≥max⁡(N1,N2)).\bigl|\mathbb{E}f(X_{n}+Y_{n})-\mathbb{E}'f(X+c)\bigr|<2\delta\qquad(n\ge\max(N_{1},N_{2})).

As δ>0\delta>0 was arbitrary, Ef(Xn+Yn)→E′f(X+c)\mathbb{E}f(X_{n}+Y_{n})\to\mathbb{E}'f(X+c).

Step 4 (the XnX_{n} are uniformly unlikely to be large). Let η>0\eta>0. By Properties of Distribution Functions (iii) and Properties of Distribution Functions (iv) there are reals m1,m2>0m_{1},m_{2}>0 such that the distribution function FXF_{X} satisfies FX(t)<η/2F_{X}(t)<\eta/2 for t≤−m1t\le-m_{1} and FX(t)>1−η/2F_{X}(t)>1-\eta/2 for t≥m2t\ge m_{2}. Put K=m1+m2+1>0K=m_{1}+m_{2}+1>0; since −K≤−m1-K\le-m_{1} and K−1≥m2K-1\ge m_{2}, we have FX(−K)<η/2F_{X}(-K)<\eta/2 and FX(K−1)>1−η/2F_{X}(K-1)>1-\eta/2. Pointwise on Ω′\Omega',

1{∣X∣≥K}≤1{X≤−K}+1−1{X≤K−1},\mathbf{1}_{\{|X|\ge K\}}\le\mathbf{1}_{\{X\le-K\}}+1-\mathbf{1}_{\{X\le K-1\}},

since the right side is nonnegative, and if ∣X∣≥K|X|\ge K then either X≤−KX\le-K, where the right side is at least 11, or X≥K>K−1X\ge K>K-1, where it equals 11. Taking expectations on (Ω′,F′,P′)(\Omega',\mathcal{F}',P') (Rules for Expectations, Variances and Covariances (i), Rules for Expectations, Variances and Covariances (ii), Rules for Expectations, Variances and Covariances (iii), Rules for Expectations, Variances and Covariances (iv)) gives

P′(∣X∣≥K)≤FX(−K)+1−FX(K−1)<η.P'(|X|\ge K)\le F_{X}(-K)+1-F_{X}(K-1)<\eta .

The set CK={x∈R:∣x∣≥K}C_{K}=\{x\in\mathbb{R}:|x|\ge K\} is closed: its complement is the open ball BdR(0,K)B_{d_{\mathbb{R}}}(0,K) (The Distance on the Real Numbers Is a Map with Values the Absolute Differences (i)), which is open (Open Ball in a Metric Space is Open (i)) and so belongs to the topology of open sets of (R,dR)(\mathbb{R},d_{\mathbb{R}}) (The Open Subsets of a Metric Space Form a Topology (i)). Hence Portmanteau Theorem on a Metric Space (iii), applied to the laws, PXn⇒PXP_{X_{n}}\Rightarrow P_{X} (Convergence in Distribution of Random Elements of a Metric Space (i)), gives

lim sup⁡n→∞P(∣Xn∣≥K)≤P′(∣X∣≥K)<η,\limsup_{n\to\infty}P(|X_{n}|\ge K)\le P'(|X|\ge K)<\eta ,

and Properties of the Limit Superior and the Limit Inferior: Tail Formula, Order, Comparison, Bounds, Eventual and Frequent Inequalities, Subsequences, Negation and Convergence (v), with the margin η−lim sup⁡nP(∣Xn∣≥K)>0\eta-\limsup_{n}P(|X_{n}|\ge K)>0 (the limit superior as in Properties of the Limit Superior and the Limit Inferior: Tail Formula, Order, Comparison, Bounds, Eventual and Frequent Inequalities, Subsequences, Negation and Convergence (i)), shows that P(∣Xn∣≥K)<ηP(|X_{n}|\ge K)<\eta for all large nn.

Step 5 (proof of (ii)). Let η>0\eta>0, and take KK as in Step 4. Choose next ε>0\varepsilon>0 with LKε<ηLK\varepsilon<\eta, and let Dn={∣Yn−c∣>ε}D_{n}=\{|Y_{n}-c|>\varepsilon\}. Off Dn∪{∣Xn∣≥K}D_{n}\cup\{|X_{n}|\ge K\} we have ∣YnXn−cXn∣=∣Yn−c∣ ∣Xn∣≤εK|Y_{n}X_{n}-cX_{n}|=|Y_{n}-c|\,|X_{n}|\le\varepsilon K (Rules of Arithmetic and Order in an Ordered Field (x)), so ∣f(YnXn)−f(cXn)∣≤LKε<η|f(Y_{n}X_{n})-f(cX_{n})|\le LK\varepsilon<\eta there; hence, as in Step 3,

∣f(YnXn)−f(cXn)∣≤η+2M(1Dn+1{∣Xn∣≥K}),∣Ef(YnXn)−Ef(cXn)∣≤η+2M P(Dn)+2M P(∣Xn∣≥K).|f(Y_{n}X_{n})-f(cX_{n})|\le\eta+2M\bigl(\mathbf{1}_{D_{n}}+\mathbf{1}_{\{|X_{n}|\ge K\}}\bigr),\qquad\bigl|\mathbb{E}f(Y_{n}X_{n})-\mathbb{E}f(cX_{n})\bigr|\le\eta+2M\,P(D_{n})+2M\,P(|X_{n}|\ge K).

Finally choose N∈NN\in\mathbb{N} with P(Dn)<ηP(D_{n})<\eta and P(∣Xn∣≥K)<ηP(|X_{n}|\ge K)<\eta for every n≥Nn\ge N (as P(Dn)→0P(D_{n})\to0, and by Step 4). Then ∣Ef(YnXn)−Ef(cXn)∣≤(1+4M)η|\mathbb{E}f(Y_{n}X_{n})-\mathbb{E}f(cX_{n})|\le(1+4M)\eta for n≥Nn\ge N, and with Step 2, as in Step 3, ∣Ef(YnXn)−E′f(cX)∣<(2+4M)η|\mathbb{E}f(Y_{n}X_{n})-\mathbb{E}'f(cX)|<(2+4M)\eta for all large nn. As η>0\eta>0 was arbitrary, Ef(YnXn)→E′f(cX)\mathbb{E}f(Y_{n}X_{n})\to\mathbb{E}'f(cX).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…