Step 0 (a Dynkin factorization principle). Call a collection of events a π-system if it contains Ω and is closed under pairwise intersection. We first record: if A and B are π-systems of events with P(A∩B)=P(A)P(B) for all A∈A and B∈B, then the same identity holds for all A∈σ(A) and B∈σ(B), where σ(⋅) denotes the generated σ-algebra. Indeed, fix B∈B and let L={A∈F:P(A∩B)=P(A)P(B)}. Then Ω∈L; if A,A′∈L with A⊆A′ then P((A′∖A)∩B)=P(A′∩B)−P(A∩B)=(P(A′)−P(A))P(B), so A′∖A∈L; and if events An∈L increase to A, then writing A=A1⊔⨆n≥1(An+1∖An) and intersecting with B, countable additivity of P (probability space) gives P(A∩B)=limnP(An∩B)=limnP(An)P(B)=P(A)P(B), so A∈L. Hence L is a λ-system containing A, and Dynkin's π-λ theorem gives σ(A)⊆L. Now fix A∈σ(A) and repeat the argument with L′={B∈F:P(A∩B)=P(A)P(B)}⊇B to obtain σ(B)⊆L′.
Part (a). If I or J is empty the claim is trivial, every event being independent of ∅ and Ω; so assume both are nonempty. Let AI consist of Ω together with all finite intersections ⋂h∈I′{ξh∈Bh} with I′⊆I finite nonempty and each Bh a Borel set, and define AJ likewise. Each is a π-system: the intersection of two such events is again one, merging the index sets and replacing Bh by the intersection of the two Borel sets where an index occurs in both. Moreover σ(AI)=σ(ξh:h∈I), since the events {ξh∈B} with h∈I and B Borel generate the latter and lie in AI. For A=⋂h∈I′{ξh∈Bh}∈AI and B=⋂h∈J′{ξh∈Bh′}∈AJ, the independence of ξ1,…,ξq - applied with the Borel sets Bh for h∈I′, Bh′ for h∈J′ (I′ and J′ being disjoint), and R for every other index, and then again with R outside I′ alone and outside J′ alone - gives
P(A∩B)=h∈I′∏P(ξh∈Bh)h∈J′∏P(ξh∈Bh′)=P(A)P(B).
The cases A=Ω or B=Ω are trivial. Step 0 now yields the independence of σ(ξh:h∈I) and σ(ξh:h∈J), which is part (a).
Part (b). Let Cpast consist of Ω and all finite intersections ⋂i=1p{Xsi∈Bi} with 0≤s1<⋯<sp≤r and Bi Borel, and let Cfut consist of Ω and all finite intersections ⋂j=1m{Xr+uj−Xr∈Bj′} with 0<u1<⋯<um and Bj′ Borel. Both are π-systems, exactly as in part (a). Also σ(Cpast)=FrX, the natural filtration at r being generated by the variables Xs with s≤r; and σ(Cfut)=σ(Xr+u−Xr:u≥0), since the increment for u=0 is the constant 0, whose level events are ∅ or Ω, so omitting u=0 loses nothing. By Step 0 it suffices to prove P(A∩B)=P(A)P(B) for A∈Cpast and B∈Cfut, the cases A=Ω or B=Ω being trivial; so fix A=⋂i{Xsi∈Bi} and B=⋂j{Xr+uj−Xr∈Bj′} as displayed.
Let 0=v0<v1<⋯<vq enumerate, in increasing order, the distinct elements of {0}∪{s1,…,sp}∪{r}∪{r+u1,…,r+um}, and set Dh=Xvh−Xvh−1 for h∈{1,…,q} (differences of random variables are random variables, as noted in the definition of independent increments). By the independent-increments property applied to the partition v0<v1<⋯<vq, the family D1,…,Dq is independent. Put I={h:vh≤r} and J={h:vh−1≥r}; these are disjoint, since vh≤r≤vh−1 is impossible for vh−1<vh.
For each j: since r and r+uj are partition points, telescoping gives Xr+uj−Xr=∑h∈J:vh≤r+ujDh, a finite sum of the variables Dh with h∈J; hence B∈σ(Dh:h∈J), finite sums of the generating variables being measurable with respect to the generated σ-algebra.
For each i: on the event {X0=c}, telescoping from v0=0 gives Xsi=c+∑h∈I:vh≤siDh. Define
A~=i=1⋂p{c+h∈I:vh≤si∑Dh∈Bi}∈σ(Dh:h∈I).
The events A and A~ agree on {X0=c}, whose complement is a null event by hypothesis, so P(A)=P(A~) and P(A∩B)=P(A~∩B). By part (a) applied to the family D1,…,Dq and the disjoint index sets I and J,
P(A∩B)=P(A~∩B)=P(A~)P(B)=P(A)P(B),
which completes part (b).