“…Letting p k = min e∈M {p e k } for each k ∈ N, we can get for any z ∈ [k −1 , k] 3 ∩ K, e ∈ M and any Borel set B ⊂ U , where we here use the fact that in the proof of Step 1 in this theorem, we can assume that the statep i = 1 without loss of generality. As in the proof of Theorem 4.2 in [12], we construct a lattice distribution a(nK) = 2 −n , n ∈ N, and the corresponding Markov transition function K a (z, e, A) = ∞ n=1 2 −n P(nK, z, e, A) for any (z, e) ∈ X and A ∈ B(X). Moreover, the kernel K a has an everywhere non-trivial continuous component T : X × B(X) → [0, +∞) defined by T (z, e, A) = 2 −(n k+1 +1) p k+1 d 4 · m A ∩ (U × {1}) when z ∈ (((k + 1) −1 , k + 1) 3 \(k −1 , k) 3 ) ∩K, k ∈ N. Thus, the process ((S(t), I(t), R(t)), r(t)) is a T -process.…”