14.4. KOLMOGOROV EXTENSION THEOREM 393

By Lemma 12.10.2 on Page 318 this shows E is an algebra.With this preparation, here is the Kolmogorov extension theorem. In the statement and

proof of the theorem, Fi,Gi, and Ei will denote Borel sets. Any list of indices from I willalways be assumed to be taken in order. Thus, if J ⊆ I and J = (t1, · · · , tn) , it will alwaysbe assumed t1 < t2 < · · ·< tn.

Theorem 14.4.3 For each finite set

J = (t1, · · · , tn)⊆ I,

suppose there exists a Borel probability measure, νJ = ν t1···tn defined on the Borel sets of∏t∈J Mt such that the following consistency condition holds. If

(t1, · · · , tn)⊆ (s1, · · · ,sp) ,

thenν t1···tn (Ft1 ×·· ·×Ftn) = νs1···sp

(Gs1 ×·· ·×Gsp

)(14.4.1)

where if si = t j, then Gsi = Ft j and if si is not equal to any of the indices, tk, then Gsi = Msi .Then for E defined in Definition 14.4.1, there exists a probability measure, P and a σ

algebra F = σ (E ) such that (∏t∈I

Mt ,P,F

)is a probability space. Also there exist measurable functions, Xs : ∏t∈I Mt →Ms defined as

Xsx≡ xs

for each s ∈ I such that for each (t1 · · · tn)⊆ I,

ν t1···tn (Ft1 ×·· ·×Ftn) = P([Xt1 ∈ Ft1 ]∩·· ·∩ [Xtn ∈ Ftn ])

= P

((Xt1 , · · · ,Xtn) ∈

n

∏j=1

Ft j

)= P

(∏t∈I

Ft

)(14.4.2)

where Ft = Mt for every t /∈ {t1 · · · tn} and Fti is a Borel set. Also if f is a nonnegative

function of finitely many variables, xt1 , · · · ,xtn , measurable with respect to B(

∏nj=1 Mt j

),

then f is also measurable with respect to F and∫Mt1×···×Mtn

f (xt1 , · · · ,xtn)dν t1···tn

=∫

∏t∈I Mt

f (xt1 , · · · ,xtn)dP (14.4.3)

Proof: Let E be the algebra of sets defined in Definition 14.4.1. I want to define ameasure on E . For F ∈ E , there exists J such that F is the finite disjoint unions of sets ofRJ . Define

P0 (F)≡ νJ (πJ (F))

14.4. KOLMOGOROV EXTENSION THEOREM 393By Lemma 12.10.2 on Page 318 this shows & is an algebra. JWith this preparation, here is the Kolmogorov extension theorem. In the statement andproof of the theorem, F;,G;, and E; will denote Borel sets. Any list of indices from J willalways be assumed to be taken in order. Thus, if J C J and J = (t1,--- ,t,), it will alwaysbe assumed fy < tg < +++ < fy.Theorem 14.4.3 For each finite setJ= (t,--- stn) CT,suppose there exists a Borel probability measure, Vy = Vj... defined on the Borel sets ofIles such that the following consistency condition holds. If(t1y-+* stn) S (S1,°+* Sp),thenVejen (Fr, X00 X Fi) = Vsy-5p (Gop X +1 X Gs, ) (14.4.1)where if s; =t;, then Gs, = Fi and if s; is not equal to any of the indices, t,, then Gs, = Msg,.Then for & defined in Definition 14.4.1, there exists a probability measure, P and a oalgebra #¥ = 0(&) such thatine)telis a probability space. Also there exist measurable functions, Xs : [jer M; — Ms defined asX5X = Xzfor each s €I such that for each (t,-++t,) CT,Vijertn (Fy X11 X Fi,) = P [Xr € Fy] ++ [X, € Fi, ])= (ih) Ts) -»(T1*) (14.4.2)j=lrelwhere F, = M, for every t ¢ {t)-+-t,} and F,, is a Borel set. Also if f is a nonnegativefunction of finitely many variables, x;,,--+ ,Xt,, measurable with respect to B (- iM, };then f is also measurable with respect to F and| f (Myo Xty) AV 1 tyMr, X--XMiy,= | f (X40 ,X;,) dP (14.4.3)Ther!Proof: Let & be the algebra of sets defined in Definition 14.4.1. I want to define ameasure on &. For F € @, there exists J such that F is the finite disjoint unions of sets of&,. DefinePo (F) = vs (17 (F))