This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
(fi-I)2) < (/3 _ 1)-2.1-2E(B(T A S2 A T) - B(T A S1 A T))2. Now if R1 <- R2, are both bounded stopping times, we have 2). The function that shows that this inequality is sharp is simple. Let fe(z) = p(z)l = ((1 + z)l(l - z))fi. Since P E H" for p e (0, 1), > < A-22o) (l K)2) C
E(B(R2) - B(R1))2 = E(B(R2)2 - B(R1)2) = E(R2 - R1), so the above 1)-2A-2 E((T A S2 A T) -(T A S1 A T)) < ( _ 1)-22-2(S2)2P(S1 < oo) 1)-262P(B* > A),
proving the first inequality. To prove the other inequality Let S1 = inf{t : (T A t)112 > .1}. Let S2 = inf{t : (T A t) 112 >
Let T = inf{t : IB(T A t)I > 6.1}.
Again, it is easy to check that P(T 1/2 > #A, B* < 62) < P(T A S2 A
T - T A S1 A T> $2)2 - 22)
<($2_1)-11-2E(TAS2A T-TAS1 A T), and using the stopping time result mentioned in the first part of the proof, it follows that the last expression above _ (/22 _ 1)-11-2E(B(T A S2 A T)2 - B(T A S1 A T)2)
<
($2
-
1)-11-2(S2)2P(S1 < oo)
_ ($2 _.1)-162P(T1n > 2), proving the second inequality.
Remark: The inequalities above are called "good 2" inequalities, although the reason for the name is obscured by our formulation (which is from Burkholder (1973)). The name "good .1" comes from the fact that early versions of this and similar inequalities (see Theorems 3.1 and 4.1 in Burkholder and Gundy (1970), or page 148 in Burkholder, Gundy, and Silverstein (1971)) were formulated as P(f > A) < C$,KP(g > A) for all A that satisfy P(g > A) < KP(g > $2), $, K > 1. The next result shows why we are interested in good A inequalities. First, we need a definition. A function cp is said to be moderately increasing if /P is a nondecreasing function with 9(0) = 0 and if there is a constant K such that
p(21)
(i) T(x)=x",0
MA
6
Hardy Spaces and Related Spaces of Martingales
Proof for (ii)
Since log+ xy S log' x + Iog+ y,
2x + 2x log+ 2x
x+xlog+x
<2+
2 log 2
1+log+x,
The bound now follows by considering two cases, x < 1 and x >_ 1. (2)
If qp is a moderately increasing function, then there are constants c, C e (0, 00) (that depend only on the growth rate K) such that cEgo(T'12) < Eq(B*) < CEgp(T112).
Remark: We will only use the result for 9(x) = xp, but it is nice to know that the only property of xp we need for the proof is that (p(22) < Kq(2) for all
2>0. Proof To prove the result, it suffices to show: (3)
If X, Y > 0 satisfy
P(X>22, Y
Etp(X) < CE9(Y). Proof It is enough to prove the result for bounded gyp, for if the result holds for cp A n for all n > 1, it also holds for gyp. T is the distribution function, a measure on [0, oo) that has
T(h) = foodtp(2) = J
1(h>A)d(p(2). 0
If Z is a nonnegative random variable, taking expectations and using Fubini's theorem gives E4p(Z) = E f
l(Z>A) dgp(A) =
JP(Z> A) d4 (2).
0
From our assumption it follows that
P(X > 22) = P(X > 22, Y:5 52) + P(Y > b2) < 62P(X > A) + P(Y > 62), or integrating dq(2), E4 (2-1X) =
f
P(2-1X < 2) dq (2)
0
< 62E9 (X) + Egp(b-1Y).
Pick 62K < 1 and then pick N > 0 so that 2' > b-1. From the growth condition and the monotonicity of gyp, it follows that
6A Equivalence of Ho too Subspace of .No
115
E9(6-'Y)!5 KNEcO(Y)
Combining this with the last inequality and using the growth condition gives E(p(X) < KEcp(2-1X) < K62Etp(X) + KN+1Eco(f
Solving for E.p(X) now gives KN+1
Ecp(X) <
1-
K62Ecp(Y),
proving (3) and hence (2).
Applying (2) to the case cp(x) = xP and recalling the results of Section 2.11, we get the following inequality that will be useful in studying the spaces Al P.
(4)
There are constants c, C E (0, oo) (that depend only on p) so that for all
0
cE<X)Pl2 < E(X*)P < CE<X>?l2.
As the reader might expect, the constants in (4) are not very good. Ifp = 2, then EX.,, = E<X>, so it follows from (1) of Section 6.2 that E<X%, = EXX < EIX* 12 < 4EXW = 4E<X),,,,,
but in the proof above, K = 4, so if we take S = 1/3 and N = 2, then
C=
KN+1
1 -K62
= 115.2.
Remark: There are other ways of proving (4) directly; see Getoor and Sharpe (1972) for an interesting proof using stochastic integration.
6.4 Equivalence of H" to a Subspace of V'
l
Let B, be a complex Brownian motion starting at 0 and let T = inf{t : I B,I = 1}. In this section, we will show that the mapping f - Ref(B), t < T, maps Ho = { f E HP : f (O) = 0} one-to-one into Al,! = {X: X is a local martingale on [0, T) and X,* = sup,,, I X, I E LP}, and that furthermore, the HP norm off is equivalent to the Al,! norm of its image, that is, if we let u = Ref, U, = u(B,), t < T, and U* = sup«TIUI, then: (1)
There are constants c, C E (0, oo) (that depend only on p) such that for all fe HoP,
cElU*IP
15(t
6
(2)
There is a constant Cc (0, oo) (that depends only on p) such that for all feHP,
Hardy Spaces and Related Spaces of Martingale@
dd(f) < EIF*IP < Cdd(f) Remark: It is curious that the best constant we can obtain from the proof given below is C = e (independent of p).
Proof If r <'l and T, = inf{t : IBI = r}, then IF(T,)I < F*, so we have I
ER I f(re`B) I
P dir(O) = EI F(T,) I P < E(F*)P.
Taking the supremum over r < 1 gives dd(f) < E(F*)P. To prove the other inequality takes some work. We start with the trivial case, p > 1. Since f is analytic in D and bounded on D(0, r) = {z : Izl < r}, it follows from results in Chapter 2 that f(B(t A T,)) is a complex martingale and, hence, that I f(B(t A r,))I is a submartingale. Noting that I f(B(-r,))I e LP, p > 1, and applying Doob's inequality, we get EIF*(T,)IP <(i-f7i) Ej
f(B(T,))IP
Letting r T 1 and using the monotone convergence theorem gives P
EIF*IP <- (i-:P::--,) dP(f)-
proving (1) in the case p > 1 with a constant slightly larger than the one advertised in the remark, since x dx log (x
1)s =
dx (x log x - x log (x - 1))
= log x - log(x - 1) - (x - 1)-1
y-1 - (x - 1)-1 dy < 0.
f,;x 1
To prove the result when 0 < p < 1, we will have to be more devious. First consider 1/2 < p < 1 and let us now suppose f(0) = 1. Since f(B,j is a time change of a complex Brownian motion starting at 1, P(f(B1) = 0 for some 0 < t < T) = 0, and we can define a pathwise square root GG by requiring G
to be continuous and to have Go = 1, and GG = F for all 0 <- t < T. As we mentioned in Section 5.3, (3)
G, I < T, is a local martingale
and furthermore (4)
If r < 1, G(t A T,) is a martingale. (See the remarks after the proofs of (3) and (5) in Section 5.3.) With (4) proved, the rest is easy. Since
6.4
157
Equlvilsoce of He to o Subcpoce of .+Y"
EIG(r,)I2p =
zn
f
lf(re`B)11dm(0) < dp(f)
0
and 2p > 1, it follows from Doob's inequality that 12p2p
1
)2"EIGI2P
Taking a supremum over r and applying the monotone convergence theorem gives
EI F*I P = EIG*(r)I2p <
12p
2p2p- 1
I
dp(f)
This proves the result when f(O) = 1. If f(O) # 0, applying the result above to
g(x) = f(x)/f(0) proves the inequality for f. To extend the result to f with f(0) = 0, consider g,,(x) = f(x) + c and let a -. 0. The argument above can be extended top > 1/n by taking nth roots, with the result that p
EIFF*Ip < np pT1dp(f) Letting n - oo, the last inequality gives El F* I p < edp(f ),
proving (2) with C = e. The result in (2) shows that the Hp norm of f and the .,#,! norm of f(B,), t < r, are equivalent. As we mentioned above, we want to go one step further and consider Hp as a space of real local martingales by using the mapping f - Re f(B,), t < T. Since every harmonic function u has a conjugate harmonic function u defined by the requirements that 4(0) = 0 and f = u + iu is analytic in D, the mapping is one-to-one on He = { fe Hp : f(0) = 0}. The next result shows that if we restrict our attention to this subspace, then the Hp norm off and the .A'' norms of Ref(B,), t < r, are equivalent (i.e., (1) holds). (5)
There is a constant C e (0, oo) (that depends only on p) such that for all f e Ho, EIU*Ip < EIF*Ip < CEIU*IP.
Proof Since l a l < (a2 + b2)1/2 for all a, b, we have I u (z) l < I f (z) I for all z, proving the inequality on the left. To prove the other inequality, we observe that if we let U = u(B,), t < r, then it follows from results in Sections 2.11 and 6.4 that E(U*)p < CEpl2 pl2 < CE(U*)p (here, as before and ever shall be, the value of C is unimportant and will change
1 ui
6
Hardy Spaces and Related Spaces of Martingales
from line to line). It is trivial that E(F*)P 5 2P(E(U*)P + E(U*)P).
Combining this with the other three estimates proves (5).
Given the results above and in Chapter 4, it is now easy to prove the "maximal function characterization of Hr" due to Burkholder, Gundy, and Silverstein (1971). Let S,,(0) be the convex hull of the disk {lzl < a} and the point e`° and let (Nau)(0) = sup{lu(z)I : zeS,,(0)} be the nontangential maximal function. A simple generalization of the argument given at the end of Section 4.5 shows that
SSJ
Po (Osup, u(B.) > .11 < Cl {O: Nau(0) > All,
where C depends only on a, and integrating gives zn
Eo(UU*)P < C
l NQul P(0) d7r(0) 0
(a result that holds for any measurable u). To prove the other inequality, we use (2) from Section 4.3 (which generalizes easily from H to D). This result implies that there is an E > 0 such that if z e S8(0), then
Po(B,, 0 < t < r, makes a loop around z) > E, so it follows from the maximum principle that Pa(U* > Nau(0)/2) >_ E,
and hence that E0(U*)P > E f lNaull(0)dn(0). Combining this with the other inequality and (1) above gives the maximal function characterization of HP cdd(f) <- fo z l NaulP(0)dn(0) < Cdd(f)
6.5 Boundary Limits and Representation of Functions in H" Since HP c N, it follows from (2) in Section 5.3 that (1)
If fe HP, then the nontangential limit off exists at a.e. point of 8D.
In this section, we will investigate the relationship between f (defined in D) and its nontangential limit (defined on 8D), which we will also denote by f.
6.5
159
Boundary Limits and Representation of Function. la HP
There are two reasons why we want to do this: (a) The mean convergence of H" functions to their boundary values (3) and the consequent Poisson integral representation (5) are simple consequences of the equivalence established in Section 6.4, and (b) for developments below, it is nice to know that we can consider a function f e H" as a function in LP(8D). Our first topic in this section is LP convergence to boundary values. As
usual, we start with the probabilistic result and then deduce its analytical counterpart. (2)
Let f c- HP and let F = f(B), t < T. If T. is any sequence of times TT, then as n -- oo, f(BL) a.s. and in LP. Proof The a.s. convergence is a consequence of (2) in Section 5.2. (2) of Section
6.4 shows that F* E LP. Since IF(T) - f(Bz) I < (2FT*)P and F(T) -f(B) a.s., the LP convergence follows from the dominated convergence theorem. (3)
Iffe HP, then as rT 1, I
I .f (re `B) - .f (e `e) I P do (0)
0.
Proof It suffices to show that the result holds for any sequence r T 1. If we let T. = inf {t: I B, I > and apply (2), it follows that -f(B) in LP, or, BT), if we let u denote the distribution of
1-f(y)IPdvn(x,y)- 0. This conclusion is similar to the one desired, but it is different enough to make it painful to obtain one from the other. In the face of this hard difficulty, we will take a soft solution. We recall the following result from real analysis: (4)
If X E LP and X. --* X a.e., then X,, -+ X in LP if and only if EI
P -- EI XI P.
We leave the proof as an exercise for the reader (see Chung (1974), page 97), and then we are done, because
F(T) -f(B.)
in
LP
implies J J
implies
f
I.f(rne's) - f(eie)I Pdxt(0)
0.
The last result is valid for p > 0. When p > 1, we can use the LP convergence to express f in terms of its boundary values.
1M)
6
(5)
Let k9(z) be the probability density (w.r.t. n) of exiting D at e`9 starting from z.
Hardy Spacer and Related Spaces of Martingales
IffeHP f(z) =
p > 1, then d7r(0).
Proof From (2) of Section 6.4, it follows that EIF,*IP < oc, and since p > 1, F, t < t, is uniformly integrable. If v is a stopping time, the optional stopping theorem implies that .f(Ba) = E(.f(BJ13o),
and it follows from the strong Markov property that E(f(BT)1 3o) = Jko(B0)f(eio) dn(0).
The last two results imply that the equality in (5) holds for a.e. z e D. The left-hand side, f(z), is clearly a continuous function of z. In Section 3.3, we showed that the right-hand side is harmonic in D, and hence continuous, so the equality holds for all z e D.
The equality in (5) does not hold when p < 1. The half-plane mapping p(z) = (1 + z)/(1 - z) has boundary limit Example 1
p(e`B) = i sin 0/(1 - cos 0),
so there are two problems :
(i) Rep (z) > 0 in D, but Jko(z)Rep(eio)dir(O) = 0
(ii) Isin 01/(1 - cos 0) - 2/101 as 0 - 0, so Jke(z)IImP(eio)Idir(O) = oo.
The resolution of the first problem is obvious. Rep = ko, so Rep (z) = Jko(z)d50(O).
where So is a point mass at 0. This example suggests that we might generalize
the representation in (5) to allow measures on 8D that are not absolutely continuous w.r.t. it. The next result shows that this generalization does not enlarge by very much the class of functions that can be represented. (6)
The following three classes of functions are the same :
(i) the set of u that can be written as
6.5
Boundary LImlts and Representation of Function In H'
161
U(Z) = fko(z)d!L(o),
where p is a signed measure with finite variation (ii) the set of u that can be written as a difference of two positive harmonic
functions (iii) h' = the set of harmonic functions u with sup flu(reio)IdO < oo. r<1
Proof (i) (ii) (iii) is trivial. Since the proof of (iii) (i) is very similar to the proofs given in Sections 3.3 and 3.5, it is left as an exercise for the reader. Remark: For developments in Section 6.8, it is useful to know that (6) implies that any ueh1 can be written as u1 - u2, where u1, u2 > 0 and 1lull1 = llu1 11 + 1
ll u2ll 1. To prove this, we observe that if u = Jko(z)dP(O). then llull 1 = the variation p = sup,, µ(A) - µ(A`).
The last result completes our consideration of boundary limits of functions in HP. Since we will deal with p >- 1 for most of the rest of this chapter, the important results to remember are (1) and (5). They show that a function feHP, p > 0 has a nontangential limit at a.e. point of 8D and that if p > 1, the values off in D can be recovered from the boundary limits, so we can think off in HP as being a function in LP(8D, it) (and we will do this when we prove the duality theorem). A similar viewpoint is possible for local martingales Xc- ,`f?, p >_ 1. Since this will simplify things below, we will take a few minutes now and spell out the details. X,* e LP, so standard arguments imply that if we let
_
X,
t
t} X, lim
t
IT
then Y is a martingale, Ye #P (the space defined in Section 6.2), and Y can be reconstructed from its limiting value by Y, = E(Y.l JFt).
The last representation is the probabilistic analogue of the Poisson integral representation. When X, = f(B,), t < r, and feHP, p > 1, the relationship is closer than an analogy, since results above imply that Y, = f(BT) (the righthand side being the nontangential limit off evaluated at BT).
Notes: Result (3) about the mean convergence of f(re`B) to f(e`B) was first proved by F. Riesz (1923) (see, for example, Duren (1970), pages 20-22). The key to Riesz's proof was the following factorization theorem :
162
(7)
6
Hardy Specs and Related Specs of Mertlnoalse
Every function f in H° can be written asf(z) = b(z)g(z), where Ib(z)I < 1 and g e H" is a function that does not vanish in D. Once (7) was established, (1) followed from known results. The function b has boundary limits, since it is bounded, and since g is never 0, we can pick n > 1/p and consider g'1" to reduce the result to the easy case where p > 1. The reader should note that taking nth roots to reduce to the trivial case p > 1 was also the key to the proof of (3) in Section 6.2, but in that proof, we
used the fact that Brownian motion did not hit zero to construct a pathwise nth root, so we did not have to factor out the zeros.
6.6 Martingale Transforms Martingale transforms are a natural generalization of the following: Example 1 Let f = u + iv be an analytic function with f(0) = 0, and let B, be a complex Brownian motion starting at 0. Ito's formula implies that u(B,) = f Vu(BS) dB. 0
v(B,) = JVv(Bs).dBs, 0
and the Cauchy-Riemann equations say that Vv =
(_0 0)Vu,
so if we let
H,=Vu(B,) A= (-0
11 0
'
then we can write
u(B) =
JJJ.dB , 0
v(B) = JAI-I.dB3. 0
The last equation obviously makes sense if B is a d-dimensional Brownian motion, H is a locally bounded (R'-valued) predictable process, and A is any d x d matrix. To define the transform of a general local martingale X in this setting, we now recall that since we have assumed that our filtration is generated by a Brownian motion, it follows from results in Section 2.14 that
Xt=Xo+ f 0
Mmrtingde TnMformw
6.6
163
We can therefore define the transform of X by A as
(A*X)t= (whenever this makes sense, e.g., if H is locally bounded). In this section, we will study properties of martingale transforms as mappings between the V' spaces. The results we prove here are analogues of classical results about conjugate functions that we will prove by probabilistic methods in Section 6.7. The first and most basic result is: (1)
If p > 0, X -. A * X is a bounded linear transformation from #P to M". Proof If Xt = 0
then
(A*X)t= f 0
so
IAH s12ds fo'
< C J, I HHIZ ds 0
= C<X>t, where
C= sup{IAYI2:IyI = 1}, so the desired conclusion follows from the equivalence of norms demonstrated in Section 6.3. When p > 1, the norms on . #P and it" are equivalent, so we have : (2)
If p > 1, X A * X is a bounded linear transformation from IC" to IC". The next example shows that this is false when p = 1. Example 2
Let Br be a two-dimensional Brownian motion starting at 0, let
i=inf{t:B' = -1}, and let Xt=BTnL= If we let A = (1
lot
.dBs.
\0 0 I
(Or, if you want, \l
0
then
I I 1
164
6
Hardy Spacer and Related Spacer of Martlnpal"
dB., (A*Xj-JO^T
(, ). 1
Now X, = B;A T > -1 and it is trivial that if a >- -1, l a l < 2 + a, so
EIX,I <2+EX,=2 and Xe.(1. On the other hand, it follows from results in Section 1.9 that (A * X). = B, has a Cauchy distribution
P((A*X) X)= x1
1
n1+x2'
°°
so E(A * X)W = oo, and Fatou's lemma implies that lim inf E(A * X )t+ > oo. t- 00
In the last example,
IIA*XII,r =supEIA *X1, = oo, I
but it doesn't miss by much
2 fo dx2,.,ny-1
I >y)=n
1
as y -- oo. The next result, first proved by Burkholder (1966), shows that this is the worst possible behavior for XE.%r1. The statement and proof given below are from Burkholder (1979a). (3)
If
Proof Doob's inequality implies that AP(X* > A) < supEJX,l = IIXII,, f
so it suffices to estimate the probability of {Y* > A, X* < Al. To do this, we
observe that by stopping at T = inf {t: <X>, > n}, we can suppose that E<X>0 < cc, that is, Xe.#2. Let i = inf {t :1X1 > Al. It is trivial that if we let Y,* = sup fl l Y 1 : s :!g t}, then
AP(Y* > A, X* < A) < ,1P(Y* > A).
Applying Doob's inequality to the submartingale Y' T(Ye 1f2, since
22P((Y*)2 > A2) < EY, . Now X, Ye.,&2, so
EY2=E
6.6
MYrtlnade'rromformn
165
X
Y
Figure 6.1
To finish up, we observe that IX,1 < 2 and IX,I is uniformly integrable, so
EX, <2EIXzl Combining the inequalities above shows that AZP(Y* > A, X* < 2) < AIIXILI
and proves the desired result. A simple example shows that 2 is the best possible constant in (3). Example 3 Let B, be a one-dimensional Brownian motion, and make the following definitions (for a picture, see Figure 6.1):
T,=inf{t:IB,I=l} Tz =inf{t> T, :IB,-B(Ti)I = l}
T3=inf{t>TZ:B,=0 orIB,-B(T2)I=2}
B(T1)=for-1 B(T2) = 2, 0, or - 2 B(T3) = 4, 0, or -4
166
6
Hardy Spac.u and Related Spaces of Martingales
W (s, w)
O(+', (0)
1
1
1
-1
1
1
0
0
S
r
X, =
cps dB,
Y=
0
Os dB.,. 0
Since (p2
we have <X> _
X
B 1,2,4 1,2,0 1,0,2
1,0,-2
1,2,4 1,2,0 1,0,0 1,0,0
Y 1,0,2
1,0, -2 1,2,2 1,2,2
Y* 2 2 2 2
with a similar table for a = - 1. From the last computation it follows that supElX,l = El XXl = 1 t
and
P(Y*>2)=1, so forA=2, 2P(Y* > A) = 2supEpXc1,
showing that (3) is sharp.
(1), (2), and (3) are the main results on martingale transforms, but, of course, it is also possible to consider how X -p A * X behaves on other spaces. We will mention only three results and leave the proofs as exercises. Exercise I If Xe.,#°° = the bounded martingales, then (A * X) may be unbounded. In Chapter 7, we will see that it does not miss by much. (A * X) C- M_#6 and, furthermore, X-+ (A * X) is a bounded map from M.,#0 to M.,#0. Exercise 2 If X e 21 = the uniformly integrable martingales, then (A * X)
need not be in A-'. (Hint: Recall our discussion of A' log A'.) Exercise 3
If X e X log .7f', then (A * X) e .,lf 1. Is (A * X) e .*-log . ''?
6.7 Janson's Characterization of Jj 1 Having seen an example of an X e .K 1 and a matrix A such that A * X 0 .JY 1, it is natural (if somewhat precocious) to ask which X e AA" have A * X e A 1
6.7
167
Jumon'. Chnncterizetlon of .N'
for all matrices A. If we let J1 denote this collection, then (1) in Scclion 6.6 implies that J1 - .,#' and, as you might guess from the title of this rcclion, J 1 = .111 In fact, more is true : There is a finite set of matrices A 1 , ... , A. such that if A, * X E .7Y 1 for i = 1,
..., m, then X E .,6f 1 (and hence A
To discover which sets of matrices have this property, we start by making the trivial observation that A...... A. cannot have a common eigenvector in Rd, for if we have A;y = ) y for i = 1, ... , m, then we can let r = inf {t: y B, = -1 } and X = y B, A . X is Example 2 of Section 6.6, so X E .tY 1 - _#', but
fori=1, ...,m, (A;*X),=
eAL
0
Janson's (1977) theorem says that this trivial necessary condition is sufficient. (1)
Let A,, ... , Am be matrices that do not have a common eigenvector in Rd. Let A° be the identity matrix. If the transforms A; * X, i = 0, ... , m, are all in
*-', then XE.,#1.
The key to the proof is Janson's generalization of the subharmonicity lemma of Chao and Taibleson (1973), which is in turn a generalization of ideas of
Stein and Weiss (1971), who attribute the idea to Calderon.... Using the notation in (1), we can state this result as: (2)
There is a p0 < 1 (that depends only on the matrices A1, ... , Am) such that if F = (1 + "_0 (X02)"2, then Ff is a local submartingale for all p > p0. Once we prove (2), (1) follows immediately. To see this, observe that if we can pick p < 1 so that G, = FP is a local submartingale, then E(Gt 1P) = E RI +
(Xi) 2
1/2
< E 1 + : IXt ]
(since the L2 norm of (1,X°, ... , Xm)ERm+2 is less than its L1 norm). It follows from our assumption that sup, EG, "P < co, and, since 1/p > 1, it follows from Doob's inequality that
oo > E(sup G,)'IP = E(sup F) > E(sup IXI ), so X E .4f 1. If we keep track of the constants, we get
E(sup I X I) < E(sup G,)' '
<
- (1/Ifl- 1
sup EG, /P ,
<-(1 -p) 1(1 + E
IIAj*XII,).
i=o
To get rid of the 1 on the right-hand side and replace p by po, we apply the
168
6
Hardy Spaces and Related Spaces of Martingales
last result to X/e, multiply both sides of the inequality by e, and let a - 0, p -po to get E(supjXI) :!5; (1 -Po)-1 Y
(3)
IjAj*XILr.
j=o
t
Proof of (2) We start by observing that the result is trivial for p = 2 (F = ) and forp > 2 (since a convex function of a local submartingale 1 + o (Xi)2m is a local submartingale), so we assume p < 2. Let g(x) = (1 + 1x12)2. A little differentiation gives Dig= P(l + Ix12)cp-2'22x; 2
DO = 2.p 2 2(1 +
1x12)cp-a'24xtxj
i:Aj
D«g = .P 2 2(1 + 1 x12)cv-a'24x? + 2(1 +I x12)(p-2'22. 2 Applying Ito's formula, we conclude that
FP-FOP =
f tpXsFs-ZdXs i=o ,Jo
+1
2 i=o ;=o
22 f tPP-
1)4XsXgFs
a
d<X`,X')s
0
+ i JPFr2d<xi>. 1
m
2 i=o
o
The first term on the right-hand side is a local martingale, so to prove the result we need to show that we can pick p < 1 so that the second term plus the third term is 0. If X= f Hsd Bs, then
<X= JAHJ2ds o
and
<X`, X'>' = J(AiJ1AJ1)ds. o
To complete our proof, we need to show: (4)
22 - 1) Yi; 4xtx;(At4P, A;(P) + (1 + 1x12) > 1Aj4,12 > 0 1
(P
for all x e R" 1 and cp e Rd. To do this, we observe that if B,; is the angle between xjA;cp and x;A;cp, then Y(x;A;cp,x;A;(p) _ Y1x;Aicp1lx;A;cpl cosBtj <-Y(IxjAj(p I)2 <1x12YIA1w12.
6.7
169
JanMon's Characterization of.#'
Looking at the first inequality above, we see that there is equality Oiily if ©;j = 0 for all i, j and I x,l = cl A;'pl for all i. Now if x, 9 # 0, it follows from the last equality that Ixol : 0, and since Aocp = cp, the first equality in the last sentence implies that cp is an eigenvector of all the A;, contradicting our assumption, so we must have Y_x.x,(A;'p, Aj'p)
< IXIZ
Ai9IZ
for all nonzero x c Rm 1 and rp e Rd. The value of the left-hand side is not changed by multiplying x or 'p by a positive constant, and it is continuous on the compact set {(x,'p)ERm+1+d: Ixl = 1, Icpl = 1}, so the supremum of the expression over K is a number S < 1. Hence the expression in (4) is > (5)
(1+Ixl')YIAi'I2-2(2-1)4a(IXIzYIAiTl2). When p = 1, the coefficient of the second term is a < 1, so we can pick po < I such that (5) > 0 for all p > po, and this completes the proof.
Readers familiar with Janson's (1977) proof (which is for d-adic martingales) should notice that the outline is the same, but two details are different: (a) Ito's formula replaces the computation Janson does for "small Remark:
jumps" (our jumps have size zero), and then, since we do not have a small/large dichotomy, we need only his first compactness argument. (b) The restriction on the matrices sounds the same, but it is different. In Janson's theorem, the matrices do not have a common eigenvector in Ro = {X: Y; x. = 0}. O) has no eigenvector in R2, it follows from Janson's theorem
Since I 0
I
that we have : (6)
If d = 2 and X and its conjugate martingale k are in . ' 1, then X E If d = 3, then any matrix A has a real eigenvalue and, hence, also an eigenvector
in R" (take the real or imaginary part), so it takes at least two matrices to characterize 1. We leave it to the reader to discover what happens if we take 0
1
0
A, _ (-1
0
0 AZ =
0
0
0
0 0
-1
0
1
0
0
0 0.
If you are very clever, you will discover Riesz transforms. If you get stuck, you can find the connection spelled out in Gundy and Varopoulos (1979).
171)
6
Hardy Space. and Related Spaces of Martingales
6.8 Inequalities for Conjugate Harmonic Functions With each harmonic function u, there is associated a unique conjugate harmonic function it, which has (a) u(0) = 0 and (b) u + iu is analytic in D. In this section,
we will investigate conjugation as an operation on hP, the set of harmonic functions u in D with dp(u) = sup f
<
.
Let Ilullp = (dp(u))"P. If p > 1, this equation defines a norm on hP. Our first result, due to M. Riesz (1927), shows that if p > 1, u -+ u is a bounded linear map from hP to hP. (1)
If p > 1, then there is a constant C (that depends only on p) such that Ilullp < CIIuIIP.
Proof Let U = u(B,), t < T, and let U = u(B,), t < T. If llullP = 1, then Doob's inequality implies that E(U*) < (p/(p - 1))P, and it follows from results in Section 6.4 that Ilullp < El
U*IP < KEI U*IP,
so (1) holds with C = K11P(pl(p - 1)). To be fair, we should observe that (1) is easy to prove analytically-there is a simple argument using Green's theorem that is due to P. Stein (1933) and that gives a much better value for Cp, namely,
Cp=2(Pl(P- 1))lh' 1
2 < p < oo.
Since this proof has some interesting probabilistic aspects, we present it here. If the theorem is true for some 1 < p < oo, then it is also true for the conjugate index q = p/(p - 1) with C. = Cp (exercise for the reader: See Zygmund
(1959), page 255, for the answer), so it suffices to prove the result when 1 < p < 2. In view of the decomposition of functions in hl given in Section 6.5, we can also assume that u(z) > 0 in D. To prove the result, we compute 82
_
OZ7
1
u P(z) W
Pu
= az. (
(Z) azi
=P(P- 1)uP z(Z)(az/z+pup-1(z)8z? Summing and noticing that Au = 0, we get
(a) AuP(z) = p(p -
1)u"-z(z)IVu(z)I2.
Similarly, if we let v = u, then
6.8
Inequalities for Conjugate Harmonic Functions
171
a2 1 flP = a2 u2 + v2)p/2
04
Oz?
_
i
(p22 (u+ v2)(P-z)/z (2u Z + 2llZi
_ .p
2 2. (u2 + v2)(p-4)/2I 2u -Z + 2v
+ P (U2 + vz)(P-z)/z 2 2
(u az,)
z
+ 2u
Z
azZ + 2 az;
(av)z zJ
z \\
+ 2v
Zl. aZ; JJ
Summing and using the relationships Au = 0, Av = 0, Vu Vv = 0, and lVul = I Vv 1, we get
(b) Al./ I P =p(p - 2)(u2 +
v2)(P-4)/z(u2JVul2 + v210u12)
+ p(u2 + v2)(p-2)/2(lVu 12 + 0 + 1Vu12 + 0) =P2 (U 2 + v2)(p-2)/21ou12.
Since p - 2 < 0, it follows from (a) and (b) that we have flp < p
(c) Al
p IAlulp.
This is the key inequality for the proof. From here, completing the proof is easy, and how you do it is a matter of background. A probabilist would reason as follows: Ito's formula says that if h is C2
in D, then fort < r=inf{t:B,0D}, h (B,) - h (Bo) =
JAh(Bs).dBs+iJVh(Bo)ds 0
(here we have written B, as a real two-dimensional Brownian motion). The first term on the right is a martingale for t < r, (since
Eoh(B,) = h(O) + 2E
Ah(Bs)ds. 0
Letting h = up, and then h = If lp, and using (c), gives fo2n f2x
p
I
I
I
o
since 1u(0)l = l f(0)1.
An analyst would use the divergence theorem 0zx
a
JP_(reb0)rdo = f
Acp(z)dA(z),
J IzI
where A' denotes Lebesgue measure(.' This implies that znIf(re`B)lpdO
ar
J
p p -
1
ar J 0
172
6
Hardy Spicea and Related Spaces of Martingales
ivp(Bt)
Figure 6.2
so integrating from 0 to r and recalling that v(0) = 0, we have a second proof of the inequality
J:(re1I0< pp1
f lu(re`Pdo. 0
Since Riesz's theorem is an old and important one, there are many different proofs. Calderon (1950c) has given another proof that you can find in Zygmund (1959), pages 253-255. Pichorides (1972) has given a refinement of Calderon's
proof and has found the best possible constant: CP = tan(n/2p) if 1
f# E H° for p e (0, 1/#). Since p maps D one-to-one onto {z: Re z > 0} = {re'B : r > 0, 0 < n/2}, f,, maps D one-to-one onto the cone IF,, = {re`O : r > 0,
0 < fln/2}. From the last observation (and Levy's theorem), it follows that j,,(Bt), t < 7, is a time change of a Brownian motion C, that starts at 1 and runs until it leaves F''. Drawing a picture (see Figure 6.2) reveals that if up _ Re f,, and vp = Im f,, , then
limIvP(B) I = tanfl imlu,,(BJ)I. tT=
If 1
Itan7E l
IlupiLP,
6.8
173
Inequalities for Conjugate Harmonic Functions
so the optimal constant CP z tan(n/2p) for all 1 < p < oo. Repeating the argument above for ip(z)' shows that CP > cot(ir/2p) for all 1 < p < oU, so Pichorides's constants are the best possible. As the constants in the last remark might suggest, Riesz's theorem is false for p = 1. We have seen the counterexample many times: the half-plane map p(z) = (1 + z)/(1 - z). By computations in Section 6.1, u(z) = Re p(z) Chl, but u(z) = Imp(z) is not, since
n({9:Iu(e'B)I > A}) - 2/n2 as A -+ oc.
The next result, due to Kolmogorov (1925), shows that (up to a constant multiple) this is the worst behavior we can have for ueh1. (2)
There is a constant C such that if ueh1, then n({e: lu(e`a)I >_ 2}) < Ca.-11IuII1.
Remark: In the jargon, this is called a weak type (1, 1) inequality. We will give Davis's (1974) proof, because it has the advantage of identifying the best
constant C = 1.347... . Proof Let ZZ = Xt + iY be a complex Brownian motion, and let a = inf{t : I Y I = 11. Since t - I X, I is a submartingale and the stopping time a depends
only upon the Y component, it is easy to see that if x and - 1 < y < 1 are real numbers, (i) EoIXaI >EIYIXal (ii) Es+i,IXal > EirI X1I.
The next step is to show :
(iii) Let x be a real number and fi a stopping time for Z. Then EXIX API > EOIX.IPX(, ? a).
Proof By (ii) and the triangle inequality, EOIXXI < E.IXal < EXIX..pl + EXI Xa - X.A$I.
By the strong Markov property, Exl X8 -
Xa
-
and we have, using (i),
a> (the centering makes it look like starting at 0, but I Y,,, until a). Combining the results above, we have EOIXQI <ExIXZAPI +EoIX2IPP(«> fi),
proving (iii).
> 0, so there is less time
174
6
Hardy Spaces and Related Spaces of Martlnaalee
We are now ready to prove Kolmogorov's inequality. Let f = u + iu. By Levy's theorem, if we let a(t) = f O I f'(B5)IZ ds fort < T, then Z,(,) = f(B,), t < T,
defines a Brownian motion run for an amount of time y = Q(T). If we write Z, = X, + iY and let T, = inf{t : IB,I > r}, then IX",(tr)I = iu(BtAT,)I is a bounded submartingale, so EI X.Aa(t,)I <_ EI XC(tr)I = EIU(Bt,)I
Ilulll.
As r T 1, T, T T and Q(T,) T Q(T) = y, so using Fatou's lemma gives
(iv) EIXanvl < IIulIi.
We have finally assembled all the ingredients to complete the proof: n({O: Iu(e`a)I > 1}) = P(I YYI >- 1) P(YY 1) = P(a < Y),
so it follows from (iii) and (iv) that the above <- (EopX.l)-'EolX2Arl
< (EofXal)-'Ilulll. Substituting u/), for u, we have n({e: lu(e`B)I z A)):5
(EoPXaI)-'llulil/2.
It is clear from the argument above that the inequality is sharp. If we let g(z) _ (2/7r) log p(z), then g maps D one-to-one onto the strip {z : -1 < Im z < 11, so
1 =n({O:1u(eie)I > 1})=P(a<-y) = (EojXal)-'EoiXal = (EOIXaI)-'llulll.
To compute the constant, observe that by (4) in Section 5.1, the probability density of X, is ex'/2/(I + exn), so
_
zi
(-
8
n=0 °°
z
n=0
000
(-1)n(2n +
1)-2
If you recognize that nz/8 = En '=O (2n + 1)-2, then you can write the constant as (1-3-z+5-z-7-z+...)/(1+3-z+5-z+7-z+...).
Although the inequalities (i)-(iv) are important, the two main ideas in the proof of (2) are the observation that : (a) If we time change f(B), t < T, to obtain a Brownian motion Z, = X, + iY, t < y, then
6.8
175
Inequrlltlai for Conjugate H.rmonlc Functions
n({H: u(e")I >_ 1}) = P(I YYI >_ 1) 5 P(Y* > 1),
and (b) forueh',P(Y*>_ 1)/Ilulllis largest when y=a=inf{t:IY,I= I;. With this philosophy as a guide, the reader should have no problem proving +i onesided version of Kolmogorov's inequality. Exercise l
If u c h' and u > 0, then
({O: u(e`") > }) < 2IIu111
7r(l
+y2),
JA
and this constant is the best possible.
Hint: The function that shows that this inequality is sharp is
f(z) = it + (1 -
z)'
i+
which maps D one-to-one onto {x + iy : x > O, y < 2} and has f(0) = 1. In this case, the reflection principle shows that
n({O:u(e`")>2})=2 f Z
dy + y2). n(1
Applying (2) to u(rz) shows that if 1lull1 = 1, then 7C({O :
I u(re")I > A}) < CA-',
soifp<1 2n 0
u(re`")IPdn(O)= f"Op
< [P2P1dA+
>.l})dA
Jp1 C` d= 1
P,
and we have proved another inequality due to Kolmogorov: (3)
If u e h1 and p < 1, there is a constant C (that depends only on p) such that dd(u) < CIIull f.
The argument above proves (3), but since it is not very interesting and does not give a very good value of the constant, we will give two more proofs of (3). The first is a purely probabilistic one, and because of this, it gives a
crude value for the constant. The second is an analytic translation of the probabilistic argument and gives the best constant for positive u. Proof 2 Again without loss of generality, we can suppose that u > 0 in D and IIuhl1 = 1. In this case, u(0) = 1 and u(0) = 0, so (u(B,), u(B,)), t < 'r, is a time change of a two-dimensional Brownian motion starting from (1,0) and running for an amount of time y. Since u >- 0, y must be smaller than 71, the time it takes a Brownian motion starting at 1 to hit 0, and it follows that
176
n
1lardy Spacra and Related Spacca of M.rtlnialra
dp(u) < /;(U*)p < CE 200< -CETv1Z.
In Chapter 1, we found that the probability density of T1 is (tit) - 3/2 t- 3/2 e- 1/2t ,
l
so ifp < 1, ETf2 =
(2n)-3/2
f aD
t(p- 3)/2 e - 1/21 dt.
0
To evaluate the integral, let u = 1/2t to obtain (2ir)-3/22(1-p)12
r u-(1+p)l2e-"du J0
and observe that the value of the integral is I'((1 - p)/2) if p < 1. The reader should observe that if u(x) = Re p(x), then y = T1. This suggests that for nonnegative functions Ilullp/Ilullp should be largest for the Poisson mapping. The proof above cannot be used to prove this fact, since we have used the clumsy estimates dp(u) < EI U*Ip < CEc/2. This inaccuracy can be avoided if we abandon the correspondence and translate the proof into analytical terms. Proof 3 The idea for this proof is due to Littlewood (1926). Again without loss of generality, we can suppose that u > 0 in D and II U 111 = 1. A function f analytic in D is said to be subordinate to g if there is an analytic function co with Ico(z)I < Izl such thatf(z) = g(w(z)).
One reason we are interested in this concept is that
(i) If u > 0 and u(0) = 1, thenf = u + iu is subordinate to p(z) _ (1 + z)/(1 - z).
Proof Let w(z) = p-1(f(z)); co is analytic and maps D into D and 0 into p-1(1) = 0. Let a(z) = w(z)lz, z 0, and a(z) = w'(0) at z = 0; o is analytic in D and has I u(z) I < 1 on 8D, so it follows from the maximum principle that Io(z)I < 1 in D, that is, Iw(z)I 5 Izl. Another reason for our interest in subordination is (ii) If f is subordinate to g, then f02
I f(re`a)I 'd7r(0) < I
I g(re`a)I pd7r(0)
for all r < 1.
0
Proof Let B, be a complex Brownian motion and 'rr = inf{t : IBI > r}. By hypothesis, EI J (Br)I p = El g(w(B1r))I p
6.8
Inequalities for Conjugate Harmonic Functions
177
If we subject w(B,), t < z to Levy's time change, we get a Browniun mot ion B,' run for an amount of time y,. Since Iw(z)I < Izi, it follows that y, r; inf{t : IB;I > r}. Combining this with the fact that Ig(B',Tr)IPisa submurtingulc gives
EIg((o(B,,))IP=EIg(BY.)IP<EIg(Bt)IP and proves (ii). Combining (i) and (ii) proves (3) with CP = dP(q), where q(z) = Imp (z).
To compute the value of the constant, write p(z) = R(z)e"(z), where R(z) = I p (z) I and cb(z) E (- n/2, 7r/2). Since there is no confusion about which root to take, F(z) = R(z)Pe'P(z) is analytic in D. By the mean-value theorem,
1 = Re F(0) = f
Re F(reie) d7r(O)
,J n n
= f
R(re'B)Pcos(p(D(re`B))d7r(O). n
As r
1, cb(re'B) -+ sgn(9)n/2 and R(re'B) -> Iq(e's)I. Since gehP and Icos(p(D(reie))I < 1, it follows from the dominated convergence theorem that
1= f
cosP2 lim f rT1
,1
Iq(reie)IPdm(0), n
so dd(q) = sec(pn/2).
Remark: If at the beginning of the computation of the constant we take an arbitrary f with u = Ref > 0 and use the inequality I ((re') I < n/2, we get a purely analytical proof with the constant given above. This argument is due to Hardy (1928). Proof 3 shows that (3a)
If u > 0, dd(u) < sec (12) IIuIIl
(3b)
If uEh1, dP(u) < 2 sec 12 I IIuIIl
.
The Poisson kernel shows that (3a) is a sharp result. Since (3b) is obtained from (3a) by using the triangle inequality, we should expect that (3b) is not sharp, and indeed it is not. Burgess Davis (1976) solved the problem of finding
the optimal constant in inequality (3b). He showed that the smallest value for C, is IIull,,, where u = (k1 + k_1)/2. In this case, the corresponding analytic function is g(z)
1 (I +z 1-z =2 1-z+1+z
2z (1-zZ),
178
6
Hardy Spaces and Related Spaces of Mortinplea
which maps D one-to-one onto S = C - {x + iy : x = 0, IyI >- 11. To prove his theorem, Davis uses Levy's theorem to reduce the result to an optimal stopping problem for Brownian motion, which is solved by considering related discrete time problems. Since the argument is rather lengthy and the improvement on (3b) is rather slight, the reader is referred to Davis's paper for the details or
Davis (1979b) for a sketch of the proof. A. Baernstein (1978) has given a purely analytical proof of this result. Up to this point, we have only discussed u e h° for p > 1. For 1 < p < oo, the class hP was preserved under conjugation. For p = 1, this was false, but it
was almost true: uehP for all p < 1. When p < 1, things fall apart-there is an analytic function f = u + iv such that uehP for all p < 1, and yet foN (hence v 0 hP for any p > 0). The example is a randomly chosen function f(Z, (0) =
(4)
n=1
Sn(w)g(ZZn)
where g(z) = z/(1 - z2) and fin, n > 1, are independent random variables with
-1)= 1/2 (for analysts, let S = [0, 1] and n((o) = sgn(cos(2nw)), the nth Rademacher function). I claim that (4a)
For every w, Ref (. , co) a hP for all p < 1 and
(4b)
With probability 1, Yo = (0: lim,fl f(re`B, (o) exists} has Lebesgue measure 0.
The proof of (4a) is a straightforward, but somewhat lengthy, calculation and is therefore left to the reader (see Duren (1970), page 66). We will proceed, then, with the more interesting claim (4b), which is implied by the following result. (5)
Let gn(z), n > 1, be complex-valued and continuous in IzI < 1 except at a finite number of points z with IzI = 1.
If (i) Y' O, I g (z) I < oo and for all r < 1 the convergence is uniform on D, {z : IzI < r}, and (ii) for each N, as r T 1 we have oo
gn(re`B)I2. oo
uniformly in 0,
n=N
then with probability 1, f(z, (o) = Y',
(w)gn(z) has a radial limit almost
nowhere.
Proof Let E = {(0, (o) : lim,.1 f(re`B, co) exists}. It suffices to show that for almost every 0 the section Ee = {w : (0, co) e E} has probability 0, for then the desired conclusion follows from Fubini's theorem.
6.8
179
Inequalities for Conjugate Harmonic Functions
Suppose 0 is such that eie is not a discontinuity point of any of the an, i,ntl P(EB) = a > 0. We are going to construct a decreasing sequence of events An. n > 0, with AO = EB and do this in such a way that limn-,. P(A,) Z a/2. I'or
k,n> 1, we let B,(k) = {coeAn_1 : I f(re`B,w)I < k for all r < 1}.
B,(k) T An_1 as k T oo, so if we have already constructed An_1 with P(A,,_1) z
(1/2 + 1/(n + 1))a, then we can pick kn so that P(B,(kn)) > (1/2 + 1/(n + 2))a and let An = B,(k,J. Let B =n,, 1 An. By construction, P(B) > a/2 and, for all n, z
00
i 9m(re') m(w)
1B < k2P(B).
m=n
The functions bi4, 0 < j < k < oo, are an (incomplete) orthonormal set in L2(S2), so
Y
(E1B
m)2 _< II1B 2.
n
0<m
It follows that we can pick M large enough so that
Y
(E1Bnm)2 <
(PB)2MSm
Since B c AM, we have (since m = 1) kMP(B) > E I
Y gm(ret
Z
m=M
1B/
g g Y gm(re` )gn(re`
ao
= EI
\m=M
gm(re`B)21B + 2
MSm
Cauchy-Schwarz implies that the last expression above 2
>
M<m
<2 m=M
Igm(re` lI2 gn(reiO)I2) 1/2
I gm(re`
Y
Y (E1BSm
(M<m5n
II2)1/2(Ign(rei0)I2)
n)2) 1/2
/2 P(B)
1
n=M
Combining the results above, we see that
kMP(B) ?
-2), m=M
contradicti ng (ii) and proving (5). The next exercise recaptures the main aspects of the last proof in a simpler setting.
Exercise 2 If W 1 Ia.I2 = oo, and SN = N 1 with probability 0.
then limN-,, SN exists
I NO
6
Hardy Spaces and Related Spaces of Martingalee
Remark: Probabilists will recognize this exercise as a special case of the Kolmogorov three-series theorem (see Chung (1974), pages 118-119).
Proof Let C > 0 and B = {w : supN I SN((O) I < C }. If (o e B, I S,,(w) - Sm(w) 15 2C for all m, n, and K
4C2P(B) >- E ( k=m+1
2
ak 4
1B )
n
= P(B)
akI2 + 2
YY
m+15j
k=m+1
Again, SJSk, j < k, is an orthonormal system in L2(Q), so we can pick M large enough such that P(B) z,
YK M+Yj
and can apply Cauchy-Schwarz to show that 4C2P(B) > (k= Y_
I akI z)
P(B) (1
- 2),
Mn+1
which is a contradiction, since we have supposed that Y_ IakI2 = oo. There are many other results for conjugate functions. At this point, we have
not covered all the inequalities on the first three pages of Chapter VII of Zygmund (1959) ! Another inequality that can be proved, using results from Section 6.2, is the following. Exercise 3 Zygmund's Inequality. If gpeL1(8D) and we let p denote the conjugate function on 8D (i.e., the boundary limits of the conjugate of Y(p), then there is a constant C such that zn
f2,,
I:edo
(e`e)log(p(e1e)dB.
6.9 Conjugate Functions of Indicators and Singular Measures In this section, we will investigate the conjugate functions of u = 91A, A C 8D,
and u = /j where u is a measure with µ(8D) < oo, which is singular w.r.t. surface measure. In each case, it turns out that (*) qp(O) = limu(re`B) rt l
exists for a.e. 0
and the value of rz(O : qp(O) < y) denotes only on n(A) or µ(8D), respectively.
6.9
Conjugate Functions of Indicators and Singular Measures
181
The result for 1,, was first observed by Stein and Weiss (1959), who proved the result by computing the distribution when A = Ui (ai, bi) is a disjoint union of intervals (see pages 273-276 of their paper) and observing that the distribution depended only on Yi Iai - bit. The result becomes transparent if we look
at f = u + iu through the eyes of a Brownian motion B, starting at 0. Doing this, we observe: (a) If r = inf {t : B, 0 D}, then f(B,), t < r, is a time change of a Brownian motion C, starting at f(0) = n(A) and run for an amount of time
y= J
I .f'(B,,)IZds.
(b) If 0< ir(A) < 1, then 0< u < 1 in D and u(B,) a (0, 1) for all t < r. This implies that y < T = inf It : Re C, 0 (0, 1) }. (c) Since 1A E L1(8D, n), it follows from results in Section 6.5 that
lim Re C, = lim u(B,) = 1A(BJ a.s., t1= tty so we have y T. (d) Since T < oo, it follows that lim u(B,) = lim Im C, = Im CT, tfv
tfT
and using the equivalent of Brownian and nontangential convergence in d = 2 proved in Section 4.3, we conclude that (*) holds and that (1)
7r (0 : OP (0) > y) = PP(A) (Im CT > y).
To compute the value of the right-hand side, we observe that z --, exp(in(x - 1/2)) maps the strip {0 < Rez < 1} one-to-one onto the half space {Rez > 0} (see Figure 6.3) and sends 1
-.i
1 + i t -> ie-z' 2
a -- exp(in(a - 1/2)),
so if we let a = n(A), b = n(a - 1/2), and c = -2n/2, then it follows from results in Section 1.9 that _fec
CT > y) =
1
cos b
n (cos b)2 + (y - sin b)2
dy,
and changing variables x cos b = y - sin b shows the last integral
=1
((tan-, e`
sin cos b b)
- tan'
(-e-
- e cos b
in b)l
Remark: To be fair to the analysts, we should say that the proof above is essentially due to Calderon (1966) and was later rediscovered by Davis (1973b),
who wrote the proof in probabilistic language. We leave it to the reader to
1$2
6
Hardy Spaces and Related Spaces of Martlnf{ales
a 0
1
exp(iir(z - 1))
-le-ami:
exp(i17(a -
Figure 6.3
show that (1) is consistent with the result given by Stein and Weiss (1959) (see (4.3) on page 273) that sinh Y + i sin
/
expl tl{O:IcP(e)I >Y}I) = 2
2
A2
sinh 2 - i sin 12 I
At this point, the reader can probably guess how we are going to prove the result for u = 9aµ when u is singular. Let f = u + iu and observe that
(a) f(B,), t < t, is a time change of a Brownian motion Cr starting at f(O) = µ(8D) and running for an amount of time
y= Jf(B)I2ds. (b) If 0 < µ(8D) < oc, then 0 < u < oo in D and u(B) a (0, oo) for all t < T. oo)}. This implies that y <_ T' = inf{t : Re (c) Since 9au E h', it follows from results in Section 6.5 that
6.9 Co*gate Functions of Indicators and Singular Measure.
lim Re Ct = lim u(B1) = 0
ttr
183
a.s.,
ttt
and so we have y = T'. (d) Since T' < co, it follows that lim 4(B) = lim Im Ct = Im C(T'), tt=
tty
and using the equivalence of Brownian and nontangential convergence in d = 2 proved in Section 4.3, we conclude that (*) holds and that (2)
7r (0 : p(0) > y) = PP(aD) (Im C(T') > Y)
This time it is trivial to compute the right-hand side. If we let a = µ(8D), then
Pa(Im C(T') > y) = l JJ
a 1t
a2
x2
dx.
The proof above is due to B. Davis (1973).
7 H1 and BMO, Jf 1 and Rd(
7.1
The Duality Theorem for # 1 In Chapter 6, we saw that ifp > 1, X -. X.,, maps .,!!P one-to-one onto in such a way that the., #P norm of X is equivalent to the LP norm of X.. From this observation, it follows immediately that every continuous linear functional qP on MP can be written as cp(X) = E(X,, Y), where YEL9, q = p/(p - 1). When p < 1, the equivalence of MP and LP breaks down and the reasoning above fails to identify the dual space (,#P)*. In this section, we will consider the problem of describing (.,lfl)*. The first step in the solution is to introduce a decomposition due to Bernard and Maisoneuve (1977), which expresses a general XE.,!!1 as a .,#1. As will be the case many times below, (a) sum of very simple elements of the probabilistic definition was developed after and imitates the definition in-
vented by analysts (see Coifman (1974), Latter (1977), Coifman and Weiss (1977)) and, more embarrassingly, (b) we will often assume (e.g., in the proof of (4)) that our martingales start at 0 at time 0 and forget to mention this. (1)
A martingale A E.,kl is said to be an atom if there is a stopping time T such that
(i) A,=Oif t
If A is an atom, IIAII, = EA* < 1.
It follows from (2) and the triangle inequality that (3)
If A" is a sequence of atoms and c" is a sequence of numbers with Y-1c.1 < oo, then X= >c"A"E.,ff' and 11X111 < >1c"1-Clearly, di1. The (3) allows us to construct many examples of martingales in next result shows that every XE if 1 can be built up in this way and furthermore
thatY-lc"1
7.1 no Dudity 'Theorem for .,N'
(4)
185
For all X e #', there is a sequence of atoms A", n e Z, and a sequence of constants c", n e Z, with y_n Ic"I < 6IIXII1 such that as N, oo, N
I c"A" - X in fl'. n= -N
Remark: I think the proof of this result is beautiful. It is a trivial computation, but it is also an ingenious idea. To convince yourself of the latter, you should put the book down for a few minutes and try to construct your own decomposition.
Proof One answer to the problem is: for each n e Z, let
T"=inf{t:IXI>2"} and let An _ (X(t A
Tn+1)
- X(t A T"))/c".
The definition is arranged so that >c,,A, is a telescoping series, so we have N
X, - Y c"Ai = X(t) - X(t A TN+1) + X(t A T-N). n= -N
The last term on the right is <2-N and, hence, in as N - oo. To estimate ' norm of Y = X(t) - X(t A TN+1), we observe that Y = 0 on the {X* < 2N+1 } and Y* 2X*, so by the dominated convergence theorem, EY* < E(2X * ; X* > 2N+') -. 0 as n -> oo. Up to this point, the values of the cn's and the precise form of the stopping times have not entered into the proof. We must now choose the c"'s to make the A"'s atoms. To do this, we observe that
X(t A Tn+l) - X(t A T")I < I2n+1 _ (-2")I = 3 ' 2", so if we want IAt I < P(Tn < co)-', we must pick cn = 3 - 2"P(Tn < oo).
Having done this, we find that
EIcnl=Y3'2"P(X*>2") n 2"
2n
P(X* > 2")dy
= n
:!5; 6
J
f2"-
P(X*>Y)dy=611XII1.
0
Remark 1: It is important to observe that we use 2", n e Z, and not just n > 0. We do this (that is, use n < 0) and use a sequence that grows geometrically, so
that the picture remains the same, if we multiply by 2'. The last feature is
1N6
7
H' wd BMO..t' snd 44&J
crucial if we are going to prove an estimate like (4), which is unaffected if the quantities under consideration are multiplied by a constant. Remark 2: While it is important to let T" = inf{t : I X,I > a"} and to pick c" = (a + 1)a"P(T" < oo), the actual choice of a is not crucial. If we repeat the last computation above in this generality, we find that Y_ICI<
(a+l)
(1 - a-')
EX*.
The constant is optimized by taking a = 1 + -,,,[2-, and for this value of a we get a constant = 3 + 2.,/2- = 5.828... , which hardly seems worth the effort.
With the decomposition in (4) established, it is "easy" to find the dual of .A". A linear functional 'p will be continuous if and only if (5)
sup {IT (X)I : Xis an atom} < oc.
To be precise, a linear functional defined on the linear span of the atoms will have a continuous extension to df' if and only if (5) holds. As in the case of the decomposition, it is hard to guess the answer (the reader is again invited to try), but if somebody tells you the answer and shows you which atoms to use as test functions, it is not hard to fill in the details.
We say that Y has bounded mean oscillation (and write Ye .AV) if YE.,lf2 and there is a constant c such that for all stopping times T, (6)
El Y, - YTI < cP(T < oo).
The infimum of the set of constants for which (6) holds is called the M.,616 norm of Y and is denoted as 11 YII* This definition may not look very natural now, but it will by the end of the next proof. (7)
Let sd be the set of atoms. For all Ye _#', III YII* < sup(IE(X, YJ : Xed) < II YII*. Proof We will first prove the inequality on the right. If X e sad and T is a stopping time for which (1) holds, then
E(X, YT) = EE(XJ E(YTE(XXI FT)) = E(YTXT) = 0,
since XT = 0. From this it follows that EX. Y.1 = I EX.(Y. - YT) 1
< E(X*I Y. - YTI) < P(T < oo)-'El Y. - YTI <- 11
YII*.
7.1
The Duality Theorem for.,N'
187
To prove the other inequality, let T be an arbitrary stopping time, let Zoo = sgn(Y, - YT), and let Z, = E(Z,,,,I.) be the martingale generated by this random variable. Since IZ,I < 1, X, = (Z, - ZTA,)/2P(T < oo) is an atom. I'rom the definition of Z,,,,, it follows that
EIY. - YTI =E(Zc(YY- YT))=EZ,Y.-EZ1YT. The first computation in the proof shows that E(Zao YT) = E(ZT YT) = E(ZT Y.),
so we have
EIY. - YTI
=E((ZW-ZT)YT),
and it follows that
E Y. - YT = E ((Z. - ZT) 2P(T < oo)
1\2P(T < oo) Y-)
= E(X Yom).
Taking the supremum over all stopping times now gives the desired result. With (4) and (7) established, it is now routine to conclude that R.,#&. To prove (41)* c RMO, we observe :
(a) .#2 c ill, with IIXII2 =
(EIX*I2)I12
> EI X*I = IIXIII, so if co is a continuous linear functional on #', cp induces a continuous linear functional
on M2 with IIPII2 = sup{Iw(X)I :IIX112 < 1} < 119111(b) from the duality theorem for ..1f2, it follows that there is a YE .% 2 such that
cp(X) = EXm Y. for all X E JI'2. Since d c M', it follows from (7) that YE'4A' V.
(c) from the atomic decomposition, it follows that .,6l2 is dense in M, so the correspondence cp -+ Y defined in (b) is one-to-one.
To prove that (A'l)* = R.,!!U, we now have to prove that all the linear functionals given above are continuous. This follows from the next result (Fefferman's inequality). (8)
If X, YE.,#2, then I E(Xa YaD)I
611XII I
II Y.
Proof From (4), it follows that X can be written as 1" c"A", where All, n E Z, is a sequence of atoms and N
Y_ c"A< < X* + 1
for all N, t.
.=-N
Since X E A'2, we have X* E L2, and it follows from the Cauchy-Schwarz inequality and the dominated convergence theorem that
EX. Y. = Y c"E(A" Y.). n
INN
7
H' and BMU, .41 nd w..4(J
Using the triangle inequality now with the results of (7) and (4) gives the desired conclusion : IEX. Y. I
EIcnI IE(A"YY)I n
I IcnI II YII* < 611XII1II
YII*.
n
Remark: What we have shown above is that if (p e (.,#1)*, then there is a Ye-V.,#O such that cp(X) = E(X, Y.) for all Xe.A'2. In Section 7.2, when we give the "classical" proof of the duality result, we improve this conclusion slightly by showing that qp(X) = E<X, Y>W for all Xe.441. (9)
If there is a constant c such that for all stopping times T
(*) EI Y. - YTI < cP(T < oo), then it follows that we have (**) E(I Y. - YTII 30"T) < c
a.s.
for all stopping times.
Proof Applying (*) to the stopping time
T' =
(T
ifE(IY(-
oo
otherwise,
we see that if P(T' < oc) > 0, then cP(T' < oc) Z E(I YO -YT E(E(I Y. - YTII JET) 1(T' x,))
> cP(T' < oo), a contradiction, so P(T' < oc) = 0.
7.2 A Second Proof of (,&')* = R,& O In this section, we will give a second proof of the duality theorem for -#' following Meyer (1976). This approach starts with a somewhat different definition of -4,V9.
Let Xe.,#2 with X0 = 0. We say that Xe-"02 if there is a constant c such that, for all stopping times T, (1)
E(XQ - XT)2 < c2P(T < oo).
The infimum of the constants with this property is called the _q,#02 norm of X and is denoted by <<X >> *.
7.2
A Secood Proof of (. 4')* - 4Y4N
189
Remark 1: From Jensen's inequality for conditional expectations, it follows
that if Xe. .,lf02, then Xe-V..lf0 and <<X>> Z IIXII*. An inequality in the other direction, <<X>> 5 CIIXII*, is also true and is a consequence oI' the two proofs of the duality theorem. We will also give a direct proof of the second inequality in Section 7.6. XT Remark 2: Since E((X, the definition of -4.,k02 can be written as
(1)
IJIT)
= E(<X )m -
E(<X> - <X )r) : c2P(T < oo) or, in view of (9) in Section 7.1, as
E(<X> -
c2
a.s.
The first step in our second proof of the duality theorem is the same as in the first proof. We show that every continuous linear functional on .,K1 comes from a Ye 9.,0 02. (2)
If 9 is a continuous linear functional on A1, then there is a YE-V.,#02 such that for all Xe.df2 cp (X) = EX. Y..
Proof It suffices to prove the result when <<9>> 1 = sup { I (p(X) I : <<X>> 1 5 1 } = 1. Jensen's inequality implies that «X))2 = (E<X)W)112 z E(<X>10012) _ <<X>>,, so tp induces a continuous linear functional on .,#2, and it follows as in Section 7.1 that there is a Ye.112 such that 9(X) = EX, Y. for all Xe A'2.
To show that Ye"02, let T be a stopping time and let X, = Y, - YT,,,. X is the stochastic integral J Y where J = 1[T,.,), so using our formula for the covariance of two stochastic integrals ((3) of Section 2.6), we have <X, Y> = JJd
<X,X)r =
J,2d3. J0
Since J32 = J, it follows that
<X,X>.=<X,Y)m=
it follows from the inequalities of Doob, Cauchy-Schwarz, and KunitaWatanabe that
EZ-E<X,Y).=EX.Y, . On the other hand, we have EX. Y. = (p (X) <- << X ))1 = E(Z 1/2),
191)
7
H' mnd BMU, .N' rnd M,
and since Z = 0 on IT= oc }, it follows from the Cauchy-Schwarz inequality applied to Z 1(T< .) that E(Z112) < (EZ)112P(T < 00)1/2.
Combining the last three results proves that EZ < (EZ)112P(T < 00)112,
that is,
EZ = E(
If XE., (1 and Ye .,lf02, then
J'ld<X,Y> l
E
Proof By stopping, it suffices to prove the result when X, Y, <X>, and
EJ
Since <X>, has bounded variation, ordinary (Riemann-Stieljes) integration gives <X>-112
d <X )t = 2<X> a1o/2,
J0 so
E
f
<X>t 1/2d<X>, = 2<<X>>1
0
To estimate the second integral, we fix co and integrate by parts to obtain E J oo <X>112 d
=E
r
J0
2
-
fOD
d<X>i12
0
-
At this point, it is very easy to complete the proof if we leave out one detail. I claim that since <X> is adapted to F, the last expression
7.2
A Second Proof of (.t') - :M.A'
= E f " E(< Y>.
191
-
If you accept this, then there is nothing left to show, for definition (I") of 5U. WC) 2
implies that the above is < KY>)*E(<X>1/2) 00 = <<X»1<
Combining the inequalities above shows that I d<X, Y>sI < (2<<X>>1)1J2(<<X»1<
EJ 0
which is the desired inequality. To complete the proof of (3), it remains only to justify the equality claimed above. To do this, we will prove a general result: (4)
If Z is a bounded random variable and A is a bounded increasing process adapted to IF with AO = 0, then E fo'O E(Z
I S)
Some care is needed in defining the integrand, since A may be singular and, for each t, E(Z I.;) is defined only up to a null set. In our situation, there is no problem. The Brownian filtration admits only continuous martingales, so we take versions of E(Z I.) that are continuous in t for each w. In the language of the general theory, we are taking the optional Technical Remark:
projection of the process YY = Z (which is constant in time), but in our situation
we do not need this notion, since there is only one reasonable way to define E(Z I.) for all t simultaneously.
Proof Suppose without loss of generality that Z >_ 0.
EZA = E
A ko
\n / -A Ck
n 1/
=Ek>E(Z(A\n/-ACkn = E kj (A 1 =1
/ ki)
1/)I,
- A (k n
n
1) E(Z
I Ak/n)
-> E f 0 E(Z I.,) dA1 0
as n - oo, by the dominated convergence theorem.
192
7
H' aad BMO, .N' rnd 91.+YPV
Taking Z =
J
- J F
0
0
=J
E(
)d<X)''2
0
=f
-f
0
-
)d<X>t
which completes both the proof of (3) and the proof of the duality theorem. As we mentioned in Section 7.1, one advantage of the new proof is that it gives
a formula for the linear functional that is valid on the whole space and not just on a dense subset.
7.3 Equivalence of BMO to a Subspace of L# Our next goal is to prove the duality theorem (H1)* = BMO. One-third of the work for the proof of this result was done in Sections 6.4 and 6.5, when we showed:
(a) f - Re f(B,), t < r, maps Ho one-to-one into .,ktl and, furthermore, the //T' H' norm off is equivalent to the Xe..,R#', norm of its image (b) if we let X, = Ref(BfAT), then so if we let M: f-+ Ref(BEAT), then the results in (a) hold when the r is erased.
It follows from (b) that M(H0) is a closed subspace of .#1 and that all continuous linear functionals on Ho have the form A(Mf), where A e (.,#1)*. Since (.,ff 1)* = _4.,#0 (the second third of the work), it then remains to identify M(H, )* c -4.,#(9 and to show that we can map BMO one-to-one onto M(Ho )*
in such a way that the BMO norm of a function is equivalent to the .4,f(9 norm of its image. The answer to the first question can be found by very naive reasoning :
M(HH) = {XE.,ffl : X0 = 0, X, = h(B,), t <,r, and X is constant for t > r}, a space we call lf,; , so if L.,L(O,, is defined in the obvious way, we should have
When we prove that (H1)* = BMO in Section 7.4, we will show that this reasoning is correct. To prepare for that result, this section is devoted to determining which harmonic functions h give rise to martingales in (.,ff,; )* =
R.,1f0,, (the last third of the work). The first baby step in doing this is to observe : (1)
If we let ('
Yf= J ke(z).f(e`B) dn(0), then h = Yip where 9 e LZ(8D, n).
7.3
Equivalence of BMO to a Subspace of A WO
193
Proof c .,llti , so the result follows from (2) in Section 7.3. The last result is not much but, in view of the remarks at the end of Scct ion 6.5, it allows us to think of h as being a function (p e LZ (8D, n) and to conclude that t < T
XJh(Bt) t
- gq(Bz)
t > T
is a continuous martingale e.,ll2. A more substantive conclusion results if we use the definition of M.,KO: for all stopping times T, E((Xao - XT)ZI FT) S C2.
So it follows from the strong Markov property that
E((XX -
`YT)2I_f
T) = W(BTnz)
where w(z) = 0 on OD and w(z) = Jko(z)(co(ei) - YTV(z))'21r(O)
when z e D. So in terms of w, the condition for x to be in M.,lfO is (2)
For all z e D, w (z) < c2.
The aim of this section is to show that the last definition is equivalent to the following notion in analysis. (3)
T is in BMO if there is a constant c such that for all intervals I, 19
-WIIZI
f
I
where
=
dO (P
(P,
I
is the average value of p on I. The smallest positive constant with this property is denoted by Conditions (2) and (3) have a very similar form. To emphasize this we will introduce some notation. Let II
.le(re`l') =
jl/(l - r) if Iii - OI < (1 - r)n 0
otherwise
Ap (z) = JJo(z)(e)d7t(O) x'(z) = JJ9(z)(4(ei9) - y (z))2drt(O).
194
7
..e :ir.4u
H' .ed 3MO,
If we recall that dn(0) = d0/2n and observe that as z ranges over D, the supports of the maps 0 -' je(z) run through all possible intervals I, then we see that (3) says simply that w(z) 5 c2 for all z e D. The first step in understanding the relationship between (2) and (3) is to
understand the relationship between ke(z) and je(z). To begin, we will look at the asymptotic behavior of k9(r) as r - 1. (4)
ke(r) =
I lr-
erelz
1 - r2 (r - cos 0)Z + (sin 0)2
1 - r2 1 + r2 - 2r cos O
(1+r)(1-r) (1 -r)2+2r(1 -cos0) 1+r (1+2r(1-cos0)1-1 1-r (1-r)2 J ' so if we let 0 = y(1 - r), then
(1 - r)kl(l-,)(r) -- 2(1 +
y2)-1
2n times the density of a Cauchy distribution with parameter 1. The last result should be no surprise. If we approach the boundary of the disk and rescale the picture so that we are at a distance 1 from the boundary, then the boundary will approach a straight line, so the rescaled exit distribution will approach the Cauchy distribution and the factor of 2n arises since on OD we are looking at the density w.r.t. A = d0/2n.
The computations above show that the natural place for viewing ke(r) is at 0 = y(1 - r). Since this is the width of the support of je(r), the strict positivity of the Cauchy density leads easily to : (5)
There is a constant A such that, for all z and 0, je(z) 5 Ake(z).
Proof From (4) we see that je(z) < C,ke(z) for all Izl < r, so it suffices to consider what happens when r - 1. From (4), it follows that
ke r
O
_ l + r (1 + 2r(1 - cos 0)1 r)2
1-r
J
Now 1 - cos 0 = e(0), where e(0) _ 02/2 as 0-0, so Is(0)15 CO' for Oe [0, 2n] and it follows that if r < 1 and 101 < (1 - r) 7r, then
1+2r(1-r)Z0)51+(1 2r)2C(1-r)Zn2, proving (5).
7.3
Equivalence of BMO to a Subspace of :,Y.,NtV
195
With (5) established, it is easy to prove: (6)
For all zED, w(z) < Aw(z).
Proof By (5), Aw(z) ?
- 9a(p(z))2j9(z) dir(e)
J((e1°)
- Ap(z))2je(z)dn(O),
since a - $ ((p(e`) - a)2j9(z) drz(O) is minimized at a = 9atp. In more familiar terms, the mean p = EX minimizes E(X - a)2, since
E(X-a)2=E(X-p+p-a)2=E(X-p)2+(p-a2). Having proved (6), we turn our attention to the other comparison. From the proof of (6), it is clear that it would be enough to show that there is a constant B such that (*)
BO(z) >- J(q(eio) - #(p(z))2ke(z) dir(e),
for this would imply, by the argument above, that i(z) z w(z). The proof of (6) was easy, because all we had to do was show that some multiple of ke(z) was >- je(z). This statement is false if we interchange the roles of je and k9, so we will have to work harder to prove the result we want-we have to add up a large number of functions of the form cl[a,b] to make something z ke. Because of this difficulty, we will prove a slightly weaker result than (*) that is still sufficient to prove that the norms are equivalent. (7)
There is a constant B such that for all z e D, B (sup
)?
(z)
J(cp(ei0
- #(p(z))2ke(z)d7t(9).
Proof As we mentioned above, we prove this by adding up multiples of lla bi to make something > ke(z). The first step is to introduce the intervals. Let
Io = [-(1 - r)n,(1 - r)ir] and for n > 1, I,, = 2"I0, let N be the largest integer such that 2N(1 - r) < 1, and write
F. =
10 + n 1 + fl--,-]-IN For a picture of the decomposition, see Figure 7.1.
19b
7
H' ud sM0, .,#' and iM.,re)
FT
Figure 7.1
k8(.9) = 19/(1 + 180(1 - cosO)), Io =
N= 3
Estimating the integral over Io is easy. If 0 e Io, then (4) implies that ( ao)
1-r2 < 1-r2 ke((1-r)2+2r(1-cos0) r) = (1-r)2 = i + r < 2je(r),
so we have (co(eie)
(bo) 20(r) ? J
- Pl(o(r))2ke(r) dn(0).
to
(The reason for this strange numbering will become apparent as the proof goes on.) Estimating the rest of the integrals requires more work. The first step in estimating the integral over I" - In_, is to observe
(a") There is a constant C such that if r > 1/2 and n < N, (1 - r)ke(r) < C4-" for all 0eI,, - In_1.
Proof From (4), it follows that
(1 - r)ka(r) = (l + r) 1 + 2r(1 - cos 0)1 (1 - r) Now if n < N and 0 E I" -
then
1 - cos0 > I - cos(2"-ln(1 - r)),
and we have from calculus that
inf
XE(0,l)
1 - Zosx-e>0, x
7.3
Equivalence of BMO to a SubNpace of :N. w V
197
so
(1 - r)ke(r) < 2(1 + E(2"-17,)2)-1, proving (an). The estimate in (a") takes care of ke(r) on In - In_1. To estimate the rest of the integral fin (7), we let 1/2
IIfIII
=(
If 12 dO) JI"
and
a" =
f
J9 jel
In
F
.
Since I I I I n2 is a norm, II(p
- a0II2
IIp - anII2 + E Ilak - ale-1II2 k=1
The first term 1/2
((p
-a")2dO)
<-II(pII*IInV12'
r"
The second term n
= k=1i Iak - ale-1 I.I1/2 To estimate Iak -ale-l I, we observe thatI dO I) 1/2
Iak - ale-1I = ((ak - ak-1)2)1/2 = (
(ak
-ale-1)2
k -1
(f
k
((P 1
1)2 I
- ale
k-
Ik
+ (f
de1/2
(ale-w)2IIk)
<-II(PII*+(2
II
d61 I)1/2
(p)2 IId81
(ale -
-1 )1/2
<3II(pII*'
Summing the estimates above, we find that
II' - aoII < (3n +
1)II(pII*II"I112,
so
(co - a0)2 d6 < 16n2 II(p
*2nn(1
- r).
Combining this with the estimate (an) and recalling that ao = 0c0, shows that
forn
J n -I"-1
((p - 9(p)2ke(z)dO < C'II(pII2n2/2-n.
198
7
H' and IMO,. w' and L *C)
The last detail is to estimate the integral over [-n, n] - IN. To do this, we observe that IN D [ - n/2, n/2], so cos 9 < 0 on [ - n, n] - IN, and it follows that from the proof of (aN+l) if r > 1 /2 and 0 e [ - n, n] - IN, then
(1 - r)ke(r) < 2(1 +
(2Nn)2)-1
and repeating the arguments used to prove
proves :
(q - Ycp)'ko(z)dO < C'Il(pjI*NZ/2-N
(bN+t)
Adding up the estimates (bo) + (bl) +
+ (bN+l) and recalling that II0I* _
sup, w(z), proves (7).
With (7) proved, it follows immediately (for reasons given after the proof of (6)) that we have (8)
For all z e D, BII(pII*
? w(z).
Combining this result with (6) shows that if we let «(V>>* = sup w(z) Z
(= the M.,#C norm of the associated martingale, Ytp(BtAt)), then A IIq'II* < <
For some arguments in Section 7.4 and beyond, it is useful to write the definition of << >>* in a slightly different way. Let tp e L2(8D, n) and let u = ° p. Since u(z) = E,cp(B,), then w(z) = E,(u(Bj) - u(z))2 = E,u(B)2 - u(z)Z. Since U, = u(B,,,) e .,tl Z, it follows that
w(z) = EZ
so in view of the results of Section 1.11, the condition for q' e BMO can be written as (9)
sup =
f GD(z, W) I Vu(w)12 dw < oo, D
where GD(z, w) =
2
n
log
1 -wz z-w
is the Green's function for D.
7.4 The Duality Theorem for H', Feffermao-Stein DeoompoItion
199
The last result is very similar to a classical analytical characteriilltion of BMO. A positive measure .1 on D is said to be a Carleson measure if there is a constant c such that for every sector
S={re`B:1-h
(p e BMO if and only if the measure defined by 1Vu(z)Izlog111dxdY,
z
where u = 99, is a Carleson measure and, furthermore, the constant K in the definition can be chosen so that Clll(pll* < K((p) <- C211911*
For an analytic proof see Garnett (1980), Chapter 6, Section 3. Even though (9) and (10) are very similar, I do not know how to get the second result from the first.
7.4 The Duality Theorem for H', Fefferman-Stein Decomposition In this section, we will identify (H,)* as BMO. There is a standard way to recover a complex linear functional A from the real part of the corresponding functional on the associated real Banach space : A(f) = Re A(f) - i Re A(if ), so, to make the transition to martingales easier, we consider only real linear functionals. The identification of (HO)* is a four-step procedure. (1)
If A e (Ho)*, then there are functions g, and g2 in L°° (8D, n) such that if f = u + iv c-H', then
A(f)= J
u91+vg2dn.
By results in Sections 7.2 and 7.3, the mapping f --> (u, v)lao identifies Ho with a subspace K' of L' (8D) x L' (8D) in such a way that
Proof of (1)
1If IIHI and 11uIILI + 11v1IL, are equivalent norms. If A is a continuous linear
functional on HO, then it gives rise in an obvious way to a linear functional on K', which by the Hahn-Banach theorem extends to a continuous linear
functional on all of L' x L'. Since (L' x L1)* = L°° x L°°, it follows that there exist g, and 92 E L°° such that (1) holds. The next step is to show:
. #' rnd 940
200
7
(2)
If fl , f2 e Ho and u;, v; are the boundary limits of Refs, Imf , then
H' rnd DMO,
fuiu2dlr = n
an
Proof Let U,'= u1(B) for t < T. Ito's formula implies
u;(B,) = 5 Vu,(Bs) dB, 0
so the formula for the covariance of two stochastic integrals gives
A similar argument shows
and the Cauchy-Riemann equations imply Vv;
_1
=C0
Vu;.
0)
so we have Vu1 Due = Vv1 Vv2 and
EoUa1U.2=Eo
(2) allowsjui us to write
A(f) =
+ u2 d7r, n
where g2 has the obvious meaning: it is the boundary limit of the conjugate function of .g2. The rest of the proof is very easy. Recalling that conjugation is a martingale transform, we see that (3)
91 + 62 a BMO.
Proof Since g1, 92 cL°°, they are in BMO. Let g3. = g2, u; _ Yg;. By results in Section 7.3, g; is in BMO if and only if T
sup E.
I V u; (B) 12 ds < oo.
Z
fo The Cauchy-Riemann equations imply that I Vu2l = I Vu3 1, so it follows that
g3 =g2eBMO.
7.4 The Duality Theorem for II', Fefferman-Stelo Decompwltlon
201
Given the martingale duality theorem and the results of the last Iwo sections, the last step is trivial. (4)
If h c- BMO and we let
A(f) = faD uhdn for all f e H02, then A has an extension that is a continuous linear functional
on H. Ut = u(BtA t). Since Proof Let h E BMO, fE Ho , u = Ref, and let Ht = Uo = 0 and BMO c H2, the usual domination argument shows
uhdrz=EU,,,, H..
Using the martingale duality theorem and the equivalence of the two norms shows EUUHH < 6IIUII1IIHII* < ClI f 11111h1j.
and completes the proof of (4).
Remark: The theorem above makes no mention of Carleson measures, but it is otherwise the same as the one given by Fefferman and Stein (1972), on page 145. The only difference is that we have carried out the two main steps, (3) and (4), using the correspondences developed in the last two sections to reduce these steps to results about martingales. As a corollary of the duality theorem, we get the following result from BMO. (5)
If cp e BMO, then qp can be written as g 1 + 92 + c, where c is a constant and g1, 92cL°°, and furthermore, this representation can be done in such a way that 119111.+119211.
Proof The first conclusion is trivial. If q E BMO, then
f-
f (Ref)cpdn ,Jao
defines a continuous linear functional on Ho, so it follows from the proof of the duality theorem that these are g,, g2 E L°° with
f (Ref )cpdn = f (Ref )(91 +92)dn .Jan
.Jan
for all f E H02, and taking test functions of the form YO, where 0 E L2 and
= 0, shows that cp - (g1 + g2) is constant.
do
202
7
ll' and BMO, . N' and :9 #C
To prove the second conclusion, we observe that, given a cp E BMO, the first equation in this proof defines a continuous linear functional A on Ho with II A II 1 = sup { I AJ I II f II 1 < 11 < C II w II * Now Ho is equivalent to a subspace of L' x L', so it follows from the Hahn-Banach theorem that we can extend A to be a linear functional I, on L1 x L' in such a way that :
I1"II1x1 < C'IITII*1
where IIF 1.1 = sup{Ir(u1,u2)I : IIu1II1 + IIu2II1 < 1} (the constant changes only because we change from the L1 norm to the L' x L' norm). Now any I' E (L' x L1)* comes from a pair (q1, g2) E L°° with IIg111., IIg2Ii. < IIFIIL'xL'
(consider functions of the form (u1, 0), (0, u2)), so the proof is complete. It is easy to generalize the last proof to prove a result about martingales.
To do this, we observe that if A1, ... , Am are matrices without a common eigenvector in R°, then Janson's theorem ((1) in Section 6.7) implies that if we let A° be the identity matrix, then the mapping X - (Ao * X, ... , Am * X)
embeds #' in 21 x
x .1 in such a way that
IIXIII
(6)
(recall that if YE 2', then II YIIy = II YIIy') If tp(X) = E<X, Y> defines a continuous linear function on .,#', then (6) implies that
O(A°*X, ...,Am*X) _ T(X) defines a continuous linear functional on a subspace of 2'' x . . . x Y', which the Hahn-Banach theorem asserts can be extended to the whole space.
Since 21 is isomorphic to
(2' x .. x T')* = ii
x
... , Ym c-.' such that if X °,
we have (2'1)* = #' and, hence, .. x r, that is, there are martingales Y°, .
.
.
,
Xm E 21, then
m
(X°,
,Xm)
m
E(XXY.) _ i=o
r=o
E<X`, Y`),,o,
and hence we have m
E<X, Y> _ (p(X) = (Ao * X, ... ,Am * X) = Y E
If XX= O'H.,-dBs
and
Y, =
f 0
0
then
(A HS, Ks) ds
=
(H.,, AT KK) ds = <X, AT * Y`> J0
,
7.4
The Durllty,rheorem for 11', F'effermrn-Stein DecompoNltlon
20.1
so we have m
E<X, Y>c = Y E<X,AT * Y`). t=o
and, since this equality holds for all X e .,#' ,
Y= I AT * Y` i=O
Now in the arguments above we started with an arbitrary Ye. -V.#0 so it follows from the last equation that we have : (7)
If A1, ..., A. do not have a common eigenvector in R', then any YeR,#O can be written as
Y°+
m
AT*Y`,
with Y`efor i = 0, 1, ... , in, and furthermore this can be done in such a way that II Y`II.
CII Y11*-
Since the proof of (7) uses the Hahn-Banach theorem, it does not tell us how to find the martingales Y°, ... , Ym. In simple cases, this can be done "by hand." Let d = 2,
Example 1
A = (_ 0
\
1
11
0 '
and let Xt = B,'AL where
i=
inf{t : I B, 01 = 11. If we let Y, = BfAt 0 and pick a, b so that (1, 0) = a0 + bAO,
then
Xt=af
tAT
( A S
A0 dB,
,Jo
,10
= (a Y,) + A * (b YY).
Finding a decomposition in general, however, seems to be quite a difficult problem. A. Uchiyama succeeded in doing this recently for d-adic martingales (1982a) and has generalized the construction to BMO functions (1982b), but
I do not know how to prove the result for RMO, and I invite the reader to consider this problem.
The key to deducing the duality theorem for Hp from its probabilistic analogue was the fact that the mapping M (mnemonic for Martingale) defined by M: p
Y p(B,j
t > 0
has I M(p 11 * < C II (p I * . For some applications, we will need to know that the inverse N, defined by I
N:X-+cp(e'e)=E(XXIBT=e`°), is also continuous.
204
7
H' and BMU, .N' and s ,#O
(8)
There is a constant C such that, for all X c- -4,#0,
INXII* <
CIIXII*.
Proof From the duality theorem for Ho and the open mapping theorem (see Dunford and Schwarz (1957), Chapter II, Section 2), it follows that
f fgp dn
If II* < C sup
.
J
OCHO
Ihll,si
Since Bt has a uniform distribution, J(NX)co drz = EE(XXcp(B,)IBL) = E(X,gp(BL))
(all the expectations above exist, since X e . #2 and cP e H2). If we let U = ecp(B,A,:), then it follows from the martingale duality theorem that IE(X,cp(B,))I < CIIXII*IIUIII <-
C'IIXII*.
From (8) and duality, it follows that if N is extended in the obvious way it maps Al' continuously into H'. Combining this result with a trivial result for p > 1 gives the following : (9)
If X e ,# 1 and NX = cp, then there is a unique analytic function f with Ref = Ycp and Imf(O) = 0. If p > 1 and we denote this function by FX, then there is a constant C < oe that depends only on p such that IFXIIp< CIIXIIP.
Proof For p > 1, this result is trivial, since IIFXIIp < CIIReFXIILP(aD) and
Re FX IIp(aD) = E I E(X.I B,) JP
<EE(IX.rIB,) = EIX,IP < EIX*IP = IIXIIp
To prove the result for p = 1, we observe that if Xe.llo, then FXeHO, so the duality result and the Hahn-Banach theorem imply that IIf111 _< C sup IIw
J(Ref)P d ir.
7.5
Examples of Mardnades In tt 4 ')
205
If we let u = 9ap, then we have
J(Re FX )cpdn
E(E(X,IB)u(B)) = EE(XCO U. I B)
= E(X, U.) < CIIXII1IIUII*
..#2.
Since .jf 2 is dense in .,# 1,
the desired result follows.
Remark: The last result is false when p < 1. It is known that there are nontrivial continuous linear functionals on H° for p < 1 (see Duren, Romberg, and Shields (1969)). In Section 7.8, we will show that there are no nontrivial continuous linear functionals on .,lf°, p < 1, so X -> FX cannot be continuous. Note: We learned the results on M and N, (8) and (9) above, from Varopoulos (1979), who attributes the results to Maurey. Exercise 1 Sharpen (3) by showing that if qp a BMO and Cp is the conjugate function, then Cp e BMO and
«w»* _ «w»*, IIwII* <- CIIgII* As a corollary of the last result, we see that if cp e L°°, then CP e BMO, a result first proved independently by Spanne (1966) and Stein (1967). The function f(z) = i log z shows that we may have tp e L°° but Cp 0 L°°.
7.5 Examples of Martingales in R ,#C In Section 7.1, we defined the -4.,#C norm II X II * of a martingale to be the smallest number c such that for all stopping times T (1)
E(I X, - XTI) 5 cP(T < oo).
In this section, we will try to explain what kind of martingales are in -4.#6 by giving four examples and describing some of their properties. Example 1
If X c- . e l f °° = {X : X* e L°° }, then it is immediate that X e RJie2
and I I X II * _< 2II X II
.
With a little thought, we can replace the 2 by a 1:
(EIXc -XTI)2 <E (X. -XT)2 EX .2 -EXr2. <- IIXIIW.
206
7
H' and HMO, . N' and .4.4#0
There are also unbounded martingales in M..#O. Perhaps the simplest example is the following. Example 2 Let Xt = Bt 1. If T is a stopping time, then Xm - XT = B1 - BT 1
is independent of . and has a normal distribution with mean 0 and variance (1 - T)+. Since Bc c1/2B1 and EIB1I =
2JrO
(27r)- 1/2xe-x2/2dx = (2/7C)112,
it follows that E(I X. - XTII
(2/7r)112P(T < oo)
and, taking T - 0, that IIXII * =
(2/it)112
Once you get started, it is easy to use Brownian motion to construct
numerous examples of unbounded martingales in 1f0. An obvious modification of the last example is to let S be a random variable that is independent of B, t > 0, and has an exponential distribution P(S > t) = e-xt. If we let Xt = Bs, then the lack-of-memory property, P(S > t + ul S > t) = P(S > u), of the exponential implies that X is in .4.,610. Another possibility is to introduce
the stopping times R" = inf{t > Rn_1 : I B(t) - B(Rn_1)I > 1} and let Xt = B(t A RN), where N is an independent random variable with a geometric distribution P(N > n) = (1 - p)", n = 0, 1, 2.... The next example is a variation
of this-N depends on B, t < TN, and is chosen to try to produce a large maximum. Example 3 Let Ro = 0, and for n >- 1, let R" = inf{t > Rn_1 : I B(t) - B(Rn_1)I
> 11. Let N = inf{n : B(R") - B(Rn_1) = -1 } and let Xt = B(t A RN). See Figure 7.2 for a sample path. It is easy to get a bound on the 8.610 norm of X. If T is a stopping time, then on {Rk < T < Rk+1, N > k}, XT = k + a for some ae(-1, 1), and P(N > k + jI.FT) <- (1/2)j-1 (the worst case is a - 1). On the other hand, a look at Figure 7.2 shows that I X. - XTI < N - k (the worst case is a -> - 1), so combining the estimates gives that E(I X. - XTI I.FT) < E(N -
2,
and we have IIXII* < 2. A look at the parenthetical remarks above shows that this is not the right answer, but we are not far from it. It is easy to compute f(a) = E(I X. - XTI I XT = a, T < R1) and maximize to find IIXII* = 9/8 (details of this computation are sketched in Exercise 1 at the end of this section). We have taken the trouble to compute the -4A'(9 norm of the last example so that we can check the accuracy of some of the inequalities below. By abstracting the construction above, you can produce many examples of martingales in .4.610. The next construction is so general that we can think of it as giving the typical element of -4,NO (see the proofs of (1) and (5) in the next section).
7.5
207
Examples of Msrtlogsles 1n .W.NP"
N=5
R,
T
R,
R,
R,
R,
Figure 7.2
Example 4 Let T" be an increasing sequence of stopping times with To = 0
and I B(t) - B(Tn_1)I < A for t e [T"_1, T"], n >- 1. Let N be a stopping time
for .F(T"), that is, {N < n} E.F(T"), and suppose that for all n > 1, P(N > (Tn_1)) < 0 < 1 on {N > n - 1}. If we let X, = B(t A TN), then X E R.,W0 and as the reader can easily show
nI.
IIXII* < A(1 + (1- 0)-1). The four examples above should give you an idea of what type of martingales are in -4.Af(9 and, hopefully, make the results in the next two sections more obvious. To lead you in the direction of the John-Nirenberg inequality ((1) in the next section), we will now compute P(X* > A) for the three unbounded examples. Example 2.
P(sup X, > ..) = 2P(B1 > i±) =
P(X * > 2) < 2P(sup, Xt > 2) =
4
2
e k2 /2 r
e-v212 dy.
exze X212 dx
21T
4
e x2/22-1. As 2 -+ o o.
2n
Example 3.
If n is a positive integer, then
P(X*>n)_(l/2)".
2011
7 Wand IMO.. N' and :4..WE)
E x a m p l e 4.
I f n is a positive integer, then
P(X * > nA) < P(N > n) < (1 - 0)". Exercise 1
Compute the -4.,lfC norm of the martingale in Example 3.
(a) By the strong Markov property and independent increments of Brownian motion, it suffices to consider the case XT = a e (- 1, 1) a.s. on IT < co}. (b) When XT = a, the distribution of IXX - XTI is given by the following table :
X.
I XX -XTI
-1
a+1
Probability (1-a) 2
( a +1 ) 2 /I)n+i
2
n
n-a
(a 2 1)
I\
Summing over the possibilities, we get
E(IX.-XTI)- (a+1)(2-a)/2 ifa>-0 P(T
1(a+1)(1-a)
if a<0.
The maximum value occurs for a = 1/2, and here the value is 9/8.
7.6 The John-Nirenberg Inequality In this section, we will prove a classical result on BMO functions due to John and Nirenberg (1961), which was discovered almost a decade before it was known that (H1)* = BMO. Following our usual inclination, we will prove the probabilistic analogue first and then use this result to prove the analytical result. (1)
There is a constant Ce(0, oc) such that if IIXII* < 1, then
P(X* > A)
The first step is to prove :
If Ye.4,06 and S > T are stopping times, then EI YS - YTI < II YII*P(T < oc).
Proof If T is a stopping time, then Z, = YY - Y, AT is a martingale and Iz l is a submartingale which is dominated by an integrable r.v. (recall that Ye.,A'1),
209
The John-Nlrenberg Inequality
7.6
so the optional stopping theorem implies that
El Ys- YTI =EIZSI <EIZmi =EIY. - YTI, proving the result, since, by definition of II Y II *
EIY. - YTI <-IIYII*P(T
P(Ri < c0)
EIXR.+l - XR.I > aP(Ri+1 < oc).
Therefore, P(Ri+1 < co IRi < oo) < 1/a and, by induction, P(R,, < oo) < (1/a)"P(R0 < oo). Let n be an integer and let an < 2 < a(n + 1). Then
P(X* > )) < P(X* > an) < P(R" < oo) < (1/a)"P(Ro < oo)
< a(l/a)'I° = ae-'(""I'. Setting a = e, to maximize (log a)/a, gives (1).
Remark: To summarize the proof in loose language : The amount of wiggling a martingale in -4,1f0 can do has a geometric upper bound because of (2),
and, hence, even if all the movement occurs in the same direction, a large maximum will not be produced. To translate (1) into a result about BMO functions, we recall that in Section
7.3 we showed that if q E BMO and we let u = 9vp and U, = u(B,A,), then UE. J1(!9 and there are constants c, Ce(0, oo) such that cII9II* < II UII* < CII(P
(*)
Combining the last observation with (1) gives: (3)
The John-Nirenberg Inequality. There are constants C, y e (0, oo) such that if * < 1 and $ cp do = 0, then {0 : I4 (ete)l > Al I < Ce-".
II
II
Proof (*) implies that II U II * < C, so 110: Iq(e`e)l > All < 21tP(U* > A).-5 C'e-'Ice.
It is easy to improve (3) to the usual result. (4)
Let C, y be the constants in (3). If II'II* < 1, then for all intervals I, {O E I :
I q(e`e) - cprl > All <
Ce-yxlI1.
Proof If! = (a - hn, a + hit), then >V (eie) _ cp(exp(i(a + Oh))) - gyp is in BMO with I IV/ II * < 1 and 10 = 0, so (4) follows from applying (3) to 0. The conclusion of (1) can be improved in a similar way.
210
7 W .ndBMo,.M' snd91_
(5)
Let C be the constant in (1). If IIXII* S 1, then for all stopping times T, P (sup I tzT
- XTI > A) :9 Ce--"P(T < oc). /l
Proof This could be proved in the same manner as (4), but it seems easier to observe that repeating the proof of (1) with Ro = T proves (5). From (5), we see that the definition of -4,#C as sup E(I
XT I
I T < oo) < oo
T
implies the much stronger conclusion that (6)
For all a < (eIIXII*)-1, supE(ealxw -xTIIT < oo) < o0 T
(in both cases, the supremum is over all stopping times). From (6), it follows that ...,df0 can be defined as the set of all martingales with
supE(IXc,, -XTI"IT
There is a constant C < oo such that IIXII* <- <X»* <- CII X II*
Proof We proved the left-hand inequality in Section 7.2. To prove the righthand inequality, we observe that it follows from (5) that if IIXII* 5 1, then
(oo),
E(X. - XT)2 < fO'O 22P (sup I Xt - XTI > .1 t>_ T
<
J
proving (7).
As a corollary of the John-Nirenberg inequality, we get the following striking result due to Zygmund (1929): (8)
If (p is continuous on 8D, then its conjugate function Cp has
JexP()(o)I)do
< oo
for all A < oo .
Proof Since every continuous (p is the uniform limit of trigonometric polynomials, we can, for any e > 0, write qp = gyp, + P2, where gyp, is a trigonometric
7.7
211
The G.rnett-Jones Theorem
polynomial (and hence has a p , e L°°) and 92 has 1 1P 21 1 , < II cp2 IIm ` r, u i I he desired result follows from (6). On page 253 of Zygmund (1959), you can find a continuous cp whose conjugate ap is unbounded: cp(e")
Exercise 1
°°
Y
=
sinnO
nlogn
cp(e
_
°°
cos n9
= n=2 Nogn
Calderon's Proof of the John-Nirenberg Inequality. Let
a(x) = sup{P(X* > x) : IIXII* < 1}.
By stopping at the first time, XXI > x, we see that a(x) < 1/x and a(x)a(y) > a(x + y). Taking logs gives log a(x) + log a(y) > log a(x + y), and one easily concludes from this that lim sup 1 log a(n) = inf 1 log a(m) < 0, R- D
n
m>1 m
proving the result with a constant that is not explicit, but is trivially the best possible.
7.7 The Garnett-Jones Theorem In this section, we will determine which martingales in -4.lf(9 are almost bounded, or, to be precise, we will find the closure of .,#°° in
The solution
to this problem is again the probabilistic analogue of a previously proven analytical result, and the analytical result can be recovered from the probabilistic one. To state the result, we first need some notation. Let ao(X) be the supremum of the set of all a so that supE(ealXw_XTIIT < oc) < oc
T
where the sup is taken over all stopping times (by (6) in Section 7.6, ao(X) > (eII X II*) ' > 0). Intuitively, ao(X) is the exponential rate at which P(I XX - XTI > .) goes to zero for the worst choice of T. Given this interpretation, it should not be surprising that ao(X) can be used to measure how well an X in M MO can be approximated by a Ye.#°°. (1)
There are constants c, Ce(0, oo) such that c
ao(X)
< inf IIX - YII* < Y.M-
C ao(X)
and, consequently, the closure of .,lf°° in R.&(9 is {X : ao(X) = oc }.
212
7
H' and BMO.. #' and 4U.wtV
Remark: This result and the proof we will give below are due to Varopoulos (1979).
Proof The inequality on the left is an easy consequence of the John-Nirenberg
inequality. If YeA' and IIX - Y I* = a, it follows from (5) in Section 7.6 that if Z = X - Y and a > 1/e, then E(e°ho_ZTlla) < C,,P(T < oc), so
P(I Za, -ZTI > 2) < Let Ao = II YII, If K > 2 and A > K.,, Then
P(IX(-XTI>2)
e-Qa(K-2)/KaP(T
< Ca
< oc).
At this point, we have shown that ao(X) > a(K - 2)/Ka. Letting a 1/e and K-> oo gives that ao(X) > Ilea, so the left-hand inequality in (1) holds with c = 1/e (the constant is inherited from the John-Nirenberg inequality). To prove the other inequality is more difficult. Given a large a and a martin-
gale Xe.A.J1 with ao(X) > a, we need to construct Ze.#' with IIx - Z Ih < C/a. This construction is accomplished in two stages. First, we construct an approximating martingale of the form described in Example 4 of Section 7.5, but we are forced to take 2 large to make 0 < 1, and we end up with a M'#6 norm that is too large. Then we use an ingenious construction, due to Varopoulos, to introduce a sequence of stopping times that smooths the transitions
between the times constructed in our first attempt and reduces the M.# C norm to the right size. The first part of the construction is straightforward. We let 2 be fixed and define R. inductively by letting Ro = 0 and Rn = inf{t > Rn_1 : I X(t) - X(Rn_1)I
> Al for n >- 1. If we let n = X(R,,) - X(Rn-1) on {Rn < oo} and Z =
Y-, S. 1(Rn
).
Z, will differ from X, by a martingale that is bounded. To see this, observe that when Rn < t < Rn-1,
X,-Z,=X,-E(> m1(Rm
= X, - X(Rn) +
E(
Y_
\m=n+1
Sm1(Rm
From the definition of the R, it follows that I X, - X(R,,) I < A. To get a bound on the other term, observe that if supE(e2 a_XTII T < oo) < K, T
7.7
213
The Gernett-Jones Theorem
then P(Rm+1 < oo I Rm < oc) < K/eau Therefore, if Ke -a l < 1, then (*)
E( m=n+1 "0
Sm1(Rm<W)I/
< 1(1 - Ke
ax)-1
JF
and we have Y, = X, - Z, c-,#'. Y, = X, - Z, is not the martingale in .,lf°° that we want. From Example 4 in Section 7.5, we see that the 8..110 norm of Z satisfies IIZII* < 2(1 + (1 Ke-az)-1), but this is too big because we have no control over K and, hence, over the choice of 2. To circumvent this difficulty, we use the construction referred to above. Pick 0 < 1 and then 2 so large that Ke-az < e-ax° and (for convenience) 2a = M is an integer. Let y = e-e, let So = 0, and, for n > 0,
1<j<M,let
SfM+j = inf{t : P(Rn+1 < co l.wt) > .
Since P(Rn+, < oo I F(Rn)) <
M-j}.
Ke-a l < yM, we have
R. < SnM+1 < ... < S(n+1)M :!
Rn+1
Let U"
_
I
M
M
Y 1(SnM+j
U" is a staircase that allows us to climb from { U. = 0} = {S"M+1 = oo } to {U" = 1} = {S(n+1)M < oo}. Let 00
M=1
Z, = E(Z' I If Rn < t < Rn+, , then
14 - z;I = E( m=n
m(1(Rm
\m=n+1
<2+2(1
-
Keal)-1
by the arguments used to prove (*) (observe that I m(1(Rm
Z' _
°°
Y
Ym(k)
k=1
1
M
1(Sk<00)'
214
7
H' sod lAW..N' and M.r Or
and we see from Example 4 in Section 7.5 that for all 0 < 1,
IIZ'II* < M(1 +
Letting 0T 1 proves the desired result with C = (2e - 1)/(e - 1) = 2.42. Example 1
Let X, be the martingale in Example 3 of Section 7.5. It is easy to see that ao(X) = log2 = .693, so (1) gives 1
.5307 =
e(.693)
2.42 < inf IIX- Z II* <= 3.49 693 ZEN
The upper bound is hardly informative, since
II X II
s = 9/8 = 1.125, but the
computation suggests the following question I could not answer. In Example 3, do we have
Problem
inf IIX- ZII* = IIXII*?
ZE.R'0D
An even simpler question is: Can you construct an example with this property? With (1) established, we turn our attention to proving the analytical result.
Since this is a thankless job and requires more work than a direct analytical proof (see Garnett and Jones (1982)), we just sketch the details. (2)
The Garnett-Jones Theorem. Let ao(cp) be the supremum of the set of a that has
sup1
exp(alrp-q,iI)d9
where rpr =
f 9 dB. r
There are constants c, Cc(0, oo) such that
< C) ` inf IIq'-'II*a ao((P) C
'P
Proof As in the proof of (1), the left-hand inequality follows easily from the John-Nirenberg inequality, so we leave the details as an exercise for the reader and turn now to the proof of the more difficult right-hand inequality. From the developments above, the plan of attack should be clear. We pass from 9 to U, = Yrp(B,A) = M(p, decompose U, = XX' + X,' according to the construction in the proof of (1), and then let tij(e`B) = E(XX I Bz = e`B) = NXj. From results about the maps M and N defined in Section 7.4, we see that to prove (2), it suffices to show that (3)
ao(T) < Cao(Mtp).
7.8
215
A Disappointing Look at (..N') When p < I
for then it will follow that 11(p - 0III*
CII U - X`II * < ao(U)
` «o(p) The proof of (3), however, is tedious and very similar to the proof of (7) in Section 7.3, so the reader is referred to Varopoulos (1979) for the details. It is inevitable when we use the correspondence between BMO and R.#O (or H" and .,#P) that the resulting inequalities will not be very precise. In the case of (2), an analytical proof gives a much stronger result. As Garnett and Jones (1978) remark, if we norm BMO by is constant}
(which we know from Section 7.4 to be an equivalent norm), then it follows from results of Helson-Szego (1960) and Hunt, Muckenhoupt, and Wheeden (1973) that n
gcLf
III-9II**-2ao((p)
(see Garnett (1980), Section 6). Varopoulos (1980) has shown (see his Theorem 4.2) that there is an analogous result for R.,# !2,
«X-Y>>*<2 «o
1
r inf and that the constant is the best possible. The reader is referred to his paper for the details of this and many other interesting developments (including a probabilistic proof of the Corona theorem).
7.8 A Disappointing Look at (J )) * When p < 1 In this section, we will consider the martingale spaces .,#P, 0
sponding HP space, which in the case 0 < p < 1 was first found by Duren, Romberg, and Shields (1969) (see Duren (1970), pages 115-118). In this section, we will show that this approach is not feasible-there are no nontrivial continuous linear functionals on .,#P, 0 < p < 1. This result, attributed to P. A. Meyer in a footnote in Getoor and Sharpe (1972), is in sharp contrast with the results for dyadic martingales obtained by Herz (1974b). In the dyadic case, a martingale is in (.,'P)* if and only if there is a constant C such that, for all stopping times T, E(I Y,,,, - YTI I FT) < CP(T < oo)1/P. In this section, we use the techniques of Section 7.1 to show that the same result is true for the
Brownian filtration and that, unfortunately, no nonconstant martingale has this property.
216
7
H' ind BMO..N' mod W Vr)
The first step in our study of the martingales in . KP is to obtain an atomic decomposition. The arguments given in Section 7.1 generalize with very little work to the case p < 1. (1)
A martingale A e d#P is said to be an atom if there is a stopping time T such that
(i) A,=Oift
IA,IP
If we let dd(X) = E(X *)P, then it follows from the definition that (2)
If A is an atom, dd(A) = E(A*)P < 1.
(3)
If A" is a sequence of atoms and Yn I cnIP < oo, then as N - oo, XN = Y _N cnAn converges to a limit Xedi", and dd(X) < En IcnIP.
The proof of (4) in Section 7.1 leads to the following : (4)
For all X e #P, there is a sequence of atoms A", n e Z, and a sequence of constants cn, n e Z, such that
(i) asN -oo, _n and (ii) En IcnIP < 2(21/P + 1)Pdd(X).
The proof is the same as the proof in Section 7.1. Let
T"=inf{t:IXI>2"/P} A" _ (X(t A Tn+1) - X(t A T"))/c" cn = (21/P + 1)2' "P(T < oc)1/P.
It follows from computations in Section 7.1 that (i) holds. To check (ii), we observe that dP(>cnA"J < ICnIP
_ (21/P + I)PY2"P(T < oc)
"
_
(21/P
+ 1)P Y 2"P((X *)P > 2") n
< 2(21/P + 1)E(X*)P.
Remark: In the argument above, the fact that p < 1 is important. If p > 1, the triangle inequality gives that cnA"I m-
P
<_ F.lcnl = n
(2"P
+ 1)Y(2"P((X*)P >
2"))1/P,
and the right-hand side > (21/P + 1) (yn 2"P((X *)P > 2"))1/P. Since the spaces .diP, p > 1, are easy to handle directly, we leave it to the reader to figure out how to define atoms for p > 1.
7.8
217,
A Dlwppolnting Look of (A")* Whenp < I
With the atomic decomposition established, it is easy to find the droll of .#P. From results in Section 7.2, if 6p is a continuous linear functional on . NP,
then there is a Ye.,lf2 such that if Xe.,N2, (p(X) = EX. Y.. To see what properties Y must have, we follow (7) of Section 7.1. Let T be a stopping time,
let Z. = sgn(Y. - YT), and let Z, =
Since Z,i 5 1, X, = (Z, ZTAr)/2P(T < oo)l/P is an atom. By a computation in Section 7.1, E I Y. - Y1.I =
E(Z.(Y. - YT)) = E((Z,0 - ZT) Y.), SO
EIY - YTI
E(X,
2P(T < 00)11P'
Taking the supremum over all stopping times, we see that there must be a constant c such that for all T, (5)
EI Y - YTI < cP(T < oo)'IP.
If p = 1, this inequality reduces to (6) of Section 7.1, so on the surface everything is fine. We have a family of spaces, which we might call MP, 0 < p < 1, that generalize R..#D and have (.,NP)* c MP. Unfortunately condition (5) is too strong when p < 1: (6)
If p < 1, then the only martingales Ye 4'2 that satisfy (5) are constant.
Proof The idea of the proof is simple. Suppose that C = 1. If we can find a T such that 0
and if we can pick an > 0 and define another stopping time
T' =
(T 00
if E(I Y.,, - YTI I FT) > E
otherwise
with P(T' < oo) = S, a small number chosen to have PIP-' < E, then we are done, since if (5) holds with c = 1, we have
P(T' < oo)1/P >_ E(I Y. - YT.I) > eP(T' < 00), which implies that 6'IP-1 > e, a contradiction. The technical problems we now face are (a) to find a stopping time with E(I Y. - YTII JFT) * 0 (easy) and (b) to shrink P(T < oo) to an appropriate size. To solve these problems, we observe that since every continuous local martingale is a time change of Brownian motion, it suffices to prove the result when Y, = B,A, and z is a stopping time. Let T. = inf{t : IB,I > a). Since Ye.,N2 and I Y. - Y,I < 2Y*, it follows from Theorem 9.5.4 in Chung (1974) that as E(I Y. - Y(Ta)II _F(Ta)) -'E(IYYII n a>o
.
(Ta)).
The right-hand side is E I Y. I (exercise), but we do not need this. The expectation
218
7
H' ud DM0, .N' rnd A,#&
of the limit is I Y,,,1, which is > 0 if Y * 0 (recall that YY = E(YY IA,)), so it must be positive with positive probability, and hence, if a is small enough and T = Ta, then E(I Y. - YTII.`FT) # 0, and we have accomplished (a). Since T' has a continuous distribution, the solution of (b) is trivial. We let I
T, - IT 100
if E(I Y. - YTII FT) otherwise
and 0 < T < A
and vary A to make P(T' < oo) the right size.
Remark: The last part of the proof obviously breaks down for dyadic martingales. In that setting, if you want a fixed value for the stopping time, say T = 1, then the probability of taking on that value cannot be arbitrarily small. It is this curiosity that allows nontrivial examples on the dyadic filtration.
8 PDE's That Can Be Solved by Running a Brownian Motion
A Parabolic Equations In the first half of this chapter, we will show how Brownian motion can be used to construct (classical) solutions of the following equations: U, = 20u
ut=2Au+g u,=ZOu+cu in (0, oo) x R" subject to the boundary condition: u is continuous in [0, oo) x Rd and u(0, x) = f(x) for x e Rd. The solutions to these equations are (under suitable assumptions) given by Ex(f(B,))
J(t E(f(B)+-s,BS)ds) \
E. (f(B) exp (f o
c
(BS) ds)
-
b(BS) dB, fo I b(BS) 2 dso /I \J 2 In words, the solutions may be described as follows : E. .f(Br) eXp
(i) To solve the heat equation, run a Brownian motion and let u(t, x) _ Ex.f (B,)
(ii) To solve the inhomogeneous equation u, - ZAu = g, add the integral of g along the path. 219
221)
8
PDE's That Can Be Solved by Running a Brownian Motion
(iii) To introduce cu, multiply f(B,) by exp(f o c(B5) ds) before taking expected values. In more picturesque terms, we think of the Brownian particle as having mass 1 at time 0 and changing size according to m' = c(B,) m, and when we take expected values, we take the particle's weight into account. (iv) To introduce b Vu, we multiply f(B,) by what may now seem to be a very strange-looking factor. By the end of Section 8.4, this factor will look very natural, that is, it will be clear that this is the only factor that can do the job. In the first four sections of this chapter, we will say more about why the expressions we have written above solve the indicated equations. In order to bring out the similarities and differences in these equations, we have adopted a
rather robotic style. Formulas (2) through (6) and their proofs have been developed in parallel in the four sections, and at the end of each section we discuss what happens when something becomes unbounded.
8.1
The Heat Equation In this section, we will consider the following equation:
(1)
(a) u, = 'Au in (0, oo) x Rd (b) u is continuous in [0, oo) x Rd and u(0, x) = f(x). The equation derives its name from the fact that if the units of measurement are chosen suitably and if we let u(t, x) be the temperature at the point x c Rd at time t when the temperatures at time 0 were given by f(x), then u satisfies (1).
The first step in solving (1), as it will be many times below, is to prove : (2)
If u satisfies (a), then M, = u(t - s, B.) is a local martingale on [0, t).
Proof Applying Ito's formula gives s
- u,(t - r, B,) dr
u(t - s, BS) - u(t, Bo) = 0
+ JVu(t - r,B,)dB, 0
Du(t - r, B) dr,
+2 0
which proves (2), since - u, + i Au = 0 and the second term is a local martingale.
If we now assume that u is bounded, then M, 0 < s < t, is a bounded martingale. The martingale convergence theorem implies that as s T t, M, converges to a limit. If u satisfies (b), this limit must bef(B), and since MS is uniformly integrable, it follows that
Ms = E,,(f(B,)I3 ) Taking s = 0 in the last equation gives us a uniqueness theorem.
8.1
(3)
221
The Nest Equation
If there is a solution of (1) that is bounded, it must be v(t, x) = Exf(B,).
Now that (3) has told us what the solution must be, the next logical step is to find conditions under which v is a solution. It is (and always will be) casy to show that v is a "generalized solution," that is, we have (4)
Suppose f is bounded. If v is smooth (i.e., it has enough continuous derivatives so that we can apply Ito's formula in the form given at the end of Section 2.9), then it satisfies (a).
Proof /The Markov property implies that Ex(f(B,)IJ1s) = EB(S)(f(Bt-s)) = v(t - s, B.).
Since the left-hand side is a martingale, v(t - s, BS) is also. If v is smooth, then repeating the calculation in the proof of (2) shows that
v(t-s,B.)-v(t,B0)= fo (-vt+ZAv) (t- r, B,) dr 5
+ a local martingale, so it follows that the integral on the right-hand side is a local martingale. Since this process is continuous and locally of bounded variation, it must be = 0, and hence, - vt + zAv = 0 in (0, oo) x Rd (vt and Ov are continuous, so if - vt + Av 0 at some point (t, x), then it is 0 on an open neighborhood of that point, and, hence, with positive probability the integral is * 0, a contradiction). It is easy to give conditions that imply that v satisfies (b). In order to keep the exposition simple, we first consider the situation when f is bounded. In this situation, the following condition is necessary and sufficient: (5)
If f is bounded and continuous, then v satisfies (b).
Proof (Bt - Bo) d= t1"2N, where N has a normal distribution with mean 0 and variance 1, so if t 0 and x -+ x, the bounded convergence theorem implies that
v(t,
Ef(x + t, 2N) -f(x). The last step in showing that v is a solution is to find conditions that guarantee that it is smooth. In this case, the computations are not very difficult. (6)
If f is bounded, then v e C°° and hence satisfies (a).
Proof We will show only that v c C Z, since that is all we need to apply Ito's formula. By definition, v(t, x) = Exf(B) =
$(2xt)_42e_1x_Y1212tf(Y)dY.
222
8
PDE'. flit ('an Be Solved by Running a Brownian Motion
A little calculus gives Die-Ix-yl2/2t =
-(xi -
Yi)e-Ix-y12/2tt
- Yi)2 Dve-Ix-yl2/2r = (xi - Yi)(x, Dite-Ix-yl2/2r = ((xi
t)e-Ix-yl2/2tt2 Y,)e-Ix-yl2/2rt2
i 5 j.
If f is bounded, then it is easy to see that for a = i or ij,
f
IDe-Ix-yl2/2tl
I f(Y)I dy < o0
and is continuous in R°, so the result follows from our result on differentiating under the integral sign (an exercise at the end of Section 1.10). For some applications, the assumption that f is bounded is too restrictive. To see what type of unbounded f we can allow, we observe that, at the bare minimum, we need Ex I f(B) I < oo for all t. Since I E.If(Br)I = J (2nt)
wee-Ix-yl2/2tIf(y)Idy,
a condition that guarantees this is (*)
IxI 2log+If(x)I -.0
as x- oo.
By repeating the proofs of (5) and (6) above and doing the estimates more carefully, it is not hard to show: (7)
If f is continuous and satisfies (*), then v satisfies (1).
Note: All we have done in this section is rewrite well-known results in a different language. An analyst (see, for example, Folland (1976), Section 4A) would write the first equation as
Btu-Du=0 u(0, x) = f(x)
and take Fourier transforms to get
t) -
t) = 0 =f(e)e-4,M21CI2r
t)
Now KK(x) = (47rt) -d/2 e- 1-"1'/4' has e-4n21C12t,
so it follows that u(t, x) = JKt(x - Y)f(Y) dY,
and we have derived the result without reference to Brownian motion.
8.2
The Inhomogeneous Equstton
223
Given the simplicity of the derivation above, we would be foolish to chiim that Brownian motion is the best way to study the heat equation in (0, cx)) x R. The situation changes, however, if we turn our attention to (0, oo) x G, where G is an open set (e.g., G = {z : IzI < 1}), and try to solve (1')
(a) u, = 'Au in (0, oo) x G (b) u is continuous in [0, oc) x G and u(0, x) = f(x) x e G u(t, x) = 0 t > 0, x e 8G. In this context, the analyst (for example, Folland (1976), Sections 4B and 7E) must look for solutions of the form f (x) exp(A,jt), "separation of variables," and show that the initial condition can be written as
f(x) _
a; f (x).
Proving this even in the special case G = {z: Izi < 1} requires a lot more work than when G = Rd, but for Brownian motion the amount of work is almost the same in both cases. We let T = inf{t : B, t G } and let
v(t, x) = EX(f(B); t < T). Repeating the proofs above shows
(2)
If u satisfies (a), then MS = u(t - s, Bs) is a local martingale on [0, T A t).
(3')
If there is a solution of (1) that is bounded, it must be v(t, x).
(4)
If v is smooth, then it satisfies (a).
(5')
If f is bounded and continuous, then u is continuous in [0, oo) x G and u(0, x)
f(x). If the reader is patient, he or she can also show that (6')
If f is bounded, then v, Div, and Djv, 1 < i, j < d, all exist and are continuous, so v satisfies (a).
Note: v will not necessarily satisfy the other boundary condition u(t, y) = 0 for y e G. We will discuss this point when we consider the Dirichlet problem in Section 8.5.
8.2 The Inhomogeneous Equation In this section, we will consider what happens when we add a function g(t, x) to the equation we considered in the last section, that is, we will study (1)
(a) u, = 'Au + g in (0, oo) x Rd (b) u is continuous in [0, oo) x Rd and u(0, x) = f(x).
224
8 PDE'e Thai ('en Be Sowed by RunIa a Brownlen Motion
The first step is to observe that we know how to solve the equation when g = 0, so we can restrict our attention to the case f 0. Having made this simplification, we will now solve the equation above by blindly following the procedure used in the last section. The first step is to prove (2)
If u satisfies (a), then
M, = u(t - s, Bs) + f sg(t - r, B,) dr 0
is a local martingale on [0, t).
Proof Applying Ito's formula gives
u(t - s, Bs) - u(t, Bo) = fos (-ut +
ZAu)(t - r, B,) dr + fos Vu(t
- r, B,) dB,,
wh ich proves (2), since - ur + Au = -g and the second term is a local martingale.
If g is bounded and u is bounded on [0, t] x R" and satisfies (a), then M 0 S s < t, is a bounded martingale. By the argument in the last section, if u satisfies (b), then
lim M, = fo g(t - s, B,) ds ,Tr
and
g(t - s, Bs) dsl).
M, = Ex o
Taking s = 0 gives Suppose g is bounded. If there is a solution of (1) that is bounded on [0, t] x Rd, it must be //
v(t,x) = ExI
g(t - s,Bs)ds). r,B,)drl.°Fs/
\ fo Again, it is easy to show (4)
Suppose g is bounded. If v is smooth, then it satisfies (a) ax, in (0, oo) x Rd.
Proof The Markov property implies that rg(t -
Ex\J
s
t-s
J(t-r,B,)dr+EB(.,)(fo
l
225
&2 7% I.homoQsn.ou. Equatlon
Since the left-hand side is a martingale, it follows that J3
v(t - s, B) +
g(t - r, B,) dr 0
is also. If v is smooth, then repeating the calculation in the proof of (2) shows that s
g(t - r, B,) dr
v(t - s, Bs) - v(t, Bo) + J0
= f (-vt+ZAv+g)(t-r,B,)dr 0
+ a local martingale,
Again, we conclude that the integral on the right-hand side is a local martingale and, hence, must be = 0, so we have (- vt + 4v + g) = 0 a.e. The next step is to give a condition that guarantees that v satisfies (b). As in the last section, we will begin by considering what happens when everything is bounded. (5)
If g is bounded, then v satisfies (b).
Proof If I g I < M, then rt
g(t - s, Bs) ds
E.
<Mt- 0.
J0
The last step in showing that v is a solution is to check that it is smooth enough. In this case,
v(t,x) = J'dr J(2xs)_2e__2/2sg(t - s,Y)dy, 0
and the normal density (2irs)-d/2e-Iv-XI2/2s
PS(x,Y) _
- oo if x = y and s -+ 0, so things are not as simple as they were in the last section. The expression we have written for v above is what Friedman (1964) would call a volume potential and would write as V(x, t) =
f f
Z(x, t ; , T)
i) d di.
J To D
To translate between notations, set To = 0, D = Rd, Z(x, t ; , T) = Pt-,(x, ),
and change variables s = t - r, y = . Because of their importance for the
226
$
PDE'e That (:nn Be Solved by Ruuing . Brownlen Motion
parametrix method, the differentiability properties of volume potentials are well known. Since the calculations necessary to establish these properties are quite tedious, we will content ourselves to state what the results are and indicate why they are true. The results we will state are just Theorems 2 to 5 of Friedman (1964), so the reader who is interested in knowing the whole story can find the missing details there. (6a)
If g is a bounded measurable function, then v(t, x) is continuous on (0, oo) x R°.
Proof This result follows easily from the bounded convergence theorem. (6b)
If g is bounded and measurable, then the partial derivatives Div = avlax; are continuous, and Div = J' JDP(xY)(t - s,Y)dyds.
Proof The right-hand side is
-
f f ,J
0
(2ns)-d/z (Xi - Yi) e- Ix-vl2/2sg(t S
,J
- s,Y) dY ds
= - JEx[(xi oS
-
B
s/g(t - S, B)]
Although the last formula looks suspicious because we are integrating s-1 near 0, everything is really all right. If lgl < M, then Exl(x1 - B5)g(t - s, BS)l < MEEI x; - BsI = CMs1'2, so
- B8)g(t - S, BS)l < 00
f
0
and it follows from the exercise in Section 1.10 that the partial derivatives Div exist and are continuous. The computations above are not hard to make rigorous, but you should save your strength. Things get very nasty when we take second derivatives. (6c)
Suppose that g is a bounded continuous function and that for any N < oo there are constants C, a e (0, oc) such that l g(t, x) - g(t, y)l < CJx - yla whenever
lxl, lyl, and t < N. Then the partial derivatives Dijv = a2v1ax;axx are continuous, and
Dv =
JDiiPs(xY)(t - s, y) dy ds. Ef
Proof Suppose for simplicity that i = j. In this case, the right-hand side is
227
8.2 The Inhomo$sneoa. Equ.tlo.
ft
f
(2ns)-az
((xi -Z Y,Z - S
)
`
Jo,J
e- i=-yi2/zsg(t - s,Y) dy ds
=
fo'
-sg(t-.s,B.)]tIS,
ExL(xi-BZ)
S
but this time, however, ExI(xt - Bs )2 - SI = sEoI(Bi)2 - 1I so
(x;-B:)2-S
= 00.
S2
We can overcome this problem if f is Holder continuous at x, because we can write [((x;-s2t2- sg(t
E.
- sB)
S
s
=Exl(x`-B2) S
s(g(t-s,Bj -g(t-s,x)))f
The second expression < Cs-1+a, so its integral from s = 0 to t converges absolutely, and with a little work (6c) follows. (See Friedman (1964), pages 10-12, for more details.) The last detail now is : (6d)
Let g be as in (6c). Then 8v/8t exists, and
x) + at (t, x) = g(t,
f'drf
A-,(x,Y)g(r,Y) dY
o
Proof To take the derivative w.r.t. t, we rewrite v as
v(t,x) = JJ'Ptr(xY)frY)'1Y. 0
Differentiating the left-hand side w.r.t. t gives two terms. Differentiating the upper limit of the integral gives g(t, x). Differentiating the integrand gives
fai--
pt-.(X y)g(r, y) dy dr
0
tr lJ
2d(2n(t
-
2
r))-(d+2)12
exp (
c
+
fj
r
+ IX (2n(t - r))-dl2 12(t
2(t
-) I g(r,Y) dy dr
X-Y
- r)I2) exp ( 2I(t -
2d :tdrr -Exg(r,Bt_r)dr+
'
dr
) 2) g(r,Y) dy dr
2N
PDE's'Ib.t Can Ile Solved by Rwtnlni a Brownimn Motion
In the second integral, we can use the fact that Ex(Ix - Bt_,I2) = C(t - r) to cancel one of the t - is and make the second expression like the first, but even if we do this,
' dr
J0t-r This is the difficulty that we experienced in the proof of (6c), and the remedy is the same : We can save the day if g is locally uniformly Holder continuous in x. For further details, see pages 12-13 of Friedman (1964). As in the last section we can generalize our results to unbounded g's. To see what type of unbounded g's can be allowed, we will restrict our attention to the homogeneous case g(t, x) = f(x). At the bare minimum, we need f(B,) ds < oo,
Ex J0
and if we want (b) to hold, we need to know that if t 10 and x
x, then
f0,"
f(B5) ds -* 0.
Ex
If we strengthen the last result to uniform convergence for x c R", then we get a definition that is essentially due to Kato (1973). A function f is said to be in Kd if (*) lim sup Ex (fot I f(B5) I ds) = 0. t4 o
x
By Fubini's theorem, we can write the above as t m sup J kt(x, y) I .f(y) I dy = 0,
where J(27s)_d/2e_k_Y12/2sds.
kt(x,y) = 0
By considering the asymptotic behavior of kt(x, y) as t -+ 0 and we can cast this condition in a more analytical form as
(**) limsupJ a. o
x
w(Ix-yl).f(y)dy=0, Ix-Y1
where
-log Izl
d>3 d=2
1
d= 1.
IZI
(P(z) _
(d z)
This is Theorem 4.5 of Aizenman and Simon (1982). The details of the proof,
8.3
The Feynman-Koc Formula
229
though simple, are a little tedious, so they are left to the reader. We will have more to say about these spaces at the end of the next section. For the developments there, we will also need the space K,"', which is defined in the obvious way: fcKK°° if for every R < co, fl(lxl
8.3 The Feynman-Kac Formula In this section, we will consider what happens when we add cu to the right-hand side of the equation we considered in Section 8.1, that is, we will study (1)
(a) u,='Au+cu in (0,co) x Rd (b) u is continuous in [0, co) x R' and u(0, x) = f(x).
(2)
If c(x) < 0, then this equation describes heat flow with cooling. As in Section 8.1, the solution u(t, x) gives the temperature at the point x c Rd at time t, but here we do not assume that there is perfect conduction of heat. Instead, we assume that heat at x dissipates at the rate k(x) = -c(x). We will see below that this corresponds to Brownian motion with killing at rate k, that is, the probability that a particle survives until time t is exp(-$ok(B,)ds). The first step in solving (1) is to prove: If u satisfies (a), then S
Ms=u(t-s,Bs)exp( c(B,)dr) \\ o
ff
is a local martingale on [0, t).
Proof Let c, = f o c (Bs) ds. Applying Ito's formula gives that u(t - s, BS) exp(cs) - u(t, Bo)
- ur(t - r, B,) exp(cr) dr +
Jexp(c,)Vu(t - r, B,) dB,
_ f s0
+
Ju(t - r, Br) exp(c,) dCr + 2
JAu(t - r, Br) exp(cr) dr,
0
which proves (2), since -u, + cu +
ZAu = 0 and the second term is a local
martingale.
If c is bounded and u is bounded on [0, t] x Rd and satisfies (a), then M, 0 < s < t, is a bounded martingale, so by an argument we have used in the last two sections lim MS = f(B,) exp(c,) STt
and
00
8 PDE's That ('en Be Solved by Rwol" Brownien Motion
M. = so taking s = 0 gives (3)
Suppose that c is bounded. If there is a solution of (1) that is bounded on [0, t] x Rd, it must be v(t, x) = EX(f(B,) exp(ct)).
As before, it is easy to show (4)
Suppose that c is bounded. If v is smooth, then it satisfies (a) a.e. in (0, oo) x Rd.
Proof The Markov property implies that EE(.f(Bt) exp(c) l.9s) = exp(cs)EB(S)(f(Bf-s) exp(ct-s)),
so if we let v(t, x) = EE(f(B,) exp(c)), then the last equality shows that v(t - s, Bs) is a martingale. If v is smooth, then repeating the calculation in the proof of (2) shows that
v(t - s, B) exp(cs)- v(t, Bo)
=
s
(- v, + cv + Z Av) (t - r, B,) exp (c,) dr + a local martingale.
J0
so again, we conclude that the integral on the right-hand side is a local martingale and, hence, must be - 0, so we have that - vt + cv + 1 Av = 0 a.e. The next step is to give a condition that guarantees that v satisfies (b). As before, we begin by considering what happens when everything is bounded. (5)
If c is bounded and f is bounded and continuous, then v satisfies (b).
Proof If Icl < M, then e_Mt < exp(c) < e", so exp(ct) --*I as t - 0. Since f is bounded, this result implies that E, exp(ct)f(B) - EE.f(Bt) - 0, and so the desired result follows from (5) in Section 8.1. This brings us to the problem of determining when v is smooth enough to be a solution. To solve the problem in this case, we use a trick to reduce our result to the previous case. We observe that exp
(f c (Bs) ds) = 1 + Jc(Bs)exP(,fc(Br)dr)ds fJ
so taking expected values gives that
v(t, x) = I + JEx [c(Bs)exp(jtc(Br)dr)f(Bt)]ds. Conditioning on .mss and using the Markov property, we can write the equation above as
8.3
231
The Feyameo-Kec Formula
v(t, x) = 1 +
JExc(Bs)v(tsBs)ds. 0
The second term on the right-hand side is of the form considered in the list section. If we st