Chapter 13

The Central Limit Problem: The Noncentered Case

[2/100%]
Show
LaTeX
Problem 13.1

Under the assumption of Theorem 1, the convergence in (13.29) holds if and only if (13.30) holds for every ε>0\varepsilon > 0. With the notation Xˉnj=Xnj−αnj\bar{X}_{n j} = X_{n j}-\alpha_{n j} and Xˉnj\bar{X}_{n j} having d.f. Fˉnj\bar{F}_{n j}, and Sˉn=∑j=1nXˉnj\bar{S}_{n} = \sum_{j = 1}^{n} \bar{X}_{n j}, show that the convergence in (13.29) follows from the condition

∑j=1kn∫(∣x∣≥εsn)x2dFˉnj(x)→n→∞0 for every ε>0 \sum _{j = 1}^{k_{n}} \int _{\left(\left|x\right| \geq \varepsilon s_{n}\right)} x^{2} d \bar{F}_{n j}(x) \underset {n \rightarrow \infty }{\rightarrow } 0 \text{ for every } \varepsilon > 0
?
Problem 13.2

In Theorem 1 of this chapter, as well as Theorem 1 of Chapter 12, under some basic assumptions on the r.v.s Xnj,j=1,…,knX_{n j}, j = 1, \ldots , k_{n}, given in the theorems cited, a necessary and sufficient condition is given (namely, gn(ε)⟶n→∞0g_{n}(\varepsilon ) \underset {n \rightarrow \infty }{\longrightarrow } 0 for every ε>0\varepsilon > 0) so that

L(Sn)⇒n→∞N(μ,σ2),μ∈R,σ2∈(0,∞) \mathcal{L}\left(S_{n}\right) \underset {n \rightarrow \infty }{\Rightarrow } N\left(\mu , \sigma ^{2}\right), \quad \mu \in \mathbb {R}, \quad \sigma ^{2} \in (0, \infty )

where Sn=∑j=1knXnjS_{n} = \sum_{j = 1}^{k_{n}} X_{n j}. Thus,

P(Sn≤x)=FSn(x)⟶n→∞Φ(x;μ,σ2),x∈R, \mathbb {P}\left(S_{n} \leq x\right) = F_{S_{n}}(x) \underset {n \rightarrow \infty }{\longrightarrow } \Phi \left(x ; \mu , \sigma ^{2}\right), \quad x \in \mathbb {R},

where Φ(x;μ,σ2)\Phi \left(x ; \mu , \sigma^{2}\right) is the d.f. of the N(μ,σ2)N\left(\mu , \sigma^{2}\right) distribution. Actually, the preceding convergence is uniform in x∈Rx \in \mathbb {R}. That is, for every ε>0\varepsilon > 0 there exists N(ε)>0N(\varepsilon ) > 0, independent of x∈Rx \in \mathbb {R}, such that n≥N(ε)n \geq N(\varepsilon ) implies

∣FSn(x)−Φ(x;μ,σ2)∣<ε for all x∈R.(*) \left|F_{S_{n}}(x)-\Phi \left(x ; \mu , \sigma ^{2}\right)\right| < \varepsilon \text{ for all } x \in \mathbb {R} . \tag {*}

This result is a consequence of the following fact (known as Pólya's Lemma). Namely, if FF and {Fn}\left\{ F_{n}\right\} are d.f.s of r.v.s such that Fn(x)⟶n→∞F(x),x∈RF_{n}(x) \underset {n \rightarrow \infty }{\longrightarrow } F(x), x \in \mathbb {R}, and FF is continuous, then the convergence is uniform in x∈Rx \in \mathbb {R}. Establish this fact.

?
Remark.
?

The uniformity asserted in (∗)\left({ }^{*}\right) is what legitimizes as simple an approximation as that in the Binomial case. Thus, if X1,…,XnX_{1}, \ldots , X_{n} are independent, distributed as B(1,p)B(1, p), and if aa and bb are integers with 0≤a<b≤n0 \leq a < b \leq n, then, for sufficiently large n,P(a<Sn≤b)≃Φ(b−npnpq)−Φ(a−npnpq)n, \mathbb {P}\left(a < S_{n} \leq b\right) \simeq \Phi \left(\frac{b-n p}{\sqrt{n p q}}\right)-\Phi \left(\frac{a-n p}{\sqrt{n p q}}\right), where Sn=∑j=1nXj,q=1−pS_{n} = \sum_{j = 1}^{n} X_{j}, q = 1-p, and Φ(x)=Φ(x;0,1)\Phi (x) = \Phi (x ; 0,1). This is so, because P(Sn≤b)=P(∑j=1nZj≤b−npnpq)\mathbb {P}\left(S_{n} \leq b\right) = \mathbb {P}\left(\sum_{j = 1}^{n} Z_{j} \leq \frac{b-n p}{\sqrt{n p q}}\right), where Zj=1nXj−ppq,j=1,…,nZ_{j} = \frac{1}{\sqrt{n}} \frac{X_{j}-p}{\sqrt{p q}}, j = 1, \ldots , n, and ∣P(∑j=1nZj≤b−npnpq)−Φ(b−npnpq)∣<ε\left|\mathbb {P}\left(\sum_{j = 1}^{n} Z_{j} \leq \frac{b-n p}{\sqrt{n p q}}\right)-\Phi \left(\frac{b-n p}{\sqrt{n p q}}\right)\right| < \varepsilon for n≥N(ε)n \geq N(\varepsilon ) independently of b−npnpq\frac{b-n p}{\sqrt{n p q}}; and likewise for P(Sn≤a)\mathbb {P}\left(S_{n} \leq a\right).