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!
1. Example 1.3.IO Let X be a linear space. Let (x,y) be a two-argumentscaiar-valuedfunction satisfying the following conditions: (il) (x,x) ~ 0, (i2) (x,x) = 0 if and only if x = 0, (i3) (x1 +x2 ,y) = (xl>y)+(x2 ,y), (i4) (ax,y) = a(x,y) for all scalars a, (i5) (x,y) = (y,x), where adenotes the conjugate number to the number a.
Chapter 1
18
The function (x,y) is called an inner product. The space X with the inner product is called a pre-Hilbert space. It is easy to verify that llxll = (x, x) is an F-norm.
y
1.4.
COMPLETE METRIC LINEAR SPACES
Let X be a metric space with a metricp(x,y). A sequence {xn} of elements of X is said to be a Cauchy sequence or to satisfy the Cauchy condition, or to be fundamental if lim
p(xn, Xm)
= 0,
n,m-+co
The space (X,p) is called complete if each Cauchy sequence {Xn} is convergent to an element x 0 EX, i.e., lim p(xn, x 0)
= 0.
It is easy to verify that a subset A of a complete metric space (X,p) is complete if and only if it is closed. A set A contained in a metric space X is called nowhere dense if the closure A of the set A does not contain any open set. A set A is said to be of the first category if it can be represented as a union of a countable family of nowhere dense sets ; otherwise, it is said to be of the second category. From the definition of the set of the category it trivially follows that a closed set of the second category contains an open set. Theorem 1.4.1 (Baire), A complete metric space (X,p) is of the second category. Proof. Suppose that X is of the first category. Then, by definition X= 00
=
U Fn, where the sets Fn are nowhere dense and Fn C Fn+I· Since the
n=l
set F 1 is nowhere dense, there exists an open set K 1 such that K 1 and the diameter of K1 d(K1) =sup p(x, y)
<
fl
F1 =
0
1.
z;uek1
K2
The set F 2 is nowhere dense, hence there exists an open set K2 such that C K~> d(K2) < 1/2 and K 2 fl F 2 = 0.
Basic Facts on Metric Linear Spaces
19
Continuing this process, we can find by induction a sequence of open sets Kn- such that Kn C Kn+l, d(Kn) < 1/n, and
Kn
fl
(1.4.1)
Fn = 0.
Let Xn E Kn. Since d(Kn)--:;..0, {Xn} is a Cauchy sequence. The space X is complete; thus th:=e is an element x 0 E X such that {xn} tends to x 0 • Since Kn C Kn+l, x 0 E Kn, n = I, 2, ... Hence, by (1.4.1) x 0 ¢ Fn, n = 1, 2, ... GO
This implies that x 0 ¢
U Fn =
X and we obtain a contradiction.
D
a=l
1.4.2. Let (X,p) be a complete metric space. Let E C X be a set of the first category. Then the set CE = X"" E is of the second category. Proof. X= E u CE. Suppose that the set CEis of the first category. Then X as a union of two sets of the first category is also of the first category.
CoROLLARY
This contradicts Theorem 1.4.1.
D
A metric linear space X is said to be complete if it is complete as a metric space. A closed linear subspace of a complete metric linear space is also complete. Let (X,p) be a complete metric linear space. Let p'(x,y) be another metric on X equivalent to the metric p(x,y). Then (X,p') is not necessarily complete, as follows from Example 1.4.2 Let X be a real line and letp(x,y)
= Jx-yJ. Obviously (X,p) is complete. Letp'(x,y) = Jarctanx-arctanyJ. It is easy to verifythatthemetricsp and p' are equivalent. The space (X,p') is not complete, since the sequence {xn} = {n} is a Cauchy sequence with respect to the metricp'(x,y) but, evidently it is not convergent to any element x 0 E X. The situation is different if we assume in addition that the metric p'(x,y) is invariant. Namely, the following theorem holds 1.4.4 (Klee, 1952). Let (X,p) be a complete metric linear space. Let p'(x,y) be an invariant metric equivalent to the metric p(x,y). Then the space (X,p') is complete. THEOREM
Chapter 1
20
The proof is based on the following lemmas : LEMMA 1.4.5 (Sierpinski, 1928). Let (E,p) be a complete metric space. Let E be embedded in a metric space (E', p'). Suppose that on the set En E' the metrics p(x,y) andp'(x,y) are equivalent. Then Eisa Go set (i.e. it is an intersection of a countable family of open sets) in E'. Proof Since p and p' are equivalent, for any x E E there exists a positive number r11(x) < 1/n such that y E E, p'(x,y) < rn(x) implies p(x,y) < < 1/n. Let
Un(x) = {y E E': p'(x, y) Gn
=
<
rn(x)},
U Un(x),
xEE
The sets Un(x) are open. Thus the sets Gn are also open. Therefore G0 is a G0 set. Evidently E C G0 • It remains to show that E :::> G0 • Let x 0 E G0 • Then x 0 E Gn, n = I, 2, ... By the definition of the sets Gn, there exist elements Xn E E such thatp'(xn,x0) < r(xn). Since rn(x) < 1/n, the sequence {xn} tends to x 0 in the metric p'(x,y). Let e be an arbitrary positive number. Let n be a positive integer such that 2/n < s, and let k 0 be a positive integer such that
fo < rn(Xn)-p'(xn, x Then, for k
>
0 ).
k 0,
p'(xk, Xn)
21h•. Proof Let h(u) be a positive decreasing continuous convex function defined on the interval [O,+oo) such that h(O) 0 (positive homogeneity). Let X 0 be a subspace of the space X. Let fo(x) be a linear functional defined on X 0 such that fo(x)
Let
N(u) = uPo-h(u). Let J1 be a finite atomless measure. By Theorem 3.4.3 for any p, 0
Chapter 3
116
determining a topology equivalent to the original one. Theorem 3.4.4 implies that there is no p 0 -homogeneous norm with this property. D For locally convex spaces Theorems 3.4.4 and 3.4.5 can be formulated in a stronger way. THEOREM 3.4.9 (Mazur and Orlicz, 1958). Let N(L(Q,E,fl)) be a locally convex space. If the measure f1 is not purely atomic, then the function N(u) is equivalent to a convex function at infinity. Proof. Since the space N(L(Q,E,fl)) is locally convex, there is a positive number e such that PN(Xk) < e, k = 1, ... ,n, implies PN (
x 1 + ... +xn) < I· n
Let q, p, n be positive integers. Let p :::( n. Let t be a positive real number. Since the measure f1 is not purely atomic, then, for sufficiently large q, there are disjoint sets El> ... , En such that fl(Et) = 1/nq, i = 1, ... , n. The smallest such q will be denoted by q0 • Let for s E EJ, wherej = k, k+l, ... , k-l+p(mod n), otherwise. Then 1 PN(Xk) = -pN(t) nq
and PN
(
X1
+ ... + Xn) _1 N (p t ). n
Hence I p - - N(t) :::( e q n
implies
q
n
Locally Pseudoconvex and Locally Bounded Spaces
117
The continuity of the function N(u) and the arbitrariness of p and n imply that co - N(t) ::'( e (0
q
Let N(t) :;::: eq0 and let q be the greatest integer less than coN(t)fe. From the definition of q follows sq < coN(t) ::'( e(q+ 1). Then 1 1 q+lcoN(t)"(s, whenceq+IN(cot)::'(l and N(cot)"((q+l)
2
q+l
= --·eq ::'(- N(t). Putting C = 2/s, we obtain eq e N(cot) ::'( CcoN(t)
Recall that, by Theorem 3.4.4, lim infN(t) t
> 0.
1--+<Xl
Choose{) > 0 and T > 0 such that N(t)/t ;;?.: {) for t > T and Tb Then for cot > T, 0 < co < 1, N(t) coN(t). = cot1 -;;?.: Tb
>
>
eq0 •
eq 0 •
Since cot ;;?; Timplies t;;?; T, N(cot) ::'( CcoN(t)forcot Let (Ncot) sup-for t > T, O<wo;;;I CO P(t) = wt>T
>
T, 0 "(co::'( 1.
1
for 0 ::'( t ::'( T.
N(t)
Let 0
< a ::'( 2, at > P(at) =
T. Then
sup
O<wo;;;l
N(coat) N(coat) =a sup co O<wo;;;l coa
wat~T
wat~T
N(st) ::'(a sup - 0<~1
st>T
s
= a P(t).
(3.4.6)
Chapter 3
118
Formula (3.4.6) implies that the function P(t)ft is non-decreasing for t > T. Indeed, let T < t' < t"
t' ) t' ( p -" t" I I PUU) t ::::::::: _t_-:--_ t' """ t'
P(t') t'
Let
l
P(t)
Q(t)
=
for t
>
for 0
< t~T
;(T)
tT2
P(t")
=--ru-··
T,
and u
M(u)
=
JQ(t)dt. 0
Since Q(t) is a non-decreasing function, the function M(u) is convex. We shall show that the functions M(u) and N(u) are equivalent at infinity. To begin with, we shall prove that P(t) and N(t) are equivalent at infinity. Indeed, P(t);;?: N(t) and for sufficiently large t, N(wt)/w ~ CN(t), hence P(t) ~ CN(t). Since P(t) is equivalent to N(t) at infinity and N(t) satisfies condition (A 2), P(t) also satisfies that condition, i.e. there is a positive constant K such that for sufficiently large t, P(2t) ~ KP(t). The function Q(t) is non-decreasing, whence~ for sufficiently large t, M(t)
< tQ(t) =
P(t)
and M(t);;?o
J'Q(s)ds;;?o ~ Q(~)=P(~). t/2
Hence, for sufficiently large t, P(t)
~ KP ( ~) ~ KM(t)
and the
functionsM(t) andP(t) are equivalent at infiriity. Therefore the functions M(u) and N(u) are equivalent at infinity. 0 THEOREM 3.4.10 (Mazur and Orlicz, 1958). Suppose that there is a constant K > 0 and an infinite family of disjoint sets {Et} such that 1 ~JJ.(E,)
~
K.
Locally Pseudoconvex and Locally Bounded Spaces
119'
If the space N(L(Q,E,p.)) is locally convex, then the function N(u) is equivalent to a convex function at 0. Proof. Since the space N(L(Q,E,p.)) is locally convex, there is a positive e such that PN(Xk) < e, k = 1,2, ... , n, implies
PN ( x 1 + ·~· +xn)
~
1.
Let p be an arbitrary positive integer and let
{~
xk(s) =
We get PN(Xk) and
~
for sEEk+tn (i=0,1, ... ,p-1), otherwise. (k=1,2, ... ,n)
KpN(t)
__.. pn N ( - t ) ~PN n
(x + ...n +Xn) · 1
Hence N(t)~ efKp implies N(t)/n ~ 1/pn. Let 0 < N(t) < efK, and let p be chosen so that efK(p+1) ~ N(t) < efKp. Then N(tfn) ~ 1/pn ~ 2Kfe N(t)fn. Given p > 0. Choose a q ~ 1 such that N(tfq) < e for it I < p. Condition (LlJ implies that there is a constant D~ such that N(qt) ~DqN(t)for Jti
N(!_).
1 )~ 2 KDq_!_N(t). N(q-t )~DqN(qn qn e n
n
Let 0 < w ~ 1 and let n be such that 1/(n+ 1) 1/n < 2w, putting C = 4KDqfe we obtain N(wt)
~
CwN(t)
Let P (t)
N(wt)
= sup - - , O
Q (t) =
P~t)' t
M(t)
W
= JQ(s)ds.
·•·
for 0
<w~
< w ~ 1/n. Since
1, It!
Chapter 3
120
In the same way as in Theorem 3.4.9 one may prove that M(u) is a convex function equivalent to the function N(u) at 0. D 3.5. INTEGRATIONS OF FUNCTIONS WITH VALUES IN F-SPACES
Let X be an F-space. Let x(t) be a function defined on an interval [a,b] with values in the space X. As in the classical definition of the Riemann integral, we define a normal sequence of subdivisions of the interval [a,b] as such a sequence of subdivisions a = t~ < t~
that
. 11m
~oo
< ... <
sup
o.,;;;;i.,;;;;k(n)-1
tk(n)
= b,
n n 0. 1ti+ 1 -ti 1 =
We say that a function x(t) is Riemann integrable if, for each normal sequence of subdivisions of the interval [a,b] and arbitrary sk, tJ:_ 1 < < s~ < t~, there exists a limit of the sum k(n)
~ x(s;)(t;-tk-1). k=1
As in the calculus, one may show that this limit does not depend on the sequences of subdivisions. It will be called the Riemann integral of the function x(t), and we shall write it as b
Jx(t)dt. a
By repeating the classical considerations this definition can easily be extended to functions of several variables and to line integrals. 1 It is easy to verify that the Riemann integral defined in the way described above has similar arithmetical properties to those it has in the calculus. Namely, if x(t) and y(t) are integrable functions (i.e. such that the Riemann integrals exist), then the sum x(t)+y(t) is integrable and b
b
b
J(x(t)+y(t)) dt = Jx(t) dt+ Jy(t) dt, a 1
a
a
For arbitrary Radon measure it was done by Klein and Rolewicz (1984).
(3.5.1)
Locally Pseudoconvex and Locally Bounded Spaces
121
if a function x(t) is integrable, then for any scalar C the function Cx(t) is integrable and b
JCx(t) dt
b
= C
a
Jx(t) dt;
(3.5.2)
a
if a function x(t) is integrable on an interval [a,b], then for each c, a< c < b, the function x(t) is integrable on intervals [a,c] and [c,b] and c
b
b
Jx(t) dt Jx(t)dt+ Jx(t)dt. =
a
a
c
3.5.1 (Mazur and Orlicz, 1948). An F-space X is locally convex if and only if each continuous function x(t) defined on interval [0, 1] with values in X is integrable. Proof. Necessity. If the space X is locally convex, then the proof that each continuous fuction is integrable is exactly the same as in the calculus, but we replace the estimation of moduli by the estimation of the pseudonorms II Ilk determining the topology. Sufficiency. Suppose that the space X is not locally convex. Without loss of generality we may assume that the norm II II in the space X is non-decreasing (i.e. lltxll is a non-decreasing function for positive· t). Since X is not locally convex, there is a positive number a such that for arbitrary n there are elements x~, ... , x;n such that THEOREM
llxlli'
< ;n i= 1,2, ... ,kn)
and
llx + ·k~+xk"il >a. 1
Without loss of generality we can assume that kn+l is divisible by 2kn. Suppose that
xn(t) =
(i- ~)
[xi
fort=
~0
for t = :n, i = 0, 1, ... , kn,
I. •.
;n, i = 1,2, ... , kn,
[j-
. Is - kn1 , kn j .- 1 2 2k] lis mear on t h e mterva 2 2 •.J - , , · · ·, n •
Obviously each of the functions Xn(t) is integrable since its values are in the finite dimensional subspace Xn spa~ned by elements x~, ... x;n.
Chapter 3
; 122
Therefore, there is a number ~n > 0 such that, for any division 0 = 1 < 11 < ...
11.2 [xn(st)-Xn(s;)] (tt-fi-1)/1 < 3~ i=l
for all Stands; such that ft_ 1 < s1,s;
<
~t,
i
=
1,2,
... ,m-1. a>
Let x(t)
= 2; Xnm(t). The function x(t) is continuous as a uniform m=l
limit of a sequence of continuous functions. We shall show that it is not Riemann integrable. Indeed, let It = i/kn.,, i = 0, 1, ... , kn"' and 2i-1 let St = ft, s~ = 2kn., , i = 1,2, ... , knv· Then kn
li k~., ~ [x(st)-x(s;)]ll
=II k~., ~ 6 =II k~., ~ ~ kn'P
knp
cc
[Xnm(St)-Xnm(s;)]ll
p
[Xnm(st)-Xnm(s;)]ll
k ...,
~II k~., ~ [xn.,(s,)-xnv(s;)]ll
-II k~.,6 ~[Xnm(St)-Xnm(s;)]ll ~II x~+ ~~p+x~: 611 p
kn.,
p-1
.. ll-
p-1
~a-
~
2
m=l
a 3m·
a 2 ·
~:?'
1
k ...,
'
kn.,6Xnm(s,)-Xnm(s;)ll
Locally Pseudoconvex and Locally Bounded Spaces
123
Thus the function x(t) is not integrable. 0 If the F-space X is locally convex, we can also define by analogy to the Lebesgue integral, an integral called the Bochner-Lebesgue integral. Accordingly we aproximate a function x(t) by simple functions k..
Xn(t) =}; atXE., i=l
where Gi EX and Et are Lebesgue measurable sets of the interval [a,b]. The Bochner-Lebesgue integral of the simple function Xn(t) is defined in a natural way as b
len
JXn(t)dt = 2 at /Et/,
a
i=l
where /E/ denotes the Lebesgue measure of the set E. We assume now that, for every homogeneous continuous pseudonorm 1/x/1, the scalar function 1/x(t)/1 is integrable and that the sequence {xn(t)} tends to x(t) almost everywhere and 1/xn(t)/1 ~ 1/x(t)/1. Then we define b
b
Jx(t)dt = lim JXn(t)dt.
a
n~co
a
This definition is correct since one may show that this integral does not depend on the choice of the functions Xn(t). If the space X is not locally convex, we are not able to use this definition, because there are sequences of simple functions {xn(t)} uniformly b
J
tending to 0 such that the sequences of integrals{ Xn(t)dt} do not tend a
to 0. In fact, let Xn(t) =xi
for
i-1
--~
kn
t
i
< - (i= 1,2, ... ,kn), kn
where x~ and kn and a are defined as in the proof of Theorem 3.5.1. It is obvious that the sequence {xn(t)} tends uniformly to 0 and that
i!
j
Xn(t)dtll
=II
xi+
k~+xk,. ~a> 0. fl
a
Since, if a space X is not locally convex, there are continuous functions which are not integrable, it is reasonable to ask what classes of functions are integrabl• in what classes of spaces.
Chapter 3
124
An important class of functions is exemplified by the class of analytic functions. We say that a function x(t) with values in an F-space X is analytic if, for any t 0 , there is a neighbourhood U of the point t0 such that, forte U, the function x(t) can be represented by a power series 00
x(t)
=;}; (t-t )nxn, 0
(3.5.3)
ii,xn EX.
·n=O
If the space X is locally pseudoconvex, then the topology can be determined by a sequence of Pn-homogeneous pseudonorms II lin· This implies that if the series (3.5.3) is convergent at a point t 1 , then it is convergent for all t such that !t-t0 !
hold. For example, if X= S[O, 1], then there is a power series
2 tnxn n=O
convergent only at a finite number of points (see Arnold, 1966; Zelazko, 1972). 3.5.2 (Gramsch, 1965; Przeworska-Rolewicz and Rolewicz 1966). Let X be a locally pseudoconvex F-space. Then all analytic functions x(t) defined on an interval [a,b] with values in the space X are integrable. Proof. Since the space is locally pseudoconvex, the topology in X can be determined by a sequence of Pk-homogeneous pseudonorms II Ilk· Let x(t) be an analytic function. Then for each s 0 e [a,b] there is a neighTHEOREM
co
2 (t-s )nxn is n=O convergent. This implies that there is a neighbourhood V! C U such that for t e V! bourhood U80 such that for t E U80 the series x(t) =
0
0
80
0
k = 1,2, ... ,
s1 ,
n = 0,1, ...
Since the interval [a,b] is compact, there is a finite number of points ••• , Sr such that
[a,b] C
,
U V!.
.
Let
.
V! =
.
(ai> bJ)· N,ow. we ~hall consider the Rie-
j=l
mann integral of the func:ion x(t) on the interval [a1,bj]. Let e be an
Locally Pseudoconvex and Locally Bounded Spaces
arbitrary positive number. Let n0 be such an index that Mk/2no Let x(t) = Yn 0 (t)+zn 0 (t), ai ~ t ~ b,, where
...
Yno (t)
125
< e/2.
00
=}; (t-Sj)n Xn,
Zn0 (t)= }; (t-SJ)nxn. n=n0 +1
n=O
The function Yno(t) is integrable, because it has values in the finite-dimensional space spanned by elements x 0 , ••• , Xno· For any subdivision of the interval [aJ>bJ] a1
=
< '11 < ... <
t0
tp
=
b1
and arbitrary u 1, t,_ 1 ~ u 1 ~ t1, the Riemann sums of Zn0(t) can be estimated as follows: p
II}; Zn (uz) (tz-tz-t) //k ~ 0
l=l
p
00
};
[/_l, (uz-SJ)n Xn(tz-tz-t Ilk
n=n0 +1 l=l 00
00
The arbitrariness of e and the integrability of Yn 0 (t) imply that the Riemann sums_ of x(t) converge for any normal sequence of subdivisions of the interval [aJ>bi] with respect to the pseudonorm II Ilk· Since there is only a finite number of the sets V8~, those sums converge on the whole interval [a,b]. This holds foreverypseudonorm II Ilk, whence the completeness of the space X implies that the function x(t) is integrable. 0 Let C be a complex plane. Let D be an open set in C. Let x(z) be a function defined on D with values in a locally pseudoconvex F-space X. In the same way as for the function of the real argument, we say that x(z) is analytic in D, if for each z 0 ED, there is a neighbourhood Vz0 of the point z 0 such that the function x(z) can be represented in Vz0 as a sum of power series 00
x(z)
=}; (z-z )nxn, 0
n=O
XnEX.
Chapter 3
126
As in the real-argument case, we can define the Riemann integral of a function x(t) on a curve contained in D. In the same way as in the proof of Theorem 3.5.2 we can show that, if the curve Tis smooth and the function x(z) is analytic, then the integral x(z)dz exists. r Using the same arguments as in the classical theory of analytic functions, we can obtain
J
THEOREM 3.5.3. Let Then
r
be a smooth closed curve. Let x(z) be analytic.
Jx(z)dz = 0, _
(3.5.4)
J
r
x(z) - dZ
1
( 0) - XZ 21t
r
z-z 0
Or each Zo inside the domain SUrrounded by
x Where Zo
(n) (
) _
Zo -
1
21t
J
x(z)
(z-zo)n+l
d
r,
z,
(3.5.5) (3.5.6)
r and Fare as in (3.5.5).
As a consequence of (3.5.6) we obtain the Liouville theorem: THEOREM 3.5.4. Let x(z) be an analytic function defined on the whole complex plane C, with values in a locally pseudoconvex space X. If x(z) is bounded on the whole plane, then it is constant. Turpin and Waelbreock (1968, 1968b) generalized Theorem 3.5.2 to m dimensions and to a more general class of functions. We shall present their results here without proofs. Let U be an open domain in an m-dimensional Euclidean space Rm. Let Nm denote the set of all vectors k = (k1 , ••• , km), where kt are non-negative integers, (i = 1 ,2, ... , m). We adopt the folowing notation
Jxl = Jkl =
sup
l.,;t.;;m m
!xtl,
.L lktl' i=l
Locally Pseudoconvex and Locally Bounded Spaces
n
127
m
xk =
x~·.
i=l m
k! =
flkd, i=l
where x = (x1, .•. , Xm) E Rm, k = (kl> ... , km) E Nm. We say that a functionf(x) mapping U into an F-space X is of class Cr(U,X), where r is a positive number, if, for any k E Nm such that lkl ~ r, there are continuous mappings Dk f of U into X and Pr,k f of Ux U into X such that D0 f=J, Pr,kf(x,x) = 0 and
Dd(y)=
~
.L.J
Dk+hf(x)•
lhl~r-lkl
(y-x)h 'h! +iy-xir-lklpr,kf(x,y) •
(see Turpin and Waelbroeck, 1968). THEOREM 3.5.5 (Turpin and Waelbroeck, 1968b). Let X be a locally p-convex space. Let U be an open set in Rm. If f(x) E C,(U,X) for r > m(l-p)fp is a boundedfunction, then it is Riemann integrable. We say that a functionf(x) is of class C00 (U, R) if it is of class Cr(U, X) for all positive r .
. THEOREM 3.5.6 (Turpin and Waelbroeck, 1968b). If the space X is locally pseudoconvex, then each bounded function f(x) E Coo (U,X) is Riemann integrable. Indeed, Turpin and Waelbroeck obtained an even stronger result, namely that the integration is a continuous operator from the space C,( U, X) (Coo ( U, X)) with topology of uniform convergence on compact sets all Dkf, lkl ~r, andpr,kf(all Dkfand allpr,kf) into the space X.
3.6. VECTOR VALUED MEASURES Let (X, II II) be an F-space. Let Q be a set, and let .E be a a-algebra of subsets of Q. We consider a function M(E) defined for E E .E with
128
Chapter 3
values in X such that, for any sequence of disjoint sets E1o ... , En, ... belonging to E M(E1 u
... uEnu ... ) = M(EJ+ ... +M(En)+ ...
The function M (E) is called a vector valued measure (briefly a measure). By the variation of the measure Mona set A C Q we shall mean the number M(A) =sup {liM(H)Ii: He A, HeE}.
THEOREM 3.6.1 (Drewnowski, 1972). The variation M of a vector valued measure has the following properties : M(e) = 0,
(3.6.1.i)
if A C B, then M(A) M(Q) <+oo,
~
(3.6.1.ii)
M(B),
(3.6.1.iii)
.M(UHn).;;;:;}; M(Hn) for any sequence{Hn} of sets m=l n=l belonging to E, (3.6.1.iv) M(H) = lim M(Hn),
if His either a union of an increasing
n--+-ro
sequence {Hn} C E of sets or sing sequence {Hn} of sets.
if it is an intersection of a decrea(3.6.1.v)
Proof Formulae (3.6.1.i) and (3.6.l.ii) trivially follows from the definition of the variation. (3.6.l.iii). Suppose that (3.6.1.iii) does not hold. Then there is a sequence of sets Hn E E such that IIM(Hn)li-+oo. Without loss of generality we may assume that IIM(Hn)li
> 1+IIM(Hl)ll+ ··· + IIM(Hn-t)li.
The sets Hn = Hn"'-(H1 u
... UHn-t)
A
are disjoint and IIM(Hn)li
ro
> 1. Thus the series };
n=l
M(Hn) is not con-
vergent, and this leads to a contradiction. ro
(3.6.1.iv). Let A be an arbitrary set contained in
U Hn.
n=l
Let An
Locally Pseudoconvex and Locally Bounded Spaces
129 00
= (A" (H1 u
... u Hn-J) () Hn The sets
An are disjoint and A =
U An. n-1
Then 00
jjM(A)IJ
00
00
II}; M(An) II~}; IJM(A,.)IJ ~}; M(Hn).
=
n=l
n=l
n=l
00
The set A is an arbitrary subset of the set
U Hn.
n=l
Thus 00
M{H1 UH2u ... ) = sup{IJM(A)IJ: AC
U Hn} n=l
00
~}; M(Hn). n=l
(3.6.1.v). Let Hn E l: be an increasing sequence of sets. Thus Hn C H and by (3.6.l.ii) M(Hn) ~ M(H), n = 1,2, ... This implies that lim M(Hn) ~ M(H). Let e be an arbitrary positive number. Let A C H, A e 1: be such that M(H)-e
<
IJM(A)IJ ~ M(H).
As in the classical measure theory we can prove lim M(A()Hn) = M(A). Hence for sufficiently large n M(H)-2 e
<
.
IJM(A()Hn)IJ ~ M(Hn).
The arbitrariness of e implies lim M(Hn) ~ M(H). Now we shall consider the case where Hn is a decreasing sequence
n H,.. Since Hn c H, n = 1,2, ... , we have 00
of sets, Hn
E
1:. Let H
=
n-1
by {3.6.1.ii) M(H) ~ M(Hn)· Thus lim M(Hn) ~ M(H) n--+-00
Chapter 3
130
Observe that, if An C Hn ""-Hn-1 , then the series
2"' M(An) converges tl=l
uniformly with respect to the choice of An. Then for an arbitrary positive· e there is an index n0 such that
II
i
n=n,+l
M(~n)ll <e.
Let A C Hn 0 , A E E, be such a set that [[M(A)/1 C()
A
Let A =A""-(
U An (Hn ""-Hn-J). n=n +1
> M(Hn 0 )-e. A
A
Observe that A C H and [[M(A)
0
-M(A)fl <e. Hence M(A) pletes proof.
~
M(H)-2e. The arbitrariness of e comD
A measure M is called bounded if the set { M(E): E E E} is bounded. As a trivial consequence of (3.6.l.iii), we obtain 3.6.2. Let X be a locally bounded space. Then each measure with values in X is bounded. Proof Without loss of generality we may assume that the norm in the space X is p-homogeneous. Thus, by (3.6.l.iii), the set CoROLLARY
{M(E): EEE}
is bounded.
D
CoROLLARY 3.6.3. Let X be a locally pseudoconvex space. Then every measure M with values in X is bounded. Proof The topology in X can be determined by a sequence II lin of Pn·homogeneous pseudonorms. Let X~= {x: ffxlln = 0}. Let Xn be the quotient space Xn =X/X~. The pseudonorm II lin induces a Pn·homogeneous norm in Xn, and the measure M induces the measure Mn with values in the completion of Xn,Xn. Thus by (3.6.l.iii)
sup{f[M(E)[[n: EEE} <+oo, Therefore the measure M is bounded.
n = 1,2, ... D
Locally Pseudoconvex and Locally Bounded Spaces
131•
Recently Talagrand has proved that each measure with values in the space L 0(Q,E,p,) is bounded. However, there are an F-space Hand an unbounded measure M with values in H, as follows from Example 3.6.4 (Turpin, 1975c) Let Q = [0, 1], let E be the algebra of Lebesgue measurable sets, and let .ll denote the Lebesgue measure. For fe L 0 [0, 1] we write
a(f) = .ll({t ED: f (t) # 0}, and Var {f)= inf {Var (/1): / 1 =/almost everywhere}. Let H be the space of all measurable functions f such that for each >0 there are g,he£0 [0,1] such that f=g+h and Var(g) <+oo and a(h) < 8. Let 11/11 = inf {lfgffco+Var(g)+a(h): f= g+h}, where [[g[[co = ess sup [g(t)[. 8
It is easy to verify that for fi,f2 E H we have
flii+/211::::;;; 11/111+11/211, lis/ II ::::;;;·11/11 for [sf ::::;;; 1, [[sfll-+0 if s-+0 11/11 = 0 if and only if/is equal to 0 almost everywhere. Thus II/II is an F-norm on H. It is not difficult to prove that the space H is complete, but it is not essential in the construction of the example, ~ince in the opposite case we can simply take the completion of H. Let SEE. The characteristic function Xs E H. Indeed, for each 8 > 0 there is a finite union of intervals D such that a(xs-xn) < 8. Since Xn is of finite variation, Xs E H. . Let {Sn}, Sn E .E, be a sequence of disjoint sets. Thus ./l(Sn)-+0. From the definition of the norm II I~ we infer that IIXs.ll::::;;; .ll(Sn) for sufficiently large n. This trivially implies that the measure M(S) = XsE H,
SEE,
Chapter3
132
is a vector valued measure. We shall show that the measure M is not bounded. Indeed, let n, h be non-negative integers. Let Inn=[.!!__, h+ 1]. ' n n
Let fn
= _!_
2
n 2h
I211,n
= _!_ M( n
U I2h, n)·
2h
We shall show that {fn} does not tend to 0 and this will complete the proof. Let fn = gn +hn. Let A be the union of those intervals Jn,n = I 211 ,n u I211 +1,n for which hn is equal to 0 on subsets of positive measures on both intervals I 211 ,n and I2h+I,n· This implies that the variation of gn on J 211 ,n is not smaller than 1/n = ~ A.(Jn,n) and 2 Var (gn) ;::?: A.(A). On the other hand by the definition of A 1-A.(A) = x(D"'A)::::;; 2a(hn and finally 2Var (gn)+2a(hn);::?: 1. Therefore
/Ifni/
;::?: 1/2 and this completes the example.
A measure M is called compact if the set {M (E): E e L'} is compact. By Corollary 3.6.2 we trivially obtain CoROLLARY
3.6.5. If X is finite-dimensional, then each measure is compact.
If the space X is infinite-dimensional Corollary 3.6.5 does not hold, as follows from Example 3.6.6 Let D = [0, 1] and let E be the algebra of Lebesgue measurable sets. Let X= 12• We define a vector measure Mas follows M(E) = {
Jsin2nntd~}.
E
Locally Pseudoconvex and Locally Bounded Spaces
133
It is easy to verify, that M is a measure. By Corollary 3.6.3 the measure M is bounded. We shall show that it is not compact. Indeed, let
En= {t: sin2nnt
> 0}.
Observe that the n-th coordinate of M(En) = 1/TC. This implies that the sequence M(En) does not contain any convergent subsequence. Thus the measure M(E) is not compact. Let f(t) be a scalar valued function defined on Q. We say that the· functionf(t) is measurable if, for any open set U contained in the field of scalars, the setf-1(U) belongs to .E. A sequence of measurable functions {fn(t)} is said to tend to a measurable function f(t) almost everywhere if lim fn(t) = f(t) for all t except a set E such that M(E) = 0. n->oo
PROPOSITION 3.6.7 (Drewnowski, 1972).
If fn
tends almost everywhere to
J, then for each e > 0 00
lim k->oo
M(U
En (e)) = 0,
n=k
where En(e) = {x: //fn(x)-f(x)// ~ e}. Proof The sequence
is a decreasing sequence of measurable sets. Then by (3.6.1.v) lim M(An) =
M (lim
An) = M (lim supEn(e)). n->oo
Observe that if x
E
limsupEn(e), then the sequence fn(x) is not convern
gent to f(x). Thus lim supEn(e) C A= {x: fn(x) is not convergent tof(x)}. By our hypothesis M(A) = 0. Thus, by (3.6.l.ii),
M(lim sup En(e))~ M(A) =
0.
D
11->CO
As a consequence of Proposition 3.6.7, we obtain extentions of the classical theorems of Lebesgue and Egorov
Chapter 3
134
3.6.8 (Lebesgue). If {fn(x)} tends to f(x) almost everywhere, then, for each e > 0,
THEOREM
lim M({x: 1/fn(x)-f(x)// ~ e})
=
0
n---+ro
3.6.9 (Egorov). If {/n(x)} tends to f(x) almost everywhere, then for each e > 0 there is an FE .E such that {fn(x)} tends to f(x) uniformly on F. Proof By Proposition 3.6.7, for each k there is an index Nk such that THEOREM
(3.6.2)
(3.6.3)
M(D"'F) =
M((J
0 En(-k ))~t M( 0 En(-k 1
k-l n-N•
k=l
n-N•
1 ))
OC>
~2
;k =e.
k=l
We shall show that {fn(x)} tends uniformly to f on th set F.· Indeed, let 'YJ be an arbitrary positive number, let k be such that 1/k < 'YJ· If x E F, then
and //fn(x)- f(x)//
or n
~
1
< -k <
'YJ
0
Nk.
For simple measurable functions there is a natural definition of the integral with respect to the measure M. Namely, if g(t)
=
l
N 1
n=l
hnXE.,
En
E
.E, bn-scalars.
Locally Pseudoconvex and Locally Bounded Spaces
135
then we define N
j g(t)dM(t) = !1
}; bnM(En). n~J.
We say that a measur:; M is L"" -bounded if ll1.:: set
{J gdM:
O
is boundecl (Turpin, 1975). Of course, every L ""-bounded measure is bounded. The converse is not true, as will be shown later. However, for a large class of spaces (containing locally pseudoconvex spaces) every bounded measure is L"" -bounded. Let X be an F-space. Let {An} be a sequence of non-negative numbers. We say that the space X has property P({A.n)} if, for any neighbourhood of zero U, there is a neighbourhood of zero V such that n = 1,2, ...
PROPOSITION 3.6.10. If a space X is locally pseudoconvex, then it has property P ( { ;n }) . Proof Let topology in X be determined by a sequence mogeneous pseudonorms. Let
llxnll < e,
n
=
{II Ilk}
of Pk-ho-
1,2, ...
Then D
THEOREM 3.6.11 (Rolewicz and Ryll-Nardzewski, 1967; Turpin, 1975). Let an F-space X have property P( {1/2n}). Then each bounded measure with values in X is L"" -bounded. Proof Let N
g(t)
=}; hiXE•• i=l
Chapter 3
136
0 ~ bt ~ 1, be a simple measurable function. Let U be an arbitrary neighbourhood of zero. Since X has property P({1/2n}), there is a balanced neighbourhood of zero V such that 1 1 TV+ ... + 2n VC U,
n = 1,2, ...
By our hypothesis the measure M is bounded, i.e. there is an s such that M(E) c sVfor all Ee 2:. We write each bt in the dyadic form
>0
co
~bt,lc
bt = ~ 2/c ' k=l
where bt,lc is equal either to 0 or to 1. Thus N
J
g(t)dM =
.2
btM(Et) =
i=l
D
co
N
k=l
n=l
N
co
i=l
k=l
22
b~~n
M(Et)
=}; 2 b~: M(Et N
co
=
.2
;lc M(
iy bt,lcEt) C sU.
k=l
The arbitrariness of U implies that the set A= {
Jg(t)dM: 0 ~ g(t)~ 1, g-simple mesurable}
D
is bounded.
0
3.6.12 (Maurey and Pisier, 1973, 1976). Each bounded measure M with values in a space L 0(Q,E,p) is L 00 -bounded.
THEOREM
The proof is based on several notions and lemmas. To begin with we shall recall some classical results from probability theory. Let (Q 0 ,E0 ,P) be a probability space (i.e. a measure space such that P(Q0) = 1). A real valued E0-measurable function is called a random variable.
Locally Pseudoconvex and Locally Bounded Spaces
137
Let X(w) be a random variable. We write E(X)
j X(w)dP
=
and V(X) =
JIX(w)-E(X)j dP. 2
o.
LEMMA 3.6.13 (Tchebyscheff inequality). P({w: !X(w)l;;?; e})
~4E(X'). e
Proof E(X2)
=
JIXI dP 2
o.
j
j
X 2 dP+
{co: IX(co)l~}
X 2 dP
{co: IX(o)l<s}
;;?; s2P({w: IX(w)i;;?; e}). LEMMA 3.6.14. Let X(w)
E
~
j
X 2 dP
{co: IX(co)l~s}
0
L 2(Q0) and let 0
Then . zE2(X) P({w. X(w);;?; A.E(X)});;?; (1-..1.) E(X 2)"
Proof Let X'(w)
= { :(w)
ifX(w);;?; A.E(X), ifX(w)
<
A.E(X).
By the Schwarz inequality we have
E 2(X') ~ E(X' 2)P({w: X'(w) =/= 0}) ~ E(X 2 )P({w: X(w);;?; A.E(X)}). Since E(X) ~ E(X')+A.E(X), we have E(X') ;;?; (1-..I.)E(X). Thus
0
Chapter 3
138
Let (fJ,l:,P) be a probality space. Random variables X 1(co), ... , X 11(co) are called independent, if P({co: X 1(co) e Bt> ... , Xn(co) e Bn}) = P({co: X 1(co) e B1})· ••• ·P({co: Xn(co) e Bn})
(3.6.4)
for all sets BI> ... , Bn E: 1:. A sequence {Xn} of random variables is called a sequence ofindpendent random variables if, for each finite set of indices i 1 , ••• , i11 , the random variables Xfl, ... , Xtn are independent. By (3.6.4) we conclude that, if {Xn(co)} is a sequence of independent random variables, then E(X11 · ... · Xtn) = E(XtJ · ... · E(Xtn)
for i 1 < i 2 < ... in. By a Rademacher sequence we shall mean a sequence of independent random variables r11(co) taking the values +I or -1 with the same probability 1/2. 3.6.15 (Paley-Zygmund inequality; see Paley and Zygmund, 1932). Let {r11(co)} be a Rademacher sequence. For any sequence of numbers {a11 } LEMMA
N
P ({co:
N
I~ rn(co)anl ~A~ lanl 2}) 2
n=l
n=l
Proof We shall write N
X(co) = j ~ rn(co)an 12 n=l
and we shall calculate N
E(X) =
JI~ rn(co)anr dP J ~ rt(co) r1(co) atCii dP u U
n=l N
·=
i,j=l
=
N
N
i-1
i=l
J~ latlldP = ~ latl
n
1•
;?:
+
(1-.1)2 •
Locally Pseudoconvex and Locally Bounded Spaces
139
Using the formula
and observing that
Jrn (w)rn (w)rn (w)rn (w)dP = 0 1
3
2
4
n
if one index is defferent from the others, we obtain N
E(X 2)
=
JI}; rn(w)an 1dP 4
a
n=l
N
=
,2; [an[ +6
};
4
[an[ 2 [am[ 2
l~n~m~N
n=l
2: [an[ r. N
~ 3(
2
n=l
Using Lemma 3.6.14 we obtain the required inequality.
0
Let Q = {-1, 1}N be a countable product of two point sets. The elements of Q are sequences a= {an}, where an take the values either +1 or -1. Let rn(a) be the following random variables rn(a) =On. Let A= {An} be a sequence ofreals such that [An[~ 1. On the two point set { -1, + 1} we define measures P1n as follows
1+A
P;.n({ +1}) = - 2 -, P;.n({ -1 }) =
-
1-A 2 -.
Let P1 be the product measure, P1 = P1 , X ... X P1n X .•. It is easy to verify that the random variables {rn(t)} constitute a sequence of independent random variables and
Jfn(a)dP;. =An.
a
Let A= {0,0, ... }. The measure P1 will be denoted by P0 •
(3.6.5)
Chapter 3
140
3.6.16 {Musial, Ryll-Nardzewski and Woyczynski, 1974). Let P;. and P 0 be as described above. Let LEMMA
t
p =
(Po+P;.).
Then, for each sequence of numbers {x 1 , x 2 , integer n, n
••• }
and for each positive
n
P({a: I~ rt(a)xt I~+ I~ AtXt I})~+· i=l i=l
m =
Proof Without loss of generality we may assume that
n
If L;ixtl 2
>
i,we shall use the Paley-Zygmund inequality
i=l
1 1 ( 1 )2 1 ~23 l-16 ~g· n
If 2
lxtl 2 < t
we shall use the Tchebyscheff inequality (Lemma
i=l
3.6.13). By simple calculation we obtain n
JI~ (Ai-ft (a))xtl dP.t 2
u
i=l
n
=
~ i=l
Ji(-1t-ft(a))xtl dP.t 2
u
n
= ~ A.f i=l
n
lxtl 2 -2
~
n
-1tlxtl 2
i=l
n
=
l\t-A.n!xtl 2 <{. i=l
Jft(a)dP.t+ ~ lxtl
u
i=l
2
Locally Pseudoconvex and Locally Bounded Sraces
141
In the calcution we have used the fact that ;, are independent random variables and formula (3.6.5). Now
PA
({a: It fc(a)xt I~+}) •=1
= PA
({a: It (lt-ft(a))xtl ~ +}) •=1
=
1-PA({a: It (lt-rt(a))xc I~ f}). t=1
n
82 ~ 82 1 I- 72 L.J (I-Ai)lxtl 2 ~ I--p 4· i-1
Hence m
>f
also in this case.
0
Proof of Theorem 3.6.I2 (modified proof given by Ryll-Nardzewski and Woyczynski (I975). Let M be a bounded measure. Thus, by definition, the set n
K = {x: x
=}; etM(At), Et ~qual either - I or+ I, 1=1
=4t e J:, Ac disjoint sets} is bounded. We have to show that the set n
K1 = {x: x
=}; ltM(At), JkJ ~I,
At el:, At disjoint}
i=1
is also bounded. M(At) e L 0(D,J:,p). We shall write M(At) = fi(t). Let [) = {-I, + 1}N, let P be a measure with the property described in Lemma 3.6.16, and let rt be a sequence of independent random variables described in that lemma. Thus by Lemma 3.6.I6 (3.6;6)
Chapter 3
142
for all t. By the arguments given in: Example 1.3.5 we may assume that
fl.(Q) <+oo. Let
n
{t: I~ At/i{t) I> sc}. that fJ.{Tc) > 0. Let fl.c(A) = fl.(A n Tc)/fJ.(Tc).
Tc =
i=I
Suppose fl.c(Tc)
Of course
= 1. For the product measure fJ.cXP we have by (3.6.6) fl.c
xP({(t,a): /4 ft(a)fi(t)l? +14 n
n
t=l
•=11
lctfi(t)
I})?+·
Then, by the Fubini theorem,
and, by the definition of Tc, n
.~a~\ fl.c ({t ETc: I~ Bt/i{t)
I> c})? +·
Hence, by the definition of fl.c, max fl. ••= ±l
({t
E
T:
" I~ Bt/i(t) t=l
?
.~~\fl.({tETc:
=
+fl.({t e T:
I> c})
n
16stfi(t)l >c})?+fJ.(Tc)
It I? sc}). ?ctfi(t)
(3.6.7)
•=I
Let Uc
= {x:
fl.({t:
lx(t)i
> c}) < c}
be a basis of neighbourhoods of zero in L 0(Q, E, fl.). Since the set K is bounded, then for each c > 0 there is an s > 0 such that sK C Uc. Thus, by (3.6.7), sK1 C U 8c. The arbitrariness of c implies that the set 0 K1 is bounded.
Locally Pseudoconvex and Locally Bounded Spaces
143
Now we shall define integration with respect to an L 00 -bounded measure of scalar valued functions. Let (X, II II) be an F-space. Let M be an L 00 bounded measure taking its values in X. Let f be a scalar valued function. Let
M·(f) =sup{ II
J
gdMII: g being simple measurable u functions, lgl ~ 111}.
3.6.17 (Turpin, 1975). M ·(f) has the following properties. If l.hl ~.hi, then M ·(/1) ~ M ·(/2) ~+oo, (3.6.8.i) Iff is bounded, then limM·(if) = 0, (3.6.8.ii)
PROPOSITION
t--+0
Iff is measurable and M ·(f) = 0,
then f = 0 almost everywhere (3.6.8.iii) (i.e. except a set A such that M(A) = 0). If {In} is a sequence of measurable functions tending almost everywhere to J, then M ·(f)~ lim inf M · (fn). (3.6~8.iv) n--+oo
(3.6.8.v) M·(.h+.h) ~ M·(ft)+M·(_h), providedft,.h are measurable. Proof (3.6.8.i), (3.6.8.ii), (3.6.8.iii) are trivial. (3.6.8.iv). Let {fn} be a sequence of measurable functions tending to f almost everywhere. Let g be a simple measurable function such that lg(t)l ~ lf(t)l. Let 8 be an arbitrary positive number. Lets be an arbitrary number such that 0 < s < 1. Let I fn(t)l if g(t) =I= 0, gn(t) = olg(t)l if g(t) = 0.
I
Observe that {gn(t)} converges almost everywhere. Thus, by the Egorov theorem (Theorem 3.6.9) for each 'YJ > 0 there is a set A such that M(D"'A) < 'YJ and {gn} converges uniformly on A. Since g is a simple function, there is an 'YJ > 0 such that for each setH such that M(H) < 'YJ we have I\
JsgdMII <
H
8.
144
Chapter 3
Taking 1J and A as described above, we have II
JsgdMII ~II AJsgdMII +II JsgdM[I ~lim inf M · (/n)+e,
n
n~A
n~~
because, for sufficiently large n, lfn(t)l > lsg(t)l for tEA. The arbitrariness of e and simply (3.6.8.iv). (3.6.8.v). To begin with, we shall assume that ft and / 2 are simple. Let g(t) be an arbitrary simple measurable function such that lg(t)l ~ l.h(t)+};(t)l. Let gt(t)
=
J
l
g,(t) lft(t)j
~ft(t)l+l/2(t)l
if lft(t)l+lf2(t)l =fo 0, i = 1,2. if lfl(t)l+lf2(t)l = 0.
The functions g 1(t) and g 2(t) are simple and g(t) = gl(t)+g2(t).
Hence II
JgdMII~II nJgldMII+II nJg2dMII~M·(fl)+M·(.t;).
n
The arbitrariness of g implies
Suppose now that.ft and,/; are not simple. Then there are two sequences of simple mesurable functions {.h,n} and {h,n} tending almost everywhere to / 1 and}; and such that lfi.nl ~I AI, i = 1,2. Therefore, by (3.6.8.iv),
Let B(f) = (
~
limsup M· (ft.n+An)
~
supM ·(ft,n)+supM ·(h,n)
~
M ·(h)+M·(JJ.
n
n
JgdM: g simple measurable functions, n
0 igl
~Ill}
Locally Pseudoconvex and Locally Bounded Spaces PROPOSITION
145
3.6.18. The set B(f) is bounded if and only if
1imM ·(if) = 0.
(3.6.9)
~0
Proof If the set B(f) is bounded, then limM· (if)= lim (sup{llxll: x t--+0
E
B(tf)})
t-->-0
= lim(sup{llxll: x
E
tB(f)}) = 0.
(3.6.10)
t-->-0
Conversely, if (3.6.9) holds, then by (3.6.10) the set B(f) is bounded. 0 Let X denote the set of those /for which B(f) is bounded. By (3.6.8.v) and (3.6.9), M· (f) is an F-pseudonorm on X. We shall now use the standard procedure. We take the quotient space X/{f: M·(/)=0}. In this quotient space M ·(f) induces an F-norm. We shall take completion of the set induced by simple functions. The space obtained in this way will be denoted by D(D,E, M). Since, for each simple function g,
II
JgdM[J ~ M·(g).
{l
We can extend the integration of simple functions to a linear continuous operator mapping D(D,E,M) into X.
3.7.
INTEGRATION WITH RESPECT TO AN INDEPENDENT RANDOM MEASURE
Let (D0,E0,P) be a probability space. Let Q be another set and let E be a a-algebra of subsets of D. We shall consider a vector valued measure M(A), A E E, whose values are real random variables, i.e. belong to X= L 0(D0 1:0 P). We say that M(A) is an independent random measure if, for any disjoint system of sets {AI> ... , An}, the random variables M(At) EX, i = 1,2, ... , n are independent. We recall that a vector measure M is called non-atomic if, for each A E D such that M(A) =1=- 0, there is a subset A0 C A such that M(A 0) =1=- M(A).
Chapter 3
146
Let X(w) be a random variable, i.e. X(w) we denote Fx(t) = P({w: X(w) ~ t}). The function Fx(t) is non-decreasing, lim
E
L 0(£2 0 ,.E0 ,P). By Fx(t)
Fx(t)
= 0, limFx(t) = I.
t-+- ro
I->-+ ro
It is called the distribution of the random variable X(w).
Let Q = [0, 1], and let .E be the algebra of Borel sets. We say that a random measure M is homogeneous if for any congruent sets A 1 A 2 C C [0, 1] (i.e. such that there is an a such that a+A 1 = A2 (mod 1)) the random variables M(A 1) and M(A 2) have identical distribution. It is not difficult to show that, if M is a homogeneous independent random measure, then for each n we can represent M(A) as a sum M(A) = M(A 1)+ ... +M(An), where the random variables M(Ai), i = 1,2, ... , n, are independent and have the same distribution (Prekopa, 1956). Let X(w) be a random variable. The function +ro
fx(t) =
J
eits dF(s).
(3.7.3)
-ro
is called the characteristic function of the random variable X(w ). If the random variables X1 , ••• , Xn are independent, then fxi+ ... +Xn(t)
= fxit)· ··· -fxn(t).
(3.7.4)
Directly from the definition of the characteristic function !ax(t) =fx(at).
(3.7.5)
We say that a random variable X(w) is infinitely divisible if for each positive integer n there is a random variable xn such that X= Xn+ ... +Xn,
(3.7.6)
in other words, by (3.7.4). fx = (/xn)n.
(3.7.7)
If X is an infirute-divisible random variable, then its characteristic function/x can be represented in the form
fx(t) =
exp(iyt+
]"'(eitx_1- 1 ~xx2 ) 1 ~2x2 dG(x)),
-00
(3.7.8)
Locally Pseudoconvex and Locally Bounded Spaces
147
where y is a real constant, G(x) is a non-decreasing bounded function and we assume that at x = 0 the function under integration is equal to - t 2/2. This is called the Levy-Kchintchin formula (see for example Petrov (1975)). If X is a symmetric random variable (which means that X and -X have this same distribution), by (3.7.8) we trivially obtain co
fx(t)
= exp
J
l+u2 (costu-1)----zt2 dG(u).
(3.7.9)
0
Of course, without loss of generality we may assume that G(O) = 0. Suppose that M(A) is a non-atomic independent random measure with symmetric values. Then by (3.7.9) co
fM(t)
= exp
J
1+u2 (cos tu-1)----uz-dGA(u).
(3.7.10)
0
For an arbitrary real number a we obtain by (3.7.5) and (3.7.10) co
/aM(A)
=
exp
J
1+u2 (cos tu-1) ----zt2 dGA(u).
(3.7.11)
0
Let A 1 ,A 2 E I be two disjoint sets. By (3.7.4) (3.7.12) Formulae (3.7.11) and (3.7.12) imply that for a simple real-valued function h(s) fjh(s)dM(t) u
= exp(-
JTM(th(s))ds),
(3.7.13)
0
where (3.7.14) In the sequel we assume Q = [0, 1]. Now se shall prove some technical lemmas.
Chapter 3
148
Let co
UM(x) =
J
min ( xll,
-~ll) {1 +ull)dGM(u)
(3.7.15)
0
and for x
> 0,
(3.7.16)
for x =0. It is easy to see that the two functions Uy(x) and 'Py (x) are equal
to 0 at 0, continuous and increasing. LEMMA 3.7.1. For all x;;;: 0, a;;;: 0, there are positive numbers c1(a) and ell such that max TM(v)::::;;;c 1(a)UM(x) (3.7.17) O~v~ax
and 1
f TM(xt)dt ;;;: c UM(x).
(3.7.18)
2
0
Proof. Observe that
1-cosuv = 2sinll
z;;:::::;;;-} u v
2 2
and 1-cosuv:::::;;; 2. Hence, for c1{a)
=
max(2,-} all), we have
max (1-cosuv):::::;;; c1 (a)min(1,x2u2). O~v~ax
Therefore ( ) . ( ll 1 ) max 1-cosuv :::::;;; c1 a mm x , - 2 • 2
o,;;;v,;;;ax
U
(3.7.19)
U
Integrating (3.7.19) with respect to 1+ull dGy we obtain {3.7.17). ull Observe that sinz . (z, 2 1) 1---;;;: cllmm ,
z
Locally Pseudoconvex and Locally Bounded Spaces
149
where · ( mm . ( 1·- sinz) . z- 2( 1- sinz)) c2 =mm - , mm - . Z
Z>1
0
Z
Integrating TM(tx) with respect to t, we obtain 1 Joo( 1- sinxu) ~ 1+u2 dGM(u) J TM(tx)dt =
-xu
0
0
0 Observe that
Integrating by parts the second integral on the right-hand side, we obtain
J
1+u2 dGM(u)
1/z
J oc
00
~
= ~
GM(u) 2+u21oo +2 ~
1IX
1/X
GM(u) du ~
2'l'M(X).
Thus (3.7.20) On the other hand, integrating by parts both terms, we obtain
(3.7.21) Formulae (3.7.20) and (3.7.21) imply that the functions 'l'.lll(x) are equivalent at infinity.
u.~~~(x)
and
150
Chapter 3
3.7.2 (Urbanik and Woyczyiiski, 1967). Let G{u) be a continuous non-decreasing function such that G(O) = 0 and lim G(u) = 1. Let LEMMA
u-o-+oo
J 00
([>(x)
=
(3.7.22)
G;;) du.
1/X
Then the function ([>(yx) is concave. Proof We apply a change of variable v = l/u 2 in formula (3.7.22), and obtain ([> (yx) =
f G~~) jG( ylv) du =
1/y;
dv.
0
Thus the derivate of ([>(yx) is equal to G(I/yx). It is non-increasing, since G is non-decreasing. Therefore the function ([>(yx) is concave. D 3.7.3 (Urbanik and Woyczyiiski, 1967). Let {In} be a sequence of simple measurable functions belonging to L 0 [0, 1]. The sequence
LEMMA
1
Jfn(s)dM(s) tends to 0 in L [0, 1] 0
0
if and only if 1
J'l'M(/fn(s)l)ds = 0.
lim
n-+oo 0
Proof We shall use the classical statement that a sequence {hn} of functions belonigng to L 0 [0, I] tends to zero in L 0[0, I] if and only if the logarithms of its characteristic functions tend uniformly to 0 on 1
each compact interval. Thus by (3.7.13) {
Jfn(s)dM(s)} tends to zero in 0
1
L 0 [0, 1] if and only if { jTM(fn(s))ds} tends to Ouniformly on each como
pact interval [0, T]. 1
If~
JTM(tfn(s))ds} tends uniformly on each compact interval, then 0
1
lim
1
J JTM(ifn(s))dtds =
n-oo 0
0
1
lim ~oo
1
J JTM(ifn(s))dsdt = 0
0
0.
Locally Pseudoconvex and Locally Bounded Spaces
151
Hence by (3.7.18) 1
lim
JUM(Ifn(s)l)ds = 0.
(3.7.23)
n-+oo 0
Since UM(x) and IJfM(x) are equivalent at infinity, 1
lim
J'PM(Ifn(s)l)ds = 0.
(3.7.24)
x--+co 0
Conversely, if (3.7.24) holds, then (3.7.23) holds. By (3.7.17) we find 1
that { JrM(tfn(s))ds} tends to Ouniformly on each compact interval. 0 0
THEOREM 3.7.4 (Urbanik and Woyczyiiski, 1967). Le M be a symmetric homogeneous independent random measure with values in the space L 0[0, 1]. Then there exists a continuous function N(x) defined on [O,+oo) such that N(O) = 0, N(J./i) is concave and such that the set of all real 1
functions for which the integral J fdM exists is the space N(L). 0
Conversely, if N(yx) is a concave continuous function such that N(O) = 0, then there is a symmetric independent homogeneous random measure M with values in the space L 0 [0, 1], such that the set of real val1
ued functions f for which the integral J fdM exists is precisely the space 0
N(L). Proof The first part of the theorem follows immediately from Lemmas 3.7.2 and 3.7.3. Conversely, if N(yx) is concave, then it can be represented in the integral form
N(yx) = J q(u)du, 0
where q(u) is a non-increasing function. We put G(O) = 0 and G(x) = min(l,q(1/x2)) for x > 0. Let M be a symmetric independent homogeneous random measure such that
152
Chapter 3
(3.7.10) holds. To complete the proof it is enough to show that the functions N(x) and :~:,
00
NG(x)
J G~~)
=
du
=
1/Z
J
min (I ,q(u))du
0
are equivalent at infinity. Since q(u) is non-increasing, q(u) ~ q(1) for u > 1. Thus z
1
<1:
N(y'X)
Jq(u)du = Jq(u)du+ Jq(u)du = Jq(u)du+q(1) J min(I,q(u))du
=
0
0
1
z
1
0
1
~ K+CNG(yx). 1
where K =
Jq(u)du and C =
q(1).
0
On the other hand, trivially NG({x) ~ N(y'x).
0
Woyczynski (1970) extended this result to the case where M(A) take values in the product space L 0 (D 0 ,E0 ,P) X ... XL0 (!J0 ,E0 ,P) and f(s) is n..times
a matrix function.
3.8. UNCONDITIONAL CONVERGENCE OF SERIES
Let Q = N be the set of all positive integers. Let ~ be the algebra of all subsets of N. Let M be a vector measure defined on A E E taking its values in an F-space (X, II II). Let Xn = M({n}). Since M is a vector 00
measure the series
2
Xn
has the property that for each sequence
en
n=1 00
taking values ·either 0 or 1 the series
2 en x~ is convergent. The series n=1
with this property are called unconditionally convergent series. Thus
Locally Pseudoconvex and Locally Bounded Spaces
153
we have shown that each vector measure on N induces unconditionally convergent series. But the converse is also true. Namely, each unconditionally convergent series }; Xn induces a vector measure by the formula n=l
M(E)=};
Xn.
neE
PROPOSITION
3.8.1. The measure M induces by an unconditionally concc
vergent series };
Xn
is compact (and thus bounded).
n=l 00
Proof Since the series };
Xn
is unconditionally convergent, for each
n=l
e > 0 there is an index N such that for each sequence either 0 or 1 00
l
2;
BnXn
n=.N+l
I<
{en}
taking values
(3.8.1)
e.
.N
Thus the finite set };
e11 Xn,
where {e1 ,
••• ,
en}
runs over all finite systems
n=l
taking values either 0 or 1, constitutes an e-net in the range of the meas-
D
~M 00
THEOREM
3.8.2 (Orlicz, 1933). A series};
Xn
is unconditionally convergent
n=l
jf and only if for each permutation p(n) of positive integers the series 00
2 Xp(n) is convergent. ft=l 00
Proof Suppose that the series .for each e
>
2
Xn
is unconditionally convergent. Then
n=l
0 there is an index N such that
k+m
IIJ:
enXn
.n=k
fork> N, m
>
I<
e
0 and Bn taking the value either 0 or I.
Chapter 3
154
Let K be such a positive integer that, for n arbitrary r > K and s ;;::;: 0 r+s
II~ Xp(n) I! = n=r
>
K, p(n)
>
N. Then for
q
114 I < 8 tXt
(3.8.2)
8•
•=p
where p = inf {p(n): r ~ n ~ r+s}, q =sup {p(n): r ~ n ~ r+s}, t = {1 if i = p(n) (r ~ n ~ r+s), 8 0
otherwise.
The arbitrariness of 8 implies that the series
2"'
Xp(n)
is convergent.
n=l
Suppose now that the series 2"'
Xn
is not unconditionally convergent.
n=l
This means that there are a positive number tJ and a sequence {8n}, taking the value either 1 or 0 and a sequence of indices {rk} such that r•+l
il ~
8 nXn n=r•+l
8
I > J.
Now we shall define a permutation p(n). Let m be the number of those 8n, n = rk+ 1 , ... , rk+I• which are equal to 1. Let p(rk+v) = n(v), where n(v) is such an index that 8n(v) is a v-th 8i equal to 1, rk < i ~ rk+I• Q < v ~ m. The remaining indices rk < n ~ rk+1 we order arbitrarily. Then r.+m
r•+l
n=r•
n=r.+l
II~ Xp(n)ll =II~
This implies that the series
8
nXnll >
J.
2"'
is not convergent.
xp(n)
D
n=l
A measure M induced by a series "'
2
Xn
is L"' -bounded if and only if
n=l
for each bounded sequence of scalars {an} the series 2"'
anXn
is con-
n=l
-vergent. The series with this property will be called bounded multiplier convergent.
Locally Pseudoconvex and Locally Bounded Spaces
155
THEOREM 3.8.3 (Rolewicz and Ryll-Nardzewski, 1967). There exist an 00
F-space (X,
II II) and an uncoditionally convergent series}; Xn
of elements
n=1
of X which is not bounded multiplier convergent.
The proof is based on the following lemmas. LEMMA 3.8.4. Let X beak-dimensional real space. There exists an open symmetric starlike set A in X which contains all points PI> ... , p 3k of the type (e~> ... , ek), where ei equals 1 or 0 or -1, such that the set Ak-1 =A+ ... +A (k-1)-fold
does not contain the unit cube C=
{(a1,
... ,
ak):
lail <
1, i = 1,2, ... , k}.
Proof Let A 0 be the union of all line intervals connecting the point 0 with the points PI> ... , Ps•· Obviously the set A~- 1 is (k-1)-dimensional. Therefore there is a positive number e such that the set (A 0 +A.)k-\ where A. denotes the ball of radius e (in the Euclidean sense), has a volume less than 1. Thus the set A= A 0 +A. has the required property. D
LEMMA 3.8.5. There is a k-dimensional F-space (X, II II) such that IIPill ~I, i = 1,2, ... , 3k and there is a point p of the cube C such that IIPII;;:, k-1. Proof We construct a norm II II in X in the way described in the proof of Theorem 1.1.1, putting U(l) =A. Since PtE A = U(I), IIPill ~ 1. Furthermore, since Ak- 1 = U(k-I) does not contain the cube C, there is a point p E C such that p E U(k-1). This implies that II PII ;;:, k-1. D Proof of Theorem 3.8.3. We denote by (Xk, space constructed in Lemma 3.8.4. Let 1
II
II~) the 2k dimensional
'
llxllk = 2k llxllk· Let X be the space of all sequences a
= {an} such that
00
lllalll
=}; ll(a2•-•+t• ... , a2~)/lk-1+la1l <+oo. k=l
Chapter 3
156
It is easy to verify that X is an F-space with the norm
Ill Ill. Let
(0,0, ... , 0, 1,0, ... )
Xn =
n-th place
and let {en}' be an arbitrary sequence of numbers equal either to 0 or to 1.
,2; e
The series
11
x 11 is convergent. Indeed,
n=l r
IIIL
Ill~ Ill Yo 111+111 Yk+llll+ ... +Ill Yk'III+IIIY~III,
1
BnXn n=m
where k is the smallest integer non-greater than log 2 m, k' is the largest less than log2 r, and 2•
,2;
Yo =
BnXn,
n=m 2i
YJ =
,2;
j=k+1, ... ,k',
BnXn, n=2J-'+l r
Yo= . : : ,_; I
\'
BnXn.
n=2•'+1
In virtue of Lemma 3.8.5 1
IIIYolll ~ 2k-l ' 1
IIIYJIII ~ 2i-l ' '
1
II!Yolll ~lk'.
j = k+1, ... , k'
.
Therefore r
~~~~ n=m
k'
BnXnlll
~2
i=k-1
;i < 2L2 ~ ! ' w
00
and the series
,2;
BnXn
n=l
ditionally convergent.
is convergent. Thus the series
,2; n=l
Xn
is uncon-
Locally Pseudoconvex and Locally Bounded Spaces
151
On the other hand, as follows from Lemma 3.8.5, for each k there is a point ak E Xk, ak = (a2k+1• ... , a2k+1), SUCh that latl < 1, i = 2k+ 1, •.. , 2k+1 and
Let bn =an, n
= 1,2, ... The sequence {bn} is bounded and
2t'+l
Illn=2k+1 }; bnxnlll =
llakllk
>
+·
00
Therefore the series }; bnxn is not convergent. This implies that the n=l 00
series };
Xn
is not bounded multiplier convergent.
D
n=l
Observe that the measure M induced by an absolutely convergent 00
series };
Xn
which is not bounded multiplier convergent is bounded, but
n=l
is not L 00 -bounded. Turpin (I 972) constructed a non-atomic measure with this property.
3.9.
INVARIANT A(X)
We shall prove the results of Turpin (1975), however restricting ourselves to the metric case. Let (X, II II) be an F-space. By A(X) we denote the set of such sequences {An} that the space X has property P({A.n}), i.e. for any neighbourhood of zero U there is a neighbourhood of zero V such that (3.9.1)
Of course, by definition, A (X) always contains all sequences with finite support, i.e. sequences of the form A= {A.1 , A2 , ... , A.n, 0, 0, ... }. If A (X) contains a sequence with an infinite support, in other words : if there is a sequence A= {An}, An> 0 belonging to A(X), we say that the space X is strictly galbed.
Chapter 3
158
3.9.1. Let (X, II II) be an F*-space. Then the set A(X) is equal to the set of all such sequences {A.n} that, for any bounded sequence {xn} C X, the sequence
PROPOSITION
N
{YN}
= {}; AnXn}
(3.9.2)
i=l
is bounded. Proof Necessity. Let {A.n} e A(X). Let U be an arbitrary neighbourhood of zero. By the definition of A(X) there is a neighbourhood zero V such that (3.9.1) holds.
Let {xn} be an arbitrary bounded sequence. Then there is a b > 0 such that Xn e bV, n = 1,2, ... Thus, by (3.9.1) YN E bU, N = 1,2, ... Since U is arbitrary, the sequence YN is bounded. Sufficiency. Suppose that {A.n} ¢ A(X). This means that there is a neighbourhood of zero U such that (3.9.1) does not hold for any neighbourhood of zero V. This implies that for an arbitrary neighbourhood of zero V and an arbitrary positive integer n (3.9.3)
A.nV+A.n+ 1 V+ ... ¢ U.
Now we shall choose a sequence of elements {xn} and an increasing sequence of indices {nm} in such a way that i
=
(3.9.4)
nm+l, ... ,nm+l,
(3.9.5)
Such a choice is possible since (3.9.3) holds. The sequence {xn} tends to 0 by (3.9.4), thus it is bounded. On the other hand by (3.9.5) the sequence
{zm}
=
{A.nm+!Xnm+l+ ... +A.nm+IXnm+I}
is not bounded. This implies that the sequence {YN} is not bounded either. 0 PROPOSITION
3.9.2. lf{A.n}eA(X)
and0~p. 11 ~An,
n= 1,2, ... , then
{P.n} E A(X). Proof It follows immediately from the definition of A(X).
0
Locally Pseudoconvex and Locally Bounded Spaces
159
PROPOSITION 3.9.3. Let {A.i} e A(X). Let!., be a sequence of non-empty finite disjoint subsets of the set of positive integers. Let
Then {.Un} e A(X). Proof. Let {x.,} be an arbitrary bounded sequence. Let
, {x., Xi =
for i e /.,, elsewhere.
0
The sequence {rn} is of course also bounded. Then the sequence N
{YN}
= {};
N•J
,Unxn} =
n=l
{}; }; n=l
Atx;}
iEln
is bounded.
D
3.9.4. Let {-1.,}, {.Un} e A(X) and let (nt,m;) be a double sequence with terms not equal to one another. Then the sequence {vi} = {An,·.U,..} E A(X). Proof. Let {xi} be an arbitrary bounded sequence. Then PROPOSITION
N
YN
N
= }; VtXi = }; An,,llm, X~ t=l
t=l
p
~};An (2; ,llmXin,m)' n=l
where p
=
(3.9.6)
m
max nt and the summation with respect to m is taken over IEO;i~N
all m for which there is an index i = i.,, m ~ N such that (n;, mt) = (n, m). = }; ,UmXtn,m, is bounded. Therefore the sequence The set {y:},
y:
m
{YN} is also bounded.
D
COROLLARY 3.9.5. If an F*-space (X, II II) has property P({qn}) for a certain q, 0 < q < 1, then in the space X bounded multiplier convergence and unconditional convergence are equivalent.
+t}
Proof. We shall show that if {qn} e A(X), then {(
e A(X). Indeed
let (nt,mt) be such a double sequence that (nt+mt) is a non-decreasing
Chapter 3
160
sequence and the sequence (nt,mt) contains all pairs (n,m). Let An
=
qn
=
fln·
It is easy to verify that An.flm, = qn•+m• has the same order of growth as
qv'n. Then {qv'n} E A(X). Since lim (_!_)n q-vr. = 0, by Proposition 3.9.2 '11--->-00
{(~f}eA(X).
2
Theorem 3.6.11 implies the corollary.
D
PROPOSITION 3.9.6. A(X) is an invariant of isomorphisms. Proof An isomorphism maps bounded sets onto bounded sets, and the inverse also maps bounded sets onto bounded sets. Thus by Proposition 3.9.1 A(X) is an invariant of an isomorphism. D PROPOSITION
3.9.7. Let Y be a subspace of an F*-space X. Then
A(Y):) A(X).
Proof Let {.An} E A(X). Let {xn} be an arbitrary bounded sequence in Y. Then it is also a bounded sequence in X. Therefore the sequence N
{YN} = {
.J.: AnXn} n=l
is bounded. This implies that {.An}
E
A(Y).
D
3.9.8. A(X) c [1. Proof. Each space X contains a one dimensional subspace X 0 • Since A(X0 ) = [1, by Proposition 3.9.7 the corollary holds. D CoROLLARY
3.9.9. Let a continuous linear operator T map an F-space X onto an F-space Y. Then PROPOSITION
A(Y):) A(X).
Proof Let {.An} E A(X). Let U be an arbitrary neighbourhood ofzero in Y. The set T- 1( U) is open. Then there is a .neighbourhood of zero V in the space X such that
A1V+A.2 V+ ... C T- 1(U). then
Locally Pseudoconvex and Locally Bounded Spaces
161
By the Banach theorem (Theorem 2.3.1) the sets T(V) are open. The arbitrariness of Uimplies that{A.n} e A(Y). D As an immediate consequence of Propositions 3.9.6, 3.9.7 and 3.9.9 we obtain THEOREM
3.9.10. If
dimz
X~
dimz Y
(codimz X~ codimz Y),
then A(X)~A(Y).
PROPOSITION 3.9.11. If X is a locally p-convex space, then
A(X) ~ lP. Proof Let {llxllm} be a sequence of p-homogeneous pseudonorms determining the topology. Let {xn} be a bounded sequence in X. Let
llxnllm·
Mn =sup n
Let co
C=
};
IA.niP ·
n=l
Let N
YN
=}; AtXt. i=l
Then co
IIYNiim ~}; IA.tiP llxtllm ~ CMm.
(3.9.7)
D
i=l
CoROLLARY 3.9.12 (compare Mazur and Orlicz, 1948). If an F*-space X is locally convex, then A(X) = [1, PROPOSITION 3.9.13. Let X be a locally pseudoconvex space. Then A(X)~ /P.
n
p>O
Chapter 3
162
Proof Let {A.J
n
E
[P.
Let {llxJim} be a sequence of Pm-homogeneous
p>O
pseudonorms determining the topology in X. Let w
Cm = } ; IA.tJPm • i=l
Taking Xn and YN as in the proof of Proposition 3.9.11 we obtain an estimation similar to estimation (3.9.7)
IIYNIJm ::=;:;: CmMm. 0
This implies the proposition.
Now we shall prove propositions converse to Propositions 3.9.11, 3.9.13. PROPOSITION 3.9.14. (cf. Metzler, 1967). If A(X)) [P, then the space X is locally p-convex. Proof Suppose that an F*-space (X, II JJ) is not locally p-convex. Then there is a positive number e such that for any m there are points {Xm, 1 , ••• ... , Xm, km} such that i
= 1,2, ... , km,
(3.9.8)
and (3.9.9) Let for n, k 1 + ... +km-1
1 < n ::=;:;: k 1 + ... +km, let An--=----=-=--.---2mkl/Pm m
2mxm,t, where i = n-(k1 + ... +km-1). Since (3.9.8), the sequence {xn} tends to 0, and thus it is bounded. On the other hand, by (3.9.9) the sequence Xn =
N
{YN}
= {
.2; Anxn} n=l
is not bounded. Therefore {..1.n} does not belong to A(X). Since {..1.n} E /11, A(X) does not contain /P. 0
Locally Pseudoconvex and Locally Bounded Spaces
n
PROPOSITION 3.9.15. If A(X) :::>
163
/P, then the space X is locally pseudo-
P>O
convex. Proof The proof follows the same line as the proof of Proposition 3.9.14 if we replace, in the definition of A.n and in formula (3.9.9), p by
Pm tending to 0.
D
As follows from Proposition 3.9.15, locally pseudoconvex spaces are stricly galbed. There are also non-locally pseudoconvex spaces which are strictly galbed, as follows from PROPOSITION 3.9.16 (Turpin, 1975). For any sequence {..1n} belonging to all spaces lP (in a particular case for any geometric sequence qn, 0 < q < 1), there is a non-locally pseudoconvex space X such that {A.n} e A(X). co
Proof Let Cn
= }; IA.tl 1/n. Let X be the space of all sequences x = {xn}. i=l
such that Xn e L 1fn[o, 1] and for all positive integers k c~
lim
llxnllvm[o,l] = 0.
We introduce a topology in X by a sequence of F-pseudonorms llxllk = s~pc!llxnllvrn 10, 11 • It is easy to verify that X is an F-space. The space X is not locally pseudoconvex. Indeed, let Xn = {x eX: Xi= 0 for i =F n }. The space Xn is isomorphic with L lfn[o, 1]. Take any neighbourhood of zero Uin X such that U::PXn, n = 1,2, ... By the definition of topology in X, this is possible. Then the modulus of concavity of U can be estimated as follows c(U)
~
c(UnXn)
~
c(Xn) = 2n,
n
= 1,2, ...
Thus c( U) = +oo. This implies that X is not locally pseudoconvex. On the other hand, let U be an arbitrary neighbourhood of zero in X. U contains a neighbourhood of zero U0 of the form U0
= {x: llxllk < e}.
Let V = {x: llxiiHI
< e}. co
Let JI, Y2• .•. E V, Yi = Yi, n• Let X = •
1: A.,y,. i=l
164
Chapter 3
Then 00
1\x\\ =
supc~ //}; AtYt, n//v,• n
i~1
~ supc~}; \A.t\ 11n 1\Yi, n\\L•I•[O,J] n
i~1
~ supc~+ 1 sup\IY«,n\\L•I•[o,1J n
Therefore x
E
i
U and {An}
E
<e.
A(X).
There are non strictly galbed spaces, as follows from 3.9.17. Let (D,E,p) be a measure space. Suppose that the measure f1 is not purely atomic (i.e. there is a set D 0 such that the measure f1 restricted to the set D 0 is a non-atomic measure which does not vanish identically). Then the space L 0(D,E,p) is not strictly galbed. Proof According to our hypothesis about the measure, we can find D 0 , O
+
11-+00
and 00
D0 C
U En
(3.9.11)
forK= 1,2, ...
n~K
Let {An} be an arbitrary sequence of positive numbers. Let n Xn
= An XEn•
By (3.9.10), {xn} tends to 0, and thus it is bounded. On the other hand, • the seque6ce N
YN(t) = };..tnxn(t) "~1
tends to infinity for
t E
D 0 • Thus it is not bounded.
3.9.18. Let X be the space l{P•}, 0 x = {xn} such that PROPOSITION
00
1\x\1 = }; \xn\P• n~1
< +oo,
D
< Pn ~ 1, of all sequences
Locally Pseudoconvex and Locally Bounded Spaces
165
with a topology given by the F-norm //xll. If p,-+0, then the space X is not strictly galbed. Proof Let {A.n} be an arbitrary sequence of positive numbers. Since p 11 ~0, for each n we can find an index k(n) such that A.~Jc
n=l
divergent. It is obvious that the sequence {x11 } = {~11 e11 }, where {e11 } denotes the standard basis in l{Pn}, tends to 0. Thus it is bounded. On the other hand, N
1/YN/1
N
=112: Anxn// =}; 1/A.nXn/1 n=l n=l
+,}; N
~
n=l
~ 11Pk(n) ~00. N
Therefore the sequence YN =}; A.11 x 11 is not bounded. This implies
n=l
that {A.n} ¢ A(X).
D
3.10. C-SEQUENCES AND C-SPACES
The following .notion of C-sequences is related to bounded multiplier convergence. We say that a sequence {xn} of elements of an F-space X is a C-sequence if for any sequence of numbers {t11 } tending to 0 the series 00
}; t 11 x 11
is convergent. Of course, a subsequence of a C-sequence is a
n=l
C-sequence, and the image of a C-sequence by a continuous linear operator is also a C-sequence. PROPOSITION 3.10.1. A sequence {x11 } of elements of an F-space (X, is a C-sequence if and only if the set 00
A= {}; anxn: /an/~ 1, n = 1, 2, ... } n=l
is bounded.
•
1/ //)
-Chapter 3
166
Proof. Sufficiency. Suppose that the set A is bounded. Let {en} be an arbitrary sequence of numbers tending to 0. Let Cn =sup JctJ. Of n~i
course, {C11 } also tends to 0. Let e be an arbitrary positive number. Since the set A is bounded, there is an index N 0 such that for n > N 0
JJCnxJJ <
(3.10.1)
B
for all x EA. Thus for n, m, N 0 < n < m,
since
Necessity. Suppose that the set A is not bounded. Then there are a sequence of numbers {tn} tending to 0, a sequence of numbers {an}, lanl ~ 1, and a sequence of indices {nk} such that the sequence n•+l { fk
};
GnXn}
does not tend to 0.
n=n•+l Let Cn
=
{~an
for nk < n ~ nk+I• elsewhere. 00
The sequence {en} tends to 0, but the series Therefore, the sequence
{xn}
2
CnXn
is not convergent.
n=l
is not a C-sequence.
D
An F-space X is called a C-space if for any C-sequence {Xn} the series 00
2
Xn n=l
is convergent. As an example of an F-space which is not a C-space
we can consider the space c0 (see Example 1.3.4.a). Indeed, the standard 00
basis {e11 } in c0 is a C-sequence, but the series
2 en is not convergent. n=l
A subspace of a C-space is also a C-space. Therefore, if an F-space X contains a subspace isomorphic to c0 , then X is not a C-space.
Locally Pseudoconvex and Locally Bounded Spaces
167
Now we shall prove the following THEOREM 3.I0.2 (cf. Bessaga and Pelczynski, I958). Let X be an F-space with a basis {en}· If X is not a C-space, then X contains a subspace isomorphic to the space c0 • The proof is based on the following PROPOSITION 3.10.3 (Schwartz, 1969). Let (X, II II) be an F-space such that each C-sequence tends to 0. Then X is a C-space. Proof Suppose that X is not a C-space. Let {xn} be a C-sequence such 00
that the series
2
Xn is not convergent. Then there are an increasing
n~l
sequence of indices nk and a positive number /J such that IIYkll
> IJ, where
nk+t
Yk
=
.2.)
Xn.
n~n•+l
The sequence {Yk} is also a C-sequence, and it does not tend to 0. Proof of Theorem 3.10.2. If (X,
II II) is not a C-space, then there is a
0 C-se-
CD
quence {xn} such that the series
2 Xn
is not convergent. Basing our-
n~I
selves on Proposition 3.10.3, we can assume without loss of generality that the sequence {xn} does not tend to 0. Let {fk} be basis functionals corresponding to the basis {ek}. Since {xn} is a C-sequence, {fk(Xn)} are C-sequences for k = I ,2, ... Hence lim fk(Xn) = 0,
k =I, 2, ...
(3.I0.2)
.,_..00
By Theorem 1.2.2 we may assume that the norm II II is non-decreasing. Since {xn} does not tend to 0 and (3.10.2) holds~ we can find a subsequence {xflp} = {zp}, a positive number/Jand an increasing sequenceofindices {np} such that · '
1
llzp-Zpll < 2p IJ.
(3.I0.3)
Chapter 3
168
where n,+,
2,;
z~ =
fn(zp)en.
n=np+l
Corollary 2.6.6 implies that {z~} is a basic sequence. We sp.all show that it is equivalent to the standard basis of c0 • Let {tp} be a sequence of coefficients of x belonging to X 0 =lin {z~} with respect to the basis {z~}. Since //z~ll > 6/2, the sequence {tn} tends to 0. On the other hand, (zp} is a C-sequence. Therefore, by (3.10.3), {z~} is also a C-sequence. co
This means that if tn-+0, then the series}; tpz~ is convergent. Therefore, p=l
the basis z~ is equivalent to the standard basis of c0 • Thus, by Theorem 2.6.3, the space X 0 is isomorphic to the space c0 • D PROPOSITION 3.10.4. Let (X, II II) be a locally bounded space. with a basis {en}. Let Y be a subspace of the space X. Suppose Y is not a C-space. Then the space Y contains a subspace Y0 isomorphic to the space c0 • Proof Without loss of generality we may assume that I II is p-homogeneous. Using the same construction as in the proof of Theorem 3.10.2, we find elements {zp} and {z~}. By formula (3.10.3) and Theorem 3.2.16 the sequence {zp} is a basic sequence. The rest of the proof is the same as in Theorem 3.10.2. D Let X be a non-separable F-space. If Xis not a C-space, then it contains an infinite dimensional separable subspace X which is not a c~space. Indeed, if X is not a C-space, then there is a C-sequence {xn} such that 00
the series };
Xn
is not convergent. Let
X= lin{xn}. The space X has the
n=l
required properties. By the classical theorem of Banach and Mazur (1933), space C[O, I] is universal for all separable Banach spaces. The space C[O, 1] has a basis (Example 2.6.10). Thus we have PROPOSITION 3.10.5 (Bessaga and Pelczynski, 1958). If X is a Banach .space which is not a C-space, then X contains a subspace isomorphic to c0 • Now we shall prove
Locally Pseudoconvex and Locally Bounded Spaces
THEOREM 3.10.6 (Schwartz, 1969). The spaces LP(D,E,p), 0 ~ p are C-spaces.
169
< +oo,
The proof is based on the following propositions. PRoPOSITION 3.10. 7 (Kolmogorov-Kchintchin inequality ; see also Orlicz, 1933b, 1951, 1955). Suppose that in the space L 0(D,E,p,) a C-sequence {x,.(t)} is given. Then on each set D 0 of finite measure the series 00
}; lx,.(t)l 2 convergent almost everywhere. n=l
Proof(Kwapien, 1968). Let {r,.(s)} = {sign(sin2n211s)} be a Rademacher system on the interval [0, 1]. Since under our hypothesis {x11 (t)} is a C-sequence, the set of elements
"
{ Yn,s(t)
=}; rt(s) Xt(t):
n = 1, 2, ... , 0
~ s ~ 1}
i=l
is, by Proposition 3.10.1, bounded in the space L 0 (D,E,p). This implies that for any positive B there is a constant C such that, for all n = 1,2, ... and all s, 0 ~ s ~ 1, ~t({te
D 0 : IYn,s(t)i ~ C}) ~ ~t(D0)-B.
(3.10.4)
Let n be fixed al!d let
At= {s: IYn,s(t)i ~ C}.
(3.10.5)
By the Fubini theorem and (3.10.4) we find that the set E of those t for which the Lebesgue measure IAel of the set At is greater than l-ye has a measure greater than ~t(D0)-ye, i.e. if E
= {t e D0 : jAel
~
2-y'e},
then ~t(E) ~ ~t(D 0)-ye.
Lett e E. Formula (3.10.5) implies n
JI}; rt(s) Xt(t)r ds ~ C
Ao
i=l
2•
Chapter 3
170
Thus n
J _2/xt(t)/ 2 -2 J ( _2 A, i=l
A,
Re(xt(t)x,(t))rt(s) r;(s)) ds
~ C2 •
(3.10.6)
l~i<j~n
Applying the Schwarz inequality to (3.10.6), we obtain n
C ;;?: (1-y'B)}; /xt(t)/ 2 2
i=l
-2 (
_2
/xt(t)x1(t)J2) 112 (
l~i<j~n
_2
( Jrt(s)r1(s)dsrf' 2.(3.10.7)
l~i<j~n
A,
Since rt is a Rademacher system, J rt(s) r;(s)ds = A•
(3.10.8)
J ri(s) r,(s)ds, 1'\..A•
where I denotes the interval [0, 1]. The system {ri(s)rJ(s)}, 1 ~ i <j, is an orthonormal system in the space £2[0, 1]. The Fourier coefficients of the characteristic function X['\..A• of the set /~At are equal to fri(s)r,(s)ds, thus equalto- Jri(s)rJ(s) 1'\..A•
A,
ds, by (3.10.8). Therefore, by the Parseval inequality. _2
(
l~i<j~n
f rt(s) r,(s)dsr ~/!"'At/ <{e.
(3.10.9)
A•
Observe that
( l,
/xt(t)x,(t)/ 2
l~i<j~n
n
= ( };Jxt(t)/ 2 i-1
tt =
f'
2
~
(
_2 l~i,j~n
/xt(t)x1(t)J 2
f'
2
n
(3.10.10)
};Jxt(t)/ 2 • i~l
Formulae (3.10.7), (3.10.9), (3.10.10) imply n
(1-y'e -2tJe) _2/xt(t)/ 2 ~ C 2 •
(3.10.11)
i=l 00
Formula (3.10.11) implies that the series 2;/xi(t)/ 2 is convergent on the i=l
171
Locally Pseudoconvex and Locally Bounded Spaces
set E. Since p(E) > p(.Q0)-yc, the arbitrariness of 'e implies that the D series is convergent almost everywhere on .Q0 • 3.10.8. Let Then {xn} tends to 0.
CoROLLARY
{x11 }
be a C-sequence in the space LO(.Q,E,p).
LEMMA 3.10.9 (Schwartz, 1969). Let {x11 } be a C-sequence in a space LP(.Q,E,p), 0
represent the set .Q in the form .Q
=
U
Dt u N, where, on the set N,
i~I
all functions x 11 (t) are equal to 0 almost everywhere, .Q~, C .Qi+I• and for each i the sequence of functions {x 11(t)} tends uniformly to 0 on Dt. Suppose that the sequence {x 11 (t)} does not tend to 0 in LP(.Q,E,p). Then there is a positive number b' such that, for infinitely many n, J/xn(t)/Pdp
> b'.
Q
Let 0 < b < b'. We shall construct by induction a sequence of disjoint sets {Ak}, k = 1,2, ... , and increasing sequences of indices {nk}, {mk} such that Ak C Dm. and
J/x .(t)/P dp > b, 11
A•
(3.10.12)
forj=/=k.
Let n0 be an arbitrary index such that
J /x D
is an index m 0 and a set A 0 C Dm0 such that
110
(t)/ Pdp > b. Then there
J /x
110
(t)/Pdp >b. Suppose
A,
that Ak, nk, mk are defined for k
=
0,1, ... , r-1. Then there is an index
m~ and a set Br C Dm'T such that Ak C Br for k
k
= 0, 1, ... , r-1 and
= 0, 1, ... , r-1.
Since Br C !Jm'T and the sequence {x11(t)} tends uniformly to 0 on !Jm',T
172
Chapter 3
there is an index n,.
> nr-1 such that
Jlxnlt)l dp ~ 2~,
Br
and
J lxnr(t)IP dp >b.
(3.10.13)
t:J"-Br
Formula (3.10.13) implies that there is an index m, and a set A, C Qmr disjoint with the sets A 0 , ••• , Ar-1 such that
Jlxnr(t)IPdp >b.
(3.10.14)
Ar
In this way we have constructed by induction the required sequence. Let {en} be a sequence of positive numbers tending to 0 such that co
,2;c: = +oo.
(3.10.15)
n=1
Then r
r
r
f\2: CkXn.(t)\P dp ~ 2 J12: CkXn.(t)\p dp (J
k=O
j=O A1
r
k=O
r
J(cJixnlt)IP- L cflxn.(t)IP)dp
~};
j=OA1
k=O k#j
r
~b
2
j=O
r
cJ- C
2 2;~k
j,k=O
r
~ b}; cJ-4C,
(3.10.16)
;~o
where C =sup c!. n co
Then, by (3.10.15), the series}; Ck xn. is not convergent in LP(Q,E,p). k=1
Therefore, {xn} is not a C-sequence and we obtain a contradiction.
0
LEMMA 3.10.10 (Schwartz, 1969). If {xn} is a C-sequence in a space LP(Q,E,p), 1 ~p <+oo, then Xn-+0.
Locally Pseudoconvex and Locally Bounded Spaces
173
Proof The proof is the same as the proof ofLemma3.10.9, but in (3.10.16) the Minkowski inequality is used. D Proof of Theorem 3.10.6. The proof is a trivial consequence of Proposition 3.10.2 and Lemmas 3.10.9, 3.10.10. 0 3.10.11. The space LD[O, 1] is not universal for separable F-spaces. Proof The space L 0 [0, 1] is a C-space. Hence it does not contain a subspace isomorphic to c0 • D CoROLLARY
The notions of C-sequences and C-spaces introduced by Schwartz (1969) are similar to what Matuszewska and Orlicz (1968) called condition (0). . A sequence {Xn} of elements of an F-space X is called perfectly bounded if the set N
A0 = {
.2;
Xpn:
Pn runs over all finite increasing systems of
n=l
positive integers} is bounded. An F-space X satisifies condition (0) if each perfectly bounded sequence is unconditionally convergent. It is easy to verify that for F-spaces satisfying condition (0) Theorem 3.10.2 holds. Therefore, if an F-space X can be imbedded into an F-space with a basis, then X is a C-space if and only if it satisifies condition (0). Matuszewska and Orlicz (1968) showed that a large class of modular spaces (in particular, spaces N(L(Q,E,p))) satisfy condition (0).
3.11.
LOCALLY BOUNDED ALGEBRAS
Let X be a linear space. We say that X is an algebra if there is an operation·: xxx~x, called multiplication, which is associative (x·y)·z
=
x·{y·z),
x,y, zeX
(3.11.1)
174
Chapter 3
and bilinear (x1+x2)·y = X1·y+x2·y,
(3.11.2)
X·(JI+Y~
= X·Y1+X·Y2
(3.11.3)
= t(x·y) = x·(ty)
(3.11.4)
(tx)·y
for x,y E X, t being a scalar. For brevity we shall write x·y = xy. We say that an algebra X is commutative if xy
=
yx.
(3.11.5)
We say that an algebra Xhas a unit ifthere is anelemente EX such that ex= xe
= x.
(3.11.6)
It is easy to verify that the unit is unique. If an algebra X has a unit, then (3.11.4) automatically holds. In the sequel only commutative algebras with a unit will be considered. For brevity we shall call them simply algebras. We say that an algebra X is an F*-algebra if it is an F*-space and the operation of multiplication is continuous. We say that an F*-algebra X is locally bounded if it is a locally bounded space. The theory of locally bounded algebras was developed by Zelazko (1960, 1962, 1962b, 1963, 1965). It is a generalization of the classical theory of Banach algebras. THEOREM 3.11.1 (:Zelazko, 1960). Let X be a locally bounded algebra. Then the topology in X can be determined by a p-homogeneous norm which is submultiplicative, i.e.
llxyll ~ llxiiiiYII·
llxll
(3.11.7)
If X is complete, then it is also complete with respect to the norm II 11. Proof By Theorem 3.2.1 the topology in X can be determined by a p-ho-
mogeneous norm
llxll
=
Observe that
llxll'. Let llxyll'
~1o TYIT''
llxll is finite, since the multiplication is a continuous oper-
Locally Pseudoconvex and Locally Bounded Spaces
ator (cf. Theorem 3.2.13). It is easy to verify that submultiplicative and [fell = 1. Since
175
llxll is p-homogeneous,
Jlxll ?: Jjxjj' lle!l' the norm llxll is stronger than the norm llxJ['.
(3.11.8)
Now we shall identify x e X with a continuous linear operator L.e mapping X into itself by formula Lxy = xy. Observe that the norm operator IILxll of the operator Lx is equal to llxll. Thus we can consider (X, II JJ) as a subspace of the space (B(X), II JJ). If { Xn} tends to x in the space (X, II II'), then, by the continuity of multiplication, Lx,. tends to Lx in (X, II II). Thus the norms II II and II II' are equivalent. D Let X be an algebra. An element x e X is called invertible if there is an element x- 1 e X, called inverse to x, such that (3.11.8) It is easy to verify that x- 1 is uniquely determined (provided it exists) and that (x- 1)- 1 = x. PROPOSITION 3.11.2. Let (X, II II) be a complete locally bounded algebra. Let x be an invertible element in X. Then there is a neighbourhood of zero U such that, for y e U, the element x-y is invertible. Proof Without loss of generality we may assume that II II is p-homogeneous and submultiplicative (see Theorem 3.11.1). We can write co
(x-y)-1
= x-1(e-.x-1y)-1 = x-1), (x-Iy)n, ..:....; n=O
where the series is convergent provided
IIYII < - 1-1 . llx- 11
D
Let X be an algebra. A set M C X, {0} =I= M =I= X is called ideal if it is a linear subset of X and for all x e X, xM C M. Let X be an F-algebra, by the continuity of multiplication we conclude that for any ideal M its closure M is also an ideal provided that M =I= X. We say that an ideal M C X is maximal, if for any ideal M1 such that M C M 1 we have M = M 1 •
Chapter 3
176
PROPOSITION 3.11.3. Let X be a complete locally bounded algebra. Then every maximal ideal is closed. Proof Let M be a maximal ideal in X. By Proposition 3.11.2, e ¢ M. Thus M is an ideal. Since M is maximal and M C M, M = M. D PROPOSITION 3.11.4. Let X be a complete locally bounded algebra over complexes. The function (x-.A.e)- 1 is analytic on its domain. Proof Let A.0 belong to the domain of the function (x-.A.e)- 1 • This means that the element x-A.0e is invertible. Let y = (A.-A. 0 )e. Then (x-A. 0 e)-y = x-A.e. Therefore (x-A.e)- 1
=
((x-A. 0 e)-y)-1 CXl
= (x-A. 0 e)-1 } ; (x-A. 0 e)-n(A.-A.0)n, n=1
where the series on the right is convergent provided
JA.-A.oJ ~ JJ(x-A.oe)-1 11-1 • Thus (x-A.e)- 1 is analytic.
D
Proposition 3.11.4 implies an extension of the theorem of Mazur and Gelfand (Mazur, 1938; Gelfand, 1941). THEOREM 3.11.5 (Zelazko, 1960). Let X be a complete locally bounded field over complex numbers. Then X= {A.e: A. being a complex number}. Proof Suppose that there is an x E X which is not of the form .A.e, i.e. x -=1= A.e for all A.. Since X is a field (x-A.e)- 1 is well defined on the whole complex plane. By Proposition 3.11.4 it is an analytic function. Observe that lim (x-A.e)-1 = 0 . .t.-..oo
Thus, by the Liouville theorem (Theorem 3.5.4), (x-A.e)- 1 = 0 and we obtain a contradiction. D Let X be a complete locally bounded algebra over the complex numbers. Let f be a linear functional defined on X (not necessarily continuous). We say that the functional/is a multiplicative-linear functional if f(xy) = f(x)f(y).
(3.11.9)
Locally Pseudoconvex and Locally Bounded Spaces
177
There is a one-to-one correspondence between multiplicative-linear functionals and maximal ideals. Namely, for a given multiplicative-linear functional f the set M1 = {x: f(x) = 0}
is an ideal. It is a maximal ideal since it has codimension 1. Since X is locally bounded, it is closed by Proposition 3.11.3. Thus the functional f is continuous. Thus we have proved PROPOSITION 3.11.6 (Zelazko, 1960). In complete locally bounded algebras all multiplicative-linear functionals are continuous.
Let M be a maximal ideal in the algebra X. Then X/ M is a complete locally bounded field. Therefore it is isomorphic to the field of complex numbers (see Theorem 3.11.5) and this isomorphism induces the required multiplicative-linear functional. A locally bounded algebra X is called semisimple if {x: F(x) = 0 for all multiplicative linear functionals} = {0}. If a complete locally bounded algebra X over complex numbers is semisimple, then x E X is invertible if and only if F(x) # 0 for all multiplicative-linear functionals F. Indeed, x is invertible if and only if x does not belong to any maximal ideal. In the case of complete locally bounded algebras this implies that F(x) # 0 for all multiplicative functionals. Now we shall present an application of locally bounded algebras to the theory of analytic functions. For this purpose we shall present the following example of a locally bounded algebra. Example 3.11.7 Let N(u) be a non-decreasing continuous function, defined for u?: 0, such that N(u) = 0 if and only if u = 0. We shall assume that for sufficiently small v, u ~
N(u+v)
and there is a C N(uv)
> 0 such that for sufficiently small u,
~
(3.11.10)
N(u)+N(v)
CN(u)N(v)
v
(3.11.11)
Chapter 3
178
> 0 such that
and there is a p
N(u) = N 0(uP),
(3.11.12)
where N 0 is a convex function in a neighbourhood of zero. Let X= N(l) be the space of all sequences x = {x0 ,x1 , that
••• }
such
co
llxll = PN(X) =
J: N(lxni) < +oo.
n=O
The space (X, II II) is an F-space (see Proposition 1.5.1). By Theorem 3.4.3 it is locally bounded. Now we shall introduce multiplication in X by convolution, i.e. if x = {xn}, y = {Yn} then we define n
X·y
=
{
.2: XkYn-k}·
k=O
By (3.11.10) and (3.11.11) we conclude that for sufficiently small xandy (3.11.13) llxyll ~ C llxiiiiYII. Formula (3.11.13) implies that the multiplication is continuous. Thus X is a complete locally bounded algebra. Now we shall give examples of functions satisfying conditions (3.11.10)-(3.11.12). The simplest are functions N(u) =uP, 0
l
0 -uP logu 2p- 1 e-2
foru = 0,
for 0 < u ~ e- 2/P, for e- 2/P < u.
We shall show that N(u) satisfies (3.10.10)-(3.10.12) By the definition, N(O) = 0. The function N(u) is continuous at point 0 since limN(u) = 0, U-+0
and at point e- 2/P since N(e- 21P) = 2p- 1 e- 2• In the interval (0, e- 2/P) it is continuous as an elementary function. The function N(u) is non-decreasing. Indeed, on the interval (0, e- 2/P) dN du
= -puP-1 logu-uP- 1 = -uP-1 (p logu+1) > 0,
because logu < -2/p.
Locally Pseudoconvex and Locally Bounded Spaces
179
. Now we shall calculate the second derivative d2 N du
-= -(p-l)uP-2(plogu+l)-puP- 2 2 = -uP-2(p(p-I)logu+2p-l) = -uP-2((p-I)(plogu+ I)+ I) < 0 for 0 < u ~ e- 2/P. Thus N(u) is concave on the interval (0, e- 21P). Now formula (3.Il.1I) will be shown. Suppose we are given u, v 0 < u, v ~ e- 2/P. Then (uv)Piloguvl = (uv)P llogu+ log vi
~
uP llogul vP llogvl,
because llogu, logvl ~ 2/p ~ 2. Let N 0(x) = -x 2 logx. It is easy to see that if x = uPI 2 , then N 0 (uP1 2) =
2p
N(u).
(3.Il.14)
We shall show that N 0 is convex in a neighbourhod of zero. Indeed, dN ---a:x= 0
-2xlogx-x,
dN~
dx 2 =. -2logx-2-1 = -2logx-3
and the second ?erivative is greater than 0 on the interval (0, e- 3/ 2). Therefore the function N 0 is convex in a neighbourhood ofO and (3.Il.12) holds. Example 3.11.8 Let N be as in Example 3.11. 7. By N~ (I) we shall denote the space of all sequences of complex numbers x = {xn}, n = ... , -2,-1,0,1,2, ... such that 00
llxll
= PN(x) =
.2;
N(lxni)
< +oo.
(3.11.15)
n=-c:o
In a similar way as in Example 3.11. 7 we can show that (N~(l),
II II) is
Chapter 3
180
a complete locally bounded space. We introduce multiplication a by the convolution +oo
xy
= { };
Xn-kYk}.
k=-00
In a similar way as in Example 3.11.7 we can show that N::_(t) is a complete locally bounded algebra. By NF we shall denote the algebra of measurable periodic functions, with period 2n, such that the coefficients of the Fourier expansions +oo
x(t)
= };
Xneint
n=-oo
belong to the space N-::_(1). The operations of addition and multiplication are determined as pointwise addition and multiplication. It is easy to see that the pointwise multiplication of functions in NF induces the convolution multiplication in the space N-::_(1). Thus the space NF can be regarded as a complete locally bounded algebra with topology defined by the norm (3.11.15). We shall show that each multiplicative linear functional defined on algebra NF is of the form F(x)
=
x(t0 )
(3.11.16)
Indeed, let z = eit. The element z is invertible in NF. We shall show that JF(z)J = 1. Suppose that JF(z)J > 1. Then there is a, 0 1 and we can repeat the preceding considerations. Thus JF(z)J = 1 and F(z) = eti, for a certain t 0 , 0 < t 0 ~ 2n. Since F is a multiplicative linear functional, we obtain for every polynomial n
p(z) =
.2 a,zi 1
i=k
(here n, k are integers not necessarily positive), F(p(z))
= p(F(z)) = p(eil•).
Locally Pseudoconvex and Locally Bounded Spaces
181
The polynomials are dense in algebra NF and hence the functional F is of the form (3.11.16). This implies THEOREM 3.11.9. Let N be a function satisfying the condition described in Example 3.11. 7. Let x(t) be a measurable periodic function, with period 2n, such that the coefficients {xn} of the Fourier expansion
+oo
x(t) =
L Xnetnt n=-oo
form a sequence belonging to the space N~(l). If x(t) #- 0 for all t, then the function Ifx(t) can also be expanded in a Fourier series +oo
.J:
_I-= Ynetnt x(t} n~-oo
such that {Yn} eN~(/).
For N(u) = u this is the classical result of Wiener. For N(u) =uP, 0 < p ~ 1 it was proved by Zelazko (1960). Let X be a locally bounded complete algebra over complex numbers. Let x eX. By the spectrum a(x) of x we mean the set of such complex numbers A. that (x- A.e) is not invertible. By Proposition 3.11.2, the set of such complex numbers A. that (x-A.e) is invertible is open. Moreover, if A.> llxll, the element (x-A.e) is also invertible. This implies that the set a(x) is bounded and closed. Hence it is compact. Let A. 0 e a(x). Then by the definition of a spectrum, the element (x-A.0e} is not invertible. Then there is a multiplicative linear functional F such that F(x- A.0e) = 0, i.e. F(x) = A. 0 • Conversely, if A.0 ¢ a(x), then, for each multiplicative linear functional F, F(x) #- A.0 • Thus a(x) = {F(x): Fruns over all multiplicative functionals}.
Let (1}(A.) be an analytic function defined on a domain U containing the spectrum a(x). Let FeU be an oriented closed smooth curve containing a(x) inside the domain surrounded by r. We shall define I
(1}(x) = 2ni
J(1}(A.)(x-A.e)-ldA.. r
Chapter 3
182
The integral on the right exists since r f"'\ a(x) = that, for any multiplicative linear functional F, F((/J(x)) = {/}(F(x)).
0.
It is easy to verify (3.11.17)
Applying (3.11.17) to the algebra NF, we obtain 3.11.10. Let x(t)ENF. Let (/J(A.) be an analytic functions defined on an open set U containing THEOREM
a(x) = {z: z = x(t),O
<
t::s;;2n}.
Then the function (/J(x(t)) also belongs to NF.
For N(u) = u we obtain the classical theorem of Levi. For N(u) = uP, 0 < p:::;;;; 1, Theorem 3.11.10 was proved by Zelazko (1960). Let N satisfy all the conditions described in Example 3.11. 7. By N H we denote the space of all analytic functions x(z) defined on the open unit disc D such that the coefficients {xn}, n = 0, I, ... of the power expansion 00
x(z) =
.2; Xnzn n=O
form a sequence {xn} belonging toN(!). There is a one-to-one corespondence between pointwise multiplication in N H and the convolution in N(l). Thus we can identify NH with N(l). Now we shall show that every multiplicative linear functional F defined on NH is of the form F(x) = x(z0), lzol:::;;;; 1. To begin with we shall show this for x(z) = z. Suppose that F(z) = a, lal > I. Then F(zfa) = I. Therefore F(a-nzn) = 1. On the other hand, a-nzn--*O, and this leads to a contradiction with the continuity of F. Observe that N(l) C 1. Therefore each function x(z) E NH can be extended to a continuous function defined on the closed unit disc D. Thus we have 3.11.11. Let x(z) E NH. Let (/J be an analytic function defined on an open set U containing x(D). Then (/J(x(z)) E NH. THEOREM
Locally Pseudoconvex and Locally Bounded Spaces
183
Theorems 3.11.10 and 3.11.11 can be extended to the case of many variables in the following way THEOREM 3.11.12 (Gramsch, 1967; Przeworska-Rolewicz and Rolewicz, 1966). Let x 1, •.• , Xn E NF (or NH). Let
=
{(x1(t), ... ,Xn(t)): 0
~
t ~ 2n}
a(x) = {x1(z), ... , Xn(z)): lzl ~ 1}).
Then the function <J>(xl> ... , Xn) belongs to NF (or respectively, to NH).
We shall not give here an exact proof. The idea is the following. Replacing the Cauchy integral formula by the Weyl integral formula, we can define analytic functions of many variables on complete locally bounded algebras. ·
3.12.
LAW OF LARGE NUMBERS IN LOCALLY BOUNDED SPACES
Let (Q, .E, P) be a probability space. Let (X, [[ I[) be a locally bounded space. Let the norm II II be p-homogeneous. As in the scalar case, a measurable function X(t) with values in X will be called a random variable. We say· that two random variables X(t), Y(t) are identically distributed if, for any open set A C X P({t: X(t)
E
A})= P({t: Y(t)
E
A}).
A random variable X(t) is called symmetric if X(t) and -X(t) are identically distributed. Random variables X 1(t ), ... , Xn(t) are called independent if, for arbitrary open sets AI> ... , An
n n
P({t: Xt(t) EAt, i
=
1, ... , n})
=
P({t: Xt(t) EAt}).
i=l
A sequence of random variables {Xn(t)} is called a sequence of independent random variables if, for each system of indices n1o ... , nk, the random variables Xn 1 (t), ... , Xn.(t) are independent.
Chapter 3
184
3.12.1 (Sundaresan and Woyczynski, 1980). Let X be a locally bounded space. Let II II be a p-homogeneous norm determining the topology in X. Let {Xn(t)} be a sequence of independent, symmetric, identically distributed random variables. Then
THEOREM
E(IIX1ID
=
JIIXl(t)lldP < +oo
(3.12.1)
a
if and only if (3.12.2)
almost everywhere. Proof. Necessity. To begin with we shall show it under an additional hypothesis that X1 takes only a countable number of values x1,x2 , ... Since Xn are identically distributed, all Xn admit values x 1, ... For each positive integer m we shall define new random variables Xk'(t)
= { ~k(t)
if Xk(t) = x 1 , elsewhere.
... , Xm,
By Rk'(t) we shall denote Xk(t)-xr(t). For each fixed m, {IIXrll} constitutes a sequence of independent identically distributed symmetric random variables taking real values. Moreover, (3.12.3)
The random variables {xr} takes values in a finite-dimensional space. Thus we can use the strong law of large numbers for the one-dimensional case (see for example Petrov, 1975, Theorem IX.3.17). Let an = n11P. Then CX)
.}; ak-2 n=k
CX)
= .}; n-2/p n=k = O(n- 2/P+l) =
O(na;: 2 ).
(3.12.4)
Having (3.12.3) and (3.12.4), we can use the strong law of large numbers by coordinates (here we use the fact that xr takes values in a finite dimensional space).
Locally Pseudoconvex and Locally Bounded Spaces
185
Thus (3.12.5) almost everywhere. At the same time, IIR::'II is a sequence of independent identically distributed real random variables with finite expectation, so that, by the classical strong law of large numbers,
IIR~II+ ... +IIR::'II -+E(IIR~II) n
(3.12.6)
almost everywhere. Since IIR~II tends pointwise to 0 as m tends to infinity and IIR~II ~ !lXIII, by the Lebesgue dominated convergence theorem E(IIR~II) tends to 0. The set D 0 of those t for which (3.12.5) and (3.12.6) converge at t is of full measure, i.e. P(D0 ) = P(D) = 1 Let 8 > 0. Choose an m > 0 such that m
8
E(IIR1 ID < 4· For any t E D 0, we can find anN= N(8,t,m) such that
lln-liP(X~(t)+ ... X~(t))ll < ; for n > N. Thus, for t E D 0 and n
(3.12.6)
> N,
This completes the proof under the condition that Xn are countable valued. To complete the proof of necessity we shall use the standard approximation procedure. For each 8 > 0, there is a symmetric Borel function T, taking values in a countable set in X such that
IITs(x)-xll <
8.
(3.12.7}
Chapter 3
186
Hence lln- 11P(X1+ ... +Xn)ll ~ 1 n +lln- 11P(T,(X1)+ ... +T.(Xn))ll.
~- CIIX1- T.(X1) II+ ... + IIXn- T.(Xn)ll)
Since the first term is less than e and the second one tends to 0 we obtain (3.12.2). Sufficiency. Observe that (3.12.2) implies that n-1
n- 1/PXn =n- 11P(X1+ ... +Xn)- ( -n-
)1/p(n-1)- 1P(X 1
1
+ ... +Xn-1) . IIXnll tends to 0 almost everywhere. Thts means that-- -70 almost everyn where. The random variables {IIXnll} are independent. Then, using the classical result from probability theory (see for example Petrov, 1975, Theorem IX.3.18), we obtain that co
}; P({t: IIX1(t)ll ;;::o n}) < +oo. n=O
Renee co
E(IIX111) ~}; nP({t: n-1 ~ IIX1(t)ll n=1
< n})
co
=}; P({t: IIX1(t)ll ;;::on}) < +oo.
0
n=O
Other results concerning convergence of random variables in nonlocally convex spaces the reader can find in Woyczynski (1969, 1974), Ryll-Nardzewski and Woyczynski (1974); and Marcus and Woyczynski (1977, 1978, 1979).
Chapter 4
Existence and Non-Existence of Continuous Linear Functionals and Continuous Linear Operators
4.1. CONTINUOUS
LINEAR
F UNCTIONALS
AND
OPEN CONVEX
SETS
Let X be an F*-space. Let f be a continuous linear functional defined on X. We say that functional f is non-trivial iff =I= 0. If there is a nontrivial linear continuous functional defined on X, we say that X has a non-trivial dual space X* (briefly X has a non-trivial dual). If each linear continuous functional defined on X is equal to 0, we say that X has a trivial dual. Let U =
{x: Jf(x)l < 1}.
The set U is open as an inverse image of the open set {z: lzl < 1} under a continuous tra,nsformation. Moreover, the set U is convex, since if x,y e U, a,b ~ 0, a+b = 1, then if(ax+by)i < aif(x)i+blf(y)i < 1. This implies that if an F*-space X has a non-trivial dual, then there is an open convex set U C X different from the whole space X. We shall show that the converse fact is also true. Namely, if in an F*-space X there exists an open convex set different from the whole space X, then there is a non-trivial continuous linear functional. To begin with we shall prove this for real F*-spaces. Let X be a real F*-space. Let us suppose that there is a convex open subset U of X different from the whole space X, U =I= X. Since a translation maps open sets on open sets, we may assume without loss of generality that 0 e U. 187
Chapter 4
188
Let
= inf{t > 0:
llxllu
~ E u}.
Evidently, (4.1.1)
llxllu:?::-0 and U
= {x: llxllu < 1}.
Moreover lltxllu
= tllxllu for t > 0
(positive homogeneity)
(4.1.2)
and llx+yllu ~ llxllu+IIYIIu.
(4.1.3)
Formula (4.1.2) is trivial. We shall prove formula (4.1.3). Let e be an arbitrary positive number. The definition of llxllu implies and The set U is convex; therefore llxllu x IIYIIu Y (1-e) llxllu+II.YII~ llxllu- +(1-e) llxllu+II.Ylk7" IIYIIu
x+y
= (1-e) llxllu+IIYIIu
E
U.
Since e is an arbitrary positive number, we obtain llx+yllu =:;::: 1 llxllu+IIYIIu ""' ' and this implies (4.1.3). A functional satisfying conditions (4.1.1)-(4.1.3) is called a Minkowski functional. If we replace (4.1.2) by llxllu
= ltlllxllu
for all scalars t,
(4.1.2')
then a Minkowski functional becomes a homogeneous pseudonorm (see Section 3.1). Let us remark that llxllu is a homogeneous pseudonorm if and only if the set U is balanced.
Existence of Continuous Linear Functionals and Operators
189
Let X be an F*-space. Let f(x) be a linear functional defined on X. If there is an open convex set U containing 0 such that Jf(x)J
< llxllu,
then the functionalf(x) is continuous. On the other hand, if f(x) is a continuous linear functional and
{x: Jf(x)J < 1 }.
U=
then lf(x)J
< llxllu.
THEOREM 4.1.1 (Hahn 1927, Banach 1929). Let X be a rea/linear space. Let p(x) be a real-valued functional (generally non-linear) such that: (1) p(x+y)
< p(x).
Then there is a linear functionalf(x) defined on the whole space X such •that f(x) =fo(x)
for x
f(x) <,.p(x)
for xe X.
E
X0
and (4.1.4)
Proof We say that a iinear functional h(x) is an extension of a linear functional g(x) if the domain of the functional h(x) contains the domain of the functional g(x) and both functionals coincide on the domain of the functional g(x). Let m: be the set of all extensions of the functional fo such that g(x)
for x belonging to the domain of g.
We can introduce a relation of partial order in m: in the following way. We say that h -3 g if g is an extension of h. By the Kuratowski-Zorn lemma there is a maximal element of the family m:. Let {f(x) be such a maximal element. To complete the proof it is sufficient to show that the domain of the functionalf(x) is the whole space X.
Chapter 4
190
Suppose that the above does not hold, i.e. that the domain Y of the functionalf(x) is different from the whole space X. Let y 0 e Y and let us denote by Y0 the space spanned by Y and y 0 • Obviously each element x e Y0 can be written uniquely in the form x = y+ay 0 , where y e Yanda is a scalar. Let x',x" e Y. Then f(x')+f(x")
= f(x' +x") ~ p[(x' +Yo)+(x" ~p(x' +yo)+p(x" -y0 ).
-Yo)]
Hence f(x")-p(x" -y0 )
~
-f(x')+p(x'+y0 ).
Since x' and x" are arbitrary elements of Y, we obtain A= sup (f(x)-p(x-y 0 ))
~
XEY
B
=
inf(-f(x)+p(x+y0 )). XEY
Let c be an arbitrary number such that A tional/1 in Y 0 in the following way: f1(y+ayo)
=
~
c ~ B. We define a func-
f(y)+ca.
Obviously, ];_ is an extension of the functional
f We shall show that
f~e~.
Let a be a positive number. Then f1(y+ayo)
=
ca+f(y)
+J(y) =
=
~ aB+f(y) ~a(-!(~ )+P(Yo+ ~))
-f(y)+p(ayo+Y)+f(y)
p(y+ayo).
In the case where a is negative, the proof is similar, but the inequality c ~ A is applied instead of c ~ B. Hence f is not a maximal element of A and we obtain a contradiction. D 4.1.2. Let X be a real F*-space. Let U be an open convex set in the space X different from X. Then there is a non-trivial continuous linear junctional in X. Proof Without loss of generality we can assume that 0 e U. Since U is different from the whole space X, there is an element x 0 such that CoROLLARY
Existence of Continuous Linear Functionals and Operators
191
llxollu =F 0. Let X 0 be the space spanned by x 0 • Let fo be a functional defined on the space X, in the following way: fo(x) = fo(axo) = allxollu.
Obviously,f0(x) ~ llxllu for x E X 0 • By Theorem 4.1.1 we can extend the functionalfo to a linear functional f(x) defined on the whole space X and satisfying the condition f(x) ~ llxllu for x EX. Therefore, the functional f(x) is continuous. D CoROLLARY 4.1.3. Let X be a complex F*-space. Let us suppose that there is an open convex subset U C X different from the whole space X. Then there is in the space X non-trivial functional, continuous and linear (with respect to complex numbers). Proof Obviously, the space X can also be regarded as a linear space over reals. Therefore, by Corollary 4.1.2. there exists a