The Well-Posedness of Forward-Backward Stochastic Partial Differential Equations ()
1. Introduction
Stochastic differential equations (SDEs) are mathematical models used to describe the evolution of random phenomena in continuous time and space [1]. Forward-backward stochastic differential equations (FBSDEs) are a particular class of SDEs that involve both forward and backward stochastic processes. They arise naturally in a variety of fields, including finance, physics, and engineering [2]. Solving FBSDEs is a challenging task due to their inherent complexity and the need to handle both the forward and backward processes simultaneously. One approach to solving FBSDEs is the method of monotonicity, which has gained significant attention in recent years due to its ability to handle non-linearities and avoid numerical instability issues. The method of monotonicity was first introduce by Pardoux in his pioneering work [3] to solve stochastic partial differential equations, and later, further advancements were made by Krylov and Rozovskii [4], and Gyöngy [5]. The study of fully coupled FBSDEs under monotone type conditions were conducted in [6] [7], and favorable results are obtained. It was further developed in [8] [9].
Forward-backward stochastic partial differential equations (FBSPDEs) can be viewed as a natural extension of FBSDEs. In light of the nonlinear Feynman-Kac formula, or the Four Step Scheme [10], it is not hard to imagine that the solution of a backward SPDE could be a crucial device for solving an FBSDE with random coefficients [11] [12]. It has been shown that the solvability of a large class of non-Markovian FBSDEs is almost equivalent to the solvability of the corresponding backward stochastic partial differential equations (BSPDEs) [13]. Therefore the solvability of FBSPDEs could be considered as part of the effort for a full understanding of the solvability of general strongly coupled FBSDEs with random coefficients. In addition, the interesting structure of FBSPDEs can be used to describe many natural phenomena. For instance, an application to the reaction-diffusion models is provided in [14]. The solvability of FBSPDEs has been attempted using the method of contraction mapping and method of continuation under various of conditions and assumptions in [15]. In [16], Yosida approximation scheme has been employed to establish the solvability of FBSPDEs even in the absence of the Lipschitz conditions. However, this is accomplished by assuming non-degeneracy and a special compatibility condition to compensate for the lack of Lipschitz continuity. Under the method of Galerkin approximation, a weak form solution of FBSPDEs was obtained in [17].
The present paper is distinguished from [14]-[17] chiefly in the method employed and in the resulting class of couplings covered. In [15] well-posedness is obtained by contraction mapping and continuation under a Lipschitz framework, but with the forward and backward equations coupled through Lipschitz coefficients rather than through the sharper, one-sided monotonicity structure used here; [16] trades the Lipschitz assumption for a non-degeneracy and compatibility condition via Yosida approximation, a route that excludes the degenerate diffusion coefficients allowed under monotonicity; and [17] produces only a weak (Galerkin) solution, without the strong, adapted solution obtained below. Relative to all of [14]-[17], the present contribution is threefold: 1) we adapt the monotonicity method of Pardoux [3] and Krylov-Rozovskii [4] - previously used for single-direction (forward-only or backward-only) SPDEs - to the fully coupled forward-backward setting, which requires the new one-sided monotonicity assumptions (A.2)-(A.3) and (B.3) on the coupling terms themselves, rather than only Lipschitz bounds on their size; 2) this structure yields existence and uniqueness under weaker regularity on the coefficients
than the Lipschitz-in-all-variables assumptions of [15], since only
and the diagonal terms of
need be controlled via (A.2), while the full Lipschitz bound (A.3) is only needed for the coupling; and (iii) the abstract formulation (4.1) in Sections 4-5, obtained via a method of continuation on a coupling parameter
, subsumes both the Laplacian-type system (1.2) and the coercive-operator system (3.1) as special cases, broadening the class of admissible second-order (or more general continuous linear) operators beyond what the contraction arguments of [15] allow directly. In this paper, we would like to explore the method of monotonicity to FBSPDEs. Let us first start with the following FBSPDEs.
(1.1)
where
and
are positive constants, and
is a bounded domain in
with smooth boundary conditions. Let
be the norm of
and
be the norm of
. They are given as follows:
and
For notational simplicity, the norm
inside the integral signs is also used to denote the standard norm on
,
. Let
be the dual space of
, and the normal of
be denoted as
. Denote
the inner product of
,
the inner product of
, and
the duality pairing between
and
. For any
, there exists an
, such that
for all
. The mapping
is linear, injective, compact and continuous, and we can identify
with
. In this sense, we identify
with
. Hence
is a dense subset of
and we have evolution triple
Hence
for all
and some constants
and
.
Define the following operator
for any
. Let
be a family of nondecreasing unbounded positive numbers such that for each
,
is an eigenvalue of the operator
. For every
, let
be a corresponding eigenfunction such that
forms an orthonormal basis of
. Let
be a family of positive numbers such that
. Let our Wiener process
be defined as
where
is a sequence of iid Brownian motions in
. Let
be the operator from
to
such that
for all
. Note that
is a self-adjoint and positive definite nuclear operator, and
is a
-valued
Wiener process. Let
denote the space of all linear operators
such that
is a Hilbert-Schmidt operator from
to
, with the inner product
for all
and
.
Now let us suppress variables in
,
and
, and rewrite the system as follows:
(1.2)
The rest of the paper is organized as follows. The assumptions on monotonicity conditions and Lipschitz continuity are introduced in Section 2, and the well-posedness of system (1.2) are obtained. In Section 3, in the presence of coercivity assumption, similar results can be shown for system (3.1). In this system, second-order terms in (1.2) have been replaced by continuous linear operators. In sections 4 and 5, a more general system of FBSPDEs (4.1) has been introduced, and the existence and uniqueness of solutions of the system have been obtained.
2. Assumptions
Let us first provide the definition of an adaptive solution to (1.2).
Definition 2.1 A triple
is said to be a solution of (1.2) if it satisfies (1.2) P-a.s. and it is in the space
.
Let us assume the following assumptions.
(A.1) For fixed
and
, the triple
is in
,
and
is in
.
(A.2) There exists a constant
, such that for every
,
, and
,
and
(A.3) There exist constants
, such that for every
,
and
,
and
Lemma 2.2. Assume assumptions (A.1) and (A.3). Let
be a triple in
.
(1) If
the forward equation
has a unique adapted solution
in
(2) If
the backward equation
has a unique adapted solution
in
Proof. We will prove the lemma by an application of the contraction mapping theorem. Let us first prove the existence and uniqueness of a solution of the forward equation. For any
, let
and
be the unique solutions of
and
respectively. Define
Applying the Itô formula to
and assumption (A.3) to get
Thus if
the mapping
is a contraction, and the existence and uniqueness of a solution is guaranteed.
Now let us study the backward system. For any
and
in
let
and
be solutions of
and
respectively. Define
An application of the Itô formula to
and assumption (A.3) yield
Clearly that if
the backward admits a unique adapted solution. □
Remark 2.3. Lemma 2.2 is a decoupling device: with
frozen, the forward equation for
and the backward equation for
are, individually, classical monotone SPDEs of the type first treated by Pardoux [3] and Krylov-Rozovskii [4], and assumptions (A.1) and (A.3) place
,
,
exactly in the framework for which the well-posedness of such single-direction (forward-only or backward-only) SPDEs is classical. The contraction argument above is the standard way of recovering that well-posedness once the coefficients are frozen in the “other” variable; it plays the same role here that Picard-iteration on the frozen coefficients plays for the linear system in Lemma 4.2 below. The size restrictions on
simply say that the Lipschitz constant of
(respectively
) in
(respectively
) must not overwhelm the coercivity constant
(respectively
) of the leading operator
- this is the usual competition, in the monotonicity method, between the dissipation supplied by the principal part and the growth of the lower-order coupling terms.
Under certain regularity conditions, we are able to prove the following result.
Theorem 2.4. Suppose assumptions (A.1), (A.2) and (A.3) hold. In addition, suppose that
,
and
.(2.1)
The system (1.2) admits a unique adapted solution in the space
Proof. We are going to prove the theorem using the contraction mapping theorem. Let
and
be any two pairs from
Suppose that
and
be the solutions of the forward equations
and
respectively. Then by solving backward equations
and
one obtains solutions
and
. Let
The remaining of the theorem is to show that
for some
. An application of the Itô formula yields
Thus assumptions (A.2) and (A.3) imply that
(2.2)
Then utilizing the Itô formula, assumptions (A.2) and (A.3), one gets
(2.3)
Substituting (2.2) into (2.3), and applying (A.3) to obtain
The two parts of condition (2.1) now play complementary roles: the requirement
forces the coefficient
of
to be non-positive, so that term may be dropped, while the requirement
makes the remaining coefficient
strictly less than 1. Hence
for some
, and the mapping
is a contraction on
. Thus by (2.1) and the contraction mapping theorem, system (1.2) admits a unique adapted solution in the desired space. □
Remark 2.5. Condition (2.1) should be read as a window for the product
of the two diffusion constants, sandwiched between a lower bound coming from the forward-to-backward coupling (through
,
) and an upper bound coming from the terminal coupling
:
must be large enough that the iteration
in the proof of Lemma 2.2 contracts, yet not so large that the terminal condition
destroys that contraction by feeding too much of the forward solution’s fluctuation back into
. This mirrors the well-known tension in fully coupled FBSDEs between the length of the time horizon and the size of the coupling: here the roles of “short horizon” and “weak coupling” are played by the sizes of
,
relative to
and
.
3. Coercivity Assumption
Let
and
be two continuous linear operators from
to
with domains dense in
, such that the following coercivity assumption is held.
(A.4) For every
, there exist constants
,
and
, such that
Let us modify system (1.2) as follows to make it more general:
(3.1)
The following result is quite straightforward, and it concludes this section.
Theorem 3.1. Suppose assumptions (A.1), (A.2), (A.3) and (A.4) hold. In addition, suppose that
,
and
.(3.2)
The system (3.1) admits a unique adapted solution in the space
Proof. Simply we apply the Itô formula to and . The rest of the proof is very similar to the proof of Theorem 2.4. □
Remark 3.2. The exponential weights
absorb the lower-order (non-coercive) part
that (A.4) allows
and
to carry; this is the usual device for passing from a strictly coercive operator such as
in (1.2) to a merely coercive-up-to-a-shift operator
. Theorem 3.1 therefore covers, in addition to second-order elliptic operators, e.g., non-symmetric or lower-order perturbations of
, at the price of only bookkeeping the extra constant
.
4. Generalization of the System
In the next two sections we are going to consider a more general system
(4.1)
with the following assumptions.
(B.1) For fixed
and
, the triple
is in
and
is in
.
(B.2) There exists a constant
, such that for every
,
and
,
and
(B.3) There exists a constant
, such that for every
,
, and
,
and
Let us prove some preliminary results.
Lemma 4.1. If a nonnegative sequence
satisfies
for all
, then there exists a constant
, such that
for all
.
Lemma 4.2. For any triple
in the space
and
, the following linear system has a unique adapted solution
.
(4.2)
for
and
.
Proof. We will show the existence of this linear forward backward stochastic partial differential equations in two steps. First for the existence and uniqueness of the solution of
is guaranteed: this is a linear backward SPDE with a coercive principal part
and coefficients that are, trivially, Lipschitz and monotone, so its well-posedness follows from the classical monotone-operator theory for backward SPDEs of Pardoux [3] and Krylov-Rozovskii [4] (equivalently, this is the special case
,
of Lemma 2.2(2) with
suppressed). Also it is easy to see that
yields a unique adapted solution
, by the same classical theory applied to the (now linear, coercive) forward equation, with
playing the role of a fixed inhomogeneous term. Let
. Clearly
is a solution of (4.2).
Now let us show the uniqueness. For simplicity, we suppress the variables
and
. Suppose
and
are two solutions. Let
,
, and
. Applying the Itô formula to
to get
Here we used the fact that
for all
. Thus
and
Remark 4.3. Lemma 4.2 isolates the one fully coupled, but linear, FBSPDE that anchors the method of continuation used below: system (4.2) is exactly the
member of the family (4.3) introduced next. The strategy of Sections 4 and 5 is to move
from 0 to 1 in small, uniform steps
, at each step reducing solvability of the (nonlinear) system at parameter
to solvability at parameter
via a fixed-point argument; the uniform size of
, guaranteed by Lemma 4.4 below, is what allows finitely many such steps to reach
.
For simplicity, let us denote
by
, and suppress variables
and
. Let us define another forward backward stochastic partial differential equations as follows:
(4.3)
where
Lemma 4.4. Assume assumptions (B.1), (B.2) and (B.3). Suppose that for some
, and for any
as in Lemma 4.2, system (4.3) has an adapted solution. Then there exists
, such that for any
. and for any
as in Lemma 4.2, system (4.3) has an adapted solution.
Proof. Let
be a number in
. By the definition of system (4.3), it is easy to see that
Let
denote
for
and we set
. By the assumptions of the lemma, the FBSPDE
(4.4)
admit an adapted solution
for any nonnegative integer
. We are going to show that
is a Cauchy sequence in
Let
for all
. An application of the Itô formula to
yields
By assumption (B.2) and (B.3), one gets
where
Let
. Using the fact that
, the above inequality becomes
Thus
Now let us find a bound for
. Applying the Itô formula to
, utilizing assumption (B.2), and after some calculations, one obtains
By carefully choosing a
, it is easy to get
for all
. Lemma 4.1 shows that
is a Cauchy sequence in the desired spaces. Let
be the limit. Since all the coefficients in (4.3) are continuous under assumption (B.2), we can take the limit on both sides of (4.4), and it is clear that
solves (4.3) for
, which completes the proof. □
5. Existence and Uniqueness
Now we are ready to provide the main result of this paper.
Theorem 5.1. Suppose assumptions (B.1), (B.2) and (B.3) hold. System (4.1) admits a unique adapted solution in the space.
Proof. When
, the existence of an adapted solution of system (4.3) is guaranteed by Lemma 4.2. By Lemma 4.4, there exists a
, such that for any
, system (4.3) admits an adapted solution. From the proof of Lemma 4.4,
is independent of
. Thus by applying Lemma 4.4 again we see that system (4.3) is solvable for all
. Repeating this process, one can show that system (4.3) is solvable for
. Hence the existence of a solution of system (4.1) is shown.
Now let us prove the uniqueness. Suppose
and
are two solutions. Let
,
, and
. Applying the Itô formula to
to get
Thus
and
Remark 5.2. Theorem 5.1 is the abstract counterpart of Theorems 2.4 and 3.1: assumption (B.3) is a one-sided monotonicity condition on the whole triple
simultaneously, in place of the separate, two-sided conditions (A.2) - (A.3) on
and
individually. This is what removes the size restriction on
(or
) seen in (2.1) and (3.2): the continuation method of Lemmas 4.1 - 4.4 only needs local solvability of (4.3) at each step, together with a uniform Cauchy estimate, and never needs the forward and backward equations to be solved separately by a single contraction.
6. An Illustrative Example
To illustrate how an FBSPDE of the form (1.2) can arise in an application, consider a stochastic optimal control problem for a reaction-diffusion equation. Let
denote the state on a bounded domain
, and suppose that
(6.1)
where
is a given forcing term,
is the control, and
is a constant. Depending on the interpretation of
, this equation can describe, for example, the evolution of a concentration, a population density, or a temperature perturbation under external random forcing.
Suppose that the controller wants to keep the state close to a prescribed target while also penalizing the use of the control. For a quadratic cost functional, the stochastic maximum principle leads to an adjoint backward equation. If
denotes the adjoint process and
its martingale part, the optimal control can be expressed in terms of
. The resulting optimality system for
has the same general forward-backward structure as (1.2); the forward equation contains a feedback term involving the adjoint variable, while the backward equation contains terms depending on the state. Such forward-backward systems are standard in stochastic control; see, for example [2].
In reaction-diffusion control problems, the coupling between the state and adjoint equations can also involve second-order terms. For example, after substituting the optimal control into the state equation, a term involving
may appear in the forward equation. This gives a coupling structure similar to that in the linear model (4.2) considered in Lemma 4.2. Such terms are relevant to the monotonicity estimates because they contribute at the
level rather than only at the
level.
This example also gives some interpretation of assumptions (A.1) - (A.3). These conditions impose restrictions on the reaction terms, the diffusivities
and
, and the strength of the feedback between the state and adjoint equations. In particular, the dissipative effects need to be sufficiently strong relative to the coupling terms. Similar connections between reaction-diffusion models and monotonicity conditions for FBSPDEs were discussed in [14].
The purpose of this example is to illustrate the structure of the system rather than to give a specific numerical application. For a particular control problem, the coefficients would have to be checked against (A.1) - (A.3), or against (A.4) in the setting of Section 3, before the corresponding well-posedness theorem can be applied.
7. Concluding Remarks
In this paper, we studied fully coupled FBSPDEs using a monotonicity approach. Lemma 2.2 and Theorem 2.4 treat the Laplacian-type system (1.2) by a contraction argument, under the coupling condition (2.1) on the diffusivities
and
. Theorem 3.1 extends the argument to general coercive operators under assumption (A.4). Finally, Theorem 5.1, based on the continuation method in Lemmas 4.1 - 4.4, removes the coupling condition at the cost of the stronger one-sided monotonicity assumption (B.3).
These results complement our previous work on FBSPDEs. In particular, they are related to the Lipschitz-based results in [15], the Yosida approximation results in [16] under non-degeneracy, and the weak Galerkin solutions in [17]. Here we obtain existence and uniqueness of adapted solutions of (1.2), (3.1), and (4.1) in
-based Sobolev spaces under monotonicity assumptions.
There are several questions that remain open. First, assumptions (A.2) - (A.3) and (B.3) are monotonicity conditions and therefore do not cover coefficients that are only locally Lipschitz or that satisfy a one-sided growth condition without monotonicity. The Yosida approximation in [16] provides a way to treat a broader class of coefficients, but requires additional non-degeneracy and compatibility assumptions. It would be useful to see whether such approximation methods can be combined with the continuation method of Section 5 to weaken the monotonicity assumptions.
Second, the coupling condition (2.1) in Theorems 2.4 and 3.1 remains a restriction of the contraction argument. The example in Section 6 gives some indication of how this condition is related to the relative strength of the diffusion and coupling terms. It would be interesting to determine whether this condition can be weakened or replaced by a sharper condition.
Third, our analysis is carried out in the Hilbert space setting
with a trace-class
-Wiener process. It would be natural to consider extensions to degenerate noise, space-time white noise, unbounded domains, and systems with more than two coupled components. FBSPDEs arising in mean-field games with common noise, for example [8] [9], provide one possible direction.
Finally, the results here are qualitative. A numerical method for approximating the adapted solutions would be a useful complement to the well-posedness theory. One possible approach would be to combine Galerkin truncation, as in [17], with a suitable monotone time-discretization scheme. We leave this question for future work.