The Well-Posedness of Forward-Backward Stochastic Partial Differential Equations

Abstract

The solvability of a class of fully coupled forward-backward stochastic partial differential equations (FBSPDEs) under monotonicity conditions are studied in this paper. The existence and uniqueness of the solutions of the FBSPDEs have been obtained.

Share and Cite:

Li, S. and Yin, H. (2026) The Well-Posedness of Forward-Backward Stochastic Partial Differential Equations. Applied Mathematics, 17, 626-643. doi: 10.4236/am.2026.179034.

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 b,σ,k than the Lipschitz-in-all-variables assumptions of [15], since only σ and the diagonal terms of b,k 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 α[ 0,1 ] , 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.

{ t u( t,x )=a i,j=1 d u x i x j ( t,x )dt+b( t,x,u( t,x ),v( t,x ),Z( t,x ) )dt +σ( t,x,u( t,x ),v( t,x ),Z( t,x ) )dW( t,x ) t v( t,x )=h i,j=1 d v x i x j ( t,x )dt+k( t,x,u( t,x ),v( t,x ),Z( t,x ) )dt +Z( t,x )dW( t,x ) u( 0,x )= u 0 ( x )andv( T,x )=g( u( T,x ) ),t[ 0,T ],xG, (1.1)

where a and h are positive constants, and G is a bounded domain in d with smooth boundary conditions. Let | | be the norm of L 2 ( G ) and be the norm of H 0 1 ( G ) . They are given as follows:

| u | ( G | u | 2 dx ) 1 2 ,

and

u ( G | u | 2 dx ) 1 2 .

For notational simplicity, the norm | | inside the integral signs is also used to denote the standard norm on n , n . Let H 1 ( G ) be the dual space of H 0 1 ( G ) , and the normal of H 1 ( G ) be denoted as H 1 . Denote , the inner product of L 2 ( G ) , , H the inner product of H 0 1 ( G ) , and , H 1 ,H the duality pairing between H 1 ( G ) and H 0 1 ( G ) . For any u L 2 ( G ) , there exists an u H 1 ( G ) , such that u ,v H 1 ,H = u,v for all v H 0 1 ( G ) . The mapping u u is linear, injective, compact and continuous, and we can identify u with u . In this sense, we identify ( L 2 ( G ) ) 1 with L 2 ( G ) . Hence L 2 ( G ) is a dense subset of H 1 ( G ) and we have evolution triple

H 0 1 ( G ) L 2 ( G ) H 1 ( G ).

Hence u H 1 c| u |k u for all u H 0 1 ( G ) and some constants c and k .

Define the following operator

u i,j=1 d u x i x j

for any u L 2 ( G ) . Let { λ k } k=1 be a family of nondecreasing unbounded positive numbers such that for each k , λ k is an eigenvalue of the operator . For every k , let e k H 0 1 ( G ) be a corresponding eigenfunction such that { e k } k=1 forms an orthonormal basis of L 2 ( G ) . Let { q i } i=1 be a family of positive numbers such that i=1 q i < . Let our Wiener process W be defined as

W( t,x ) i=1 q i B i ( t ) e i ( x ),

where { B i ( t ) } is a sequence of iid Brownian motions in . Let Q be the operator from L 2 ( G ) to L 2 ( G ) such that Q e i = q i e i for all i . Note that Q is a self-adjoint and positive definite nuclear operator, and W is a L 2 ( G ) -valued Q Wiener process. Let L Q denote the space of all linear operators E such that E Q 1 2 is a Hilbert-Schmidt operator from L 2 ( G ) to L 2 ( G ) , with the inner product

F,G L Q =tr( FQ G * )=tr( GQ F * )

for all F and G L Q .

Now let us suppress variables in u , v and W , and rewrite the system as follows:

{ t u=audt+b( t,x,u,v,Z )dt+σ( t,x,u,v,Z )dW t v=hvdt+k( t,x,u,v,Z )dt+ZdW u( 0,x )= u 0 ( x )andv( T,x )=g( u( T,x ) ),t[ 0,T ],xG. (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 ( u,v,Z ) is said to be a solution of (1.2) if it satisfies (1.2) P-a.s. and it is in the space

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ) .

Let us assume the following assumptions.

(A.1) For fixed u,v H 0 1 ( G ) and z L Q , the triple ( b,k,σ ) is in

L 2 ( Ω; L 2 ( 0,T; H 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ) ,

and g( u ) is in L T 2 ( Ω; L 2 ( G ) ) .

(A.2) There exists a constant c 1 >0 , such that for every t>0 , u, u ,v, v H 0 1 ( G ) , and z, z L Q ,

b( t,,u,v,z )b( t,, u ,v,z ),u u H 1 ,H + σ( t,,u,v,z )σ( t,, u ,v,z ) L Q 2 c 1 u u 2 ,

and

k( t,,u,v,z )k( t,,u, v , z ),v v H 1 ,H c 1 ( v v 2 + z z L Q 2 ).

(A.3) There exist constants c 2 , c 1 >0 , such that for every t>0 , u, u ,v, v H 0 1 ( G ) and z, z L Q ,

b( t,,u,v,z )b( t,, u , v , z ) H 1 + σ( t,,u,v,z )σ( t,, u , v , z ) L Q + | k( t,,u,v,z )k( t,, u , v , z ) | H 1 c 2 ( u u + v v + z z L Q )

and

| g( u )g( u ) | c 3 | u u |,P-a.s.

Lemma 2.2. Assume assumptions (A.1) and (A.3). Let ( u,v,z ) be a triple in

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ) .

(1) If

c 2 2 < a 2 1+a ,

the forward equation

{ t u=audt+b( t,x,u,v,z )dt+σ( t,x,u,v,z )dW u( 0,x )= u 0 ( x ),t[ 0,T ],xG

has a unique adapted solution u in

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) ).

(2) If

c 2 2 < min( h, h 2 ) 2 ,

the backward equation

{ t v=hvdt+k( t,x,u,v,Z )dt+ZdW v( T,x )=g( u( T,x ) ),t[ 0,T ],xG

has a unique adapted solution ( v,Z ) in

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ).

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 u, u L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) ) , let u and u' be the unique solutions of

{ t u=audt+b( t,x,u,v,z )dt+σ( t,x,u,v,z )dW u( 0,x )= u 0 ( x ),t[ 0,T ],xG,

and

{ t u =a u dt+b( t,x, u ,v,z )dt+σ( t,x, u ,v,z )dW u ( 0,x )= u 0 ( x ),t[ 0,T ],xG,

respectively. Define

u ^ =u u , u ^ =u u ,

b ^ ( t,x )=b( t,x,u,v,z )b( t,x, u ,v,z ),

σ ^ ( t,x )=σ( t,x,u,v,z )σ( t,x, u ,v,z ).

Applying the Itô formula to | u ^ | 2 and assumption (A.3) to get

E | u ^ ( T,x ) | 2 =E 0 T 2 a u ^ + b ^ , u ^ dt +E 0 T σ ^ L Q 2 dt 2aE 0 T u ^ 2 dt +2 c 2 E 0 T u ^ u ^ dt + c 2 2 E 0 T u ^ 2 dt aE 0 T u ^ 2 dt + c 2 2 ( 1 a +1 )E 0 T u ^ 2 dt .

Thus if

c 2 2 < a 2 1+a ,

the mapping uu is a contraction, and the existence and uniqueness of a solution is guaranteed.

Now let us study the backward system. For any ( v,z ) and ( v , z ) in

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ),

let ( v,Z ) and ( v , Z ) be solutions of

{ t v=hvdt+k( t,x,u,v,z )dt+ZdW v( T,x )=g( u( T,x ) ),t[ 0,T ],xG,

and

{ t v =h v dt+k( t,x,u, v , z )dt+ Z dW v ( T,x )=g( u( T,x ) ),t[ 0,T ],xG,

respectively. Define

v ^ =v v , v ^ =v v , Z ^ =Z Z , z ^ =z z ,

k ^ ( t,x )=k( t,x,u,v,z )k( t,x,u, v , z ).

An application of the Itô formula to | v ^ | 2 and assumption (A.3) yield

E | v ^ ( 0,x ) | 2 +E 0 T Z ^ L Q 2 dt =E 0 T 2 h v ^ + k ^ , v ^ dt 2hE 0 T v ^ 2 dt +2 c 2 E 0 T ( v ^ + z ^ ) v ^ dt hE 0 T v ^ 2 dt + 2 c 2 2 h E 0 T ( v ^ 2 + z ^ 2 )dt .

Clearly that if

c 2 2 < min( h, h 2 ) 2 ,

the backward admits a unique adapted solution. □

Remark 2.3. Lemma 2.2 is a decoupling device: with ( v,z ) frozen, the forward equation for u and the backward equation for ( v,Z ) 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 b , σ , k 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 c 2 2 simply say that the Lipschitz constant of b (respectively k ) in u (respectively ( v,z ) ) must not overwhelm the coercivity constant a (respectively h ) 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

c 2 2 < a 2 1+a , c 2 2 < min( h, h 2 ) 2 and c 2 4 ( 1+2 c 1 ) 8 c 1 2 <ah c 2 2 4 c 3 2 .(2.1)

The system (1.2) admits a unique adapted solution in the space

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ).

Proof. We are going to prove the theorem using the contraction mapping theorem. Let ( v,z ) and ( v , z ) be any two pairs from

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ).

Suppose that u and u be the solutions of the forward equations

{ t u=audt+b( t,x,u,v,z )dt+σ( t,x,u,v,z )dW u( 0,x )= u 0 ( x ),t[ 0,T ],xG

and

{ t u =a u dt+b( t,x, u , v , z )dt+σ( t,x, u , v , z )dW u ( 0,x )= u 0 ( x ),t[ 0,T ],xG,

respectively. Then by solving backward equations

{ t v=hvdt+k( t,x,u,v,Z )dt+ZdW v( T,x )=g( u( T,x ) ),t[ 0,T ],xG

and

{ t v =h v dt+k( t,x, u , v , Z )dt+ Z dW v ( T,x )=g( u ( T,x ) ),t[ 0,T ],xG,

one obtains solutions ( v,Z ) and ( v , Z ) . Let

u ^ =u u , v ^ =v v , z ^ =z z ,

u ^ =u u , v ^ =v v and Z ^ =Z Z .

The remaining of the theorem is to show that

E 0 T { v ^ 2 + Z ^ L Q 2 }ds qE 0 T { v ^ 2 + z ^ L Q 2 }ds

for some q<1 . An application of the Itô formula yields

E | u ^ ( T,x ) | 2 =E 0 T 2 a u ^ +[ b( t,x,u,v,z )b( t,x, u , v , z ) ], u ^ H 1 ,H dt +E 0 T σ( t,x,u,v,z )σ( t,x, u , v , z ) L Q 2 dt 2aE 0 T u ^ 2 dt +2E 0 T { b( t,x,u,v,z )b( t,x, u ,v,z ), u ^ H 1 ,H + σ( t,x,u,v,z )σ( t,x, u ,v,z ) L Q 2 }dt +2E 0 T { b( t,x, u ,v,z )b( t,x, u , v , z ) H 1 u ^ + σ( t,x, u ,v,z )σ( t,x, u , v , z ) L Q 2 }dt.

Thus assumptions (A.2) and (A.3) imply that

E | u ^ ( T,x ) | 2 +2aE 0 T u ^ 2 dt 2 c 2 2 c 1 ( 1+2 c 1 )E 0 T { v ^ 2 + z ^ L Q 2 }dt . (2.2)

Then utilizing the Itô formula, assumptions (A.2) and (A.3), one gets

E | v ^ ( 0,x ) | 2 +E 0 T Z ^ L Q 2 dt =E | v ^ ( T,x ) | 2 E 0 T 2 h v ^ +[ k( t,x,u,v,Z )k( t,x, u , v , Z ) ], v ^ H 1 ,H dt E | v ^ ( T,x ) | 2 2hE 0 T v ^ 2 dt +E 0 T 2 k( t,x,u,v,Z )k( t,x,u, v , Z ), v ^ H 1 ,H dt 2E 0 T k( t,x,u, v , Z )k( t,x, u , v , Z ) H 1 v ^ dt 2 c 1 E 0 T { v ^ 2 + Z ^ L Q 2 }dt + c 2 2 2h E 0 T u ^ 2 dt . (2.3)

Substituting (2.2) into (2.3), and applying (A.3) to obtain

E 0 T { v ^ 2 + Z ^ L Q 2 }dt ( 1 2 c 1 )( c 3 2 c 2 2 4ah )E | u ^ ( T,x ) | 2 + c 2 4 ( 1+2 c 1 ) 8ah c 1 2 E 0 T { v ^ 2 + z ^ L Q 2 }dt .

The two parts of condition (2.1) now play complementary roles: the requirement ah c 2 2 / ( 4 c 3 2 ) forces the coefficient c 3 2 c 2 2 / ( 4ah ) of E | u ^ ( T,x ) | 2 to be non-positive, so that term may be dropped, while the requirement c 2 4 ( 1+2 c 1 )/ ( 8 c 1 2 ) <ah makes the remaining coefficient c 2 4 ( 1+2 c 1 )/ ( 8ah c 1 2 ) strictly less than 1. Hence

E 0 T { v ^ 2 + Z ^ L Q 2 }dt qE 0 T { v ^ 2 + z ^ L Q 2 }dt

for some q( 0,1 ) , and the mapping ( v,z )( v,Z ) is a contraction on L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ) . 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 ah of the two diffusion constants, sandwiched between a lower bound coming from the forward-to-backward coupling (through b , σ ) and an upper bound coming from the terminal coupling g : ah must be large enough that the iteration ( v,z )( v,Z ) in the proof of Lemma 2.2 contracts, yet not so large that the terminal condition v( T,x )=g( u( T,x ) ) destroys that contraction by feeding too much of the forward solution’s fluctuation back into v . 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 a , h relative to c 2 and c 3 .

3. Coercivity Assumption

Let A and B be two continuous linear operators from H 0 1 ( G ) to H 1 ( G ) with domains dense in L 2 ( G ) , such that the following coercivity assumption is held.

(A.4) For every u H 0 1 ( G ) , there exist constants α>0 , β>0 and γ , such that

A( u ),u H 1 ,H α u 2 +γ | u | 2 ,

B( u ),u H 1 ,H β u 2 γ | u | 2 .

Let us modify system (1.2) as follows to make it more general:

{ t u=A( u )dt+b( t,x,u,v,Z )dt+σ( t,x,u,v,Z )dW t v=B( v )dt+k( t,x,u,v,Z )dt+ZdW u( 0,x )= u 0 ( x )andv( T,x )=g( u( T,x ) ),t[ 0,T ],xG. (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

c 2 2 < α 2 1+α , c 2 2 < min( β, β 2 ) 2 and c 2 4 ( 1+2 c 1 ) 8 c 1 2 <αβ c 2 2 4 c 3 2 .(3.2)

The system (3.1) admits a unique adapted solution in the space

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ).

Proof. Simply we apply the Itô formula to e γt | u ^ | 2 and e γt | v ^ | 2 . The rest of the proof is very similar to the proof of Theorem 2.4. □

Remark 3.2. The exponential weights e γt absorb the lower-order (non-coercive) part γ | u | 2 that (A.4) allows A and B to carry; this is the usual device for passing from a strictly coercive operator such as a in (1.2) to a merely coercive-up-to-a-shift operator A . 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

{ t u=S( t,x,X )dt+σ( t,x,X )dW t v=T( t,x,X )dt+ZdW u( 0,x )= u 0 ( x )andv( T,x )=g( u( T,x ) ), (4.1)

with the following assumptions.

(B.1) For fixed u,v H 0 1 ( G ) and z L Q , the triple ( S,T,σ ) is in

L 2 ( Ω; L 2 ( 0,T; H 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ),

and g( u ) is in L T 2 ( Ω; L 2 ( G ) ) .

(B.2) There exists a constant c 1 >0 , such that for every t>0 , u, u ,v, v H 0 1 ( G ) and z, z L Q ,

S( t,,u,v,z )S( t,, u , v , z ) H 1 + σ( t,,u,v,z )σ( t,, u , v , z ) L Q + T( t,,u,v,z )T( t,, u , v , z ) H 1 c 1 ( u u + v v + z z L Q )

and

| g( u )g( u ) | c 1 | u u |,P-a.s.

(B.3) There exists a constant c 2 >0 , such that for every t>0 , u, u ,v, v H 0 1 ( G ) , and z, z L Q ,

S( t,,u,v,z )S( t,, u , v , z ),v v H 1 ,H + σ( t,,u,v,z )σ( t,, u , v , z ),z z L Q + T( t,,u,v,z )T( t,, u , v , z ),u u H 1 ,H c 2 ( u u 2 + v v 2 + z z L Q 2 )

and

g( u )g( u ),u u c 2 | u u | 2 ,P-a.s.

Let us prove some preliminary results.

Lemma 4.1. If a nonnegative sequence { a i } i=0 satisfies

a i+1 1 4 a i + 1 8 a i1

for all i1 , then there exists a constant c , such that

a i c 2 i

for all i0 .

Lemma 4.2. For any triple ( S 0 , T 0 , σ 0 ) in the space

L 2 ( Ω; L 2 ( 0,T; H 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ),

and g 0 L T 2 ( Ω; L 2 ( G ) ) , the following linear system has a unique adapted solution ( u,v,Z ) .

{ t u( t,x )=( v( t,x )+ S 0 ( t,x ) )dt+( Z( t,x )+ σ 0 ( t,x ) )dW( t,x ) t v( t,x )=( u( t,x )+ T 0 ( t,x ) )dt+Z( t,x )dW( t,x ) u( 0,x )= u 0 ( x )andv( T,x )=u( T,x )+ g 0 ( x ), (4.2)

for t[ 0,T ] and xG .

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

{ t v ( t,x )=( v ( t,x )+ T 0 ( t,x ) S 0 ( t,x ) )dt +( 2Z( t,x ) σ 0 ( t,x ) )dW( t,x ) v ( T,x )= g 0 ( x ),t[ 0,T ],xG

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 b0 , σ0 of Lemma 2.2(2) with u suppressed). Also it is easy to see that

{ t u( t,x )=( u( t,x ) v ( t,x )+ S 0 ( t,x ) )dt+( Z( t,x )+ σ 0 ( t,x ) )dW( t,x ) u( 0,x )= u 0 ( x ),t[ 0,T ],xG

yields a unique adapted solution u , by the same classical theory applied to the (now linear, coercive) forward equation, with v playing the role of a fixed inhomogeneous term. Let v=u+ v . Clearly ( u,v,Z ) is a solution of (4.2).

Now let us show the uniqueness. For simplicity, we suppress the variables t and x . Suppose ( u,v,Z ) and ( u , v , Z ) are two solutions. Let u ^ =u u , v ^ =v v , and Z ^ =Z Z . Applying the Itô formula to u ^ , v ^ to get

t u ^ , v ^ =( u ^ 2 + v ^ 2 + Z ^ L Q 2 )dt+ Z ^ * ( v ^ )+ Z ^ * ( u ^ ),dW .

Here we used the fact that u,u H 1 ,H = u 2 for all u H 0 1 ( G ) . Thus

E | u ^ ( T,x ) | 2 =E 0 T ( u ^ 2 + v ^ 2 + Z ^ L Q 2 )dt ,

and

( u,v,Z )=( u , v , Z ),P-a.s.,foreveryt0andxG.

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 α=0 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 α=1 .

For simplicity, let us denote ( u,v,Z ) by X , and suppress variables t and x . Let us define another forward backward stochastic partial differential equations as follows:

{ t u=( S α ( t,x,X )+ S 0 )dt+( σ α ( t,x,X )+ σ 0 )dW t v=( T α ( t,x,X )+ T 0 )dt+ZdW u( 0,x )= u 0 ( x )andv( T,x )= g α ( u( T,x ) )+ g 0 ( x ), (4.3)

where

S α ( t,x,u,v,z )=αS( t,x,u,v,z )( 1α )v,

T α ( t,x,u,v,z )=αT( t,x,u,v,z )( 1α )u,

σ α ( t,x,u,v,z )=ασ( t,x,u,v,z )( 1α )z,

g α ( u )=αg( u )+( 1α )u.

Lemma 4.4. Assume assumptions (B.1), (B.2) and (B.3). Suppose that for some α[ 0,1 ) , and for any ( S 0 , T 0 , σ 0 , g 0 ) as in Lemma 4.2, system (4.3) has an adapted solution. Then there exists 0<δ<1 , such that for any α [ α,α+δ ] . and for any ( S 0 , T 0 , σ 0 , g 0 ) as in Lemma 4.2, system (4.3) has an adapted solution.

Proof. Let δ be a number in ( 0,1 ) . By the definition of system (4.3), it is easy to see that

S α+δ ( t,x,u,v,z )= S α ( t,x,u,v,z )+δ( S( t,x,u,v,z )+v ),

T α+δ ( t,x,u,v,z )= T α ( t,x,u,v,z )+δ( T( t,x,u,v,z )+u ),

σ α+δ ( t,x,u,v,z )= σ α ( t,x,u,v,z )+δ( σ( t,x,u,v,z )+z ),

g α+δ ( u )= g α ( u )+δ( g( u )u ).

Let X i denote ( u i , v i , Z i ) for i and we set X 0 =( 0,0,0 ) . By the assumptions of the lemma, the FBSPDE

{ t u i+1 =( S α ( t,x, X i+1 )+δ( S( t,x, X i )+ v i )+ S 0 )dt +( σ α ( t,x, X i+1 )+δ( σ( t,x, X i )+ Z i )+ σ 0 )dW t v i+1 =( T α ( t,x, X i+1 )+δ( T( t,x, X i )+ u i )+ T 0 )dt+ Z i+1 dW u i+1 ( 0,x )= u 0 ( x ) v i+1 ( T,x )= g α ( u i+1 ( T,x ) )+δ( g( u i ) u i )+ g 0 ( x ) (4.4)

admit an adapted solution ( u i+1 , v i+1 , Z i+1 ) for any nonnegative integer i . We are going to show that { ( u i , v i , Z i ) } i=0 is a Cauchy sequence in

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ).

Let X ^ i =( u ^ i , v ^ i , Z ^ i )= X i X i1 for all i . An application of the Itô formula to v ^ i+1 , u ^ i+1 yields

E v ^ i+1 ( T,x ), u ^ i+1 ( T,x ) =E 0 T { S α ( t,x, X i+1 ) S α ( t,x, X i ), v ^ i+1 H 1 ,H + T α ( t,x, X i+1 ) T α ( t,x, X i ), u ^ i+1 H 1 ,H + σ α ( t,x, X i+1 ) σ α ( t,x, X i ), Z ^ i+1 L Q }dt +E 0 T { δ( S( t,x, X i )S( t,x, X i1 ) ), v ^ i+1 H 1 ,H + δ( T( t,x, X i )T( t,x, X i1 ) ), u ^ i+1 H 1 ,H + δ( σ( t,x, X i )σ( t,x, X i1 ) ), Z ^ i+1 L Q }dt +δE 0 T { v ^ i , v ^ i+1 H 1 ,H + u ^ i , u ^ i+1 H 1 ,H + Z ^ i , Z ^ i+1 L Q }dt .

By assumption (B.2) and (B.3), one gets

α c 2 E | u ^ i+1 ( T,x ) | 2 +( 1α )E | u ^ i+1 ( T,x ) | 2 δ( 1+ c 1 )E| u ^ i ( T,x ) || u ^ i+1 ( T,x ) | α c 2 E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt ( 1α )E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt +δE 0 T { S( t,x, X i )S( t,x, X i1 ) H 1 v ^ i+1 + T( t,x, X i )T( t,x, X i1 ) H 1 v ^ i+1 + σ( t,x, X i )σ( t,x, X i1 ) L Q Z ^ i+1 L Q }dt +δE 0 T { u ^ i u ^ i+1 + v ^ i v ^ i+1 + Z ^ i L Q Z ^ i+1 L Q }dt ,

where

E 0 T { S( t,x, X i )S( t,x, X i1 ) H 1 v ^ i+1 + T( t,x, X i )T( t,x, X i1 ) H 1 v ^ i+1 + σ( t,x, X i )σ( t,x, X i1 ) L Q Z ^ i+1 L Q }dt

δ 2 c 3 E 0 T { S( t,x, X i )S( t,x, X i1 ) 2 + T( t,x, X i )T( t,x, X i1 ) 2 + σ( t,x, X i )σ( t,x, X i1 ) L Q 2 }dt+ c 3 4 E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt 3 δ 2 c 1 2 c 3 E 0 T { u ^ i 2 + v ^ i 2 + Z ^ i L Q 2 }dt + c 3 4 E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt .

Let c 3 =min( 1, c 2 ) . Using the fact that α c 2 +1αmin( 1, c 2 ) , the above inequality becomes

c 3 E | u ^ i+1 ( T,x ) | 2 + c 3 E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt δ( 1+ c 1 )E| u ^ i ( T,x ) || u ^ i+1 ( T,x ) | + δ 2 ( 1+3 c 1 2 ) c 3 E 0 T { u ^ i 2 + v ^ i 2 + Z ^ i L Q 2 }dt + c 3 2 E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt .

Thus

E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt δ 2 ( 1+ c 1 ) 2 2 c 3 2 E | u ^ i ( T,x ) | 2 + 2 δ 2 ( 1+3 c 1 2 ) c 3 2 E 0 T { u ^ i 2 + v ^ i 2 + Z ^ i L Q 2 }dt .

Now let us find a bound for E | u ^ i ( T,x ) | 2 . Applying the Itô formula to | u ^ i | 2 , utilizing assumption (B.2), and after some calculations, one obtains

E | u ^ i ( T,x ) | 2 =E 0 T { 2 S α ( t,x, X i ) S α ( t,x, X i1 ), u ^ i H 1 ,H +2δ S( t,x, X i1 )S( t,x, X i2 )+ v ^ i1 , u ^ i H 1 ,H + σ α ( t,x, X i ) σ α ( t,x, X i1 ) + δ( σ( t,x, X i1 )σ( t,x, X i2 )+ Z ^ i1 ) L Q }dt δ( 1+ c 1 +6δ )E 0 T { u ^ i1 2 + v ^ i1 2 + Z ^ i1 L Q 2 }dt +( 2+5 c 1 )E 0 T { u ^ i 2 + v ^ i 2 + Z ^ i L Q 2 }dt .

By carefully choosing a δ( 0,1 ) , it is easy to get

E 0 T { u ^ i+1 2 + v ^ i+1 2 + Z ^ i+1 L Q 2 }dt 1 4 E 0 T { u ^ i1 2 + v ^ i1 2 + Z ^ i1 L Q 2 }dt + 1 8 E 0 T { u ^ i 2 + v ^ i 2 + Z ^ i L Q 2 }dt

for all 0< δ δ . Lemma 4.1 shows that { ( u i , v i , Z i ) } i=0 is a Cauchy sequence in the desired spaces. Let ( u,v,Z ) 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 ( u,v,Z ) 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.

L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; H 0 1 ( G ) ) )× L 2 ( Ω; L 2 ( 0,T; L Q ) ).

Proof. When α=0 , the existence of an adapted solution of system (4.3) is guaranteed by Lemma 4.2. By Lemma 4.4, there exists a δ( 0,1 ) , such that for any α[ 0,δ ] , 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 α[ δ,2δ ] . Repeating this process, one can show that system (4.3) is solvable for α=1 . Hence the existence of a solution of system (4.1) is shown.

Now let us prove the uniqueness. Suppose ( u,v,Z ) and ( u , v , Z ) are two solutions. Let u ^ =u u , v ^ =v v , and Z ^ =Z Z . Applying the Itô formula to u ^ , v ^ to get

t u ^ , v ^ ={ S( t,x,X )S( t,x, X ), v ^ H 1 ,H + T( t,x,X )T( t,x, X ), u ^ H 1 ,H + σ( t,x,X )σ( t,x, X ), Z ^ L Q }dt + Z ^ * ( u ^ )+ σ * ( t,x,X )( v ^ ) σ * ( t,x, X )( v ^ ),dW .

Thus

c 2 E | u ^ ( T,x ) | 2 E u ^ ( T,x ),g( u( T,x ) )g( u ( T,x ) ) c 2 E 0 T ( u ^ 2 + v ^ 2 + Z ^ L Q 2 )dt ,

and

( u,v,Z )=( u , v , Z ),P-a.s.,foreveryt0andxG.

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 ( S,T,σ ) simultaneously, in place of the separate, two-sided conditions (A.2) - (A.3) on ( b,σ ) and k individually. This is what removes the size restriction on ah (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 u( t,x ) denote the state on a bounded domain G , and suppose that

{ t u=audt+( f( t,x )+π( t,x ) )dt+ σ 0 dW( t,x ) u( 0,x )= u 0 ( x ),t[ 0,T ],xG, (6.1)

where f is a given forcing term, π is the control, and σ 0 >0 is a constant. Depending on the interpretation of u , 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 v( t,x ) denotes the adjoint process and Z( t,x ) its martingale part, the optimal control can be expressed in terms of v . The resulting optimality system for ( u,v,Z ) 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 v 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 H 0 1 ( G ) level rather than only at the L 2 ( G ) level.

This example also gives some interpretation of assumptions (A.1) - (A.3). These conditions impose restrictions on the reaction terms, the diffusivities a and h , 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 a and h . 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 L 2 -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 H 0 1 ( G ) L 2 ( G ) H 1 ( G ) with a trace-class Q -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.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Chow, P.L. (2007) Stochastic Partial Differential Equations. Taylor & Francis Group.[CrossRef]
[2] Ma, J. and Yong, J. (2007) Forward-Backward Stochastic Differential Equations and Their Applications. Springer.[CrossRef]
[3] Pardoux, E. (1972) Sur des équations aux dérivées partielles stochastiques monotones, C. R. Academy of Sciences, 275, A101-A103.
[4] Krylov, N.V. and Rozovskii, B.L. (1981) Stochastic Evolution Equations. Journal of Soviet Mathematics, 16, 1233-1277.[CrossRef]
[5] Gyöngy, I. (1982) On Stochastic Squations with Respect to Semimartingales III. Stochastics, 7, 231-254.[CrossRef]
[6] Peng, S. and Wu, Z. (1999) Fully Coupled Forward-Backward Stochastic Differential Equations and Applications to Optimal Control. SIAM Journal on Control and Optimization, 37, 825-843.[CrossRef]
[7] Hu, Y. and Peng, S. (1990) Maximum Principle for Semilinear Stochastic Evolution Control Systems. Stochastics and Stochastic Reports, 33, 159-180.[CrossRef]
[8] Bensoussan, A., Yam, S.C.P. and Zhang, Z. (2015) Well-Posedness of Mean-Field Type Forward-Backward Stochastic Differential Equations. Stochastic Processes and Their Applications, 125, 3327-3354.[CrossRef]
[9] Ahuja, S., Ren, W. and Yang, T. (2019) Forward-Backward Stochastic Differential Equations with Monotone Functionals and Mean Field Games with Common Noise. Stochastic Processes and Their Applications, 129, 3859-3892.[CrossRef]
[10] Ma, J., Protter, P. and Yong, J. (1994) Solving Forward-Backward Stochastic Differential Equations Explicitly—A Four Step Scheme. Probability Theory and Related Fields, 98, 339-359.[CrossRef]
[11] Ma, J. and Yong, J. (1997) Adapted Solution of a Degenerate Backward Spde, with Applications. Stochastic Processes and Their Applications, 70, 59-84.[CrossRef]
[12] Ma, J. and Yong, J. (1999) On Linear, Degenerate Backward Stochastic Partial Differential Equations. Probability Theory and Related Fields, 113, 135-170.[CrossRef]
[13] Ma, J., Yin, H. and Zhang, J. (2012) On Non-Markovian Forward-Backward SDEs and Backward Stochastic PDEs. Stochastic Processes and Their Applications, 122, 3980-4004.[CrossRef]
[14] Yin, H. (2021) Solvability of Forward-Backward Stochastic Partial Differential Equations with Non-Lipschitz Coefficients. Journal of Progressive Research in Mathematics, 18, 87-98.
[15] Yin, H. (2014) Solvability of Forward-Backward Stochastic Partial Differential Equations. Stochastic Processes and Their Applications, 124, 2583-2604.[CrossRef]
[16] Yin, H. (2016) Forward-Backward Stochastic Partial Differential Equations with Non-Monotonic Coefficients. Stochastics and Dynamics, 16, Article ID: 1650025.[CrossRef]
[17] Li, S. and Yin, H. (2023) The Galerkin Approximation to Forward-Backward Stochastic Partial Differential Equations. Journal of Progressive Research in Mathematics, 20, 49-62.

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.