[See Solution] Prove the deterministic lemma we used in the proof of the GlivenkoCantelli Theorem. Lemma. If F_1, F_2, ..., F are distribution functions


Question: Prove the deterministic lemma we used in the proof of the GlivenkoCantelli Theorem.

Lemma. If \(F_{1}, F_{2}, \ldots, F\) are distribution functions and

  1. \(F_{n}(x) \rightarrow F(x)\) for each rational \(x\)
  2. \(F_{n}(x) \rightarrow F(x)\) and \(F_{n}(x-) \rightarrow F(x-)\) for each atom \(x\) of \(F\) then \(\sup _{x}\left|F_{n}(x)-F(x)\right| \rightarrow 0\)

Price: $2.99
Solution: The downloadable solution consists of 3 pages
Deliverable: Word Document

log in to your account

Don't have a membership account?
REGISTER

reset password

Back to
log in

sign up

Back to
log in