This paper introduces a nonstandard martingale derived from a discrete Markov chain, providing a novel approach to solving the heat equation with both smooth and non-smooth initial conditions.
Contribution
It develops a nonstandard martingale framework that connects discrete Markov chains to solutions of the heat equation, extending classical methods.
Findings
01
Nonstandard martingale construction from Markov chains.
02
Solution to heat equation with non-smooth initial conditions.
03
Classical solution recovered for smooth initial conditions.
Abstract
We construct a nonstandard martingale from a discrete Markov chain. This is shown to be useful for solving the heat equation with a non smooth initial condition. We show that the nonstandard solution to the heat equation with a smooth initial condition specialises to the classical solution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Statistical Mechanics and Entropy
Full text
Nonstandard Martingales, Markov Chains and the Heat Equation
Tristram de Piro
Mathematics Department, The University of Exeter, Exeter
We construct a nonstandard martingale from a discrete Markov chain. This is shown to be useful for solving the heat equation with a non smooth initial condition. We show that the nonstandard solution to the heat equation with a smooth initial condition specialises to the classical solution
One of the most fundamental results in the theory of Markov chains is the following;
Theorem 0.1**.**
*Let P be the transition matrix of an irreducible, aperiodic,positive recurrent Markov chain, {Xn}n≥0, with invariant distribution π. Then, for any initial distribution, P(Xn=j)→πj, as n→∞. In particular;
pij(n)→πj*, for all states i,j, as n→∞
Proof.
A good reference for this result is [3]. However, we give the proof as it is used and modified later. Let the initial distribution be λ, and let I be the state space. Choose {Yn}n≥0, such that {Xn}n≥0 and {Yn}n≥0 are independent, with {Yn}n≥0 Markov (π,P). Let T=inf{n≥1:Xn=Yn}. We claim that P(T<∞)=1, (∗). Let Wn=(Xn,Yn). Then {Wn}n≥0 is a Markov chain on I×I. By independence, it has transition probabilities given by;
p(i,j)(k,l)=pikpjl
and initial distribution μ(i,j)=λiπj. A simple calculation shows that;
p(i,j)(k,l)(n)=pik(n)pjl(n) for fixed states i,j,k,l
As P is irreducible and aperiodic, we have that min(pik(n),pjl(n))>0, for sufficiently large n. Hence, for such n, p(i,j)(k,l)(n)>0 and P is irreducible. A similar straightforward calculation gives that the distribution μ(i,j) is invariant for P. By well known results, this implies that P is positive recurrent. Fix a state b, and let S=inf{n≥1:Xn=Yn=b}. Then S is the first passage time in the system {Wn}n≥0 to (b,b), and P(S<∞)=1 follows by known results, and the fact that P is irreducible and recurrent. Clearly P(S<∞)≤P(T<∞), so (∗) follows. We now calculate;
P(Xn=j)=P(Xn=j,n≥T)+P(Xn=j,n<T)
=P(Yn=j,n≥T)+P(Xn=j,n<T)
by definition of T and the fact that {Xn}n≥0 and {Yn}n≥0 have the same transition matrix. Then;
P(Xn=j)=P(Yn=j,n≥T)+P(Yn=j,n<T)
\indent−P(Yn=j,n<T)+P(Xn=j,n<T)
=P(Yn=j)−P(Yn=j,n<T)+P(Xn=j,n<T)
=πj−P(Yn=j,n<T)+P(Xn=j,n<T)(∗∗)
We have that P(Yn=j,n<T)≤P(n<T) and P(n<T)→P(T=∞)=0 as n→∞, using (∗). Similarly, P(Xn=j,n<T)→0 as n→∞. It follows that P(Xn=j)→πj, using (∗∗), as required. The final claim is a consequence of the fact that pij(n)=P(Xn=j) where the initial distribution of X0 is the dirac function δi.
∎
We now establish a rate of convergence result.
Lemma 0.2**.**
*Let P be the transition matrix for a finite irreducible aperiodic Markov chain. Then there exists m≥1 and ρ∈(0,1), such that;
∣pij(n)−πj∣≤(1−ρ)mn−1*, for all states i,j
Proof.
From Theorem 0.1, taking the initial distribution of X0 to be δi, we have that;
P(Xn=j)=πj−P(Yn=j,n<T)+P(Xn=j,n<T)
Hence;
∣pij(n)−πj∣≤P(n<T)
As P is irreducible and aperiodic, we have that pkl(n)>0 for all sufficiently large n, and all states k,l. As P is finite, there exists an m≥1 such that pkl(m)>0 for all k,l. In particular, there exists ρ∈(0,1) such that pkl(m)>ρ. We have that;
It follows that ∣pij(n)−πj∣≤(1−ρ)[mn]≤(1−ρ)mn−1
∎
Lemma 0.3**.**
*Let P define a Markov chain with N states, {0,1,…,N−1} such that the transition probabilities of moving from state i to i-1,i,i+1 (mod N) respectively is 31. Then P is irreducible and aperiodic, moreover, we can choose m=N−1 and ρ=3N−11 in Lemma 0.2. It follows that;
∣pij(n)−N1∣≤(3N−13N−1−1)N−1n−1=ϵn
*If N is odd, we can choose m=2N−1 and ρ=32N−11 in Lemma 0.2. It follows that;
∣pij(n)−N1∣≤(32N−132N−1−1)N−12n−1=δn
*Moreover, for any initial probability distribution π0, letting πjn=P(Xn=j), we have that;
∣πjn−N1∣≤ϵn*, 0≤j≤N−1(∗)
*and, similarly, with δn replacing ϵn, when N is odd. For any initial distribution λ0 of positive numbers, with sum K, letting λn=λ0Pn, we have that;
∣λjn−NK∣≤Kϵn*, 0≤j≤N−1
and, similarly, with δn replacing ϵn when N is odd.
Proof.
The first two claims follow immediately by noting that for any 2 states k,lpkl((N−1)≥3N−11, and the transition probabilities pkk>0, for all states k. This also shows that we can choose m=N−1 and ρ=3N−11. The final claim of the first part follows from Lemma 0.2. The case when N is odd is similar. The penultimate claim follows by noting that πn=π0Pn and calculating;
πjn=π00p0j(n)+π10p1j(n)+…+πN−10pN−1,j(n)
=(π00+…+πN−10)(N1)+π00ϵn0+…+πN−10ϵnN−1
=N1+ϵn′
where ϵnj≤ϵn, for 0≤j≤N−1 and ϵn′≤ϵn. The case N odd is the same. The final claim follows by observing that λn=λ0Pn=Kπ0Pn for an initial probability distribution π0. Then multiply the result (∗) through by K, similarly for N odd.
∎
Lemma 0.4**.**
*Let P define a non standard Markov chain with η states, {0,1,…,η−1}, for η infinite, such that the transition probabilities of moving from state i to i-1,i,i+1 (mod η) respectively is 31. Then, if ϵ is an infinitesimal and
n≥(η−1)(1+log(3η−1−1)−log(3η−1)log(ϵ)* (∗)
*we have for any initial probability distribution π0, that;
πjn≃η1* for 0≤j≤η−1(∗∗)
*We obtain the same result, if η is odd, ϵ is an infinitesimal and;
*for any initial probability distribution π0. If λ0 is a nonstandard distribution with sum λ, possibly infinite, then if ϵ is an infinitesimal with λϵ≃0, and n satisfies (∗), we obtain that;
πjn≃ηλ* for 0≤j≤η−1(∗∗∗∗)
and, the same result holds when η is odd and n satisfies (∗∗∗).
By transfer, we obtain a corresponding result, quantifying over ∗N. Taking ϵ to be an infinitesimal and η to be an infinite natural number, we obtain the first result. Observe that by construction of G,H,L, the nonstandard Markov chain with η states evolves by the usual nonstandard matrix multiplication by the transition matrix, of the initial probability distribution. The remaining claims are similar and left to the reader.
∎
Definition 0.5**.**
*We let η,λ⊂∗N∖N, and let ν satisfy the bound (∗) in Lemma Nonstandard Martingales, Markov Chains and the Heat Equation, where ϵ is an infinitesimal with with λϵ≃0.
*We let Ωη={x∈∗R:0≤x<1}
*and Tν={t∈∗R:0≤x≤1}
*We let Cη consist of internal unions of the intervals [ηi,ηi+1), for 0≤i≤η−1, and let Dν consist of internal unions of [νi,νi+1) and {1}, for 0≤i≤ν−1.
*We define counting measures μη and λν on Cη and Dν respectively, by setting μη([ηi,ηi+1))=η1, λν([νi,νi+1))=ν1, for 0≤i≤η−1, 0≤i≤ν−1 respectively, and λν({1})=0.
We let (Ωη,Cη,μη) and (Tν,Dν,λν) be the resulting ∗-finite measure spaces, in the sense of [2]. We let (Ωη×Tν,Cη×Dν,μη×λν) denote the corresponding product space.
Definition 0.6**.**
*Let f:Ωη→∗R≥0 be measurable with respect to the ∗σ-algebra Cη, in the sense of [2], and suppose that ∗∑0≤i≤η−1f(ηi)=λ. We define F:Ωη×Tν→∗R≥0 by;
F(ηi,νj)=(πfKj)(i)*, for 0≤i≤η−1, 0≤j≤ν
F(x,y)=F(η[xη],ν[yν])*, (x,y)∈Ωη×Tν
where πf is the nonstandard distribution vector corresponding to f, K is the transition matrix of the above Markov chain with η states, and Kj denotes a nonstandard power.
Lemma 0.7**.**
*Let F be as defined in Definition 0.6, then F is measurable with respect to Cη×Dν, and, moreover F(x,1)≃C where C=∫Ωηfdμη.
Proof.
The first proposition follows by observing that the defining schema for F is internal and by transfer from the result for finite measures spaces, see Lemma for the mechanics of this transfer process. For the second proposition, observe that, by definition of the nonstandard integral, see [5], and the assumptions on f, we have that C=ηλ. The result then follows by the choice of ν and the result of Lemma .
∎
Remarks 0.8**.**
F* defines the evolution of a stochastic process, which we can think of as the density of a number of gas particles each moving independently and at random. This idea is made more precise in [6]. The final density, which we refer to as the equilibrium density is close to being constant.*
Definition 0.9**.**
*Let (Ωη,Eη,γη) be a nonstandard ∗-finite measure space. We define a reverse filtration on Ωη to be an internal collection of ∗σ-algebras Eη,i, indexed by 0≤i≤ν, such that;
*(i). Eη,0=Eη
*(ii). Eη,i⊆Eη,j, if i≥j.
*We say that F:Ωη×Tν→∗R is adapted to the filtration if F is measurable with respect to Eη×Dν and Fνi:Ωη→∗R is measurable with respect to Eη,i, for 0≤i≤ν.
*If f:Ωη→∗R is measurable with respect to Eη,j and 0≤j≤i≤ν, we define the conditional expectation Eη(f∣Eη,i) to be the unique g:Ωη→∗R such that g is measurable with respect to Eη,i and;
∫Ugdγη=∫Ufdγη
*for all U∈Eη,i. We say that F:Ωη×Tν→∗R is a reverse martingale if;
*(i). F is adapted to the reverse filtration on Ωη
*(ii). Eη(Fνj∣Eη,i)=Fνi for 0≤j≤i≤ν
*Given F:Ωη×Tν→∗R measurable with respect to Eη×Dν, we define the cumulative density function; P:∗R×[0,1]→∗R by;
P(x,t)=γη(Ft≤x)
*We say that F1 and F2 are equivalent in distribution, if their respective cumulative density functions P1 and P2 coincide.
Theorem 0.10**.**
Let F be as in Definition 0.6, then there exists a reverse filtration on Ωη and an extension of F to F such that F is a reverse martingale. Moreover the processes F and F are equivalent in distribution.
Proof.
We define the reverse filtration, by setting Eη,i to be internal unions of the intervals [3ν−iηj,3ν−iηj+1) for 0≤j≤3ν−iη−1, 0≤i≤ν. Clearly, this is an internal collection. It follows that Eη=Eη,0 consists of internal unions of the intervals [3νηj,3νηj+1) for 0≤j≤3νη−1, and we define the corresponding measure γη by setting γη([3νηj,3νηj+1))=3νη1. Observe that Eη,ν=Cη, the original ∗σ-algebra. We define special points of the first and second kind on Ωη×Tν inductively, as follows;
Base case; the points {(ηi,1):0≤i≤η−1} are special points of the first kind.
Inductive hypothesis; Suppose the special points of the first and second kind on Ωη×[νν−i,1] have been defined for 0≤i≤ν−1
Then a point (x,νν−i−1) is special of the first kind if (x,νν−i) is special of the first or second kind, in addition, the points (x+3i+1ηk,νν−i−1), 1≤k≤2, are special of the second kind, when (x,νν−i) is special of the first kind.
We call a point of the form (ηi,νj) for 0≤i≤η−1, 0≤j≤ν original. We associate original points to special points inductively as follows;
Base case; We associate the original point (ηi,1) to the special point (ηi,1), for 0≤i≤η−1
Inductive hypothesis: Suppose we have associated original points to special points on Ωη×[νν−i,1],for 0≤i≤ν−1.
Then if (x,νν−i−1) is special of the first kind, and (ηix,νν−i) is associated to (x,νν−i), we associate (ηix,νν−i−1) to (x,νν−i−1). We match original points to special points of the second kind, by associating (ηix−1,νν−i−1) to (x+3i+1η1,νν−i−1) and (ηix+1,νν−i−1) to (x+3i+1η2,νν−i−1), where (x,νν−i−1) is special of the first kind. We adopt the convention that η−1=ηη−1 and ηη=η0.
We define F on Ωη×Tν by setting F(z)=F(Γ(z)), (∗), where z is a special point of Ωη×Tν and Γ(z) is the associated original point. We then set F(x,y)=F(3ν−[νy]η[x3ν−[νy]η],ν[νy]), (∗∗).
We claim that F is a reverse martingale. By the definition (∗), F is adapted to the reverse filtration, (i). To verify (ii) of the definition of a reverse martingale in Definition 0.9, by the tower law for conditional expectation, it is sufficient to prove that Eη(Fνi∣Ei+1)=Fνi+1, for 0≤i≤ν−1. We have that;
where (ηix,νi+1) is associated to the special point (3ν−i−1ηj,νi+1)=(x,νi+1)
We now claim that if (ηi,νν−j) is an original point, then it is associated to 3j special points of the form (y,νν−j). We prove this by induction.
Base Case; j=0, then the original points {(ηi,1):0≤i≤η−1} are in bijection with the same special points.
Inductive hypothesis; Suppose that, for 0≤i≤η−1, each original point (ηi,νν−j) is associated to 3j special points of the form (y,νν−j).
If the original point (ηi,νν−j−1) is associated to a special point (x,νν−j−1), there are 3 cases, either (ηi,νν−j) is associated to (x,νν−j), or, (ηi−1,νν−j) is associated to (x−3j+1η1,νν−j), or (ηi+1,νν−j) is associated to (x−3j+1η2,νν−j). These cases are disjoint and all occur, so we obtain a total of 3.3j=3j+1 assignments.
Using this result and the definition of F, for a given α∈∗R;
Using the measurability of Fν[νt] and Fν[νt] with respect to the algebras Cη and Eη,ν−[νt] respectively.
∎
Remarks 0.11**.**
The advantage of working with a reverse martingale to analyse the cumulative density function of F is that we have available a nonstandard martingale representation theorem, Ito’s Lemma and a strategy to obtain a Fokker-Planck type equation. This is work in progress, see [4].
We make some considerations in connection with the heat equation.
Definition 0.12**.**
*We let S1(1) denote the circle of radius 1, which we identify with the closed interval [−π,π], via μ:[−π,π]→S1(1), μ(θ)=eiθ. We let C([−π,π])={μ∗(g):g∈C∞(S1)} and C∞([−π,π])={μ∗(g):g∈C∞(S1)}. We let T=[−π,π]×R≥0 and T0=(−π,π)×R>0 denote its interior. We let C∞(T)={G∈C(T):Gt∈C∞([−π,π]), for t∈R≥0,G∣T0∈C∞(T0)}. If h∈C([−π,pi]), we define its Fourier transform by;
F(h)(m)=2π1∫−ππh(x)e−imxdx
*If g∈C(T), we define its Fourier transform in space by;
F(g)(m,t)=2π1∫−ππg(x,t)e−imxdx**
Lemma 0.13**.**
*If g∈C∞([−π,π]), there exists a unique G∈C∞(T), with G0=g, such that G satisfies the heat equation;
∂t∂G=∂x2∂2G* (∗)
*on T0.
Proof.
Suppose, first, there exists such a solution G, then, applying F to (∗), we must have that;
F(∂t∂G−∂x2∂2G)(m,t)=0(t>0,m∈Z)
Differentiating under the integral sign, we have that;
F(∂t∂G)=∂t∂F(G)(m,t), for t>0,m∈Z
Integrating by parts and using the fact that Gt∈C∞([−π,π]), for t>0, we have that;
F∂x2∂2G=−m2F(G)(m,t), for t>0,m∈Z
We thus obtain the sequence of ordinary differential equations, indexed by m∈Z;
∂t∂F(G)+m2F(G)(m,t)=0(t>0)
with initial condition, given by;
F(G)(m,0)=F(g)(m)
By Picard’s Theorem, this has the unique solution, given by;
F(G)(m,t)=e−m2tF(g)(m)(t≥0)
As Gt∈C∞([−π,π]), its Fourier series converges absolutely to Gt and, in particular, Gt is determined by its Fourier coefficients, for t>0. It follows that G is a unique solution.
If g∈C∞([−π,π]), its Fourier series converges absolutely to g, hence, the series;
∑m∈Ze−m2tF(g)(m)eimx
are absolutely convergent for t>0. It follows that G defined by;
G(x,t)=∑m∈Ze−m2tF(g)(m)eimx
is a solution of the required form.
∎
Remarks 0.14**.**
Observe that as t→∞, G(x,t)→F(g)(0)=2π1∫−ππgdx, a phenomenon we observed in Lemma 0.7. This suggests that the two processes are connected, we make this observation more precise below.
Definition 0.15**.**
*If η∈∗N∖N, we let Vη=∗⋃0≤i≤2η−1[−π+πηi,−π+πηi+1), so that Vη=∗[−π,π). We let Dη denote the associated ∗-finite algebra, generated by the intervals [−π+πηi,−π+πηi+1), for 0≤i≤2η−1, and μη the associated counting measure defined by μη([−π+πηi,−π+πηi+1))=ηπ. We let (Vη,L(Dη),L(μη)) denote the associated Loeb space, see…. If ν∈∗N∖N, we let Tν=∗⋃0≤i≤ν2−1[νi,νi+1), so that Tν=[0,ν)⊂∗R≥0.We let Cη denote the associated ∗-finite algebra, generated by the intervals [νi,νi+1), for 0≤i≤ν2−1, and λν the associated counting measure defined by λν([νi,νi+1))=ν1. We let (Tν,L(Cν),L(λν)) denote the associated Loeb space.
*We let ([−π,π],D,μ) denote the interval [−π,π], with the completion D of the Borel field, and μ the restriction of Lebesgue measure. We let (R≥0∪{+∞},C,λ) denote the extended real half line, with the completion C of the extended Borel field, and λ the extension of Lebesgue measure, with λ(+∞)=∞, see….
*We let (Vη×Tν,Dη×Cν,μη×λν) be the associated product space and (Vη×Tν,L(Dη×Cη),L(μη×λν)) be the corresponding Loeb space. (Vη×Tν,L(Dη)×L(Cν),L(μη)×L(λν)) is the complete product of the Loeb spaces (Vη,L(Dη),L(μη)) and (Tν,L(Cν),L(λν)). Similarly, ([−π,π]×(R≥0∪{+∞},D×C,μ×λ) is the complete product of ([−π,π],D,μ) and (R≥0∪{+∞},C,λ).
*We let (∗R,∗E) denote the hyperreals, with the transfer of the Borel field C on R. A function f:(Vη,Dη)→(∗R,∗E) is measurable, if f−1:∗E→Dη. The same definition holds for Tν. Similarly, f:(Vη×Tν,Dη×Cν)→(∗R,∗E) is measurable, if f−1:∗E→Dη×Cν. Observe that this is equivalent to the definition given in [Loeb]. We will abbreviate this notation to f:Vη→∗R, f:Vη→∗R or f:Vη×Tν→∗R is measurable, (∗). The same
applies to (∗C,∗E), the hyper complex numbers, with the transfer of the Borel field E, generated by the complex topology. Observe that f:Vη→∗C, f:Tν→∗Cf:Vη×Tν→∗C is measurable, in this sense, iff Re(f) and Im(f) are measurable in the sense of (∗).
This follows immediately, by transfer, from the corresponding result for the discrete derivatives and shifts of discrete functions f:Hn×Tm→C, where n,m∈N, see Definition 0.15 and Definition 0.18 of [8].
For (i), using (i) from the argument in the main proof, we have;
∫Sη,ν∂x∂gd(μη×λν)
=∫Vη(∫Tν(∂x∂g)tdμη)dλν(t)
=∫Vη(∫Tν(∂x∂gt)dμη)dλν(t)
=∫Tν0dλν(t)=0
The proofs of (ii),(iii),(iv) are similar to the main proof, relying on the result of (i). (v) follows easily from Definitions 0.17 and (vi) follows, repeating the result of (iii), and applying (v).
)*
Proof.
In the first part, for (i), we have, using Definition 0.17, that;
See also the proof of Lemma 0.5 in [7]. The choice of η ensures that 1−2π2νη2≥0. Hence, inductively, if ∣Fνi∣≤M, then, by (∗);
∣Fνi+1∣≤M(4π2νη2+(1−2π2νη2)+4π2νη2)=M.
We can differentiate (∗) and replace F with ∂x∂F or ∂x2∂2F. The same argument, and the assumption on the initial conditions, gives the required bound.
∎
Lemma 0.25**.**
*If f∈C∞[−π,π], and fη is defined on Vη by;
fη(−π+πηj)=f∗(−π+πηj)
fη(x)=f(−π+ηπ[πη(x+π)]
where f∗ is the transfer of f to ∗[−π,π), then there exists a constant M∈R, such that max{fη,fη′,fη′′}≤M. In particular, if F solves the nonstandard heat equation, with initial condition fη, then, max{F,∂x∂F,∂x2∂2F}≤M as well.
Proof.
We have, for x∈[−π,π), using Taylor’s Theorem, that;
where K=max[−π,π)f′′. By transfer, it follows, that, for infinite η, (fη)′≃(f′)η. Clearly (f′)η is bounded, as f′ is, which gives the result for (fη)′. The case for (fη)′′ is similar. The final result is immediate from Lemma 0.24.
∎
Definition 0.26**.**
*We let Zη={m∈∗Z:−η≤m≤η−1} Given a measurable f:Vη→∗C, we define, for m∈Zη, the m′th discrete Fourier coefficient to be;
f^η(m)=2π1∫Vηf(y)expη(−iym)dμη(y)
Transposing Lemma 0.9 of [9], (222We have there that the measure on* Sη=λη. The result follows using the scalar map p:Vη→Sη, p(x)=πx, and the fact that p∗(μη)=λη);
f(x)=∑m∈Zηf^η(m)expη(ixm)* (∗)
*Given a measurable f:Sη,ν→∗C, we define the nonstandard vertical Fourier transform f^:Tν×Zη→∗C by;
f^(t,m)=2π1∫Vηf(t,x)expη(−ixm)dμη(x)
*and, given a measurable g:Tν×Zη→∗C, we define the nonstandard inverse vertical Fourier transform by;
gˇ(t,x)=∑m∈Zηg(t,m)expη(ixm)
*so that, by (∗), f=f^ˇ
*Similar to Definition 0.20 of [8], for f∈Vη, we let ϕη:Zη→∗C be defined by;
ϕη(m)=2πη(expη(−imηπ)−expη(imηπ))
*We let ψη:Z2η→∗C be defined by;
ψη(m)=2πη(1−expη(imη2π))
*and, we let Uη:Z2η→∗C be defined by;
Uη(m)=expη(−imη2π))
The following is the analogue of Lemma 0.14 in [9], using the definition of the discrete derivative in Definition 0.17 and the discrete Fourier coefficients from Definition 0.26;
*If f∈V(Vη), with f′′ bounded, then, there exists a constant F∈R, with;
∣f^(m)∣≤m2F*, for m∈Z2η.
*Moreover;
(∘f)(x)=∑m∈Z∘((f^)(m))exp(im∘x)*, x∈Vη.
Proof.
Using results of [9], we have that m≤∣ψη(m)∣≤2m, and ∣Uη(m)∣=1 for ∣m∣≤2η. As f′′ is bounded, so is f′′, so ∣f′′^(m)∣≤F∈R. This implies, by the result of Lemma 0.28 that;
∣f^(m)∣≤m2F. (∗)
for m∈Z2η, as required. Using the Inversion Theorem from Definition 0.26, we have that;
f(x)=∗∑m∈Z2ηf^(m)exp2η(ixm)=M, (x∈Vη)
Let L=∑m∈Z∘(f^(m))exp(im∘x)
If ϵ>0, we have, using the result of 0.29, and the fact that exp2η is S-continuous for m∈Z, that;
for n>4(F+1)ϵ, n∈N. As ϵ was arbitrary, we obtain the result.
∎
Lemma 0.30**.**
*If F solves the nonstandard heat equation, with initial condition f, bounded and S-continuous, such that ∘f(x)=g(∘x), where g is continuous and bounded on [−π,π], then;
∘(F^(m,t))=e−m2∘t(g^)(m)
*for m∈Z and finite t.
Proof.
As ∂t∂F−∂x2∂2F=0, we have, taking restrictions, that;
∂t∂F−∂x2∂2F=0
Taking Fourier coefficients, for m∈Z, and, using Lemma 0.28;
dtdF^(m,t)−θη(m)F^(m,t)=0
where θη(m)=ψη2(m)Uη(m). Then;
ν(F^(m,t+ν1)−F(m,t)^)=θη(m)F^(m,t)
Rearranging, we obtain;
F^(m,t+ν1)=(1+νθη(m))F^(m,t)
and, solving the recurrence;
F^(m,t)=(1+νθη(m))[νt]F^(m,0)
Taking standard parts, and using the facts that limn→∞(1+nx)n=ex, and ∘θη(m)=−m2, we obtain;
∘(F^(m,t))=(e−m2∘t)∘(f^(m))
for finite t. As f is bounded and S-continuous, so is f, and ∘f=∘f is integrable. We have that;
obtained in Lemma 0.13, gives the result that ∘F(x,t)=G(∘x,∘t). However, Ft is S-continuous, for finite t, by the fact that (∂x∂F)t is bounded, from Lemma 0.25, hence;
∘F(x,t)=∘F(x,t)=G(∘x,∘t)
as required.
∎
Theorem 0.32**.**
Let g∈C∞([−π,π]), and G be as in Lemma 0.13. Let f=gη, and let F be as in Lemma 0.24. Then, for infinite t, and (x,t)∈Vη×Tν, F(x,t)≃∫Vηfdμη.
Proof.
Again, using Lemma 0.25 and lemma 0.29, we have, using the proof of 0.30, that;
F(x,t)≃∑m∈Zexpν−θη(m)tf^(m)exp2ηimx
Taking standard parts, using lemma 0.29, and the fact that expν−θη(m)t≃0, for finite m and infinite t, we see that all the coefficients vanish, except when m=0, that is;
F(x,t)≃f^(0)=∫V2ηfdμ2η≃∫Vηfdμη
The result follows for F(x,t) by S-continuity.
∎
Remarks 0.33**.**
When η=32πν, we obtain, by Lemma 0.24, the iterative scheme for the nonstandard Markov chain with transition probabilities {31,31,31}. By Lemma 0.32, we obtain convergence to equilibrium after at least ν2=16π29η4 steps, which is polynomial in the number of states η. This is a considerable improvement over the result in Lemma 0.4, which is exponential in η. The discrepancy results from the choice of a ”smooth” initial distribution. The method of reverse martingales is useful to consider other ”nonsmooth” cases, for which a Fourier analysis is impossible.
Bibliography9
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A Non-Standard Representation for Brownian Motion and Ito Integration, R. Anderson, Israel Journal of Mathematics, Volume 25, (1976).
2[2] Conversion from Nonstandard to Standard Measure Spaces and Applications in Probability Theory, Peter Loeb, Transactions of the American Mathematical Society, (1975).
3[3] Markov Chains, J. R. Norris, Cambridge Series in Statistical and Probabilistic Mathematics, (1997).
4[4] A Nonstandard Version of the Fokker-Planck Equation, Tristram de Piro, preprint in progress, (2016).
5[5] Applications of Nonstandard Analysis to Probability Theory, Tristram de Piro, M.Sc Dissertation in Financial Mathematics, University of Exeter, (2013).
6[6] Electron Bunching, Tristram de Piro, preprint in progress, (2016).
7[7] Solving the Heat Equation using Nonstandard Analysis, Tristram de Piro, (2014).
8[8] A Simple Proof of the Fourier Inversion Theorem using Nonstandard Analysis, Tristram de Piro, (2013).