Throughout, E ′ \mathbb{E}' E ′ is expectation on ( Ω ′ , F ′ , P ′ ) (\Omega',\mathcal{F}',P') ( Ω ′ , F ′ , P ′ ) ; X n + Y n X_{n}+Y_{n} X n + Y n , Y n X n Y_{n}X_{n} Y n X n , X n + c X_{n}+c X n + c and c X n cX_{n} c X n are random variables on ( Ω , F , P ) (\Omega,\mathcal{F},P) ( Ω , F , P ) , and X + c X+c X + c , c X cX c X on ( Ω ′ , F ′ , P ′ ) (\Omega',\mathcal{F}',P') ( Ω ′ , 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) ); d R ( x , y ) = ∣ x − y ∣ d_{\mathbb{R}}(x,y)=|x-y| d 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 ( Y n ) (Y_{n}) ( Y n ) says P ( ∣ Y n − c ∣ > ε ) → 0 P(|Y_{n}-c|>\varepsilon)\to0 P ( ∣ Y n − c ∣ > ε ) → 0 for every ε > 0 \varepsilon>0 ε > 0 (Convergence in Probability (i) ); and Convergence in Distribution through Expectations of Bounded Continuous and of Bounded Lipschitz Functions is applied with every ( Ω n , F n , P n ) (\Omega_{n},\mathcal{F}_{n},P_{n}) ( Ω n , F n , P n ) equal to ( Ω , F , P ) (\Omega,\mathcal{F},P) ( Ω , F , P ) and with ( Ω ′ , F ′ , P ′ ) (\Omega',\mathcal{F}',P') ( Ω ′ , F ′ , P ′ ) in place of ( Ω , F , P ) (\Omega,\mathcal{F},P) ( Ω , 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 → R f:\mathbb{R}\to\mathbb{R} f : R → R , that E f ( X n + Y n ) → E ′ f ( X + c ) \mathbb{E}f(X_{n}+Y_{n})\to\mathbb{E}'f(X+c) E f ( X n + Y n ) → E ′ f ( X + c ) and E f ( Y n X n ) → E ′ f ( c X ) \mathbb{E}f(Y_{n}X_{n})\to\mathbb{E}'f(cX) E f ( Y n X n ) → E ′ f ( c X ) . Let ∣ f ∣ ≤ M |f|\le M ∣ f ∣ ≤ M and let L L L be a Lipschitz constant; the random variables f ( ⋅ ) f(\cdot) f ( ⋅ ) below are bounded by M M M , hence integrable (Bounded Measurable Functions on a Finite Measure Space Are Integrable (i) ).
Step 2 (the shifted and scaled sequences). Let g ( x ) = x + c g(x)=x+c g ( x ) = x + c (resp. g ( x ) = c x g(x)=cx g ( x ) = c x ). Since ∣ ( x + c ) − ( y + c ) ∣ = ∣ x − y ∣ |(x+c)-(y+c)|=|x-y| ∣ ( x + c ) − ( y + c ) ∣ = ∣ x − y ∣ and ∣ c x − c y ∣ = ∣ c ∣ ∣ x − y ∣ |cx-cy|=|c|\,|x-y| ∣ c x − 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) ), g g g is Lipschitz with constant 1 1 1 (resp. ∣ c ∣ |c| ∣ c ∣ ), so f ∘ g f\circ g f ∘ g is bounded by M M M and Lipschitz with constant L L L (resp. L ∣ c ∣ L|c| L ∣ c ∣ ), in particular continuous (A Lipschitz Map is Uniformly Continuous and Continuous (ii) ). As f ( X n + c ) = ( f ∘ g ) ( X n ) f(X_{n}+c)=(f\circ g)(X_{n}) f ( X n + c ) = ( f ∘ g ) ( X n ) and f ( X + c ) = ( f ∘ g ) ( X ) f(X+c)=(f\circ g)(X) f ( X + c ) = ( f ∘ g ) ( X ) (resp. f ( c X n ) = ( f ∘ g ) ( X n ) f(cX_{n})=(f\circ g)(X_{n}) f ( c X n ) = ( f ∘ g ) ( X n ) and f ( c X ) = ( f ∘ g ) ( X ) f(cX)=(f\circ g)(X) f ( c X ) = ( f ∘ g ) ( X ) ), Convergence in Distribution through Expectations of Bounded Continuous and of Bounded Lipschitz Functions (ii) applied to X n → d X X_{n}\xrightarrow{d}X X n d X and the function f ∘ g f\circ g f ∘ g , gives
E f ( X n + c ) → E ′ f ( X + c ) , E f ( c X n ) → E ′ f ( c X ) . \mathbb{E}f(X_{n}+c)\to\mathbb{E}'f(X+c),\qquad\mathbb{E}f(cX_{n})\to\mathbb{E}'f(cX). E f ( X n + c ) → E ′ f ( X + c ) , E f ( c X n ) → E ′ f ( c X ) .
Step 3 (proof of (i) ). For ε > 0 \varepsilon>0 ε > 0 let D n = { ∣ Y n − c ∣ > ε } D_{n}=\{|Y_{n}-c|>\varepsilon\} D n = { ∣ Y n − c ∣ > ε } . Off D n D_{n} D n the Lipschitz bound gives ∣ f ( X n + Y n ) − f ( X n + c ) ∣ ≤ L ∣ Y n − c ∣ ≤ L ε |f(X_{n}+Y_{n})-f(X_{n}+c)|\le L|Y_{n}-c|\le L\varepsilon ∣ f ( X n + Y n ) − f ( X n + c ) ∣ ≤ L ∣ Y n − c ∣ ≤ L ε , and on D n D_{n} D n this difference is at most 2 M 2M 2 M because ∣ f ∣ ≤ M |f|\le M ∣ f ∣ ≤ M . Hence ∣ f ( X n + Y n ) − f ( X n + c ) ∣ ≤ L ε + 2 M 1 D n |f(X_{n}+Y_{n})-f(X_{n}+c)|\le L\varepsilon+2M\,\mathbf{1}_{D_{n}} ∣ f ( X n + Y n ) − f ( X n + c ) ∣ ≤ L ε + 2 M 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)
∣ E f ( X n + Y n ) − E f ( X n + c ) ∣ ≤ L ε + 2 M P ( D n ) . \bigl|\mathbb{E}f(X_{n}+Y_{n})-\mathbb{E}f(X_{n}+c)\bigr|\le L\varepsilon+2M\,P(D_{n}). E f ( X n + Y n ) − E f ( X n + c ) ≤ L ε + 2 M P ( D n ) .
Now let δ > 0 \delta>0 δ > 0 . Choose first ε > 0 \varepsilon>0 ε > 0 with L ε < δ / 2 L\varepsilon<\delta/2 L ε < δ /2 , and then, since P ( D n ) → 0 P(D_{n})\to0 P ( D n ) → 0 , an N 1 ∈ N N_{1}\in\mathbb{N} N 1 ∈ N with 2 M P ( D n ) < δ / 2 2M\,P(D_{n})<\delta/2 2 M P ( D n ) < δ /2 for every n ≥ N 1 n\ge N_{1} n ≥ N 1 ; thus ∣ E f ( X n + Y n ) − E f ( X n + c ) ∣ < δ |\mathbb{E}f(X_{n}+Y_{n})-\mathbb{E}f(X_{n}+c)|<\delta ∣ E f ( X n + Y n ) − E f ( X n + c ) ∣ < δ for n ≥ N 1 n\ge N_{1} n ≥ N 1 . By Step 2 there is N 2 ∈ N N_{2}\in\mathbb{N} N 2 ∈ N with ∣ E f ( X n + c ) − E ′ f ( X + c ) ∣ < δ |\mathbb{E}f(X_{n}+c)-\mathbb{E}'f(X+c)|<\delta ∣ E f ( X n + c ) − E ′ f ( X + c ) ∣ < δ for n ≥ N 2 n\ge N_{2} n ≥ N 2 , so
∣ E f ( X n + Y n ) − E ′ f ( X + c ) ∣ < 2 δ ( n ≥ max ( N 1 , N 2 ) ) . \bigl|\mathbb{E}f(X_{n}+Y_{n})-\mathbb{E}'f(X+c)\bigr|<2\delta\qquad(n\ge\max(N_{1},N_{2})). E f ( X n + Y n ) − E ′ f ( X + c ) < 2 δ ( n ≥ max ( N 1 , N 2 )) .
As δ > 0 \delta>0 δ > 0 was arbitrary, E f ( X n + Y n ) → E ′ f ( X + c ) \mathbb{E}f(X_{n}+Y_{n})\to\mathbb{E}'f(X+c) E f ( X n + Y n ) → E ′ f ( X + c ) .
Step 4 (the X n X_{n} X n are uniformly unlikely to be large). Let η > 0 \eta>0 η > 0 . By Properties of Distribution Functions (iii) and Properties of Distribution Functions (iv) there are reals m 1 , m 2 > 0 m_{1},m_{2}>0 m 1 , m 2 > 0 such that the distribution function F X F_{X} F X satisfies F X ( t ) < η / 2 F_{X}(t)<\eta/2 F X ( t ) < η /2 for t ≤ − m 1 t\le-m_{1} t ≤ − m 1 and F X ( t ) > 1 − η / 2 F_{X}(t)>1-\eta/2 F X ( t ) > 1 − η /2 for t ≥ m 2 t\ge m_{2} t ≥ m 2 . Put K = m 1 + m 2 + 1 > 0 K=m_{1}+m_{2}+1>0 K = m 1 + m 2 + 1 > 0 ; since − K ≤ − m 1 -K\le-m_{1} − K ≤ − m 1 and K − 1 ≥ m 2 K-1\ge m_{2} K − 1 ≥ m 2 , we have F X ( − K ) < η / 2 F_{X}(-K)<\eta/2 F X ( − K ) < η /2 and F X ( K − 1 ) > 1 − η / 2 F_{X}(K-1)>1-\eta/2 F X ( K − 1 ) > 1 − η /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\}}, 1 { ∣ X ∣ ≥ K } ≤ 1 { X ≤ − K } + 1 − 1 { X ≤ K − 1 } ,
since the right side is nonnegative, and if ∣ X ∣ ≥ K |X|\ge K ∣ X ∣ ≥ K then either X ≤ − K X\le-K X ≤ − K , where the right side is at least 1 1 1 , or X ≥ K > K − 1 X\ge K>K-1 X ≥ K > K − 1 , where it equals 1 1 1 . Taking expectations on ( Ω ′ , F ′ , P ′ ) (\Omega',\mathcal{F}',P') ( Ω ′ , 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 ) ≤ F X ( − K ) + 1 − F X ( K − 1 ) < η . P'(|X|\ge K)\le F_{X}(-K)+1-F_{X}(K-1)<\eta . P ′ ( ∣ X ∣ ≥ K ) ≤ F X ( − K ) + 1 − F X ( K − 1 ) < η .
The set C K = { x ∈ R : ∣ x ∣ ≥ K } C_{K}=\{x\in\mathbb{R}:|x|\ge K\} C K = { x ∈ R : ∣ x ∣ ≥ K } is closed : its complement is the open ball B d R ( 0 , K ) B_{d_{\mathbb{R}}}(0,K) B d 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 , d R ) (\mathbb{R},d_{\mathbb{R}}) ( R , d R ) (The Open Subsets of a Metric Space Form a Topology (i) ). Hence Portmanteau Theorem on a Metric Space (iii) , applied to the laws, P X n ⇒ P X P_{X_{n}}\Rightarrow P_{X} P X n ⇒ P X (Convergence in Distribution of Random Elements of a Metric Space (i) ), gives
lim sup n → ∞ P ( ∣ X n ∣ ≥ K ) ≤ P ′ ( ∣ X ∣ ≥ K ) < η , \limsup_{n\to\infty}P(|X_{n}|\ge K)\le P'(|X|\ge K)<\eta , n → ∞ lim sup P ( ∣ X n ∣ ≥ K ) ≤ P ′ ( ∣ X ∣ ≥ K ) < η ,
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 n P ( ∣ X n ∣ ≥ K ) > 0 \eta-\limsup_{n}P(|X_{n}|\ge K)>0 η − lim sup n P ( ∣ X n ∣ ≥ 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 ( ∣ X n ∣ ≥ K ) < η P(|X_{n}|\ge K)<\eta P ( ∣ X n ∣ ≥ K ) < η for all large n n n .
Step 5 (proof of (ii) ). Let η > 0 \eta>0 η > 0 , and take K K K as in Step 4. Choose next ε > 0 \varepsilon>0 ε > 0 with L K ε < η LK\varepsilon<\eta L K ε < η , and let D n = { ∣ Y n − c ∣ > ε } D_{n}=\{|Y_{n}-c|>\varepsilon\} D n = { ∣ Y n − c ∣ > ε } . Off D n ∪ { ∣ X n ∣ ≥ K } D_{n}\cup\{|X_{n}|\ge K\} D n ∪ { ∣ X n ∣ ≥ K } we have ∣ Y n X n − c X n ∣ = ∣ Y n − c ∣ ∣ X n ∣ ≤ ε K |Y_{n}X_{n}-cX_{n}|=|Y_{n}-c|\,|X_{n}|\le\varepsilon K ∣ Y n X n − c X n ∣ = ∣ Y n − c ∣ ∣ X n ∣ ≤ ε K (Rules of Arithmetic and Order in an Ordered Field (x) ), so ∣ f ( Y n X n ) − f ( c X n ) ∣ ≤ L K ε < η |f(Y_{n}X_{n})-f(cX_{n})|\le LK\varepsilon<\eta ∣ f ( Y n X n ) − f ( c X n ) ∣ ≤ L K ε < η there; hence, as in Step 3,
∣ f ( Y n X n ) − f ( c X n ) ∣ ≤ η + 2 M ( 1 D n + 1 { ∣ X n ∣ ≥ K } ) , ∣ E f ( Y n X n ) − E f ( c X n ) ∣ ≤ η + 2 M P ( D n ) + 2 M P ( ∣ X n ∣ ≥ 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). ∣ f ( Y n X n ) − f ( c X n ) ∣ ≤ η + 2 M ( 1 D n + 1 { ∣ X n ∣ ≥ K } ) , E f ( Y n X n ) − E f ( c X n ) ≤ η + 2 M P ( D n ) + 2 M P ( ∣ X n ∣ ≥ K ) .
Finally choose N ∈ N N\in\mathbb{N} N ∈ N with P ( D n ) < η P(D_{n})<\eta P ( D n ) < η and P ( ∣ X n ∣ ≥ K ) < η P(|X_{n}|\ge K)<\eta P ( ∣ X n ∣ ≥ K ) < η for every n ≥ N n\ge N n ≥ N (as P ( D n ) → 0 P(D_{n})\to0 P ( D n ) → 0 , and by Step 4). Then ∣ E f ( Y n X n ) − E f ( c X n ) ∣ ≤ ( 1 + 4 M ) η |\mathbb{E}f(Y_{n}X_{n})-\mathbb{E}f(cX_{n})|\le(1+4M)\eta ∣ E f ( Y n X n ) − E f ( c X n ) ∣ ≤ ( 1 + 4 M ) η for n ≥ N n\ge N n ≥ N , and with Step 2, as in Step 3, ∣ E f ( Y n X n ) − E ′ f ( c X ) ∣ < ( 2 + 4 M ) η |\mathbb{E}f(Y_{n}X_{n})-\mathbb{E}'f(cX)|<(2+4M)\eta ∣ E f ( Y n X n ) − E ′ f ( c X ) ∣ < ( 2 + 4 M ) η for all large n n n . As η > 0 \eta>0 η > 0 was arbitrary, E f ( Y n X n ) → E ′ f ( c X ) \mathbb{E}f(Y_{n}X_{n})\to\mathbb{E}'f(cX) E f ( Y n X n ) → E ′ f ( c X ) .