On the compensator in the Doob-Meyer decomposition of the Snell envelope
Saul D. Jacka, Dominykas Norgilas

TL;DR
This paper investigates the structure of the Snell envelope in optimal stopping problems, establishing conditions for its finite-variation part, linking it to the generator of the underlying process, and applying these results to control problems and smooth pasting.
Contribution
It provides new insights into the compensator in the Doob-Meyer decomposition of the Snell envelope, especially in the Markovian setting, and connects it to stochastic control and smooth pasting conditions.
Findings
Finite-variation part of the Snell envelope is absolutely continuous w.r.t. the decreasing part of the original process.
Conditions identified for the value function to be in the domain of the extended generator.
Dual problem of optimal stopping is characterized as a stochastic control problem with explicit control functions.
Abstract
Let be a semimartingale, and its Snell envelope. Under the assumption that , we show that the finite-variation part of is absolutely continuous with respect to the decreasing part of the finite-variation part of . In the Markovian setting, this enables us to identify sufficient conditions for the value function of the optimal stopping problem to belong to the domain of the extended (martingale) generator of the underlying Markov process. We then show that the \textit{dual} of the optimal stopping problem is a stochastic control problem for a controlled Markov process, and the optimal control is characterised by a function belonging to the domain of the martingale generator. Finally, we give an application to the smooth pasting condition.
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.
\xpatchcmd\cref@thmnoarg
On the compensator in the Doob-Meyer decomposition of the Snell envelope
Saul D. Jacka and Dominykas Norgilas
Department of Statistics, University of Warwick
Coventry CV4 7AL, UK Saul D. Jacka gratefully acknowledges funding received from the EPSRC grant EP/P00377X/1 and is also grateful to the Alan Turing Institute for their financial support under the EPSRC grant EP/N510129/1. E-mail: [email protected]Dominykas Norgilas gratefully acknowledges funding received from the EPSRC Doctoral Training Partnerships grant EP/M508184/1. E-mail: [email protected]
Abstract
Let be a semimartingale, and its Snell envelope. Under the assumption that , we show that the finite-variation part of is absolutely continuous with respect to the decreasing part of the finite-variation part of . In the Markovian setting, this enables us to identify sufficient conditions for the value function of the optimal stopping problem to belong to the domain of the extended (martingale) generator of the underlying Markov process. We then show that the dual of the optimal stopping problem is a stochastic control problem for a controlled Markov process, and the optimal control is characterised by a function belonging to the domain of the martingale generator. Finally, we give an application to the smooth pasting condition.
Keywords: Doob-Meyer decomposition, optimal stopping, Snell envelope stochastic control, martingale duality, smooth pasting.
Mathematics Subject Classification: 60G40, 60G44, 60J25, 60G07, 93E20.
1 Introduction
Given a (gains) process , living on the usual filtered probability space , the classical optimal stopping problem is to find a maximal reward , where the supremum is taken over all - stopping times. In order to compute , we consider, for each - stopping time , the value function . It is, or should be, well-known (see, for example, El Karoui [16], Karatzas and Shreve [31]) that under suitable integrability and regularity conditions on the process , the Snell envelope of , denoted by , is the minimal supermartingale which dominates and aggregates the value function , so that for any - stopping time , almost surely. Moreover, is the minimal optimal stopping time, so, in particular, almost surely. A successful construction of the process leads, therefore, to the solution of the initial optimal stopping problem.
In the Markovian setting the gains process takes the form , where is some payoff function applied to an underlying Markov process . Under very general conditions, the Snell envelope is then characterised as the least super-mean-valued function that majorizes . A standard technique to find the value function is to solve the corresponding obstacle (free-boundary) problem. For an exposition of the general theory of optimal stopping in both settings we also refer to Peskir and Shiryaev [39].
The main aim of this paper is to answer the following canonical question of interest:
Question**.**
When does the value function belong to the domain of the extended (martingale) generator of the underlying Markov process ?
Very surprisingly, given how long general optimal stopping problems have been studied (see Snell [49]), we have been unable to find any general results about this.
As the title suggests, we tackle the question by considering the optimal stopping problem in a more general (semimartingale) setting first. If a gains process is sufficiently integrable, then is of class (D) and thus uniquely decomposes into the difference of a uniformly integrable martingale, say , and a predictable, increasing process, say , of integrable variation. From the general theory of optimal stopping it can be shown that is the maximal optimal stopping time, while the stopped process is a martingale. Therefore, the finite variation part of , , must be zero up to . Now suppose that is a semimartingale itself. Then its finite variation part can be further decomposed into the sum of increasing and decreasing processes that are, as random measures, mutually singular. Off the support of the decreasing one, is (locally) a submartingale, and thus in this case it is suboptimal to stop, and we again expect to be (locally) a martingale. This also suggests that increases only if the decreasing component of the finite variation part of decreases. In particular, we prove the following fundamental result (see Theorem 3.3):
[TABLE]
This being a very natural conjecture, it is not surprising that some variants of it have already been considered. As a helpful referee pointed out to us, several versions of Theorem 3.3 were established in the literature on reflected BSDEs under various assumptions on the gains process, see El Karoui et al. [17] ( is a continuous semimartingale), Crepéy and Matoussi [9] ( is a càdlàg quasi-martingale), Hamadéne and Ouknine [23] ( is a limiting process of a sequence of sufficiently regular semimartingales). We note that these results (except Hamadéne and Ouknine [23], where the assumed regularity of is exploited) are proved essentially by using (or appropriately extending) the related (but different) result established in Jacka [27]. There, under the assumption that and are both continuous and sufficiently integrable semimartingales, the author shows that a local time of at zero is absolutely continuous with respect to the decreasing part of the finite-variation process in the decomposition of . Our proof of Theorem 3.3 relies on the classical methods establishing the Doob-Meyer decomposition of a supermartingale.
The first part of Section 3 is devoted to the groundwork necessary to establish Theorem 3.3. It turns out that an answer to the motivating question of this paper then follows naturally. In particular, in the second part of Section 3, in Theorem 3.11, we show that, under very general assumptions on the underlying Markov process , if the payoff function belongs to the domain of the martingale generator of , so does the value function of the optimal stopping problem.
In Section 4 we discuss some applications. First, we consider a dual approach to optimal stopping problems due to Davis and Karatzas [10] (see also Rogers [43], and Haugh and Kogan [24]). In particular, from the absolute continuity result announced above, it follows that the dual is a stochastic control problem for a controlled Markov process, which opens the doors to the application of all the available theory related to such problems (see Fleming and Soner [19]). Secondly, if the value function of the optimal stoping problem belongs to the domain of the martingale generator, under a few additional (but general) assumptions, we also show that the celebrated smooth fit principle holds for (killed) one-dimensional diffusions.
2 Preliminaries
2.1 General framework
Fix a time horizon . Let be an adapted, càdlàg gains process on , where is a right-continuous and complete filtration (augmented by the null sets of ). We suppose that is trivial. In the case , we interpret \mathcal{F}_{\infty}=\sigma\Big{(}\cup_{0\leq t<\infty}\mathcal{F}_{t}\Big{)} and . For two -stopping times , with -a.s., by we denote the set of all -stopping times such that . We will assume that the following condition is satisfied:
[TABLE]
and let
[TABLE]
The optimal stopping problem is to compute the maximal expected reward
[TABLE]
Remark*.*
First note that by (2.1), for all , and thus is finite. Moreover, most of the general results regarding optimal stopping problems are proved under the assumption that is a non-negative (hence the gains) process. However, under (2.1), given by is a uniformly integrable martingale, while defines a non-negative process (even if is allowed to take negative values). Then
[TABLE]
and finding is the same as finding . Hence we may, and shall, assume without loss of generality that .
The key to our study is provided by the family of random variables
[TABLE]
Note that, since each deterministic time is also a stopping time, (2.3) defines an adapted value process with . We begin with a fundamental result characterising the so-called Snell envelope process, , of . In particular, is a version of that aggregates the value function at each stopping time (see Appendix D in Karatzas and Shreve [31]).
Theorem 2.1** (Characterisation of ).**
Let . The Snell envelope process of satisfies -a.s., , and is the minimal càdlàg supermartingale that dominates .
For the proof of Theorem 2.1 under slightly more general assumptions on the gains process consult Appendix I in Dellacherie and Meyer [12] or Proposition 2.26 in El Karoui [16].
If , it is clear that is a uniformly integrable process. In particular, it is also of class (D), i.e. the family of random variables is uniformly integrable. On the other hand, a right-continuous adapted process belongs to the class (D) if there exists a uniformly integrable martingale , such that, for all , -a.s. (see e.g. Dellacherie and Meyer [12], Appendix I and references therein). In our case, by the definition of and using the conditional version of Jensen’s inequality, for , we have
[TABLE]
But, since , is a uniformly integrable martingale, which proves the following
Lemma 2.2**.**
Suppose . Then is of class (D).
Let denote the set of right-continuous martingales started at zero. Let and denote the spaces of local and uniformly integrable martingales (started at zero), respectively. Similarly, the adapted processes of finite and integrable variation will be denoted by and , respectively.
It is well-known that a right-continuous (local) supermartingale has a unique decomposition where and is an increasing () process which is predictable. This can be regarded as the general Doob-Meyer decomposition of a supermartingale. Specialising to class (D) supermartingales we have a stronger result (this is a consequence of, for example, Protter [40] Theorem 16, p.116 and Theorem 11, p.112):
Theorem 2.3** (Doob-Meyer decomposition).**
Let . Then the Snell envelope process admits a unique decomposition
[TABLE]
where , and is a predictable, increasing process.
Remark*.*
It is normal to assume that the process in the Doob-Meyer decomposition of is started at zero. The duality result alluded to in the introduction is one reason why we do not do so here.
An immediate consequence of Theorem 2.3 is that is a semimartingale. In addition, we also assume that is a semimartingale with the following decomposition:
[TABLE]
where and is a process. Unfortunately, the decomposition (2.5) is not, in general, unique. On the other hand, uniqueness is obtained by requiring the term to also be predictable, at the cost of restricting only to locally integrable processes. If there exists a decomposition of a semimartingale with a predictable process, then we say that is . For a special semimartingale we always choose to work with its decomposition (so that a process is predictable). Let
[TABLE]
Lemma 2.4**.**
Suppose . Then is a special semimartingale.
See Theorems 36 and 37 (p.132) in Protter [40] for the proof.
The following lemma provides a further decomposition of a semimartingale (see Proposition 3.3 (p.27) in Jacod and Shiryaev [28]). In particular, the term of a special semimartingale can be uniquely (up to initial values) decomposed in a predictable way, into the difference of two increasing, mutually singular processes.
Lemma 2.5**.**
Suppose that is a càdlàg, adapted process such that . Then there exists a unique pair of adapted increasing processes such that and . Moreover, if is predictable, then , and are also predictable.
2.2 Markovian setting
The Markov process
Let be a metrizable Lusin space endowed with the -field of Borel subsets of . Let be a Markov process taking values in . We assume that a sample space is such that the usual semi-group of shift operators is well-defined (which is the case, for example, if is the canonical path space). If the corresponding semigroup of , , is the primary object of study, then we say that is a realisation of a Markov semigroup . In the case of being sub-Markovian, i.e. , we extend it to a Markovian semigroup over , where is a coffin-state. We also denote by the canonical realisation associated with , defined on with the filtration deduced from by standard regularisation procedures (completeness and right-continuity).
In this paper our standing assumption is that the underlying Markov process is a right process (consult Getoor [20], Sharpe [46] for the general theory). Essentially, right processes are the processes satisfying Meyer’s regularity hypotheses (hypothèses droites) HD1 and HD2. If a given Markov semigroup satisfies HD1 and is an arbitrary probability measure on , then there exists a homogeneous -valued Markov process with transition semigroup and initial law . Moreover, a realisation of such is right-continuous (Sharpe [46], Theorem 2.7). Under the second fundamental hypothesis, HD2, is right-continuous for every -excessive function . Recall, for , a universally measurable function is -super-median if for all , and -excessive if it is -super-median and as . If satisfies HD1 and HD2 then the corresponding realisation is strong Markov (Getoor [20], Theorem 9.4 and Blumenthal and Getoor [7], Theorem 8.11).
Remark*.*
One has the following inclusions among classes of Markov processes:
[TABLE]
Let be a given extended infinitesimal (martingale) generator of with a domain , i.e. we say a Borel function belongs to if there exists a Borel function , such that , , -a.s. for each and the process , given by
[TABLE]
is a local martingale under each (see Revuz and Yor [42] p.285), and then we write .
Remark*.*
Note that if and for each , where is Lebesgue measure, then may be altered on without affecting the validity of (2.6), so that, in general, the map is not unique. This is why we refer to a martingale generator.
Optimal stopping problem
Let be a right process. Given a function , and define a corresponding gains process (we simply write if ) by for . In the case of , we make the following conventions:
[TABLE]
Let be the -algebras on generated by excessive functions and universally measurable sets, respectively (recall that ). We write
[TABLE]
For a filtration , and - stopping times and , with , , let be the set of - stopping times with . Consider the following optimal stopping problem:
[TABLE]
By convention we set . The following result is due to El Karoui et al. [18].
Theorem 2.6**.**
Let be a right process with canonical filtration . If , then
[TABLE]
and is a Snell envelope of , i.e. for all and
[TABLE]
The first important consequence of the theorem is that we can (and will) work with the canonical realisation . The second one provides a crucial link between the Snell envelope process in the general setting and the value function in the Markovian framework.
Remark*.*
The restriction to gains processes of the form (or if ) is much less restrictive than might appear. Given that we work on the canonical path space with being the usual shift operator, we can expand the state-space of by appending an adapted functional , taking values in the space , with the property that
[TABLE]
This allows us to deal with time-dependent problems, running rewards and other path-functionals of the underlying Markov process.
Lemma 2.7**.**
Suppose is a canonical Markov process taking values in the space where is a locally compact, countably based Hausdorff space and is its Borel -algebra. Suppose also that is a path functional of X satisfying (2.7) and taking values in the space where is a locally compact, countably based Hausdorff space with Borel -algebra , then, defining , is still Markovian. If is a strong Markov process and is right-continuous, then is strong Markov. If is a Feller process and is right-continuous , then is strong Markov, has a càdlàg modification and the completion of the natural filtration of , , is right-continuous and quasi-left continuous, and thus Y is a right process.
Example 2.8**.**
If is a one-dimensional Brownian motion, then , defined by
[TABLE]
where is the local time of at [math], is a Feller process on the filtration of .
3 Main results
In this section we retain the notation of Section 2.1 and Section 2.2.
3.1 General framework
The assumption that (i.e. is a semimartingale with integrable supremum and is its canonical decomposition), neither ensures that , nor that is an process, the latter, it turns out, being sufficient for the main result of this section to hold. In order to prove Theorem 3.3 we will need a stronger integrability condition on .
For any adapted càdlàg process , define
[TABLE]
and
[TABLE]
Remark*.*
Note that , so that under the current conditions we have that .
For a special semimartingale with canonical decomposition , where and is a predictable process, define the norm, for , by
[TABLE]
and, as usual, write if .
Remark*.*
A more standard definition of the norm is with replaced by . However, the Burkholder-Davis-Gundy inequalities (see Protter [40], Theorem 48 and references therein) imply the equivalence of these norms.
The following lemma follows from the fact that , a.s:
Lemma 3.1**.**
On the space of semimartingales, the norm is stronger than for , i.e. convergence in implies convergence in .
In general, it is challenging to check whether a given process belongs to , and thus the assumption that might be too stringent. On the other hand, under the assumptions in the Markov setting (see Section 3.2), we will have that is in . Recall that a semimartingale belongs to , for , if there exists a sequence of stopping times , increasing to infinity almost surely, such that for each , the stopped process belongs to . Hence, the main assumption in this section is the following:
Assumption 3.2**.**
* is a semimartingale in both and .*
Remark*.*
Given that , Lemma 3.1 implies that Assumption 3.2 is satisfied, and thus all the results of Section 2.1 hold. Moreover, we then have a canonical decomposition of
[TABLE]
with and a predictable process . On the other hand, under Assumption 3.2, (3.4) holds only for the stopped process , .
We finally arrive to the main result of this section:
Theorem 3.3**.**
Suppose Assumption 3.2 holds. Let denote the decreasing (increasing) components of , as in Lemma 2.5. Then is, as a measure, absolutely continuous with respect to almost surely on , and , defined by
[TABLE]
satisfies almost surely.
Remark*.*
As is usual in semimartingale calculus, we treat a process of bounded variation and its corresponding Lebesgue-Stiltjes signed measure as synonymous.
The proof of Theorem 3.3 is based on the discrete-time approximation of the predictable processes in the decompositions of (2.4) and (2.5). In particular, let , , be an increasing sequence of partitions of with as . Let if and define the discretizations of , and set
[TABLE]
If is regular in the sense that for every stopping time and nondecreasing sequence of stopping times with , we have , or equivalently, if is continuous, Doléans [14] showed that uniformly in as (see also Rogers and Williams [44], VI.31, Theorem 31.2). Hence, given that is regular, we can extract a subsequence , such that a.s. On the other hand, it is enough for to be regular:
Lemma 3.4**.**
Suppose is a regular gains process. Then so is its Snell envelope process .
See Appendix A for the proof.
Remark*.*
If it is not known that is regular, Kobylanski and Quenez [32], in a slightly more general setting, showed that is still regular, provided that is upper semicontinuous in expectation along stopping times, i.e. for all and for all sequences of stopping times such that , we have
[TABLE]
The case where is not regular is more subtle. In his classical paper Rao [41] utilised the Dunford-Pettis compactness criterion and showed that, in general, only weakly in as (a sequence of random variables in converges weakly in to if for every bounded random variable we have that as ).
Recall that convergence in does not imply convergence in probability, and therefore, we cannot immediately deduce an almost sure convergence along a subsequence. However, it turns out that by modifying the sequence of approximating random variables, the required convergence can be achieved. This has been done in recent improvements of the Doob-Meyer decomposition (see Jakubowski [29] and Beiglböck et al. [4]. Also, Siorpaes [48] showed that there is a subsequence that works for all simultaneously). In particular, Jakubowski proceeds as Rao, but then uses Komlós’s theorem [34] and proves the following:
Theorem 3.5**.**
There exists a subsequence such that for and as
[TABLE]
Proof of Theorem 3.3.
Let be a localising sequence for such that, for each , is in . Similarly, set for a fixed . We need to prove that
[TABLE]
since then, as almost surely, as , and by uniqueness of and , the result follows. In particular, since is increasing, the first inequality in (3.6) is immediate, and thus we only need to prove the second one.
After localisation we assume that . For any and we have that
[TABLE]
where is arbitrary. Therefore
[TABLE]
Then by the definition of and using (3.7) together with the properties of the (see also Lemma A.1 in the Appendix A) we obtain
[TABLE]
The first equality in (3.1) follows by noting that , and that for any the term inside the expectation vanishes. Using the decomposition of and by observing that, for all , , while is a uniformly integrable martingale, we obtain
[TABLE]
Finally, for , applying Theorem 3.5 to together with (3.1) gives
[TABLE]
where are such that and . Note that is also the predictable, increasing process in the Doob-Meyer decomposition of the class (D) supermartingale . Therefore we can approximate it in the same way as , so that is the almost sure limit along, possibly, a further subsequence of , of the right hand side of (3.1). Here we rely on the special property of the subsequence . In particular, it can be chosen such that convergence (3.5) also works along suitable subsequence of any further subsequence, see Remark 1 in Jakubowski [29]. ∎
We finish this section with a lemma that gives an easy test as to whether the given process belongs to (consult Appendix A for the proof).
Lemma 3.6**.**
Let with a canonical decomposition , where and is a predictable process. If the jumps of are uniformly bounded by some finite constant , then .
3.2 Markovian setting
In the rest of the section (and the paper) we consider the following optimal stopping problem:
[TABLE]
for a measurable function and a Markov process satisfying the following set of assumptions:
Assumption 3.7**.**
* is a right process.*
Assumption 3.8**.**
, .
Assumption 3.9**.**
, i.e. belongs to the domain of a martingale generator of .
Remark*.*
Lemma 2.7 tells us that if is Feller and is an adapted path-functional of the form given in (2.7) then (a modification of) satisfies Assumption 3.7.
Example 3.10**.**
Let be a Markov process and let be the domain of a classical infinitesimal generator of , i.e. the set of measurable functions , such that exists. Then . In particular,
if is a solution of an SDE driven by a Brownian motion in , then ;
- 2.
if the state space is finite (so that is a continuous time Markov chain), then any measurable and bounded belongs to
- 3.
if is a Lévy process on with finite variance increments then
Note that the gains process is of the form , while by Theorem 2.6, the corresponding Snell envelope is given by
[TABLE]
In a similar fashion to that in the general setting, Assumption 3.8 ensures the class (D) property for the gains and Snell envelope processes. Moreover, under Assumption 3.9,
[TABLE]
and the process in the semimartingale decomposition of is absolutely continuous with respect to Lebesgue measure, and therefore predictable, so that (3.12) is a canonical semimartingale decomposition of . Then, by Assumption 3.8, and using Lemma 3.6, we also deduce that .
Remark*.*
When , the optimal stopping problem, in general, is time-inhomogeneous, and we need to replace the process by the process , , so that (3.11) reads
[TABLE]
where is a new payoff function (consult Peskir and Shiryaev [39] for examples). In this case, Assumption 3.9 should be replaced by a requirement that there exists a measurable function such that defines a local martingale.
The crucial result of this section is the following:
Theorem 3.11**.**
Suppose Assumptions 3.7, 3.8 and 3.9 hold. Then .
Proof.
In order to be consistent with the notation in the general framework, let
[TABLE]
Recall Lemma 2.5. Then and are explicitly given (up to initial values) by
[TABLE]
In particular, is, as a measure, absolutely continuous with respect to Lebesgue measure. By applying Theorem 3.3, we deduce that
[TABLE]
where is a non-negative Radon-Nikodym derivative with . Then we also have that , for every .
In order to finish the proof we are left to show that there exists a suitable measurable function such that a.s., for all . For this, recall that a process (on or just on ) is additive if a.s. and a.s., for all . Moreover, for any measurable function , defines an additive process. In particular, if is also a semimartingale, then the martingale and processes in the decomposition of are also additive (Çinlar et al. [8] gives necessary and sufficient conditions for to be a semimartingale).
Finally, we have that , , is an increasing additive process such that . Set and , . Then by Proposition 3.56 in Çinlar et al. [8], we have that, for , -a.s. for each . ∎
Remark*.*
In some specific examples it is possible to relax Assumption 3.9. Let be the stopping region. It is well-known that is a martingale on the go region , i.e. given by
[TABLE]
is a martingale (see Lemma A.2). This implies that , and therefore we note that in order for , we need to be absolutely continuous with respect to Lebesgue measure only on the stopping region i.e. that . For example, let , fix and consider given by , . We can easily show, under very weak conditions, that and so we need only have that is absolutely continuous.
4 Applications: duality, smooth fit
In this section we retain the setting of Section 3.2.
4.1 Duality
Let be fixed. As before, let denote all the right-continuous uniformly integrable càdlàg martingales (started at zero) on the filtered space , . The main result of Rogers [43] in the Markovian setting reads:
Theorem 4.1**.**
Suppose Assumptions 3.7 and 3.8 hold. Then
[TABLE]
We call the right hand side of (4.1) the of the optimal stopping problem. In particular, the right hand side of (4.1) is a ”generalised stochastic control problem of Girsanov type”, where a controller is allowed to choose a martingale from , . Note that an optimal martingale for the dual is , the martingale appearing in the Doob-Meyer decomposition of , while any other martingale in gives an upper bound of . We already showed that , which means that, when solving the dual problem, one can search only over martingales of the form , for , or equivalently over the functions . We can further define by
[TABLE]
To conclude that we need to show that is superharmonic, i.e. for all stopping times and all , . But this follows immediately from the Optional Sampling theorem, since is a uniformly integrable supermartingale. Hence, as expected, we can restrict our search for the best minimising martingale to the set .
Theorem 4.2**.**
The dual problem, i.e. the right hand side of (4.1), is a stochastic control problem for a controlled Markov process when and the assumptions of Theorem 3.11 hold.
Proof.
For any , and , define processes and via
[TABLE]
and to allow arbitrary starting positions, set , for . Note that, for any , is an additive functional of . Lemma 2.7 implies that if then is a Markov process.
Define by
[TABLE]
It is clear that this is a stochastic control problem for the controlled Markov process , where the admissible controls are functions in . Moreover, since , by virtue of Theorem 4.1, and adjusting initial conditions as necessary, we have
[TABLE]
a ∎
4.2 Some remarks on the smooth pasting condition
We will now discuss the implications of Theorem 3.11 for the smoothness of the value function of the optimal stopping problem given in (3.11).
Remark*.*
While in Theorem 4.3 (resp. Theorem 4.5) we essentially recover (a small improvement of) Theorem 2.3 in Peskir [37] (resp. Theorem 2.3 in Samee [45]), the novelty is that we prove the results by means of stochastic calculus, as opposed to the analytic approach in [37] (resp. [45]).
In addition to Assumptions 3.8 and 3.9, we now assume that is a one-dimensional diffusion in the Itô-McKean [26] sense, so that is a strong Markov process with continuous sample paths. We also assume that the state space is an interval with endpoints . Nnote that the diffusion assumption implies Assumption 3.7. Finally, we assume that is : for any int, , where . Let be fixed; corresponds to a killing rate of the sample paths of .
The case without killing:
Let denote a scale function of , i.e. a continuous, strictly increasing function on such that for , , , with , we have
[TABLE]
see Revuz and Yor [42], Proposition 3.2 (p.301) for the proof of existence and properties of such a function.
From (4.2), using regularity of and that is a supermartingale of class (D) we have that is -concave:
[TABLE]
Theorem 4.3**.**
Suppose the assumptions of Theorem 3.11 are satisfied, so that . Further assume that is a regular, strong Markov process with continuous sample paths. Let , where is a scale function of .
Assume that for each , the local time of at , , is singular with respect to Lebesgue measure. Then, if , , given by (3.11), belongs to . 2. 2.
Assume that is, as a measure, absolutely continuous with respect to Lebesgue measure. If is absolutely continuous, then and is also absolutely continuous.
Remark*.*
If is the filtration of a Brownian motion, , then is a stochastic integral with respect to (a consequence of martingale representation):
[TABLE]
Moreover, Proposition 3.56 in Çinlar et al. [8] ensures that for a suitably measurable function and
[TABLE]
In this case, both, the singularity of the local time of Y and absolute continuity of (with respect to Lebesgue measure), are inherited from those of Brownian motion. On the other hand, if X is a regular diffusion (not necessarily a solution to an SDE driven by a Brownian motion), absolute continuity of still holds, if the speed measure of is absolutely continuous (with respect to Lebesgue measure).
Proof.
Note that is a Markov process, and let denote its martingale generator. Moreover, (see Lemma 4.4 and the following remark), where, on the interval , is the smallest nonnegative concave majorant of the function . Then, since ,
[TABLE]
and thus
[TABLE]
Therefore, , since
[TABLE]
for , , with .
On the other hand, using the generalised Itô formula for concave/convex functions (see e.g. Revuz and Yor [42], Theorem 1.5 p.223) we have
[TABLE]
for , , where is the local time of at , and is a non-negative -finite measure corresponding to the second derivative of in the sense of distributions. Then, by the uniqueness of the decomposition of a special semimartingale, we have that, for ,
[TABLE]
In order to prove the first claim, using the Lebesgue decomposition theorem, split into , where and are measures, absolutely continuous and singular (with respect to Lebesgue measure), respectively, so that
[TABLE]
Now suppose that for some . Then, using (4.6) and (4.7), we have
[TABLE]
Since is positive with positive probability and, by assumption, , , is singular with respect to Lebesgue measure, the right hand side of (4.8) contradicts absolute continuity of the left hand side. Therefore, , and since was arbitrary, we have that does not charge points (so that is singular continuous with respect to Lebesgue measure). It follows that . Since by assumption, we conclude that .
We now prove the second claim. By assumption, is absolutely continuous with respect to Lebesgue measure (on the time axis). Invoking Proposition 3.56 in Çinlar et al. [8] again, we have that
[TABLE]
(as in Remark Remark). A time-change argument allows us to conclude that is a time-change of a BM and that we may neglect the set in the representation (4.2). Thus
[TABLE]
where is the zero set of . Then, using the occupation time formula (see, for example, Revuz and Yor [42], Theorem 1.5 p.223) we have that
[TABLE]
where is given by . Now observe that, for , \eta([r,t]):=\int^{s(b)}_{s(a)}f(z)\Big{(}L_{t}^{z}-L_{r}^{z}\Big{)}dz and \pi([r,t]):=\int^{s(b)}_{s(a)}\Big{(}L_{t}^{z}-L_{r}^{z}\Big{)}\nu(dz) define measures on the time axis, which, by virtue of (4.6), are equal (and thus both are absolutely continuous with respect to Lebesgue measure). Now define , . Then the restrictions of and to , and , are also equal. Moreover, since is a local martingale, it is also a semimartingale. Therefore, for every , is carried by the set (see Protter [40], Theorem 69 p.217). Hence, for each ,
[TABLE]
and, since and are arbitrary, the left and right hand sides of (4.9) define measures on , which are equal. It follows that , and thus, by uniqueness of the Lebesgue decomposition of -finite measures, . This proves that and is absolutely continuous on with Radon-Nykodym derivative . Since the product and composition of absolutely continuous functions are absolutely continuous, we conclude that is absolutely continuous (since is, by assumption). ∎
Remark*.*
We note that for a smooth fit principle to hold, it is not necessary that . Given that all the other conditions of Theorem 4.3 hold, it is sufficient that is differentiable at the boundary of the continuation region. On the other hand, if , , even if .
Moreover, since on the stopping region, Theorem 4.3 tells us that on the interior of the stopping region. However, the question whether this stems already from the assumption that is more subtle. For example, if and is a difference of two convex functions, then by the generalised Itô formula and the local time argument (similarly to the proof of Theorem 4.3) we could conclude that on the whole state space .
Case with killing:
We now generalise the results of the Theorem 4.3 in the presence of a non-trivial killing rate. Consider the following optimal stopping problem
[TABLE]
Note that, since , using the regularity of together with the supermartingale property of we have that
[TABLE]
Define increasing and decreasing functions , respectively, by
[TABLE]
where is arbitrary. Then, and , given by
[TABLE]
respectively, are local martingales (and also supermartingales, since are non-negative); see Dynkin [15] and Itô and McKean [26].
Let (where ) be given by
[TABLE]
Continuity of paths of implies that , are both continuous (the proof of continuity of the scale function in (4.2) can be adapted for a killed process). In terms of the functions , of (4.12), using appropriate boundary conditions, one calculates
[TABLE]
Let be the continuous increasing function defined by . Substituting (4.13) into (4.11) and then dividing both sides by we get
[TABLE]
so that is -concave.
Recall that Eq. 4.11 essentially follows from being -superharmonic, so that it satisfies for and any stopping time . Since and are local martingales, it follows that the converse is also true, i.e. given a measurable function , is -concave if and only if is -superharmonic (Dayanik and Karatzas [11], Proposition 4.1). This shows that a value function is the minimal majorant of such that is -concave.
Lemma 4.4**.**
Suppose and let be the smallest nonnegative concave majorant of on , where is the inverse of . Then on .
Proof.
Define on . Then, trivially, majorizes and is -concave. Therefore on .
On the other hand, let on . Since and is -concave on , is concave and majorizes on . Hence, on .
Finally, on . ∎
Remark*.*
When , let . Then Lemma 4.4 is just Proposition 4.3. in Dayanik and Karatzas [11].
With the help of Lemma 4.4 and using parallel arguments to those in the proof of Theorem 4.3 we can formulate sufficient conditions for to be in and have absolutely continuous derivative.
Theorem 4.5**.**
Suppose the assumptions of Theorem 3.11 are satisfied, so that . Further assume that is a regular Markov process with continuous sample paths. Let be as in (4.12) and consider the process .
Assume that, for each , the local time of at , , is singular with respect to Lebesgue measure. Then if , , given by (4.10), belongs to . 2. 2.
Assume that is, as a measure, absolutely continuous with respect to Lebesgue measure. If are both absolutely continuous, then is aslo absolutely continuous.
Proof.
First note that is not necessarily a local martingale, while is. Indeed, . Hence
[TABLE]
is the difference of two local martingales, and thus is a local martingale itself. Using the generalised Itô formula for concave/convex functions, we have
[TABLE]
for , , where is the local time of at , and is a non-negative -finite measure corresponding to the derivative in the sense of distributions.
On the other hand, if , then . Therefore,
[TABLE]
Then, similarly to before, from the uniqueness of the decomposition of the Snell envelope, we have that the martingale and terms in (4.14) and (4.15) coincide. Hence, for ,
[TABLE]
Using the same arguments as in the proof of Theorem 4.3 we can show that both statements of this theorem hold. The details are left to the reader. ∎
Acknowledgments
We are grateful to two anonymous referees and Prof. Goran Peskir for useful comments and suggestions.
Appendix A
Lemma A.1**.**
For each , the family of random variables is directed upwards, i.e. for any , , there exists , such that
[TABLE]
Proof.
Fix . Suppose , and define . Let . Note that . Using -measurability of , we have
[TABLE]
which proves the claim. ∎
Lemma A.2**.**
Let and be its Snell envelope with decomposition . For and , define
[TABLE]
Then a.s. and the processes and are indistinguishable.
Proof.
From the directed upwards property (Lemma A.1) we know that . Then for a sequence of stopping times in , such that , we have
[TABLE]
since is uniformly integrable. Hence, since is non-decreasing,
[TABLE]
and thus we have equalities throughout. By passing to a sub-sequence we can assume that
[TABLE]
The first equality in (A.2) implies that a.s., for some large enough , and thus , for all . Since is non-decreasing, we also have that a.s., , and from the second equality in (A.2) we conclude that a.s. The indistinguishability follows from the right-continuity of and . ∎
A.1 Proofs of results in Section 2
Proof of Lemma 2.7.
The completed filtration generated by a Feller process satisfies the usual assumptions, in particular, it is both right-continuous and quasi-left-continuous. The latter means that for any predictable stopping time , . Moreover, every càdlàg Feller process is left-continuous over stopping times and satisfies the strong Markov property. On the other hand, every Feller process admits a càdlàg modification (these are standard results and can be found, for example, in Revuz and Yor [42] or Rogers and Williams [44]). All that remains is to show that the addition of the functional leaves strong Markov. This is elementary from (2.7). ∎
A.2 Proofs of results in Section 3
Proof of Lemma 3.4.
Let be a nondecreasing sequence of stopping times with , for some fixed . Since is a supermartingale, , for every . For a fixed , (defined by Eq. A.1) is a stopping time, and by Lemma A.2, a.s. Therefore, since is uniformly integrable,
[TABLE]
Thus, by the definition of ,
[TABLE]
Let . Note that the sequence is non-decreasing and dominated by . Hence . Finally, using the regularity of we obtain
[TABLE]
Since is arbitrary, the result follows. ∎
Proof of Lemma 3.6.
For , define
[TABLE]
Clearly as . Then for each
[TABLE]
Therefore, since ,
[TABLE]
and thus, , for all . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Andersen and M. Broadie , Primal-dual simulation algorithm for pricing multidimensional American options , Management Science, 50(9):1222–1234, (2004).
- 2[2] S. Ankirchner, M. Klein, and T. Kruse , A verification theorem for optimal stopping problems with expectation constraints , Applied Mathematics & Optimization, 1–33, (2015).
- 3[3] D. Assaf, L. Goldstein, and E. Samuel-Cahn , Ratio prophet inequalities when the mortal has several choices , The Annals of Applied Probability, 12(3):972–984, (2002).
- 4[4] M. Beiglboeck, W. Schachermayer, and B. Veliyev , A short proof of the Doob-Meyer theorem , Stochastic Processes and their Applications, 122(4):1204–1209, (2012).
- 5[5] D. Belomestny, C. Bender, and J. Schoenmakers , True upper bounds for Bermudan products via non-nested Monte Carlo , Mathematical Finance, 19(1):53–71, (2009).
- 6[6] D. Belomestny , Solving optimal stopping problems via empirical dual optimization , The Annals of Applied Probability, 23(5):1988–2019, (2013).
- 7[7] R. M. Blumenthal and R. K. Getoor , Markov processes and potential theory , Courier Corporation, (2007).
- 8[8] E. Çinlar, J. Jacod, P. Protter and M. J. Sharpe , Semimartingales and Markov processes , Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 54(2):161-219, (1980).
