On The Cauchy Problem for A 1D Euler-Alignment System in Besov Spaces

Abstract

In this paper, we investigate a 1D pressureless Euler-alignment system with a non-local alignment term, describing a kind of self-organizing problem for flocking. As a result, by the transport equation theory and Lagrange coordinate transformation, the local well-posedness of the solutions for the 1D pressureless Euler-alignment in Besov spaces with 1p<is established. Next, the ill-posedness of the solutions for this model in Besov spaces with 1p<∞ and is also deduced. Finally, the precise blow-up criteria of the solutions for this system is presented in Besov spaces with 1p<∞ .

Share and Cite:

Yang, Y. (2024) On The Cauchy Problem for A 1D Euler-Alignment System in Besov Spaces. Journal of Applied Mathematics and Physics, 12, 603-631. doi: 10.4236/jamp.2024.122040.

1. Introduction

The Cucker-Smale Model. The flocking behaviors are widespread in biological systems, such as the swimming of fish, the movement of wildebeest groups and the migration of birds called as self-organization biological behaviors, which have attracted much attention in [1] [2] [3] [4] [5] . Understanding the population properties of interacting systems, and how individual components function, are important questions. In biology, studying the collective behaviors of animals can better understand the structure of ecosystems and provide guidance for ecosystem management and conservation. In medicine, such as cancer cells, there is a collective arrangement of patterns in the human body, and studying this collective pattern of destructive cells can more effectively affect them and promote the understanding of disease. The flocking behavior refers to the motion of a cluster of finite particles in which the velocity of each particle is consistent with the weighted average of the velocities of its neighbors. The discrete Vicsek model in time and two-dimensional spaces is usually used to describe the flocking behaviors in [6] : the velocity angle θ j ( t ) of j-th particle satisfies

θ j ( t + 1 ) = 1 | N j ( t ) | i N j ( t ) θ j ( i ) + η Δ θ . (1)

Here, N j ( t ) = { i : | x i ( t ) x j ( t ) | r } ( r > 0 ), a random variable Δ θ is uniformly distributed in [ 1,1 ] , and a parameter η > 0 is used to measure the intensity of the noise. Furthermore, a generalization of the Vicsek model was proposed by Cucker and Smale in [7] :

{ d x i d t = v i , d v i d t = 1 N j = 1 N ϕ ( | x i x j | ) ( v j v i ) , (2)

where { x i , v i } i refers to the position and velocity of the agents i, and N is the total number of two groups. The nonnegative and decreased communication weight function ϕ measures the strength of the interaction between two particles, since the distance of the particles increases, the interaction usually becomes smaller. The Cucker-Smale model can be used to analyze the flocking behaviors based on the decay properties of the kernel ϕ ( r ) , that is to say, if ϕ ( r ) decays weaker than r 1 as r + , the velocities v i ( t ) of the agents converge to a limit velocity v ¯ ( t ) , and the relative positions x i ( t ) x j ( t ) also converge to a limit position x ¯ i j as r + . This is what we would call the flocking behavior: all particles move with nearly identical velocities.

A Kinetic Cucker-Smale Model. When the number of particles is large, to make it easier to simulate the movement of each particle, kinetic models are often used to describe the behaviors of global flocking by the density function f ( t , x , v ) with x d , v d . Furthermore, about the kinetic limit of the Cucker-Smale model (2), Ha and Tadmor established a nonlinear and non-local kinetic equation in [8] :

t f + v x f + v ( Q [ f ] f ) = 0, (3)

there Q [ f ] is the velocity alignment force field given by

Q [ f ] ( t , x , v ) = 2 d ϕ ( x y ) ( w v ) f ( t , y , w ) d w d y . (4)

Here, (3)-(4) is a nonlinear and non-local kinetic version of the Cucker-Smale model. When ϕ ( r ) decays weaker than r 1 as r + , the solutions of Equations (3)-(4) show that the global flocking behaviors in [9] , where the size S ( t ) of the support in x is uniformly bounded:

S ( t ) = sup { | x y | : ( x , v ) , ( y , v ) supp ( f ( t , , , ) ) } ,

and the size V ( t ) of the support in v remains decreasing:

V ( t ) = sup { | v v | : ( x , v ) , ( y , v ) supp ( f ( t , , , ) ) } 0 as t + .

A 1D Euler-alignment Model. In order to deduce the standard form of the hydrodynamic limit for nonlinear kinetic equations, one can consider the mono-kinetic ansatz of the form in (3)-(4)

f ( t , x , v ) ρ ( t , x ) δ v u ( t , x ) . (5)

In this case, the model becomes a local alignment model which is different from the global alignment model, the particles travel locally at a single speed in which the velocities of the particles are different in space. Under the one-dimensional pressureless condition, the flocking behaviors are known as a 1D pressureless Euler-alignment system with a non-local alignment term. Submitting (5) into (3)-(4), we arrive at the pressureless one-dimensional Euler-alignment system which consists of the mass conservation equation

t ρ + x ( ρ u ) = 0, (6)

and the momentum conservation equation

t ( ρ u ) + x ( ρ u 2 ) = ϕ ( x y ) ( u ( t , y ) u ( t , x ) ) ρ ( t , y ) ρ ( t , x ) d y , (7)

where the right side of (7) is the non-local alignment term, owing to the presence of the density ρ , the density is higher, the alignment effect between the agents becomes stronger. The 1D pressureless Euler-alignment system with a non-local alignment term simulates the population movement from irregular movement to regular movement with constant relative distance and relative velocity in one-dimensional space.

Furthermore, by submitting (6) into (7), one can get the following 1D Euler-alignment system:

{ t u + u x u = ϕ ( u ρ ) ( ϕ ρ ) u , t > 0 , x , t ρ + x ( ρ u ) = 0 , t > 0 , x , u ( 0 , x ) = u 0 ( x ) , ρ ( 0 , x ) = ρ 0 ( x ) , t = 0 , x . (8)

Many researchers showed that the characteristic of communication weight ϕ plays an important role in the regularity of the solutions for system (8): when communication weight is symmetric and uniformly bounded, Carrillo showed that system (8) exists a critical threshold of initial data in [10] : if the initial data lies above the subcritical region in the sense that x u 0 ϕ ρ 0 for all x , there has a global classical solution for 1D Euler-alignment system (8) if the initial data lies above the supercritical region in the sense that x u 0 < ϕ ρ 0 for all x , the solutions can blow up in a finite time for the 1D Euler-alignment system (8).

In [11] , let G = x u + ϕ ρ , Tan rewrote model (8) as the following equivalent equations:

{ t u + u x u = ϕ ( u ρ ) ( ϕ ρ ) u , t > 0 , x , t ρ + u x ρ = x u ρ , t > 0 , x , t G + u x G = x u G , t > 0 , x , x u = G ϕ ρ , t > 0 , x , ρ ( 0 , x ) = ρ 0 ( x ) , u ( 0 , x ) = u 0 ( x ) , t = 0 , x , (9)

where communication weight is integrable, so communication weight can be either regular or weakly singular (see [12] ). If communication weight is weakly singular, that is to say, it has an integrable singularity at the origin, Tan showed that system (8) exists a critical threshold of initial data: if the initial data lies

above the subcritical region in the sense that inf x G 0 ( x ) > 0 for all x , then there exists a globally regular solution for 1D Euler-alignment system (8), if the initial data lies above the supercritical region in the sense that inf x G 0 ( x ) < 0 for all x , then the solutions blow up in a finite time for the 1D Euler-alignment system (8) in [11] .

If communication weight ϕ L 1 ( ) , Tan established the local well-posedness in Sobelov spaces H s + 1 × H s with s > 1 2 on the whole real line or the periodic domain in [11] . One natural question is: whether or not the system (8) is local well-posedness in H s + 1 × H s for s = 1 2 . The Lagrange coordinate transformation does not change the dynamic nature of the system and can make the equation easier to solve. Indeed, if there exists a small enough time T > 0 , based on that the characteristic y ( t , ξ ) is a homeomorphism in a small time interval [ 0, T ] , we will obtain the uniqueness of the solutions. Note that B 2,1 s B 2,2 s H s , by compactness theory and coordinate transformation, we want to explore the local well-posedness of the Cauchy problem for the 1D Euler-alignment system

(8) in Besov spaces B p ,1 1 + 1 p × B p ,1 1 p with 1 p < (in the rest of this paper ϕ L 1 ( ) unless otherwise noted).

2. Main Results

Theorem 2.1. Suppose that p [ 1, ) and the initial data

( u 0 , ρ 0 , G 0 ) ( B p ,1 1 p ) 3 . Then there exists a time T > 0 such that Equation (9) has a unique solution ( u , ρ , G ) in ( E T p ) 3 and E T p = C ( [ 0, T ] ; B p ,1 1 p ) C 1 ( [ 0, T ] ; B p ,1 1 p 1 ) . Moreover, the solutions depend continuously on the initial data.

Recall that B p , r s + 1 × B p , r s B p ,1 1 + 1 p × B p ,1 1 p ( 1 p , r ) is locally compact (see

Proposition 1.3.5 in [13] ), using the same argument of the proof in Theorem 2.1, we can easily get the following local well-posedness of the solutions for Equation (8) in the Besov spaces B p , r s + 1 × B p , r s :

Assume that 1 p , r + , s > max { 1 p , 1 2 } and the initial data

( u 0 , ρ 0 ) B p , r s + 1 × B p , r s . Then there exists a time T > 0 such that the Cauchy problem (8) has a unique solution ( u , ρ ) B p , r s + 1 × B p , r s , and the map ( u 0 , ρ 0 ) ( u , ρ ) is continuous from a neighborhood of ( u 0 , ρ 0 ) in B p , r s + 1 × B p , r s into

C ( [ 0, T ] ; B p , r s + 1 ) C 1 ( [ 0, T ] ; B p , r s ) × C ( [ 0, T ] ; B p , r s ) C 1 ( [ 0, T ] ; B p , r s 1 ) ,

s < s when r = + whereas s = s when r < + .

Now, another natural question is raised: whether or not the data-to-solution map of the system (8) continues in B p , r s + 1 × B p , r s for s = s and r = + . In the following theorem, we deduce that this data-to-solution map is in ill-posedness in B p , s + 1 × B p , s .

Theorem 2.2. Suppose that 1 p and s > max { 1 p , 1 2 } , then the system

(9) is ill-posedness in Besov spaces ( B p , s ) 3 . More precisely, there exists ( u 0 , ρ 0 , G 0 ) ( B p , s ) 3 and a positive constant δ such that the Cauchy problem

for system (9) has a unique solution ( u , ρ , G ) L ( [ 0, T ] ; ( B p , s ) 3 ) for some T = T ( u 0 B p , s , ρ 0 B p , s , G 0 B p , s ) , while

lim inf t 0 ( u u 0 B p , s + ρ ρ 0 B p , s + G G 0 B p , s ) C δ .

Theorem 1.3 in [11] shows that the solutions admit a finite time blow up for the 1D Euler-alignment system (8), in the sense of inf x G 0 ( x ) < 0 for all x , if and only if lim t T G ( t , ) = . Theorem 2.1 in [11] shows that the solutions of

the system (8) stay smooth up to time T, in the sense of ( ρ , G ) C ( [ 0, T ] ; H s L + 1 ) × C ( [ 0, T ] ; H s ) , if and only if 0 T ( ρ ( , t ) L + G ( , t ) L ) d t < + . Next, we show that the solutions of the system (8) stay smooth only depending on the slope of u but not involving the components of G and ρ in the following theorem.

Theorem 2.3. Suppose that ( u , ρ , G ) ( C ( [ 0, T ] ; B p ,1 1 p ) ) 3 is the solution of the Cauchy problem (9) with the initial data ( u 0 , ρ 0 , G 0 ) ( B p ,1 1 p ) 3 . Let T is the

maximal existence time of the solutions ( u , ρ , G ) to Equation (9). Then the solutions blow up in finite time if and only if

lim t T inf x u x ( t , ) = .

The paper is organized as follows. In Section 2, we introduce several important results on the Littlewood-Paley decomposition, the nonhomogeneous Besov spaces and their useful properties. In Section 3, we establish the local well-posedness result in Besov spaces of the solutions for Equation (9). Moreover, we prove the blow-up criteria of the solutions to the problem (9) in Section 4. Finally, the ill-posedness result of the solutions for Equation (9) is presented in Section 5. Note that we denote a general constant C > 0 only depending on s and ϕ L 1 , since all function spaces in the following sections are over , for simplicity, we drop in the notation of function spaces if there is no ambiguity.

3. Preliminaries

In this section, for the convenience of readers, we introduce some facts on the Littlewood-Paley theory, which is frequently used in the following arguments. Then we introduce some properties of nonhomogeneous Besov spaces which will play a key role in proving the local well-posedness and other properties of the system (9). One may refer to [13] [14] for more details.

Proposition 3.1. (See Proposition 2.10 in [13] ) Let B { ξ d , | ξ | 4 3 } and { ξ d , 4 3 | ξ | 8 3 } . There exists two radial functions χ C c ( B ) and φ C c ( ) such that

χ ( ξ ) + q 0 φ ( 2 q ξ ) = 1, for all ξ d ,

| q q | 2 Supp φ ( 2 q ) Supp φ ( 2 q ) = ,

q 1 Supp χ ( ) Supp φ ( 2 q ) = ,

1 3 χ ( ξ ) 2 + q 0 φ ( 2 q ξ ) 2 1, for all ξ d .

Moreover, let h F 1 φ and h ˜ F 1 χ . Then for all f S ( d ) , the dyadic operators Δ q and S q can be defined as follows

Δ q f φ ( 2 q D ) f = 2 q d d h ( 2 q y ) f ( x y ) d y , for q 0,

S q f χ ( 2 q D ) f = 2 q d d h ˜ ( 2 q y ) f ( x y ) d y ,

Δ 1 f S 0 f and Δ q f 0 for q 2,

where f = q 0 Δ q f in S ( d ) , and the right-hand side is called the nonhomogeneous Littlewood-Paley decomposition of f .

Definition 3.2. (See Definition 2.68 in [13] ) Let s , 1 p , r . The nonhomogenous Besov space B p , r s ( d ) is defined by

B p , r s { f S ( d ) ; f B p , r s < } ,

where

f B p , r s { ( q 2 q s r Δ q f L p r ) 1 r , for r < , sup q 2 q s Δ q f L p , for r = .

If s = , B p , r s B p , r s .

Proposition 3.3. (See Corollary 2.86 in [13] ) For any positive real number s and any ( p , r ) in [ 1, ] 2 , the space L ( d ) B p , r s ( d ) is an algebra and a constant C exists such that

u v B p , r s ( d ) C ( u L ( d ) v B p , r s ( d ) + u B p , r s ( d ) v L ( d ) ) .

If s > d p or s = d p , r = 1 , then we have

u v B p , r s ( d ) C u B p , r s ( d ) v B p , r s ( d ) .

Proposition 3.4. Suppose that s , 1 p , r , p i , r i ( i = 1 , 2 ) . We have

1) (See Proposition 1.3.5 in [14] ) Topological properties: B p , r s is a Banach space which is continuously embedded in S .

2) (See Proposition 1.3.5 in [14] ) Density: C c is dense in B p , r s 1 p , r < .

3) (See Proposition 1.3.5 in [14] ) Embedding: B p 1 , r 1 s B p 2 , r 2 s n ( 1 p 1 1 p 2 ) , if p 1 p 2 and r 1 r 2 . B p , r 2 s 2 B p , r 1 s 1 is locally compact, if s 1 < s 2 .

4) (See Proposition 1.4.3 in [14] ) Algebraic properties: for all s > 0 , B p , r s L is an algebra. Moreover, B p , r s is an algebra B p , r s L s > n p (or s = n p and r = 1 ).

5) (See Proposition 1.3.5 in [14] ) Complex interpolation:

u B p , r θ s 1 + ( 1 θ ) s 2 C u B p , r s 1 θ u B p , r s 2 1 θ ,

for all u B p , r s 1 B p , r s 2 and θ [ 0,1 ] .

6) (See Proposition 1.3.5 in [14] ) Fatou lemma: If ( u n ) n is bounded in B p , r s and u n u in S , then u B p , r s and a subsequence ( u n k ) k exists such that

u B p , r s lim inf k u n k B p , r s .

Lemma 3.5. (See Lemma 4.1 in [15] ) The transport equation is one of the fundamental partial differential equations and appears in many mathematical problems. By virtue of the uniqueness of the transport equation, one obtains the

estimates of the source term f . Let y 0 B p ,1 1 p with 1 p < and f L 1 ( [ 0, T ] ; B p ,1 1 p ) . Define ¯ = , for n ¯ , denote by y n C ( [ 0, T ] ; B p ,1 1 p ) the solutions of

{ t y n + A n ( u ) x y n = f , x , y n ( t , x ) | t = 0 = y 0 ( x ) .

Assume for some α ( t ) L 1 ( [ 0, T ] ) , sup n ¯ A n ( u ) B p , 1 1 + 1 p α ( t ) . If A n ( u ) converges in A ( u ) in L 1 ( [ 0, T ] ; B p ,1 1 p ) , then the sequence ( y n ) n converges in C ( [ 0, T ] ; B p ,1 1 p ) .

Lemma 3.6. (See Lemma 2.8 in [16] ) Suppose that ( p , r ) [ 1, + ] 2 and s > min { 1 p , 1 1 p } . Assume f 0 B p , r s , F L 1 ( [ 0, T ] ; B p , r s ) and

{ x v L 1 ( [ 0, T ] ; B p , r s 1 ) , if s > 1 + 1 p ( s = 1 + 1 p , r = 1 ) , x v L 1 ( [ 0, T ] ; B p , r s ) , if s = 1 + 1 p , r > 1, x v L 1 ( [ 0, T ] ; B p , 1 p L ) , if s < 1 + 1 p .

If f L ( [ 0, T ] ; B p , r s ) C ( [ 0, T ] ; S ) solves

{ t f + v x f = F , t > 0 , x , f | t = 0 = f 0 .

1) Then there exists a constant C such that the following statements

f ( t ) B p , r s e C V ( t ) ( f 0 B p , r s + 0 t e C V ( τ ) F ( τ ) B p , r s d τ ) ,

where

V ( t ) = { 0 t x v B p , r 1 p L d τ , if s < 1 + 1 p , 0 t x v B p , r 1 + 1 p d τ , if s = 1 + 1 p , r > 1, 0 t x v B p , r s 1 d τ , if s > 1 + 1 p ( or s = 1 + 1 p , r = 1 ) .

2) If f = v , then for all s > 0 , (1) holds with V ( t ) = 0 t x v L d τ .

3) If r < , then f C ( [ 0, T ] ; B p , r s ) . If r = , then f C ( [ 0, T ] ; B p ,1 s ) for all s < s .

Lemma 3.7. (See Corollary 2.86 in [13] ) Assume that 1 p , r , for s 1 1 p , s 2 > 1 p , ( s 2 1 p if r = 1 ) and s 1 + s 2 > 0 , the following estimates holds

f g B p , r s 1 C f B p , r s 1 g B p , r s 2 ,

where the constant C is independent of f and g.

Lemma 3.8. (See Theorem 2.100 in [13] ) Let s > 0 , 1 r and 1 p p 1 . Let v be a vector field over d . Define R j = [ v , Δ j ] f . There exists a constant C such that

( 2 j s R j L p ( d ) ) j l r C ( v L f B p , r s + f L p 2 v B p 1 , r s 1 ) ,

where 1 p 2 = 1 p 1 p 1 . Furthermore, if s < 1 then

( 2 j s R j L p ( d ) ) j l r C v L f B p , r s .

4. Local Well-Posedness

From the relationship x u = G ϕ ρ , we can claim that

x u L ϕ L 1 ρ L + G L , x u B p , r s ϕ L 1 ρ B p , r s + G B p , r s . (1)

Firstly, Young inequality results in x u L ϕ ρ L + G L ϕ L 1 ρ L + G L . On the other hand, according to the definition of Besov spaces, we can get

Δ j ( ϕ ρ ) = 2 j h ( 2 j y ) ( ϕ ρ ) ( x y ) d y = 2 j h ( 2 j y ) ϕ ( z ) ρ ( x y z ) d z d y = ϕ ( z ) 2 j h ( 2 j y ) ρ ( x y z ) d z d y = ϕ Δ j ρ .

Applying Δ j to x u = G ϕ ρ and taking L p -norm to the above relationship yields

Δ j x u L p Δ j ρ ϕ L p + Δ j G L p ϕ L 1 Δ j ρ L p + Δ j G L p . (2)

By the definition of Besov spaces and Minkowski’s inequality, for r < , we can obtain

x u B p , r s = ( j 2 j s r Δ j x u L p r ) 1 r ( j ( ϕ L 1 2 j s Δ j ρ L p + 2 j s Δ j G L p ) r ) 1 r ϕ L 1 ( j 2 j s r Δ j ρ L p r ) 1 r + ( j 2 j s r Δ j G L p r ) 1 r = ϕ L 1 ρ B p , r s + G B p , r s .

The case r = can be easily treated as above, this completes the proof of the claim (3.1).

Moreover, by Bernstein-Type Lemmas (see Lemma 2.1 in [13] ), one can get

u B p , r s + 1 + ρ B p , r s u B p , r s + x u B p , r s + ρ B p , r s u B p , r s + G B p , r s + ρ B p , r s .

Proof. In order to prove Theorem 2.1, we proceed as the following steps.

Step 1: Existence

Firstly, we aim to construct approximate solutions to smooth solutions of some linear equations. Let z n ( t , ) = ( ρ n , G n , u n ) , for z 0 = ( ρ 0 , G 0 , u 0 ) ( 0 , 0 , 0 ) , we can define the induction sequence ( z n ) n by solving the following linear transport equations

{ t ρ n + 1 + u n x ρ n + 1 = x u n ρ n , t G n + 1 + u n x G n + 1 = x u n G n , t u n + 1 + u n x u n + 1 = ϕ ( u n ρ n ) ( ϕ ρ n ) u n , ρ n + 1 ( 0 ) = S n + 1 ρ 0 , u n + 1 ( 0 ) = S n + 1 u 0 . (3)

By induction, we firstly assume that z n ( L ( [ 0, T ] ; B p ,1 1 p ) ) 3 for all T > 0 . Owing to s > 1 p , it implies that B p , r s is an algebra. Combining Lemma 3.6 and (3), we deduce that there exists a global solution z n + 1 ( E T p ) 3 and E T p = C ( [ 0, T ] ; B p ,1 1 p ) C 1 ( [ 0, T ] ; B p ,1 1 p 1 ) . Making use of Lemma 3.6, we can obtain the following inequality

ρ n + 1 B p ,1 1 p exp { C 0 t x u n B p ,1 1 p L d t } ( ρ n + 1 ( 0 ) B p ,1 1 p + 0 t exp { C 0 t x u n B p ,1 1 p L d t } ρ n x u n B p ,1 1 p d t ) , (4)

because B p ,1 1 p is an algebra and B p ,1 1 p L , according to (1), we can obtain

ρ n x u n B p ,1 1 p ρ n B p ,1 1 p x u n B p ,1 1 p C ( ρ n B p , 1 1 p 2 + G n B p , 1 1 p 2 ) ,

x u n B p , 1 1 p L x u n B p ,1 1 p C ( ρ n B p ,1 1 p + G n B p ,1 1 p ) ,

then submittting the above inequalities into (4), we can conclude

ρ n + 1 B p ,1 1 p exp { C 0 t ( ρ n B p ,1 1 p + G n B p ,1 1 p ) d t } ( ρ n + 1 ( 0 ) B p ,1 1 p + C 0 t exp { C 0 t ( ρ n B p ,1 1 p + G n B p ,1 1 p ) d t } ( ρ n B p ,1 1 p 2 + G n B p ,1 1 p 2 ) d t ) . (5)

By a similar argument as above to the component G, we have

G n + 1 B p ,1 1 p exp { C 0 t ( ρ n B p ,1 1 p + G n B p ,1 1 p ) d t } ( G n + 1 ( 0 ) B p ,1 1 p + C 0 t exp { C 0 t ( ρ n B p ,1 1 p + G n B p ,1 1 p ) d t } ( ρ n B p , 1 1 p 2 + G n B p , 1 1 p 2 ) d t ) , (6)

and

u n + 1 B p ,1 1 p exp { C 0 t x u n B p , 1 1 p L d t } ( u n + 1 ( 0 ) B p ,1 1 p + 0 t exp { C 0 t x u n B p , 1 1 p L d t } ϕ ( u n ρ n ) ( ϕ ρ n ) u n B p ,1 1 p d t ) , (7)

we can see that

ϕ ( u n ρ n ) ( ϕ ρ n ) u n B p ,1 1 p C ( u n B p ,1 1 p 2 + ρ n B p ,1 1 p 2 ) ,

then submitting the inequality into (7), we can get

u n + 1 B p ,1 1 p exp { C 0 t ( ρ n B p ,1 1 p + G n B p ,1 1 p + u n B p ,1 1 p ) d t } ( u n + 1 ( 0 ) B p ,1 1 p + C 0 t exp { C 0 t ( ρ n B p ,1 1 p + G n B p ,1 1 p + u n B p ,1 1 p ) d t } ( u n B p , 1 1 p 2 + ρ n B p , 1 1 p 2 ) d t ) . (8)

Let Z n ( t ) = ρ n ( t , ) B p ,1 1 p + G n ( t , ) B p ,1 1 p + u n ( t , ) B p ,1 1 p , combining inequalities (5), (6), and (8), we can obtain

Z n + 1 ( t ) exp { C 0 t Z n d t } Z 0 + C 0 t Z n 2 exp { C τ t Z n d t } d t , (9)

where Z 0 = ρ 0 B p ,1 1 p + G 0 B p ,1 1 p + u 0 B p ,1 1 p . For fixed T * > 0 such that 2 C z 0 T * < 1 and suppose that

t [ 0, T * ] , Z n ( t ) Z 0 1 2 C Z 0 t .

In fact, we assume that the inequality for all n is valid, then for 0 τ < t < T * < 1 2 C Z 0 , we can have

exp ( C τ t Z n d t ) exp ( τ t C Z 0 1 2 C Z 0 t d t ) = ( 1 2 C Z 0 τ 1 2 C Z 0 t ) 1 2 ,

applying the above inequalities into (9), we can get

Z n ( t ) Z 0 1 2 C Z 0 t + 0 t C ( Z 0 ) 2 ( 1 2 C Z 0 τ ) 1 2 ( 1 2 C Z 0 τ ) 2 ( 1 2 C Z 0 t ) 1 2 d τ = 1 1 2 C Z 0 t ( Z 0 + 0 t C ( Z 0 ) 2 ( 1 2 C Z 0 τ ) 3 2 d τ ) = 1 1 2 C Z 0 t ( Z 0 + Z 0 1 1 2 C Z 0 τ | 0 t ) = Z 0 1 2 C Z 0 t .

The above derivation implies that ( z n ) n is uniformly bounded in

( L ( [ 0, T ] ; B p ,1 1 p ) ) 3 . Based on this, we can get that ( t z n ) n is uniformly bounded in ( L ( [ 0, T ] ; B p ,1 1 p 1 ) ) 3 . Therefore, ( z n ) n is uniformly bounded in ( C ( [ 0, T ] ; B p ,1 1 p ) C 1 2 ( [ 0, T ] ; B p ,1 1 p 1 ) ) 3 .

In order to obtain a solution z of Equation (9), we make use of the compactness theory for the approximating sequence ( z n ) n . We take a sequence ( φ j ) j of smooth functions with values in [ 0,1 ] , supported in B ( 0, j + 1 ) and equals to 1 on B ( 0, j ) . It is easy to find that the map z n φ j z n is compact from

( B p ,1 1 p ) 3 to ( B p ,1 1 p 1 ) 3 by the virtue of Theorem 2.94 in [13] . Taking advantage of

Ascoli’s theorem, there exists some function z j such that the sequence ( φ j z n ) j converges to z j for any j . At the same time, according to the Cantor diagonal process, there exists a subsequence of ( z j ) j such that φ j z n

converges to z j in ( C ( [ 0, T ] ; B p ,1 1 p 1 ) ) 3 for any j . Owing to φ j φ j + 1 = φ j , we can get z j = φ j z j + 1 . Hence, there exists some function z such that the sequence ( φ z n ) n 1 tends to φ z in ( C ( [ 0, T ] ; B p ,1 1 p 1 ) ) 3 for any φ D . Then on the basis of uniform boundeness of ( z j ) n 1 and the Fatou property, we can obtain that z is bounded in ( L ( [ 0, T ] ; B p ,1 1 p ) ) 3 . Taking advantage of the Fatou property yields that φ z n tends to φ z in ( C ( [ 0, T ] ; B p ,1 1 p ε ) ) 3 for any ε > 0 small enough.

Furthermore, set any ψ B p , 1 1 p and combining with the duality for ψ , as n , we can obtain

t ( φ u n ) t ( φ u ) , ψ ( φ u n ) x ( φ u n ) ( φ u ) x ( φ u ) , ψ ϕ ( φ u n φ ρ n ) ( ϕ φ ρ n ) φ u n ϕ ( φ u φ ρ ) ( ϕ φ ρ ) φ u , ψ 0.

The main problem is the third term, for the sake of convenience, we treat only the term of ϕ ( φ u n φ ρ n ) ( ϕ φ ρ n ) φ u n ϕ ( φ u φ ρ ) ( ϕ φ ρ ) φ u , ψ . Therefore, we can have

| ϕ ( φ u n φ ρ n ) ( ϕ φ ρ n ) φ u n ϕ ( φ u φ ρ ) ( ϕ φ ρ ) φ u , ψ | | ϕ ( φ u n φ ρ n ) ϕ ( φ u φ ρ ) , ψ | + | ( ϕ φ ρ n ) φ u n ( ϕ φ ρ ) φ u , ψ | . (10)

Firstly, we can estimate the first term of the inequality (10)

| ϕ ( φ u n φ ρ n ) ϕ ( φ u φ ρ ) , ψ | ϕ ( φ u n φ ρ n ) ϕ ( φ u φ ρ ) B p ,1 1 p 1 ψ B p , 1 1 p C φ u n φ ρ n φ u φ ρ B p ,1 1 p ε ψ B p , 1 1 p C ( φ u n L φ ρ n φ ρ B p ,1 1 p ε + φ u n B p ,1 1 p ε φ ρ n φ ρ L + φ ρ L φ u n φ u B p ,1 1 p ε + φ ρ B p ,1 1 p ε φ u n φ u L ) ψ B p , 1 1 p . (11)

For the second term of the inequality (10), taking the same approach. We have Proven that φ z n φ z in ( C ( [ 0, T ] ; B p ,1 1 p ε ) ) 3 , and φ z n is bounded in ( L T ( B p ,1 1 p ) ) 3 , then we can get that (11) tends to 0 uniformly on [ 0, T ] as n . So (11) tends to 0 when n . Applying the similar argument, the second term of the inequality (10) also tends to 0 as n , then t ( φ z ) ( C ( [ 0, T ] ; B p ,1 1 p 1 ) ) 3 . Hence, we deduce that z is the solution of the Equation (9), and belongs to ( E T p ) 3 .

Step 2: Uniqueness

In this step, taking advantage of the Lagrangian coordinate, we will prove the uniqueness of the smooth solution z. Introducing a new variable ξ , and we define y ( t , ξ ) as

{ t y ( t , ξ ) = u ( t , y ( t , ξ ) ) , t > 0 , x , y ( t , ξ ) | t = 0 = ξ .

Next, Define the new variables U ( t , ξ ) = u ( t , y ( t , ξ ) ) and V ( t , ξ ) = ρ ( t , y ( t , ξ ) ) , then we can obtain ξ U ( t , ξ ) = x u ( t , y ( t , ξ ) ) ξ y ( t , y ( t , ξ ) ) and ξ V ( t , ξ ) = x ρ ( t , y ( t , ξ ) ) ξ y ( t , y ( t , ξ ) ) . At the same time, the function U ( t , ξ ) is a solution of

t U ( t , ξ ) = t u ( t , y ( t , ξ ) ) + x u ( t , y ( t , ξ ) ) t y ( t , ξ ) Q ( t , ξ ) , (12)

where

Q ( t , ξ ) = ϕ ( u ( t , y ( t , ξ ) ) ρ ( t , y ( t , ξ ) ) ) ( ϕ ρ ( t , y ( t , ξ ) ) ) u ( t , y ( t , ξ ) ) .

Moreover, V ( t , ξ ) is a solution of

t V ( t , ξ ) = t ρ ( t , y ( t , ξ ) ) + x ρ ( t , y ( t , ξ ) ) t y ( t , ξ ) = ρ ( t , y ( t , ξ ) ) x u ( t , y ( t , ξ ) ) . (13)

Taking the derivative of the Equation (12) with respect to variable ξ , we can have

t ξ U ( t , ξ ) = ξ Q ( t , ξ ) = ϕ ( ξ U ρ ) + ϕ ( U ξ ρ ) ( ϕ ρ ) ξ U ( ϕ ξ ρ ) U .

Similarly, we can infer that

t ξ y ( t , ξ ) = ξ u ( t , y ( t , ξ ) ) = ξ U ( t , ξ ) ,

and

y ( t , ξ ) = ξ + 0 t U ( t , ξ ) d τ ,

and

ξ y ( t , ξ ) = 1 + 0 t ξ U ( t , ξ ) d τ .

Since the fact that ( u , ρ ) is C T ( B p ,1 1 p ) × C T ( B p ,1 1 p ) and the embedding B p ,1 1 p

W 1, p W 1, , we can deduce that ( u , ρ ) is uniformly bounded in

C T ( W 1, p W 1, ) × C T ( W 1, p W 1, ) easily. In addition, we can prove that ξ y is uniformly bounded in L T ( L ) . Moreover, based on the above discussion, for

sufficiently small T > 0 , we have 1 2 ξ y C u 0 . By the continuous method and

the boundedness of ( u , ρ ) in C T ( W 1, p W 1, ) × C T ( W 1, p W 1, ) , let t is small enough, we can get

U ( t , ξ ) L p p = R | u ( t , y ( t , ξ ) ) | p 1 y ξ d y u L p p 1 y ξ L 2 u L p p C ,

U ( t , ξ ) ξ L p p u x L p p y ξ L p 1 C u 0 p 1 u x L p p C ,

V ( t , ξ ) L p p = R | ρ ( t , y ( t , ξ ) ) | p 1 y ξ d y ρ L p p 1 y ξ L 2 ρ L p p C ,

V ( t , ξ ) ξ L p p = R | ρ x ( t , y ( t , ξ ) ) | p | y ξ | p 1 d ξ ρ x L p p y ξ L p 1 C .

Through the above inequalities, for any t [ 0, T ] , we have U ( t , ξ ) L T ( W 1, p W 1, ) , V ( t , ξ ) L T ( W 1, p W 1, ) ,

y ( t , ξ ) ξ L T ( W 1, p W 1, ) and 1 2 ξ y C u 0 satisfying (12) and (13).

Set z 1 , z 2 is two solutions in ( E T p ) 3 of Equation (9) with the same initial data, for i = 1 , 2 , the function U j ( t , ξ ) = u j ( t , y j ( t , ξ ) ) is a solution of

U t j ( t , ξ ) = u j t ( t , y j ) + u j x ( t , y j ) y j t = ϕ ( u j ρ j ) ( ϕ ρ j ) u j = Q j .

Obviously, we also have U j ( t , y j ( t , ξ ) ) , y j ( t , ξ ) ξ L T ( W 1, p W 1, ) , and 1 2 j ξ y C u 0 for sufficiently small T > 0 .

Next, we will establish the estimate U 1 ( t , ξ ) U 2 ( t , ξ ) W 1, p W 1, , the key step is to estimate Q 1 ( t , ξ ) Q 2 ( t , ξ ) W 1, p W 1, . For Q 1 ( t , ξ ) and Q 2 ( t , ξ ) , we can get

Q 1 ( t , ξ ) Q 2 ( t , ξ ) = ϕ ( U 1 V 1 U 2 V 2 ) ( ϕ V 1 ) U 1 + ( ϕ V 2 ) U 2 .

By Young inequality and Hölder inequality, then we shall get an estimate of L p L -the norm

Q 1 ( t , ξ ) Q 2 ( t , ξ ) L p L ϕ ( U 1 V 1 U 2 V 2 ) L p L + ( ϕ V 1 ) U 1 ( ϕ V 2 ) U 2 L p L C ( ( U 1 U 2 ) V 1 L p L + ( V 1 V 2 ) U 2 L p L ) + ( ϕ V 1 ) ( U 1 U 2 ) L p L + ( ϕ ( V 1 V 2 ) ) U 2 L p L

C ( U 1 U 2 L p L V 1 L + V 1 V 2 L p L U 2 L ) + U 1 U 2 L p L ϕ V 1 L + ϕ ( V 1 V 2 ) L p L U 2 L C ( V 1 V 2 L p L + U 1 U 2 L p L ) .

Similarly, we can have

Q 1 ξ ( t , ξ ) Q 2 ξ ( t , ξ ) = ϕ ( u 1 ρ 1 u 2 ρ 2 ) ξ ( ( ϕ ρ 1 ) ξ u 1 ( ϕ ρ 2 ) ξ u 2 ) ( ( ϕ ρ 1 ) u 1 ξ ( ϕ ρ 2 ) u 2 ξ ) ,

then we shall get an estimate about L p L -norm

Q 1 ξ ( t , ξ ) Q 2 ξ ( t , ξ ) L p L C ( u 1 ρ 1 u 2 ρ 2 ) ξ L p L + ( ϕ ρ 1 ) ξ u 1 ( ϕ ρ 2 ) ξ u 2 L p L + ( ϕ ρ 1 ) u 1 ξ ( ϕ ρ 2 ) u 2 ξ L p L C ( V 1 ξ V 2 ξ L p L + V 1 V 2 L p L + U 1 ξ U 2 ξ L p L + U 1 U 2 L p L ) C ( V 1 V 2 L p L + U 1 U 2 W 1, W 1, p ) .

Similarly, applying this routine process to prove, we can also get

x 1 u 1 ρ 1 x 2 u 2 ρ 2 L p L C ( V 1 V 2 L p L + U 1 U 2 W 1, W 1, p ) .

Moreover,

U 1 U 2 W 1, W 1, p + y 1 y 2 W 1, W 1, p + V 1 V 2 L p L U 1 ( 0 ) U 2 ( 0 ) W 1, W 1, p + y 1 ( 0 ) y 2 ( 0 ) W 1, W 1, p + V 1 ( 0 ) V 2 ( 0 ) L p L + C 0 T Q 1 Q 2 W 1, W 1, p + y 1 y 2 W 1, W 1, p + x 1 u 1 ρ 1 x 2 u 2 ρ 2 L p L d t

U 1 ( 0 ) U 2 ( 0 ) W 1, W 1, p + y 1 ( 0 ) y 2 ( 0 ) W 1, W 1, p + V 1 ( 0 ) V 2 ( 0 ) L p L + C 0 T U 1 U 2 W 1, W 1, p + y 1 y 2 W 1, W 1, p + V 1 V 2 L p L d t .

Using the Growall inequality yields

U 1 U 2 W 1, W 1, p + y 1 y 2 W 1, W 1, p + V 1 V 2 L p L e C T ( U 1 ( 0 ) U 2 ( 0 ) W 1, W 1, p + y 1 ( 0 ) y 2 ( 0 ) W 1, W 1, p + V 1 ( 0 ) V 2 ( 0 ) L p L ) e C T ( U 1 ( 0 ) U 2 ( 0 ) W 1, W 1, p + V 1 ( 0 ) V 2 ( 0 ) L p L ) e C T ( u 1 ( 0 ) u 2 ( 0 ) B p ,1 1 p + ρ 1 ( 0 ) ρ 2 ( 0 ) B p ,1 1 p ) ,

where owing to y 1 ( 0 ) = y 2 ( 0 ) = ξ , it follows that

u 1 u 2 L p 1 C u 1 y 1 u 2 y 1 L p 1 C u 1 y 1 u 2 y 2 + u 2 y 2 u 2 y 1 L p 1 C U 1 U 2 L p 1 + C u 2 x L y 1 y 2 L p 1 C u 1 ( 0 ) u 2 ( 0 ) B p , 1 1 p .

Using similar estimate, we can obtain ρ 1 ρ 2 L p 1 C ρ 1 ( 0 ) ρ 2 ( 0 ) B p , 1 1 p . Based on the embedding L p 1 B p 1, 0 , we can deduce

u 1 u 2 B p 1, 0 C u 1 u 2 L p 1 C u 1 ( 0 ) u 2 ( 0 ) B p , 1 1 p , ρ 1 ρ 2 B p 1, 0 C ρ 1 ρ 2 L p 1 C ρ 1 ( 0 ) ρ 2 ( 0 ) B p , 1 1 p .

Therefore, if u 1 ( 0 ) = u 2 ( 0 ) and ρ 1 ( 0 ) = ρ 2 ( 0 ) , the uniqueness of the solutions is deduced. By a similar argument as above to the component G, we can conclude that z is the unique solution of the Equation (9).

Step 3: The continuous dependence

Let ( u n , ρ n ) , ( u , ρ ) is the solution with the initial data ( u 0 n , ρ 0 n ) , ( u 0 , ρ 0 ) , and the initial data ( u 0 n , ρ 0 n ) ( u 0 , ρ 0 ) in B p ,1 1 p × B p ,1 1 p . Combining Step 1 and Step 2, we can obtain that ( u n , ρ n ) , ( u , ρ ) are uniformly bounded in L T ( B p ,1 1 p ) × L T ( B p ,1 1 p ) , and

u n u B p 1, 0 C u 0 n u 0 B p , 1 1 p , ρ n ρ B p 1, 0 C ρ 0 n ρ 0 B p , 1 1 p . (14)

This means that ( u n , ρ n ) tends to ( u , ρ ) in

C ( [ 0, T ] , B p 1, 0 ) × C ( [ 0, T ] , B p 1, 0 ) . Under the theorem of interpolation, for any

ε > 0 , we can see that ( u n , ρ n ) ( u , ρ ) in C ( [ 0, T ] , B p ,1 1 p ε ) × C ( [ 0, T ] , B p ,1 1 p ε ) . If ε = 1 , we will have ( u n , ρ n ) ( u , ρ ) in C ( [ 0, T ] , B p ,1 1 p 1 ) × C ( [ 0, T ] , B p ,1 1 p 1 ) . Combining (14) and the above relationship, we just need to prove that ( x u n , x ρ n ) ( x u , x ρ ) in C ( [ 0, T ] , B p ,1 1 p 1 ) × C ( [ 0, T ] , B p ,1 1 p 1 ) . Set v 1 n = x u n ,

v 2 n = x ρ n , we split v 1 n = z 1 n + w 1 n and v 2 n = z 2 n + w 2 n with ( z 1 n , w 1 n ) , ( z 2 n , w 2 n ) satisfying the following equations

{ t z 1 n + u n x z 1 n = x Q ( x u ) 2 , t z 2 n + u n x z 2 n = x ( ρ x u ) x u x ρ , z 1 n | t = 0 = x u 0 , z 2 n | t = 0 = x ρ 0 ,

and

{ t w 1 n + u n x w 1 n = x Q n x Q ( x u n ) 2 + ( x u ) 2 , t w 2 n + u n x w 2 n = x ( ρ n x u n ρ x u ) x u n x ρ n + x u x ρ , w 1 n | t = 0 = x u 0 n x u 0 , z 2 n | t = 0 = x ρ 0 n x ρ 0 .

Taking advantage of the fact that ( u n , ρ n ) , ( u , ρ ) are uniformly bounded in L T ( B p ,1 1 p ) × L T ( B p ,1 1 p ) , we can have

x Q n x Q B p , 1 1 p 1 ϕ ( u n ρ n u ρ ) ( ϕ ρ n ) u n + ( ϕ ρ ) u B p , 1 1 p C ( ρ n ρ B p , 1 1 p + u n u B p , 1 1 p ) C ( u n u B p , 1 1 p 1 + x u n x u B p , 1 1 p 1 + ρ n ρ B p , 1 1 p 1 + x ρ n x ρ B p , 1 1 p 1 ) ,

and

x ( ρ n x u n ρ x u ) B p , 1 1 p 1 C ( ρ n ρ B p , 1 1 p + x u n x u B p , 1 1 p ) C ( ρ n ρ B p , 1 1 p 1 + x ρ n x ρ B p , 1 1 p 1 + u n u B p , 1 1 p 1 + x u n x u B p , 1 1 p 1 ) .

Here, owing to G = x u + ϕ ρ and G C ( [ 0, T ] , B p ,1 1 p ) , we can get x u B p , 1 1 p C . In addition, applying Lemma 3.7, let s 1 = 1 p 1 and s 2 = 1 p , we can get

( x u n ) 2 ( x u ) 2 B p , 1 1 p 1 C x u n x u B p , 1 1 p 1 x u n + x u B p , 1 1 p C x u n x u B p , 1 1 p 1 .

Then for all n , using the above inequalities, we can have

t w 1 n B p , 1 1 p 1 + t w 2 n B p , 1 1 p 1 C ( ρ n ρ B p , 1 1 p 1 + x ρ n x ρ B p , 1 1 p 1 + u n u B p , 1 1 p 1 + x u n x u B p , 1 1 p 1 ) C ( ρ n ρ B p , 1 1 p 1 + u n u B p , 1 1 p 1 + w 1 n w 1 B p , 1 1 p 1 + z 1 n z 1 B p , 1 1 p 1 + w 2 n w 2 B p , 1 1 p 1 + z 2 n z 2 B p , 1 1 p 1 ) C ( ρ n ρ B p , 1 1 p 1 + u n u B p , 1 1 p 1 + w 1 n B p , 1 1 p 1 + z 1 n z 1 B p , 1 1 p 1 + w 2 n B p , 1 1 p 1 + z 2 n z 2 B p , 1 1 p 1 ) ,

from which it follows

w 1 n B p , 1 1 p 1 + w 2 n B p , 1 1 p 1 C e C t ( v 1 n ( 0 ) v 1 ( 0 ) B p , 1 1 p 1 + v 2 n ( 0 ) v 2 ( 0 ) B p , 1 1 p 1 + 0 t e C t ( ρ n ρ B p , 1 1 p 1 + u n u B p , 1 1 p 1 + w 1 n B p , 1 1 p 1 + z 1 n z 1 B p , 1 1 p 1 + w 2 n B p , 1 1 p 1 + z 2 n z 2 B p , 1 1 p 1 ) d t ) .

Since we prove that v 1 n ( 0 ) v 1 ( 0 ) and v 2 n ( 0 ) v 2 ( 0 ) in B p ,1 1 p 1 , ( ρ n , u n ) ( ρ , u ) in C ( [ 0, T ] ; B p ,1 1 p 1 ) × C ( [ 0, T ] ; B p ,1 1 p 1 ) , and according to Lemma 3.5, we can deduce that z 1 n ( t ) z 1 ( t ) in C ( [ 0, T ] ; B p ,1 1 p 1 ) , z 2 n ( t ) z 2 ( t ) in C ( [ 0, T ] ; B p ,1 1 p 1 ) . Furthermore, we obtain that w 1 n 0 in C ( [ 0, T ] ; B p ,1 1 p 1 ) and w 2 n 0 in C ( [ 0, T ] ; B p ,1 1 p 1 ) . Then according to Lemma 3.6 and w 1 = w 2 = 0 , we can get that w 1 n w 1 in C ( [ 0, T ] ; B p ,1 1 p 1 ) , and w 2 n w 2 in C ( [ 0, T ] ; B p ,1 1 p 1 ) .

Finally, we can deduce

v 1 n v 1 L T ( B p , 1 1 p 1 ) + v 2 n v 2 L T ( B p , 1 1 p 1 ) z 1 n z 1 L T ( B p , 1 1 p 1 ) + w 1 n w 1 L T ( B p , 1 1 p 1 ) + z 2 n z 2 L T ( B p , 1 1 p 1 ) + w 2 n w 2 L T ( B p , 1 1 p 1 ) z 1 n z 1 L T ( B p , 1 1 p 1 ) + w 1 n L T ( B p , 1 1 p 1 ) + z 2 n z 2 L T ( B p , 1 1 p 1 ) + w 2 n L T ( B p , 1 1 p 1 ) ,

which indicates that ( x u n , x ρ n ) ( x u , x ρ ) in

C ( [ 0, T ] , B p ,1 1 p 1 ) × C ( [ 0, T ] , B p ,1 1 p 1 ) . By a similar argument as above to the component G, we can have x z n x z in ( C ( [ 0, T ] , B p ,1 1 p 1 ) ) 3 . Combining Step 1 to Step 3, we complete the proof of Theorem 2.1. □

5. Ill-Posedness

In this section, we shall explore that the solutions of the Equation (9) are

ill-posedness in Besov spaces ( B p , r s ) 3 with the index s > max { 1 2 , 1 p } and

r = . To localize the frequency region, we have to introduce smooth radial cut-off functions. Set ψ ^ i C 0 , i = 1 , 2 , 3 is an non-negative, even and real-valued function on satisfying

ψ ^ i ( ξ ) = ( 1, if | ξ | 1 4 , 0, if | ξ | 1 2 .

Define the initial data

{ u 0 ( x ) = n = 0 2 n s ψ 1 ( x ) cos ( λ 1 2 n x ) , ρ 0 ( x ) = n = 0 2 n s ψ 2 ( x ) cos ( λ 2 2 n x ) , G 0 ( x ) = n = 0 2 n s ψ 3 ( x ) cos ( λ 3 2 n x ) , (15)

there λ i [ 67 48 , 69 48 ] and i = 1 , 2 , 3 . Then we can have

Δ j ( ψ i ( x ) cos ( λ i 2 n x ) ) = ( ψ i ( x ) cos ( λ i 2 n x ) , if j = n , 0, if j n .

So we can get

u 0 B p , s = ( 2 j s Δ j u 0 L p ) j l = ( 2 j s Δ j n = 0 2 n s ψ 1 ( x ) cos ( λ 1 2 n x ) L p ) j l = ( 2 j s 2 j s ψ 1 ( x ) cos ( λ 1 2 j x ) L p ) j l ( ψ 1 ( x ) cos ( λ 1 2 j x ) L p ) j l C .

At the same time, we can obtain

ρ 0 B p , s C , G 0 B p , s C .

On the basis of definition of Besov spaces, we can make an estimate

ϕ u B p , s = sup q 2 q s Δ q ϕ u L p sup q 2 q s ϕ L 1 Δ q u L p C u B p , s ,

where C is some positive constant.

Lemma 5.1. For the above constructed initial data ( u 0 , ρ 0 , G 0 ) , if some n large enough, we can obtain

u 0 Δ n x u 0 L p C 2 n ( s 1 ) , u 0 Δ n x ρ 0 L p C 2 n ( s 1 ) , u 0 Δ n x G 0 L p C 2 n ( s 1 ) . (16)

Proof. According to the definition of (15), we can get

u 0 Δ n x u 0 = u 0 2 n s x ( ψ 1 ( x ) cos ( λ 1 2 n x ) ) = u 0 2 n s [ x ψ 1 ( x ) cos ( λ 1 2 n x ) λ 1 2 n ψ 1 ( x ) sin ( λ 1 2 n x ) ] = 2 n s u 0 ψ 1 x cos ( λ 1 2 n x ) λ 1 2 n ( s 1 ) u 0 ψ 1 ( x ) sin ( λ 1 2 n x ) .

Because u 0 ( x ) is a real-valued continuous function on , there exists λ 1 > 0 such that for any x B λ 1 ( 0 )

| u 0 ( x ) | 1 2 u 0 ( 0 ) = 1 2 n = 0 2 n s ψ 1 ( 0 ) = 2 s 1 ψ 1 ( 0 ) 2 s 1 , (17)

by applying (17), we can obtain

u 0 Δ n x u 0 L p = 2 n s u 0 ψ 1 x cos ( λ 1 2 n x ) λ 1 2 n ( s 1 ) u 0 ψ 1 ( x ) sin ( λ 1 2 n x ) L p C 2 n ( s 1 ) u 0 ψ 1 ( x ) sin ( λ 1 2 n x ) L p 2 n s u 0 ψ 1 x cos ( λ 1 2 n x ) L p ( C 2 n C 1 ) 2 n s ,

taking a large enough n such that C 1 C 2 n 1 , then we obtain (16). □

Lemma 5.2. For the above constructed initial data ( u 0 , ρ 0 , G 0 ) ( B p , r s ) 3 , there exists T ( u 0 B p , s , ρ 0 B p , s , G 0 B p , s ) for 0 t T , we can obtain

u ( t ) u 0 B p , s 1 C t , ρ ( t ) ρ 0 B p , s 1 C t , G ( t ) G 0 B p , s 1 C t . (18)

Proof. Owing to ( u 0 , ρ 0 , G 0 ) ( B p , s ) 3 , the system (9) has a unique solution ( u , ρ , G ) L ( [ 0, T ] ; ( B p , s ) 3 ) , and

sup 0 t T ( u ( t ) B p , s + ρ ( t ) B p , s + G ( t ) B p , s ) C ( u 0 B p , s + ρ 0 B p , s + G 0 B p , s ) . (19)

Applying the differential mean value theorem, Lemma 3.7 and (19) t [ 0, T ] , we can obtain

u u 0 B p , s 1 0 t τ u B p , s 1 d τ 0 t u x u B p , s 1 + ϕ ( u ρ ) ( ϕ ρ ) u B p , s 1 d τ C 0 t u B p , s u x B p , s 1 + u ρ B p , s 1 + ϕ ρ B p , s u B p , s 1 d τ C 0 t u B p , s 2 + u B p , s ρ B p , s 1 + ρ B p , s u B p , s d τ C t ,

and

ρ ρ 0 B p , s 1 0 t τ ρ B p , s 1 d τ 0 t x u ρ B p , s 1 + u x ρ B p , s 1 d τ 0 t u B p , s x ρ B p , s 1 + x u B p , s 1 ρ B p , s d τ C 0 t u B p , s ρ B p , s + u B p , s ρ B p , s d τ C t .

By a similar argument as above to the component G, G ( t ) G 0 B p , s 1 C t . Therefore, we complete the proof of Lemma 5.2. □

Lemma 5.3. According to the assumption of Theorem 2.2 for the above-constructed initial data ( u 0 , ρ 0 , G 0 ) , 0 t T , there T ( u 0 B p , s , ρ 0 B p , s , G 0 B p , s ) , we can obtain

u ( t ) u 0 t w 0 B p , s 2 C ( t 2 + t ) , ρ ( t ) ρ 0 t v 0 B p , s 2 C ( t 2 + t ) , G ( t ) G 0 t m 0 B p , s 2 C ( t 2 + t ) , (20)

there w 0 = u 0 x u 0 + ϕ ( u 0 ρ 0 ) ( ϕ ρ 0 ) u 0 , v 0 = u 0 x ρ 0 x u 0 ρ 0 , and m 0 = u 0 x G 0 x u 0 G 0 .

Proof. Define

u ˜ = u ( t ) u 0 t w 0 , ρ ˜ = ρ ( t ) ρ 0 t v 0 , G ˜ = G ( t ) G 0 t m 0 .

Applying the differential mean value theorem, t [ 0, T ] , we can obtain

ρ ˜ B p , s 2 0 t τ ρ v 0 B p , s 2 d τ 0 t u x ρ u 0 x ρ 0 B p , s 2 d τ + 0 t ρ x u ρ 0 x u 0 B p , s 2 d τ , (21)

and

u ˜ B p , s 2 0 t τ u w 0 B p , s 2 d τ 0 t u x u u 0 x u 0 B p , s 2 d τ + 0 t ϕ ( u ρ ) ϕ ( u 0 ρ 0 ) B p , s 2 + ( ϕ ρ ) u ( ϕ ρ 0 ) u 0 B p , s 2 d τ . (22)

Using proposition 3.4, Lemma 3.7, and (19), we can deduce

u x ρ u 0 x ρ 0 B p , s 2 ( u u 0 ) x ρ + u 0 x ( ρ ρ 0 ) B p , s 1 u u 0 B p , s x ρ B p , s 1 + x ( ρ ρ 0 ) B p , s 1 u 0 B p , s u u 0 B p , s ρ B p , s + ρ ρ 0 B p , s u 0 B p , s C . (23)

Taking advantage of proposition 3.4, Lemma 3.7, Lemma 5.2, and (19), we can obtain

ρ x u ρ 0 x u 0 B p , s 2 ( ρ ρ 0 ) x u + ρ 0 x ( u u 0 ) B p , s 1 ρ ρ 0 B p , s 1 x u B p , s + x ( u u 0 ) B p , s 1 ρ 0 B p , s C ρ ρ 0 B p , s 1 + u u 0 B p , s ρ 0 B p , s C ( τ + 1 ) , (24)

and

u x u u 0 x u 0 B p , s 2 ( u u 0 ) x u + u 0 x ( u u 0 ) B p , s 1 u u 0 B p , s 1 x u B p , s + u u 0 B p , s u 0 B p , s C ( τ + 1 ) . (25)

Applying proposition 3.4, Lemma 3.7, and (19), we can get

ϕ ( u ρ u 0 ρ 0 ) B p , s 2 C u ρ u 0 ρ 0 B p , s 1 C ( u u 0 ) ρ + ( ρ ρ 0 ) u 0 B p , s 1 C u u 0 B p , s 1 ρ B p , s + ρ ρ 0 B p , s 1 u 0 B p , s C τ , (26)

and

( ϕ ρ ) u ( ϕ ρ 0 ) u 0 B p , s 2 ( ϕ ρ ) u ( ϕ ρ ) u 0 + ( ϕ ρ ) u 0 ( ϕ ρ 0 ) u 0 B p , s 1 u u 0 B p , s 1 ϕ ρ B p , s + ϕ ( ρ ρ 0 ) B p , s 1 u 0 B p , s C τ . (27)

Taking (23)-(24) into (21) and (25)-(27) into (22), we can deduce

ρ ˜ B p , s 2 C 0 t ( τ + 1 ) d τ C ( t 2 + t ) , u ˜ B p , s 2 C 0 t ( τ + 1 ) d τ C ( t 2 + t ) ,

similarly,

G ˜ B p , s 2 C 0 t ( τ + 1 ) d τ C ( t 2 + t ) .

Thus, we complete the proof of Lemma 5.3. Next, we prove Theorem 8. □

Proof. On the basis of the definition of the Besov norm, we can obtain

ρ ρ 0 B p , s 2 n s Δ n ( ρ ρ 0 ) L p = 2 n s Δ n ( ρ ˜ + t v 0 ) L p t 2 n s Δ n v 0 L p 2 n s Δ n ρ ˜ L p t 2 n s Δ n ( u 0 x ρ 0 ) L p C t 2 n s Δ n ( x u 0 ρ 0 ) L p 2 n s Δ n ρ ˜ L p t 2 n s Δ n ( u 0 x ρ 0 ) L p C t 2 n x ρ 0 u 0 B p , s 1 2 2 n ρ ˜ B p , s 2 . (28)

Making the following analysis

x ρ 0 u 0 B p , s 1 x ρ 0 B p , s 1 u 0 B p , s u 0 B p , s ρ 0 B p , s C ,

and

Δ n ( u 0 x ρ 0 ) = Δ n ( u 0 x ρ 0 ) u 0 Δ n ( x ρ 0 ) + u 0 Δ n ( x ρ 0 ) = [ Δ n , u 0 ] x ρ 0 + u 0 Δ n ( x ρ 0 ) .

Applying Lemma 3.8, we can obtain

2 n s [ Δ n , u 0 ] x ρ 0 L p l C ( x u 0 L ρ 0 B p , s + x ρ 0 L u 0 B p , s ) C .

Then using above inequalities into (28), we can get

ρ ρ 0 B p , s t 2 n s u 0 Δ n ( x ρ 0 ) L p C 1 t 2 n 2 2 n ρ ˜ B p , s 2 C 2 t 2 n s 2 n ( s 1 ) C 1 t 2 n C 3 ( t 2 + t ) 2 2 n = C 2 t 2 n C 1 t 2 n C 3 ( t 2 + t ) 2 2 n , C 2 t 2 n C 1 t 2 n C 3 t 2 2 2 n .

Here, we take that C 3 is a enough large number. If taking that C 1 and C 2 satisfy C 2 > 2 C 1 , then we can have

ρ ρ 0 B p , s C 2 t 2 n 2 C 3 t 2 2 2 n .

When n is a fixed number, let t 0 , choosing t 2 n δ < C 2 4 C 3 yields

ρ ρ 0 B p , s C 2 δ 2 C 3 δ 2 = C 2 δ 4 ,

similarly, we can deduce

u u 0 B p , s C 4 δ 4 , G G 0 B p , s C 5 δ 4 .

This completes the proof of Theorem 2.2. □

6. Blow-Up Criteria

In this section, we will present blow-up criteria for Equation (9). We first need to establish support from the following Lemma.

Lemma 6.1. Suppose that ( u , ρ , G ) ( C ( [ 0, T ] ; B p ,1 1 p ) ) 3 is the solution of the Cauchy problem (9) with the initial data ( ρ 0 , u 0 , G 0 ) ( B p ,1 1 p ) 3 . Then the component ρ satisfies the following expression

ρ ( t , x ) = ρ 0 ( ζ 1 ( t , x ) ) e 0 t u x ( s , x ) d s , t [ 0, T ) .

Proof. Considering the following initial value problem

{ ζ t = u ( t , ζ ( t , x ) ) , t [ 0 , T ) , x , ζ ( 0 , x ) = x , t = 0 , x .

Set T > 0 is the maximal existence time. Owing to ζ t x = u ζ ( t , ζ ( t , x ) ) ζ x ( t , x ) and ζ x ( 0, x ) = 1 , this implies

ζ x ( t , x ) = exp ( 0 t u ζ ( s , ζ ( s , x ) ) d s ) .

According to the second formula for (9), we can get

d d t ( ρ ( t , ζ ( t , x ) ) ζ x ) = ρ t ( t , ζ ( t , x ) ) ζ x + ρ ζ ( t , ζ ( t , x ) ) ζ t ζ x + ρ ( t , ζ ( t , x ) ) ζ x t = ζ x ( ρ t ( t , ζ ( t , x ) ) + ρ ζ ( t , ζ ( t , x ) ) u ( t , ζ ( t , x ) ) + ρ ( t , ζ ( t , x ) ) u ζ ( t , ζ ( t , x ) ) ) = 0 ,

thus, ρ ( t , ζ ( t , x ) ) ζ x is independent on t, we can obtain

ρ ( t , ζ ( t , x ) ) ζ x = ρ 0 ( x ) .

Consequently, we prove the Lemma 6.1. □

Theorem 6.2. Set the initial value ( u 0 , ρ 0 , G 0 ) ( C ( [ 0, T ] ; B p ,1 1 p ) ) 3 and ϕ L 1 .

Suppose that the maximal existence time of the Cauchy problem (9) solutions is T > 0 . If M > 0 satisfies that

u x L M , t [ 0, T ) ,

then the solution z ( x , t ) of the Cauchy problem (9) does not blow up in [ 0, T ) .

Proof. According to Lemma 6.1, we can establish the following estimate

ρ ( t , x ) L = ρ 0 ( ζ 1 ( t , x ) ) e 0 t u x ( s , x ) d s L ρ 0 ( ζ 1 ( t , x ) ) L e 0 t u x ( s , x ) L d s ρ 0 B p , 1 1 p e 0 t u x ( s , x ) L d s ,

this is because the embedding B p ,1 1 p W 1, p W 1, . If M > 0 satisfies that u x L u x B p , 1 1 p M , t [ 0, T ) , then we can have

ρ ( t , x ) L ρ 0 B p , 1 1 p e M T , (29)

similarly,

G ( t , x ) L G 0 B p , 1 1 p e M T . (30)

According to the result of local well-posedness, applying Δ j to (9) yields

{ Δ j u t + u Δ j u x = Δ j [ ϕ ( u ρ ) ( ϕ ρ ) u ] + [ u x , Δ j ] u , Δ j ρ t + u Δ j ρ x = Δ j ( u x ρ ) + [ u x , Δ j ] ρ , Δ j G t + u Δ j G x = Δ j ( u x G ) + [ u x , Δ j ] G , Δ j ρ ( x , 0 ) = Δ j ρ 0 ( x ) , Δ j u ( x , 0 ) = Δ j u 0 ( x ) .

Multiplying both sides of the above equation by s g n ( Δ j u ) | Δ j u | p 1 , s g n ( Δ j ρ ) | Δ j ρ | p 1 , and s g n ( Δ j G ) | Δ j G | p 1 and integrating over respectively, we can obtain

Δ j u L p Δ j u 0 L p + 0 t ( Δ j [ ϕ ( u ρ ) ( ϕ ρ ) u ] L p + [ u x , Δ j ] u L p + u x L Δ j u L p ) d t ,

and

Δ j ρ L p Δ j ρ 0 L p + 0 t ( Δ j ( u x ρ ) L p + [ u x , Δ j ] ρ L p + u x L Δ j ρ L p ) d t ,

multiplying both sides of the above inequality by 2 j p and taking l 1 -norm respectively, we can get

u B p , 1 1 p u 0 B p , 1 1 p + 0 t ( ϕ ( u ρ ) ( ϕ ρ ) u B p , 1 1 p + 2 j p [ u x , Δ j ] u L p l 1 + u x L u B p , 1 1 p ) d t ,

and

ρ B p , 1 1 p ρ 0 B p , 1 1 p + 0 t ( u x ρ B p , 1 1 p + 2 j p [ u x , Δ j ] ρ L p l 1 + u x L ρ B p , 1 1 p ) d t .

On the basis of Lemma 3.8, we can deduce

2 j p [ u x , Δ j ] u L p l 1 C u x L u B p , 1 1 p ,

and

2 j p [ u x , Δ j ] ρ L p l 1 C u x L ρ B p , 1 1 p ,

by the estimate (1) and Lemma 3.4, we can obtain

u B p , 1 1 p u 0 B p , 1 1 p + 0 t C ( u B p , 1 1 p ρ B p , 1 1 p + u x L u B p , 1 1 p ) d t ,

and

ρ B p , 1 1 p ρ 0 B p , 1 1 p + 0 t C ( u x B p , 1 1 p ρ B p , 1 1 p + u x L ρ B p , 1 1 p ) d t .

Similarly, by the same deduction, we can deduce

G B p , 1 1 p G 0 B p , 1 1 p + 0 t C ( u x B p , 1 1 p G B p , 1 1 p + u x L G B p , 1 1 p ) d t ,

from the above inequalities, we can get

u B p , 1 1 p + ρ B p , 1 1 p + G B p , 1 1 p ( u 0 B p , 1 1 p + ρ 0 B p , 1 1 p + G 0 B p , 1 1 p ) + C 0 t u x B p , 1 1 p ( u B p , 1 1 p + ρ B p , 1 1 p + G B p , 1 1 p ) d t .

Applying Gronwall’s inequality, we can obtain

u B p , 1 1 p + ρ B p , 1 1 p + G B p , 1 1 p ( u 0 B p , 1 1 p + ρ 0 B p , 1 1 p + G 0 B p , 1 1 p ) exp ( C 0 t u x B p , 1 1 p d t ) ( u 0 B p , 1 1 p + ρ 0 B p , 1 1 p + G 0 B p , 1 1 p ) exp ( C M t ) ,

so we complete the proof. □

Then we shall establish the proof of Theorem 2.3.

Proof. Set ( u , ρ , G ) ( C ( [ 0, T ] ; B p ,1 1 p ) ) 3 is the solution of the Cauchy problem (9) with the initial data ( u 0 , ρ 0 , G 0 ) ( B p ,1 1 p ) 3 , and the maximal existence time of

the Cauchy problem (9) solutions is T > 0 . We suppose that the solution of Equation (9) blows up in finite time T, and there exists a constant M > 0 such that

u x ( t , x ) M , ( t , x ) [ 0, T ) × . (31)

Applying to (29) and (30), then we can get

u x ( t , x ) L ϕ L 1 ρ L + G L C ρ L + G L C ρ 0 B p , 1 1 p e M T + G 0 B p , 1 1 p e M T . (32)

By (31) and (32), we can obtain a contradiction with Theorem 6.2. On the basis of Theorem 6.2 and Sobolev embedding theorem, if

lim t T inf x u x ( t , x ) = ,

then the solution will blow up in a finite time.

This completes the proof of the Theorem 2.3. □

Conflicts of Interest

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

References

[1] Sneyd, J., Theraula, G., Bonabeau, E., Deneubourg, J.-L. and Franks, N.R. (2001) Self-Organization in Biological Systems. Princeton University Press, Princeton.
https://doi.org/10.1515/9780691212920
[2] Seeley, T.D. (2002) When Is Self-Organization Used in Biological Systems? The Biological Bulletin, 202, 314-318.
https://doi.org/10.2307/1543484
[3] Wedlich-Söldner, R. and Betz, T. (2018) Self-Organization: The Fundament of Cell Biology. Philosophical Transactions of the Royal Society B: Biological Sciences, 373, Article 20170103.
https://doi.org/10.1098/rstb.2017.0103
[4] Huth, A. and Wissel, C. (1992) The Simulation of the Movement of Fish Schools. Journal of Theoretical Biology, 156, 365-385.
https://doi.org/10.1016/S0022-5193(05)80681-2
[5] Deisboeck, T.S. and Couzin, I.D (2009) Collective Behavior in Cancer Cell Populations. Bioessays, 31, 190-197.
https://doi.org/10.1002/bies.200800084
[6] Do, T., Kiselev, A., Ryzhik, L. and Tan, C.H. (2018) Global Regularity for the Fractional Euler Alignment System. Archive for Rational Mechanics and Analysis, 228, 1-37.
https://doi.org/10.1007/s00205-017-1184-2
[7] Cucker, F. and Smale, S. (2007) Emergent Behavior in Flocks. IEEE Transactions on Automatic Control, 52, 852-862.
https://doi.org/10.1109/TAC.2007.895842
[8] Ha, S.-Y. and Tadmor, E. (2008) From Particle to Kinetic and Hydrodynamic Descriptions of Flocking.
[9] Carrillo, J.A., Fornasier, M., Rosado, J. and Toscani, G. (2010) Asymptotic Flocking Dynamics for the Kinetic Cucker-Smale Model. SIAM Journal on Mathematical Analysis, 42, 218-236.
https://doi.org/10.1137/090757290
[10] Carrillo, J.A., Choi, Y.-P., Tadmor, E. and Tan, C.H. (2016) Critical Thresholds in 1D Euler Equations with Non-Local Forces. Mathematical Models and Methods in Applied Sciences, 26, 185-206.
https://doi.org/10.1142/S0218202516500068
[11] Tan, C.H. (2020) On the Euler-Alignment System with Weakly Singular Communication Weights. Nonlinearity, 33, Article 1907.
https://doi.org/10.1088/1361-6544/ab6c39
[12] Leslie, T.M and Tan, C.H. (2023) Sticky Particle Cucker-Smale Dynamics and the Entropic Selection Principle for the 1D Euler-Alignment System. Communications in Partial Differential Equations, 48, 753-791.
https://doi.org/10.1080/03605302.2023.2202720
[13] Bahouri, H., Chemin, J.-Y. and Danchin, R. (2011) Fourier Analysis and Nonlinear Partial Differential Equations. Springer Science & Business Media, 343.
https://doi.org/10.1007/978-3-642-16830-7
[14] Danchin, R. (2005) Fourier Analysis Methods for PDEs. Lecture Notes, 14, 1.
[15] Li, J.L. and Yin, Z.Y. (2016) Well-Posedness and Global Existence for a Generalized Degasperis-Procesi Equation. Nonlinear Analysis: Real World Applications, 28, 72-90.
https://doi.org/10.1016/j.nonrwa.2015.09.003
[16] Li, J.L. and Yin, Z.Y. (2016) Remarks on the Well-Posedness of Camassa-Holm Type Equations in Besov Spaces. Journal of Differential Equations, 261, 6125-6143.
https://doi.org/10.1016/j.jde.2016.08.031

Copyright © 2024 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.