The maximal inequality is proved by decomposing the event into first-passage events Aj and using block independence to kill the cross term, so that E[(Tm−Tn)2 1_{A_j}] >= eps2P(Aj); continuity from below then bounds the probability of large oscillation after time n by r2 times the tail sum, which identifies the convergence set as the complement of a null event via the Cauchy criterion. Fatou gives E[(T-T_n)^2] <= tail, and expanding (T-T_n)^2 around Tm with Cauchy-Schwarz yields equality, E[T]=0 and E[T2].
Proof
Each result cited below is universally quantified over the data in its own statement.
(a) Random variables. By claim 1 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions the zero function T0 is a random variable, and by claim 2 of the same lemma each Tn=∑k=1nξk (n∈N) is a random variable. Each ξk is square-integrable, so by Square-Integrable Random Variables and the Mean-Square Inner Product (closure of square-integrable variables under sums and scalar multiples, and integrability of products of square-integrable variables and of square-integrable variables themselves) every finite linear combination of the ξk, in particular every Tn and every difference Tm−Tn, is square-integrable and integrable, and products of two such combinations are integrable. For 0≤n<m with m∈N, the finite-sum rules give, pointwise,
(b) Tails. Put vk=E[ξk2], a nonnegative real number since ξk is square-integrable. Put s0=0 and sn=∑k=1nvk for n∈N, and let S=∑k=1∞vk, which exists by hypothesis; by the definition of the sum of a series, sn→S. For n≥0 put τn=S−sn. By induction on n, the series ∑k=1∞vn+k converges and its sum is τn: for n=0 this is the hypothesis, and if it holds for n, then the index-shift lemma applied to ak=vn+k, bk=vn+1+k shows that ∑k=1∞vn+1+k converges with sum τn−vn+1=S−sn+1=τn+1. Thus τn is the number written ∑k=n+1∞E[ξk2] in the statement. By domination by the sum, sn≤S, so τn≥0; by the limit laws, τn→0 as n→∞; and for 0≤n<m,
where the empty intersection (for j=n+1) is Ω; each Aj is an event, being a finite intersection of events, under which F is closed by Sigma-Algebra and Measurable Space. The Aj are pairwise disjoint: if j<j′ then Aj⊆Ej while Aj′⊆Ω∖Ej. Their union is A: each Aj⊆Ej⊆A, and if ω∈A, let j be the least integer in {n+1,…,m} with ω∈Ej; then ω∈Aj. By finite additivity (after relabelling the indices n+1,…,m as 1,…,m−n),
Now compare pointwise. On Aj we have D=(Tj−Tn)+Wj and Uj=Tj−Tn, so D2=Uj2+2UjWj+Wj2 there; off Aj both D21Aj and Uj vanish. Hence, pointwise on Ω,
Summation. Since the Aj are pairwise disjoint with union A, pointwise ∑j=n+1mD21Aj=D21A≤D2. By the additivity and monotonicity in claim 1 of Linearity and Monotonicity of the Lebesgue Integral (additivity applied finitely often), (1), (2) and (0),
Step 2. Claim 2 (almost sure convergence). For n≥0 and r∈N let Bn,r be the set of ω for which there is an integer j>n with ∣Tj(ω)−Tn(ω)∣≥1/r. For M∈N let An,M,r be the set A of claim 1 for the data n, m=n+M, ε=1/r. Each An,M,r is an event, An,M,r⊆An,M+1,r, and Bn,r=⋃M∈NAn,M,r, so Bn,r is an event, as a countable union of events (property 3 of Sigma-Algebra and Measurable Space). By claim 1 and Step 0(b), P(An,M,r)≤r2∑k=n+1n+Mvk≤r2τn for all M. These probabilities are real and bounded above, so by continuity from belowP(Bn,r) is their least upper bound, whence
P(Bn,r)≤r2τn.(3)
For r∈N let Gr=⋂n∈NBn,r, an event, since by Sigma-Algebra and Measurable Space a σ-algebra is closed under countable intersections. For every n∈N, monotonicity and (3) give 0≤P(Gr)≤r2τn; since r2τn→0 as n→∞ (Step 0(b) and the limit laws), the order of limits gives P(Gr)≤0, so P(Gr)=0. Let G=⋃r∈NGr, an event by property 3 of Sigma-Algebra and Measurable Space; by countable subadditivityP(G)≤∑rP(Gr)=0, so P(G)=0.
We show C=Ω∖G. Let ω∈C with limit L=limiTi(ω), and let r∈N. By Limit of a Sequence of Real Numbers there is N∈N with ∣Ti(ω)−L∣<1/(2r) for all i≥N; then for every j>N, ∣Tj(ω)−TN(ω)∣≤∣Tj(ω)−L∣+∣L−TN(ω)∣<1/r, so ω∈/BN,r and hence ω∈/Gr. As r was arbitrary, ω∈/G. Conversely let ω∈/G and let ε>0. By the Archimedean property choose r∈N with 2/r<ε. Since ω∈/Gr, there is n∈N with ω∈/Bn,r, that is, ∣Tj(ω)−Tn(ω)∣<1/r for all j>n, and trivially also for j=n. For all integers i,j≥n this gives ∣Ti(ω)−Tj(ω)∣≤∣Ti(ω)−Tn(ω)∣+∣Tn(ω)−Tj(ω)∣<2/r<ε. So (Ti(ω))i∈N is a Cauchy sequence, which converges by Every Cauchy Sequence of Real Numbers Converges; thus ω∈C.
(b) The upper bound. Fix n≥0. For m∈N let gm=(Tn+m−Tn)2 and h=(T−Tn)2; these are nonnegative random variables (claims 2 and 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions). By (0), E[gm]≤τn for every m. Let ω∈C. Given δ>0 there is N with ∣Ti(ω)−T(ω)∣<δ for i≥N, hence for i=n+m whenever m≥N; so Tn+m(ω)→T(ω) as m→∞, and by the limit laws gm(ω)→h(ω). We check that then (liminfmgm)(ω)=h(ω), with liminf as defined in Fatou's Lemma. Write cm=gm(ω)≥0 and L=h(ω), and let δ>0; choose K∈N with ∣cm−L∣<δ for m≥K. For every k∈N, with k′=max(k,K), we have infm≥kcm≤ck′<L+δ; and infm≥Kcm≥L−δ since L−δ is a lower bound of {cm:m≥K}. Hence supkinfm≥kcm lies in [L−δ,L+δ] for every δ>0, so it equals L. Thus liminfmgm and h agree on C, i.e. off the null set Ω∖C. Both are measurable (the former by Fatou's Lemma), so by almost-everywhere comparison and Fatou's Lemma,
E[h]=∫Ω(mliminfgm)dP≤mliminfE[gm]≤τn,
the last inequality because infm≥kE[gm]≤E[gk]≤τn for every k. Thus
Hence E[(T−Tn)2]−τn≤τm+2τmτn for every m>n. As m→∞, τm→0 by Step 0(b), and τm→0 (given δ>0, τm<δ2 for large m, and then τm<δ by monotonicity of squares on nonnegative numbers); so the right-hand side tends to 0 by the limit laws, and by the order of limits the nonnegative constant on the left is ≤0, hence 0. Therefore