Transport Equation and Well-Posedness
Transport Equation and Well-Posedness
Sujob
July 2025
1. Transport Equation
1.1. Example
Consider the following PDE
(
∂t f + ∂x f = 0
f (x, 0) = f0 (x)
where f is a function from R × [0, ∞) to R. The solution is just f (x, t) = f0 (x − t). Then this
f has the same shape as f0 (x) at time t.
1.2. Example
Consider the following case:
(
∂t f + x∂x f = 0
f (x, 0) = f0 (x)
Then
df0 −t
∂t f = (e x) (−e−t x).
dx
df0 −t −k df0 −t
x∂x f = (e x) e = (e x) (e−t x).
dx dx
(
∂t f + ∂x f = 0
f (x, t) = f0 (x)
is well-posed in C ∞ .
1
Proof ) For the uniqueness, f0 (x−t) ∈ C ∞ (R×[0, ∞)) since f0 ∈ C ∞ (R) and f (x, t) = f0 (x−t)
satisfies the equation.
Assume g(x, t) ∈ C ∞ and satisfies the equation. Consider G(x, t) = g(x + t, t) ∈ C ∞ and
take
∂G ∂g ∂g
= (+1) + ≡0
∂t ∂x ∂t
giving G(x, t) = G(x, 0) = g(x, 0) = f0 (x) for all x, t. Hence take z = x + t, then x = z − t.
1.4. Definition
Consider functions defined on R.
(1) f is in Cloc (R) if f is continuous on R and bounded on any bounded set of R.
df
(2) f is in C 1 (R) if f is differentiable on R and f and f ′ = dx are continuous and uniformly
1
bounded on R. Define the C - norm of f as
(4) f is in C ∞ (R)([Link]
∞
(R)) if f ∈ ∩k≤0 C k (R)([Link]
k
(R)).
k k
(5) f is in Cc (R) if f ∈ C (R) and it is compactly supported.
1.5. Remark
dk f
Does it makes sense to define a norm of C ∞ space? Even in the ∥f ∥C ∞ = ∞
P −k100
1 e dxk
.
C(R)
1.7. Example
(1) v(t, x) ≡ v0 ∈ R.
Then the solution f (t, x) is of the form f (t, x) = f0 (x − v0 t) for (t, x) ∈ R × R. The charac-
teristic curve is x − t = C.
(2) v(t, x) ≡ x.
Then f (t, x) = f0 (e−t x) for (t, x) ∈ R × R. The characteristic curve in this case is x = e−t C.
1.8. Definition
Suppose that for all (t, x), there exists a curve containing that point and the curve inter-
sects {t = 0} at a unique point. Moreover, f is invariant on each curves. This f is called a
characteristic or trajectory.
2
The method of trajectory or characteristics must satisfy
d
X(t, a) = v(t, X(t, a)),
dt
X(0, a) = a.
Assume that for every a ∈ R, X(t, a) exists and is smooth. Assume that f solves the linear
transport problem. Then
d dX
f (t, X(t, a)) = (∂t f )(t, X) + (∂x f )(t, X) ·
dt dt
= (∂t f + v∂x f )(t, X) ≡ 0.
Then f (t, X(t, a)) = f (0, X(0, a)) = f (0, a) = f0 (a). Fix t. Assume that the map a 7→ X(t, a) is
invertible. Denote the inverse by X −1 (t, a): X −1 (t, X(t, a)) = a. Then from f (t, X(t, a)) = f0 (a),
we get f (t, x) = f0 (X −1 (t, x)).
1.9. Remark
In fact, when v is independent of t, then X −1 (t, ·) and X(−t, ·) are equal but in general case,
that is not true. If v ≡ v0 , then X(t, a) = a + v0 t and X −1 (t, a) = a − v0 t ≡ X(−t, a). If v ≡ x,
then X(t, a) = et a. Hence X −1 (t, a) = e−t a ≡ X(−t, a).
This implies that if one attempts to guess the location of the particle prior to some time
period t, then the point is in fact, X −1 (t, a).
∂V
Since |A(s, h)| = ∂x
(s, ch )is bounded by a constant L > 0 for t ∈ [0, T ], we have:
Z t Z t
|W (t, h)| ≤ L|W (s, h)| ds + |B(s, h)| ds
0 0
Rt
This expression is in the form u(t) ≤ α(t) + 0 β(s)u(s) ds, where: u(t) = |W (t, h)|, α(t) =
Rt Rt
|B(s, h)| ds, β(s) = L. The Gronwall-Bellman inequality states that u(t) ≤ α(t)e 0 β(s)ds .
0
4
Applying it gives:
Z t Rt
|W (t, h)| ≤ |B(s, h)| ds e 0 L ds
Z0 t
≤ |B(s, h)| ds eLt
0
Substituting this back into our Gronwall result gives the final bound:
|W (t, h)| ≤ (εh M t)eLt
Taking the limit as h → 0:
1.11. Theorem
Consider the linear transport equation:
(
∂t f + v(t, x)∂x f = 0
(1)
f (0, x) = f0 (x)
≤C (f − g)2 dx = CE(t).
−∞
Hence E(t) ≤ E(0)eCt but E(0) = 0. This proof is basically incorrect as one can not use
integration by parts and even assume the finiteness of the energy E(t).
by the Duhamel’s principle. Now insert X −1 (t, a) to a position. Then we obtain the explicit
formula for f . This f is actually a solution.
1.15. Lemma
Let Y be a C 1 function of t satisfying
d
Y ≤ M Y.
dt
Then
d −M t
(e Y (t)) = −M e−M t Y + e−M t Y ′ ≤ −M e−M t Y + e−M t M Y
dt
≤0
Proof ) The proof uses something similar like Gronwell’s formula.
d −M t
(e Y (t)) = −M e−M t Y + e−M t Y ′ ≤ −M e−M t Y + e−M t M Y
dt
≤0
1.16. Theorem
Let v, S, G ∈ C 1 ([−T, T ]) × R and f0 ∈ C 1 (R). Then if f, g are C 1 ([−T, T ] × R) satisfying
(∗) in [−T, T ] × R, then
f ≡ g, ∀x ∈ [−T, T ] × R.
Proof ) Consider the following weighted energy;
Z ∞
1
E(t) = 2
|f (t, x) − g(t, x)|2 dx.
−∞ 1 + x
If f, g ∈ C(R), then E < ∞ and
Z ∞
dE 2
= 2
(f − g)(−v∂x (f − g) + S(f − g))dx
dt −∞ 1 + x
Z ∞
1 2 2S
= ∂x ( 2
v)(f − g)2 + 2
(f − g)2 dx by integration by parts
2 1 + x 1 + x
Z−∞
∞
∂x v + 2S 4x
= 2
− 2 )2
v (f − g)2 dx
−∞ 1 + x (1 + x
Z ∞
(f − g)2
4x dE
= (∂x v + 2S) − v dx ⇒ ≤ ME
−∞ 1 + x2 1 + x2 dt
For t < 0, E(t) ≤ E(0) exp(M t) = 0 giving the uniqueness.
7
There may exist nonbounded solutions. Assume f, g are solution which are continuous and
are allowed to grow linearly in space i.e.
However, problem here is that the energy here can no longer control the energy that escapes
x = 1. In this case we allow the interval of integration to shrink faster than the velocity. That
is,
Z 1−Rt
Eloc (t) = |f (t, x) − g(t, x)|2 dx.
−1+Rt
Z 1−Rt
d 1−Rt
Eloc (t) = (∂x v)(f − g)2 dx + v(f − g)2 |−1+Rt + R(f − g)2 |1−Rt
−1+Rt .
dt −1+Rt
d
Eloc (t) ≤ sup(∂x V )Eloc (t).
dt (t,x)
8
2. The Transport Diffusion Equation
In solving Navier-Stokes equations,
(
∂t u + u · ∇u = −∇p + ∆u
∇ · (u) = 0
mathematicians faced three key difficulties; x ∈ R3 ; u must satisfy total three equations at once
; velocity in the transport is an unknown term turning the equaiton to be nonlinear. If v were
given, then the equation would have been linear.
d
∇a X(t, a) = ∇x V (t, X(t, a))∇a X(t, a)
dt
∂a1 X1 ∂a1 X2 · · · ∂a1 Xn ∂x1 v1 ∂x1 v2 · · · ∂x1 vn
∂a1 X
d a2 X1 ∂a2 X2
∂ · · · ∂a2 Xn ∂x2 v1 ∂x2 v2 · · · ∂x2 vn
... i.e. d A = DA.
. .. .. .. = .. .. .. ..
dt .. . . . . . . . dt
∂an X
∂an X1 ∂an X2 · · · ∂an Xn ∂xn v1 ∂xn v2 · · · ∂xn vn
If we take a determinant in both hands, then
d
det A = Tr(D) det(A)
dt
Let J(t, a) = det ∇a X(t, a) = det A. Then
Since the Jacobian is never zero, the Inverse function theorem shows that the inverse of
a 7→ X(t, a) is a C ∞ -diffeomorphism.
9
2.2. Theorem
The n -dimensional linear transport equation has the unique solution f0 (Xt−1 (x)).
Proof ) The direct calculation shows that the equation has a solution. Its uniqueness follows
from the characteristic method or the energy method.
Hence the first problem was simply solved considering the obvious n -dimensional general-
ization.
given v0 ∈ C ∞ (R)
The most common way to show the existence of the solution in the ODE is to use the
iteration. What it means by iteration is to perform below calculations
y (0) (t) ≡ y0
Z t
(1)
y (t) ≡ y0 + F (s, y(s))ds
0
..
.
Z t
(n+1)
y (t) ≡ y0 + F (s, y (n) (s))ds.
0
Then
Z t
|(yn+1 − yn )(t)| ≤ F (s, y (n) (s)) − F (s, y (n−1) (s)) ds
0
Z tZ t
≤ sup |∂y F | y (n) (s) − y (n−1) (s) ds.
x,t 0 0
1
If 0 ≤ t ≤ 2 supx,t |∂y F |
= T , then
sup y (n+1) − y (n) (t) ≤ sup y (n) − y (n−1) (s) · sup |∂y F | · T
0≤t≤T 0≤s≤T x,t
n n−1
sup d (t) ≤ sup d (t) · · ·
0≤t≤T 0≤t≤T
2.4. Example
Consider the standard Picard’s iteration from ODE.
(
Ẏ = f (Y )
.
Y (0) = y0
(n)
and this never converges in C ∞ . This is because v (n+1) contains the (∂x v0 ) and there is no
norm in C ∞ that bounds the iteration. If one chooses the norm in C k , then the iteration term
with −∂x u actually requires higher norms. Moreover, there are smooth functions whose n th
deriatives grow arbitrarily large.
Euler-Lagrangian Method
There are two alternatives for the solution; first is to use the iteration with solving trajectories.
That is, to use iteration while finding v1 such that
v (0) (t, x) = v0 (x)
(
∂t v (1) + v (0) ∂x v (1) = 0
.
v (1) (0, x) = v0 (x)
However, extra caution is required for nonlinear cases since the solution v might blow up in
infinite time interval or even for finite time interval as can be seen in the example ẏ = y12 .
2.5. Theorem
Let v0 ∈ C ∞ (R). Define A = supx∈R |∂x v0 (x)| = ∥v0 ∥Ċ 1 (R) . Then, take 0 < T < A1 .
There is a unique solution to (∗) where v(t, x) ∈ C ∞ ([−T, T ] × R) i.e. there is a solution in
∞
Cloc ( −1
A A
, 1 × R) .
Proof ) (1) Uniqueness.
Assume that ui (t, x), i = 1, 2 decay rapidly as |x| → ∞. Define
Z
E(t) = |u1 (t, x) − u2 (t, x)|2 dx.
R
Then
Z
d
E=2 (u1 − u2 ) (−u1 ∂x u1 + u2 ∂x u2 )
dt R
Z
u1
(u1 − u2 ) (−u1 ∂x (u1 − u2 ) − ∂x u2 (u1 − u2 )) = − ∂x (u1 − u2 )2
=2
2
ZR
∂x u1 ∂x u1
=2 − ∂x u2 (u1 − u2 )2 dx ≤ 2 sup − ∂x u2 E(t)
R 2 x,t 2
11
Hence E(t) = 0 for t > 0 since E(0) = 0. This extends to local energy method.
(2) Existence.
Consider the
d (n)
X (t, a) = v (n) (t, X (n) (t, a))
dt
X (n) (0, a) = a
(n)−1
and v (n+1) (t, x) = v0 (Xt (x)). Then v (n+1) is the unique soution to
∂t v (n+1) = −v (n) ∂x v (n+1)
v (n+1) (0, x) = v0 (x).
(n)
In this setting, first we find the uniform bound on v (n) (t, x) n≥0
. Then v (t, x) n≥0
is a
Cauchy sequence if we restrict time appropriately.
(a) Uniform bound on v (m) .
(n)−1
Recall that v (n+1) (t, x) = v0 Xt (x) is equivalent to
(
∂t v (n+1) + v (n) ∂x v (n+1) = 0
.
v (n+1) (0, x) = v0 (x)
d
∂x v (n+1) (t, X (n) (t, a)) = −∂x v (n) ∂x v (n+1) .
dt
For some T > 0, the hypothesis gives that
sup ∂x v (n) (t, ·) C(R)
≤ M (M > A).
0≤t≤T
Then as long as 0 ≤ t ≤ T ′ ,
d
∂x v (n+1) (t, X (n) (t, a)) ≤ M ∂x v (n+1) (t, X (n) (t, a))
dt
using that d 2
dt
f = 2|f |f ′ = 2gf 2 = 2g|f ||f |. Then we arrive to the conclusion that
∂x v (n+1) (t, X (n) (t, a)) ≤ ∂x v (n+1) (0, X (n) (0, a)) eM t
= |∂x v0 (a)|eM t ≤ AeM t .
′
Now we can take supremum over all a and 0 ≤ t ≤ T ′ . If we take T ′ so that AeM T ≤ M ,
then
sup sup ∂x v (n) (t, · · · ) C(R)
≤ M.
n≥0 0≤t≤T ′
The final display shows that the the partial differentials grow exponentially. Choose
sup ∂x2 v (n) (t, x) ≤ 2A2 e2M t
x∈A
for all 0 ≤ t ≤ T ′ . The key issue is to take T ′ independent of k. Let A2 := supx∈R |∂x2 v0 (x)|.
Then
d
|f2 | ≤ 2A2 e2M t M + 2M |f2 |
dt
d −2M t
(e |f2 |) = e−2M t · 2A2 e2M t M, and
dt
e−2M t |f2 | ≤ e−2M ·0 A2 + 2M A2 t ≤ A2 + 2M A2 T ′ = (1 + 2M T ′ )A2 ≤ 2A2 .
Now change
(n) 2 to k for general k-th step.
(d) v n≥0
is Cauchy in C([0, T ′ ] × R).
Direct calculation gives that subtraction of two equations leads to
(
∂t v (n+1) = −v (n) ∂x v (n+1)
.
∂t v (n) = −v (n−1) ∂x v (n)
Then
(n+1)
∂t (v (n)−v ) = −v (n−1) ∂x (v (n) − v (n+1) ) − ∂x v (n+1) v (n) − v (n−1) .
d (n)
(v − v (n+1) )(t, X (n−1) (t, a)) = −∂x v (n+1) (v (n) − v (n−1) ) (t, X (n−1) (t, a))
dt
Let dn to be sup0≤t≤T ′ (v (n) − v (n−1) )(T, ·) C(R)
. Then
d (n)
v − v (n+1) ≤ M dn , 0 ≤ t ≤ T ′
dt
v (n) − v (n+1) (t, ·)C(R) ≤ M dn t ≤ M T ′ dn
dn+1 ≤ M T ′ dn ≤ (M T ′ )2 dn−1 ≤ · · · (M T ′ )n d1 .
Propagation of Regularity
Changing the viewpoint, we iterately apply the theorem again; our PDE itself does not
depend on the time variable t ∈ [0, T ] so we can continue the solution by setting t′ = t − T . In
our PDE, the maximum time continuation is
1
T∗ = .
supx∈R |∂x v0 (x)|
2.6. Theorem
For Burger’s equation, let v0 ∈ C ∞ (R) and let v be a solution in C 1 ([0, T ] × R) with v(0, x) =
v0 (x). Then v ∈ C k ([0, T ] × R).
Proof )
2.7. Remark
We proved existence of C 1 solution v using v0 ∈ C 2 . How can we get the existence just by
v0 ∈ C 1 ?
2.9. Example
Consider the viscous Burgers equation:
∂t u + u∂x u = ∂xx u =
0
The above equation has C as the critical regularity.
The idea behind the critical regularity is that equation for higher derivatives is linear in
itself; that is, with our Burger’s equation,
(
∂t v + v∂x v = 0
∥v(t, x)∥C([0,T ]×R) ≤ ∥v0 (x)∥C(R) .
Then ∂t ∂x v = −v∂x (∂x v) − (∂x v)2 and dtd (∂x v)(t, X) = −(∂x v)2 (t, X) is nonlinear but becomes
linear when differentiated multiple times.
15