Approximation Theory in Tensor Product Spaces

163 Pages·1985·2.63 MB·English

by  William Allan Light, Elliott Ward Cheney (auth.)

Lecture Notes in
Mathematics
Edited by A. Dold and B. Eckmann
Approximation Theory
in-T ensor Product Spaces
Sp ringer-Verlag
Berlin Heidelb erg New York Tokyo
Authors
William Allan Light
Mathematics Department, University of Lancaster
Bailrigg, Lancaster LA1 4YL, England
EllJott Ward Cheney
Mathematics Department, University of Texas
Austin, Texas ?8712,USA
Mathematics Subject Classification (1980): Primary: 41 A63, 41 A65
Secondary: 41-02, 41A30, 41 A45, 41A50
ISBN 3-540-16057-4 Springer-Verlag Berlin Heidelberg New York Tokyo
ISBN 0-387-16057-4 Springer-Verlag New York Heidelberg Berlin Tokyo
This work is subject to copyright. All rights are reserved, whethert he whole or part of the material
is concerned, specificallyt hose of translation,r eprinting, re-use of illustrations,b roadcasting,
reproduction by photocopyingm achineo r similar means, and storage in data banks. Under
§ 54 of the German Copyright Law where copies are madef or other than privateu se, a fee is
payablet o "VerwertungsgesellschaftW ort", Munich.
© by Springer-VerlagB erlin Heidelberg 1985
Printed in Germany
Printing and binding: Beltz Offsetdruck, Hemsbach/Bergstr.
2146/3140-543210
D E D I C A T I O N
This work is dedicated to the memory of
Robert Schatten
(1911- 1977)
who did much of the pioneering work in
the theory of tensor products of Banach spaces.
P R E F A C E
In the past two decades, a new branch of approximation theory has emerged; it con-
cerns the approximation of multivariate functions by combinations of univariate ones. The
setting for these approximation problems is often a Banach space which is the tensor prod-
uct of two or more simpler spaces. Approximations are usually sought in subspaces which
are themselves tensor products. While these are infinite dimensional, they may share
some of the characteristics of finite-dimensional subspaces. The usual questions from clas-
sical approximation theory can be posed for these approximating subspaces, such as (i)
Do best approximations exist? (ii) Are best approximations unique? (iii) How are best
approximations characterized? (iv) What algorithms can be devised for computing best
approximations? (v) Do there exist simple procedures which provide ~good= approxima-
tions, in contrast to ~best = approximations? (vi) What are the projections of least norm
on these subspaces? and (vii) what are the projection constants of these subspaces?
This volume surveys only a part of this growing field of research. Its purpose is
twofold: first, to provide a coherent account of some recent results; and second, to give
an exposition of the subject for those not already familiar with it. We cater for the needs
of this latter category of reader by adopting a deliberately slow pace and by including
virtually all d e t a ~ in the proofs. We hope that the book will be useful to students of
approximation theory in courses and seminars.
Expert readers may wish to omit a reading of the first chapter, which gives an intro-
duction to the tensor product theory of Banach spaces. The material on approximation
theory occupies the next eight chapters. Results needed in proofs but perhaps not familiar
to every reader are collected in two appendices (Chapters 10 and 11). Finally, there are
historical notes and a large collection of references, some of which are only peripheral to
our theme.
Notation and conventions are standard throughout, and we often do not stop to define
notation which we expect to be familiar. However, a table of notation has been placed
just before the index.
We are glad to be able to thank a number of colleagues for pleasant collaboration over
the years on matters relating to these notes: Carlo Franchetti (Florence), Manfred von
Golitschek (Wfirsburg), Julie Halton (Lancaster), Sue Holland (Lancaster), John Respess
(Austin), and Lin Sulley (Lancaster and Ipswich).
During the preparation of the manuscript, the second author was supported by grants
from the University of Texas and the Science and Engineering Research Council of Great
Britain. For these grants, and for the hospitaliW of the University of Lancaster, he is
deeply grateful.
We are very much indebted to Ms. Jan Duffy of the University of Texas Mathematics
Department, who undertook the arduous task of rendering our manuscript into a computer
file for processing by the TEX typesetting system. The pleasing appearance which (we
think) the book possesses is due entirely to the skill and good judgement of Ms. Duffy.
W.A. Light E.W. Cheney
Lancaster, July 1985
vi
C O N T E N T S
1. AN INTRODUCTION TO TENSOR PRODUCTS 1
2. PROXIMINALITY 35
3. THE ALTERNATING ALGORITHM 48
4. CENTRAL PROXIMITY MAPS 56
5. THE DILIBERTO-STRAUS ALGORITHM IN C(S x T) 60
6. THE ALGORITHM OF VON GOLITSCHEK 67
7. THE L1-VERSION OF THE DILIBERTO-STRAUS ALGORITHM 75
8. ESTIMATES OF P R O J E C T I O N CONSTANTS 91
9. MINIMAL P RO J E CT IONS 103
10. A P P E N D I X ON THE BOCHNER INTEGRAL 113
11. A P P E N D I X ON MISCELLANEOUS RESULTS ON BANACH SPACES 126
NOTES AND REMARKS 134
BIOGRAPHICAL SKETCH OF ROBERT SCHATTEN 138
REFERENCES 141
INDEX OF NOTATION 153
INDEX 156
C H A P T E R 1
A N I N T R O D U C T I O N T O T E N S O R P R O D U C T S P A C E S
The purpose of this chapter is to introduce some of the basic theory of the tensor
product of two Banach spaces. All of this mater ia l can be found in other sources, but the
t rea tment here is part icularly designed to meet the needs of the subsequent chapters. As
mentioned in the preface, we have tried to expound the subject in a way tha t leaves very
few arguments for the reader to supply.
There are two sources of information on this topic which we should mention at the
outset. One is Schat ten 's monograph [154], which gives a very careful t rea tment of the
foundations of the subject. The other is the survey of vector measures by Diestel and Uhl
[55]. Chapter 8 of [55] provides a brief introduction to tensor products of Banach spaces
and covers many recent results in this area.
Let X and Y be Banach spaces, and denote their duals by X* and Y*, respectively.
We shall construct formal expressions ~ ® y~ where x~ E X, y~ E Y and n E 1N. We
~ i - - - - 1 Xl
will regard such an expression as defining an operator A : X* -* Y, given by
r$
A¢ = ~ ¢ ( x , ) y , (¢ C X ' ) .
i----1
Amongst all these formal expressions we introduce the relation
~ ~ x i ~ Yi "" ai ~ bi
i m l i = l
if bo th expressions define the same operator from X* to Y. This is clearly an equivalence
relation on the set of all such formal expressions. We shall henceforward be interested only
in the equivalence classes of this relation, and will denote the set of all such equivalence
classes by X ® Y. We shall abuse notat ion in the usual way by referring to the expression
n
~ = 1 x~ ® Yi as a member of X ® Y when we intend to refer to the equivalence class of
expressions containing ~ " = 1 x~ ® y~. For any c~ E ~ we define multiples of (the equiva-
lence class of expressions containing) ~ ni =1 xl ® y~ by (the equivalence class of expressions
containing) ~"--1 ax~ ® y~. Similarly, we define addition by
xi N Yi -5 xi N yi = xi N Yi.
i = 1 i - - - -n+ l i = l
All algebraic identities in X ® Y are based upon the interpretation of expressions as linear
operators. Thus one easily verifies such identities as
z ® ( u + v ) = z ® u + x ® v
a x ® y = x ® a y
z ® 0 = 0 ® 0 .
Two observations are perhaps helpful at this juncture. Firstly, the symbol 4+, is being
used only as a separator in our formal expression ~ - - 1 x~ ® y~ and in our definition of the
addition of two such expressions. Secondly, the construction thus far makes no use of the
topological structure of X or Y. Thus we could have begun with linear spaces and algebraic
duals rather than Banach spaces. If we begin with Banach spaces and identify E i =nI xi®Yi
with an operator A mapping the algebraic dual of X into Y then the equivalence classes
that make up X ® Y remain the same.
It is clear that scalar multiplication of ~ i x~ ® y~ by ~ is equivalent to multiplying
the associated operator A by (x, and that the addition of this expression to ~ 5 = i aj ® bj
is equivalent to adding A to the operator B associated with this last expression. With
these definitions X ® Y forms a linear space, called the a l g e b r a i c t e n s o r p r o d u c t .
r$
1.1 L E M M A . Every expression ~i=i xi @ Yi is equivalent to ei ther 0 ® 0 or to an
expression Eim= l ai ® bl where { ai, . . . , a m ) and { h i , . . . , bin} are linearly independen t sets.
n--i n
P R O O F . Suppose that for instance x,~ : ~ j = i a j x j . Then ~ i = i xi ® y~ defines the
operator A : X* ---* Y where, for ¢ E X*,
A ¢ = ¢(x,)y~ = ~ ¢(x , )y i + ¢ ( x , ) y ,
i = 1 i = 1
n - - 1 n - - 1
n--i n--i
: + j ¢CxAv.
i=1 3 = 1
n - - 1
= + v . ) .
i----1
Hence ~i~= i x~ ® Yi has the representation ~=,~i- 1 a~ ® b~ where a~ = x~ and bi =
Yi + ~i Y,~. We may repeat this process until we arrive at either a representation in which
{ a i , . . . , am} and {b i , . . . , bin} are linear|y independent or one of the representations x ® 0
or 0 ® y, which are both equivalent to 0 ® 0. •
The space X ® Y is generated by elements of the form x ® y, which are called d y a d s .
This observation is often used to simplify linear arguments.
From the preceding discussions it is clear tha t X ® Y may be regarded as a subspace
of the space of continuous linear operators of finite rank f rom X* into Y. Usually this
subspace is a proper one. However, in the case when X is reflexive every continuous finite
rank linear opera tor from X* into Y can be identified with an expression ~-]~$=1 xl ® Yi
as follows. Suppose A is such an opera tor with range determined by linearly independent
b t , . . . , bn. Then for ¢ E X*,
A ¢ = where e R .
i = l
S tandard arguments show tha t the ai are in X** and hence in X, whence a i (¢ ) = ¢(a~)
for suitable ai E X, 1 < i < n. Hence,
A ¢ = ¢ (a , )b ,
i = l
and A is associated with ~ i ~ t ai ® hi.
It is possible to construct various norms on X ® Y using the norms in X and Y. The
most obvious way to introduce a norm which is independent of the representat ion of the
• l l
equivalence class is to assign to ~ i = 1 xi ® Yi the norm it receives when regarded as an
opera tor from X* to Y; viz.,
xi ® yi = sup
* 1 i = 1
Notice tha t for a dyad x ® y we have
A ( x ® y ) = s u p { l l ¢ ( x ) y l t : ¢ e x * , Hell = 1}
= sup{]¢(x)IIly]]: ¢ e x * , ]]¢ll= 1}
= IIxll Ilytl.
Such a norm on X ® Y, for which the norm of a dyad equals the product of the norms
of its two components, is termed a c r o s s n o r m . Given any two Banach spaces X and Y
there is a rich supply of crossnorms on X ® Y.
We can form a second linear space from X and Y by considering X* ® Y*. This
consists of all expressions
f i ¢ ~ ® ¢i where ¢~ E X* and ¢i E Y*.
i = 1
In addition to other interpretations such an expression may be considered as a linear form
on X ® Y by defining
¢, ® ¢, x~ ® y~ = ~ ¢,(~J)¢,(~) .
i : l "---- i = l 3'----1
One verifies easily that this definition is proper; tha t is, it is invariant over the equivalence
classes. Note tha t it would have sufficed to give the above definition for a pair of dyads:
(¢ ® ¢)(~ ® y) = ¢(x)¢(y).
1.2 D E F I N I T I O N . Let a be a norm on X ® Y. We say that ~ is a crossnorm if,
for all x E X and y E Y~
-(~ ® y) = II~1t Ilyll.
We say that a is a reasonable norm if, for all ¢ E X* and ¢ @ Y*, the linear form ¢ ®
is bounded on ( X ® Y, a) and has norm equal to I1¢11 II¢11.
1.3 D E F I N I T I O N . Let a be a norm on X ® Y. De~ne ~* on X* ® Y* by the
equat ion
a* ¢ , ® ¢ , ----sup ¢ , ( x j ) ¢ , ( y j ) : a ~ x y ® y j = 1 .
i----1 i = 1 3'----1 3 ' = 1
W e admi t the possibi l i ty that a* m a y take ÷oo as a value.
Observe that if a is reasonable then a* is the norm induced on X* ®Y* by considering
the lat ter as a linear subspace of (X ® Y, a)*. The norm a* is the a s s o c i a t e of a.
1.4 L E M M A . Let a be a norm on X ® Y satis fying
(i) a ( x ® y ) <_ I[xlt[[yN for all x e X and y e V ;
(ii) a * ( ¢ ® ¢ ) <[1¢[[[1¢11 for all C E X * and C E Y * .
Then ~ is a reasonable crossnorm.
P R O O F . If x E X , y E Y, C E X * , a n d C E Y * , t h e n
¢(~)¢(y) = (¢ ® ¢ ) ( z ® y) < ~*(¢ ® ¢)~(~ ® y) < ~ II¢l111¢11~(~ ® y)
- - L I1~11I l y l l ~ * ( ¢ ® ¢).
In this inequality, take a supremum as ¢ and ¢ range over the unit cells of X* and
Y*, getting
IlxtJ Ilyll < a ( x ® y).
4