Professional Documents
Culture Documents
r
X
i
v
:
1
1
0
9
.
4
7
5
4
v
1
[
m
a
t
h
.
P
R
]
2
2
S
e
p
2
0
1
1
Kawasaki dynamics in continuum: micro- and
mesoscopic descriptions
Christoph Berns
Yuri Kondratiev
Yuri Kozitsky
Oleksandr Kutoviy
t
= L
t
,
t
[
t=0
=
0
, (1.2)
where the generator L
F
t
d
0
=
_
F
0
d
t
, (1.4)
which would yield the evolution in question in a weak sense. However, for
nontrivial models, even such weak evolution cannot be obtained directly.
Following classical works on the Hamiltonian dynamics one can try to study
the evolution
0
t
via the evolution of the corresponding correlation
functions obtained from the equation
d
dt
k
t
= L
k
t
, k
t
[
t=0
= k
0
, (1.5)
where the relationship between k
t
and
t
may not be straightforward
1
. This
means that the solutions of (1.5) need not be a correlation functions and
1
In those classical works, (1.5) is known as the BBGKY hierarchy and the mentioned
connection is usually not discussed.
2
hence do not correspond to the states of the system. Typically, one tries to
solve (1.5) by constructing an operator semigroup S(t) such that k
t
= S(t)k
0
,
which in nontrivial cases inevitably leads to certain restrictions typical to
perturbation schemes. At the same time, it is clear that such methods
cannot describe many interesting features of the system behavior. An alter-
native approach could be based on methods which guarantee the existence
of solutions on bounded time intervals only. Noteworthy, (1.5) is in fact
an innite chain of linear equations and L
0
t
described by a stochastic semigroup. Here we crucially use a version
of Miyaderas theorem obtained in [19] as Theorem 2.7. Next, for an innite
Kawasaki system, we prove that the corresponding equation (1.5) has a
unique (classical) solution k
t
on some time interval in a scale of Banach
spaces (Theorem 3.3). Here we use a version of Ovcyannikovs approach,
see [16] and pp. 913 in [2]. This result, however, does not guarantee that
k
t
is the correlation function of a probability measure on . To prove the
3
latter, see Theorem 3.7, we approximate the considered innite system by
nite systems and use Theorem 3.1. Afterwards, in Section 4 we perform
the Vlasov scaling and obtain the so called Vlasov hierarchy, which is a
linear evolution equation of the type of dr
t
/dt = L
V
r
t
in the same scale
of spaces as the equation for the correlation functions. Its main peculiarity
is fact that if r
0
is the correlation function of the nonhomogeneous Poisson
measure
0
with density
0
, then the solution r
t
is the correlation function
for
t
provided
t
lies in a certain ball in L
(R
d
) and solves a nonlinear
nonlocal equation, see Lemma 4.2. In Theorem 4.4, we prove that this is the
case if
0
lies in that ball. Finally, in Theorem 4.5 we obtain that the rescaled
correlation functions converge in the scaling limit to the corresponding r
t
.
2 The basic notions and the model
2.1 The notions
In this paper, we work in the approach of [5, 6, 7, 8, 9, 12] where all the
relevant details can be found. Thus, we provide here only the necessary
minimum.
By B(R
d
) and B
b
(R
d
) we denote the sets of all Borel and all bounded
Borel subsets of R
d
, respectively. For X B(R
d
), the set of n-particle
congurations in X is
(0)
X
= ,
(n)
X
= X : [[ = n, n N. (2.1)
(n)
X
can be identied with the symmetrization of the set
(x
1
, . . . , x
n
) X
n
: x
i
,= x
j
, for i ,= j R
nd
,
which allows one to introduce the corresponding topology and hence the
Borel -algebra B(
(n)
X
). The set of nite congurations in X is
0,X
=
_
nN
0
(n)
X
. (2.2)
We equip it with the topology of the disjoint union and hence with the
Borel -algebra B(
0,X
). For X = R
d
, we write
(n)
and
0
meaning the
corresponding sets (2.1) and (2.2), respectively. The set of all congurations
in R
d
is dened in (1.1). We equip it with the vague topology, that is the
weakest topology in which all the maps
, f =
x
f(x), f C
0
(R
d
),
are continuous. Here C
0
(R
d
) stands for the set of all continuous functions
f : R
d
R with compact supports. In [10], it was shown that the vague
4
topology on admits a metrization which turns it into a complete and
separable metric (Polish) space. By B() we denote the corresponding Borel
-algebra.
Given n N, by m
(n)
we denote the restriction of the Lebesgue prod-
uct measure dx
1
dx
2
dx
n
to (
(n)
, B(
(n)
)). Then the Lebesgue-Poisson
measure on (
0
, B(
0
)) is
=
n=1
1
n!
m
(n)
. (2.3)
For any B(R
d
), the restriction of to
:=
0,
will also be denoted by
. It is worth noting that B(
) = B()
, B(
))
B
b
(R
d
)
. Hence the Poisson measure on
(, B()) is the projective limit of the family
B
b
(R
d
)
, where
= exp(m()), (2.4)
m() being the Lebesgue measure of , see e.g. [1] and references therein.
The Poisson measure
, where, for B
b
(R
d
),
m
() =
_
(x)dx, (2.5)
which is supposed to be nite. Then
= exp(m
())
. (2.6)
For a measurable f : R
d
R and
0
, the Lebesgue-Poisson exponent is
e(f, ) =
x
f(x), e(f, ) = 1. (2.7)
Clearly, e(f, ) L
1
(
0
, d) for any f L
1
(R
d
), and
_
0
e(f, )(d) = exp
__
R
d
f(x)dx
_
. (2.8)
A set M B(
0
) is said to be bounded if
M
N
_
n=0
(n)
(2.9)
for some B
b
(R
d
) and N N. By B
bs
(
0
) we denote the set of all
bounded measurable functions G :
0
R, which have bounded supports.
5
That is, each such G is the zero function on
0
M for some bounded M.
Note that any measurable G :
0
R is in fact a sequence of measurable
symmetric functions G
(n)
: (R
d
)
n
R.
For B
b
(R
d
) and , by
we denote ; thus,
0,
,
see (1.1). We consider also the set T
cyl
() of cylinder functions. Each
F T
cyl
() is characterized by the following relation: F() = F
)
for some B
b
(R
d
). For , by writing we mean that and
is nite, i.e.,
0
. For G B
bs
(
0
), we set
(KG)() =
G(), . (2.10)
It is clear that K maps B
bs
(
0
) into T
cyl
(), and is linear and positivity
preserving. This map plays an important role in the theory of conguration
spaces, see [9].
By /
1
fm
() we denote the set of all probability measures on (, B())
which have nite local moments, that is, for which
_
[
n
(d) < for all n N and B
b
(R
d
). (2.11)
A measure on (
0
, B(
0
)) is said to be locally nite if (M) < for every
bounded M
0
. By /
lf
(
0
) we denote the set of all such measures. For
B
b
(R
d
), p
() =
. Then, for A
,
we write p
1
(A) = : p
() A.
Denition 2.1. A measure /
1
fm
() is said to be locally absolutely
continuous with respect to the Poisson measure if, for every B
b
(R
d
),
the projection
:= p
1
(2.12)
is absolutely continuous with respect to
(M) =
_
(KI
M
)()(d), (2.13)
which uniquely determines a measure
/
lf
(
0
)). It is called the correla-
tion measure for . This denes a map K
: /
1
fm
() /
lf
(
0
)) such that
K
. In particular, K
() =
d
d
() =
_
0,
d
( )
(d) (2.14)
=
_
0,
d
d
( )(d).
6
The Radon-Nikodym derivative k
0
G()(d) 0, (2.15)
for every G B
bs
(
0
) such that KG 0. Then there exist /
1
fm
()
such that K
x
C
R
(x), (2.16)
for all
0
and for some locally integrable C
R
: R
d
R
+
.
Finally, we mention the following integration rule, c.f. Lemma 2.1 in [6],
_
H(, , )(d) =
_
0
_
0
H(, , )(d)(d), (2.17)
which holds for any appropriate function H.
2.2 The model
The Kawasaki dynamics is conservative, which means that the particles do
not appear or disappear they change their positions by hopping over the
space R
d
. In terms of observables, i.e., appropriate functions F : R,
the dynamics is generated by the following heuristic operator
(LF)() =
x
_
R
d
c(x, y, ) [F( x y) F()] dy, (2.18)
where the hopping rate c depends on the conguration and on the
initial and target points x and y, respectively. This means that the evolution
of states
0
t
is obtained as a solution of the Cauchy problem
d
dt
F,
t
= LF,
t
,
t
[
t=0
=
0
, (2.19)
where
F, :=
_
F()(d). (2.20)
In our particular model, the particles interact pairwise. For the two located
at x and y, the interaction energy is (xy), where the interaction potential
: R [0, +) := R
+
is such that (x) = (x) and
c
:=
_
R
d
_
1 e
(x)
_
dx < . (2.21)
7
That is, the particles repel each other. For a conguration , the total
energy is
E
() =
{x,y}
(x y),
and the energy increment caused by the appearance of a particle at point z
is
E
(z, ) =
x
(x z). (2.22)
The hopping rate in (2.18) has the form
c(x, y, ) = a(x y) exp
_
E
(y, )
_
, (2.23)
where a : R R
+
is such that a(x) = a(x) and
:=
_
R
d
a(x)dx < . (2.24)
The above model described in (2.18) (2.24) will be called the Kawasaki
system.
3 Microscopic dynamics
The direct construction of the non-equilibrium dynamics of states of innite
systems based on (2.19), (2.20), even for very simple models of this sort, is
usually unrealistic. In our case, we proceed as follows. Since the Kawasaki
dynamics is conservative, one can try to construct the evolution of states
of nite systems directly, which we do in Subsection 3.1 below. This allows
us to obtain the evolution of the projections (2.12)
t
, B
b
(R
d
),
as the evolution of probability measures on
0
. Note that
t
, t > 0, is no
more supported on
LG, k
t
= G, L
k
t
, (3.1)
k
t
[
t=0
= k
0
,
where
G, k =
_
0
G()k()(d), (3.2)
8
and, c.f. equations (4.7) and (4.8) in [8],
_
LG
_
() =
x
_
R
d
a(x y)e(
y
, ) (3.3)
e(t
y
, ) [G(( x) y) G()] dy,
and
_
L
k
_
() =
y
_
R
d
a(x y)e(
y
, y x) (3.4)
__
0
e(t
y
, )k( x y)(d)
_
dx
0
k( )
_
x
_
R
d
a(x y)e(
y
, )
e(t
y
, )dy
_
(d).
Here e is as in (2.7) and
t
x
(y) = e
(xy)
1,
x
(y) = t
x
(y) + 1. (3.5)
In order for the problem (3.1) to make sense we have to place it into an
appropriate Banach space setting. Here we have the following two possibil-
ities: (a) to obtain the evolution k
0
k
t
directly as the classical solution
of the corresponding Cauchy problem; (b) to study the evolution of quasi-
observables G
0
G
t
, and then to get the evolution k
0
k
t
in the weak
sense
G
t
, k
0
= G
0
, k
t
, (3.6)
see (3.2). In Subsection 3.2 and 3.3 below we realize both mentioned pos-
sibilities and obtain k
0
k
t
, t [0, T
), by means of Ovcyannikov-type
arguments. As in this setting we have no stochastic semigroups, the fact
that k
0
is the correlation function for
0
does not imply that the obtained
k
t
is a correlation function of any measure
t
/
1
(). This means that
the integrals (2.15) with
t
(d) = k
t
()(d) may not be positive. Then
we use the evolution
t
, obtained in Subsection 3.1, which yields the
evolution of the corresponding correlation functions k
0
k
t
, t R
+
, and
show that, for every t [0, T
), k
t
k
t
as R
d
. Here the convergence
holds in the sense that G, k
t
G, k
t
for all G B
bs
(
0
). Then we
apply Proposition 2.2 and obtain the evolution
0
t
, t [0, T
).
9
3.1 The evolution of a nite system
Here we assume that the initial state
0
in (2.19) is supported on some
,
B
b
(R
d
). We also assume that
0
is locally absolutely continuous with
respect to the Poisson measure, which together with the former assumption
imply that
0
is absolutely continuous with respect to the Lebesgue-Poisson
measure . For such , we set, c.f. (2.14),
R
() =
d
d
(),
0
. (3.7)
Obviously, R
be the adjoint
operator in the following sense
LF, =
_
0
F()(L
)()(d). (3.8)
By (2.17), we get
(L
)() := (A + B)R
() (3.9)
=
y
_
R
d
a(x y)e(
y
, y x)R
( y x)dx ()R
(),
that is, B is the multiplication operator by the function
() =
_
R
d
x
a(x y)e(
y
, )dy. (3.10)
Clearly, (AR
)() 0 if R
() 0, () 0 and
() [[, (3.11)
as e(
y
, ) 1. Moreover, by (2.17)
_
0
(AR
)()(d) =
_
0
(BR
)()(d). (3.12)
Set
T = R 1 : R 1, (3.13)
which is certainly dense in 1. Then (3.9) and (3.10) dene an operator
L
0
R()(d), (3.14)
has the property (R) = |R|
R
for any R 1
+
. Along with 1 we shall
use the space 1
1
= L
1
(
0
, b()d) with b() = [[ + 1. In this space, the
functional corresponding to (3.14) is
1
(R) =
_
0
R()([[ + 1)(d), (3.15)
and hence
1
(R) = |R|
R
1
for all R 1
+
1
. Clearly, 1
1
is continuously
embedded into 1 and 1
1
1
+
is dense in 1
+
1
. The main result of this
subsection is given by the following statements.
Theorem 3.1. The closure of the operator L
1
((A + B)R) C
1
(R) |BR|
R
. (3.16)
Then the closure of A+B is the generator of a stochastic C
0
-semigroup on
1, which leaves 1
1
invariant.
Proof of Theorem 3.1. Thus, we have to check that the conditions of the
Thieme-Voigt theorem are satised. The validity of (a), (b), and (c) is
immediate; (d) follows from (3.12). By (3.15) and (3.9), we have
1
((A + B)R) =
_
0
R()
x
_
R
d
a(x y) exp
_
E
(y, )
_
[b( x y) b()] (d) = 0,
since b() = [[ + 1, which reects the fact that the Kawasaki dynamics is
conservative. In view of the latter, the validity of (3.16) readily follows from
(3.11).
11
3.2 The evolution of correlation functions
We consider the problem
d
dt
k
t
= L
k
t
, k
t
[
t=0
= k
0
, (3.17)
in the scale of Banach spaces
/
:= k :
0
R : |k|
< , (3.18)
where
|k|
0
= + T, = 2exp(c
). (3.20)
Then the problem (3.17) with k
0
/
0
has a unique classical solution k
t
/
on [0, T).
According to the above theorem, given arbitrary T > 0 and , one can
pick the initial space such that the evolution k
0
k
t
lasts in /
until t < T.
On the other hand, if the initial space is given, the evolution is restricted in
time to the interval [0, T()) with
T() =
0
2
exp
_
c
_
. (3.21)
Clearly, T(
0
) = 0 and T() 0 as . Hence, there exists T
, which
depends on
0
, , and c
for all (,
0
]. Set
(t) = sup (,
0
] : t < T(). (3.22)
Then the alternative version of the above theorem can be formulated as
follows.
Theorem 3.4. For every
0
R, there exists T
= T
(
0
, , c
) such that
the problem (3.17) with k
0
/
0
has a unique classical solution k
t
/
(t)
for t [0, T
).
12
Proof of Theorem 3.3. We will seek the solution of (3.17) as the limit of the
sequence k
(n)
t
nN
0
/
, where k
(0)
t
= k
0
and
k
(n)
t
= k
0
+
_
t
0
L
k
(n1)
s
ds, n N. (3.23)
The latter can be iterated to yield
k
(n)
t
= k
0
+
n
m=1
1
m!
t
m
_
L
_
m
k
0
. (3.24)
Given k, let L
1
k and L
2
k denote the rst and the second summands in
(3.4), respectively. Then, for
<
and k /
, we have
[(L
1
k)()[e
||
y
_
R
d
dx a(x y)
_
0
(d)[k(y x )[ exp(
[ [)
exp(
[ [)e([t
y
[, )[e
||
y
_
R
d
dx a(x y)
_
0
(d)|k|
||
e([t
y
[, )[e
||(
)
= |k|
exp
_
e
_
[[e
||(
)
|k|
exp
_
e
_
1
e(
)
,
(3.25)
which holds for -almost all
0
. In the last line we have used (2.8) and
te
t
1/e, t 0, > 0.
The same estimate can be obtained also for L
2
k, which nally yields
|L
k|
2
e(
)
exp
_
c
_
|k|
>
.
Therefore, L
: /
<
, with norm
|L
2
e(
)
exp
_
c
_
. (3.26)
For a given m N and l = 0, . . . , m, set
l
= + (ml), = (
0
)/m.
Then by (3.26) and (3.24), for any k, n N, we get
|k
(n)
t
k
(n+k)
t
|
n+k
m=n+1
(m/e)
m
m!
_
t
_
m
, (3.27)
13
with as in (3.20). Thus, the sequence k
(n)
t
nN
converges in /
uniformly
on compact subsets of [0, T). Thereby, its limit is the classical solution of
the problem under consideration. The uniqueness can be obtained from the
fact that k
t
in (3.17) is identically zero if so is k
0
, as (3.17) is linear and
homogeneous.
Let now k
t
, as a function of
0
, be more regular than it is supposed in
(3.19). Namely, instead of (3.18) we consider
= k C(
0
R) : |k|
< , (3.28)
where this time
|k|
= sup[k()[ exp([[) :
0
. (3.29)
Corollary 3.5. Let , T, and
0
be as in Theorem 3.3. Suppose in addition
that the function is continuous. Then the problem (3.17) with k
0
/
0
has a unique classical solution k
t
/
on [0, T).
3.3 The evolution of quasi-observables
Now, we consider the problem
dG
t
dt
=
LG
t
, G
t
[
t=0
= G
0
, (3.30)
in the Banach space
(
= L
1
(
0
, e
||
d), R, (3.31)
that is, G (
if
|G|
def
=
_
0
exp([[) [G()[ (d) < . (3.32)
Theorem 3.6. For any
0
R and T > 0, the Cauchy problem (3.30)
with G
0
(
0
has a unique classical solution G
t
(
0
_
. (3.33)
Proof. As above, we obtain the solution of (3.30) as the limit of the sequence
G
(n)
t
nN
0
(
, where G
(0)
t
= G
0
and
G
(n)
t
= G
0
+
n
m=1
1
m!
t
m
L
m
G
0
. (3.34)
For the norm (3.32), from (3.3) similarly as above by (2.17) we get
|
LG|
2
e(
)
exp
_
c
_
|G|
. (3.35)
14
This means that
L can be dened as a bounded linear operator
L : (
with norm
|
L|
2
e(
)
exp
_
c
0
_
. (3.36)
The we apply the latter estimate in (3.34) and obtain for any k, n N
|G
(n)
t
G
(n+k)
t
|
n+k
m=n+1
(m/e)
m
m!
_
t
0
_
m
, (3.37)
The latter estimate yields the proof, as in the case of Theorem 3.3.
3.4 The evolution of states
Given R, let /
,
see (2.14) and (3.18). On the other hand, let /
+
0
G()k()(d) 0, (3.38)
which holds for every G B
bs
(
0
) such that KG 0. Then in view of
Proposition 2.2, the map /
/
+
is a bijection as such k
0
k
t
obtained by solving the problem (3.17).
Theorem 3.7. Let
0
R,
0
/
0
and k
0
be the corresponding cor-
relation function. There exist <
0
and T > 0 such that the evolution
k
0
k
t
, t [0, T) of k
0
(given by the solution of (3.30)) lies in /
+
, i.e.
there exists an evolution
/
0
0
t
/
, t [0, T)
of states of the Kawasaki system.
Proof. The proof is based on Theorems 3.3, 3.4, and 3.6, and on the fact
that the evolution described by the former theorem leaves /
+
invariant,
which we are going to prove by means of Theorem 3.1.
Given
0
, take any T < T
0
, let
0
be the projection of
0
onto
. Since
0
is in /
1
fm
(), its density (3.7) is in 1
1
and the corresponding correlation
functions satisfy
k
0
() = k
0
()e(I
, ) = k
0
()
x
I
(x),
0
. (3.39)
15
Here I
0
, see (3.7) of
0
is in 1
1
, we obtain the evolution
t
through the evolution of the
corresponding densities as described in Theorem 3.1. For every
t
, we have
k
t
, which solves the problem (3.17) with k
t
[
t=0
= k
0
and hence lies in /
+
0
has the
solution k
t
/
for the same t [0, T). Our aim is to show that this k
t
is
in fact in /
+
0
G()k
t
()(d)
_
0
G()k
t
()(d)
< , (3.40)
which holds for all suciently big . Since our G belongs to any (
0
, see
(3.31), in view of Theorem 3.6 we can estimate the left-hand side of (3.40)
by
(G) :=
_
0
[G
t
()[ (1 e(I
, )) k
0
()(d) (3.41)
=
n=1
1
n!
_
R
nd
[G
(n)
t
(x
1
, . . . , x
n
)[J
(x
1
, . . . , x
n
)
k
(n)
0
(x
1
, . . . , x
n
)dx
1
dx
n
,
where G
t
(
(x
1
, . . . , x
n
) = 1 I
(x
1
) I
(x
n
) (3.42)
= I
c(x
1
)I
(x
2
) I
(x
n
) +I
c (x
2
)I
(x
3
) I
(x
n
)
+ +I
c(x
n1
)I
(x
n
) +I
c (x
n
),
where
c
= R
d
. Now we take <
0
and x > 0. As G
t
is in (
, one
can pick n
N such that
n=n+1
e
n
n!
_
R
nd
[G
(n)
t
(x
1
, . . . , x
n
)[dx
1
dx
n
< e(
0
)/2. (3.43)
Now one applies (3.42) in (3.41), takes into account that k
0
/
0
, and
16
obtains
(G)
n=1
n
n!
e
n
0
_
c
dx
1
_
R
(n1)d
[G
(n)
t
(x
1
, . . . , x
n
)[dx
2
dx
n
(3.44)
1
e(
0
)
_
n
n=1
1
n!
e
n
_
c
dx
1
_
R
(n1)d
[G
(n)
t
(x
1
, . . . , x
n
)[dx
2
dx
n
+
n=n+1
1
n!
e
n
_
R
nd
[G
(n)
t
(x
1
, . . . , x
n
)[dx
1
dx
n
_
.
Since the rst sum in the latter two lines contains only a nite number of
summands, it can be made arbitrarily small by picking big enough . The
second sum can be estimated by (3.43), which nally yields (3.40). Thus,
for every t [0, T), the solution k
t
of (3.17) with k
t
[
t=0
= k
0
is in /
+
and
hence is the correlation function of a measure
t
/
.
4 Mesoscopic dynamics
In our setting, the description of the dynamics of the considered model on
the mesoscopic level is obtained by means of the Vlasov scaling, which was
rst introduced to describe mesoscopic properties of plasma. We refer to the
monograph [18] as to the source of general concepts in this eld, as well as
to the recent paper [4] where the peculiarities of the Vlasov scaling applied
to continuous particle systems are given together with the most updated
bibliography on this item.
4.1 The Vlasov hierarchy
The main idea of the Vlasov scaling is to make the particle system more and
more dense whereas the interaction (repulsion) respectively weaker. This
corresponds to the so called mean eld approximation widely employed in
theoretical physics. The object of these manipulations will be the problem
(3.17). The scaling parameter > 0 in the scaling limit will tend to zero.
The rst step is to assume that the initial state depends on in such a way
that the particle density diverges as 0. Let k
()
0
be the corresponding
correlation function. In order to compensate this divergence we pass to the
so called renormalized correlation function
k
()
0,ren
() =
||
k
()
0
, (4.1)
17
and assume that in the limit 0, we obtain k
()
0,ren
r
0
, where r
0
might
be a correlation function of a certain measure. Having this in mind, we
consider
d
dt
k
()
t
= L
k
()
t
, k
()
t
[
t=0
= k
()
0
, (4.2)
where L
, (R
k) () =
||
k(). (4.5)
By (3.4)
(L
,ren
k) () =
y
_
R
d
a(x y)e(
()
y
, y x) (4.6)
__
0
e(
1
t
()
y
, )k( x y)(d)
_
dx
0
k( )
_
x
_
R
d
a(x y)e(
()
y
, )
e(
1
t
()
y
, )dy
_
(d),
where, c.f. (3.5),
t
()
x
(y) = e
(xy)
1,
()
x
(y) = t
()
x
(y) + 1. (4.7)
As in (3.26), for any
R and
>
, we have
|L
,ren
|
2
e(
)
exp
_
c
()
_
, (4.8)
where, c.f. (2.21),
c
()
=
1
_
R
d
_
1 e
(x)
_
dx. (4.9)
18
Suppose now that is in L
1
(R
d
) and set
=
_
R
d
(x)dx. (4.10)
Recall that we still assume 0. Then
|L
,ren
|
sup
>0
RHS(4.8) =
2
e(
)
exp
_
e
_
. (4.11)
Let us now, informally, pass in (4.6) to the limit 0. Then we get the
following operator
(L
V
k) () =
y
_
R
d
a(x y)
_
0
e((y ), ) (4.12)
k( x y)(d)dx
0
k( )
x
_
R
d
a(x y)
e((y ), )dy(d).
It certainly obeys
|L
V
|
2
e(
)
exp
_
e
_
, (4.13)
and hence along with (4.2) we can consider the problem
d
dt
r
t
= L
V
r
t
, r
t
[
t=0
= r
0
, (4.14)
which can be called the Vlasov hierarchy for the Kawasaki system which
we consider. Repeating the arguments used in the proof of Theorem 3.3 we
obtain the following
Proposition 4.1. For every
0
R, there exists T
= T
(
0
, , ) such
that the problem (4.4) (resp. (4.13)) with any > 0 and k
()
0
/
0
(resp.
r
0
/
0
) has a unique classical solution k
()
t
/
(t)
(resp. r
t
/
(t)
) for
t [0, T
).
Suppose now that, for a xed > 0, k
()
0
is the correlation function for a
certain
()
0
/
0
. In view of Theorem 3.7 we then have that the solution
k
()
t
is also a correlation function. However, this could not be the case for
r
t
, even if r
0
= k
()
0
. The second observation concerning r
t
is that we still
do not know how close it is to k
()
t
, as the passage from L
,ren
to L
V
was
informal. In the remaining part of the article we give answers to both these
questions.
19
4.2 The Vlasov equation
Here we are going to show that the problem (4.13) has a very particular
solution, which gives sense to the whole construction. For the kernel a and
an appropriate g : R
d
R, we write
(a g)(x) =
_
R
d
a(x y)g(y)dy,
and similarly for g. Then let us consider in L
(R
d
) the following Cauchy
problem
d
dt
t
(x) = (a
t
) (x) exp [(
t
)(x)] (4.15)
t
(x) (a exp (
t
)) (x),
t
[
t=0
=
0
.
Given R, we denote
= L
(R
d
) : ||
L
(R
d
)
e
, (4.16)
: (x) 0 a.e.
Lemma 4.2. Suppose that, for some T > 0, the problem (4.15) with
0
t
(x). (4.17)
Proof. First of all we note that e(, ) /
if and only if
, see (3.19).
Now set r
t
= e(
t
, ) with
t
solving (4.15). This r
t
solves (4.14), which
can easily be checked by computing d/dt and employing (4.15). In view
of the uniqueness as in Proposition 4.1, we then have r
t
= r
t
on the time
interval where both solutions exist, from which it can be continued to the
one mentioned in Proposition 4.1.
Remark 4.3. As (4.17) is the correlation function for the Poisson measure
t
, see (2.5) and (2.6), the result of the above lemma can be called the chaos
preservation. Indeed, the most chaotic state of the system is the free state
described by a Poisson measure.
Let us show now that the problem (4.15) does have the solution we need.
In a standard way (4.15) can be transformed into the following integral
20
equation
t
(x) = F
_
(
s
)
st
_
:=
0
(x)e
t
(4.18)
+
_
t
0
exp ((t s)) (a
s
) (x) exp [(
s
)(x)] ds
+
_
t
0
exp ((t s))
s
(x) [a (1 exp (
s
))] (x)ds.
Now for
0
+
(0)
t
=
0
,
(n)
t
:= F
_
(
(n1)
)
st
_
, n N.
It can easily be checked that
(n)
t
+
, we have
1 exp
_
(
(n1)
s
(n2)
s
)
_
(4.19)
(
(n1)
s
(n2)
s
)
m=0
1
m!
1
m + 1
(
(n1)
s
(n2)
s
)
m
|
(n1)
s
(n2)
s
|
L
(R
d
)
exp
_
2e
_
.
By means of this estimate, we obtain from (4.18)
|
(n)
t
(n1)
t
|
L
(R
d
)
q(t) sup
s[0,t]
|
(n1)
s
(n2)
s
|
L
(R
d
)
,
q(t) := 2
_
1 + exp
_
+ 2e
__
(1 e
t
).
Then, for some T > 0, we have from the latter
sup
t[0,T]
|
(n)
t
(n1)
t
|
L
(R
d
)
q(T) sup
t[0,T]
|
(n1)
t
(n2)
t
|
L
(R
d
)
. (4.20)
Thus, the sequence
(n)
t
nN
0
converges to some
t
+
uniformly on
compact subsets of [0, T), for T such that q(T) < 1. Clearly, this
t
solves
(4.15). Since the latter remains in the same set as the initial
0
, the evolution
0
t
can be continued. Taking into account Lemma 4.2 we come to the
following conclusion.
Theorem 4.4. The unique classical solution of (4.14) with r
0
= e(
0
, ),
0
+
being the
solution of (4.15).
21
4.3 The scaling limit 0
Our nal task in this work is to show that the solution of (4.4) k
()
t
converges
in /
),
take such that T < T(), see (3.21). Assume also that L
1
(R
d
)
L
(R
d
) and consider the problems (4.4) and (4.14) with k
()
0,ren
= r
0
/
0
.
For their solutions k
()
t,ren
and r
t
, it follows that k
()
t,ren
r
t
in /
, as 0,
uniformly on [0, T].
Proof. For n N, let k
()
t,n
and r
t,n
be dened as in (3.24) with L
,ren
and
L
V
, respectively. As in the proof of Theorem 3.3, one can show that the
sequences of k
()
t,n
and r
t,n
converge in /
to k
()
t,ren
and r
t
, respectively, uni-
formly on [0, T]. Then, for > 0, one nds n N such that, for all t [0, T],
|k
()
t,n
k
()
t,ren
|
+|r
t,n
r
t
|
_
_
_
_
n
m=1
1
m!
t
m
_
L
m
,ren
L
m
V
_
r
0
_
_
_
_
+
2
(4.22)
|L
,ren
L
V
|
|r
0
|
0
T exp (Tb()) +
2
,
where, see (4.11) and (4.13),
b() :=
2
e(
0
)
exp
_
e
_
.
Here we used the following identity
L
m
,ren
L
m
V
= (L
,ren
L
V
) L
m1
,ren
+ L
V
(L
,ren
L
V
) L
m2
,ren
(4.23)
+ + L
m2
V
(L
,ren
L
V
) L
,ren
+ L
m1
V
(L
,ren
L
V
) .
Thus, we have to show that
|L
,ren
L
V
|
0, as 0, (4.24)
which will allow us to make the rst summand in the right-hand side of
(4.22) also smaller than /2 and thereby to complete the proof.
22
Subtracting (4.12) from (4.6) we get
(L
,ren
L
V
) k() =
y
_
R
d
_
0
a(x y)k( x y) (4.25)
Q
(y, y x, )(d)dx
x
_
R
d
_
0
a(x y)k( )
Q
(y, , )(d)dy
where
Q
(y, , ) := e(
()
y
, )e(
1
t
()
y
, ) e((y ), ) (4.26)
= e(
1
t
()
y
, ) e((y )
_
1 e(
()
y
, )
_
e(
1
t
()
y
, ).
For t > 0, the function e
t
1 + t takes positive values only; hence
(t) := (e
t
1 + t)/t
2
, t > 0,
is positive and bounded, say by C > 0. Then by means of the following
elementary analog of (4.23)
b
1
b
n
a
1
a
n
n
i=1
(b
i
a
i
)b
1
b
i1
b
i+1
b
n
, b
i
a
1
> 0,
we obtain
e(
1
t
()
y
, ) e((y ), )
z
[(y z)]
2
((y z))
u\z
(y u)
C
z
[(y z)]
2
e((y ), z),
and
_
1 e(
()
y
, )
_
e(
1
t
()
y
, )
z
(y z)e((y ), ).
Then from (4.25) for -almost all we have, see (3.19),
[(L
,ren
L
V
) k()[ |k|
0
_
C[[e
0
||
+ ()e
0
||
_
, (4.27)
23
with
C = 2C||
L
(R
d
)
e
0
and
() = 2exp
_
e
0
_
||
L
(R
d
)
[[([[ + 1).
Thus, we conclude that the expression in () in the right-hand side of (4.27)
is in /