Definition (Controlled Markov Chain)
Let {(xk,uk)} be a collection that satisfies this model: xk+1=f(xk,uk,wk) where xt∈X represents the state variable, ut∈U represents the action variable, wt∈W is an i.i.d noise process, and f a Measurable Function. We assume that X,U,W are Borel subsets of Polish spaces; these subsets are also called standard Borel. If {(xk,uk)} also satisfies P(xk+1∈B∣x[0,k]=a[0,t],u[0,k]=b[0,t])=P(xk+1∈B∣xk=ak,uk=bk)∀B∈B(R),k∈Z+ Then we call {(xk,uk)} a controlled Markov chain.
Consider this model again: xk+1=f(xk,uk,wk)
^statespace
where xt∈X, ut∈U, wt∈W, f a Measurable Function, X,U,W are standard Borel. We assume all Random Variables live in some Probability Space (Ω,F,P). The collection, {(xk,uk)}, satisfying also satisfies
P(xk+1∈B∣x[0,k]=a[0,t],u[0,k]=b[0,t])=P(xk+1∈B∣xk=ak,uk=bk)=:T(B∣at,bt) ^property
∀B∈B(R),k∈Z+, where T(⋅∣x,u) is a Stochastic Kernel s.t. T:X×U→X so that: >- For every B∈B(R), T(B∣⋅,⋅) is a measurable function on X×U and; >- For every fixed (a,b)∈X×U, T(⋅∣x,u) is a Probability Measure on (X,B(X)).
That is, all Stochastic Processes that satisfy , admit a Stochastic Realization in the form of almost surely.