CONVEX CONES
This Page Intentionally Left Blank
NORTH-HOLLAND MATHEMATICS STUDIES
56
Notas de Matematica (82) Editor: Leopoldo Nachbin Universidade Federal do Rio de Janeiro and University of Rochester
Convex Cones BENNO FUCHSSTEINER and WOLFGANG LUSKY University of Paderborn Germany
NORTH-HOLLAND PUBLISHING COMPANY - AMSTERDAM
NEW YORK
OXFORD
North-Holland Publishing Company, I981
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior permission of the copyright owner.
ISBN: 0 444 86290 0
Publishers: NORTH-HOLLAND PUBLISHING COMPANY AMSTERDAM NEW YORK OXFORD Sole distributors for the U.S.A. and Canada: ELSEVIER NORTH-HOLLAND, INC. 5 2 VANDERBILT AVENUE, NEW YORK, N.Y. 10017
Library of Congress Cataloging in Publication Data
F u c h s s t e i n e r , Benno. Convex cones. (North-Holland mathematics s t u d i e s ; 56) Bibliography: p . 1. Functions of r e a l v a r i a b l e s . 2 . Convex bodies. 3 . Cone. I. Lusky, Wolfgang, 194811. T i t l e . 111. S e r i e s .
PRINTED IN THE NETHERLANDS
PREFACE
The aim of t h i s book i s t o o u t l i n e an elementary theory o f l i n e a r funct i o n a l s on convex cones, b u t convex cones a r e here taken i n a s l i g h t l y more general way than usual, they need not be imbedded i n a vector space. In consequence, we do not have a general c a n c e l l a t i o n law f o r t h e a d d i t i o n . Typical examples f o r t h e cones we have in mind a r e 6 = R u I - -1 o r the upper semicontinuous 6- valued functions on some topological space. Accordingly, l i n e a r functionals on such cones a r e allowed t o a t t a i n values i n 6 instead of R . This g e n e r a l i t y has advantages w i t h respect t o extensions of l i n e a r f u n c t i o n a l s .
We believe t h a t , t o a l a r g e e x t e n t , t h e work of an a n a l y s t c o n s i s t s of a s k i l l f u l handling of i n e q u a l i t i e s . I n order t o t r e a t i n e q u a l i t i e s in their proper context, we combine t h e theory of l i n e a r f u n c t i o n a l s w i t h order t h e o r e t i c aspects i n s o f a r as we mostly deal with f u n c t i o n a l s being monotone w i t h respect t o s u i t a b l e order r e l a t i o n s . For those a p p l i c a t i o n s we have i n mind, monotonicity usually implies c o n t i n u i t y . Therefore the material of t h i s book i s presented i n an order t h e o r e t i c r a t h e r than topological s e t t i n g . Very few topological arguments a r e used in this book, b u t this i s n e i t h e r done t o c a r r y our viewpoint t o t h e extreme nor t o show disregard f o r t h e many beautiful arguments and techniques topology has contributed to analysis. We have adapted, and sometimes extended, many basic techniques which were developed in the study of compact convex s e t s . Accordingly, measure theory takes an important place throughout this book. For those readers who a r e not well acquainted w i t h t h a t f i e l d , we have gathered some elementary r e s u l t s and techniques i n t h e A p p e n d i x . V
vi
Preface
We want t o emphasize t h a t these notes a r e w r i t t e n f r o m a h i g h l y personal p o i n t o f view. The c h o i c e o f what t o i n c l u d e has been q u i t e s u b j e c t i v e , we c o n c e n t r a t e h e a v i l y on work done b y t h e f i r s t a u t h o r d u r i n g t h e l a s t years. While t h e i n t e r e s t o f b o t h authors l i e s more on t h e c o n c r e t e s i d e of a n a l y s i s , nevertheless we a r e aware o f t h e d e p l o r a b l e f a c t t h a t t h i s w i l l n o t always b e t r a n s p a r e n t t o t h e r e a d e r . To h e l p compensate f o r t h i s disadvantage, we have added many examples and a p p l i c a t i o n s from d i f f e r e n t areas. But, due t h e l a c k o f space and time,we have had t o o m i t many i m p o r t a n t examples, e s p e c i a l l y from e q u i l i b r i u m t h e o r y i n Mathematical Economics and from S t a t i s t i c a l Mechanics. The book i s m a i n l y addressed t o graduate s t u d e n t s . S i n c e no s p e c i f i c p r e r e q u i s i t e s a r e necessary, however, and no deeper knowledge o f any s p e c i f i c p a r t o f mathematics i s r e q u i r e d , these notes can as w e l l be read by every s t u d e n t . We have t r i e d t o p r e s e n t a l l arguments i n d e t a i l , although sometimes t h i s i s done r a t h e r b r i e f l y and t h i s i s e s p e c i a l l y t r u e i n the a p p l i c a t i o n sections. The book i s divided i n t o two chapters, which a r e t h e n s u b d i v i d e d i n t o two and s i x s e c t i o n s , r e s p e c t i v e l y . I n t h e f i r s t chapter, we p r e s e n t t h e b a s i c m a t e r i a l about l i n e a r f u n c t i o n a l s . We g i v e o u r f a v o u r i t e v e r s i o n o f t h e Hahn-Banach Theorem, and we o b t a i n i m p o r t a n t i n f o r m a t i o n about extens i o n and decomposition o f l i n e a r f u n c t i o n a l s . The second p a r t i s m a i n l y devoted t o t h e r e p r e s e n t a t i o n o f 1 i n e a r f u n c t i o n a l s by i n t e g r a l s . When r e f e r r i n g back t o items w i t h i n a chapter, t h e c h a p t e r number i s omi t t e d . We owe a g r e a t deal t o Mrs. Waltraud Bohmer f o r h e r e x c e l l e n t t y p i n g o f t h e manuscript. F i n a l l y , we thank t h e e d i t o r , Leopoldo Nachbin, and t h e p u b l i s h e r , E. F r e d r i k s s o n , f o r i n c l u d i n g t h i s volume i n t h e i r s e r i e s .
TABLE OF CONTENTS
PREFACE CHAPTER I
V
LINEAR FUNCTIONALS
Chapter I . 1.
1.1
1
The Sandwich Theorem
Semi groups
2
1.2
Cones
6
1.3
Some Consequences o f t h e Sandwich Theorem
11
1.4
Sum Theorem and F i n i t e Decomposition Theorem
14
1.5
Some elementary Appl ic a t i o n s
20
1.5.1
The Phragrnen-Lindelof
1.5.2
Bishop's General V e r s i o n o f t h e "Three
1.5.3
Seevers' P r o o f f o r t h e E x i s t e n c e o f
Principle
21
C i r c l es Theorem"
22
Jensen Measures 1.5.4
When i s a F u n c t i o n Dominated by an A r i t h m e t i c Mean o f o t h e r F u n c t i o n s ?
1.5.5
20
24
Decomposition w i t h r e s p e c t t o P o s i t i v e l y Independent F u n c t i o n a l s
26
1.5.6
The Jordan Decomposition
28
1.5.7
The Lemma o f Farkas
29
1.5.8
The S e p a r a t i o n Theorem
33
1.5.9
A f f i n e I n t e r p o s i t i o n and t h e M a z u r - O r l i c z Theorem
34
The Riesz-Konig Theorem
37
1.7
A S t r a s s e n - t y p e D i s i n t e g r a t i o n Theorem
42
1.8
Some Appl i c a t i o n s
49
1.6
1.9
1.8.1
An a b s t r a c t Flow Theorem
49
1.8.2
Flows i n networks
54
1.8.3
Supply-Demand Problems
58
A d d i t i o n a l Remarks and Comments vii
72
Table of Contents
viii
Chapter 1.2
Order Units and L a t t i c e Cones
Order U n i t Cones 2.2 The Kakutani-Krein-Stone-Yosida Theorem Order Complete Vector L a t t i c e s with Order Unit 2.3 L a t t i c e Cones 2.4 2.5 Riesz Property and F i n i t e Sum Property The Positive Dual Cone 2.6 Dual Orders and t h e Cartier-Fell -Meyer Theorem 2.7 Free L a t t i c e Cones 2.8 2.9 Simplicia1 Cones 2.10 Characters 2.11 Some Examples
2.1
87 89 93 96 101 106 113 118 122 130 139 149
2.11.1 Absorbing Functionals and Banach L a t t i c e s
149
2.11.2 AM- and AL- Cones
154
2.11.3 Characters o f AM-Cones
158
Kakutani's Characterization o f S u b l a t t i c e s o f C ( K ) - Spaces 2.11.5 Korovkin's Theorem
162
2.11.4
2.12
Remarks and Comments
CHAPTER I1
1.2 1.3 1.4 1.5
Countable Decomposition
177
Preliminaries The Main Decomposition Theorems Dini Cones Weak Dini Cones Remarks and Comments
178
Chapter 11.2 2.1 2.2 2.3 2.4 2.5 2.6
170
REPRESENTING MEASURES
Chapter I I . 1 1.1
167
Representing Measures
Decomposition Properties and Measure Theory Dini Cones and Representing Measures Weak Dini Cones and Signed Representing Measures Representing Measures on Weighted Cones Dirichlet States Elementary Examples and Applications
182 189 196 198 201 202 210 213 218 220 227
Table of Contents
2.6.1
The Riesz R e p r e s e n t a t i o n Theorem f o r non-Hausd o r f f Sets
2.6.2 2.6.3 2.6.4 2.6.5 2.7
Regul a r i t y and Support R e p r e s e n t a t i o n by Unbounded Measures Adapted Cones R e p r e s e n t a t i o n o f F u n c t i o n a l s w i t h Zero Mass
Remarks and Comments
Chapter II . 3
Boundaries
3.1
F i x p o i n t Boundaries, B a u e r ' s Maximum P r i n c i p l e and
3.2 3.3 3.4 3.5 3.6 3.7
More Boundaries
t h e K r e i n-Mi 1man Theorem Choquet's Theorem Maximal Measures The Choquet-Meyer Theorem D i n i Boundaries Remarks and Comments
Chapter 11.4
ix
I n t e g r a l R e p r e s e n t a t i o n o f Operators t a k i n g
227 2 28 232 237 241 245 251 252 258 26 7 274 281 287 303 305
Values i n an Order Complete Vector L a t t i c e Chapter 11.5
Generalized Hewitt-Nachbin Spaces
5.1
B a s i c D e f i n i t i o n s and t h e i r Meaning i n t h e
5.2 5.3 5.4 5.5 5.6
The F- C o m p a c t i f i c a t i o n
Classical S i t u a t i o n The F- R e a l c o m p a c t i f i c a t i o n F- Pseudocompactness Some Consequences Remarks and Comments
Chapter 11.6
6.1 6.2
Examples and A p p l i c a t i o n s
Completely Monotonic Functions
314 318 324 328 331 337 340 341
Kendal 1 ' s Theorem on I n f i n i t e l y D i v i s i b l e Completely Monotonic F u n c t i o n
6.3 6.4 6.5
313
M u l t i p l i c a t i v e Cones Banach Algebras and S p e c t r a l Theory The Bochner-Weil Theorem
345 349 352 362
Table of Contents
X
The L’evy-Khi n t c h i ne
6.7
Remarks and Comments
378
Measures and t h e Riesz R e p r e s e n t a t i o n Theorem
380
APPENDIX:
A 1
A A A A
(I-
Formul a
37 1
6.6
Algebras
380
2
Measures
383
3
The Riesz Representation Theorem
386
4
The Radon-Nikodym Theorem
393
5
Signed and L a t t i c e - v a l u e d Measures
396
REFERENCES
403
AUTHOR INDEX
423
SUBJECT INDEX
425
C H A P T E R
I
LINEAR FUNCTIONALS SECTION 1.1 THE SANDWICH THEOREM
E x t e n s i o n theorems f o r 1 i n e a r f u n c t i o n a l s b e l o n g t o t h e most fundamental t o o l s f o r l a r g e p a r t s o f modern a n a l y s i s , e s p e c i a l l y o f
functional
a n a l y s i s . The same i s t r u e f o r convex cones, where l i n e a r f u n c t i o n a l s p l a y an i m p o r t a n t r o l e . A s k i l l f u l 1 h a n d l i n g o f l i n e a r f u n c t i o n a l s t u r n s o u t t o be i n d i s p e n s a b l e i n t h i s area o f a n a l y s i s . Consequently we s t a r t t h i s book w i t h a s u i t a b l e v e r s i o n o f t h e Hahn-Banach theorem f o r semigroups and convex cones. We show t h a t between a s u b a d d i t i v e and a s u p e r a d d i t i v e f u n c t i o n a l t h e r e i s always an a d d i t i v e f u n c t i o n a l h a v i n g t h e same m o n o t o n i c i t y p r o p e r t i e s as t h e s u b a d d i t i v e f u n c t i o n a l (Sandwich Theorem). Since no a d d i t i o n a l work i s r e q u i r e d we immediately prove t h i s r e s u l t f o r maps t a k i n g values i n an o r d e r complete v e c t o r l a t t i c e . S i n c e we a r e d e a l i n g w i t h semigroups and cones i n s t e a d o f groups and v e c t o r spaces we have t o a d j o i n a smallest element t o t h e space where t h e f u n c t i o n a l s t a k e t h e i r values. We proceed g i v i n g two i m p o r t a n t consequences o f t h e Sandwich Theorem, namely t h e F i n i t e Decomposition Theorem and t h e Sum Theorem. The power o f these r e s u l t s i s i l l u s t r a t e d
a t a few s i m p l e a p p l i c a t i o n s ( s e c t i o n 1.5)
and l a t e r on we extend these theorems t o a more s o p h i s t i c a t e d s i t u a t i o n , where measures and i n t e g r a l s t a k e t h e p l a c e o f f i n i t e sums. The Sum Theorem leads t o a Strassen-type d i s i n t e g r a t i o n theorem and, f o r measures on compact spaces, t h e F i n i t e Decomposition Theorem
leads t o t h e Riesz-Konig Theorem
( a general and e f f e c t i v e v e r s i o n o f t h e Riesz R e p r e s e n t a t i o n theorem). Since t h e Riesz-Konig Theorem i s g e n e r a l i z e d l a t e r on t o a non-compact s i t u a t i o n we have postponed a p p l i c a t i o n s f o r t h i s r e s u l t u n t i l c h a p t e r 11. A l l t h e examples i n s e c t i o n 1.9 deal w i t h a p p l i c a t i o n s o f t h e D i s i n t e g r a t i o n Theorem t o networks and p r o b l ems i n Mathemati c a l Economi cs
. Finall y , i n
s e c t i o n 1.9 we mention a few f u r t h e r r e s u l t s and some r e l a t e d problems. Furthermore, we g i v e ( f r o m a h i g h l y personal v i e w p o i n t ) a s h o r t survey on 1
2
Linear Functionals
t h e h i s t o r y o f t h e Hahn-Banach theorem.
1.1 SEMIGROUPS
L e t S = ( S , t , < )be a preordered a b e l i a n semigroup always w i t h n e u t r a l element 0. By p r e o r d e r we mean a r e f l e x i v e and t r a n s i t i v e ( n o t n e c e s s a r i S . Furthermore we r e q u i r e c o m p a t i b i l i t y ~ ~ , s ~ ,t2 t E~ S, such t h a t
l y a n t i s y m m e t r i c ) r e l a t i o n < on
w i t h t h e semigroup s t r u c t u r e , i . e . whenever s1 < s2 and
t2 t h e n
tl<
We c o n s i d e r l i = IR
u I- -1
r e l a t i o n o f IR t o lii 0
*
s1
tl <
t
s2
t
t2 .
and extend t h e a l g e b r a i c o p e r a t i o n s and o r d e r
i n t h e usual way, i . e . l e t (-m)
-
m
= O = i n f IR
A > O
~ . ( - m ) = - m
if
- m + r
for all
= - m
r E
IE
.
The p r o o f s o f t h e f o l l o w i n g a s s e r t i o n s a r e m o s t l y based upon elementary computations w i t h i n f i m a and suprema. Therefore, t h e r e a d e r s h o u l d r e c a l l i d e n t i t i e s such as
I
a E A3 =
-
i)
supIa
ii)
supCxa l a E A 1 = X supIa
iii) sup{a
t
b
1
inf{- a
a E A 1 = supfa
I
I
a E A3
a E Al,
1
X 2 0
a E A3 + b
3
b E IR
where A i s a bounded subset o f IR .These i d e n t i t i e s remain t r u e i f we r e p l a c e IR by an a r b i t r a r y v e c t o r l a t t i c e R. R e c a l l , a v e c t o r l a t t i c e i s o r d e r complete i f f o r any subset A c R which i s o r d e r bounded from
R
r E R w i t h r 2 a f o r a1 1 a E A) t h e supremum A e x i s t s i n R. I n view o f i)t h e n t h e infimum ( i n f B) e x i s t s f o r any subset B c R which i s o r d e r bounded from below. S i m i l a r l y
above (i.e. t h e r e i s (sup A) o f
3
The Sandwich Theorem
as lk we define R
=
R u I - -1
with
0 . (--)=O
-
= inf R
m
for a l l for a l l
~ . ( - m ) = - m
- w + r = - m
x > 0 r E R
In the sequel we want t o deal with functions whose values are elements of I t turns o u t t h a t in a l l our definitions and proofs of the assertions in the f i r s t sections we need not change a single word i f we consider a t once the more general situation where a l l functions involved are allowed t o take values in R with order complete vector l a t t i c e R.
R .
So, from now on, l e t R be an order complete vector l a t t i c e . If the reader feels uncomfortable with the notion of general vector l a t t i c e s , he i s invited t o take R = IR
.
1.1.1.
Def i ni t i on :
i)
p : S fi i s subadditive, i f p ( 0 ) = 0 and p ( s + t ) I p(s) t p ( t ) for a l l s , t E S
ii)
q : S
iii)
p
: S
+
6 i s additive, i f
iv)
f :S
+
R i s monotone i f f ( s ) s f ( t ) whenever s
-.
+ fi i s superadditive i f q ( s + t ) 2 q ( s ) + q ( t ) for a l l
p
q(0) = 0 and s,t E S i s sub- and superadditive < t, s , t E S
Note, that the function which i s -- on S can neither be sub- nor superadditive since we required p(0) = 0 and q(0) = 0 in the preceding definition. On the other hand, define q : S + R by q ( s ) = if s E S 'I01 and q(0) = 0. Then q i s superadditive and even additive there i s no t E S with s + t = 0. Usually, we i f for every s E S'COI denote subadditive maps by p and superadditive maps by q . I t i s convenient t o use the symbol s for the pointwise order relation between functions on S , i . e . f 5 g i f f f ( s ) s g ( s ) for a l l s E S , where f,g: s + R .
-
Linear Functionak
4
1.1.2.
Sandwich Theorem:
Let p : -
S
be monotone and s u b a d d i t i v e -and l e t q : S + 6 -be superq s p. ---Then t h e r e i s a monotone a d d i t i v e p : S + R with
+
additive with
Remark
. q
, only
s u p e r a d d i t i v e and
q Ip
Note, t h a t we do n o t need monotony f o r
for
p.
Proof: In Q =
{p
pointwise
: S
R
+
I
o r d e r on
p
5
-
Q
S . C e r t a i n l y , q E Q, hence
pl
we c o n s i d e r t h e
* +. By Z o r n ' s
lemma
t h e r e i s a maximal c h a i n Q, i . e . a l i n e a r l y ordered subset o f Q, which .. D e f i n e ~ ( s )= s u p I p ( s ) l p E Q
i s maximal w i t h r e s p e c t t o i n c l u s i o n .
(1)
i s superadditive
p
We show t h a t
p
E Q with
p
p,
5
.
i s a maximal element o f p,
. Hence
would be a c h a i n c o n t a i n i n g
of
tj .
so E S
F i x an a r b i t r a r y a
= inf{
for
We c l a i m (1) - ( 5 ) and postpone t h e p r o o f s t o t h e n e x t page.
a l l s E S.
p 5 p
6
Q. Indeed, o t h e r w i s e t h e r e i s
for all
p
E
6
and thus
Q
U
{pol
properly. This contradicts the maximality
and d e f i n e
1 (p(n s o t t ) - p ( t ) ) l n €IN, t E S with u ( t ) + - - I
and
L(s) = sup{p(t)
t
0
s E S , where No
for all
(2)
u s u s p .
(3)
p
Thus,
= N U
with
t t m so < sl
IOl. We o b t a i n
i s monotone and s u p e r a d d i t i v e . p = p
be monotone.
since
m as ( m E No, t E S
p
,
i n view o f t h e m a x i m a l i t y of
We have
i s superadditive.
p
. I n particular,
p
must
5
The Sandwich Theorem
, we
Furthermore, u s i n g t h e d e f i n i t i o n o f Hence,
. Since
p ( s o ) = as
1
0
so E S
-
~ ( 5 )= as = i n f I T i ( p ( n s + t )
(5)
s
The map
+
conclude
s ;(so).
a
was a r b i t r a r y , we have
I
p(t))
s E S
for all
n E W, t E S l
.
i s subadditive.
as
Hence t h e theorem i s proved.
0
For r e a d e r s who a r e n o t t o o f a m i l i a r w i t h sub- and s u p e r a d d i t i v i t y we f i l l i n t h e d e t a i l s o f (1)
-
(5):
(1):
p ( 0 ) = 0 f o l l o w s from t h e d e f i n i t i o n . L e t
pl,p2
E Q
. Since
Because p
i s a chain, t h e r e i s
Q
s1,s2 E S . Consider with
E Q
p
pi
Ip ,
i = 1,2.
i s s u p e r a d d i t i v e , we have
P1(S1) + PZ(S2) 5 P(S1) + P ( S 2 ) I P(S1+S2) I !J(Sl+S2)
Hence, t a k i n g t h e suprema, we o b t a i n
+
p(sl)
.
p ( s 2 ) 5 p(sl+s2)
T h i s proves (1).
(2):
m = 0
Taking
We have m as 5 p(m so
+ t)
0
p(t)
I supIp(m
Ip ( s )
Take
+ so
m as
p(t)
for all
I m E INo, t E S
0
+
t)
for all
t sup{p(tl+t2)
hS1) +
u
+
I
(ml+m
with
m E INo, t E S w i t h
s E S
The monotony o f s1,s2 E S. Then
because
-
yields
m E INo
.
u 1.
and
t E S
with
. Hence,
P --m
i ( s ) = supIp(t)
(3):
;
i n the definition o f
(Recall, p
t
+
m so<
s)
t + m so< s l
i s monotone)
. .
i s an easy consequence o f t h e d e f i n i t i o n of ;(s1+s2) = s u p I u ( t ) + m as 1 m E H o , t E S , t + m S o ~ S 1 + S 2 } 0
)a
so
Imi
EN^,
ti E S
such t h a t
ti +mi so<si,i=1,21
ds2) i s superadditive.
( 4 ) : Using t h e s u p e r a d d i t i v i t y o f
u
s u c c e s s i v e l y we o b t a i n
Linear Functionals
6
n E
for a l l
n
p(so) t
(5):
IN
. Hence,
p(t) I
We have
p(n
so
t ) I p ( n so t t), n E N , t E S
t
p(m s) I m p ( s )
for all
s E S
s u b a d d i t i v e . Hence w i t h (*) we o b t a i n f o r f i x e d p(s
0
) = infI
n.m ( p ( n m
so t m t ) -
NOW, from t h e s u b a d d i t i v i t y o f
s1.s2
infer with
p
p(mt))
and t h e
and
. This
y i e l d s (4).
m E No s i n c e
p
is
m E IN
I n E H,t E S w i t h
p(t)+ -a)
superadditivity o f
u we
-
E S
d S 1 ) + u'(S2) =
inf{T1 (p(nmsltmtl)
-
p(mtl)+p(nm
s2+nt2)-p(nt2))lny m E N
tl,t2 E S
with
u(ti)
* - m y i=1,2}
The assumption on monotony o f p i n t h e a s s e r t i o n o f t h e Sandwich Theorem i s b y no means a r e s t r i c t i o n . I f an a r b i t r a r y s u b a d d i t i v e map p on S i s g i v e n w i t h q I p , t h e n we c o n s i d e r " e q u a l i t y " i n S, i . e . t h e pre-
.
o r d e r on S d e f i n e d b y s < t' i f f s = t, s, t E S Trivially, p monotone w i t h r e s p e c t t o < and t h u s t h e Sandwich Theorem y i e l d s an additive
1.2.
p
: S
+
with
q 5
p I
is
p.
CONES
F o r many a p p l i c a t i o n s o f t h e Sandwich Theorem 1.1.1. we need t h e n o t i o n o f cones. These a r e semigroups endowed w i t h mu1 t i p 1 i c a t i o n w i t h nonnegative s c a l a r s , i . e . elements i n RI, = {x E IR 1 x 2 01 . 1.2.1
Definition:
i) L e t (F,t) be an a b e l i a n semigroup. or ( f o r s h o r t ) a cone i f
F
--
i s d e f i n e d t o be a convex cone
7
The Sandwich Theorem
there is a map IR+ x F + F ((x,f) + x f , x E IR+,f E F) usual laws of multiplication with scalars, i.e. (Al
(Cl)
+
h2)
satisfying the
f = h l f + x2 f
(C2)
h(fl + f2) = xfl + xf2
(C 3 )
q$f) = (59) f
(C 4)
If = f
(C 5)
0.f = 0
for all x,hl,h2
E IR+
and f, fly f2
E
F.
cone F is called a preordered cone with preorder < , if (F, +, < ) is a preordered semigroup and < additionally satisfies h f < x g whenever f < g, f, g E F, x E IR+ . A
ii)
Note, that (C 5) is independent from (C 1) - (C4) . For example, take the semigroup I0,lI with 0 + 0 = 0, 0 + 1 = 1 + 0 = 1, 1 + 1 = 1 and define a multiplication by xf = f for all x 1 0 , f = 0,l. Then obviously ( C l ) - (C4) hold but (C5) is false since 0 * 1 = 1. On the other hand, (C5) is needed to prove the following trivial but indispensable Remark : Let F be a cone. Then A 0 = 0 for all x EIR, .
-
Indeed, (C5) implies 0
1.2.2 i) X
R+
.0=
0. Then with (C3)
x
n
= ( x O ) O = O . 0 = 0.
Examples Let X be a nonempty set. Then RX (E- valued functions on X ) and
(R+- valued functions on X )
are cones under the pointwise operations.
Here, R+ = { r E R I r 2 03 . If these cones are equipped with the pointwise order (i.e. f > g iff f(x) 2 g(x) for all x E X ) or with the pointwise order on some subset Y c X (i.e. f > g iff f(Y) 2 g(Y) for all y E Y ) then they are preordered cones.
8
Linear Functionals
ii) L e t T be a t o p o l o g i c a l space. Then t h e s e t s o f a l l I i - valued upper semicontinuous as w e l l as t h e l o w e r semicontinuous f u n c t i o n s a r e cones. iii) Vectorspaces iv)
( o v e r IR) w i t h t h e usual o p e r a t i o n s a r e cones.
< ) be an a b e l i a n semigroup and denote by (S, < ) * t h e monotone R- valued a d d i t i v e maps and t h e s u b a d d i t i v e
L e t S = (S,
t,
and (S, < )# maps r e s p e c t i v e l y . Then these s e t s a r e cones w i t h r e s p e c t t o t h e p o i n t w i s e
Rs
o p e r a t i o n s . I n f a c t t h e y a r e subcones o f
F a subset
G
c
F
i s s a i d t o be a subcone
. Here,
if
o f course, f o r a cone i s c l o s e d under a d d i -
G
t i o n and m u l t i p l i c a t i o n w i t h nonnegative r e a l numbers, i . e . t X2g2 E G
Xlgl
set T
x
Let al
t
tl,
g1,g2
S
o f a semigroup
whenever v)
whenever
. (Similarly,
if
tl t t2 E
whenever
al,a2
c
E A
F
x for
and
0 Ix 5 1
.
F. We endow
EatblaEA,bEBI
A = I x a l a E A3
A, B E Conv(F),
Conv(F)
=
T
i s s a i d t o be convex i f
L e t Conv(F) be t h e f a m i l y o f a l l nonempty convex subsets o f t h i s f a m i l y w i t h the f o l l o w i n g operations
A t B
a sub-
0 E T).
F be a cone. Then a subset A (l-x)a2 E A
t 0
i s c a l l e d a subsemigroup
and
t2 E T
x1 , x2
and
E G
x
L 0.
Then ( C l ) t o ( C 5 ) a r e e a s i l y v e r i f i e d , and
i s a cone under these o p e r a t i o n s . The n e u t r a l element o f t h i s
cone i s g i v e n by t h e s p e c i a l convex subset preordered cone i f we d e f i n e
A< B
iff
I01
c
F. Conv(F)
becomes a
A cB
Remark: The c o n v e x i t y o f t h e subsets i s necessary, o t h e r w i s e ( C 2 ) would n o t h o l d . ( v i ) A n i n t e r e s t i n g subcone o f Conv(F)
S(F) = I G G F 1 G
F I . For t h i s cone t h e c a n c e l l a t i o n l a w
i s a subcone o f
G t G 1 = G t G 2
*
i s g i v e n by
G1=G2
i s o b v i o u s l y n o t v a l i d . F o r example t a k e F = IRL and c o n s i d e r t h e f o l l o w i n g elements o f S(F) g i v e n by G1 = C(0,x) x E I R I ,
I
G2 = I(x,O)
Ix
E IRI
and
G = C(x,x)
1
x E I R I . Then
9
The Sandwich Theorem
G + G
3ut
+
G1
-IR 2 = G + G 2
1 -
G2. T h i s shows t h a t t h e r e a r e cones which a r e n o t sub-
cones o f vectorspaces s i n c e e v e r y subcone o f a v e c t o r space c e r t a i n l y satisfies (CL) (vi)
.
A r a t h e r odd example of
a cone i s t h e f o l l o w i n g . Consider
( t h e nonnegative f u n c t i o n s on some nonempty s e t X) multiplication and a d d i t i o n + by:
IR+ X
and d e f i n e s c a l a r -
0
for a l l fitg
A * f
=
fX
fu-g
=
f - g
and
h t 0
I: f,g E R
instead o f
hf
and
f
(Here we have chosen t h e symbols
x
+ g i n order t o prevent confusion w i t h the
usual m u l t i p l i c a t i o n and a d d i t i o n o f f u n c t i o n s ) . Then, i f we d e f i n e R:
f,
o
0' = 1,
becomes a cone under these o p e r a t i o n s . T h i s i s another example f o r a
cone which does n o t s a t i s f y t h e c a n c e l l a t i o n law.
1.2.3. Let
Definition: F
be a cone. A map
p : F
i s called functional.
+
A functional A E IR+, f E F.
p i s s a i d t o be homogeneous i f p ( x f ) = x p ( f ) f o r a l l A f u n c t i o n a l i s c a l l e d s u b l i n e a r ( s u p e r l i n e a r ) i f i t i s homogeneous and s u b a d d i t i v e ( s u p e r a d d i t i v e ) . A f u n c t i o n a l i s l i n e a r i f i t i s sub- and super1 inear.
1.2.4. Let -
Proposition: p be
(*) for a l l --
l i m sup
EJ.0
p ( ~ f )= 0
f E F. -Then e v e r y a d d i t i v e
(Recall t h a t
F and assume ~ that
s u b a d d i t i v e f u n c t i o n a l --on t h e cone
l i m sup
E J . 0
p I
p
i s linear. --
p ( ~ f )= i n f sup I p ( 6 f ) &
>O
I
E
t 61)
-
Linear Functionals
10
Proof: We have
mp
(1 m f)
=
n m
p(
since i s additive. Hence Consider some X 0 , x E IR,
*
rn
2 0
p ( f~)
such t h a t rn --t = p((x
- r n )f
1
f)
=
n p ( f ) for a l l
n,m E
IN
,f E
F
,
r ( f ) for a l l r E 4' r 2 0 . , and take an increasing sequence rn E Q ,
p(rf)
=
x ( r n + x in short). We have for f
) + u(rn f ) 5 P ( ( X - r n ) f
1
+
E F
rn ( f ) .
Taking the lim sup on b o t h sides we obtain by ( * ) t h a t
v ( X f ) s X p(f).
To prove the converse inequality we take a sequence rn E Q , rn
4 A.
Then
Certainly, every homogeneous functional p s a t i s f i e s (*). This enables us t o s t a t e the Sandwich Theorem now in terms of cones and functionals as a direct consequence of 1.1.2. and 1.2.4. This version of the Sandwich Theorem plays a central role in our theory. 1.2.5.
Let
Theorem:
g preordered cone and l e t p : F -, be monotone and sub1 inear, q : F + k superlinear with q s p. Then there i s 5 monotone linear p : F + R with q s p s p . F
Again, we emphasize t h a t the monotony of p does n o t mean a restriction. If no explicit preorder on F i s given, consider "equality". Then p becomes a monotone functional and 1.2.5. i s applicable. The notion of linearity we have adopted here indeed generalizes the usual definition of a linear map p : F + R , where F i s a vector space. To see this, l e t F be a vector space and take a functional p : F + R which i s linear according t o Definition 1.2.3. Since f E F, we obtain p((-x) f ) t p ( x f ) = ~ ( 0 = ) 0, x E IR, In particular p ( f ) > - m Thus our p ( ( - A ) f ) = - p ( f~ ) = ( - A ) p ( f ) . notion o f linearity coincides with the usual terminology in the vector space case. Let S be a group, i.e. an abelian semigroup with neutral element 0 such
.
11
The Sandwich Theorem
t h a t for every s E S there i s a n element -s E S vrith s t ( - s ) = 0. If U,V : S + R are additive maps with p I v on S then we can conclude p = v . Indeed, we have ~ ( s I ) ~ ( s ) and p ( - s ) s v ( - s ) , for a l l s E S. As before, we have p ( s ) t p ( - s ) = p ( s t ( - s ) ) = p ( 0 ) = 0, i . e . L I ( S ) = - u ( - s ) , and, similarly, v ( s ) = - v ( - s ) . Hence - ~ ( s )I - V ( S ) for a l l s E S. This yields p ( s ) = v ( s ) for a l l s E S . Thus, in the case of groups and additive maps, "domination means equality". Of course, here, the case of vector spaces and linear maps i s included.
SOME CONSEQUENCES OF THE SANDWICH THEOREM
1.3
Here we present some fundamental applications of the Sandwich Theorem. The theorems in t h i s and the next section are formulated in the context of semigroups. The corresponding assertions f o r cones are presented as corollaries (via Proposition 1 . 2 . 4 . ) However, we emphasize that the proofs for the semigroup case can be adapted immediately t o the case of cones. The reader merely has t o replace the words "sub- and superadditivity" by "sub- and super1 inearity", respectively. 1.3.1 Dominatina Extension Theorem: Let T -
be-a subsemigroup of the preordered abelian semigroup (S, < ) . Consider an additve map p : T + R and - a monotone subadditive p : S +
with l?t)
S
P(t)
for all t --
Then there i s a monotone additive ---L I S P 0" s. (by
'I
I LI
on T
I'
p
: S
+
+
R
with F(
we mean o f course ; ( t ) I
Proof: The map q : S
.
E T
R defined by
q(s) =
-
I LI
for a l l
p(t)
T
and -
t E T).
s E T
i(s)
if
-
otherwise
i s superadditive. The Sandwich Theorem 1.1.2. yields then a monotone additive p on S with q I LI I p , which means ;IU on T . o
12
Linear Functionals
The same argument as i n t h e preceding p r o o f , now w i t h an a p p l i c a t i o n o f Theorem 1.2.5 i n s t e a d o f t h e Sandwich Theorem 1.1.2.,
y i e l d s t h e cone v e r -
s i o n o f t h e Dominating Extension Theorem. On t h e o t h e r hand we can i n f e r t h i s v e r s i o n d i r e c t l y from t h e Dominating Extension Theorem by u s i n g P r o p o s i t i o n 1.2.4. Corollary: Let G -
(F, < ) . Consider -a linear G -and a monotone s u b l i n e a r p on F with
a subcone o f t h e p r e o r d e r e d cone
functional
i 2
Then t h e r e i s a monotone l i n e a r ----
p
p s p 0" F.
on F with -
I
on -
p
G and
The q u e s t i o n seems n a t u r a l whether i t i s always p o s s i b l e t o f i n d a monotone a d d i t i v e that is,
i n t h e p r e c e d i n g theorem which extends
p
G(t) = p ( t )
for all
i s a group. I n f a c t , i f T and hence ;(t) equivalent t o T
5
p(t)
and
;(t) = p ( t )
t E T.
t) I
for a l l
,
properly
T h i s i s c e r t a i n l y t h e case, i f
i s a group, t h e n
;(-
;
-t E T
for a l l
p(-t)
t E T.
f o r every t E T
t E T
which i s
I n p a r t i c u l a r , i n case t h a t
i s a vectorspace, t h e Dominating E x t e n s i o n Theorem i n c l u d e s t h e usual
v e r s i o n s o f t h e Hahn-Banach e x t e n s i o n theorem. The n e x t theorem p r o v i d e s us w i t h a necessary and s u f f i c i e n t c o n d i t i o n for
i
1.3.2.
t o admit a proper e x t e n s i o n . E x t e n s i o n Theorem:
canbe extended t o-a Then T, S, G , p be g i v e n as i n 1.3.1. on S ( i . e . 11 = u on T) with p 5 p on monotone a d d i t i v e p -
Let -
i f and o n l y i f ----
whenever
tl,t2 E T, s E S
and
tl < tp + s
.
S
'r
13
The Sandwich Theorem
Proof: (only i f part). then t ,t
1
;(tl) 2
= u(tl)
E T
and
(if part): Let for a l l
If
r E S.
p
5 p
u = u
i s a d d i t i v e and monotone and
I u ( t 2 + s ) = u ( t 2 ) + U(S) 5 ;(t2) + p ( s )
T
on
s E S,
for
tl< t2 + s .
+
$r) = i n f { i ( t )
p
p(s)
I
t E T, s E S
with
i s monotone, s u b a d d i t i v e and we have
From o u r assumption we o b t a i n
c 5 i;
on
r< t
p .
Hence
and t h e Sandwich Theorem y i e l d s a monotone a d d i t i v e u I U 5 u I = i on T. Now, n e c e s s a r i l y , u = ; on T
s)
i; I p on S .
T. On t h e o t h e r hand,
which f o l l o w s d i r e c t l y f r o m t h e d e f i n i t i o n o f
+ I on
=
i;
;, T
with
Again, these arguments c a r r y o v e r t o t h e case o f cones. A1 t e r n a t i v e l y , we can prove t h e cone v e r s i o n u s i n g P r o p o s i t i o n l . 2 . 4 . Corol 1a r y : Let -
G, F,
G,
Theorem 1.3.1. (i.e.
=
whenever
p
be g i v e n --as i n t h e c o r o l l a r y o f t h e Dominating p -can be extended t o-a monotone l i n e a r p
Then
u 0" G)
g1,g2 E G
with
,f
p
E F
I p ')" F ---i f and o n l y i f
and
_ .
91 < 92
Extension on F -
+ f -
As a consequence o f t h e E x t e n s i o n Theorem we o b t a i n a g e n e r a l i z a t i o n o f t h e w e l l known f a c t , t h a t t h e norm o f an element i s equal t o t h e maximum o f
1.3.3
x
x
o f a normed space
on t h e dual u n i t b a l l .
Norm Theorem:
Let S be-a preordered a b e l i a n semigroup. Consider a monotone s u b a d d i t i v e y p : S + R w i t h p ( n s ) = n p ( s j -f o r a l l s E 5 and n = 0,1,2, ... . Then p i s t h e p o i n t w i s e supremum o f all monotone a d d i t v e p 5 p and i s a t t a i n e d -a t some u , i . e . -for all f-o r e v e r y s E S t h i s supremum s E S -we have p ( s ) = maxIp(s) I p : S + R i s monotone, a d d i t i v e w i t h - p 5 p 0" S ) _ .
14
Linear Functionals
Proof: Let
s E S
and d e f i n e t h e subsemigroup
ii : T
L e t t h e a d d i t v e map n = 0,1,2,...
.
+
R
T = {ns
be d e f i n e d by
I
n= 0,1,2,
...I .
;(n s ) = p ( n s )
for all
Then t h e Dominating E x t e n s i o n Theorem p r o v i d e s us w i t h an
a d d i t i v e , monotone
!.I
:S
-,
R
such t h a t
!.I I p
T. Here t h e l a t t e r f a c t i m p l i e s e q u a l i t y on T
on
S
and
I !.I I
p
on
by d e f i n i t i o n o f
Corol 1a r y : Let -
p Then -p
the
&
p r e o r d e r e d c ~ n e F. monotone sub1 i n e a r f u n c t i o n a l fi i-s the pointwise ~ supremum o f a ll monotone li n e a r !.I I p
for every f E F
_.-
p ( f ) = max{U(f)
this supremum 3 a t t a i n e d
I 11
monotone, l i n e a r and
!.I
a t some
!.I
Ip
FI
,
and
i.e.
.
1 . 4 . SUM THEOREM AND FINITE DECOMPOSITION THEOREM As before, we f o r m u l a t e t h e theorems f o r b o t h cases, a b e l i a n semigroups and cones.
1.4.1.
Sum Theorem:
Let
be an a d d i t i v e 9 -on t h e
_.
!.I
-and l e t
pl,.
. .,p,
: S
+
!.I I p1 t
p r e o r d e r e d a b e l i a n semigroup
whenever
p2 t
*.. t
Pn
*
R with
uk
If, i n addition, -
!.I
...,un : S !.I,,
.
-,
I
that
r, t, sl,...,sk
< )
be monotone and s u b a d d i t i v e -such t h a t -
Then t h e r e a r e monotone, a d d i t i v e ul, --k = l,...,n, and !.I I !.I t !.I~t... t tone and i f we have ------
(S,
E S
such t h a t --
r < t t sk
, k = l , ...,n,
pk
,
i s mono--
The Sandwich Theorem
15
then we can assume
(**I
lJ =
+ u2 +...+ lJn
Proof: We consider
@
= S { l y * * * y n=l { ( s l ,
... , s n ) I
sk E S , k = l ,
..., n }
and denote
the diagonal by A @ ={(S,S,
...,S) I
s E
s}
@ i s a preordered abelian semigroup i f the preorder relation and the operations are defined pointwise, i .e.
+ tl’ ..., S n + t n ) n (s1,...,sn) < ( tl , . . . , t n ) i f f sk < t k for a l l k=l, ...,n ( s y . ., s n ) + (tl’“ . ’ t ) = (sl
.
i s a subsemigroup of 0 . We define an additive map : A @ -, R by (s,s,...,s) = ~ ( s ) , s E S . On @ we consider the monotone subadditive map p given by Obviously,
P(S”’..”Sn)
A @
=
Pl(S1) +
Pz(S2)
+...+
Pn(Sn),
S1’S2’“ ” S n
E
s.
We have I p On A @ in view of our assumptions. Hence we can apply the Dominating Extension Theorem 1.3.1. t o obtain a monotone additive map v : @ -, f? with 5 v on A @ and v 5 p on @ .I f , in addition, (*) holds, then the assumptions of the Extension Theorem 1.3.2. are s a t i s fied and we may even assume v = on A Q . Define p k ( s ) = V ( A s~ ) for a l l s E S , k = 1, ..., n , where s i s the k - t h component of A
i.e. a l l other components of A
A ~ S =(O,...,O,s,O,...,O), ~
Sand
~
S
are zero. The p k are monotone, additive and satisfy the required condi+ A,,S for a l l s E S. 0 tions since (s,s,...,s) = A ~ S ...+ Similarly as in the preceding section the cone case can be proven with the analogous arguments. On the other hand, using 1.4.1 and Proposition 1.2.4., we can derive the following corollary directly from the Sum Theorem.
16
Linear Functionals
Corol 1a r y : Let -
P
.,p,
ply..
&a
l i n e a r f u n c t i o n a l -on t h e p r e o r d e r e d cone (F, monotone sub1 i n e a r on F -such t h a t
and
P I
p1 t p2 t... t Pn
--Then t h e r e a r e monotone and
k = l,...,n,
linear
P I p
<) and let
*
pl,...,un
t p2 t.. .t pn
.
on F w i t h p k 5 pk,
If i n addition,
p
2 monotone
and i f we have ----
whenever
h,g,
E F
fl,...,fn
-such t h a t
h < g t f k ’ k = l,...,n,
then we -can assume --
(**I
P =
PI
-I.
v2
t... t pn
Note, t h a t i n t h e p r e c e d i n g a s s e r t i o n s , (*) i s a l s o necessary f o r ( * * ) . C o n d i t i o n ( * ) i s o f t e n s a t i s f i e d , f o r example, i f S has t h e s e m i i n t e r p o l a t i o n property:
A preordered a b e l i a n semigroup (S, < ) has t h e s e m i i n t e r p o l a t i o n p r o p e r t y . (SIP i n s h o r t ) i f f t h e r e i s s E S w i t h r < t + s and s < s k y k=1,2 whenever
1.4.2.
r,t,sk
E S
and
r < t t sk, k=1,2.
Lemma
semigroup (S, < ) -have t h e S I P . Then c o n d i t i o n ( * ) i---n t h e Sum Theorem 1.4.1 holds a u t o m a t i c a l l y f o r monotone a d d i t i v e Let the abelian ---p :
s+R.
Proof: Let
r, t, sk E S
S I P y i e l d s some
and
r< t
s E S
with
t sky
k = 1,2,...,n.
s < s k y k = 1,2,...,n,
Then, b y i n d u c t i o n , t h e and
r < t t s.
17
The Sandwich Theorem
Here t h e l a s t i n e q u a l i t y f o l l o w s from t h e monotony o f
Examples o f preordered semigroups w i t h t h e SIP i)
Let
Let
s
s k y r, t, s
t
k=1,2
r < t
and
E S, k= 1,2. Then w i t h
k t
e v e r y v e c t o r space has t h e
s . Hence e v e r y group
s1,s2
t < s k y k=1,2,
+
( - t ) we have
< ) such t h a t e v e r y two s, i . e . whenever t E S
(S,
have a g r e a t e s t l o w e r bound
E S
then
s = r
.
and, i n p a r t i c u l a r ,
.
SIP
ii) Consider a preordered a b e l i a n semigroup elements
.
be a group endowed w i t h an a r b i t r a r y p r e o r d e r r e l a t i o n
S
r < t
< s k y
.
11
t < s . I n t h i s case, o b v i o u s l y ,
S
has t h e
SIP.
We observe t h a t a g r e a t e s t l o w e r bound need n o t be unique, i f < i s n o t antisymnetric. Note, t h a t i n t h e r e m a i n i n g theorems o f t h i s s e c t i o n we have t o r e s t r i c t o u r s e l v e s t o t h e case
R = IR
.
1.4.3. F i n i t e Decomposition Theorem ( f i r s t p a r t ) : Assume t h a t -l e t 9, ...,pn -
S
: S
f o r a l l s E S. -xl t +...+ x n
Define
CI =
+6 be s u b a d d i t i v e -such t h a t
Then t h e r e a r e
X k 2 0,
k=l,
be a d d i t i v e and
...,n , with
= 1 -such t h a t
p I
Proof:
a b e l ia n semigroup. L e t 1-1 : S + l i ~
i s an -
IP1’.
Alp1
..
Y
t
Pnl
x2p2
+...+ x n D. n
= {q
I CP : { pl,...,pn}
+lil
.
@
t h e p o i n t w i s e o p e r a t i o n s . We c o n s i d e r t h e p o i n t w i s e o r d e r :
i s a cone under
18
Linear Functionals
iff
( p k ) 2 cp2 ( pk ) for a l l k = l , . . . , n . i s then a preordered cone. p : ID + I i defined by
'pl "cp2
(ID,i)
cp
1
p(cp) = max((p(pl), . . . , t p ( p n ) ) , q : ID
+ k , with
, i s a monotone sublinear functional.
cp E ID
q(Q) = S U p { p ( S )
IS
E
s with pk(s)<(p(pk), k = l ,... ,nl
for a l l cp E I D ,i s superadditive. (Recall sup(0) = - a ) . In view of our assumptions we have q Ip . Hence, by the Sandwich Theorem 1.1.2 there i s a monotone additive v on Q with q I v I p. From Proposition 1 . 2 . 4 and the homogeneity o f p we infer t h a t v i s indeed a linear functional on ID.Let s E S and define S E ID t o be the function with c ( p k ) = p k ( s ) , k = ~ , . . . , n . Let t i E ID be the element with Put
Xk =
&k 2 0
v(tk)y
and
v
&i(Pk)= 0 i f
k
#
k=l
k=l
n
- k=l Now ,
Ik
=
since
k
1 since
k=l
n
r
=
+Gk)
k=l
Indeed, t h i s i s clear, i f
-
l,...,n.
n
v ( - 1 ) Ip(-1) =
pk(s) > -
such t h a t
& k for a l l
00
pk(s) =
n
E N
-
1
n
(s)
Assume there i s k
=
o for a l l
=
1 w ( t k ) = ~ ( 1I ) p ( 1 ) = 1 and
u ( s ) Iq ( c ) I v
I
lk2
n i s monotone. We conclude t X k n
t .1( p 1. ) = 1, i,k
and
Then we have
k = l,...,n.
1 Xk =
Pk(s) &k
i
-
n
.
for a l l
s E S
for a l l
k = l,,..,n
m.
. Hence,
.
Then we have by the monotony of
v
,
Thus the preceding estimate holds in t h i s case, t o o , and the theorem i s proved
19
The Sandwich Theorem
Note t h a t the Finite Decomposition Theorem 1.4.3 includes already the case t h a t S i s a cone and a l l functionals involved are homoqeneous. So, in contrast t o the preceding theorems i t i s n o t necessary t o s t a t e the cone version of 1.4.3 separately. As an immediate corollary of 1.4.1., 1.4.2., 1.4.3 we obtain the second p a r t o f the Finite Decomposition Theorem. 1.4.4
Finite Decomposition Theorem ( p a r t two):
Let IJ:S -, 6 be additive -on the preordered abelian semiqroup : S +IR with and consider subadditive, monotone p l , . . . , p n ~ ( s )I max(pl(s), . . . , p n ( s ) ) 2 0,...,An
A1
n
1
k=l
Ak =
2 0
-for _ _a l l
s E S.
a n d monotone additive -
(S,<
)
Then there are ---
pk 5
pk, k
=
1,
...,n , -such t h a t
1 and
n
I n case t h a t ---
( S , <) -has the S I P we can assume t h a t
Corollarv (cone version o f 1.4.4.1
:
Let -
IJ : F -, t i be l ine a r on the preordered cone ( F , 4 ) and consider sublin ea r , monotone p l , . . . , p n : F +I6 with v ( f ) 5 max(pl(f), . . . , p n ( f ) )
-for a l l k
=
f E F.
l,...,n,
In case t h a t ---
--Then there are
n such t h a t z --
k=l
(F, < )
A1 2 0
and monotone linear
hk = 1 and
has the SIP we can assume~ that --
n
-
IJ k
5 P k Y
20
Linear Functionals
1.5 SOME ELEMENTARY APPLICATIONS
In this book we do not intend to go into details of semigroups. But since we stated the Sandwich Theorem in the context of abelian semigroups we like to start with some applications in this field. 1.5.1 The Phragmen
-
Lindelof Principle
An important tool in many areas of classical analysis - for example interpolation theory [331 - is the Phragmen - Lindelof principle. We demonstrate that this principle is a corollary of the Finite Decomposition Theorem. Theorem: L e t F(z) &a bounded analytic function on the strip 0 c Re(z) c 1 and assume that F ( z ) fi continuous on the closed strip 0 I Re(z) I 1. Then for 0 I o I 1 we have for all t E 1R
Proof: Let H be the multiplicative semigroup of all bounded analytic functions on 0 < Re(z) c 1, which are continuous on the closed strip 0 I Re(z) I 1 and fix some zo = xo t i yo in this closed strip. By "multiplicative" we mean that H is considered as a subsemigrobp of the cone given in example 1.2.2 (vi), i.e. that the semigroup operation in H is given by f fig = f g. Then by
an additive function is given on the mu1 iplicative semigroup H. The maximum principle for analytic functions imp1 ies
where po,pl,p are the following subadd tive functions:
21
The Sandwich Theorem
p ( h ) = l o g ( 1 i m sup yaR, 1-
sup o<x
I h(x
:rom t h e F i n i t e Decomposition Theorem we g e t
, + x1 + x
xo
= 1
I)
,
xo,xl,X 2 0 w i t h
= 1 such t h a t
It remains t o c a l c u l a t e t h e numbers
functions
+ i y)
i n the inequality (*).
h E H
.
- xo
Thus
-
by introducing special
xo,Xl,h
We c l a i m
by t a k i n g e x p o n e n t i a l s i n ( * )
1 = 0,
x1 = xo and
- t h e theorem i s proved
2 P r o o f o f t h e c l a i m : Consider t h e s p e c i a l f u n c t i o n h,(z) = ez , t h e n 2 2 p(ho) = l o g ( o ) = and u ( h o ) = xo - yo > - a3 . Hence A = 0.
-
Now, we i n s e r t
hl,2(z) i
Hence
hl = x
0
.
= e
i n (*)
xo = v ( h l , ? )
We c o n s i d e r a nonempty s e t
,t h e
X
0
=
i
xl l o g ( e )
1 we o b t a i n
= i
x0
x1 = 1
- x0 .
and a m u l t i p l i c a t i v e subsemigroup
bounded complex-valued f u n c t i o n s on
semigroup we mean, o f course, t h a t If
I xo.O
xo+xl+x
Because o f
and o b t a i n :
0
B i s h o p ' s (;enera1 V e r s i o n o f t h e "Three C i r c l e s Theorem"
1.5.2
BC(X)
iz
#
YcX
then
I( I I y
hl
denotes t h e
-
X
h2 E H(X)
H(X)
. By a m u l t i p l i c a t i v e whenever
Y-sup-norm g i v e n by
hl,h2
of
E H(X).
22
Linear Functionals
Theorem: - Let m : H ( X ) m(hl
*
h2) = m(hl)m(h2)
+
C be multiplicative, i . e .
for a l l
hl,h2 E H ( X ) .
m ( h ) I 11 h l l y
(*)
for a l l
h E H(X)
,
...,Y n
subsets such t h a t _ _ _ -of Y -- are nonempty _ n Y = Y1u Y2 u... u Y n then there are h i 2 0 & y n i = l i =1 such that -'n
and i f --
Y1,
Proof:
We may assume that H ( X )
contains the neutral element
lX
(constant function equal t o 1 on X ) , because otherwise we extend m without any difficulty to a multiplicative function on H ( X ) u Ilx1 by putting m ( l x )
=
1
.
Now, we consider the additive li- valued function given by p ( h ) = log(m(h)l and the subadditive functions defined by p i ( h ) = log11 h ( l , i = 1,..., n Then from ( * ) weget v 5 max(pl 'i n Hence by the Finite Decomposition Theorem p I z Xipi , where i =1 n A . 2 0 with 1 hi = 1 1 i =1
.
,...,D n ) .
.
Going back, by taking exponentials, immediately gives the theorem. Usually this theorem i s proved by means of Jensen measures for the rather special case of mu1 tip1 icative 1 inear functionals on function algebras bg]. For applications see [821.
1.5.3 Seevers' Proof for the Existence o f Jensen Measures The following proof i s modelled a f t e r a beautiful argument appearing in an unpublished paper of Galen L . Seever. Actually t h i s paper has drawn the
23
The Sandwich Theorem
a t t e n t i o n o f t h e f i r s t a u t h o r t o semigroup v e r s i o n s o f t h e Hahn-Banach theorem,
I n o r d e r t o a v o i d c o n f u s i n g o u r arguments w i t h measure t h e o r e t i c c o n s i -
d e r a t i o n s we p r e s e n t t h e theorem about t h e e x i s t e n c e o f Jensen measures i n a somewhat m o d i f i e d X
Again, l e t
be a nonempty s e t and l e t
semigroup o f
BC(X). By
f u n c t i o n s on
X. Note t h a t
u :
v : B,i(X)
a linear --
H(X)
# 0 and +
(*)
+
H(X)
form.
be a m u l t i p l i c a t i v e sub-
we denote t h e upper bounded li- valued
Bli(X)
Blk(X) = I l o g l f l I f E BIR(X)1, where
the real-valued functions i n Theorem: - Let assume that a --
-
- and by t h e same t i m e g e n e r a l i z e d
BIR(X)
are
Bg(X).
C be-a m u l t i p l i c a t i v e f u n c t i o n on H(X) and
I u ( h ) l I I( h l I X
li with
-f o r a l l h E H(X).
Then t h e r e i s
such t h a t : p ( f ) 5 sup f ( x ) -f o r a l l f E B,i(X) -XEX
lu(h)I 5 ev(loglh1)
-f o r a l l h E H(X).
I n ( * ) we assume i f and o n l y i f : _ -can __ _ e q u a l i t y ----
(**I such t h a t -Proof:
Consider on t h e mu1 t i p 1 i c a t ve semi group
BIR( X )
t h e f o l 1owing
s u p e r a d d i t i v e f u n c t on I h E H ( X ) w i t h I h l = I'fll, f E BIR(X)
= sup{loglu(h)
q(f
i s d e f i n e d t o be
where, o f course, t..e supremum o f Then
q 5 p
where
p
.
-
i s t h e s u b a d d i t i v e f u n c t i o n g i v e n by
P ( f ) = log11
fllx
I
f
E BIR(X).
From t h e Sandwich Theorem we o b t a i n an a d d i t i v e
i
with
q 5
iI p.
Linear Functionals
24
Hence,
(***) Consider
E3,jj(X).
logla(h)( 2 ;(\hi) O f course,
BG(X)
a d d i t i o n o f t h e f u n c t i o n s i n Bli(X) elements i n IR,
Thus
i
qE(X)
h E H(X)
.
i s a cone i f we t a k e now t h e F o i n t w i s e and p o i n t w i s e m u l t i p l i c a t i o n w i t h t h e
as t h e cone o p e r a t i o n s . Then
a d d i t i v e f u n c t i o n on
(since
for a l l
p ( f ) = ;(ef)
d e f i n e s an
with
was a d d i t i v e on t h e m u l t i p l i c a t i v e subgroup).
u must be l i n e a r b y P r o p o s i t i o n 1.2.4 and (*) f o l l o w s w i t h (***)
from: l o g ( a ( h ) l 5 ;(lhl)
= i(e’oglhl)
= p(loglh1)
I n case t h a t (**) holds we c o n s t r u c t o u r
.
w i t h t h e Extension Theorem
i n s t e a d of t h e Sandwich Theorem. We do t h i s i n such a way t h a t we have e q u a l i t y i n (***) which c l e a r l y i m p l i e s t h e a s s e r t i o n . I n t h i s case we cons i d e r t h e m u l t i p l i c a t i v e semigroup ( H I = { ( h ( \ h € H ( X ) I and d e f i n e an a d d i t i v e u on H by
T h i s d e f i n i t i o n i s n o t ambiguous because o f ( * * ) . Then by t h e E x t e n s i o n Theorem we can extend T h i s i s p o s s i b l e because (**)
u
t o an a d d i t i v e
5 p.
i s j u s t t h e e x p o n e n t i a l form o f t h e necessary
c o n d i t i o n i n 1.3.2.
T h i s shows t h a t (**) i s necessary and s u f f i c i e n t f o r
e q u a l i t y i n (*).
o
1.5.4
When i s a F u n c t i o n Dominated by an A r i t h m e t i c Mean o f o t h e r Functions?
I n t h i s subsection we prove a r e s u l t o f a somewhat c o m b i n a t o r i c a l nature, showing t h a t t h e F i n i t e Decomposition Theorem can be extended t o t h e most general s i t u a t i o n .
25
The Sandwich Theorem
Given a nonempty s e t X and
then our question i s : When i s of the functions f l , ...,f n ? Theorem: (i)
The following __ are
There are
n
cp(x) I
(ii)
cp
i =1
cp
.
,
and f l y . . , f n on X
pointwise dominated by an arithmetic mean
equivalent:
. ,An 2
hl,..
valued functions
li-
0
with z -
hi =
1 -such that
h i f i ( x ) -for a l l x E X
.
-
For every f i n i t e nonempty subset X c X w e have --
x
x
E Proof: ( i ) * ( i i ) : By adding u p the inequality in ( i ) for the we see that t- ~ ( ii s) dominated by an arithmetic mean of the corres-
;EX
ponding sums for the f l metic mean of numbers.
n
to fn
. Now,
( i i ) i s t r i v i a l , since an arith-
numbers i s less t h a n or equal t o the maximum of these
( i i ) ( i ) : From elementary algebra [ 65 , p.211 (construction below) we know that there exists a free abelian semigroup X* 3 X with neutral element which has the property t h a t any map T from X into an abelian semigroup S with neutral element can be uniquely extended t o an additive function from X* into S . Furthermore we know that X i s a s e t of generators of X* NOW, take lE f o r S and extend cp,fl, ,f n uniquely
.
...
t o additive 6- valued maps on X*. Then ( i i ) implies t h a t (p i s dominated by the maximum of the f l , ...,f n (since X generates X * ) . Application of the Finite Decomposition Theorem immediately yields the assertion of ( i ) . A
h
0
Problem: As an exercise the reader may prove a corresponding statement for the geometric mean o f positive functions. Construction o f the free abelian semigroup: a subset of
We may consider X
t o be
26
X*
Linear Functionals
= If
E :N
I
+
f(x)
f o r a t most f i n i t e l y many
0
x E X with t h e function zero.
X*
: X
-,S
: X*
+
‘I
which maps
6,
be a map i n t o an a b e l i a n semigroup S
1 and a l l
x+x
to
S, then o b v i o u s l y
g i v e n by 1 f ( x ) T(x),
=
f E
X€X
i s t h e unique e x t e n s i o n o f
Let
to
by i d e n t i f y i n g
i s an a b e l i a n semigroup under p o i n t w i s e a d d i t i o n . Now, l e t
;(f)
1.5.5
x
x E XI
T
x*
t o an a d d i t i v e f u n c t i o n from
X*
into S
.
Decomposition w i t h r e s p e c t t o P o s i t i v e l y Independent F u n c t i o n a l s F
be an a r b i t r a r y cone. A s e t
p1
,. .. ,p,
:F
-,li
o f sub1 i n e a r
f u n c t i o n a l s i s s a i d t o be p o s i t i v e l y independent i f , whenever n z xi pi 2 o f o r xi 2 0, i = l,...,n, then we must have i=1
x1
=
x2
... = xn
=
i f t h e r e i s some
= 0. T h i s cond t i o n i s q u i t e o f t e n f u l f i l l e d ,
f E F with
Theorem: L e t pl,...,pn ~f u n c t i o n a l s -and l e t pl(f)
5 0,
p2(f) I 0
p :
Proof:
F
= If
I
F +IF
,... , p n ( f ) n
u
pk f ) < 0, k = l,...,n.
be a s e t o f p o s i t i v e l y independent s u b l i n e a r
such t h a t -(*)
especially
k=l
XkPk
be l i n e a r such t h a t 5 0.
Then t h e r e a r e
p ( f ) I 0 whenever
xk
2 0, k = l,...,n
*
I t s u f f i c e s t o p r o v e t h e d e s i r e d i n e q u a l i t y f o r t h e subcone
E F I u(f)
choice o f
xl,...,hn.
+
-
=I
F \ F (*) i s t r i v i a l l y t r u e f o r every So we r e s t r i c t o u r c o n s i d e r a t i o n s t o f . The because on
assumption i n t h e theorem i m p l i e s
27
The Sandwich Theorem
Hence from t h e F i n i t e Decomposition Theorem we n e t
Xk 2 0, k =
1, ...,n,
with
n
and
n
X = I:
k=l
We know t h a t
n
X k 5 1. T h i s can be r e w r i t t e n as
1-
x
f
s i n c e we assumed t h e
0
pl,.
. . ,pn
t o be p o s i t i v e l y
independent. Hence
p s t - 'k
and t h e decomposition ( * )
'
'k
k=l 1-X
i s proved.
0
Now, l e t us a p p l y t h i s theorem t o l i n e a r f u n c t i o n a l s F(X) (i.e.
-
i s a subcone o f sup(f(x)) < XEX
the constant function subset
Y c X
Corollary:
Let -
+
and assume ~ that p(f) A
1> - 0,
Proof:
-
-
lX (beinq supy
sup f ( y ) YEY
for -
5 0
...,A n 2 0 -such t h a t p
I
+ f i , where
f o r a l l f E F ( X ) ) and where we assume t h a t F(X) c o n t a i n s
1 a t every x E X).
.
all
n t X k supx k=l k
We can assume t h a t t h e
F o r a nonempty
the f o l l o w i n q sublinear f u n c t i o n a l :
...,Xn _be_ a_ _f i _n i t e
X1,
: F(X)
lix c o n s i s t i n g of upper bounded f u n c t i o n s
we denote by f
p
covering o f
L
f E F(X) with f
X
(i.e.
I 0.
n U Xk = X ) k=l
Then t h e r e a r e ---
.
X1,.,.,X
n
a r e nonempty ( o t h e r w i s e we drop
28
Linear Functionals
those s e t s which a r e empty). NOW, we observe t h a t t h e f u n c t i o n a l s
, k = l,...,n, a r e p o s i t i v e l y independent s i n c e - lX E F(X). Hence k t h e theorem can be a p p l i e d imnediately t o t h e s i t u a t i o n under c o n s i d e r a t i o n .
supx
1.5.6
The Jordan Decomposition
For t h e n e x t a p p l i c a t i o n (due t o H. Konig [1991),let
be a q a i n a nonempty s e t and denote by B(X) t h e vectorspace o f a l l bounded, r e a l v a l u e d functions. A l i n e a r f u n c t i o n a l p : B(X) - r R i s s a i d t o be bounded i f
where
11 fll
(1 f (1
denotes t h e usual -sup-norm
X
.
= sup ( f ( x ) l XEX
We consider t h e p o i n t w i s e o r d e r r e l a t i o n ( f < g iff f ( x ) I g ( x ) f o r a l l x E X ) on B(X). Note, t h a t a l i n e a r f u n c t i o n a l v i s monotone w i t h respect t o
i f and o n l y i f
5
u ( f ) 2 0 whenever
f 2 0.
Jordan Decomposition Theorem For every -bounded l i n e a r f u n c t i o n a l -
on B(X) 1-1 = 1-1, Up
0" B(X) w i t h
functionals
there are --
-
and 11 1-111
monotone l i n e a r =
I( l-Itl(
t
11 p - l ( .
Proof: Define
p,(f)
for a l l
=
11 1-11)
f E B(X).
s u p I f ( x ) \ x E X I , f E B(X),
p,,
p-
u ( f ) I max(p+(f), p - ( f ) ) = Then 1.4.4 y i e l d s l i n e a r p =
A;,+
(1-k)ii
-
We o b t a i n
-
p,(-f)
f 2 O .
I
-
p,(-f)
I
-
(1
1-111
( 1 f 11
f o r a l l f E B(X). B(X) and 0 I A I 1 w i t h
iJ+(-f) = c,(f)
i - ( f ) I p,(f).
p_(f) = p t ( - f )
a r e s u b l i n e a r and we have
it,;-on G+ I p+, is p-
and
and p u t
Hence
;,(f)
.
I p,(f)
2 0
and and
similarly
( - i - ) ( f )2 0
whenever
29
The Sandwich Theorem
lG+(f)l, conclude 11
Since we
Note, t h a t t h e same p r o o f works f o r bounded l i n e a r f u n c t i o n a l s on subspaces of
E
B(X). On t h e o t h e r hand g i v e n a subspace
11
functional
on
c B(X)
and a l i n e a r
t h e n we may as w e l l a p p l y a t f i r s t 1.3.1 i n o r d e r t o
E
obtain a l i n e a r extension
: B(X) + R
p
of
with
11; I( = 11
.
pll
Then we can use d i r e c t l y t h e theorem above. I t i n c l u d e s t h e Jordan decomposition f o r measures. Consider a bounded s i g n e d measure T on X w i t h r e s p e c t t o some U- a l g e b r a ,I. Define E t o be t h e l i n e a r span of t h e c h a r a c t e r s t i c f u n c t i o n s of a l l a linear functional
p
E by p ( e )
on
=
X
A p p l i c a t i o n o f o u r theorem y i e l d s monotone Let
A E 1 with
IT(A)I
< m
and d e f i n e
edT
X
for all with
p + , 11-
r+(A) =
( l A denotes t h e c h a r a c t e r i s t i c f u n c t i o n o f p o s i t i v e bounded measures on
X
Z- measurable subsets of
T-(A)
p+(lA),
, I
E.
-
p = p+
A ) . Then t h e
w i t h respect t o
e E
and d e f i n e
T+,T-
=
11-
.
p-(lA)
are
and we have
T = T + - T - .
1.5.7
The Lemma o f Farkas
Next we proceed t o Farkas' Lemma which has become a useful t o o l i n mathem a t i c a l economy [104].0ur proof i s b a s i c a l l y t h e same as t h e one g i v e n b y Heinz Koniq i n h i s b e a u t i f u l l e c t u r e notes on Mathematische W i r t s c h a f t s t h e o r i e [ 201, p.321. Farkas' L e m w: space
E
tionals.
consider
a realvalued
l i n e a r functional
of r e a l v a l u e d
and a f i n i t e s e t
A = I~~,...,p~l
v
a vector
l i n e a r func-
If (*)
--then there are (**)
v(f) 5 0 hl
2 0,.
v =
n , I
i=1
whenever
. .,xn xi
pi
2 0
pi(f)
5 0
such t h a t
forall
i = lY...¶n
30
Linear Functionals
Remark: Of course, ( * ) i s also necessary for ( w ) .
.
Proof: We proceed via induction over the number of elements in A Recall t h a t v1 5 v 2 on a vectorspace E implies v1 = v 2 for a l l linear functionals v l y v 2
.
If A has only one element then this i s either equal t o zero or A i s a s e t of positively independent sublinear functionals. In the f i r s t case ( * ) implies v = 0 and ( * * ) t r i v i a l l y holds. I n the second case the assertion (**) i s a consequence of Theorem 1.5.5. NOW, we assume that the theorem i s true for arbitrary E and for a l l havinq 5 m elements.
A
We consider A = ~ U ~ , . . . , U ~If , ~A ~i s+ a~ s~e t. of positively independent functionals then ( * * ) i s again an immediate consequence of Theorem 1.5.5. So we are l e f t with the case t h a t A i s n o t positively independent. Then i t contains some element, say pm+l, such t h a t
-
=
m
1 akpk
k=l
for suitable a k 2 0, k = l y . . . , m
.
NOW, we r e s t r i c t a l l our linear functionals t o the subspace =
Ie E E\y,,+l(e) = 01. pl(e)
Then, for e E
I 0, ...,LI( e ) 5 0
m
By our induction hypothesis we get
u For
= 0
= (v
(i.e.
E =
m
1
k=l
Xkpk)
i) the
x1
E,
by ( * )
ensures
t 0,
...,x,
,
.
o
v(e)
I
1 0
such t h a t
i s equal t o zero on
-
E
.
proof i s finished. Otherwise the rest i s
linear algebra. Because then we can find f E E \ E
and p u t
31
The Sandwich Theorem
n i ng e)f E
i
for a l l
e E E.
v =
For
611 ( f ) 2 0
formula
um+l
t h e a s s e r t i o n i s proved. Otherwise we r e p l a c e i n t h e l a s t
m
- I
by
v =
As i n [201, p.331
ak
k=l
m 1
i=1
and g e t t h e d e s i r e d r e s u l t :
pk
-
(xi
611 ( f ) a i )
ui
I
0
one can use F a r k a s ' Lemma t o p r o v e t h e i m p o r t a n t f a c t
t h a t finite-dimensional
p o l y h e d r i c cones i n H a u s d o r f f l o c a l l y convex
v e c t o r spaces a r e c l o s e d . For t h e sake o f completeness we i n c l u d e t h i s r e s u l t here. C o r o l l a r y 1:
L e t xl,. -
. . ,x,
be elements _ o f -a
Hausdorff l o c a l l yconvex
t o p o l o g i c a l ~v e c t o r space. -Then t h e p o l y h e d r i c cone
K =
n {
1
i=1
XixiIX.20l 1
i s closed. -~ Proof:
Let
E'
, the
E
E t o be E = Cx E E f y ( x ) 5 01. Y Y i s o b v i o u s l y closed. Now, c o n s i d e r t h e elements of E as l i n e a r
and d e f i n e , f o r
E Y f u n c t i o n a l s on
Then
Xl,*..,X
be t h e vectorspace o f c o n t i n u o u s l i n e a r f u n c t i o n a l s on
n'
y E E'
E'
set
and a p p l y F a r k a s ' Lemma t o t h e f u n c t i o n a l s q i v e n by
Linear Functionals
32
This yields K =
n { E Iy
Hence K must be closed
Y
.
with y ( x i )
E E'
5 0,
i
=
l,...,n}.
0
Another useful corollary gives information a b o u t the support of certain linear functionals: Corol 1ary 2: F(X) be a cone of functions f : X + R . Let p : F ( X ) -,6 be 1 inear and consider x1 ,.. . ,xm E X -such t h a t p ( f ) = p ( g ) whenever --
Let -
f,g E F(X)
_ .
and -
Then there are real numbers
f ( x k ) = g ( X k ) ' k = I , . . .,m.
al, . . .,a m - with
p(f) I
Equality --holds for a l l
m
t a k f ( x k ) -for all f E F(X). k=l
f E F(X) with p ( f ) > -
co
.
Proof:
.
We only need t o consider the subcone p(X) = Cf E F ( X ) ( u ( f ) > - -1 Consider the vectorspace E = F ( X ) - ? ( X ) . We may extend p t o a linear functional on E by defininq ;(f-q) = p ( f ) v(q) for a l l f,g E F ( X ) . This definition makes sense since i f f-g = f-i, f , g , f , i E f ( X ) , we obtain p ( f ) t ~ ( 4 )= ~ ( 7 t) p ( q ) . P u t 6,(f) = f ( x ) , x E X , f E E. Then the assumptions o f Farkas' Lemma are s l t i s f i e d for i 6 ,..., * bX and i Indeed, l e t x1 m i 6 (f-g) I 0,i = 1,...,my for some f,q E E. Then f ( x i ) = q ( x i ) , i y...,m. xi Hence p ( f ) = p(g), t h a t i s ;(f-q) 5 0. By Farkas' Lemma n p = 1 (ai , for some a.,B. 2 0, i = l,...,m. This proves i =1 bXi - Bi b x1. ) 1 1
-
.
-
the assertion of Corollary 2.
0
33
Linear Functionals
The S e p a r a t i o n Theorem
1.5.8
Of course, t h e Sandwich Theorem i n c l u d e s t h e usual v e r s i o n s o f t h e Hahn
Banach Theorem. F o r completeness we demonstrate t h i s a t t h e example o f t h e S epara t ion Theorem.
Hahn Banach S e p a r a t i o n Theorem v e c t o r space. L e t E be a r e a l l o c a l l y convex Hausdorff t o p o l o g i c a l ___Consider _ convex_subsets and B of E with A n B = 0 such _ A ~0 -
that A
i s open. Then t h e r e i s a continuous l i n e a r f u n c t i o n a l --
w i t h u(A) n u(B) -
.
0
=
p
on E -
Proof: a.
F i x some A,,
Then of
E A
and d e f i n e
Bo
p ( e ) = i n f I x > Ole E for a l l
= l a - a o l a E A l , Bo = l b - a o l b E B I .
A,
Bo a r e d i s j o i n t convex s e t s and We assume
0.
A.
e E E.
Because Ao,Bo
0 , otherwise
P
x
0
p(e) <
for all
m
a r e convex we o b t a i n t h a t
s u p e r l i n e a r . Furthermore, s i n c e tains
0 ,we have By 1.2.5
e @ p A,
A.
whenever
u(a) < 1 f o r a l l
Hence
n p(B)
0
=
.
a E A.
e E E
since
A.
i s s u b l i n e a r and
=
0
and A.
e E
x
LI : E
and
Bo
+IR
0
=
- m)
i s absorbinq.
p
n Bo
we o b t a i n a l i n e a r
T h i s means p(A)
the assertion i s t r i v i a l . Define
A o I , q ( e ) = s u p l x 2 01 e E AB l ( w i t h sup
We have
q I p.
i s an open neighbourhood
q
is
i s convex and con-
. Thus
0 I I.I I x
and with
q I p Ip .
p(b) 2 1 f o r a l l
b E Bo.
0
Since we have spent so much e f f o r t on D r e s e n t i n g d i f f e r e n t v e r s i o n s o f t h e Hahn Banach Theorem t h i s book would c e r t a i n l y be i n c o m p l e t e i f t h e usual complex v e r s i o n cannot be found. So we do n o t r e s i s t t h e t e m p t a t i o n t o i n c l u d e t h i s theorem. O f course t h e p r o o f goes a l o n g t h e same l i n e s as t h e proof i n
-
a t least
Let
E
map
p : E +IR+
-
t e n thousand o t h e r books.
8 . A seminorm p p(xe) = I x [ p ( e ) f o r a l l
be a vectorspace o v e r with
on
E
i s a subadditive
e E
E, x
E
8
.
34
A map v(a el
Linear Functionals
-,C i s called complex linear i f e2) = a .(el) + B v ( e 2 ) for a l l el,e2 E E and a , B E C
v : E
t
~~
The complex version of the Hahn Banach Theorem: E a complex vectorspace consider a seminorm p Furthermore, -assume t h a t G i s-a subspace of E -and t h a t i s complex linear with [; I 5 p o n G ( i . e . 1; ( g ) l 5 p ( g ) ---Then there i s a complex linear I, : E + 6 with v = G 0" -.-_---
on E. -
Let -
: G
L
-
IvI 2 p
0" E.
+
C
for a l l g E G). -G and
Proof: Let course then a clude Define
and regard E and G a s vectorspaces over IR , then of the elements e 0 and i e are linearly independent. 1.3.1 yields linear u : E + I R with u I p on E and 5 I u on G. We conu = ; on G since G i s a vector space. v(e) = p(e) - i p ( i e ) for a l l e E E Then v i s complex linear
= Re
.
.
and extends Then since
1.5.9
For v ( e )
0
, hence p(i a e ) = 0 , Iv(e)l = p ( a e ) I p ( a e ) = p ( e ) .
= v ( a e ) = u ( a e ) - i p(i a e ) =
v(ae)
i s real
Thus
Affine Interposition and the Mazur-Orlicz Theorem
Let X c F be a convex subset o f some cone F i s called convex, i f
.
A function
f : X
4
fi
35
The Sandwich Theorem
f ( x x t (1-X)y) I A f ( x )
t
( 1 - x ) f ( y ) f o r a l l x,y E X, 0 5 A 5 1.
f
I f always t h e converse i n e q u a l i t y h o l d s t h e n
i s s a i d t o be concave.
A f u n c t i o n which i s convex as w e l l as concave i s s a i d t o be a f f i n e .
Problem: Given two f u n c t i o n s f,g h with f s h s g ?
: X
-,
fi , can we f i n d an a f f i n e f u n c t i o n
T h i s problem i s e a s i l y solved: The0 rem:
-There _ _i-s
an a f f i n e f u n c t i o n
h : X
n
whenever
n,m E N; n t i=o
such t h a t --
-,
6 with
f I h 5 g
i f and o n l y i f
m
ho,. =
. .,in, xo,. .. , X k
m t k=o
xk
= 1
and
-> 0
n I: xixi i=o
=
xo,
. . . ,xnYXoy.. . ,$, E
n t xkXn k=o
.
Proof: The n e c e s s i t y o f t h e c o n d i t i o n ( * ) i s obvious. Observe t h a t
x
inff
-,
m
t i k g(ik) k=o
1m
E N, i k > o w i t h t with
d e f i n e s t h e g r e a t e s t convex f u n c t i o n Furthermore x
+
sup{
n t i=o
x.1
f ( x . ) I n E N,Xi 1
: X
t Xkxk= -,
: X
1, ik E
-,
x
XI V
2 0 with
7
=
r? w i t h g
with d e f i n e s t h e s m a l l e s t concave f u n c t i o n
Xk
I g.
t xi = 1, xi E X 1 xixi
=
XI
fi w i t h f 5 'i
provided
X
36
Linear Functionals
that
f(x) < +
, since
(*)
(*)
x E X. B u t t h i s i s guaranteed i n o u r case by
for all
w
‘i I
means
4
on
X
. Hence t h e problem i s
reduced t o
f i n d i n g an a f f i n e f u n c t i o n between a concave and a convex f u n c t i o n . Consider t h e cone
Ix
X 8 R+ = {(x,h)
E X,
h > 01
u I01 where t h e cone
operations a r e defined by
X
a(x,x) = ( ~ ~ h . 6f o) r
6 > 0,
o+o
*
= 0, O ( X , A) = 0,o
0 = 0
Y
0
+
(X,X)
+0
= (X,X)
=
(X,X).
X B R+ i f x i s i d e n t i f i e d w i t h p : X Q R, -, 6 and a s u p e r l i n e a r
may be considered as a subset o f
( x , l ) . NOW, d e f i n e a s u b l i n e a r q : X8R++6
= A 4(XL
P(X,X)
Then
-f
I
by
4
yields
f u n c t i o n a l i n between
p(0) = 0 and q(x,h)
= h ?(x
Y
q(0) = 0
.
q I p and t h e Sandwich Theorem g ves us a l i n e a r
.
Restriction o f that linear functional
to
X
gives the desired
h
.
o
Corollary: Let f and g be f u n c t i o n s X + 6 -such t h a t f i s concave ~ and g convex. Then t h e r e i s an a f f i n e f u n c t i o n h w i t h f I h I g i f and - -----
if -
only
-
f I g.
Remark :
If t h e f u n c t i o n f i s n o t d e f i n e d on a l l o f X t h e n we extend i t t o X b y p u t t i n g f ( x ) = - w whenever X i s o u t s i d e t h e domain o f f The theorem t h e n goes o v e r unchanged. As a consequence we o b t a i n : Every convex f u n c t i o n i s t h e p o i n t w i s e supremum o f t h e a f f i n e f u n c t i o n s i t dominates
.
O f course, one recovers t h e Sandwich Theorem from t h e preceding i n t e r -
p o s i t i o n theorem by r e q u i r i n g ready a cone. I f X
f ( 0 ) = g(0) = 0
i n case t h a t
X
i s al-
i s i n a d d i t i o n a v e c t o r space then, i n t h i s s i t u a t i o n ,
t h e i n t e r p o s i t i o n theorem i s due t o Mazur-Orlicz Q210 (see a l s o 208 1). Even i n s p e c i a l cases t h i s r e s u l t has proved t o be v e r y useful .
37
The Sandwich Theorem
One m i g h t ask under w h a t k i n d o f c o n d i t i o n a bounded a f f i n e f u n c t i o n between f
and
g
can be found. We l e a v e as an e x e r c i s e t h a t t h i s can be done i f
and o n l y i f t h e r e a r e constants
whenever
n,m E N
and
such t h a t t h e r e a r e
I n t h i s case we have
1.6
THE TIESZ
- K'ONIG
-
m
< C1 5 C2 < +
m
such t h a t
h o y . . . y ~ n y?lo'..., A, 2 0, xlY...,xny
xoy
ko E
X
C1 I h 5 C2
-
X ~ ~ . . . m~ E X
X
with
.
THEOREM
The aim of t h i s c h a p t e r i s t h e g e n e r a l i z a t i o n o f t h e F i n i t e Decomposition Theorem t o a measure t h e o r e t i c s i t u a t i o n . The r e s u l t which we o b t a i n h e r e i s a r a t h e r powerful g e n e r a l i z a t i o n o f t h e c l a s s i c a l Riesz R e p r e s e n t a t i o n Theorem. We would l i k e t o c a l l t h i s g e n e r a l i z a t i o n t h e Riesz-Konig Theorem s i n c e t h e u n d e r l y i n g i d e a appeared i n a paper o f Heinz Konig [139]. For those readers who a r e n o t f a m i l i a r w i t h t h e n o t i o n s and techniques o f elementary measure t h e o r y we have gathered t h e necessary m a t e r i a l i n t h e
Linear Functionals
38
appendix. F i r s t , some n o t a t i o n . L e t
X
be a s e t and l e t
lydenotes t h e c h a r a c t e r i s t i c f u n c t i o n o f As b e f o r e we denote by
supy
Y
Y
, i.e.
be a subset o f X. Then 1 if xEY ly(X) 0 otherwise
={
t h e f u n c t i o n a l which assigns t h e v a l u e
.
I f Y .t: 0 t h e n supy i s a subs u p y ( f ) = sup f ( y ) t o e v e r y f : X -, li YEY l i n e a r f u n c t i o n a l on t h e cone o f upperbounded f u n c t i o n s on X. By USC(n)
we denote t h e cone o f upper semicontinuous f u n c t i o n s on a t o p o l o g i c a l
.
space
n
1.6.1
Riesz-Konig Theorem:
Consider a cone f f
F and and assume t h a t by - a compact H a u s d o r f f space R ----,T a f u n c t i o n F + USC(n) --___i s g i v e n such t h a t , -for all w E R , -, ? ( w ) i s sublinear on F , Moreover l e t LI : F -,6 _--be l i n e a r such t h a t -
Then t h e r e i s a r e g u l a r B o r e l p r o b a b i l i t y measure
u(f) I
Proof:
R
d.r
for a l l f E F --
T
on n with -
.
The p r o o f i s a s u i t a b l e a d a p t a t i o n o f t h e p r o o f f o r t h e F i n i t e
Decomposition Theorem t o t h e p r e s e n t s i t u a t i o n . So, d e f i n e a s u b l i n e a r f u n c t i o n a l
on
USC(n)
for all for all
p
and a s u p e r l i n e a r f u n c t i o n a l
6
as f o l l o w s :
h E USC( a ) . Here w
E R
. Of
-f
Ih
i s meant p o i n t w i s e , i . e .
course, t h e cone
t h i s pointwise order r e l a t i o n
s
.
a l i n e a r monotone ( w i t h r e s p e c t t o 6 I v I p. Then
USC(n)
f ( w ) 5 h(w)
i s an o r d e r e d cone under
From t h e Sandwich Theorem we o b t a i n I) f u n c t i o n a l v on USC(n) such t h a t
t h e Riesz Representation Theorem y i e l d s a r e g u l a r B o r e l
39
The Sandwich Theorem
measure
T
on
R
with
v(h) = v
Since
and
'I
E C(n) c USC(n).
I inf{v(h)
Ih
continuous w i t h
g I hl =
n
g dr
g E USC(n). A p p l i c a t i o n t o t h e c h a r a c t e r i s t i c f u n c t i o n s
-1,
Hence
n
i s monotone we have V(g)
for a l l
j h dT f o r a l l h
1,
yields:
T
(a)
v
= 1. Furthermore t h e monotony o f
i s p o s i t i v e . Therefore
T
obviously implies that
i s a p r o b a b i l i t y measure. The f o l l o w i n g
inequal it y completes o u r p r o o f : u(f) I E ( f ) I
"(7)
I
R
7
dr
,
f E F. 0
I t s h o u l d be observed t h a t t h e assumptions o f t h i s theorem a r e f u l f i l l e d
i n t h e s p e c i a l case when
n i s a s e t o f s u b l i n e a r f u n c t i o n a l s on
F
which i s compact under some t o p o l o g y such t h a t a l l t h e T , f E F , a r e upper semicontinuous. Here, o f course, by ^f we mean t h e e v a l u a t i o n : f(p) = p(f) set
R
for all
o f sub1 i n e a r
p€n
. Specialization
o f this situation t o a f i n i t e
f u n c t i o n a l s (equipped w i t h t h e d i s c r e t e t o p o l o g y )
recovers t h e F i n i t e Decomposition Theorem 1.4.3.: L e t pl, -
...,Pn
Proof:
Take
xi
be s u b l i n e a r -and l e t -
R ={pl,...,pnl
= ~ ( { p ~ } )i=l,...,n. ,
p
be l i n e a r on
and a p p l y 1.6.1. 0
F -such t h a t
Then p u t
Linear Functionals
40
1.6.2
Corollary:
Let -
X be topological Hausdorff space _.and l e t F be a subcone of USC(X). Assume n ___--t o be a compact subset of X -such t h a t :
supn(f)
=
supX(f) f o r a l l
f E F.
Then f o r every l i n e a r u on F with ---p(f)
supX(f) for a l l
I
t h e r e i s a Bore1 p r o b a b i l i t y measure ---p(f) 5
Proof:
Take
=
f
J f n
la
dT
T
f E F ,
on n with -
for all f --
E F.
and apply 1.6.1.
0
Later on, we shall use Corollary 1.6.2 i n connection w i t h boundaries ( t h e n i n t h e c o r o l l a r y will then be c a l l e d a sup-boundary o r even maxboundary s i n c e s u p n ( f ) = max f ( x ) f o r a l l f E USC(n)). XER
A very popular example f o r such a boundary i s given i n t h e following situation: Consider t h e Laplace equation
where f i s a continuous real-valued function on t h e closure G of some open, connected and bounded subset G of I R ~ , such t h a t t h e second p a r t i a l d e r i v a t i v e s o f f e x i s t and a r e continuous i n G. Such functions a r e c a l l e d harmonic. Let a G = E\G denote the topological boundary of G and l e t H ( E ) be the s e t of a l l harmonic functions on E Then
.
H(G) is not only a cone b u t a vector space. An important information about t h e harmonic functions i s contained in t h e following elementary result (of which we include a proof f o r the reason of completeness):
1.6.3
Maximum Princiole:
sup- ( f ) = max f ( t ) G
tEa G
for all
f E H(G).
The Sandwich Theorem
Proof:
If
f
i s c o n s t a n t , t h e n t h e a s s e r t i o n i s t r i v i a l . So, i t remains
t o deal w i t h t h e case when
to = (xl
0
0
, x2,.
.., x l
f
i s n o t c o n s t a n t . Assume t h a t t h e r e i s some
) E G such t h a t
f ( t o )> max f ( t )
t€aG
Then t a k e some (xl-xl)
0 2
I
p
41
> 0
p
.
such t h a t we have
for all
t = (x~,x~,...,x~) E
E .
And choose
E
> 0
so,
that
g(t) 5 f ( t )
we have
for all
t E
E.
But
proves t h a t t h e r e must be some
where
tl E G
g
a t t a i n s i t s maximum.
Elementary d i f f e r e n t i a l c a l c u l u s shows t h a t a necessary c o n d i t i o n f o r a maximum i s t h e f o l l o w i n g :
$2 Since
f
1
t=tl
5
0
for
i s harmonic we have a p p a r e n t l y
contradiction.
i = l,...,n
.
A g = 2~
> 0
NOW, i n t h i s c o n t e x t t h e meaning o f C o r o l l a r y 1.6.2 functions
f €
More p r e c i s e l y :
in
G
, hence
0
H(G)
i s t h a t t h e harmonic
a r e c o m p l e t e l y determined b y t h e i r values on
aG.
a
Linear Functionals
42
1.6.4
Proposition:
For every --
t
there - - i s a probability measure
G
E
f(t)
=
I
aG
f d~~
for all
0” a G -such t h a t
T~
f E H(G)
.
Proof: Use Coro for a l l f E H(G In case t h a t
G i s the open unit disc in
G = { ( r coscp, r sincp) 1 0
the measure
T~
(t d
=
sr
R2
< 1, 0 scp< 2 8 ) (polar coordinates)
( r , o ) ) i s the well-known ~Poisson measure, =
T t (cp)
P(r,o -cp)dm(cp)
where dm i s the Lebesgue measure on the unit c i r c l e and Poisson kernel ~-
P ( r , o ) i s the
n
P(r,o)
1 . 7 A STRASSEN
-
=
1 - rL 1 - 2 r c o s o t rz
TYPE DISINTEGRATION THEOREM
As in the case of the Finite Decomposition Theorem we can generalize the Sum Theorem to a measure theoretic situation. The resulting generalization i s very similar t o the Strassen disintegration theorem[304] which has proved t o be very useful in a couple o f applications. Although we can generalize some of the subsequent arguments t o the case o f 1 inear functionals attaining values in an order-complete vector l a t t i c e we shall r e s t r i c t our considerations t o li- valued 1 inear functionals. We do this in order t o make the results more transparent.
The Sandwich Theorem
We c o n s i d e r a measure space t o be
measurable f u n c t i o n s on
we denote
t h e convex cone o f
t
X
f dm <
may be equal t o in
, where -a
.
ments i n
$(m)
everywhere. I n
ft = sup(f,O). Hence, f o r
k and t h e f u n c t i o n
i s supposed
E- v a l u e d
such t h a t t h e i r p o s i t i v e p a r t ( b u t n o t necces-
X
s a r i l y the negative p a r t ) i s i n t e g r a b l e w i t h respect t o 1.e.
m
where t h e measure
(X,.I,m),
1 (m)
f i n i t e . By
U-
43
-m
m.
On t h e o t h e r hand,
1
f E LE(m)
i s an element o f
the integral
$(m).
J(f-ft)dm X
J f dm e x i s t s X
O f course, two e l e -
a r e considered t o be equal i f t h e y c o i n c i d e
$(m)
m- a l m o s t
we c o n s i d e r t h e p o i n t w i s e o r d e r .
We a r e i n t e r e s t e d i n o p e r a t o r s
P :
F -,k 1 ( m ) , where F i s some convex
cone. As u s u a l l y , such an o p e r a t o r i s s a i d t o be s u b l i n e a r i f i t i s p o s i t i v e l y homogeneous ( i . e .
P(Af) = x P ( f )
for
x
t 0
and
f E F) and
subadditive. I f i t i s superadditive instead o f subadditive then i t i s c a l l e d s u p e r l i n e a r . A l i n e a r o p e r a t o r i s one which i s b o t h s u b l i n e a r and superlinear.
NOW, i n s t e a d o f i n t r o d u c i n g i n
F a s i n g l e o r d e r r e l a t i o n we c o n s i d e r a
l a r g e c o l l e c t i o n o f order structures elements o f
X.
1:
~ I E xX I
b e i n g indexed by t h e
O f course, as b e f o r e , we assume t h a t a l l t h e < x are 1 P : F -,LE(m) i s c a l l e d
c o m p a t i b l e w i t h t h e cone o p e r a t i o n s . An o p e r a t o r
monotone w i t h r e s p e c t t o t h i s l o c a l i z e d o r d e r s t r u c t u r e ( o r fl,f2 E F ,we have
f o r short) if, f o r a l l
P(fl)
X- monotone
5
P(f2)
m- a l m o s t everywhere on { x E X l f l
< x f21.
44
Linear Functionals
Abstract Disintearation Theorem:
1.7.1
F -,6 ---be linear and l e t 1inear operator with
Let -
11 :
(*)
Then there --__ (i.e.
T(f)
u(f)
I
X
P : F
1 -, k(m) -be an
--
P ( f ) dm for a l l
f E F.
i s an X- monotone linear operator T : F 5
P ( f ) for a l l
X- monotone sub-
+
1 LE(m) with T -
IP
f E F) -such that
We should remark that the special case of t h i s theorem where F i s a vector space and where no order relation i s considered i s due to M. Valadier [3141 (see also M. Neumann [2431,M. Wolff[336land H . Konig [ 1991). The proofs of these authors do n o t carry over unchanged t o our situation since by considering cones instead of vector spaces one looses in general the required measure theoretic convergence property i f a 1 inear functional i s decomposed with respect t o an integral over sublinear functionals. To make even for that we have t o combine the usual proof with a maximality argument. The advantage of the somewhat a r t i f i c i a l order structure we introduced will become clear l a t e r on. Before going through a l l the details of the proof we would l i k e t o point out the connection between t h i s result and the Finite Sum Theorem.
1.7.2 Let -
Corollary: F -be_ _a _cone - - and l e t
N
be-a sequence -of order relations on -
n , (F, < n) i s-a preordered cone. Furthermore we sequence pn o f
F -such t h a t , -for each
consider
a
on F ---such t h a t , for a l l f -
E F,
we have --
45
The Sandwich Theorem
W
Z
n=l
Then, __
max(pn(f),O) <
for every linear 1.1 : F ---
tone linear functionals --
+
pn
pn I
p(f) I
Z
n€N
0
r? with
. x pn there are
I
1.1
nEN
-$,-mono-
such t h a t
p n ( f ) for all
f E F
Proof: equal t o N , l e t m be the counting measure on N and l e t the < n define the localized order structure. Let the operator P : F + be given by P ( f ) ( n ) = p n ( f ) . Apply the Disintegration Theorem and obtain Put
X
the
1.1~
G(m)
via
un(f) = T(f)(n).
0
NOW,l e t us return to the proof of our theorem: Proof of 1 . 7 . 1 : Let o be the convex cone consisting of a l l simple x-measurable functions cp : X + F. Here, a function cp i s called simple i f c p ( X ) i s a finite s e t and i f , for every f E F, the s e t {x E Xlcp(x) = f l belongs t o 1 I n o we consider the preorder given by:
.
Then
defines a monotone sublinear functional on
o
,
Linear Functionals
46
And
I
6(v) =
v(f)
if u, i s c o n s t a n t ( w i t h v a l u e f ) on
-
otherwise
00
gives us a s u p e r l i n e a r f u n c t i o n a l on
a,
, with
Sandwich Theorem t h e r e i s a monotone l i n e a r
6 I p.
with
u
u s i n g Z o r n ' s lemma we can f u r t h e r assume t h a t linear functionals v I
,
Ip
if G : o
i.e.
s p then necessarily
V
According t o t h e
. And
6 Iu I p
by
i s maximal among t h e
v
-6
X
i s monotone l i n e a r w i t h
( t h i s i s e x a c t l y t h e argument we used
= v
i n t h e f i r s t p a r t o f t h e p r o o f o f Theorem 1.1.2). Now, f o r
where
A E 1 and f E F
, we
define
lA i s the characteristic function o f
1Af(x) = I f
A
,
i.e.
i f x E A, 0 o t h e r w i s e } . We c l a i m t h a t f o r
f,g E F and
A E t the following are true: (2)
d(A,.)
i s l i n e a r on
(3)
d(.
(4)
v ( f ) -< d(X,f)
(5)
d(A,f) I
(6)
when
(7)
i f An
,f )
i s an a d d i t i v e s e t f u n c t i o n on
A
f <x
x
P(f)dm g
f o r m-almost a l l
x E A
then
d(A,f)
i s a sequence o f p a i r w i s e d i s j o i n t s e t s i n z
u
nEN The a s s e r t i o n s ( 2 )
F
-
A,,f)
= lim inf
M+w
M
1 d(An,f)
n=l
5 d(A,g)
then
.
( 7 ) prove t h e theorem i n t h e f o l l o w i n g way:
( 3 ) and ( 7 ) show c e a r l y t h a t
-
d( ,f)
i s a signed measure on
X . A s s e r t on
47
The Sandwich Theorem
m.
( 6 ) i m p l i e s t h a t t h i s measure i s a b s o l u t e l y c o n t i n u o u s w i t h r e s p e c t t o f <x
T h i s i s so, because from m(A) = 0 we o b v i o u s l y g e t 0
i x f for
x E A
almost a l l
, and
hence
d(A,f)
= d(A,O)
0
and
= 0.
NOW, we a p p l y t h e Radon-Nikodym theorem t o f i n d a measurable f u n c t i o n
T(x)
such t h a t (8)
d(A,f) =
T(f)dm.
A
Then, because o f ( 5 ) , t h e p o s i t i v e p a r t o f
m. ( J u s t c o n s i d e r i n ( 5 ) A = I x € X I T ( f ) ( x ) 2 0 1 . ) 1 LE(m). A s s e r t i o n ( 2 ) g i v e s t h a t f + T ( f ) i s
w i t h respect t o
So
T(f)
T(f) (i.e. T(f)+) i s integrable
must belong t o
l i n e a r , and f r o m ( 4 ) and ( 5 ) we o b t a i n ( * * )
and
T ( f ) I P ( f ) . To prove
A = { x E X I T ( f ) ( x ) > P ( f ) ( x ) ) . Then ( 5 ) shows t h a t m(A) = 0. F i n a l l y , we show t h a t f + T ( f ) i s i n f a c t X- monotone. Consider f , g € F , p u t B = I x € X I f <x g 1 and assume
the l a t t e r i n e q u a l i t y consider
T(f)(x) > T(g)(x)
x € A c B with
for
g e n e r a l i t y , we may f u r t h e r assume t h a t replace
A
m(A) > 0.
1 T(f)dm
Then, w i t h o u t l o s s o f >
A
( o t h e r w i s e we
--m
by a s u i t a b l e s u b s e t ) . And we have i n c o n t r a d i c t i o n t o ( 6 ) = d(A,g)
.
( 2 ) and ( 3 ) a r e easy consequences o f t h e l i n e a r i t y o f
v
d(A,f)
=
A
T(f)dm >
1 T(g)dm
A
So we a r e l e f t w i t h :
Proof o f ( 2 )
-
(7):
f o l l o w immediately from Then
.
-
6 I v I p.
Let
lA f < lA g and b y monotony o f
So we have a l s o proved ( 6 ) .
f <x
v
g
, and ( 4 )
and ( 5 )
f o r m- a l m o s t a l l
we g e t :
x€A.
4a
Linear Functionals
The proof o f ( 7 ) i s a l i t t l e b i t more complicated and depends e s s e n t i a l l y on the maximality o f a r b i t r a r y cp E
(9)
where
@
v
. So,
P(Q) = v ( l y
Y = X
U An
c~
l e t the
:
n€N
M
cp) t l i m i n f
M
. Then
be as i n ( 7 ) and d e f i n e f o r
An
Z
n=l
+ m
v(1
An
. cp),
i s s u p e r l i n e a r (because o f the i n f i n the
p
p . The u- a d d i t i v i t y o f m i m p l i e s use the f o l l o w i n g obvious i n e q u a l i t y :
l i m i n f ) and
where
I
ZM = X \ ( Y
u
M m U An) = U An n=l n=Mt1
.
Since t h e
p 2
u. To see t h i s we
ZM are decreasing t o
0 we get: l i m sup w(l
M +-
zw
-
cp) I
I
l i m sup p(1 M +zw
l i m sup M+m
This i n s e r t e d i n (10) leads i n f a c t t o
- cp)
I
P(cp(x))(x)dm(x) s ZM
p 2 v
. Now,
o
.
we apply t h e Sandwich
Theorem t o o b t a i n a monotone l i n e a r w i t h p 1 7 I p. Then, because o f p 1 u and t h e f a c t t h a t v was already maximal, t h i s y i e l d s v = Hence p = w I n s e r t i n g t h i s i n ( 9 ) and p u t t i n g cp = 1 u An * we get n a the desired r e s u l t . D
.
.
49
The Sandwich Theorem
1.8 SOME APPLICATIONS 1.8.1 An abstract Flow Theorem In t h i s section we give an abstract F.JW Theorem which l a t e r on wil turn o u t t o be very useful in applications to network theory and to supplydemand models .
All measures in t h i s section are assumed to be k? or R- valued. We consider a measurable space (n,I) (n a s e t and Z a U- algebra in n) and some positive measure T on X = n x n (of course with respect t o the product U- algebra 1 8 Z ) . Since we do n o t want to overload t h i s section with technical d i f f i c u l t i e s we assume, for simplicity, t h a t T is f i n i t e . Furthermore we consider a signed measure !J on (n,x). We recall + t h a t u can be s p l i t u p in the following way !.I = !.I - !.I with positive t imeasures !.I ,!.I, where u i s f i n i t e (Appendix Theorem 1.5.2). We need t o introduce the notion of bimeasure (see[168] or r1941). A bimeasure on X = n x n i s a function v : Ixx -,R being a signed measure separately in each variable, i . e . for fixed A E t the functions B -, v(A,B) and B -, v(B,A) are signed measures on ( ~ , x ) . Sometimes such a bimeasure can be extended t o a n honest measure on the product u- algebra, b u t t h i s i s n o t always possible. For t i g h t measures such an extension does n o t cause any problem ( [ 168, thebrPme 41 or [ 194 , lemma 31). Before we Proceed t o the main r e s u l t of t h i s section we have t o work o u t some technical d e t a i l s . By F we denote the convex cone of measurable, positive and simple functions on n , i . e . every f E F i s of N the form f = I a 1 , where a 2 0 , An E 1 f o r a l l n . An n n= 1
To every f E F we assign a nonnegative function f on the product space X = n x n by defining L
f(wl , w 2 )
=
max(O,f(wl)
-
f(w2))
for all
w1,w2
E R
50
Linear Functional$
I t i s not d i f f i c u l t t o verify:
Observation: (i) The map
(ii)
f --.
Let f , g E -
7 i s sublinear
F
and assume that ---
whenever g(w) >
0
f ( w ) = sup f(E) EER
. Then
n
(ftg)='ft;j.
I n f a c t , only the second assertion i s n o t completely t r i v i a l . (For i t s proof one has t o consider the four different cases which can occur for wIyw2
namely (1) g ( w l ) = 0, g ( w 2 )
(3) g ( q )
*
0
9
4(9) = 0
Y
*
0, ( 2 )
g(w1)
=
g(w2) = 0
* 0 * gbp)).
(4) ! A w l )
We shall need the following technical result: Lemma: -The
following are equivalent:
(i)
u ( A ) I - ~ ( A XCA)
for all
A E 1
(ii)
J f
for a l l
f E F.
(Here
CA
n
dp I
J 7 X
d-r
denotes the complement of
A
in n)
.
Proof: ( i i ) * ( i ) : For an arbitrary A E and from ( i i ) we get: p(A) =
J f
n
dp I
x we take f
-
J f d-r X
= lA
. Then
-
f=
lAx CA
= - r ( A x CA)
( i ) * (ii): An easy computation sho1,'s t h a t every f E F can be written in the following form:
The Sandwich Theorem
51
N f = . x A l n=l An with
Xl
,... ' A N z
and A1
0
,... ,An
E Z such t h a t
NOW, u s i n g s u c c e s s i v e l y p a r t (ii) o f o u r o b s e r v a t i o n we o b t a i n :
-f =
N Z X l n = l n AnXCAn
-
A p p l i c a t i o n o f i n e q u a l i t y ( i ) then y i e l d s :
1f R
du
N =
Z
n=l
u (A,)
An
I
N X An T(A,,x n=l
CA,)
=
I ^f d t .
0
X
Flow Theorem [128]: The f o l l o w i n g are equivalent: (i)
p(A) I .(AX CA)
(ii)There i s
2
for all
A E Z
-_.
bimeasure w
on -
X = nx R
having t h e f o l l o w i n g
properties: (a)
p(A) I w(Aya)
(b)
w(A,B) I T ( A x ( B
(c)
w(A,B) t 0 whenever
P r o o f : (ii) =b ( i ) :
for all A E --
n
CA)) _ f o_r -a l l
*
(ii):
defining, f o r
From ( i i a ) and ( i i b ) we o b t a i n :
We i n t r o d u c e i n
x = f sxg
AyB E 1
AYE E 1 are disjoint.
p(A) 5 w(Ayn) 5 T ( A X (Q (i)
Z
(w1,w2)
f(wl)
E
F
a
R X
R
s g(wl)
n
CA)) = T ( A X CA).
l o c a l i z e d o r d e r s t r u c t u r e on
and
f(w2) 2 g(w2)
.
X =
R X
R
52
Linear Functionals
Now, assume f sX g holds. Then for f(w2) 5 f(wl) we get q b 2 ) 5 g(w1) a n d
If
f(w2) 2 f(wl) then f ( w , , w 2 )
t o !j(w,,u2).
0 and this must be less than or equal
=
So we have i n b o t h cases
-
f(w1,w2) I
?j(w,,w,).
Hence the map f + P ( f ) = f i s X- monotone. Now, consider the linear function : F -, R given by i(f)
=
n
f dp
.
Then, according t o the Lemma, ( i ) i s equivalent t o ;(f) I
IX P ( f ) d T
for a l l f
E
F.
From the abstract Disintegration Theorem 1 . 7 . 1 we then obtain a 1 tone linear map T : F -, LR (T) such t h a t
for all
f
X- mono-
E F.
We define v(A,B)
=
I
T ( l A ) dr
n xB
for A,B
E
z ,
and we claim t h a t this v has the required properties. As an immediate consequence of this definition v i s additive in the f i r s t variable and u- additive in the second.
Consider A,B E 1 with A x E n x B c nx CA.
n
B = 0 . Then 0 sX lA for all
So, from the
X- monotony of
T we obtain
The Sandwich Theomm
53
and ( c ) i s proved. The a s s e r t i o n ( b ) comes d i r e c t l y f r o m ( 2 ) :
=
J l A d.r x=C T ( A xA (B nCA)).
QXB
And ( a ) i s a consequence o f (1): p(A) =
1 du 5
R A
T ( l A ) d T = v(A,n).
RxR
A l l what remains t o prove i s t h e
additivity o f
a-
B E Z and
v a r i a b l e . F o r t h i s we f i x a r b i t r a r y (i.e.
n An
nEN
(3)
=
v
i n the f i r s t
An E X w i t h
An
+
0
0 and A1 2 A2 2 ...? An 2 . . . ) . A l l we have t o show i s :
l i m v(An,B) n-m
=
0.
F o r t h i s we s t a r t by s t a t i n g two h e l p f u l convergence p r o p e r t i e s . F i r s t we consider
B,
E II
such t h a t
0 5 v(An,Bn)
Ann B,
5 T ( A x~ (Bn
Hence
(4) l i m v(An,Bn)
=
= 0
n-co
0
. Then
n CA,))
u s i n g ( b ) and ( c ) we g e t : 5
T ( A ~x Q ) .
.
Furthermore, from u(An) 5 ~(A,,R) we g e t
(5)
l i m v(An,Q) = 0 . n-m
I T(A,x
CA,)
Ir ( A n x
R)
54
Linear Forictionals
Now, we use t h e a d d i t i v i t y of v ( ~ n , ~= ) ,,(A,,B =
v(.)
i n both i t s variables:
n CA,) t ~ ( A , , , B n A,,)
v(An,B n CA,) + u ( A n nCB,B n A n )
= v(An,B
n CA,) + v ( A n K B , B n An)
t
\](An
t
v ( A n n B,U)
Il B,B
n An)
- u(Ann B, C(B n A , ) ) .
The f i r s t , second and fourth term converges t o zero by v i r t u e of ( 4 ) , a n d 0 the t h i r d does t h e same because o f ( 5 ) .
1.8.2 Flows i n networks One of the basic r e s u l t s i n t h e theorey of networks i s t h e Ford-FulkersonTheorem (max - flow - min - cut Theorem) ( s e e 11101 o r 11351 ) . There a r e very many v a r i a n t s and equivalent forms of t h i s theorem which a r e of g r e a t value in several f i e l d s of a p p l i c a t i o n s . One of t h e s e theorems i s the celebrated Gale-Ryser theorem. I t deals w i t h a somewhat more sophisticated s i t u a t i o n than t h e c l a s s i c a l Ford - Fulkerson r e s u l t , h u t i t can be - a t l e a s t f o r f i n i t e networks - obtained from the l a t t e r one. I t was found independently in the context o f networks by D. Gale ( [ 1 3 6 ] a n d in connection with zero-one matrices by H. Ryser ( [ 2 7 9 1 see a l s o t h e survey [ 2801).
I t should he mentioned t h a t usually most of the theorems f o r networks a r e proved by combinatorial arguments, nevertheless most of the underlying problems make sense f o r n o n f i n i t e networks, even f o r nondiscrete networks, where combinatorial arguments c e r t a i n l y f a i l .
I n t h i s section we show t h a t in f a c t the Gale-Ryser Theorem ( f o r a r b i t r a r y networks) i s a special case of our Disintegration Theorem o r r a t h e r t h e a b s t r a c t Flow Theorem. F i r s t we explain the s i t u a t i o n considered in Gale's Flow theorem. There i s given a f i n i t e s e t $2 o f - l e t us say - o i l consumers a n d the consumption of i E $2 i s measured by p i . Negative consumption p i < 0 means production of Illi I .Furthermore, t h e r e a r e pipelines between the consumers.
The Sandwich Theorem
55
measures t h e c a p a c i t y o f t h e p i p e l i n e r u n n i n g f r o m
T~~
Note, t h a t i n general
‘ik t
k
i.
to
(e.g. t h e p i p e l i n e i s g o i n g down a h i l l ) .
T~~
So i t i s b e s t , t o imagine t h a t t h e p i p e l i n e s between
i and
k
p a r a l l e l one-way s t r e e t s . O f course, i f t h e r e i s no p i p e l i n e from then we assume
a r e two k
i
to
t o be zero.
T~~
Now, t h e problem i s , t o g i v e c o n d i t i o n s f o r a p o s i t i v e and p o s s i b l e f l o w which s a t i s f i e s t h e consumption. To be more p r e c i s e , we assume t h a t a f l o w i s r e p r e s e n t e d by numbers
vik
positive i f
i
vik
5
every
T~~
vik
t 0
for a l l
iE n
f l o w i n g from
,
for
i , k E n.
i).The f l o w i s c a l l e d k , and i t i s s a i d t o be p o s s i b l e i f ( f l o w from
k
to
The f l o w s a t i s f i e s
t h e t o t a l amount f l o w i n g t o
t h e consumption i f , f o r
i minus t h e t o t a l amount
i dominates t h e consumption (minus p r o d u c t i o n r e s p . ) a t
Note, t h a t i n t h i s (and a l l t h e f o l l o w i n g ) c o n d i t i o n s t h e numbers do
vii
n o t p l a y any r o l e . U s u a l l y , these numbers a r e d e f i n e d t o be zero.
Now, we i n t e r p r e t a l l q u a n t i t i v e s as measures on
n o r n x n i n order
t o be a b l e t o w r i t e down o u r c o n d i t i o n s i n a more e l e g a n t form. We a b b r e v i a t e f o r
A,B c R :
and kEB
kEB
i:
56
Linear Functionals
Then the condition on t h e flow t o s a t i s f y consumption i s t r i v i a l l y equivalent to: p ( A ) 5 v(A,n)
-
v(n,A)
for all
A c R
.
For A c R we define the import capacity t o be T ( A X C A ) , t h a t i s t h e capacity of a l l pipelines coming from outside A i n t o A . Obviously, a necessary condition for t h e existence of such a flow i s t h a t t h e import capacity i s s u f f i c i e n t in t h e following sense: ,,(A)
I T(A x C A )
for all
A
=R
Note, t h a t t h i s condition a l s o requires t h a t overall production dominates overall consumption, this because of
We a r e now going t o generalize t h i s problem f o r i n f i n i t e consumer s e t s . On the f i r s t view t h i s does not seem t o be a relevant problem. B u t t h i s generalization i s necessary i f one i s - f o r example - i n t e r e s t e d in t h e dynamical behaviour of such a system. Let us f o r example consider t h e above problem f o r i n f i n i t e l y many d i f f e r e n t points T on t h e time s c a l e , w i t h the provision t h a t every consumer i has t h e p o s s i b i l i t y t o s t o r e o i l from tl
t o t2 u p
consumer s e t i s c e r t a i n l y capacity from
(i,tl) to
t o the amount a it n x
T and a it
1, 2
1’ 2
. Then
t h e mathematical
represents the p i p e l i n e
( i , t 2 ) . Certainly a n i n f i n i t e network system!
For t h e i n f i n i t e system i t seems appropriate t o replace t h e q u a n t i t i e s V,T and v by s u i t a b l e measures. So, l e t (nJ) be a measurable space, where R i s c a l l e d the consumer set and where t is a a- algebra on R . We consider a signed consumption measure p on (n,x) measuring t h e consumption and t h e production, respectively. Furthermore, we consider a p o s i t i v e and f i n i t e measure T on X = n x n (with respect t o z 8 x) , and we assume t h a t T ( A X B ) measures the capacity of the pipelines going from B t o A . Therefore T is c a l l e d
57
The Sandwich Theorem
t h e c a p a c i t y measure. A bimeasure
v
X = n
on
x
n
i s called a positive
flow i f -
(1) v(A,B)
for all disjoint
2 0
A,B E 1
.
It i s said t o satisfy
t h e consumption i f (2) The f l o w
v
(3)
-
p ( A ) Iv ( A , C A )
CA,A)
V(
for all
A E
x .
i s c a l l e d possible ( w i t h respect t o the capacity
v(A,B)
IT ( A x
B)
A,B E
for all
O f course, one s h o u l d imagine v(A,B)
T)
if
x .
as t h e f l o w g o i n g from
B
to
A.
F i n a l l y , we say t h a t we have s u f f i c i e n t i m p o r t c a p a c i t y if
(4) As an
p ( A ) IT ( A
x
CA)
for all
A E E
.
immediate a p p l i c a t i o n o f o u r a b s t r a c t Flow Theorem we t h e n g e t t h e
following
g e n e r a l i z a t i o n o f t h e Gale-Ryser Theorem:
The0 rem: t h e consumption There i s a p o s i t i v e and p o s s i b l e f l o w which s a t i s f i e s i f and only if we have s u f f i c i e n t i m p o r t c a p a c i t y . -Proof: -
The n e c e s s i t y of t h e s u f f i c i e n t i m p o r t c o n d i t i o n i s q u i t e t r i v i a l , because from ( 1 ) - ( 3 ) we g e t :
p ( A ) I v(A,
CA)
-
V(
CA,A)
5 v(A,
C A ) IT ( A X C A ) .
For t h e o t h e r i m p l i c a t i o n , we observe t h a t t h e s u f f i c i e n t i m p o r t c o n d i t i o n i s n o t h i n g e l s e t h a n c o n d i t i o n ( i ) i n t h e Flow Theorem. So, l e t us t a k e t h e bimeasure g i v e n b y t h i s theorem. Then from ( c ) we know t h a t i t i s a p o s i t i v e f l o w , and ( b ) t e l l s us t h a t t h i s f l o w i s p o s s i b l e . A f u r t h e r consequence o f (b) i s t h a t
u(n,B)
I 0
for a l l
B E
x . Hence
we g e t f r o m ( a ) :
and because o f t h e a d d i t i v i t y o f v t h e l a s t t e r m i s equal t o v(A, C A ) - V( CA,A) s i n c e t h e v(A,A) cancel. 0
58
Linear Functionals
1.8.3
Supply
-
Demand Problems
I n t h i s s e c t i o n we would l i k e t o t r e a t a supply-demand model ( e v e n t u a l l y w i t h i n f i n i t e commodity s e t s ) where t h e producer as w e l l as t h e consumer has a l t e r n a t i v e s concerning t h e p r o d u c t i o n and consumption. Furthermore we deal w i t h t h e case where these a l t e r n a t i v e s can be used w i t h i n c e r t a i n bounds g i v e n by raw-material and s a t u r a t i o n c o n s t r a i n t s . B e f o r e we a r e going t o make p r e c i s e what we mean we have a l o o k a t a s i m p l e example.
A t a small u n i v e r s i t y f o u r t u t o r s a r e a v a i l a b l e f o r t u t o r i a l s i n A n a l y s i s (A), P r o b a b i l i t y (P), and Numerical A n a l y s i s (N). Each o f them has t o g i v e a1 t o g e t h e r s i x t u t o r i a l
hours i n t h e s e s u b j e c t s . Furthermore t h e r e a r e
f o u r students, and each o f them has t o t a k e s i x t u t o r i a l
hours. I t i s a
fancy u n i v e r s i t y , which means t h a t i n each hour t h e teacher has t o deal w i t h o n l y one s t u d e n t . The dean asks t h e teachers students
( S 1,...,S4)
(T1,...,T4)
and t h e
f o r t h e i r preferences. Here a r e t h e r e p l i e s o f t h e
teachers : TI wants t o teach 4 hours A n a l y s i s and f o r t h e remaining two hours he does n o t c a r e i f he teaches e i t h e r P o r N. T2 wants t o teach 2 hours i n e i t h e r
A
e q u a l l y b o r i n g and t r i v i a l ) * and he
or
P
(which he considers
i n s i s t s i n t e a c h i n g 4 hours
N.
T3 wants t o d i s t r i b u t e h i s a t t e n t i o n e q u a l l y t o t h e e x c i t i n g s u b j e c t s A, P and N Hence he o f f e r s t o teach 2 hours i n each s u b j e c t .
.
T4
i s a charming person. He l o v e s
A
and
P
, hence he o f f e r s t o teach
4 hours i n t h e s e s u b j e c t s ( b u t he does n o t care i f i t i s
A
or
P).
And o u t o f a f e e l i n g o f r e s p o n s i b i l i t y towards t h e mathematical community he i s w i l l i n g t o teach i n t h e remaining two hours whatever i s needed, even Numerical A n a l y s i s . As i t happens q u i t e o f t e n , t h e dean f o r g e t s a l l t h e good reasons which were t o l d t o him and he makes a l i s t :
*
I n t h i s r e s p e c t he r e a l l y shows bad t a s t e .
59
The Sandwich Theorem
(supply o f t u t o r i a l hours) F o r reasons which may be e q u a l l y w e l l founded t h e s t u d e n t s
(S1,
...,S4)
have t h e f o l 1owing preferences :
S i n c e t h e department i s a b i t s h o r t i n computing t i m e t h e dean decides t h a t a t most one o f t h e hours o f t h e hours A v P v N
P v N
( o f f e r e d by
TI)
and a t most one
s h o u l d be g i v e n i n Numerical A n a l y s i s .
And s i n c e t h e department w i l l need l a t e r on s t u d e n t s w i t h some b a s i c knowledge i n p r o b a b i l i t y he decrees t h a t whenever a s t u d e n t o f f e r s t o take
P
a l t e r n a t i v e l y t o something e l s e , he s h o u l d t a k e a t l e a s t h a l f of
these h G u r s i n
P
.
60
Linear Functionals
Then he turns over the two l i s t s t o t h e vice dean and t e l l s h i m " i t can be done". Now, the vice dean could proceed i n two ways. He cculd e i t h e r go t o h i s colleague working i n networks or he could read through t h i s chapter *. B u t s i n c e t h e vice dean i s very clever ( i n h i s p a r t i c u l a r way) he does n e i t h e r of t h i s . He decides t h a t a student has t o take Numerical Analysis whenever he allows t h i s a l t e r n a t i v e and whenever t h i s i s not i n c o n t r a s t t o t h e decrees of the dean. Then immediately he writes down t h e hours t o be taken by the students and t o be given by t h e teachers:
NOW, l e t us s t a r t t o formalize problems of this type. Certain q u a n t i t i e s play a basic r o l e i n our model. These q u a n t i t i e s a r e e s s e n t i a l l y of measure t h e o r e t i c nature, b u t we believe t h a t t h e i r meaning can be b e s t understood in t h e s e t t i n g o f f i n i t e commodity s e t s . Therefore we s t a r t with a f i n i t e commodity s e t X = { 1 , 2 , . . . , n I (the s e t X = IP,N,AI in our example). And we consider one producer and one consumer. The production capacity ( o r r a t h e r the aggregated production capacity) and the consumption d e s i r e a r e measured by functions a and respectively. We look f o r conditions which guarantee t h a t production can s a t i s f y consumption. I t seems natural t o require t h a t has t o exceed , b u t in a r e functions r a t h e r on Po IY c X Y P instead real l i f e a and of functions on X , s i n c e the consumer allows a l t e r n a t i v e s and t h e producer has a t his disposal c a p a c i t i e s (manpower and machines) which he uses according t o the market s i t u a t i o n . In our example the function 6 i s
<
<
+
<
*) Actually, then he would only know t h a t the dean was r i q h t . In order t o
know how t o do i t he should read through Chapter 1.1.9 and use t h e few remarks he can f i n d t h e r e t o make a reasonable program f o r t h e problem.
The Sandwich Theorem
G{A3
g i v e n by t h e sum i n o u r f i r s t l i s t , i . e .
a{A,P,N}
61
=
6, a I A , P I = 6,
= 2 e t c . The demand f u n c t i o n corresponds t o t h e sum i n t h e second
list. Things become even more c o m p l i c a t e d i f one takes i n t o account t h a t u s u a l l y t h e producer i s h i n d e r e d i n u s i n g h i s p r o d u c t i o n c a p a c i t y by some bound which i s determined by t h e amount o f raw-material needed f o r t h e p r o d u c t i o n .
A s i m i l a r bound i s g i v e n on t h e consumer
s i d e . Even i f he a l l o w s a l t e r -
n a t i v e s a c c o r d i n g t o h i s t a s t e , t h e n he may n e v e r t h e l e s s become f e d up b y g e t t i n g t o o many goods o f t h e same k i n d i n s t e a d o f a w e l l mixed v a r i e t y .
0 , given
We w i l l c a l l t h e bound
b y t h i s e f f e c t , t h e s a t u r a t i o n bound.
I n o u r example t h e raw m a t e r i a l bound i s g i v e n b y t h e d e c i s i o n o f t h e dean, which was based on t h e a v a i l a b l e computing t i m e . And t h e s a t u r a t i o n bound corresponds t o h i s decree concerning t h e n e c e s s i t y o f knowlegde i n Probabi 1 it y . The concept can be made more p r e c i s e i f we assume t h a t t h e p r o d u c e r c o n s i s t s U(Y), Y E Po
o f subunits
, where
U(Y)
i s the collection o f a l l factories
iE Y
where, a c c o r d i n g t o manpower and machines, t h e commodities
can
be produced e q u i v a l e n t l y b u t where p r o d u c t i o n cannot s w i t c h t o commodities outside
Y
. Then
by numbers
a
the production capacity function
:
Po
+ R,
a ( Y ) , measuring t h e maximal o u t p u t o f t h e s u b u n i t
i s given
U(Y)
if
no raw-material bound i s given. Then we assume t h a t f o r t h e p r o d u c t i o n o f each
iE Y
a s p e c i f i c r a w - m a t e r i a l i s needed which t o
U(Y)
a v a i l a b l e up t o a c e r t a i n amount, thus p r e v e n t i n g t h e s u b u n i t produce more t h a n
, say,
p(Y,i)
o f t h a t commodity
i
.
i s only U(Y)
to
A s i m i l a r s i t u a t i o n i s g i v e n on t h e consumersside. H i s demand i s g i v e n b y a function demand which
-
: Po
+
, where
R,
;(Y)
measures t h a t f r a c t i o n o f h i s t o t a l
i f no s a t u r a t i o n bound i s g i v e n
-
can be s a t i s f i e d b y t h e
a l l o c a t i o n o f any a r b i t r a r y combination ( o f t o t a l amount commodities o u t o f
Y
s a t i s f y t h e demand
;(Y)
every
.
I f a s a t u r a t i o n bound z ( Y , i )
;(Y))
o n l y those a l l o c a t i o n s a r e p e r m i t t e d which, f o r
i E Y , do n o t g i v e more t h a n
G ( Y ,i) o f t h e commodity
I n o u r example t h e raw-material bound i s g i v e n by ;( IP,Nl,N)=;( and
;(Y,i)
i s g i v e n by
=
OD
f o r a l l o t h e r cases when
o(IP,Nl,N)
of
i s given, t h e n t o
=
3
(and a g a i n
+m
i E Y.
i.
{A,P,Nl,N)=1
The s a t u r a t i o n bound
f o r t h e o t h e r cases when
iEY).
Our problems i s , r o u g h l y speaking, t h e e s t a b l i s h m e n t o f a p r o d u c t i o n p l a n
Linear Functionals
62
b
and a d i s t r i b u t i o n p l a n
such t h a t :
i; observes t h e l i m i t s g i v e n by t h e p r o d u c t i o n c a p a c i t y 6. and t h e r a w - m a t e r i a l bound ,
(1)
i s possible, i.e.
i
(2)
i s satisfactory, i.e.
i
s a t i s f i e s t h e demand
observes t h e l i m i t s g i v e n by t h e s a t u r a t i o n bound
b
(3)
i
and
a r e compatible
, i.e.
and
0 ,
we do n o t d i s t r i b u t e more
t h a n we produce. Again, we have t o make t h i s more p r e c i s e . To do s o , we assume t h a t t h e production plan
p
as w e l l as t h e d i s t r i b u t i o n p l a n
i
a r e maps from
Po x X t o R, . The q u a n t i t y p(Y,i) measures t h e amount o f i b e i n g produced by t h e s u b u n i t U(Y) and i ( Y , i ) measures how much o f i i s a l l o c a t e d t o t h e demand ;(Y).Then (1) - ( 3 ) l e a d t o t h e f o l l o w i n g : Definition: a l l Y E Po
( i ) The p r o d u c t i o n p l a n and i E Y , we have:
z p(Y,k)
(4)*
kEY
(6)*
(iii)
iE Y
and
;(Y)
I
The p l a n s
commodity (8)*
i s s a i d t o be p o s s i b l e i f , f o r
Ii ( Y )
(ii)The d i s t r i b u t i o n p l a n Y E Po
6
, we
i s d e f i n e d t o be s a t i s f a c t o r y i f , f o r a l l
have:
1 i(Y,k)
kEY
and
a r e s a i d t o be c o m p a t i b l e i f , f o r every
i E X , p r o d u c t i o n exceeds d i s t r i b u t i o n , i . e . 1 V(Y,i) Y w i t h iEY
I
E P(U,i) Y w i t h iEY
.
NOW, o u r problem i s : Are t h e r e --
plans which suitable production and d i s t r i b u t i o n plans, i.e. -
The Sandwich Theorem
are possible,
satisfactory
63
compatible?
B e f o r e we proceed t o discuss t h i s problem we l i k e t o s i m p l i f y t h e n o t a t i o n . F o r m a l l y we p u t
And whenever we have a map d e f i n e a measure
A
on
T
: A
-,R,
( w i t h respect t o the
T(B) f
t ?(b), B c A bEB i s the density o f T
Now, we denote by
- - - - - -
a,v,p,o,p,v Po
X
x
U-
we c a n o n i c a l l y
algebra
P(A))
by:
.
.
7
i.e.
A
on a f i n i t e s e t
on
and
a,u
Po
then f o r
and
Po
R c Po
p,~,p,v
t h e c a n o n i c a l measures g i v e n by
X , r e s p e c t i v e l y . And i f
x
B
and
c X
we denote by
i s a measure on
T
~ ( xn
0
and
)
T(.
xB)
t h e measures:
on
X
and
D
+
~ ( f ix
D),
D c X
D
+
T(D
B),
D c Po
Po
x
respectively.
Using t h i s n o t a t i o n e q u a l i t y ( 9 ) * and i n e q u a l i t i e s ( 4 ) * t o ( 8 ) " have t h e f o l l o w i n g s i m p l e form:
(9)
p
( x~
D)
= o(n
x
D)
= p(n x
when
A n D
D) =
= v(R x
0
D)
for all
= 0
A E fi
.
Now we i n t r o d u c e two b a s i c q u a n t i t i e s which immediately l e a d t o a necessary
64
Linear Functionals
condition f o r the existence of s u i t a b l e plans. We consider an a r b i t r a r y nonempty subset Y c X and we c a l c u l a t e the maximal t o t a l amount a*,,,,,(Y) of commodities i E Y which can be produced by observing a l l given bounds. That i s t h e amount produced f o r t h e submarket Y i f the producer concent r a t e s a l l his e f f o r t s on t h e productionof goods o u t of Y , i . e . whenever he has the choice producing something f o r Y instead o f something o u t s i d e Y , he does so. For our example t h i s function i s
a*
12
max 14
8
18
Let us see how this function i s constructed i n general. The production capacity allows t h e production of a ( ? ) i f Y n + 0 , and t h e raw-material bound l i m i t s this- production i n any case t o p(IY1 x Y ) . So, remembering t h a t p({YI x Y ) = 0 f o r Y n Y = 0 , we obtain t h a t the maximal production of U ( v ) f o r Y i s equal t o
v
Summation over the subunits leads t o a -~ t o t a l maximal production f o r Y equal to:
I f we define
(ml
A
m2)
t o be the g r e a t e s t lower bound ( i n the s e t of
p o s i t i v e measures) of the p o s i t i v e measures rewrite:
ml
and m2
then we can
.
Now, l e t us determine the --minimal t o t a l demand f o r goods in Y If Y c Y then, c e r t a i n l y , t h e demand given by can only be s a t i s f i e d by a l l o cation of commodities in Y . B u t due t o the s a t u r a t i o n bound t h e r e may a l s o e x i s t demands ; ( i ) f o r ? & Y which have t o be p a r t i a l l y s a t i s f i e d by a l l o c a t i o n of goods out of Y . The amount of this p a r t i s obviously
;(v)
The Sandwich Theorem
65
equal t o
CY
where
-
X ). For
case i n
"(7)
denotes t h e complement i n t h e s e t under c o n s i d e r a t i o n ( i n t h i s
Y c Y
t h i s q u a n t i t y becomes a u t o m a t i c a l l y equal t o
(consequence o f ( 9 ) ) . So we o b t a i n t h a t t h e minimal t o t a l demand f o r
goods i n Y
has t o be:
And i f we d e f i n e
t o be p o s i t i v e p a r t o f a s i g n e d measure
(m)'
m this
can be r e w r i t t e n as ";Cnin(Y)
(11)
Y
Note t h a t n e i t h e r
a*max(.)
I n general
= (v
+
-
u(.
x
CY
nor
a*,,,(Y)
Y
+
V*~~,,(Y)
i s a s u b a d d i t i v e and
v*min(
a r e measures o n
.)
X.
a superadditive set
function. I n o u r example t h e f u n c t i o n
v*
min
v
i ~s g i v~e n ~by:
*
{A1
{PI
IN1
IA,PI
IA,NI
{P,NI
IA,P,N)
10
7
4
17
14
14
24
Common sense t e l l s us t h a t a necessary c o n d i t i o n f o r t h e e x i s t e n c e o f s u i t a b l e p l a n s i s t h a t f o r e v e r y submarket a*
max
(Y)
Y
, the
maximal t o t a l p r o d u c t i o n
i s more than o r equal t o t h e minimal t o t a l demand
v * , , , ~ ~ ( Y ).
S i n c e we have f o r m a l i z e d o u r problem so f a r i t i s q u i t e obvious how t o f o r m u l a t e i t f o r a general measure t h e o r e t i c s e t u p i n t h e case o f a r b i t r a r y commodity s e t s . We deal w i t h a nonempty s e t and X
on
X
and
p o s i t i v e measures:
X
( c a l l e d commodity s e t ) , CJ- a l g e b r a s zX
Po f { Y c X
IY
i?~} r e s p e c t i v e l y , and w i t h f i n i t e
Linear Functionals
66
-+
a : =Po
(production capacity) R+
(demand measure)
(I
-
Q
Zx-+R+
(raw
: tpQ
tx-,R+
( s a t u r a t i o n bound)
p : . I
m a t e r i a l bound)
0
.
F o r t h e bounds we assume t h a t
(12)
P(R x
D)
= ( I ( Q x D) = 0
when
A
n D
=
b
for a l l
A E n
.
From these measures we d e r i v e t h e q u a n t i t i e s : a*max(Y) = ( a
A P(*
xy))(po)
v* m i n (Y) = ( v
-
XCY))+(P0)
(I(.
,
which a r e c a l l e d t h e ~ maximal t o t_ a l E od uc t_ i o n f o r t h e submarket the ~ minimal t o t a l demand f o r Y , r e s p e c t i v - ely.
Y
and
We a r e l o o k i n g f o r s u i t a b l e p r o d u c t i o n and d i s t r i b u t i o n p l a n s . A plan i s s i m p l y a p o s i t i v e measure B
and
Po
x
X
(with respect t o the
(I-
algebra
z x ) . A p r o d u c t i o n p l a n p i s s a i d t o be p o s s i b l e i f
(14)
p(.
X X )
v
A distribution plan
and
on
Ia
i s s a i d t o be s a t i s f a c t o r y i f
(15)
V
(16)
v I V('XX).
l
.
O
The two plans a r e s a i d t o be compatible i f
(17)
v(Po
x
* ) I p(Po
x
*)
.
Note t h a t p o s s i b l e and s a t i s f a c t o r y plans f u l f i l l ( 9 ) anyway (because o f
( 1 2 ) , (13) and ( 1 5 ) ) .
67
The Sandwich Theorem
Theo rem : There a r e --
p r o d u c t i o n and d i s t r i b u t i o n p l a n s
p,v,
which are possible, -t h e minimal s a t i s f a c t o r y and compatible, -if for _ e v e_ r y Y E Ix '- and _ _o-n l y i f , _ t_ o t_ a l_demand W * ~ ~ ~ ( Y ) i s l e s s t h a n o r equal t o t h e maximal t o t a __ ---~ - - _ _ _ - l ~
p r o d u c t i o n a*(,Y).
F o r t h e p r o o f we need a lemma. We r e c a l l t h a t g i v e n two measurable spaces
(r j J j )
j = 1,2;
a fu ction
t o be a bimeasure on q(A1 x
.
and
cp(.
x
r2
rlx
A2)
cp :
{A1
x
A2
if , f o r every
I A J.
E X.,j J
A1 E
x1
=
1,Zl
and
-,R
A2 E
i s said
x2 ,
both
a r e measures.
Lemma: Let -
cp
rlx
r2
-be_ a
for a l l --
rl
x
r2
p o s i t i v e bimeasure on rlx
(w i_ th _ r e s_ pect A1 E
zl,A 2
w i t h +(A1
E z2 x
z1 Q
to
. Then
A2) = q(A1
r 2 - and -
x 2 ) -such t h a t
let cp(A1
m x
be a measure on A2) I m(A1
t h e r e i s a p o s i t i v e measure x
A2)
for all
A1 E
xl,
x
A2)
G on
A2 E I2 .
Proof: One c o n s i d e r s t h e a l g e b r a o f a l l f i n i t e d i s j o i n t unions o f measurable r e c t a n g l e s [ 151p.1491.
Then one d e f i n e s f o r these f i n i t e d i s j o i n t unions
@( U ( A j x B.)) = x cp(Aj x B . ) . S i n c e cp i s s e p a r a t e l y a d d i t i v e , J J j j t h i s l e a d s t o an unambiguously d e f i n e d f i n i t e l y a d d i t i v e p o s i t i v e measure.
5, by
S i n c e t h i s i s dominated by an honest ( i . e .
a- a d d i t i v e ) measure i t must
i t s e l f be
a d d i t i v e l y extended t o t h e
a- a d d i t i v e . Hence i t can be
U-
a- a l g e b r a generated b y t h e measurable r e c t a n g l e s (compare [151 p.30 and
541).
0
ion has t o-exceed al Proof o f the necessity t h a t t o t a l maximal - p r o d u c t~ - t o t~
minimal demand art): ~ _ (easy p _ Assume t h a t t h e r e a r e p l a n s which a r e p o s s i b l e , s a t i s f a c t o r y and compatible. From ( 1 3 ) and (14) we know: P('XY) I P('XY)
Linear Functionals
68
and p(.
Y E Ex
for
I p(* xX) I a
X Y )
. This c l e a r l y p(.
implies
xY) I a A
P(- x Y ) .
Hence,
(18) Since
v
P(P0
Y) 5 a*,,(Y).
i s s a t i s f a c t o r y ( 1 5 ) and ( 1 6 ) l e a d t o :
From t h i s we o b t a i n :
Since
v
i s p o s i t i v e we can r e p l a c e t h e l e f t s i d e by i t s p o s i t i v e p a r t
without v i o l a t i n g the inequality: (v
-
u(.
x
CY))+IV ( '
Evaluation o f t h i s inequality f o r
(19)
v*min(Y)
Po
X Y ) .
gives:
5 v(Po x Y ) .
I n e q u a l i t i e s (18) and (19), t o g e t h e r w i t h t h e c o m p a t i b i l i t y o f yield:
*
v min(~)
f o r every
Y E Ex
Y ) Ip(p0
I v(p0 x
x
p
and
v
,
Y ) 5 a(*~,)
.
Proof t h a t t h e condition i s s u f f i c i e n t f o r the existence o f s u i t a b l e plans: We t a k e a copy subset o f
P*
P* by
of R*
Po
, and
for
. Then we d e f i n e
r =pOuxuP*. In
r
we c o n s i d e r a
R c
u- a l g e b r a
r
Po we denote t h e corresponding t o be t h e d i s j o i n t union:
69
The Sandwich Theorem
I n1,a2
I = {n1 U B u R; And w i t h r e s p e c t t o t h i s
v(nl u
B
U-
except
on X
x
Po
and
(20 a )
"I(A
x
(20 b )
T(R*
x
u n);
= v(n2)
B E Ixl .
7
,rk
P*
X
-
!.I
i s g i v e n by:
a(nl).
on t h e p r o d u c t
"I
rk(ri x
PO
a l g e b r a a s i g n e d measure
Furthermore a p o s i t i v e measure p r o v i s i o n t h a t on ri
E I
= Po,X7P*)
T
r
x
r
i s given by the
s h a l l vanish everywhere
and t h a t on these s e t s i t s h a l l be equal
to:
when
A E Zx
n) x
,nE I
We now c l a i m t h a t
T
= p(n x A)
A ) = u(n
x
A)
. and
p
do f u l f i l l c o n d i t i o n ( i ) o f t h e Flow Theorem
1.8.1 i f t o t a l maximal p r o d u c t i o n exceeds t o t a l minimal demand. To p r o v e t h a t c l a i m we c o n s i d e r some a r b i t r a r y
u(D) 2 v*
min
= v(n2)
- a(nl)
D E t and we a b b r e v i a t e :
.
we t h e n g e t :
Using ( 2 1 ) one sees t h a t t h i s i m p l i e s
T(D
x
CD)
2 u(D)
.
70
Linear Functionals
Now, l e t us t a k e t h e bimeasure g i v e n by ( i i ) o f t h e Flow Theorem. We denote cp
. Then
p(n
x
A) = cp(A
v(n
x
A) = cp(n*
R E
zp , A
t h i s bimeasure by
we d e f i n e bimeasures
p
and
v
on
Po
x
X
by :
for arbitrary
n)
x
.
E Ex
0
but that
p
v
and
A)
x
Note t h a t
cp
i s n o t a p o s i t i v e bimeasure,
a r e p o s i t i v e . From ( i i b ) o f t h e Flow Theorem we ob-
t a i n w i t h t h e h e l p o f (20):
for
A ) I T(A
( 2 2 a)
p(n
(22 b )
~ ( xn A ) I T ( R *
Q E
z ,A
x
E Ex
. So,
(n n C A ) )
x x
(A
n Cn*)) =
w i t h t h e lemma
n)
= T(A x T(R*
x
= p ( ~ A)
A) = a(n
x
A)
,
, we know t h a t p and v a r e
honest measures and we prove t h a t they a r e t h e r e q u i r e d p l a n s . (22) i m p l i e s t h a t they a r e f u l f i l l i n g (13) and ( 1 5 ) . For t h e p r o o f t h a t f a c t o r y i t remains t o show ( 1 6 ) . To do t h i s we t a k e w i t h (ii a ) and ( i
v
is
satis-
R E 1
b ) (always o f t h e Flow Theorem)
v(Q
( t h e l a s t e q u a l i t y f o l l o w s from (2Q)and t h e d e f i n i t i o n o f
T
)
.
Before we proceed t o prove ( 1 4 ) we observe t h a t ( i i b ) i m p l i e s cp(r
x
D)
5 0
for all
.
D E z
So ( i i a ) immediately leads t o :
A p p l i c a t i o n t o t h e s p e c i a l case
Here, we have used t h a t
cp(n
t h e same reason we g e t t h a t t h i s q u a n t i t y must a l s o be
D = n E z
Cn) I cp(C(nu x
2 0
.
gives:
0
(because o f ( i i b ) and ( 2 0 ) ) . For
X)
x
n)
5 0
. But,
because o f ( i i c )
71
The Sandwich Theorem
Hence cp(
C(n u
X ) x n) = 0
.
Using t h i s we can r e w r i t e (24)
a(n) 2
cp(
Cn
n)
x
X ) + cp(C(n u X )
= p(n x
So ( 1 4 ) i s proved and a l l what remains t o show i s t h a t
x
n) = p ( n p
and
x
v
x). are
compatible. From (23) we o b t a i n f o r
Y E zx
Now, we use ( i i c ) and (iib ) and o b t a i n f o r
Y E zx
the following
inequal it i e s : “Po
x
Y ) = Q(P* = cp(Y
x
Y ) 5 cp(
x
Po)
I p(Po x
+
Y) +
= p(Po x Y )
+
CY
Y ) 5 cp(Y X C Y )
C(Y u
cp(Y
T(Y
x
x
Po))
C(Y lJPo))
0 (because of ( 2 0 ) ) .
T h i s shows t h a t t h e p l a n s a r e compatible. Hence t h e p r o o f i s f i n a l l y 0 finished.
72
1.9
Linear Functionals
ADDITIONAL REMARKS AND COMMENTS
1.9.1
The Hahn-Banach Theorem
I n Chapter 1.1 we discussed t h e Hahn-Banach Theorem, o r r a t h e r a v a r i a n t t h e r e o f , and some o f i t s consequences. The Hahn-Banach Theorem i s c e r t a i n l y one o f t h e most fundamental r e s u l t s i n modern a n a l y s i s , i t i s one o f t h e b e s t i n v e s t i g a t e d i n d i v i d u a l theorems and t h e l i t e r a t u r e about i t covers thousands and thousends o f pages ( f o r example,already t h e r e f e r e n c e l i s t of
[2691, which i s f a r from b e i n g complete, c o n t a i n s 125 t i t l e s ) . It has been proved
and r e f o r m u l a t e d c o u n t l e s s times, and y e t t h e r e i s s t i l l demand
f o r new v e r s i o n s which a l l o w more e f f e c t i v e a p p l i c a t i o n s t h a n b e f o r e . And s u r p r i s i n g l y , new and b e t t e r v e r s i o n s a r e s t i l l found. Some o f t h e s e v e r s i o n s and some v a r i a n t s w i l l be mentioned i n t h e sequel ( o f course, we a r e aware o f t h e f a c t t h a t i t i s i m p o s s i b l e t o do j u s t i c e t o a l l t h e major contributions
-
even i f we knew a l l o f them).
F i r s t some remarks on t h e h i s t o r y o f t h e s u b j e c t (see a l s o [ 551 and E1321). B e f o r e t h e t h e o r y o f Banach spaces ( o r Banach-Wiener spaces as t h e y were o r i g i n a l l y c a l l e d ) was w e l l e s t a b l i s h e d b y Banach's c e l e b r a t e d book [15
3
mathematicians were m a i n l y i n t e r e s t e d i n s p e c i a l normed spaces. The work o f D. H i l b e r t and E. Schmidt l e d t o t h e general moment problem which was s o l v e d i n 1907 by F. Riesz ([2611,[2631) and E. F i s c h e r [lo51 and t h i s s o l u t i o n was about t h e f i r s t c h a r a c t e r i z a t i o n o f t h e dual o f a n o n t r i v i a l Banach space. I n 1912 E. H e l l e y [I591 s i m p l i f i e d t h e s o l u t i o n and t r e a t e d t h e problem i n such a general and t r a n s p a r e n t way t h a t one can almost speak o f t h e f i r s t appearance o f t h e Hahn-Banach Theorem. ( S i n c e H e l l e y was o n l y i n t e r e s t e d i n normed sequence spaces i n s t e a d of general Banach spaces h i s i m p o r t a n t c o n t r i b u t i o n s were almost f o r g o t t e n a f t e r t h e e s t a b l i s h m e n t o f t h e general theory; i t s h o u l d be n o t e d t h a t he was n o t o n l y v e r y c l o s e t o t h e Hahn-Banach Theorem b u t a l s o t o t h e Banach-Steinhaus Theorem, see [I641 and [ 611).
Phrased i n modern t e r m i n o l o g y , H e l l e y d i d i n 1912 a l r e a d y use
t h e b i n a r y i n t e r s e c t i o n p r o p e r t y o f t h e r e a l s t o extend a l i n e a r f u n c t i o n a l ( w i t h o u t i n c r e a s i n g i t s norm) from a space w i t h codimension one. L e t us r e c a l l t h a t a Banach space i s s a i d t o have t h e b i n a r y i n t e r s e c t i o n p r o p e r t y
if every c o l l e c t i o n o f b a l l s has a nonempty i n t e r s e c t i o n whenever any two of them have nonempty i n t e r s e c t i o n .
73
The Sandwich Theorem
The Hahn-Banach Theorem f o r real valued linear functionals, in i t s present day form,was firmly established in 1927 by H . Hahn [14gI and independently in 1929 by S. Banach [141. The proof was the same as the standard proof today: Extension of the dimension,of the space on which the linear functional under consideration i s defined,in each step by one, and then obtaining the full result by t r a n s f i n i t e induction. Of course, the same proof works for (locally) convex topological vector spaces, one only has to replace the norm by the gauge functional given by a suitable absolutely convex neighbourhood of the origin. Since non-convex vector spaces in general do n o t have sufficiently many continuous sublinear functionals one cannot expect t h a t they have separating d u a l spaces (even i f they are Hausdorff-spaces). Of course, many of them do have separating duals: I n fact,whenever the weak and the Mackey topologies are different then there i s a non-convex topology between them 11461 (then,trivial ly,having the same dual space).
B u t l e t us go back t o the history of the Hahn-Banach Theorem.Extensions of positive linear maps defined on a subspace of a vector l a t t i c e and attaining values in an order complete vector l a t t i c e were already studied in 1937 by L.V. Kantorovitch 11821 (see also 12221 and 12231). Then in 1950 L . Nachbin [2381 discovered t h a t the binary intersection property i s a crucical tool for generalizations of the Extension Theorem (see also Goodner 11431). His celebrated result was that one can replace the reals ( i . e . the image space of the linear functionals) by a normed space E i f and only i f E has the binary intersection property. One direction of t h a t result i s again proved by extending the dimension of the space where the linear functional i s defined step by step by one. The other direction i s a rather ingenious argument. Let us give a brief sketch (see also [1321). Take a collection of closed balls B ( x i , r i ) ( i n the normed space E ) with radii ri around xi E E , where i E I . Any two of them have nonempty intersection i f and only i f (*)
II xi
Then one defines in
-
x.II
Iri t
J
E x
R
r
j
for a l l
a seminorm by
i,j
.
Linear Functionals
74
Because o f t h e i n e q u a l i t y ( * ) we have always
NOW, t a k e t h e o p e r a t o r T : (x,O)
F
7
= {(x,O)
Ix
E El
.
-,
x
II (x,O)ll = I I x II d e f i n e d on t h e subspace
.
I f t h i s o p e r a t o r can be extended t o an o p e r a t o r
: E x R -,E w i t h o u t i n c r e a s i n g i t s norm t h e n ? ( O , - l ) must be i n t h e i n t e r s e c t i o n o f a l l t h e B(xi,ri). Hence, if t h e Hahn-Banach Theorem i s v a l i d f o r l i n e a r maps w i t h values i n
E
then
E
must have t h e b i n a r y
i n t e r s e c t i o n p r o p e r t y . O f course t h e r e a r e spaces w i t h o u t b i n a r y i n t e r s e c t i o n p r o p e r t y having a Hahn-Banach p r o p e r t y w i t h c a r d i n a l i t y r e s t r i c t i o n s . I n p r e c i s e terms: F o r a g i v e n c a r d i n a l i t y Banach space
E
B l i n e a r operator
normed space t o a l l of property o f
B
, without binary , h a v i n g a dense T :A
-,E
rl
there i s a
i n t e r s e c t i o n p r o p e r t y , such t h a t f o r e v e r y subset o f c a r d i n a l i t y 5
on a subspace
q
a continuous
A c B can always be extended
w i t h o u t i n c r e a s i n g i t s norm (see [2481). O f course, t h i s E
corresponds t o a r e s t r i c t e d i n t e r s e c t i o n p r o p e r t y .
Another c h a r a c t e r i z a t i o n o f spaces w i t h t h e Hahn-Banach p r o p e r t y (which, by Nachbin's theorem, i s e q u i v a l e n t t o t h e b i n a r y i n t e r s e c t i o n p r o p e r t y ) i s t h a t they a r e t h e i n j e c t i v e elements i n t h e c a t e g o r y o f Banach spaces ( w i t h o p e r a t o r s o f norm I 1 as morphisms) (compare [76 I).Here, a g a i n one can o b t a i n v a r i a n t s and m o d i f i e d r e s u l t s by changing t h e c a t e g o r y under c o n s i d e r a t i o n (e.g. v e c t o r l a t t i c e s w i t h l i n e a r l a t t i c e homomorphisms [220] [156],[216] ,[63];
PA
-
spaces [157],
spaces o f continuous f u n c t i o n s [3] ,[4] [271],
[272],
, [174] ,
[334];
separable Banach spaces [ 3 4 3 ] ) .
Actual l y , t h e r o l e of t h e b i n a r y i n t e r s e c t i o n p r o p e r t y becomes even more t r a n s p a r e n t i f one considers s e t - v a l u e d mappings. So, l e t
E
and
F be
K and c o n s i d e r a nonempty t r a n s l a t i o n (i.e. A E A, u E F A t u E A ) o f F.
v e c t o r spaces over t h e same f i e l d i n v a r i a n t c l a s s A o f subsets
Furthermore, l e t a s u b l i n e a r s e t - v a l u e d map
=$
Y : E -,
A
be g i v e n ( s u b l i n e a r
Y ( k x ) = k ~ ( x ) ,' Y ( x t y ) c ~ ( x t) ~ ( y ) f o r a l l x,y E E, k E K ) . has t h e h i n a r y i n t e r s e c t i o n p r o p e r t y then t h e f o l l o w i n q r e s u l t o f B. Rodriguez-Salinas and L . Bou h o l d s :
means If A
,
75
The Sandwich Theorem
Theorem 12701: that -
i ( x ) E v(x)
7to a ll of
of -
Let
?
_be_a
c E
for all
x E
-_.
E
subspace of E
and l e t 7 --
. -Then- t h-e r e_ i s ~a
:
E
+
F
such
l i n e a r extension
f
f ( x ) E ~ ( x ) -f o r a l l x E E.
such t h a t
__I_
T h i s seems t o be an a p p r o p r i a t e s t a r t i n g p o i n t f o r an i n v e s t i g a t i o n o f Hahn-Banach-property versus b i n a r y i n t e r s e c t i o n p r o p e r t y . The s t r u c t u r e o f spaces w i t h b i n a r y i n t e r s e c t i o n p r o p e r t y was comp l e t e l y c l a r i f i e d when K e l l e y [1921
showed t h a t a Banach space w i t h b i n a r y
i n t e r s e c t i o n p r o p e r t y i s i s o m e t r i c a l l y isomorphic t o
C(S)
,
S
extremally
disconnected and compact ( f o r a s i m p l e p r o o f o f t h a t f a c t see [1321, f o r t h e e x t e n s i o n o f f u n c t i o n a l s a t t a i n i n g values i n a complex l i n e a r space one s h o u l d c o n s u l t t h e work o f Hasumi [1551 and Hustad [1721). Taking i n t o account t h a t such a space
i s an o r d e r complete v e c t o r l a t t i c e we see
C(S)
t h a t i n a l l g e n e r a l i t y t h e Hahn-Banach theorem o n l y h o l d s i f t h e l i n e a r maps a t t a i n values i n an o r d e r complete v e c t o r l a t t i c e . The f i r s t Hahn-Banach theorem f o r a d d i t i v e maps on a commutative semigroup is
-
as f a r as we know
-
due t o I. H a l p e r i n [152], who s t u d i e d t h e problem
i n 1952. A f t e r t h a t Hahn-Bach theorems f o r semigroups were s t u d i e d by:
, R.
,
M. C o t l a r [80]
G. Aumann [12]
H. Dinges [87]
P. Kranz [203],[204],
t h i s book [116
and many o t h e r s . The d i s c o v e r y t h a t dominated e x t e n s i o n s a r e
Kaufmann [186],[187],
G. Seevers [288]
F. Topsoe [313], t h e f i r s t a u t h o r o f
more s u i t a b l e t h a n p r o p e r e x t e n s i o n s f o r t h e case o f f u n c t i o n a l s d e f i n e d on semigroups appears i n [ 1 8 7 l f o r t h e f i r s t t i m e . Monotone a d d i t i v e f u n c t i o n a l s on o r d e r e d semigroups a r e considered s i n c e t h e paper o f Aumann [121. R e c a l l t h a t an a d d i t i v e f u n c t i o n a l subaddi t i v e f u n c t i o n a l
p
on a group
p
G
, which i s dominated by a
, has a u t o m a t i c a l l y t h e same m o n o t o n i c i t y proper-
t i e s as p. T h i s i s no l o n g e r t r u e i n t h e case o f semigroups. So i t i s n a t u r a l t h a t t h e q u e s t i o n whether as
p
has t h e same m o n o t o n i c i t y p r o p e r t i e s
t u r n s up i n t h e c o n t e x t o f semigroups. T h i s q u e s t i o n i s s a t i s f a c t o r i -
p l y answered by t h e Sandwich Theorem we have discussed i n t h i s c h a p t e r . The p r o o f o f t h i s theorem i s taken from [ 1341. I n 1968 Heinz Kdnig became i n t e r e s t e d i n a p p l i c a t i o n s o f t h e Hahn-Banach
Theorem. I n a few papers [197]
-
[199] he developed a c o n v i n c i n g and e l e g a n t
t h e o r y o f s u b l i n e a r f u n c t i o n a l s on v e c t o r spaces. The a p p l i c a t i o n s he gave showed t h a t t h e b a s i c elements o f a t h e o r y o f s u b l i n e a r f u n c t i o n a l s can be
76
Linear Functionals
considered a s a e f f e c t i v e tool i n modern a n a l y s i s . For vector spaces, a l l t h e main theorems of our chapter 1.1, l i k e the Sum-Theorem, t h e F i n i t e Decomposition Theorem and t h e Riesz-Konig Theorem, a r e already contained in Konig's paper [199].From t h a t point on, the extension of these basic f a c t s t o the case of preordered semigroups was j u s t a matter of routine, this routine work was done in [116]by t h e f i r s t author of this book. B u t t h e s t o r y of t h e Hahn-Banach Theorem would be incomplete without mentioning the many important contributions t o the theory of sub1 i n e a r functionals which can be found i n some p a r t s of a b s t r a c t potential theory, e s p e c i a l l y i n t h e work of H . Bauer and G. Choquet. Although t h e i r r e s u l t s will play a major r o l e i n t h e second p a r t of t h i s book, we l i k e t o give a few examples: For vector spaces t h e Sum Theorem, and i t s r e l a t i o n t o the Strassen Disintegration Theorem, can already be found as a remark [ 72, p.2731 i n Choquet's 1968 Princeton l e c t u r e s . Here one a l s o finds the Sandwich Theorem f o r vector spaces as a consequence of t h e Hahn-Banach Theorem. And, generally speaking, t h e observation t h a t many r e s u l t s r e l a t e d t o the Hahn-Banach Theorem carry over t o cones instead of vector spaces o r i g i n a t e s i n potential theory. Of course, f o r cones one has t o replace e q u a l i t i e s i n a s u i t a b l e way by i n e q u a l i t i e s . In potential theory i t is well known t h a t many r e s u l t s concerning harmonic functions can be t r a n s f e r r e d (under s u i t a b l e modifications consisting mainly i n replacing e q u a l i t i e s by i n e q u a l i t i e s ) t o the convex cone of subharmonic functions. In f a c t , on a more elementary l e v e l , the same holds t r u e i f t h e continuous functions a r e replaced by t h e semicontinuous functions. This observation successfully penetrated t h e i n v e s t i g a t i o n s which were made i n the context of compact convex s e t s ( s e e f o r example the work of H. Bauer and D.A. Edwards). In section 11.5 the same idea leads us t o a new level of a b s t r a c t i o n . There we show t h a t e s s e n t i a l portions of the topological aspects of t h e theory o f continuous functions can be verbatim generalized f o r convex cones of a r b i t r a r y functions.
77
The Sandwich Theorem
1.9.2
Other E x t e n s i o n Theorems
I n t h i s s u b s e c t i o n we p r e s e n t a v a r i e t y o f e x t e n s i o n theorems r e l a t e d t o t h e Hahn-Banach Theorem. Since we have seen [ 2 4 8 ] t h a t under r e s t r i c t i o n s on t h e c a r d i n a l i t y o f t h e f a m i l i e s w i t h t h e i n t e r s e c t i o n p r o p e r t y one o b t a i n s theorems somewhat weaker t h a n t h e Hahn-Banach Theorem, i t seems n a t u r a l t o s t u d y spaces where t h e b i n a r y i n t e r s e c t i o n p r o p e r t y i s r e s t r i c t e d t o f i n i t e f a m i l i e s . T h i s s i t u a t i o n was c o m p l e t e l y i n v e s t i g a t e d and c h a r a c t e r i z e d b y J. Lindens t r a u s s 12123 : Theorem ( L i n d e n s t r a u s s ) : Let -
X
be a Banach space, -then t h e following are equivalent:
Every of f o u r mutually i) _ _ c o l l e c t i o n -non-empty i n t e r s e c t i o n --
i n t e r s e c t i n g -balls i n
.
ii)
Let Z T : Y
X
-has _
a
be any Banach space, t h e n f o r e v e r y ___ compact o p e r a t o r X
from a subspace -
Y c Z
into -
t h e r e i s a compact l i n e a r e x t e n s i o n
II Tll 5 (1 + c ) I I T I I iii)--The dual space L- space. X"
iv)
The bidual --
v)
The _ b i du a_ l has _ -
X'
7
X
: Z
and f o r e v e r y --+
X
E
> 0
with
. i s isometrically -
isomorphic to an a b s t r a c t
has the binary i n t e r s e c t i o n property.
--
t h e p r o p e r t y s t a t e d i n i).
L e t us g i v e a b r i e f s k e t c h o f t h e main ideas i n v o l v e d i n t h e p r o o f o f t h i s theorem. F i r s t o f a l l one observes by i n d u c t i o n t h a t i)i m p l i e s t h a t e v e r y f i n i t e family o f mutually intersecting b a l l s i n
X
has a nonempty i n t e r -
s e c t i o n . Then u s i n g i n an a p p r o x i m a t i v e way t h e arguments which appear when t h e Hahn-Banach Theorem i s proved v i a t h e b i n a r y i n t e r s e c t i o n p r o p e r t y one o b t a i n s ii).The a spac.e
E
comes i n t o t h e game s i n c e i n e x t e n d i n g t h e o p e r a t o r t o
Y , where t h e dimension i s i n c r e a s e d by one, one has t o deal w i t h
n o n - f i n i t e f a m i l i e s of b a l l s such t h a t e v e r y f i n i t e s u b f a m i l y has nonempty i n t e r s e c t i o n , and f o r f i n d i n g a conimon p o i n t
i n the intersection o f a l l
t h e s e b a l l s one has t o i n c r e a s e t h e i r r a d i i s l i g h t l y . Now, f r o m t h e b i n a r y
70
Linear Functionals
intersection property i n X f o r f i n i t e families one e a s i l y obtains ( v i a weak compactness) the binary i n t e r s e c t i o n property f o r X " . We already know t h a t i f X" has t h e binary i n t e r s e c t i o n property then i t must be isometrically isomorphic t o an order complete C ( K ) - space. B u t then X"' must be an a b s t r a c t L- space and using t h e canonical projection P : XI1'-, X ' ( r e s t r i c t i o n of the functionals x"' E XI" t o X ) one obtains t h a t X ' i s an a b s t r a c t L- space. Using t h e f a c t t h a t the dual of an L- space i s an M- space one obtains v ) . And a f i n a l application of t h e p r i n c i p l e o f local r e f l e x i v i t y 1207 p. 2301 leads t o i ) .
As another consequence of intersection properties in Banach spaces we can consider K Donner's [891 , [901 theorem about extensions of p o s i t i v e
.
operators in LP- spaces: Theorem: -
-
15 q 5 p < Lp(p) . Then --and consider spaces L q ( p ) -- for a p o s i t i v e continuous l i n e a r operator T : H -, L q ( p ) on-a subspace H of L p ( p ) t h e r e i s a p o s i t i v e l i n e a r extension : Lp(p) + Lq(,,) with -
Let -
II 711
=
and
II TI1 i f and only i f
for every family ( h i ) i E I in H , where V -denotes t h e supremum operation and h t t h e positive p a r t .
In f a c t t h i s r e s u l t can be proved by a ( s k i l l f u l l ) application of the theorem of Rodriguez-Salinas and L . Bou (which we mentioned e a r l i e r ) , a1 though Donner's o r i g i n a l proof proceeds d i f f e r e n t l y . He uses the HahnBanach theorem f o r hypolinear functionals due t o 6. Anger and J . Lembcke. They c a l l a sublinear functional p (defined on a convex subcone P of a l o c a l l y convex topological vector space E ) hypolinear i f i t a t t a i n s values i n R U I + -1. In t h i s s i t u a t i o n a theorem l i k e our Sandwich Theorem does n o t hold s i n c e Simons showed t h a t t h e r e i s a hypolinear functional which dominates no l i n e a r f u n c t i o n a l . Anger and Lembcke proved t h a t a hypolinear functional p : P + R U I + -1 dominates a continuous l i n e a r functional f : E -,R on P i f and only i f p i s lower semi-
The Sandwich Theorem
79
( c f . 17 1 , [ 8 1)
continuous a t t h e o r i g i n
A r a t h e r powerful v e r s i o n o f t h e c l a s s i c a l Hahn-Banach Theorem f o r v e c t o r spaces i s due t o Heinz Konig (L200Iand [133]):
Let
Theorem:
a function numbers
p : E
a,B > 0
Inf W€T
be s u b l i n e a r on t h e v e c t o r space
R
-,
: T +R
T
on- a_nonvoid _ _ - subset
with -
-
p(w-au- Bv)
T(W)
linear p : E Then t h e r e i s 2 ---
-,
+
a T(u)+
R
with
Ip
w € T.
for all
0
~ T ( v )I
v
and c o n s i d e r
E
such t h a t t h e r e a r e ----
T c E
U,V
E T
.
and ~ ( w )2 ~ ( w ) f o r a l l -
Here t h e emphasis l i e s on t h e f a c t t h a t i t s u f f i c e s t o have a r b i t r a r y a,B > 0
.
F o r t h e case a + B = 1 t h e theorem e a s i l y can be o b t a i n e d from
t h e Sandwich Theorem, b u t t h i s does n o t work f o r t h e general case. T h i s r e s u l t has been l i f t e d t o a new l e v e l o f a b s t r a c t i o n by G. Rode [ 2671. He proved a theorem - which seems t o be something l i k e t h e u l t i m a t e v e r s i o n of t h e Sandwich Theorem
-
n
mapping f i n i t e powers o f
: Xn
n(xl,.
-,X,
.. ,xn)
: Xm
p
-+
X
f o r commuting r e l a t i o n s . Consider maps
we l i k e t o w r i t e
if
whenever
r
xik
E X,
i=l,...,n
n
i
and
X
into
n
and we say t h a t
(xi)
k = I , ...,m.
X
.
Instead o f
and
p
commute
Now, c o n s i d e r a f a m i l y
o f m u t u a l l y commuting maps o f t h i s k i n d . O f course, t h e degree o f t h e
power o f
X
on which
y E
r
a c t s may b e d i f f e r e n t f o r each y
.
Theorem (Rode): Let -
cp : X
G,F : X -+
be two maps w i t h G ---6 w i t h G I cp I F -such t h a t -+
I F.
Then t h e r e ---
is
function
n
whenever
sly.. . ,an 2 0 ,n E T
and (xl,.
. . ,xn)
E Xn
-such t h a t
80
Linear Functionals
Extensions o f l i n e a r f u n c t i o n a l s which a r e maximal on g i v e n subcones have t u r n e d o u t t o be r a t h e r u s e f u l (see Andenaes [ 5 1 ) . One may even c o n s i d e r extensions w i t h s t r o n g e r p r o p e r t i e s , f o r example b e i n g extreme p o i n t s i n t h e s e t o f a l l extensions. Since these extensions a r e u s u a l l y connceted w i t h ( t r a n s f i n i t e ) a l g o r i t h m s f o r t h e c o n s t r u c t i o n o f e x t e n s i o n s we p r e s e n t one r e s u l t o f t h i s k i n d . Let
Gyp : F -,fi
F be a f i x e d cone. F o r
we w r i t e
4
--I
fi
i f the
following three conditions are s a t i s f i e d :
i)
irij
ii)
2;
i s s u p e r l i n e a r and
iii) ij(tl) We w r i t e
6
-.I p
t
4(t2) I
i f either
4
-1
i s sublinear
F(tl
tt2) f o r a l l
or
6 = i.
tlyt2E F.
And b y Lin(q,p) we denote t h e s e t o f l i n e a r f u n c t i o n a l s p : F + 6 with q I p I p Nowy p E Lin(q,p) i s s a i d t o be an exposed e l e m e n t , i f whenever
4
q 5
.
6
Ip
, then
t h e r e i s some
to E F w i t h :
Theorem [ 1221: i s superlinear and p i s s u b l i n e a r . -Then t h e r e is an exposed p E Lin(q,p). 9a d d i t i o n : if p i s monotone w i t h r e s p e c t which i s compatible w i t h t h e cone then p t-o some p r e o r d e r 4 ---- s t r u c t u r e i s a l s o monotone. -Let q -
I
p
such t h a t
q
C l e a r l y t h i s theorem general izes t h e Sandwich Theorem. B u t i t general izes 11. 3.1) as w e l l s i n c e t h e exposed [1221 t o be extreme p o i n t s o f L(q,p). I n
t h e Krein-Milman Theorem (see s e c t i o n elements o f
L(p,q)
turn out
f a c t t h e y even have a s t r o n g e r p r o p e r t y t h a n b e i n g extreme. The s e t o f
81
The Sandwich Theorem
exposed p o i n t s i s what we w i l l c a l l l a t e r on (see s e c t i o n 11. 3.1) t h e minimal f i x p o i n t boundary o f by t h e evaluationsof F.
Lin(q,p)
w i t h respect t o the functions given
L e t us e x p l a i n how these exposed elements
u
" a l g o r i t h m " f o r t h e Sandwich Theorem. L e t
4
functional
we denote b y
p
[p,q](t)
infIfi(tts)
NOW, f i x some
=
def
= [p,61,
2
with
p
5 p
.
p.
This
i t i s given by
-
to E F. Then t h e f u n c t i o n a l
q(s)
Is
Tt
(6)
0
i s a g a i n s u p e r l i n e a r and f u l f i l l s
;i 5
be s u p e r l i n e a r w i t h
p
Then t h e r e i s a unique maximal s u b l i n e a r
a r e r e l a t e d t o an
E Lin(q,p)
5 Tt
0
(4)
5 p
E FI
.
given by
.
I n f a c t , i t s v a l u e on
i s equal t o t h e maximum o f { p ( t o ) I y E L i n ( 4 , p ) I . Having d e f i n e d t h e s e to q u a n t i t i e s t h e a l g o r i t h m f o r o b t a i n i n g t h e exposed elements i n Lin(q,p) @ c F
i s e a s i l y e x p l a i n e d . Take a subset
which generates
i s equal t o a l l f i n i t e sums o f elements i n
@
c o e f f i c i e n t s ) . Then c o n s i d e r any w e l l o r d e r i n g q
where
i,(t)
=
def
supIqy(t)
if
IY
4
of
@
E @
with
Y
< cp}
(i.e.
F
and d e f i n e
i s t h e minimal element o f
cp
F
w i t h nonnegative
for all
@
t E F.
Then i t t u r n s o u t t h a t U(t) = supIqw(t)
I cp E
@}
defines an exposed element o f
Lin(q,p).
exposed elements o f
come o u t o f such a c o n s t r u c t i o n . C l e a r l y ,
if
@
Lin(q,p)
Furthermore one can p r o v e t h a t a l l
i s countable, t h e n t h i s c o n s t r u c t i o n p r o v i d e s an a l g o r i t h m f o r t h e
Hahn-Banach Theorem.
82
Linear Functionels
A t t h e end o f t h i s survey about o t h e r v e r s i o n s o f t h e Hahn-Banach Theorem we l i k e t o mention t h a t t h e r e a r e a l s o Hahn-Banach Theorems f o r s t r u c t u r e s which a r e n o t l i n e a r (see
, for
example, C i g n o l i [ 7 5 1 ) . Furthermore
t h e r e has been c o n s i d e r a b l e progress concerning o p e r a t o r - V a l ued HahnBanach Theorems (Wi t t s t o c k l 3 3 2 1 , [3331).
1.9.3
A l g o r i t h m s f o r Networks
There a r e theorems whose f o r m u l a t i o n s g i v e an immediate i d e a how t h e p r o o f s have t o proceed. The Sandwich Theorem i s an example f o r such a theorem and, f o r f i n i t e s e t s , t h e Flow Theorem i s a n o t h e r example. L e t us e x p l a i n t h a t i n d e t a i l . Take t h e statement o f t h e Sandwich Theorem, s a y i n g t h a t whenever
q 5 p
then t h e r e i s a l i n e a r map i n between. I f t h a t statement i s
t r u e i n general t h e n i t must a l s o be t r u e f o r a minimal s u b l i n e a r b t q instead o f p B u t then t h e theorem g i v e s a l i n e a r t 1-1 t q which i s a
.
s p e c i a l case o f a s u b l i n e a r f u n c t i o n a l . Since
6
= p
.
was minimal we t h e n have
T h i s argument shows t h a t f o r t h e p r o o f o f t h e s t a t e d theorem one
has t o show t h a t every minimal sub1 n e a r
2 q
i s i n f a c t l i n e a r . This
p r o o f then i s a m a t t e r o f r o u t i n e .
A s i m i l a r argument i n f a c t provides a p r o o f f o r t h e theorem on f l o w s i n networks which we gave i n s e c t i o n 1 8.2. Under t h e h y p o t h e s i s t h a t t h e existence o f a s u i t a b l e flow i s equivalent t o s u f f i c i e n t import capacity l e t us c o n s i d e r a minimal system among t h e p i p e l i n e systems such t h a t s t i l l t h e s u f f i c i e n t i m p o r t c o n d i t i o n h o l d s . Then t h e r e i s a p o s s i b l e and p o s i t i v e f l o w i n t h a t minimal system. B u t t h e n a l l t h e p i p e l i n e s have t o work on f u l l c a p a c i t y , o t h e r w i s e we would have a c o n t r a d i c t i o n t o t h e m i n i m a l i t y o f t h e p i p e l i n e system. Hence, t h e e s s e n t i a l argument i n t h e p r o o f o f t h e theorem c o n s i s t s i n showing t h a t t h e c a p a c i t i e s o f a minimal p i p e l i n e system define a p o s s i b l e p o s i t i v e f l o w . A c t u a l l y t h i s procedure has some advantages over t h e p r o o f we have given, s i n c e i n a d d i t i o n i t p r o v i d e s an a l g o r i t h m f o r f i n d i n g t h e d e s i r e d f l o w . T h i s a l g o r i t h m c e r t a i n l y c o n s i s t s of making c o n s e c u t i v e l y each p i p e l i n e as smal.1 as p o s s i b l e w i t h o u t v i o l a t i n g t h e i m p o r t c a p a c i t y c o n d i t i o n . T h i s a l g o r i t h m has t h e f u r t h e r advantage t h a t t h e flow one o b t a i n s by t h i s procedure i s an extreme p o i n t i n the s e t o f a l l possible p o s i t i v e flows.
The Sandwich Theorem
In t h e case of n o n f i n i t e as i n the f i n i t e case, s t h s case a ( t r a n s f i n i t e o f the algorithm f o r the ceding s e c t i o n .
1.9.4
83
network systems t h e s i t u a t i o n i s not as simple nce measurability conditions a r e involved. B u t i n algorithm can e a s i l y be obtained by a p p l i c a t i o n Sandwich Theorem which we described i n t h e pre-
Remarks about Networks and t h e Disintegration Theorem
Around 1960 ( s e e 11881 t o 11911) a systematic i n t e r e s t s t a r t e d i n t h e existence of product measures with prescribed marginal measures .when additional conditions a r e imposed upon t h e product measure. These additional conditions require t h a t e i t h e r t h e product measure has t o admit a d i s i n t e g r a t i o n w i t h r e s p e c t t o given t r a n s i t i o n p r o b a b i l i t i e s o r i t has t o be dominated by a given measure on the product space. In f a c t these two conditions a r e intimately connected. In t h e p u r s u i t of t h i s problem V . Strassen wrote h i s celebrated paper 13043 where he gave the following the0 rem: The Strassen Disintearation Theorem:
(X,x,m) -be a measure ~space with p o s i t i v e -~ f i n i t e measure m . ---Assume t h a t f o r every x E X a sublinear Let -
E be-a separable ---Banach space and l e t
functional
0" E ---__ i s given such t h a t
px
s u p I l p , ( s ) l / s E E, IIsIII l l < m -f o_r_a l l
i)
II pxll
ii)
functions X 3 x -, II pxII and x -,p x ( s ) f_ or _ a l l s E E , functions in 1 L (dm).
Then f o r every u ---
E E'
=
with -
~ ( sI ) J p,(s) dm(x) X
there are --
pX
for all -
s
E E
such t h a t --
E E'
i)
lJx 5 P,
ii)
x
-,
for all
u,(s)
x
E X
is,for all
s
E E
,in
1 L (dm)
are,
x
E X
Linear Functionals
84
iii)
~ ( s =)
I X
u x ( s ) dm(x) -for a l l s E E.
This theorem has a wide range o f applications ([173],[229]). The d i f f e r e n c e between t h i s theorem and appropriate s p e c i a l i z a t i o n s of t h e Disintegration Theorem ( a pre- Strassen Theorem i n t h e sense of [2431 i s t h a t here the sublinear L 1- valued operator r e a l l y dominates t h e l i n e a r one whereas i n our case we only considered domination almost everywhere. Of course, combining our r e s u l t with a monotone l i f t i n g (when such a l i f t i n g e x i s t s ) one obtains t h e preceding theorem. This approach t o the StrassenTheorem i s due t o Heinz Ktinig [1991 and has been considered subsequently by other authors ([2431,[2451 ,[3361). Actually the pre - Strassen Theorem i s completely s u f f i c i e n t f o r t h e treatment of s u i t a b l e product measures with prescribed marginals, s i n c e i n t h i s case one i s only i n t e r e s t e d i n almosteverywhere e q u a l i t y . We have l e f t out applications concerning marginal measures, s i n c e these applications a r e standard by now. In t h e case of f i n i t e measure spaces t h e r e is a very intimate connection between combinatorics and network theory on one h a n d and product measures with prescribed marginals on the o t h e r hand. We have shown t h a t Gale's fundamental existence theorem f o r flows i n networks can be obtained from a s u i t a b l e Disintegration Theorem. The o t h e r d i r e c t i o n , namely t h a t r e s u l t s about measures w i t h prescribed marginals can be obtained from network theory and combinatorics, has been observed before. For example i n [911 the Marriage Theorem i s used as an e s s e n t i a l tool and i n 11531 t h e FordFul kerson Theorem plays t h e same r o l e . That, f o r example, the Marriage Theorem and the Ford-Ful kerson Theorem a r e closely r e l a t e d i s we1 1 known [ 1751. In f a c t , the Ford-Ful kerson Max-FlowMin-Cut-Theorem can be used as the s t a r t i n g point f o r network theory and p a r t s of combinatorics. This theorem deals w i t h a f i n i t e network X where only one point s E X i s allowed t o have nonzero production and only one t E X i s allowed t o have nonzero consumption. All t h e other points a r e only s t a r t i n g and endpoints f o r pi pel i nes Then, under prescribed pi pel i ne capacity, t h e question i s t o determine t h e maximal flow from s t o t along the pipe1 ine system. The Ford-Ful kerson Theorem [1101 s t a t e s t h a t t h i s max-flow i s equal t o the min-cut of t h e system, where t h e min-cut i s the minimal import capacity of s e t s A c X with t E A and s d A.
.
85
The Sandwich Theorem
I n f a c t , even G a l e ' s theorem (which c e r t a i n l y l o o k s much more s o p h i s t i c a t e d and has t h e Ford-Fulkerson Theorem as immediate consequence) can be obt a i n e d w i t h t h e h e l p o f max-flows and min-cuts. We d i d n o t show t h a t f o r f i n i t e networks ( w h i c h were n o t i n t h e focus o f o u r i n t e r e s t anyway) one can always have i n t e g e r - v a l u e d f l o w s , p r o v i d e d t h a t t h e consumption measure and t h e c a p a c i t y measure a r e i n t e g e r - v a l u e d .
I n f a c t , t h i s r e s u l t does n o t f o l l o w w i t h o u t a f u r t h e r argument. To o b t a i n t h e i n t e g e r - v a l u e d f l o w one has t o c o n s i d e r an extreme p o i n t o f a l l possible flows. I n f a c t , the r e s u l t i n i t s e l f i s n o t surprising a t a l l i f one l o o k s a t i t f r o m t h e v i e w p o i n t of a l g o r i t h m s , s i n c e t h e a l g o r i t h m we have b r i e f l y d e s c r i b e d i n t h e p r e c e d i n g s u b s e c t i o n c e r t a i n l y l e a d s t o integer-valued flows.
I n t e g e r - v a l u e d f l o w s a r e i m p o r t a n t f o r a r e f o r m u l a t i o n o f a s p e c i a l case o f t h e Flow-Theorem i n terns of(0,l)-
m a t r i c e s ( m a t r i c e s w i t h o n l y zeros
and ones as e n t r i e s ) . T h i s v e r s i o n o f t h e theorem was found i n 1957 b y
A.J. Ryser [2791: Consider m a t r i c e s o f s i z e m S = ( s l , ... ,sn)
and
be t h e s e t o f a l l vector
S
. An
by
n. For given vectors
R = ( r l , . . . , rm)
w i t h nonnegative i n t e g e r s as components l e t
( 0 , l ) - m a t r i c e s w i t h row sum v e c t o r
element o f
A(R,S)
R
A(R,S)
and column sum
can be c o n s i d e r e d as a network, where
t h e e n t r i e s correspond t o t h e p i p e l i n e c a p a c i t i e s and where
R
and
S
p l a y t h e r o l e o f t h e p r e s c r i b e d m a r g i n a l measures. Then t h e e x i s t e n c e o f a s u i t a b l e f l o w corresponds t o
A(R,S)
0
.
I n order t o translate the
i m p o r t c a p a c i t y c o n d i t i o n t o t h e s i t u a t i o n under c o n s i d e r a t i o n we i n t r o d u c e , f o r a g i v e n row sum v e c t o r
R = (rl,.. .,rm) t h e maximal m a t r i x
MR
, that
i s t h e m a t r i x where i n each row w i t h i n d e x j t h e f i r s t r e n t r i e s a r e one j be t h e column sum v e c t o r and t h e o t h e r s a r e zero. L e t SR = (S1,...,~,,) of
MR
. We
say t h a t
of
S
and
SR
-
s1 2
-s 2
2
...2
-
S < SR
(SR
dominates
a r e rearranged such t h a t
sn
, we
have
S)
i f , p r o v i d e d t h e elements
s1 2 s 2 2...1 sn
and
86
Linear Functionals
i)
and
k
z si
i=1
n ii) z si i=1
k I 1 si i=1
for a l l
k = l,...,n-1
n
=
x Si
i=1
Theorem: ( [2791 o r [2801) : A(R,S)
i s non --
empty i f , and o n l y i f ,
S < SR
SECTION 1.2 ORDER UNITS AND LATTICE CONES
The theory of vector l a t t i c e s , and s u i t a b l e subcones of vector l a t t i c e s , permeates many f i e l d s of a n a l y s i s . Therefore t h e main emphasis of t h i s chapter l i e s on t h e study of l a t t i c e cones. These a r e ordered cones such t h a t t h e suprema of f i n i t e l y many elements e x i s t and such t h a t the d i s t r i butive law holds f o r these suprema. This notion turns out t o be t h e natural generalization of vector l a t t i c e . Natural examples f o r l a t t i c e cones a r e : The upper ( o r lower) semicontinuous functions, t h e convex f u n c t i o n s , o r the cones given by t h e sub- or the s u p e r l i n e a r f u n c t i o n a l s . Special a t t e n t i o n will be given t o the l a s t two examples.
B u t before we begin a systematic t r e a t i s e of l a t t i c e cones we s t a r t w i t h a fundamental notion, namely with order u n i t cones. These a r e cones where a l l elements can be measured from above by means of a c e r t a i n i n v e r t i b l e element. This element plays t h e same r o l e as t h e constant function lX i n t h e case o f a concrete cone c o n s i s t i n g of bounded functions on some s e t X . Order u n i t s give r i s e t o t h e introduction of s t a t e s and s t a t e spaces. S t a t e spaces will play an e s s e n t i a l r o l e throughout t h i s book, they a r e more o r l e s s the s t r u c t u r e spaces of order u n i t cones. (Those readers i n t e r e s t e d i n how our s t a t e s a r e r e l a t e d t o s t a t e s o f , say, C*- algebras a r e r e f e r r e d t o chapter 11. 6 . 4 ) .
-
Then we turn our a t t e n t i o n t o special examples of order u n i t cones, where the cones a r e a c t u a l l y vector spaces w i t h an additional l a t t i c e s t r u c t u r e . F i r s t we prove the basic r e s u l t (Kakutani - Krein - Stone - Yosida Theorem) t h a t a l l order u n i t vector l a t t i c e s a r e isomorphic t o dense subspaces o f C ( X ) , where X is t h e compact s e t o f l a t t i c e s t a t e s . Then, i f ' i n addition the order u n i t vector l a t t i c e is order complete, then the well known r e s u l t i s shown t h a t t h e s t r u c t u r e space X i s extranallydisconnected o r , i n o t h e r words, a Stone space. This, of course, c l a r i f i e s the nature of 87
88
Linear Functionals
the order complete vector l a t t i c e s which we introduced a t the beginning of t h i s book as image spaces for the functionals under consideration. A t the end of section 2.3 we deal w i t h the basic construction (due to Loomis and Sikorski) of a U- montone l a t t i c e homomorphism from the space of a l l bounded Baire functions on X ( X compact and extremally disconnected onto C ( X ) . This construction will be important when vector valued representing measures are treated (Chapter 11.4). We continue by discussing under which conditions the cone of a l l monotone linear functionals on a given cone F i s a l a t t i c e cone (with respect to the pointwise order on F ) . This leads t o study the Riesz property and the f i n i t e sum property (FSP) f o r cones. As a byproduct of these considerations we obtain a powerful version of the Cartier-Fell-Meyer The orem. In Chapter 2.6 we consider duality theory for convex cones. Generally speaking, convex cones do not admit a duality theory which i s a s nice as in the case of vector spaces. The reason f o r t h a t deplorable f a c t i s t h a t we can introduce too many different order relations f o r convex cones whereas in the case of vector spaces the structure of order relations i s unique insofar as every order relation i s given by a suitable subcone (which then automatically bears the order which we call natural order). In 2.8 free l a t t i c e cones are treated. The free l a t t i c e cones are the universal elements which come u p when arbitrary order unit cones are embedded into l a t t i c e cones. These free l a t t i c e cones give r i s e t o the introduction of simplicial cones. A cone (F, < ) i s said t o be simplicial i f for i t s positive dual there i s a linear embedding I, : FT + (LF); (positive dual of the free l a t t i c e cone generated by F) such t h a t composition with the restriction map t o F i s the identity. A standard example for a simplicia1 cone i s a cone having a Choquet simplex as base. Another important notion coming o u t o f the consideration of free l a t t i c e cones i s the notion of character. These are s t a t e s on a given cone characterized by a unique extension property t o the assigned free l a t t i c e cone. An important observation i s t h a t they coincide with the extreme point s e t of the s t a t e space. Therefore i t i s n o t a t a l l surprising t h a t in concrete situations they coincide in one way or another with characters
89
Order Units and Lattice Cones
d e f i n e d i n t h e usual way.
F i n a l l y , i n 1.2.11 we r e v i e w t h e t o p i c s discussed i n t h e p r e c e d i n g s e c t i o n s and we t r y t o e x p l a i n a t some examples t h e i n t e r r e l a t i o n o f o u r n o t i o n s and r e s u l t s w i t h t h e c l a s s i c a l t h e o r y . F o r example we prove K a k u t a n i ' s c o n c r e t e r e p r e s e n t a t i o n o f AM- spaces and we p r e s e n t t h e K o r o v k i n theorem for
C(K).
2.1
ORDER UNIT CONES
I n a cone
F we do n o t always have n e g a t i v e elements. But, o f course, i t
f f F
may happen t h a t a s p e c i a l with
f
+ g
= 0. Since
t h a t we denote i t by
g -f
i s invertible, i.e. there i s a
r) €
F
i s t h e n u n i q u e l y determined i t i s q u i t e n a t u r a l
, and
one e a s i l y sees t h a t t h e usual r u l e s o f
c a l c u l a t i o n f o r n e g a t i v e elements h o l d . I n p a r t i c u l a r we t h e n have t h a t t h e v e c t o r space
I R f = t a f l a € IRI
i s a subset o f
F.
I n the following
an i m p o r t a n t r o l e i s p l a y e d by t h e i n v e r t i b l e elements which a r e s t r i c t l y p o s i t i v e . Here, an element s t r i c t l y positive i f
0< f
f
o f a p r e o r d e r e d cone holds, and i f
Now, o u r b a s i c d e f i n i t i o n reads as f o l l o w s :
f < 0
(F,<
)
i s s a i d t o be
does n o t hold.
Linear Functionals
90
2.1.1
Definition:
(F, < ) be a preordered cone. An i n v e r t i b l e , s t r i c t l y p o s i t v e I E F i s c a l l e d -o r d e r u n i t i f f o r every g E F t h e r e i s some A t 0 such t h a t g < A I. ( F , i , I) i s t h e n c a l l e d --o r d e r u n i t cone ( i i ) The s u b l i n e a r f u n c t i o n a l given, f o r g E F, b y (i)
Let
element
SI(g)
= infIa E R
on t h e o r d e r u n i t cone
(F, < I )
i s c a l l e d t h e -order u n i t functional.
And t h e s e t
R =
tp
: F
+k I
p
I g < a I1
l i n e a r , monotone,
1.1 5
SIl
i s c a l l e d t h e -s t a t e space o f o u r o r d e r u n i t cone, i t s elements a r e c a l l e d
states.
Since t h e o r d e r u n i t f u n c t i o n a l i s l i n e a r on t h e subspace I R I i t must be equal ,on t h i s subspace,to e v e r y l i n e a r f u n c t i o n a l i t dominates (see c h a p t e r 1.2). Hence, f o r every s t a t e v E n and e v e r y a E R we have p ( a I ) = a.
F can always be represented b y a f u n c t i o n cone on a s u i t a b l e s e t . The answer i s yes i n t h e sense t h a t t h e r e i s a n a t u r a l o r d e r u n i t cone o f f u n c t i o n s on t h e s t a t e space n o f F such t h a t t h e s t a t e s i n R i d e n t i f y t h e elements of F w i t h c o n c r e t e f u n c t i o n s on 62 T h i s i s e a s i l y e x p l a i n e d : For f E F we d e f i n e 7 : n -,I6 t o be t h e e v a l u a t i o n ? ( p ) = v ( f ) f o r a l l u E n. The f u n c t i o n 7 i s s a i d t o be t h e Gelfandtransform o f f . I n p a r t i c u l a r we have 7 = 1 , and e v e r y f, f E F i s upperbounded on R . Note, t h a t t h e G e l f a n d t r a n s f o r m i s l i n e a r , i.e.
One may ask i f an o r d e r u n i t cone
.
A t A2f2) =
(Alfl
Because the set
h p1
R
t
f(Aplt(l-A)p2)
n
A2T2
( 1 - x ) ~E ~n whenever
must be convex and t h e
f u n c t i o n s on ul,p2
t
Alil
T,
. (f
: n
= ~
f p , () + ( l - A ) f ( p 2 )
+nT
f
i s affine i f f whenever
0 5 A I 1 and
E n). Now we use t h e G e l f a n d t r a n s f o r m t o endow n w i t h a t o p o l o g y , ^F = { ? I f E F} c o n s i s t s o f
namely t h e c o a r s e s t t o p o l o g y such t h a t
91
Order Units and Lattice Cones
k- valued continuous f u n c t i o n s (here, t h e t o p o l o g y o f lk i s , o f course, It--,a)la
understood t o be t h e t o p o l o g y which has
F
t h e open s e t s ) . Since by d e f i n i t i o n
E
R) as a subbase f o r n this
separates t h e p o i n t s o f
t o p o l o g y must be H a u s d o r f f . And i t i s easy t o deduct from T y c h o n o f f ' s theorem ( o r by d i r e c t l y showing t h a t e v e r y u l t r a f i l t e r on .R
converges)
n i s compact under t h i s t o p o l o g y .
that
^F
Note, t h a t i f we endow then
w i t h the pointwise order r e l a t i o n I
(F, I, 1, ) i s a g a i n an o r d e r u n i t cone and
sup,
on
R
i s the associated
order u n i t functional. 2.1.2
Lemma:
The G e l f a n d t r a n s f o r m ---i s an o r d e r u n i t homomorphism f r o m (F, (F, I, I , ) , i . e . (i)
it i s linear
(ii)
^f
(iii)
I= 1 ,
(iv)
SI(f)
whenever
5
f
A
= max,f
= sup,f
-
for -
4
onto ,I ) -
f,g E F
-for all
f E F.
Proof: We a l r e a d y know ( i ) and ( i i i ) . A s s e r t i o n ( i i ) i s an immediate consequence o f t h e f a c t t h a t s t a t e s are assumed t o be monotone, and ( i v ) i s a d i r e c t consequence o f t h e Norm Theorem (1.3.3. ) Let
(F, <
o
, IF) and
(G, < , I G ) be two o r d e r u n i t cones and c o n s i d e r
G.
i s c a l l e d an --o r d e r u n i t cone homomorphism i f i t
+
Q
t h e cone o p e r a t i o n s and o r d e r r e l a t i o n s , t h a t i s , i f f2) =
x1
Q (fl)
+
h2 Q ( f 2 )
for all
and whenever Q
and
fl < f 2
,
fl,f2 E F
i s c a l l e d an --o r d e r u n i t cone isomorphism 0-l
if
fl,f2 E F, X1,x2
E IR+ ;
. Q
i s b i j e c t i v e and
Q
a r e o r d e r u n i t cone homomorphisms.
So, i n case t h a t t h e G e l f a n d t r a n s f o r m i s i n j e c t i v e t h e o r d e r u n i t cones
92
Linear Functionals
(F,<,
I)
and
(r,
5
, In) are
isomorphic. I n case t h a t
^F
space, we can check vhether F and
F
i s a vector
a r e isomorphic by l o o k i n g a t t h e
f o l 1owing semi norm
A t r i v i a l consequence o f 2.1.2 ( i v ) i s t h a t ISIl(f)
2.1.3
= supnlfl
f E F.
for all
Lemma:
L e t F --be a v e c t o r space. I f lSIl -
i s a norm t h e n
(F,<,
I) and
(F, I, In) a r e isomorphic, -and i n p a r t i c u l a r t h e p r e o r d e r < --must be a n t i symme t r ic
.
Proof:
lSIl
Let
SI(f-g)
b e a n o r m and assume = SI(g-f)
= 0. Hence
T
=
G.
Then f r o m 2.1.2
ISIl(f-g)
= 0
( i v ) we conclude
and we must have
f = 9.
The antisymmetry o f t h e p r e o r d e r < f o l l o w s immediately from t h e f a c t t h a t 5
i s antisymmetric on
For v e c t o r spaces
F.
F one
can g i v e another u s e f u l e q u i v a l e n t d e f i n i t i o n
f o r t h e s t a t e space. 2.1.4
Proposition:
L e t F be a v e c t o r space. Then t h e s t a t e space o f (F,< , I ) i s equal t o ------_.---
111 : F - r R
I !.I
linear,
!J
s lSIl, ~
( 1 )= 11
.
Proof: We know a l r e a d y t h a t f o r s t a t e s we have
p ( 1 ) = 1 and
So, what remains t o prove i s t h a t a l i n e a r f u n c t i o n a l p e r t i e s s t a t e d above i s i n f a c t monotone and f u l f i l l s
!J
s
SI I ISI!
.
u h a v i n g t h e pro!.I
s
SI
. Indeed,
Order Units and Lattice Cones
let
g< f
Then
0<
x
p(f)
Now, s i n c e and
a E W
xI
I -(f-g)
x
Thus
x
and c o n s i d e r
and we g e t :
i
=
S I ( h I ) t SI(XI
2
u(x I + g - f )
2 p(g)
and
xI .
(f-g) <
such t h a t
t 0
93
p
g - f ) = ISIl(XI + g - f )
+ p(g) - u(f).
= A
must be monotone.
i s monotone we have w i t h f < a 1 . Hence p
u(a I
-f
) 2 0
for
arbitrary
U ( f ) I i n f I a E IR I f < a 1 1 = S I ( f ) .
2.2
THE
f E
F
0
KAKUTANI-KREIN-STONE-YOSIDA THEOREM
We assume i n t h i s s e c t i o n t h a t
(F,<)
i s a v e c t o r l a t t i c e . L e t us r e c a l l
F whose p r e o r d e r < i s a n t i symmetric and w i t h every f,g € F t h e v e c t o r space F c o n t a i n s t h e supremum and infimum o f f and 9 . L a t e r on, i n s e c t i o n 2.4., we s h a l l t h a t a v e c t o r l a t t i c e i s a v e c t o r space
g e n e r a l i z e t h e n o t i o n o f v e c t o r l a t t i c e s t o l a t t i c e cones. L e t us mention again some b a s i c i d e n t i t i e s whose p r o o f s a r e s t r a i g h t f o r w a r d and a r e l e f t t o t h e reader:
(11
suolf,gl
=
-
(2)
sup(xf, xg)
=
x sup(f,g),
(3)
sup(f+h ,g+h) = sup(f,g)
-
(4)
f = f+
where
f+ = sup(f,O)
2.2.1.
Lemma:
f-
for all
,
Assume t h a t ( F , < , I ) ~-
f E F.
infl-f,-gl
f-
=
+ h,
.
f, g E F
X t 0, f,g E F f,g,h
E
F
f E F
(-f)
t
i s a vector l a t t i c e w i t h order u n i t ---____---
u with u(f-)
= 0
and -
I -and l e t
94
Linear Functionals
If SI(-f) -
= 1 ----then t h e r e i s a s t a t e
with
v
and
v(f+) = 0
v ( f - ) = v ( f ) = +1. Proof: By Lemma 2.1.2
xI2
then
1=
We o b t a i n
( i v ) there i s a state
f . Hence p(f)
xI= + s u(f )
S i m i l a r l y , t h e assumption v
with
with
P
5 SI(f
SI(-f)
v ( f + ) = 0, v ( f - ) = t 1
+) =
5 1 and t h u s
.
for a l l
f, g E F. Note t h a t sup(f,g)
i s c a l l e d l a t t i c e homomorphism i f = (f-g)'
Hence i n o r d e r t o prove t h a t a g i v e n s t a t e = sup(p(h),O)
n be t h e s t a t e space o f
F
we have d e f i n e d a t o p o l o g y on
R
Let
.
1 > 1
If i.e.
+ p(f )
=
P
p(sup(f,g))
= 1
SI(ft)
.
1, u ( f - ) = 0.
= sup(P(f),u(g))
+ g f o r a l l f, g E F. i s a l a t t i c e homomorphism
for all
h E F.
. Recall
t h a t i n t h e preceding s e c t i o n under which t h e s t a t e space i s compact.
The s e t o f a l l l a t t i c e homomorphisms on
2.2.2
+
0
p
U(ht)
= f
1 ensures t h e e x i s t e n c e o f a s t a t e
A state
i t s u f f i c e s t o show
P(f) = 1
sup(x I ,O) t sup(f,O)
F
i s a subset o f
n
.
Lemma:
{U : F -, k I 1.1
Proof: -
l a t t i c e homomorphism}
-i s
a compact _ subset~ o f
I
~
.
F i x f, g E F Then c l e a r l y 111 E R I P (sup(f,g)) = s u p ( u ( f ) , I - ( g ) ) l i s closed, hence compact. So t h e a s s e r t i o n f o l l o w s from 111 :
F
-, fi
I
l a t t i c e homomorphism} =
)J
Now, l e t S denote a compact H a u s d o r f f space. Then we denote C ( S ) = i f : S -+ IR f c o n t i n u o u s } . I f C ( S ) i s equipped w i t h t h e p o i n t w i s e order
I then
(C(S),
I
w e l l known sup-norm on We show t h a t (F,*)
S
, Is)
i s an o r d e r u n i t cone and
lSIl
(which we denote i n t h e f o l l o w i n g by
i s the
I I . II ) .
( C ( S ) , 5 ) i n c l u d e s a l r e a d y a l l examples o f v e c t o r l a t t i c e s
with order u n i t
w i t h respect t o
lSIl
I such t h a t
. Indeed,
lSIl
we have:
i s a norm and
F
i s complete
-
95
Order Units and Lattice Cones
2.2.3
[2 1 ) :
Theorem f'Kakutani-Krein-Stone-Yosida
Let (F,< , I ) -be a _vector- l a t t~i c e w i t h an order u n i t . Then t h e r e i s a compact Hausdorff space S ---and an order u n i t homomorphism @ from (F, i ,I ) i n t o ( c ( S ) , I , Is) -such t h a t @ ( F ) i s sup-norm dense in
_ .
we have C(S). Moreover, --
I] @ ( f ) l l= I S , l ( f ) 5 --a norm,then 0
-for all f
In p a r t i c u l a r , i f ISI\ from F onto a dense subspace o f C(S).
E
F.
i s an order u n i t isomorphism
Proof: Let n be t h e s t a t e space of ( F , < , I ) . F i x some f E F with 1 S I l ( f ) = 1 and assume without l o s s of g e n e r a l i t y t h a t S I ( f ) = 1. We show t h a t t h e r e i s a l a t t i c e homomorphism K(f-) = 0 :
g E F Then
Consider a s t a t e u w i t h
the compact s e t
u E no
cp =
= Cu E
g We claim t h a t
.
To prove t h i s we take
where
62
+ inf{g.1 I
A c
i E A}.
n
with
li
U(f)
1 v(ft)
=
K(f+) = 1 and
u ( f + ) = 1 and define f o r
+
1, u(g )
c
u(g-) = 01.
n n...n n * 0 f o r a l l g1 ,... ,gn E F . 91 n { l ,...,n } t o be a maximal subset with p(cp) > 0 , We can assume A + 0 s i n c e otherwise
n n...n n . For 0 < h we define n 91 t l ( h ) = sup{p(k) 0 < k < h and t h e r e i s x > 0 with k < x c p ) Then v i s l i n e a r on the cone of a l l p o s i t i v e elements of F and can t h u s be extended t o a l i n e a r function on F which will be c a l l e d v again. The proof of t h e l i n e a r i t y of v follows from an elementary computation: Indeed, v i s s u p e r l i n e a r by d e f i n i t i o n . So i t remains t o show t h e suba d d i t i v i t y of u Therefore, l e t h l , h 2 z 0 and assume O < k< h l + h 2 . p E
.
.
Then d e f i n e k l and
k = kl
+
k2
=
inf(k,hl)
.
and
k2 = k
-
kl
. We have
From t h i s observation we derive
v(hl
0
+ h 2 ) I v(hl) +v(h2),
which i s t h e s u b a d d i t i v i t y of u . We have u(w) = v(cp) > 0 and, f o r a l l O < h , 0 Iv(h) Iu(h) by d e f i n i t i o n of v and monotony o f u
From f + < ( l + c ) I , f o r every
E
> 0 , we get
Hence u ( f + ) = ~ ( 1 2) ( S I ( c p ) ) - l v ( w ) > 0 F i n a l l y , we claim t h a t
p =
(u(I))-'u
0
I v(1-f
+)
+
I u(1-f ) = 0
in view of t h e monotony of i s in
n , i = 1,..., n . gi
. .
v
.
96
Linear Functionals
We g e t
p ( f t ) = 1 from
quence o f
u(1) = v(f+)
v ( g 71) = 0, i = 1, ..., n.
and p ( g i )
-
p(g;)
i s a conse-
= 0
The l a t t e r f a c t f o l l o w s f r o m t h e ob-
h = g- , t h e u ( k ) must be equal t o zero f o r those j considered i n t h e d e f i n i t i o n o f v (because k = 0 i f j E A and
servation that, i f k
t
because p(inf{cp,gjl)
= 0
otherwise).
n i s compact. We have K(g+) K ( q ) =
since
~ ( g ' ) = s ~ p ( ~ ( g ) , O ) .T h i s shows t h a t Furthermore, we have
f o r a11
E
n
SEF
R
g
g E F which means
o
. Let
s
c
n be t h e s e t
i s a compact H a u s d o r f f space.
: F -,C(S) by @ ( f ) ( w ) = v ( f ) f o r a l l v E S and a l l f € F . i s c l e a r l y an o r d e r u n i t homomorphism. The p r e c e d i n g argument shows
Define
@
f E F with
that for K(f-) =
o
IS,l(f)
=
or
i s dense i n
IS,l(f)
K ( f - ) = 1 and
11 @ ( f ) I I
for all
u n i t isomorphism from
2.3
K(f-) = S
o
K
i s a l a t t i c e homomorphism.
K
K ( f t ) = 1 and
o f a l l l a t t i c e homomorphisms, i . e .
0
Hence t h e r e i s some
C(S)
= 1 there i s
K(ft) =
f E F.
F onto
o ,
K
i.e.
E S
IK(f)l
T h i s proves t h a t
@(F) i f
with
o
=
K ( f t ) = 1 and
1
. Hence
i s even an o r d e r
ISI/ i s a norm. F i n a l l y ,
o(F)
which i s a consequence o f t h e Stone Weierstrass theorem.
ORDER COMPLETE VECTOR LATTICES WITH ORDER U N I T
Recall t h a t a vector l a t t i c e
(F, <)
i s c a l l e d o r d e r complete i f f o r any
A c F which i s o r d e r bounded from above ( i . e . t h e r e i s f E F w i t h a < f f o r a l l a E A ) t h e supremum o f A , sup(A), e x i s t s . Then, c e r t a i n l y , f o r e v e r y subset B c F which i s o r d e r bounded from below t h e infimum o f B, i n f ( B ) , e x i s t s s i n c e i n f ( B ) = - sup(-B). L e t S be a compact H a u s d o r f f space. Then C ( S ) equipped w i t h t h e p o i n t subset
97
Order Units and Lattice Cones
wise order if
I i s a ( n o t n e c e s s a r i l y o r d e r complete) v e c t o r l a t t i c e . Here,
f,g E C(S),
t h e supremum o f
supremum, i . e .
A c C(S)
.
in
(C(S),s)
i s j u s t the pointwise
for all
s E S. However, i f
i s an i n f i n i t e bounded subset whose supremum sup(A)
(C(S),<),
in A
f,g
= max(f(s),g(s))
sup(f,g)(s)
then
sup(A)
For instance, l e t
and c o n s i d e r
S = [0,11
A = { g E C(S) 1 0 Ig 5 1, g ( 0 ) = 0). Here, sup(A) = lS hand t h e p o i n t w i s e supremum f i s d e f i n e d b y
i
f(s) =
1
s 9 0
0
s = o
exists i n
need n o t be t h e p o i n t w i s e supremum o f t h e f u n c t i o n s b u t on t h e o t h e r
I n o r d e r t o be a b l e t o d i s t i n g u i s h between these suprema we denote t h a t
A
p o i n t w i s e supremum of
by
Sup(a)
and, s i m i l a r l y , t h e p o i n t w i s e infimum
by I n f ( A ) .
A compact Hausdorff space
U
i s open whenever
c S
i s c a l l e d e x t r e m a l l y disconnected i f
S
i s open
( 0
denotes t h e c l o s u r e o f
0
U i n S ).
Simple examples o f extremally disconnected spaces a r e a l l f i n i t e s e t s endowed w i t h t h e d i s c r e t e t o p o l o g y . The n e x t p r o p o s i t i o n p r o v i d e s us w i t h many o t h e r i m p o r t a n t examples :
2.3.1
p o s i t io n -.(Stotie .-P r o-
[ 302] :
is order complete ifand only if --
C(S)
S
i s e x t r e m a l l y disconnected.
Proof: A t first, l e t
C(S)
that
We show,
6* S . , an
x B
6
16 o f
function
h
Certainly, 0 Ik I1
u c U
for a l l
fi .
x
= 0 on
. We
Therefore,
Now, assume t h a t
i
, gx(x)
= 0
and
. C(S)
i n view o f o u r assumption.
S \ i . F o r any u E i t h e r e i s k E C(S) w i t h S\U and k ( u ) = 1 . Hence k I h s i n c e k Ig X
conclude t h a t
h
must be open. Thus, S
0 Igx I1
such t h a t
which e x i s t s i n
h = 0 on
,k
i s open b y p r o v i n g t h a t t h e c h a r a c t e r i s t i c
gx E C(S)
inf g xaii
=
U c S, which i s open, such
i s continuous. By Urysohn'slemma t h e r e i s , f o r e v e r y
element
gx(u) = 1 f o r a l l Put
be o r d e r complete. Consider
i s the characteristic function o f S
i s extremallydisconnected.
i s extremallydisconnected. L e t
A c C(S) be bounded
98
Linear Functionals
f
from below and l e t
be t h e p o i n t w i s e infimum o f
A
which i s upper
semicontinuous, n o t necessarily continuous. We have , f ( S ) c [ - N, N ] some
. Consider
N > 0
define
U. J ,m
x
-1 = f (]-m,x
j ,m
. Furthermore,
m
=
j ,m
- N
,j
2N j
t
= 0,1,
U
[ ) . Then we o b t a i n
o,m
...,m y c
U
m E
for
N, and
c... c U
l,m
m ,m
U a r e open. L e t fjYm be t h e j ,m c h a r a c t e r i s t i c f u n c t i o n s o f t h e open and c l o s e d s e t s Uj,m'Uj-l,m
for all
j
=
-
. (We p u t
O,l,...,m
d i s j o i n t . Define
f,
=
all
U-l,m
=
k3 ) . These s e t s are,of course,
m
.
E x
j , m fj,m a r e continuous. We c l a i m t h a t (f,) t h i s i t s u f f i c e s t o prove t h a t , f o r
Hence we c o n s i d e r
j =O
x E S
fm i s continuous s i n c e a l l
By d e f i n i t i o n t h e s e t
whereas
Xj+l,m
and we assume x E
0 5
for a l l
If
x E
-
f(X)
for a l l
-
t h e n (**) i m p l i e s
.
f o r snme
1 I 2N;Fiy 0 I
fn(X)
[ X ~ , ~ , X ~ + ~ , ~ ~ .
.
fm Hence
-
1 f(X) 5 2 N 5 S
,
, hence
hEC(S) i s such t h a t
US
It i s w e l l known, t h a t
BX
2 a
for a l l
w i t h more examples o f e x t r e m a l l y d i s c o n n e c t e d B(X)
B(X)
i s t h e Stone
be t h e Banach space o f a l l
* .
bounded, r e a l v a l u e d f u n c t i o n s on a s e t
, where
S.
U
compact H a u s d o r f f spaces. Indeed, l e t
C(B X )
h2 a
g
on
h I g on a dense subset o f S and t h e r e f o r e i s t h e g r e a t e s t l o w e r bound o f A , and hence
P r o p o s i t i o n 2.3.1 p r o v i d e s
sup-norm.
'u j , k ) )
('j,k
x E Uktl ,n\Uk,n
So, ( * ) i s proved on a dense subset o f
on S T h i s shows, g C(S) i s o r d e r complete.
to
j=l
Now, t h e value o f f m ( x ) i s equal t o
fn i n s t e a d o f
a€A, s i n c e f = I n f ( A ) . I f
j ,m
n
denotes t h e l i m i t o f t h e fm then, by c o n t i n u i t y and ( * * )
g
a E A
3.
f,(X)
U k=m,n
= S'
has t o be some v a l u e i n t h e i n t e r v a l
The same argument holds f o r
(**)
s
and
s i s dense i n s .
f(x)
f
i s a norm Cauchy sequence. To show n 2 m and a l l x E S
i n o r d e r t o be sure t h a t x E Ujtl,m~~j,m j and k
.
mutually
-
X 0 I n B(X) we c o n s i d e r t h e i s i s o m e t r i c and o r d e r isomorphic Czech c o m p a c t i f i c a t i o n o f
X
99
Order Units and Lattice Cones
endowed with the discrete topology. On the other hand , B ( X ) i s clearly order complete. So, 13 X must be extremally disconnected by Proposition 2.3.1. I n particular, we mention the case X = N . Next, we prove another useful property of extremally disconnected sets which i s implicitly contained already in the proof of 2.3.1. Recall t h a t a subset V of a topological Hausdorff space S i s called meagre i f there are subsets W n c S, n E N , with V = U Wn and interior(p ) = 0 for a l l n . Meagre n
n a
sets are stable under countable unions, t h a t i s , the union of countably many meagre sets i s meagre. 2.3.2
Proposition ([338]) :
Let S be an extremally disconnected compact Hausdorff space and assume
that
i s bounded from below. Then
A c C(S)
{s E S
I (Inf
A)(s) > ( i n f ( A ) ) ( s ) } i s meagre.
Proof: Let
wn
Then a l l
=
n {s E S I a(s)
1
2F +
aEA Wn are closed and
(inf(A))(s)l,n E N
Is E S I ( 1 n f A)(s) > ( i n f ( A ) ) ( s ) }= U Wn with
-
UcW,
interior(in) * b
. Since
S
.
nm
. Assume there
Then there exists an open s e t
i s extremallydisconnected,
the characteristic function 10 of inf(A)
1 1- t inf(A) n U
5 -
.
I
U
i s some n E N
@ * U c S with
i s open and closed. Thus,
i s continuous. We obtain a for a l l
a E A ,
a contradiction. Let K be any compact Hausdorff space and denote by Baire ( K ) the vectorspace of a l l realvalued bounded Baire measurable functions on K (see Appendix A 1 ) . Recall t h a t Baire ( K ) i s the smallest vector space F of realvalued bounded functions on K which contains C ( K ) such t h a t InfIf, I n E N ) E F whenever f n E F and f n 2 g for a l l n E N and some g E F.
100
Linear functionals
Recall t h e d e f i n i t i o n o f a 2.3.3
-
Theorem (Loomis
C(S)-valued measure i n A 5 .
S i k o r s k i l‘3391):
be an e x t r e m a l l y disconnected compact H a u s d o r f f space. -Then f o r Let S -
e v e r y f E B a i r e ( S ) --t h e r e i s a unique L ( f ) E C ( S ) -such t h a t is E S 1 f ( s ) L(f)(s)l i s meagre. -The map L : B a i r e ( S ) -, C(S) -___ i s linear and d e f i n e s a C ( S ) - valued measure --u- a l g e b r a o f t h e B a i r e s e t s on S Proof: L e t M = I f E Baire(S)
I there
.
m
0”
w i t h respect t o the
S
i s L ( f ) E C(S)
.
S3
d i f f e r o n l y on a meagre subset o f
such t h a t
L(f)
and
f
M i s , by d e f i n i t i o n , a v e c t o r space s i n c e t h e u n i o n o f two meagre s e t s i s meagre. For f E M , l e t L(f), i ( f ) E C(S) be f u n c t i o n s which d i f f e r
. Then
Cs E S l L ( f ) ( s ) + % ( f ) ( s ) l i s meagre. From B a i r e ’ s c a t e g o r y theorem i t f o l l o w s t h a t I s E S I l ( f ) ( s ) = i ( f ) ( s ) l i s dense i n S. Hence L ( f ) = i ( f ) s i n c e
from
f
o n l y on a meagre subset o f
S
b o t h f u n c t i o n s a r e continuous. T h e r e f o r e L ( f ) Hence l :
M
-,
I t remains t o show t h a t
O f course, all
C(S) c
M
.
M = Baire(S): L e t f n E M and
n E N. Then L ( f n ) 1 L ( g )
i n f ( L ( f n ) ) E C(S), n inf(L(fn)) n
i s unique.
i s linear.
C(S)
Inf(L(fn)) n
and I n f ( l ( f n ) ) n
for a 1 and
g E
M such t h a t f n 2 g f o r
n E N
Inf(fn). n
. We c o n s i d e r By P r o p o s i t i o n 2.3.2,
d i f f e r on y on a meagre s e t . Furthermore,
I n f ( l ( f n ) ) and I n f ( f n ) d i f f e r o n l y on a meagre s e t s i n c e t h e c o u n t a b l e n n u n i o n o f meagre s e t s i s meagre. We o b t a i n f = I n f ( f n ) E M and n L ( f ) = i n f ( l ( f n ) ) . The corresponding a s s e r t i o n i s t r u e w i t h n Inf
M
i f the
= Baire(S)
Bc S
fn a r e bounded by some
g E M
linear. Let
Bn
For any B a i r e s e t
be t h e c h a r a c t e r i s t i c f u n c t i o n . C l e a r l y
D e f i n e m(B) = L ( l B ) . I n p a r t i c u l a r , we have
,n E
N
, be
instead o f
from above. We conclude,
from t h e remark p r e c e d i n g Theorem 2.3.3.
, l e t lB
Sup
m(0)
= 0
lB E Baire(S).
, since
L was
a sequence o f m u t u a l l y d i s j o i n t B a i r e s e t s
101
Order Units and Lattice Cones
in
. Then
S
1
"
n aBn
clearly
sES.
for a l l
( s ) = sup i n f { l (s) I n 2 m l m a Bk Bk k=l k=l
(s) = l i m inf n +-
n=l
1
I n view o f t h e p r o p e r t i e s o f
m
m( U Bn)
1n
=
"
L( 1
n a
) = Bn
m a
n
Hence
2.4
is a
m
n t L(lB ) k=l k
sup i n f I
= l i m in? + W
t
n
E m(Bk)
k=l
C ( S ) - valued measure.
we o b t a i n
I
n tm 1
.
0
LATTICE CONES
We cannot a v o i d t o b e g i n w i t h some elementary d e f i n i t i o n s . 2 . 4 . 1 D e f i n i t i on:
(F, < ) be some o r d e r e d cone ( w i t h an a n t i s y m m e t r i c o r d e r r e l a t i o n ) . have l a t t i c e cone i f any two elements f,g E F ( i ) ( F , i ) i s c a l l e d a ~-
Let
a supremum
sup(f,g) h
+
in
F such t h a t t h e d i s t r i b u t i v e l a w h o l d s , i . e .
sup(f,g)
= sup(h+f,
for a l l
h+g)
f,g,h
E
F.
( i i ) A l a t t i c e cone i s s a i d t o be complete i f e v e r y nonempty upper-bounded set
A c
F has a supremum sup(A)
such t h a t t h e u n r e s t r i c t e d d i s t r i b u -
t i v el a w holds, i . e . f
+ sup(A)
= supff + a
Ia
E A}
f o r every
O f course, upper-bounded means t h a t t h e r e i s some for a l l
f E
g E F with
F
. a -c g
a E A.
The r e a d e r s h o u l d r e a l i z e t h a t , i f
F
i s a v e c t o r space, t h e requirements
o f t h e d i s t r i b u t i v e laws a r e redundant. Furthermore, i t i s q u i t e obvious, t h a t i n t h i s s p e c i a l case we g e t immediately t h e a p p r o p r i a t e i n f i m a by going over t o
-f, - g
or
-A
r e s p e c t i v e l y . That i s n o t t r u e i n t h e
general case. Even i n f i m a of f i n i t e s e t s must n o t e x i s t i n general l a t t i c e
102
Linear Functionals
cones. O f course, i n a complete l a t t i c e cone e v e r y lower-bounded subset has an infimum (equal t o t h e supremum of i t s l o w e r bounds), b u t t h e p o i n t s i s , t h a t even f i n i t e subsets do n o t always have l o w e r bounds. F o r instance, t a k e t h e cone
Conv(F) o f 1.2.2. (v) c o n s i s t i n g o f a l l nonF endowed w i t h t h e p r e o r d e r c g i v e n b y i n c l u s i o n . because f o r e v e r y s e t ( C o n v ( F ) , c ) i s a complete l a t t i c e cone, {Ai I i E 11 o f nonempty convex subsets Ai o f F , I any i n d e x s e t , t h e
empty convex subsets o f
supremum i s g i v e n by
I E Xiai iEJ
I
J
c
ai E Ai,
I finite,
x. 20, z x i =
'
i€J
11
.
Here, t h e u n r e s t r i c t e d d i s t r i b u t i v e l a w h o l d s t r i v i a l l y . B u t f o r any two d i s j o i n t elements
A
and
B of
Conv(F)
t h e r e i s no l o w e r bound.
So, t h e n o t i o n " s e m i l a t t i c e - c o n e " o r even "meet-semi1 a t t i c e - c o n e " i n s t e a d
o f " l a t t i c e cone" would have been more precise. B u t f o r t h e sake o f b r e v i t y (and by abuse o f language) we have chosen t h e n o t i o n s as above.
-I n analogy
t o 1.2.2 we denote b y
(F, < )# , ( F , < ) #
and
R- valued monotone s u b l i n e a r , s u p e r l i n e a r and l i n e a r maps on
t i v e l y . I n case t h a t < i s equal t o = we j u s t w r i t e 2.4.2
#
F
)*
(F,<
, F#
F and
the
, respecF*.
Remarks
i)(F, <)# i s a complete l a t t i c e cone under t h e p o i n t w i s e o r d e r on F : I f A c (F,< )# i s upper-bounded ( i . e . sup{a(f)la E A1 < + for all f E F) then t h e supremum i s g i v e n by t h e p o i n t w i s e supremum: s u p ( A ) ( f ) = s u p I a ( f ) l a E A),
f E F.
ii) (F,< )# i s i n general n o t even d l a t t i c e cone w i t h r e s p e c t t o t h e p o i n t w i s e o r d e r on F. B u t i t i s a complete l a t t i c e cone w i t h r e s p e c t t o t h e i n v e r s e o f t h i s o r d e r i n g . With r e s p e c t t o t h i s i n v e r s e o r d e r i n g e v e r y nonempty subset A i s upper-bounded and t h e supremum i s g i v e n by t h e p o i n t w i s e infimum F 3 f -, i n f l a ( f ) I a E A)
.
We r e c a l l t h a t i f i n a s e t preorder
<'
F a p r e o r d e r < i s given, t h e n t h e i n v e r s e
i s d e f i n e d by:
Order Units and Lattice Cones
iff
g
f
I t i s obvious t h a t i f
(F,<)
g< f
103
. (F,< ' )
i s a p r e o r d e r e d cone t h e n
i s also
a p r e o r d e r e d cone. I n t h e above examples t h e suprema were g i v e n by p o i n t w i s e o p e r a t i o n s . T h i s i s n o t t h e case
f o r t h e i n f i m a . F o r example t h e p o i n t w i s e infimum
o f two s u b l i n e a r maps i s i n general n o t a t a l l s u b l i n e a r . B u t t h e s e i n f i m a ( i f t h e y do e x i s t s ) a r e e a s i l y c o n s t r u c t e d w i t h t h e h e l p o f envelopes. Def in i t $ o n :
2.4.3
(F, < )
Let on
F.
be a p r e o r d e r e d cone and l e t cp
Then c o n s i d e r t h e f o l l o w i n g maps on
-R-
valued
map
F:
n cpv(f) = i n f { t cp ( f k ) l n E N , fl,...,fn k=l d ( f) =
be some
E F
such t h a t
n f < X fk} k=l
n n t c p ( f k ) l n E N , f l,...,fn E F such t h a t t f k < f3 k=l k=l
SUP{
R i s f o r m a l l y d e f i n e d t o be a r e c a l l e d t h e l o w e r and upper (F,* ) - en-
where t h e supremum o f an unbounded subset o f +
m
. The maps
and cp"
(p"
velopes.
2.4.4
Proposition:
are monotone
(i)
cp"
(ii)
V A cp
cp"
(iii) _Lf ~ " ( 0 )
*-
m
then
cp"
&
sublinear
(iv)
rf.
(v)
I f p I cp
(vi )
_Lf q 2
(vii)
cp
E (F, < )# i f 2nd o n l y
(viii)
cp
E (F, < )# i f and o n l y i f cp
cp"
does no t a t t a~ i n t h e v al u e +m then -
cp
,
2 monotone and 3 monotone
i t i s superlinear
then p 5 cp" super1 i n e a r then q 2 cp" i f cp = cp" and cp * sublinear
= cpA
Linear Functionals
104
Proof: ( i ) and ( i i ) a r e immediate consequences o f D e f i n i t i o n 2.4.3.
(iii) The d e f i n i t i o n o f cpv immediately i m p l i e s ( p V ( f t g ) 5 cpv(f) tcpv(g) f,g E F , and moreover we have cpv(0) I 0. I f ~'(0) 2 0 t h e n
for V
Q
(0) =
V
cp
gives
( O t o ) I ( ~ " ( 0 ) t cpV(o)
, and
we must have ~ ' ( 0 ) = 0
cpV(o) =
--m
, SO i f
, ~ ~ ( $0 0)
T h i s proves t h a t cpA
-m
must be s u b l i n e a r .
cpv
( i v ) From t h e d e f i n i t i o n we c l e a r l y g e t d ( 0 ) 2 0 and CPA ( f t g ) 2 (p"(f) t cp"(g) i f c p " ( f t g ) < +-m . SO, i f cp" values i n
cpV(o)+
only attains
i s i m p o s s i b l e because cp"(0) = cpA(n.0)2n ~ ~ ( 0 ) .
i s then superlinear.
( v ) and ( v i ) a r e immediate consequences o f D e f i n i t i o n 2.4.3.
and t h e i n e -
q u a l i t i e s which h o l d f o r s u b l i n e a r and s u p e r l i n e a r f u n c t i o n a l s . ( v i i ) I f cp E (F,< )# t h e n Using ( i i i ) we see t h a t cpv
b y ( v ) and (ii)g i v e s cp = cp". and cp(0) + - a i m p l y t h a t cpv i s sub-
Q I cpv
= cp
l i n e a r (and monotone by (i)). T h i s shows cp E (F,<
)
#
.
( v i i i ) i s e s s e n t i a l l y proved i n t h e same way as ( v i i ) .
0
Rephrasi ng y i e l ds : 2.4.5
Theorem:
Consider i n (F,<)#
(i)If ~ ' ( 0 )
+
cpA
(ii)
fimum o f --
2.4.6
I
P
I
order
.
of )#-supremum -
(F,<
cpl.
I q E (F, < )#
I
cp I
ql
k then
.
cpA
i s the --
(F, < )#
-in-
Corollary:
( i ) pl,...,pn for -
the p o i n t w i s e
a t t a i n s values o n l y i n
Consider -again i n
pl(fl)
)#
t h e n cpv -i s the
--m
#
IP E (F, <
and (F, <
t...t
(F,<
)# and (F, < ) #
E (F, < )# has an infimum i n pn(fn) 2 0
f E F, g i v en by
whenever
0 < fl
the p o i n t w i s e
order.
(F, < ) # ---i f and o n l y i f
t...t
fn. ---T h i s infimum i s then,
105
Order Units and Lattice Cones
n
o(f) = inf{ (ii)
k=l
E (F,<
ql,...,qn
f o r every --
pk(fk)
1
n
I fl,...,fn
E F, f < 1
k=l
has a supremum i n (F,<)#
)#
fk3. i f and o n l y i f ,
,
f
.
T h i s supremum i s t h e n g i v e n b y t h e f u n c t i o n a l q Proof: (i)
Take
t o be t h e p o i n t w i s e infimum o f
cp
o and
finition of
@"
V
we have cp I o I 9.
pl,
...,pn
.
Then, by de-
o i s c l e a r l y subadditive o(0) 2 0
i s equivalent t o and monotone. The c o n d i t i o n , g i v e n i n (i), Hence
0
o
fore
i s s u b l i n e a r . P r o p o s i t i o n 2.4.4
. Now,
= @"
Ep E (F, < )
supremum o f of
p1,
(i), @"
by Theorem 2.4.5. #
". 'Pn .
Ip
o
(v) yields
( i i ) i s proved w i t h P r o p o s i t i o n 2.4.4 e s s e n t i a l l y t h e same way as ( i ) .
and t h e r e -
I (p"
i s equal t o t h e p o i n t w i s e
which must be t h e
I cp)
.
(F,< ) #
( v i ) and Theorem 2.4.5
- infimum
(ii)i n
0
We conclude t h i s c h a p t e r w i t h a t e c h n i c a l r e s u l t which w i l l have some i m portance l a t e r on. The arguments f o r t h i s theorem a r e c l o s e l y r e l a t e d t o t h e p r o o f o f t h e Sum Theorem. 2.4.7
Theorem:
L e t (F, < ) be a l a t t i c e cone and c o n s i d e r f i x e d Then there a r e pl,p2 E (F, < )* y itJ 91'92 E F. u(suP(glYg2))
=
!q(q)+
p
E (F , < )
p1 t p2
= p
*
and such t h a t
"(92).
Proof: Consider
F
x
F
F
x
F
= { ( f ,f )
1
2
I f 1 ,f 2
E F}, t h e f u n c t i o n s f r o m
into
i s an o r d e r e d cone under p o i n t w i s e o p e r a t i o n s and p o i n t w i s e o r d e r
(see p r o o f o f t h e Sum Theorem 1.4.1). n a l on
I1,2)
F
x
F
by
D e f i n e a monotone s u b l i n e a r f u n c t i o -
F.
Linear Functionals
106
G
Now c o n s i d e r t h e subcone
= I(ftxgl,
f txg2)
If
E F,
x
2
01
of
F
x
F.
Then because o f t h e d i s t r i b u t i v e l a w ( D e f i n i t i o n 2.4.1 ( i ) ) p i s l i n e a r on G. So, t h e r e i s a monotone l i n e a r v 5 p w i t h (Dominating p I G 5 vIG
.
Extension Theorem 1.3.1).Put
pl(f)
= v(f,O),
u 2 ( f ) = v(O,f),
f u n c t i o n a l s have t h e r e q u i r e d p r o p e r t i e s . 2.4.8
t h e n these
0
Remark:
By u s i n g t h e Norm Theorem i n s t e a d o f t h e Dominating Extension Theorem one
can a v o i d t o use t h e d i s t r i b u t i v e law f o r t h e f o l 1owing weaker r e s u l t: Let
be an ordered cone such t h a t e v e r y two elements have a
(F,< )
supremum, Then f o r f i x e d u1,p2
2.5
)*
E (F,<
)=1+ !
+
(F, < ) . I n t h i s case one g e t s
with
p E
v1
t
(F, < ) *
u2
5
and
g1,g2 E F t h e r e a r e
u such t h a t u(sup(g1,g2))
=
492)
RIESZ PROPERTY AND FINITE SUM PROPERTY
I n a cone F we c o n s i d e r some s p e c i a l o r d e r r e l a t i o n s which a r e canonic a l l y a s s o c i a t e d w i t h subcones G o f F. 2.5.1 Let
Definition: G
be a subcone o f
F.
( i ) The o r d e r r e l a t i o n given, f o r a r b i t r a r y fl
i s called
fl,f2 E F
< f2 i f f there i s a g E G w i t h
t h e G- o r d e r (sometimes denoted by <
, by f 2 t g = fl
,
).
A f u n c t i o n a l which i s monotone w i t h r e s p e c t t o t h i s o r d e r i s s a i d t o be G- monotone. A f u n c t i o n a l which i s monotone w i t h r e s p e c t t o t h e i n v e r s e o r d e r i s c a l l e d G- a n t i t o n e . (ii) The o r d e r i n F g i v e n by t h e i n v e r s e o f t h e F- o r d e r i s c a l l e d t h e n a t u r a l p r e o r d e r , i . e . h e r e we have f 1 4 f2 i f f t h e r e i s g E F w i t h fl + g = f2
.
I a7
Order Units and Lattice Cones
( i i i ) We say t h a t G generates F i f for every f E F there i s some g E G such t h a t f + g E G ( i v ) A preordered cone ( F , < ) i s said t o be negatively generated i f i t i s generated by F- = If E F I f < 01 .
.
We hope that the following remarks will c l a r i f y the role of the notions we have defined so f a r . All the remarks are immediate consequences of Definition 2.5.1 2.5.2
Remarks :
( i ) Let ( E , < ) be some preordered vector space. Then E i s endowed with the E- - order, where E- i s the negative cone E- = If E Elf < 01. The positive cone E+ = {f E Elf > 01 of E i s always equipped with i t s natural order. E- (or equivalently E + ) generates E i f and only i f E = E+ + E- , or, in other words ,if E i s negatively qenerated. ( i i ) In the general case, a linear functional i f and only i f p ( g ) I 0 for a l l g E G.
u
on
F
is
G- monotone
( i i i ) Every order unit cone i s negatively generated. ( i v ) Of course, f o r any subcone cone.
G of
F
,
(F,
i s a preordered
The following notions are important for the investigation of l a t t i c e structures in dual cones. 2.5.3
Definition:
( i ) A cone F i s said t o have the f i n i t e sum property (FSP in short) i f for a l l f l , f 2 , g 1 , g 2 E F with f l + f 2 = g1 + g2 there are ~~
h i k E F , i,k
=
1,2;
such t h a t
fi = h i l
+ h i 2 , g.1
=
h l i + h 2 i y i = 1,2.
( i i ) A preordered cone ( F , < ) i s said t o have the Riesz property i f f o r f , g , h E F with f < g + h there are always g,lh E F with < g , i< h such that f = + h
.
The next theorem shows t h a t these properties are closely related. Recall, a cone F s a t i s f i e s the cancellation law i f f f l + g = f 2 + g implies f l = f 2 for a l l fl,f2,g E F .
Linear Functionals
108
2.5.4 __ Let
Theorem:
<_ be _ t h_ e n_ a t_ u r a_ l preorder
&I
F
(i)
Lf
(ii)
L e t t h e c a n c e l l a t i o n --law hold i n --
t h e n ( F y < ) has t h e Riesz p r o p e r t y . F. Then (F, < ) --has t h e Riesz
F -has t h e FSP
_.--
p r o p e r t y i f and o n l y i f -_.--
F _ has _ -t h e
FSP
.
Proof: (i) f
?
g2 means t h a t t h e r e i s an
t
( D e f i n i t i o n 2.5.1). h21 t h22 = g2
The FSP g i v e s us
and
i n particular that
hll hll<
t
h21 = f
?.
f t
E F such t h a t
. But t h e f i r s t
h21 < g2
and
g1
hik
E F with
= g1 t g2
hll
t
h12 = g l Y
two e q u a l i t i e s i m p l y
( i n the natural preorder !).
( i i ) We have t o prove t h a t under t h e c a n c e l l a t i o n l a w t h e Riesz p r o p e r t y f o r the natural order implies the This gives with
hll
FSP
fl t f2 = g1
+
f l < g1 t g2 and from t h e Riesz p r o p e r t y we o b t a i n t h12 = fl
such t h a t
hll
< g1
t i o n of t h e n a t u r a l p r e o r d e r t h e r e a r e and
. Consider
h12 t g22 = g2
. I t remains
and
hyli
t o show t h a t
we i n t r o d u c e t h e e q u a l i t i e s from above i n t o fl t f2 = hll
t
h12
4
h22 w i t h
. By t h e
g2
hll
92'
yhll
h12 defini-
t h21 = g1
f 2 = h21 t h22
. To
fl t f 2 = g1 t g2
do t h i s
and g e t
h21 t h12 t h22 = fl t h21 t h22
A p p l i c a t i o n of t h e c a n c e l l a t i o n l a w y i e l d s t h e a s s e r t i o n .
0
Although t h e
FSP was o n l y d e f i n e d f o r sums w i t h two terms i t e a s i l y c a r r i e s over t o a r b i t r a r y f i n i t e sums: 2.5.5
Lemma:
Suppose t h a t --
F -has t h e FSP
k = ly...yn,
with
m
z fi
- i=l
and c o n s i d e r
_ .
n
=
E
k=l
gk
fi,gk
. Then t h e r e
E F, i=l,...,my are
hik
E F with
109
Order Units and Lattice Cones
and
Proof: We use i n d u c t i o n over Hence, s i n c e
ntm
F has t h e
.
FSP
The a s s e r t i o n i s t r i v i a l i f
,
the assertion holds i f
Then assume, t h e lemma i s proved f o r a l l n a t u r a l number Now, l e t
no 2 4
ntm = notl
o u t l o s s of g e n e r a l i t y f l y
-..fm,2y( f m - l + f m ) ,
k = l,..., n ; wl,...,wn (1)
f. =
(3)
gk =
'
. . Hence
m
or
n
n,m
. This
91, ...,gn
yields
,
'
hi,k "k
,k
Since we assumed
; i = Iy...,m-2;
hi,k
m > 2
we have
2
t
i = l,...,m-2
.
= l,...,n
n < mtn = n
0
t
1
. Therefore
a p p l y t h e h y p o t h e s i s a g a i n t o ( 2 ) . T h i s p r o v i d e s us w i t h such t h a t hiYk; i = m - 1 , m ; k = l,...,n;
Inserting (5) i n (3) yields
izl
m
(6)
gk =
f o r some
with hi,k
i=1
0
m > 2 . Apply t h e i n d u c t i o n h y p o t h e s i s t o
n
m-2
m=l
n t m 5 4.
nt m s n
with
or
i s g r e a t e r t h a n 2. Assume w i t h -
r
k=l
n = l
hi,k
, k
= l,...,n
.
we may
.
Linear Functionals
110
Now, ( l ) , ( 4 ) and ( 6 ) show t h a t t h e a s s e r t i o n i s t r u e i f T h i s proves Lemma 2.5.5.
ntm = notl. 0
The r e a l importance o f t h e o f t h e upper
-
FSP
l i e s i n i t s consequences f o r t h e s t r u c t u r e
and l o w e r envelopes.
2.5.6 Theorem: L e t F -have t h e FSP. -
rf
(i)
(F, < )
has t h e Riesz ---
property -then f o r
q E (F, < )
t h e lower
# --
i s l i n e a r i f and o n l y i f q v ( 0 ) + - m . -----( i i ) I f f o r the inverse preorder < ' o f < -t h e cone (F, < ' ) -has t h e Riesz p r o p e r t y -t h e n f o r p E (F, < )# t h e upper envelope ph -~ i s linear i---f and o n l y i f ph ----does n o t a t t a i n t h e v a l u e + m . envelope
qv
_.-
Proof: (i)
P r o p o s i t i o n 2.4.4
qv(0)
*
-m
t e l l s us t h a t
. We c l a i m t h a t qV(fltf2)
2
i s s u b l i n e a r i f and o n l y i f FSP and Riesz p r o p e r t y t o g e t h e r i m p l y t h a t
qv(fl)
t
T h i s t h e n c l e a r l y proves t h a t qv To see t h i s we c o n s i d e r a r b i t r a r y fl
t
f 2 < hl
hl < h l,...,hn
t...t
qv
qv(f2)
for a l l
E F
flyf2
.
i s not only sublinear but linear. hl,...,hn
E F
such t h a t
hn. Then from t h e Riesz p r o p e r t y ( i n d u c t i o n ) we 9 e t
such t h a t
fl
t
f 2 = hl
t...t
.
And t h e
k=l,
...,n )
FSP
(in
t h e s t r o n g e r form o f Lemma 2.5.5)
yields
Now, t a k i n g i n t o account t h a t t h e d e f i n i t i o n o f qv :
i s monotone and s u p e r l i n e a r we g e t w i t h
q
h . (i=1,2; 1, k n
hn
with
111
Order Units and Lattice Cones
Taking t h e infimum o v e r a l l p o s s i b l e qV(f1+f2) 2 qV(fl) (ii)
+
we o b t a i n i n f a c t
hly...,hn
qV(f2).
Again P r o p o s i t i o n 2.4.4 t e l l s us t h a t
i s s u p e r l i n e a r i f and
ph
o n l y i f ph does n o t a t t a i n t h e v a l u e t m . The p r o o f t h a t i n t h i s case t h e f u n c t i o n a l i s a l s o s u b l i n e a r i s i n complete analogy t o ( i ) . L e t flyf2 be a r b i t r a r y and c o n s i d e r fl
t
f2 r
g i v e s us
hl +...+
E F
such t h a t
Then t h e Riesz p r o p e r t y f o r t h e i n v e r s e o r d e r i n g
hny
hl > hly...,h
hly...,hn
n
> hn
such t h a t
fl
f2 = hl +...+
t
hn
.
Then
w i t h t h e same p r o p e r t i e s as above. And b y ,k monotony and s u b l i n e a r i t y we f i n d :
with the
FSP we g e t
n
h
n
n
n
NOW, t a k i n g t h e supremum o v e r a l l p o s s i b l e hl,...,h inequality
p"(fl
+f2)
I ph(fl)
i.
n
we g e t t h e d e s i r e d
ph(f2). 0
T h i s r e s u l t immediately y i e l d s an i n t e r p o s i t i o n theorem which appears i n v a r i o u s forms i n t h e l i t e r a t u r e (Ando [ 6 I, A s i m o v - E l l i s [111, Edwards [971, see a l s o 11161 and [431)
2.5.7
.
I n t e r p o s i t i o n Theorem:
L e t F -have t h e FSP and assume ~ t h a t F --has t h e Riesz p r o e r t y e i t h e r w i t h -r e s p e c t t o i --o r i t s i n v e r s e i ' . -Then f o r p E ( * a 7 _ .
q E (F, < ) # $ t J p I q ---t h e r e i s always a
u
E (F,<
)*
-such t h a t
Linear Functionals
112
Proof: L e t us assume t h a t
(F, < )
{b
E (F, < )# I I q } i s qv (Theorem 2.4.5 ( i ) ) . Hence LI = qv does t h e j o b . p e r t y one can work w i t h ph same arguments go through. set
p
has t h e Riesz p r o p e r t y . Because i s n o t empty and i t s
(i)
(F, < ' )
I n case t h a t
and Theorems 2.4.5
q
the
)#- supremum
(F,<
B u t a c c o r d i n g t o 2.5.6
5
i s linear.
qv
has t h e Riesz pro-
( i i ) , 2.5.6
( i i ) . Then t h e
(F, < ) * has almost
The r e a l c o n t e n t o f t h e I n t e r p o s i t i o n Theorem i s t h a t
t h e s t r u c t u r e o f a complete s e m i l a t t i c e . More p r e c i s e l y : 2.5.8 Theorem: Let (i)
F -have t h e FSP. (F,< ) --has t h e Riesz p r o p e r t y -----t h e n every l o w e r bounded subset o f
If
#or---
T h i s infimum remains t h e same i f we (F, < )* has an infimum~ i n (F,<-)*. -t a k e i t i n e i t h e r o f t h e f o l l o w i n g cones: F*, (F, < ) -
-_____--
(ii) I f F has t h e Riesz p r o p e r t y ----w i t h respect t o the inverse preorder < ' (F, 4 ) * has 5 supremum & then every upper bounded subset o f --(F, < )*. T h i s supremum remains the same i f we take it in either of the ~
f o l l o w i n g cones:
F*,
(F, < ) # o r F#
.
I
Proof:
)*. We d e f i n e a monotone s u p e r l i n e a r cp by cp(f) = i n f I p ( f ) I u E A 1 f o r a l l f E F. L e t cpv be t h e l o w e r envelope o f cp w i t h r e s p e c t t o (F, ). Since A was (i)
Let
A
be a l o w e r bounded s e t i n
(F,<
*
l o w e r bounded cpv property f o r
4
equal :
i s s u b l i n e a r ( P r o p o s i t i o n 2.4.4). implies that f o r arbitrary
infI
n I: 'P(fk) k=l
jnf{
n E cp(fk) I fl,...,fn k=l
1 fl,...,fn
f
NOW, t h e Riesz
the following infima are
<
E F with
f
E F
f =
with
n
Z
k=l n k=l
fkl =
fkl
-
So, qV i s t h e g r e a t e s t element I cp i n (F, < ) # as w e l l as i n ( P r o p o s i t i o n 2.4.4). O r , i n o t h e r words, cpV i s t h e infimum o f A
F# in
F ~ .
Order Units and Lattice Cones
Since
(p"
i s monotone and l i n e a r (2.5.6
of
in
(F, < )*. T h i s i s an obvious consequence o f
A
(i))
113
i t must a l s o be t h e infimum
(F, < ) * and
t h e same h o l d s f o r a l l cones between
(F, < ) * c F#. And
F#.
( i i ) T h i s i s a g a i n t h e same p r o o f . The o n l y d i f f e r e n c e i s t h a t one has t o
c o n s i d e r u ( f ) = s u p t p ( f ) I p E A 1 and uA i n s t e a d . Then as above, a p p l i c a t i o n of 2.5.6 (ii) yields the assertion. 0
2.6
THE POSITIVE DUAL CONE
F i r s t , we d i s c u s s t h e r e s u l t s o f t h e l a s t s e c t i o n i n a more c o n c r e t e
F the natural preorder <
s i t u a t i o n . We c o n s i d e r i n a g i v e n cone
(F,
denote
i) *
F;
by
=
.
F;
{pip : F
-,R+
T h i s cone we endow w i t h t h e
A c F;
every s u b s e t subset
tpl,...,pnl
FE
Then c l e a r l y linear}
and
i s equal t o
. F
p o i n t w i s e o r d e r on
i s l o w e r bounded, namely by i s upper bounded b y
p1
+...+
. And we 0
, and
pn
remark t h a t every f i n i t e
.
2.6.1 Lemma: L e t F have t h e FSP , then F i e v e r y nonempty
A c FZ
5 complete l a t t i c e cone. And f o r A
t h e infima o f
i n F:
and F# -a r e equal
Proof: F
has t h e Riesz p r o p e r t y w i t h r e s p e c t t o t h e n a t u r a l p r e o r d e r (Theorem
2.5.4
f o l l o w f r o m Theorem 2.5.8 ( i ) F: and t h e u n r e s t r i c t e d d i s t r i b u t i v e l a w i s a m a t t e r o f d i r e c t v e r f i c a t i o n . ( i ) ) . So t h e l a t t i c e p r o p e r t i e s of
NOW, l e t E,
E
= {x E E
*
be a v e c t o r l a t t i c e and c o n s i d e r i t s p o s i t i v e cone i s equipped w i t h t h e n a t u r a l o r d e r , t 01. Then E,
Ix
(E+)n = (E,,s)*,
and t h i s cone can be t r i v i a l l y i d e n t i f i e d w i t h
We denote t h i s cone by O f course,
Eo
E:
and c a l l
ET
- Er
=
Eo
SO
(E,I)*.
t h e o r d e r dual o f
i s endowed w i t h t h e p o i n t w i s e o r d e r on
E+
.
E.
Linear Functionals
114
2.6.2
Lemma:
A c E*t -the infima
E*t i s-a complete ~l a t t i c e cone, -and f o r nonempty
(i)
* i n E, (ii)
(E+)#
are equal.
i s an o r d e r ---
Eo
complete -___ vector l a t t i c e .
Proof: ( i ) Consider a r b i t r a r y 0 I hl I h and
Then E,
f,g,h 0 I f
E E,
- hl
with 9 g.
f I gth.
And because
Take
hl = sup(f-g,0).
f = (f
-
hl) t h l
f u r t h e r t e l l s us t h a t
must have t h e Riesz p r o p e r t y . Theorem 2.5.4
E,
has t h e
FSP. NOW, e v e r y t h i n g f o l l o w s from 2.6.1.
( i i ) Let
A c Eo be a l o w e r bounded s e t w i t h l o w e r bound b. Hence Take t h e i n f i b2 where bl,b2 E ET Therefore, b2 t A c E:
b = bl mum o f of
A
2.6.3
.
.
-
b2 in
+A EO.
in
, inf(b2
E:
t
-
A). i n f ( b 2 t A)
b2
i s t h e n t h e infimum
0
Remark:
T h i s lemma shows t h a t a c t u a l l y many o f t h e p o p u l a r spaces a r e o r d e r comp l e t e v e c t o r l a t t i c e s . F o r example the appropriate
Lq(p) (p-' t q-'
signed Bore1 measures on a compact bidual o f
qR(K)
Lp(v) = 1)
, or
(1 < p I m ) as o r d e r d u a l s o f Y R ( K ) , t h e space o f f i n i t e
K (as o r d e r dual of
(as t h e o r d e r dual o f
YR(K)).
k(K)),o r
the
One consequence o f these
c o n s i d e r a t i o n s i s , t h a t f o r s p e c i a l l a t t i c e cones (namely t h e p o s i t i v e cones o f v e c t o r l a t t i c e s ) t h e dual cone always has t h e
FSP and t h e Riesz
p r o p e r t y . One may ask if t h i s remains t r u e f o r general l a t t i c e cones. To f i n d t h e answer t o t h i s problem we have t o make a d e t o u r i n t o elementary a1 gebra. L e t us f i r s t r e c a l l how t o make a v e c t o r space T h i s i s done by an elementary procedure. Take (al,bl), f o r some
(a2,b2) E F
x
F
x
F.
F and d e f i n e two p o i n t s
al t b 2 + c = a t bl t c 2 t h e corresponding e q u i v a l e n c e c l a s s .
t o be e q u i v a l e n t i f
c E F. Denote by [al,bll
( F - F) o u t o f a cone F
Order Units and Lattice Cones
115
Consider i n
(F
- F)
=
def
I
I[a,bl
(a,b) E F
x
FI
the f o l l o w i n g class operations: x[a,bl
-
(F
Then
F)
seen t o be
. If
[b,al
(F
-
F)+
x,y E ( F
for
x
E R+
becomes a vectorspace. The n e g a t i v e o f
=
de f
-
<)
(F,
canonically a preorder i n
i.e.
xbl ,
= [xa, def
i s easily
i s a p r e o r d e r e d cone t h e n we d e f i n e
( F - F) I[a,bl
[a,bl
v i a t h e f o l l o w i n g p o s i t i v e cone
I a,b
E
F, b < a 1 ,
F ) we have x < y
i f and o n l y i f
y
- x
E (F
-
F)+.
F t h e c a n c e l l a t i o n l a w h o l d s F can be c o n s i d e r e d as a subcone o f ( F - F ) . More p r e c i s e l y : a -, [a,Ol i s then an i n j e c t i v e l i n e a r map f r o m F i n t o ( F - F ) . I n t h e general case t h e map I n case t h a t f o r
p
: F
+
(F
-
F)
g i v e n by
P -,
a
[a,O]
i s s t i l l l i n e a r (and monotone),
b u t i t f a i l s t o be i n j e c t i v e s i n c e p ( a ) = p ( a ) whenever t h e r e i s some . B u t t h e i n j e c t i v i t y i s n o t so i m p o r t a n t s i n c e b E F with b + a = b +
a
we have t h e f o l 1owi ng e l ementary
2.6.4
.
Universal Prooertv:
n:F
E be a-l i n e~ a r map - from - F i n t o a v e c t o r space A : ( F - F ) 3 E -such t h a t A p = t h e r e i s a unique l i n e a r (i)
-
L
-
~
_
-$
_
.
_
i s a preordered ~ v e c t o r- space - and_i f
L -
i s monotone t h e n -
L_
A
E ,Then
.If
i s monotone.
Proof: Let
(a1,bl),
f o r some
(a2,b2) E F c E F X(al)
x
F
be a r b i t r a r y w i t h
. Then by l i n e a r i t y o f ;i we - n(bl) = n ( a 2 ) - n ( b 2 ) .
get
al
+
b 2 + c = a 2 + bl+C
E
116
Linear Functionals
Hence,
-
h(a)
( a , b ) E [ a l , b l l . Let us denote
i s constant f o r a l l
i(b)
t h i s constant by A[a,b]. By d e f i n i t i o n A i s l i n e a r s i n c e A i s l i n e a r . The map A i s monotone whenever i s monotone. And we have A * p = A . I t remains t o show t h a t A i s unique. So, l e t A2 : ( F - F ) -+ E be l i n e a r with
Hence,
2.6.5
-
-
A2
p = A
.
Then by l i n e a r i t y
.
A2 = A
n
Lemma:
Let ( F , < ) be 5 preordered
cone.
given by ( F - F) t -i n (i)rf < & antisymmetric then the preorder -(F - F ) i s again antisymmetric. (ii) If F i s a -l a t t~ i c e cone ( F - F) i s a vector e. - then -l a t t i c~ (iii) If F i s negatively generated then ( F - F ) i s negatively generated. Proof: ( i ) One e a s i l y sees t h a t the preorder i n ( F only i f t h e p o s i t i v e cone ( F - F ) + i s sharp, zero whenever x and -x a r e elements of ( F x, -x E ( F - F)+. Then by d e f i n i t i o n t h e r e a r e with
and a 2 < b2
bl < a l
Then because of
x = [al,bll
f o r some c E F. Let
such t h a t x =
=
F ) i s antisymmetric i f and i . e . x must be equal t o - F ) + . So assume al,bl,a2,b2 E Ft
[ a l , b l l , -x
=
[b2,a21
.
we have a t b t c = a2 t b l + c 1 2 We claim a 1 t 6 = b 1 t 6 . The i n e q u a l i t y
[a2’b21
6=altb2tc
.
al t E >bl + E follows immediately from al > b l , and t h e missing p a r t is seen via Now, x =
a 1 t 6 = ( a l t b 2 t c ) t a l = ( a 2 t b l t c ) t a l < b 2 t b l t c t a - b t 6. 1- 1 [a 1’b 1I = [a 1 + 6 , b l t 6 1 = 0 since a 1 + 6 and b l + d a r e equal.
( i i ) Consider a r b i t r a r y
z
x
=
[al,bll, y
= [ s u p ( a l + b 2 , a 2 t b l ) , bl t b 2 1
Abbreviate
c
=
=
[a2,b21. We claim t h a t
i s t h e l e a s t upper bound of
sup(al t b 2 , a2 t b l )
and consider
x,y
i n (F-F).
Order Units and Lattice Cones
z
-
x = [c,bl+b
1 - [a 1, b 11
2
=
This i s clearly an element o f
117
[c + b l y b l + b 2 + a l l = ~[c,b2 + a,]. (F
.
- F)+ since b2 + a l < c
I n the same
way one shows t h a t z - y i s in the positive cone. So, z i s an upper bound of x and y. Let i = [a,D] be another upper bound. Then because z - x E(F - F)+ , we get a + bl > p + a l , and similarly a + b2 z 13 + a2.
.
This gives a + bl + b e > 13 + a l + b 2 and a + bl + b 2 > + a 2 + bl Hence, a + bl + b 2 > sup(B + a l + b 2 , 13 + a 2 + b l ) = 13 + c. And t h i s yields
i-
[c,bl + b21
Hence 2
-
=
[a + bl + b2, 13 + b, + b21 + [ p + bl + b2,c + 131
=
[a + bl + b2,c + 81 E ( F
z E (F
-
F)+
and
z
-
F)+
.
must be the l e a s t upper bound.
( i i i ) Let x = [ a , b l E ( F - F ) . Since F i s negatively generated there Hence, are a-,b- E F- such t h a t a t a- and b + b- are in F-
.
x = [ a + b - + a-
,b +
b- + a-I
=
[a + b - + a - , O l - [ b + b - + a - , O ]
shows that x i s the difference of two elements in ( F valently in ( F - F)+) i . e . ( F - F)- generates F - F.
- F)-
(or equi0
The reader should note t h a t for the proof of part ( i i ) of the l a s t lemma i t was absolutely essential t h a t we required the validity o f the d i s t r i butive law for l a t t i c e cones. One might wonder i f ( F - F) i s always a complete vector l a t t i c e i f (F, < ) i s a complete l a t t i c e cone. Here, the answer i s negative. 2.6.6
Definition
I p(f)
for a l l f E F I denotes the cone consisting o f the R- valued elements in (F, < ) * . FIT i s called the positive dual cone of (F, < ) and, f n o t mentioned otherwise,it i s endowed with i t s natural order. FT
= { p E (F,<
)*
> -
OD
-
Let us compare F: with the positive dual cone ( F - F): of ( F F). I f p : F -,( F - F) i s the canonical ( n o t necessarily injective) embedding
Linear Functionals
118
of
F i n t o (F
element of
-
F:
F) then f o r
.
(F
p E
-
*
F)+
the map vp
= p o p
And t h e Un versa1 Property 2.6.4 implies t h a t
i s an p
-B
and Ff . Furthermore, we remark i s a b i j e c t i v e map between F - F): t h a t by d e f i n i t i o n every l i n e a r b i j e c t i o n between cones i s monotone with respect t o t h e natural preorders. So, we have 2.6.7
Lemma:
are
FT and ( F - F): i d e n t i c a l i n the sense t h a t t h e r e i s a monotone bij-____.-e c t i v e l i n e a r map between them. 2.6.8
Theorem:
Let ( F , < ) be a l a t t i c e cone. Then i t s p o s i t i v e dual cone FT has t h e l a t t i c e cone. FSP --and t h e Riesz property and i t i s a complete ~Proof: In view of t h e above lemma i f s u f f i c e s t o prove t h e theorem f o r ( F - F): instead of Ff In 2.6.5 we s t a t e d t h a t ( F - F) i s a vector l a t t i c e . 0 So, everything follows from 2.6.2 ( i ) .
.
2.7
2.7.1
DUAL ORDERS AND THE CARTIER
-
FELL - MEYER THEOREM
Definition:
Let F be a cone and l e t @ be a subset of F*. ( i ) For f , g E F we w r i t e f s @ g i f p ( f ) I u ( g ) This preorder i s c a l l e d t h e ( i i ) For f , g E F we w r i t e
f =
n z fi (fi
i =1 for all p E i s called the (F,
)
E F,
n
E N)
@-
p E @
.
pointwise order. g i f f o r every decomposition
f <
@
t h e r e a r e gi
, we have p ( f i ) 0-
for all
I
p(gi),
with i
=
g
=
l,...,n.
n
E gi i =1
such t h a t ,
The preorder
<
decomposition preorder.
i s always a preordered cone. In c o n t r a s t t o t h i s the r e l a t i o n
in general i s not compatible w i t h the cone operations.
Order Units and Lattice Cones
2.7.2
119
Lemma:
L e t F -have t h e FSP , t h e n (F, < @ ) -i _ s a preordered cone, i . e . the Q- decomposition -o r d e r i s c o m p a t i b l e --w i t h t h e cone o p e r a t i o n s . Proof: Only t h e c o m p a t i b i l i t y of assume
< @g1
fl
n
Because
Y
k,
.
i=l1
hi,kE
p(hi
-
f.
Z
fl+ f2
and
f2 <
The
@
FSP
such t h a t
fk
we get
hi,k
with
p E @
. NOW,
gk
Y
k,
gi(i=l,...,n)
for all
fi =
n hYil
91
Recall t h a t i f
92'
+
F
+ hiY2
n 1 hiYk=
i=1 put
g1
and
gk
ii= hiyl
i s t h e d e s i r e d decomposition f o r
<@
i s n o n t r i v i a l . So,
(Lemma 2.5.5) y i e l d s
k=1,2)
<@
F
g2 and c o n s i d e r a decomposition
i=l,...,n;
Ip(hi
fl+ f2
with addition i n
+
, i.e.
o
vQ
+
hi?.
g2.
Let
Then
Hence,
has t h e
FSP
then i n
F*= (F,=)*
t h e supremum o f
(F,=)*).
t h e Riesz p r o p e r t y
S o y i n t h i s case, f o r
@ c
F*
,let
t h e s e t o f a l l suprema o f upper bounded f i n i t e subsets
= {sup(ul
,... ),,I.?,
1nE
upper bounded E @ I .
N, p l y . ..,un
Propos it i on :
2.7.3 _ .
V Q
F -have t h e FSP and c o n s i d e r
f s V Qg
,
i.e.
p ( f ) Iu ( g )
f,g E F with f <
for all --
g
1-1 E V Q .
.Then
Proof: From Theorem 2.5.8 sup(p1,...,pn)(h)
hi,k.
CI
is trivially fulfilled for us denote b y
i=1
such t h a t
upper bounded subsets does always e x i s t (Theorem 2.5.8,
of
fk =
( i i ) and C o r o l l a r y 2.4.6 = supt
f o r any upper bounded s e t
n E pi(hi) i=1
{ul,..
(ii) we o b t a i n
I hly...,hn
. ,pn}
c @
E F with
.
n h = z hi] i=1
120
Linear Functionah
Looking i n t e n s i v e l y a t t h i s e x p r e s s i o n one immediately d i s c o v e r s sup(p l,...,pn)(f) 2.7.4
5 sup(p1,...,un)(g)
whenever
9.
f
0
Proposition:
with L e t F have t h e FSP and assume t h a t i t has t h e Riesz p r o p e r t y r e s p e c t t o t h e i n v e r s e o f s @ . Consider f , g E F w i t h f s a g. Then -
%
f
g.
Proof: I f f s @ g and
f =
n
t h e n g (<@)If; t h e Riesz p r o p e r t y t o g e t h e r
1 fi
i=1
w i t h i n d u c t i o n t e l l us t h a t t h e r e a r e gi Hence,
g.
f
('@)Ifi
such t h a t
g =
n 1 qii'
i=1
0
2.7.5 Theorem: Let -
FSP ---___-and assume t h a t i t has t h e Riesz p r o p e r t y with
F -have t h e
r e s p e c t ---t o the inverse o f
svo . Then t h e p r e o r d e r s <
@
.nd
sVQ
are
t h e same. -Proof:
P r o p o s i t i o n 2.7.3 y i e l d s t h a t (applied t o V @ instead o f But
f
g
f Q)
clearly implies
s
v@g when
gives f
f <
~
g. And P r o p o s i t i o n 2.7.4
f < v@ g when
f
s v@ g.
0
On t h e f i r s t view t h e assumptions i n Theorem 2.7.5 seem t o be r a t h e r o u t l a n d i s h , b u t we w i l l see t h a t t h e y a r e n a t u r a l l y f u l f i l l e d f o r t h e p o s i t i v e dual cone o f a l a t t i c e cone. We want t o extend t h e n o t i o n o f l a t t i c e homomorphism we i n t r o d u c e d i n 2.2. Consider a l i n e a r
@
: F
+
G
, where
(F, < )
i s a l a t t i c e cone and
) i s some o r d e r e d cone. @ i s c a l l e d a l a t t i c e cone homomorphism ( o r s i m p l y l a t t i c e homomorphism) i f @ ( F ) = { @ ( f ) I f E F I
(G,
4
Order Units and Lattice Cones
121
i s a l a t t i c e cone such t h a t o(sup(fl,f2))
= sup(@(fl),
cp(f2))
for a l l
E F.
fl,f2
@-'
o i s c a l l e d a l a t t i c e cone isomorphism o r l a t t i c e isomorphism i f b i j e c t i v e and cp and a r e l a t t i c e cone homomorphisms.
o
is
Note, t h a t e v e r y l a t t i c e homomorphism i s n e c e s s a r i l y monotone. Let
(F, < )
be a l a t t i c e cone and c o n s i d e r
t h e p o s i t i v e dual cone (Theorem 2.6.8). subsets o f
(Ff)*
(FT)*, t h e l i n e a r f u n c t i o n a l s o n
(F, < ) . R e c a l l t h a t
FT o f
Hence ( b y Theorem 2.5.8.)
^f
FSP
t h e supremum of upper bounded -+
3
from
F into
FT
.
(Ff)*,
i s d e f i n e d by P(p)
2.7.6
has t h e
does e x i s t w i t h r e s p e c t t o p o i n t w i s e o r d e r on
Now, we c o n s i d e r t h e c a n o n i c a l l y g i v e n map f where
Ff
for all
= p(f)
E F:
.
Theorem:
The map f --
+
3 --i s a lattice
homomorphism.
Proof:
f
It i s q u i t e c l e a r t h a t
t o be an upper bound o f yields for arbitrary
7
i s monotone and l i n e a r . So, s u m has {?,GI. Hence, s u m 2 sup(i?,'j). Theorem 2.4.7 +
II E Ff :
The l a s t i n e q u a l i t y f o l l o w s f r o m C o r o l l a r y 2.4.6 and Theorem 2.5.8 Hence, s m = sup(?,G) f o r a r b i t r a r y f , g E F. 0 Combining t h i s w i t h Theorem 2.7.5
2.7.7 Let -
General C a r t i e r
_-----
-
Fell
-
(ii).
we g e t : Meyer Theorem:
F be a l a t t i c e cone and l e t
@ c
F be such t h a t
V@ = F. Then, for
122
Linear Functianals
, the following a r e equivalent:
v , v E F:
(i)
v
(ii)
p ( f ) s v ( f ) -f o r a l l f E F.
v
Proof:
W e know t h a t Ff has t h e FSP with respect t o t h e inverse of sider
,, (sF)I
v1
+
v2,
. We
claim t h a t FT has t h e Riesz property To prove t h i s claim we conI v~ = s
.
i.e.
( - p ) ( f ) s ( - vl) ( f )
-t
( - v2) ( f ) f o r a l l
Now consider t h e inverse order
i n F , then
f E F.
- p , -v1,-u2
E (F,
Since (F,< ) i s a l a t t i c e cone t h e cone (F,< I ) must have t h e SIP ( c f . chapter 1 . 4 ) . Hence (1.4.2 and 1 . 4 . 1 ) we f i n d .( '-monotone l i n e a r functionals 3l s - v l , S2 s -v2 such t h a t - p = S1 -t v2 -
.
Put p1
pl =
-Gl,
p2 =
-G2
then
( s F ) # ul, ,,2 ( s F ) l v2. Since
that
FT
p1,v2
E (F,<
u,vl,v2
)* w i t h
p
= pl
+
p2
and
were a r b i t r a r y chosen t h i s shows
has the Riesz property with respect t o t h e inverse of
s
F '
Now, application of Theorem 2.7.5 t o t h e ( n o t necessarily i n j e c t i v e ) embedding o f Q and F i n t o F: gives t h e a s s e r t i o n of t h e theorem.
2.8
FREE LATTICE CONES
Throughout t h e l a s t chapters we have seen t h a t l a t t i c e cones do have a very r i c h mathematical s t r u c t u r e . So, the question a r i s e s whether every cone can be canonically embedded i n t o a s u i t a b l e l a t t i c e cone. 2.8.1
Definition
Let (F,< ) be a preordered cone. A l a t t i c e cone (G, < ) i s c a l l e d a f r e e l a t t i c e cone over (F, < ) i f t h e r e i s a monotone l i n e a r map j : F -, G such t h a t f o r every monotone l i n e a r map 6 : F -, L i n t o a l a t t i c e cone L t h e r e e x i s t s uniquely a l a t t i c e cone homomorphism 6*:G+
Order Units and Lattice Cones
with
123
6 = 6*0 j . In other words the diagram
can a1ways be completed t o j F-----I>G
L where
! means t h a t
i s uniquely determined.
6*
Here we have used the following notation: monotone 1 i near
_____L)
D
l a t t i c e cone homomorphism.
Of course, these diagrams are always assumed t o be commutative.
For convenience we sometimes write in the following f v g instead of sup(f,g), and we recall t h a t a l a t t i c e cone homomorphism 6* : G -+ L s a linear map with 6*(gl v g2) = 6*(g1) v 6 * ( g 2 ) for a l l g1,g2 E G
.
Before going any further into the details we 1 i ke t o adopt the follow notation :
-*
_____+
,
-
w
b
monotone sub1 inear monotone surjective sublinear or 1 i near, resp. i njecti ve l a t t i c e cone subhomomorphism,
124
Linear Functionals
where a l a t t i c e cone subhomomorphism rp between two l a t t i c e cones and ( L , < ) i s a map which s a t i s f i e s : cp(lg)=
m ( d Y (P(s1
f
92) < (P(91)
(P(SUP(91Y92)) = SUP((P(91)YV(92))
We use the symbol
>
a
f
and
(P(@
for a l l
(G$)
9Y91’92 E G ; A E R,
*
9 for a l a t t i c e cone isomorphism.
Before going into the construction of the free l a t t i c e cone, l e t us play the usual game. 2.8.2
Proposition:
( i ) ---Free l a t t i c e cones over (F, < ) are uniquely determined up t o l-a t t i c e cone isomorphisms. ( i i )& j ( G , j ) ( j the embedding F + G ) --__--be a free l a t t i c e cone over (F, < ) . Then a l l elements of G ---are of the form j ( f l ) v v j(fn),
...
with
n
E N,
fl,
...,f n E
F.
Proof: ( i ) Let (G,j) be a free l a t t i c e cone over I : G + G then completes the diagram
(F, < ) . The identity map
Because o f the uniqueness of this completion we conclude that I i s the only l a t t i c e cone homomorphism G + G with j = 1 0 j . Now, consider two free l a t t i c e cones ( G l , j l ) and ( G 2 , j 2 ) over ( F , < ) . Then look a t the diagrams jl j2
125
Order Units and Lattice Cones
and observe that
J1
3, = I
morphi sms
.
I G2
( i i ) Let
=
j,
...v
{j(fl)v
, sup(gl,g,)
E
i).
E Pi,
are l a t t i c e cone
j;
and
jf
j(fn)I n
(i.e.
G
= j;
j, = J,
and
, which implies t h a t
sub-lattice cone of g1,g2 E 7;
0
J,
and
j,
j , = J1
homomorphisms with and
*
= jy
0
j;
j,
.
Hence,
J
- I
1-
I+
are l a t t i c e cone iso-
fl,...,fn
E
FI , then
-
G
is a
G i s a subcone of G and for every Look a t the following diagram
Then according t o Definition 2.8.1 j * and 6* are uniquely determined. Replacing 6* by I makes the same diagram commutative, hence 6* = I . This proves t h a t I o j * = I , or G = G. 0 I
NOW, l e t us construct the free l a t t i c e cone f o r a given cone (F, < ). Recall that a s e t A c F i s called convex i f x f + (1-X)g E A whenever f,g E A and 0 I A I 1. For a given s e t B , the smallest convex s e t containing B i s denoted by < B > and i s called the convex hull of B . For a f i n i t e s e t I f l , ...,f n I c F the convex hull i s given by
--
n {
i =1
hi f i
I x1
2 0
,...,A n
2 0,
I n example 1.2.2(v) we have seen t h a t C o n v ( F ) = I A l A convex,
@
* A c FI
i s a cone i f one defines A+B=Ia+blaEA,bEBI A A = {xal a E A I
n
r xi i =1
=
11
.
126
Linear Functionals
I t i s r e l a t i v e l y t r i v i a l t o see t h a t
Convo(F) = { A i s a subcone o f We w r i t e a
ib.
A < B
IA
Conv(F). NOW, we endow t h i s cone w i t h a p r e o r d e r r e l a t i o n .
B
i
t h e r e i s some
b E B
such t h a t
i s t h e n a preordered cone under t h i s p r e o r d e r r e l a t i o n .
We c o n s i d e r two elements
<
a E A
i f f o r every
Convo(F)
A < B and
i s t h e convex h u l l o f a f i n i t e s e t }
A
E Conv(F),
A
.
A, B E Convo(F)
t o be e q u i v a l e n t
(A
- B)
[ A 1 we denote t h e equivalence c l a s s o f A .
By
-
if
Since
was c o m p a t i b l e w i t h t h e cone o p e r a t i o n s i t t u r n s o u t t h a t a d d i t i o n
and R,-
m u l t i p l i c a t i o n a r e class operations, i . e . i f
A2
then
N
B2
for all
A1,
A1
x2
2 0
B1
and
I
< i s a c l a s s o r d e r i n g , i . e . A < B i f and o n l y i f r\ 4 B f o r a l l r\ E [ A ] and B E [ B l . P u t t i n g a l l t h i s i n f o r m a t i o n t o g e t h e r we o b t a i n t h a t t h e q u o t i e n t o f (Convo(F), < ) w i t h r e s p e c t t o i s an ordered cone. To be more p r e c i s e , Moreover
-
L F = {[A]
1A
E Convo(F)l
i s a cone i f we d e f i n e
and
5
g i v e n by
[A1 5 [ B l
if
A< B
i s an o r d e r r e l a t i o n which i s c o m p a t i b l e w i t h t h e cone s t r u c t u r e . If n o t o t h e r w i s e mentioned
L F w i l l always be endowed w i t h t h i s p a r t i c a l u a r
order r e l a t i o n . It i s c l e a r t h a t
[A1 v [ B l
= [<
A
u
LF
B >] ,
i s a l a t t i c e cone, s i n c e
Order Units and Lattice Cones
The map
F 3 f
[Cfll
-,
We denote t h i s map by 2.8.3 Let
F
i s a monotone l i n e a r map from
L and i n s t e a d o f
[ I f } ] we w r i t e
into
LF
.
*f.
Lemma: be a l a t t i c e cone and l e t
G
_ .
127
TI
: F
-,
G
_be_a
monotone s u b l i n e a r map.
Then t h e r e i s a u n i q u e l y determined -l a t t i c e cone subhomomorphism ---L F -+ G w i t h TI* o L = T I . -For every [A1 E L F _ we -have rr*[Al
=
Ia
sup{n(a)
from -
TI*
E A}.
Proof:
A E [ A 1 and d e f i n e
Pick
n*[Al = s u p ( n ( A ) ) . Then
sup(n(A))
T I * [ A I i s unambiguously d e f i n e d . To see t h i s we t a k e a b E B
that for
t h e r e i s an
a E A
with
b
, and
i s t h e convex h u l l o f a f i n i t e number o f elements by monotony o f TI t h a t TI(b ) Hence s u p ( n ( A ) ) = s u p ( n ( B ) ) .
I sup(n(al),.
IT* i s a l a t t i c e cone subhomomorphism w i t h
L
. Then
T o
t
> E [A]. This implies
= TI
[A]
T[AI
Hence, SO,
T
=
TI*,
=
for
=
[A] E L F a E a1
sup{*a
suplT(*a)
and
TI*
Ia
>
we g e t
= sup n(A).
= TI
NOW, c o n s i d e r a second l a t t i c e cone subhomomorphism < a
A =
since
a = l a l,...,anl
. . ,n(an)) n*o
e x i s t s and
B E [ A ] and r e c a l l
. : LF
T
we f i n d a f i n i t e s e t
-,
a c F
G with
with
.
E a} = s u p l n ( a )
1a
i s unique.
E a1
=
n*[Al
.
0
S p e c i a l i z i n g t h i s t o monotone l i n e a r maps we o b t a i n :
2.8.4 (LF,L)
Consequence: i s a f r e e l a t t i c e cone o v e r
(F, < ).
To a v o i d an abundance o f n o t a t i o n we w r i t e t a c i t l y assume t h a t by t h e map L
.
L F instead o f
( L F , L ) and we
F i s ( n o t n e c e s s a r i l y i n j e c t i v e l y ) embedded i n L F
Another consequence of 2.8.3 F
i s t h a t f o r a l a t t i c e cone
L
---I)LF
b
G
t h e diagram
Linear Functionals
128
can be uniquely completed t o
F
D -
e LF
G
Let us add: 2.8.5 Remark:
( i ) I f I i s an order u n i t of ( F , < ) then *I i s an order u n i t of L F . ( i i ) I f ( F , < ) i s negatively generated then L F i s negatively generated. Proof: ( i ) I t i s obvious t h a t *I i s s t r i c t l y p o s i t i v e . Let [ A ] E L F and pick Then t h e r e a r e a f i n i t e set I f l , ...,f n ) = a c F such t h a t < a > E [ A ]
.
x1 ,... , A n
(by d e f i n i t i o n )
Put 6
=
n
then
t hi,
i =1
2 0
such t h a t
fi < hi I , i=l,...,n.
f i < 6 1 , i = I , ...,n . Hence,
( i i ) Again f o r an a r b i t r a r y
[A] E L F
take a f i n i t e s e t a
=
{fl,...,fn)
i n F such t h a t [ < a > ] = [ A ] . Since F i s negatively generated t h e r e a r e g l , . . .,gn < 0 such t h a t gi t f i < 0, i = l , . . . , n .
Put g
n
gi i =1 This shows t h a t = E,
Y
then g LF
t fi < 0
f o r i = l ,...,n.
i s negatively generated.
Hence *g t [ A 1 5
0
0
A t the end of t h i s s e c t i o n l e t us return t o Lemma 2.8.3. I t s content i s t h a t f o r a l a t t i c e cone G t h e r e i s a uniquely determined map *
.
129
Order Units and Lattice Cones
(mapping
n on n*) f r o m t h e cone o f s u b l i n e a r monotone maps
LF
i n t o t h e cone o f l a t t i c e cone subhomomorphisms
n
n*
=
2.8.6
o
+
F
+
G
such t h a t always
G
1 holds.
Proposition:
The map * i s sublinear. -Proof: For an a r b i t r a r y
[A1
that
[A] E L F
= [].
s u b l i n e a r monotone
a = {fl,
pick a f i n i t e set
...,f n l c F ...,n l
Then we have n*[A1 = s u p I n ( f i )
I
n : F
i s homogeneous.
+
G
. This
*
shows t h a t
i=l,
such
f o r any
Moreover t h i s f o r m u l a y i e l d s :
(n, + n2)* [ A 1
= sup{n,(fi)
t n2(fi)
< sup{n1( f i )
I
= n;
[ A ] + n;
I
...,
i=l, n l
..., .
i=l, n}
[A]
I i=l, ...,nl
+ sup{n2(fi)
Rather u s e f u l i s t h e f o l l o w i n g c r i t e r i o n 2.8.7
Theorem:
be monotone -l i n e a r maps F L e t u1 ,u2 value
(iii)
not -i s _
- m
there i s a ---
+
R
,
i.e.
here
a t t a i n e d . Then t h e f o l l o w i n g
A t 0
such t h a t
u1
=
R
= R
and t h e
I_-
equivalent:
x ( u l + p2)
.
Proof: (iii) + (i)
i s a consequence of t h e f a c t t h a t
(1-A) u l = x u z (i)
=+
(ii):R e c a l l , t h a t f o r
p*(*f
*
i s homogeneous, because
i n view o f ( i i i ) .
v *g) = max(u*(*f),
f,g E F we have i n general u*(*g)) = max(u(f),u(g)).
130
Linear Functionals
Application
t o our special case y i e l d s :
max(ul(f),vl(g))
+
max(v2(f), v 2 ( g ) ) = m a x ( ( q
which has ( i i ) as an immediate consequence. ( i i ) * ( i i i ) : P u t v = u1 t p 2 and assume t h a t v ( f ) and v ( g ) a r e both either
I 0
o r 2 0. Then v ( ) v ( f ) l g ) = v ( \ v ( q ) l f ) , and ( i i ) implies
! q ( l v ( f ) l g ) = q ( I v ( 9 ) l f ) . Hence,
whenever v ( f ) and v ( g ) have t h e same s i g n . I f v ( g ) and v ( f ) have opposite s i g n s , then say v ( f ) . And ( * ) applied t o this case gives
v ( f t g ) has the sign o f ,
Using t h e f a c t t h a t v i s a d d i t i v e , we see t h a t ( * ) is valid f o r a l l f , g E F. I f v = 0 then ( i i ) shows y1 = 0 and ( i i i ) i s t r i v i a l . So assume v(g) 0 f o r some g E F . I f v ( g ) < 0 then by ( i i ) we get pl(g) I 0 , and v ( g ) > 0 implies pl(g) 2 0. In any case
q(9) ~
v(9)
-
x
2 0
. Inserting
t h i s i n ( * ) gives the desired
result. 2.9
SIMPLICIAL CONES
Let (F,< ) and ( G , < ) be s t t i c e cones and denote by A ( G ) and t h e cones of 1 a t t i c e cone homomorphi sms , o r subhomo'morphisms S A (F,G) respectively, from F t o G ; i . e . A ( F , G ) = {u
SA(F,G) =
1 u ~p I
: F
p : F-GI
GI
.
Recall t h a t L denoted t h e canonical embedding o f F i n t o L F . Then we have t h e following remarkable property
Order Units and Lattice Cones
2.9.1
131
Theorem:
There i s a l i n e a r map u : S A ( F , G )
---__.-
S A ( L F ,G)
--f
-with the
following
properties: (i)
~ ( p o) L = p
(ii)
u
for all --
A(F,G)
into
p E SA(F,G) A(LF,G)
Proof: Consider
I* g i v e n by L F
-b
LF
( I
and d e f i n e
~ ( p =) p
o
I*. Then u
I i s t h e i d e n t i t y map from F onto F )
has t h e r e q u i r e d p r o p e r t i e s .
n
This property gives r i s e t o the f o l l o w i n g d e f i n i t i o n : 2.9.2
Def in i t i on:
A preordered cone (F,< ) i s c a l l e d s i m p l i c i a l i f t h e r e i s a l i n e a r map z : FT -+ ( L F ) : from t h e p o s i t i v e dual cone o f F i n t o t h e p o s i t i v e dual cone o f L F such t h a t z ( p ) o L = 11 f o r a l l LI E F: . R e c a l l , t h a t t h e p o s i t i v e dual cone monotone l i n e a r maps from
F
into
F: R
of (not
(F, < )
R),
was t h e cone o f a l l
and t h a t we assumed t h i s
cone t o be endowed w i t h i t s n a t u r a l o r d e r . So, a c t u a l l y , t h e n o t i o n " s i m p l i c i a l " depends on what k i n d o f image space Therefore, i f we have s e v e r a l
R
, we
R we have considered.
speak o f R- s i m p l i c i a l i n s t e a d o f
s i m p l i c i a l . F o r s i m p l i c i a l cones t h e map
z
i s u n i q u e l y determined
( t h e r e f o r e we may c a l l i t t h e s i m p l i c i a l map). T h i s f o l l o w s from t h e
f o l l o w i n g more general r e s u l t : 2.9.3 Theorem: L e t L -be t h e danonical embedding o f (F, < ) i n t o L F and l e t IT : FT (LF): z ( ~ o ) L = i.1 f o r a l l be a l i n e a r map w i t h p E F: -----+
.
132
Linear Functionals
-Then f o r a r b i t r a r y , with
v o
1
=
~3
*
u E F,
for all
cp
we have
E LF
t(p)(cp) =
s u p I ~ ( c p ) I v E (LF)*,
.
Proof: Consider an a r b i t r a r y element and l e t
<
CV E (L F
be t h e supremum o f
Theorem 2.4.7
there are
v~,.,.,v
that ;(*fl
(*)
Put
pi
Put
3,
(*I:
= v
0
i = t(pi).
L
, then
v
... v
)T I
n E (LF);
v
R
0
with
ui(*fi) Vi(*fi)
F
= p l . Accordinq t o v1
+...+ un = V
such
.
= ui(fi)
v1 +...+ un
and
= p . ( f . ) = ;.(*f.) 1
..., fn E
fl,
with
n *f ) = II Vi(*fi) n i=l
we have
Then because
*fn E L F
*flv...v
1
1
1
=
v.
we may r e w r i t e
n
;(*f,
v...v
*f ) = t Gi(*fi) i=l
Here, t h e i n e q u a l i t y was a consequence of t h e monotony
.
t h e l a s t e q u a l i t y came from t h e l i n e a r i t y of II Hence, B u t 3 2 r ( p ) f o l l o w s immediately from t h e d e f i n i t i o n o f Note t h a t , by d e f i n i t i o n , every l i n e a r map from
F:
to
o f the
V
V
iii , and
I t(1.1).
.
(LF):
0
i s mono-
tone w i t h r e s p e c t t o t h e n a t u r a l orders. We want t o show n e x t t h a t f o r a l a r g e c l a s s o f cones ( t h e n e g a t i v e l y generated ones) s i m p l i c i a l i t y i s c o m p l e t e l y c h a r a c t e r i z e d by t h e t h e p o s i t i v e dual cone. A t f i r s t , Theorem 2.9.1 immediately y i e l d s :
2.9.4
Remark:
Every l a t t i c e cone i s s i m p l i c i a l .
FSP o f
133
Order Units and Lattice Cones
2.9.5 Let
_ .
Theorem:
F be n e g a t i v e l y generated --and assume t h a t
has t h e FSP. Then --
Ff
i s simplicial.
F
B e f o r e we proceed t o t h e p r o o f o f t h i s theorem we l i k e t o r e c a l l some f a c t s which a r e h i d d e n i n c h a p t e r 2.6. Consider
@+
= {v
Iv
: Ff
R+ l i n e a r }
+
Ff
those l i n e a r f u n c t i o n a l s on
and
@ = @+-
@+,
t h e cone o f
which a r e d i f f e r e n c e s of p o s i t i v e
functional s. 2.9.6
Remark:
Ff
( i ) If
FSP
has t h e
then
i s an o r d e r complete v e c t o r l a t t i c e
0
( w i t h r e s p e c t t o t h e p o i n t w i s e o r d e r on F f ) . ( i i ) I f F i s n e g a t i v e l y generated t h e n t h e r e i s a monotone l i n e a r map E
:(Fa<)
+ (0,
Ff)
p o i n t w i s e o r d e r on
E(f)(u) = p(f)
for a l l
with
II E Ff,
f E F
.
Proof: ( i ) Lemma 2.6.1 y i e l d s t h a t
i s a complete l a t t i c e cone. NOW, i t i s a
@+
standard procedure (see p r o o f 2.6.2 vector l a t t i c e out o f l o w e r bounded subset
@
. This
A c
where
b
-
b) + b
A.
i s a l o w e r bound o f
( i i ) We know t h a t
Ff = ( F
i s done b y d e f i n i n g t h e infimum f o r a
t o be
@
inf(A) = inf(A
( i i ) ) t o make an o r d e r complete
- F):
(Lemma 2.6.7).
Denote by
cl
the
- F) and d e f i n e c ( f ) t o be FT 3 u + p ( t l ( f ) ) = v ( f ) . Since ( F - F) i s n e g a t i v e l y generated (Lemma 2.6.5 ( i i i ) ) .cl(f) can be w r i t t e n as 'p, - 'p2 where 'p,,'p2 E ( F - F)+.
canonical monotone embedding
F
+
(F
Hence, c ( f ) i s t h e d i f f e r e n c e o f two p o s i t i v e l i n e a r f u n c t i o n a l s , i . e . E maps F i n t o o . 0
Linear Functionals
134
P r o o f o f 2.9.5: Consider
o as i n remark 2.9.6.
t h i s remark and d e f i n e
13 : FT
Let
: F + Q
E
by
+
be t h e map o f p a r t (ii) of
p(p)(cp) = ~ ( p ) ,p E FZ, cp E
a.
Then
(*) NOW, l e t L , +
La
, and
B ( ~ o)
E = p
for a l l
p E
be t h e c a n o n i c a l embedding o f
FT
.
( a , FZ- p o i n t w i s e o r d e r )
c o n s i d e r t h e l a t t i c e cone homomorphism
p :
LF
+
L
given
by t h e fol1 owing diagram
F
D
e LF
a i s a l a t t i c e cone (2.9.6 ( i ) ) t h e r e i s a l i n e a r map : a: + ( L Q): w i t h i ( v ) o La = v f o r a l l v E a: (Theorem 2.9.1).
Since
2
D e f i n e a l i n e a r map 1 : F:
+
(LF);
by
Then
Hence, 2.9.7
F i s simplicial.
0
Theorem:
L e t (F, < )
simplicial.
Then
FT
has t h e
FSP
and
FT
2a
lattice
cone (with respect t o- _ i t s_n a_ t u-r a l o r d e r , -o f course). Proof: We know t h a t
(LF)?
has t h e
FSP and i s a l a t t i c e cone (Theorem 2.6.8).
135
Order Units and Lattice Cones
Let
x
: Ff
( L F):
-,
d e f i n e s a l i n e a r map into
v
be t h e s i m p l i c i a l map. We remark t h a t (LF)f
-,
FT
e
, where
-, v o
i s t h e embedding o f
L
F
LF.
E Ff
NOW, c o n s i d e r a r b i t r a r y
x(il)
Z(vl) + x(p2) =
Then (i,k
= 1,2)
x(u)
o
Since
with
I =
LI
U.
0
ik
l(pi)
( i , k = 1,2) w i t h
+ Z(G2)
and t h e
FSP
gives
= v il + v i 2 3
x(;k)
= vlk
+ V2k
+
pl
vik
p2 =
G1 + i2.
E ( L F ) ~
Because
*
we g e t :
L E Ff , t h i s cone must have t h e FSP.
I t remains t o prove t h a t Ff i s a l a t t i c e cone. Consider a r b i t r a r y pl,p2 E Ff . We c l a i m t h a t a = (x(pl) v x ( p 2 ) ) o L i s t h e l e a s t upper
bound o f
u1
and
t h i s shows t h a t since L
in
p2
Ff
FT
. Since
t h e d i s t r i b u t i v e l a w i s easy t o check
i s a l a t t i c e cone.
a
i s an upper bound o f
i s monotone. Now l e t 1-1 be a second upper bound.
{pl,p2}
Recall t h a t
i s monotone w i t h r e s p e c t t o t h e n a t u r a l o r d e r s s i n c e i t i s l i n e a r . must be an upper bound o f Hence,
~ ( p 2 ) Z(p,)
x ( p l ) , Z(u2).
v x(p2).
Application o f
Hence f o r a n e g a t i v e l y generated cone valent t o the
FSP o f
F:
.
F
L yields
simpliciality
p 2
of
a
F
.
E X(v)
So
0
i s equi-
A t t h e end we would l i k e t o mention t h a t s i m p l i c i a l i t y f o r a g i v e n cone
can be proved by l e t t i n g an a r b i t r a r y l a t t i c e cone p l a y t h e r o l e o f
F
LF.
This, o f course, i s no s u r p r i s e s i n c e i t i s an immediate consequence o f t h e u n i v e r s a l n a t u r e o f t h e f r e e l a t t i c e cone. 2.9.8
Theorem:
L e t T : (F, i) -, ( G , < ) -be l i n e a r map from i n-t o a _ a monotone ~ -F l a t t i c e cone G . ~ Assume t h a_ t t h_ e r e_i s _ a l_ i n e_ a r map ~__ _ -u : F: + GI: between t h e p o s i t i v e ---dual cones such t h a t ~ ( p )0 T = p -f o r a l l p E FT . Then F i s simplicial.
Linear Functionals
136
Proof: Consider
g i v e n by
T*
R
-D
F
LF
n
b
and d e f i n e x(p) = u(p)
Then z
0
T*
.
i s t h e s i m p l i c i a 1 map.
0
Under a d d i t i o n a l assumptions one can a l s o prove t h e e x i s t e n c e o f such a l i n e a r map 2.9.9 Let -
-, G:
: FT
(J
. L e t us
consider the f o l l o w i n g
Situation: T : F
(F,<,I)
+
monotone l i n e a r map from a s i m p l i c i a 1 o r d e r u n i t cone
G
i n t o a l a t t i c e cone
G.
Assume f u r t h e r m o r e
that R
= R
and t h a t
(i) G -~ i s l a t t i c e generated by T(F), i . e . G ---i t s e l f i s t h e Only l~~a t t i c e subcone of G which c o n t a i n s T(F)
.
(ii)
For
p E
-we have u ( f l )
F:
w i t h T(fl)
1. T ( f 2 )
Iv ( f 2 )
whenever
.
2.9.10 Lemma:
-I n the
s i t u a t i o n 2.9.9 we have f o r a r b i t r a r y
u(u)(g)
=
def
fl,f2 E F
sup{w(g)
Iv
E GT w i t h
* and
u
E F,
v
0
T = PI
g E
G
137
Order Units and Lattice Cones
Proof: Some obvious remarks f i r s t . Because o f 2.9.9 o r d e r u n i t , namely
IG = T(1). L e t
a unique monotone l i n e a r
: T(F)
+
such t h a t
R
p = ~(1)s
consider the sublinear
G
on
IG
( i ) t h e cone
, then
E FI
p
. Then
t h e E x t e n s i o n Theorem t h e r e i s a monotone l i n e a r v o T = p
.
But then t h i s functional
i t does n o t a t t a i n
g = T(fl)
--
v . . . v T(fn).
...,fn E
F
The element
v = v1
E FT and
g EG
VOT= v
with
+...+
pi
.
P IT(F)
v : G +
6
g
of
G
u(p)
Now, and by
such t h a t GT
because
a r e o f the form ( i ) ) . Hence
i s nonempty.
g E G.
vn
= vi
g = T(fl)
i s o f the form
. Theorem
2.4.7
v . . . v T ( f n ) . NOW, t a k e any
g i v e s us
v1
,...,v n
E GT w i t h
such t h a t n
where
5
p
ZG(v) 2 u ( v ) :
Proof t h a t
u E GT
p
T =
(consequence o f 2.9.9
t h e s e t appearing i n t h e d e f i n i t i o n o f Consider a r b i t r a r y
( i i ) there i s
must be an element o f
v
s i n c e a l l elements fly
o
has an
G
by 2.9.9
o
T
n
and
v
= pl
+...t
pn.
Put
L F 3 cp = &(fl)v
and we g e t f r o m t h e l i n e a r i t y of t h e s i m p l i c i a 1 map I: t h a t :
...v & ( f n )
Linear Functionals
138
Proof t h a t Take any
Gl,...,G
where v
i
~pE
d(f,)v
cp =
o
u( p ) 2 ZG(11):
n
pi
T =
...v
LF
with
d(fn)
E LFf
= pi
Gi o and
T*(V) = g. Then
(Proposition
with
x(p) =
G1
+...+ V-,
must be o f t h e form Again t a k e
such t h a t
. I n p a r t i c u l a r p = x p i . Now, n p u t v = x vi . Then v o T = p d
i=1
5
(
take
vi E
with
GT
and we o b t a i n :
n
n
2.9.11
~p
2.8.2).
n
x
i=1
vi)
(T(fl)
v...v
T(fn)) = v(g)
.
Theorem:
I n t h e s i t u a t i o n 2.9.9 ----t h e r e i s a unique l i n e a r u : FT -u ( p ) o T = p f o r a l l p E F: . Furthermore -we have ( 9 ) = sup{v(g) f o r a l l p E FT --
and g -
E
1v
E
Gr w i t h
v o T =
+
GT wit.h
PI
G.
Proof: Let
u : FT
Consider
-,GT
v E
be l i n e a r w i t h
~ ( p 0 )
T =
GI: and g E G , say, g = T(fl)v
p
for all
...v
1-1 E
T ( f n ) , fl
FT
.
,...,fn E F .
Order Units and Lattice Cones
2.4.7 we g e t
Again, from Theorem such t h a t
Put of
T
u.1
and
implies: v(g) =
Now, c o n s i d e r t h e
CI
= V. o T
i=1
u
u
then
1
n 1 ui(fi) 5
Hence ( * ) must h o l d and
with
tl =
vl+
...t
vn
. And
= u1 t...t un
~ ( u ) ( T ( f 1 ) v ...v T ( f n ) )
the l i n e a r i t y
= u(v)(q).
must be unique i f i t e x i s t s .
g i v e n i n Lemma 2.9.10.
u ( u ) i s by d e f i n i t i o n
Then
I I G ( u ) (same lemma) i s by d e f i n i t i o n super-
s u b l i n e a r . But t h e f u n c t i o n a l l i n e a r and f u r t h e r m o r e t h e map t y o f t h e s i m p l i c i a 1 map. Since
2.10
*
E G+
vl,...,vn
n
p = v o
u
139
1-1
xG(u)
+
i s l i n e a r because o f t h e l i n e a r i -
EG(u) = u ( u )
e v e r y t h i n g i s proved.
o
CHARACTERS
L o f a p r e o r d e r e d cone
Again we s t u d y t h e canonical embedding i n t o t h e f r e e l a t t i c e cone
LF
LF
g i v e n by
we c a l l t h e map on
F
generated by
F i s equal t o
2.10.1
II : F
i s always s p e c i f i e d t o be
a monotone l i n e a r f u n c t i o n a l p
.
p*
-,6
: LF
.
F o r a g i v e n map rp on
L the restriction o f
rp o
NOW, c o n s i d e r a monotone l i n e a r f u n c t i o n a l o u r g e n e r a l cone
F
6
(F, < )
-,
li
F
to
rp
( i n t h i s section
! ) . We know t h a t t h e r e i s
such t h a t i t s r e s t r i c t i o n t o
Definition:
A monotone l i n e a r f u n c t i o n a l
: F
-,
Ii
i s s a i d t o be a general c h a r a c t e r
: L F + l i such t h a t if t h e r e i s o n l y o n e monotone l i n e a r f u n c t i o n a l i; o L 2 p . I n case o f an o r d e r u n i t cone c h a r a c t e r denotes a qeneral
c h a r a c t e r which i s a s t a t e . Before we c o n t i n u e we l i k e t o r e c a l l t h a t f o r a monotone l i n e a r (L
l a t t i c e cone) t h e c o r r e s p o n d i n g
2.10.2
If -
p*
p
: F
i s m i n i m a l . More p r e c i s e l y :
-