This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
e0 : 8o E F} .
Definition 10.3.1
=
We prove in this paper that, except for a case studied in § 10.4.3 where
e0 < 1. If not, \i8 o E F, max
Remark 10.4.2 Let e be a limited element of e \ (hal(88) u (So)); the non standard version of the law of large numbers yields P RIJ ( X E hal( A( B))) = 1 +0 and thus PRIJ ( X E A0 ) = 1 + 0. So, for this e, the risk of the second kind is equal to 1 + 0: if � lln al � co, the NSLRT is not consistent (in the classical
10.5. Comparison with nonstandard tests based on X
165
theory, a sequence of tests ( (f?n)n ::>no {where n is the size of the sample} is con sistent if for any e E 81 , lim17_,= Ee ( l - (f?17 ) = 0: then, for n "" oo, the risk of the second kind is infinitesimal). As the example of multinomial distributions shows (cf. {9}), it seems impossible to give general results about the value of
Remark 10.4.3
=
10. 5
Comparison with nonstandard tests based on X
In the classical theory, for testing e E 8o against e E 81 , one fixes the level a and one tries to find a test that has maximum power in any e E 8 1 . However, such uniformly most powerful (U.M.P.) tests exist only in a few exceptional cases: for example for !-dimensional exponential families, if 8o : = { e E 8 : e :S: Bo } . If no U .M.P. exists, one studies an asymptotic approach, for sample sizes tending to infinity. One of the tools to compare asymptotically the power of two tests of the same hypothesis is the Bahadur relative efficiency. In a more general framework (not only for exponential families) Bahadur ([1] or [2] , see also [12]) has proved that the likelihood ratio test is at last as "efficient" as any test based on a rejection criterion of the form T > c (with randomization if T = c if necessary) , where T is a statistic built with the n-sampling. However, it may be that to get the same power in a point e E 8 \ 8o the size of the sampling for the likelihood ratio test has to be larger than for the test based on T: thus was introduced the notion of "Bahadur deficiency" (cf. [13]). We shall prove that the NSLRT is uniformly the most powerful in a large family of nonstandard tests if a � 1 and I�a � co . The standard likelihood ratio test is not as powerful in the corresponding standard family. Let ((f?e0 ) be a family of tests of level a (where (f?e 0 tests He0 : e E 8o against e tt 8o) . The corresponding level-a nonstandard test (f?O is defined by (f?O
=
: inf { (f?e 0
: 8o E F }
and when we shall refer to a "nonstandard test", it will be defined thusly. 10.5.1 R
Regular nonstandard tests
Suppose that for each 8o , R (a, 8o) such that
:=
y? e 0
is a test of size a defined by a rejection set
sup Pl) ( X E R) :::_: a :::_: sup Pl)( X E R u aR) .
liE8o
liE8o
10. Nonstandard likelihood ratio test in exponential families
166
If R is n-regular in any point of aR and if aR is limited , rpe0 will be called "regular". The most famous example of such a test is the chi-squared test since the relative frequency F is in fact the sample mean for the multivariate distribution. In order to get R -/=- 0 we shall suppose that � lln a l � co and so � lln a l � co(8o) for 8o E F. If 'P8 o is regular for any 8o E F, 'PO will be said to be "regular". We prove now that
Proposition 10.5.1 For a � 1 and � lln a l � co , if 'P O is a regular level-a non standard test, then
-
=:
:=
n
=
,
•
A
�
-
,
•
�
10.5. Comparison with nonstandard tests based on X
167
But J( 0 �o , >. ( 0S o)) and J( 0 �o , >.(So)) -/=- 0 are both standard numbers; as >. ( So) c ( >. ( 0S o ) ) 0 we have J( 0.;o , >.( 0S o)) < J ( 0 �o , >.(So)) and so J (�o , >. ( Go)) ;:, c. 1 c: this contradicts On the other hand J(R(a, G 0 ) , >. (Go)) : ::o
�o E R(a, Go) .
10.5.2
Case when
80
a
-
::o
D
is convex
For any 8o E F and any e 1 E 8 \ hal ( 8o) , there is a level-a test \[!de o which is the most powerful at e 1 (for any level-a test cp testing e E 8o against e E 8 1 , Ee 1 cp ::; Ee 1 W�0 ) . This test is defined in the following way (see [13, p. 49]) let �
is the least favorable distribution. Then \[!�0 = 1 if f(X) < C and W�0 = 0 if f (X) > C where C is a constant depending on a, 8o , e1 . So, the rejection set (relatively to X) is { � E A : f ( �) < C}.
where
T
Definition
10.5.1
For e 1
E8
\ hal( So ) , let W� 1
:=
inf { W�0
: 8o E
F} .
We might think that W� 1 is "the most powerful at e1 nonstandard level-a test of Ho"; but in fact, in some cases,
Proposition
10.5.2 Jf Go is
convex, then for any e1
Proof. Let e1
E 8 \ hal( So) .
We prove that the rejection sets
A := { � E A :
!(�)
E 8 \hal (So) ,
W�0 .
< C}
are n-regular and then the proposition 10.5. 1 yields the result. The set So is convex and d ( e1 , Go) rj: 0 and so exists a standard cone � C �k and a standard positive number > 0 such that if u E � and ll u l l = 1 then ( eo e1 I u) < for any eo E So . Therefore, for any 8o E F, for any e E 8o and for any u E � \ {0} , (eo - e1 I u) < 0. Choose 8o E F. If u E � \ { 0} , f(x + u)
c
-c
-
le
:= .
o
ex
p ( n ( eo e l I u)) ·
. exp
-
(
n
( ( eo
-
e1 I x ) ?jJ ( eo) + 1jJ (e1 )) -
)
T
( deo)
< f(x).
168
10. Nonstandard likelihood ratio test in exponential families =
Let now a E 8A, then f(a) C. For any u E � \ {0}, f(a + u) < C, so a + (� \ {0}) C A . It is now possible to choose a point b E a + � such that d(a, b) = � ( for example) and such that B(b, nf12 ) C a + � - If a t/. hal ( 8A ) , this proves that A is n-regular in a. If E hal ( 8A) , we have to use Cauchy's principle like at the end of the proof of proposition 10.3. 1 D a,
References
[1] R. R. BAHADUR, An optimal property of likelihood ratio statistic, in Pmc. Fifth Berkeley Symp. Math. Statist. Prnb. , Vol. 1 , 1965. [2] R. R. BAHADUR Some limit theorems in statistics, SIAM, Philadelphia, 1971. [3] R.R. BAHADUR and S . L . ZABELL, "Large deviations of the sample mean in general vector spaces", Annals of Probability, 31 (1979) 587-62 1. [4] I . VAN DEN BERG, An external probability order theorem with applica tions, in F. and M. Diener editors, Non Standard Analysis in Practice, Springer-Verlag, Universitext, 1995. [5] J . B oSGIRAUD, "Exemple de test statistique non standard, risque ex terne", Pub. Inst. Stat. Paris, 41 (1997) 85-95. [6] .J . BoSGIRAUD, "Tests statistiques non standard sur des proportions", Pub. Inst. Stat. Paris, 44 (2000) 3-12. [7] .J . BoSGIRAUD , "Tests statistiques non standard pour les modeles a rap port de vraisemblance monotone ( premiere partie ) ", Pub. Inst. Stat . Paris, 44 (2000) 87-101 [8] J . BoSGIRAUD, "Tests statistiques non standard pour les modeles a rap port de vraisemblance monotone ( seconde partie ) ", Pub. Inst. Stat. Paris, 45 (200 1) 61-78. [9] .J . BoSGIRAUD , "Nonstandard chi-squared test", Journal of Information & Optimization Sciences, 26 (2005) 443-470 . [10] L . D . B ROWN, Fundamentals of Statistical Exponential Families, Institute of Mathematical Statistics, Hayward, California, 1986. [11] F. DIENER and G. REEB, Analyse non standard, Hermann, Paris, 1989. [12] P. G ROENEBOOM and .J . OoSTERHOFF, "Bahadur efficiency and proba bilities of large deviations", Statistica N eerlandica, 3 1 ( 1977) 1-24.
References
169
[13] W . C . M . KALLENBERG , Asymptotic Optimality of likehood ratio tests in exponential families, Mathematisch Centrum, Amsterdam, 1978. [14]
F. KouDJETI and I. VAN DEN B ERG, N eutrices, external numbers and external calculus, in F. et M. Diener editors: Non Standard Analysis in Practice, Springer-Verlag, Universitext, 1995.
[15]
Radically Elementary Pr-obability Theory, Princeton Univer sity Press, 1987. E . NELSON ,
[16] S . R . S . VARADHAN , Large Deviations and Applications, SIAM, Philadel phia, 1984.
A finitary approach for the representation of the infinitesimal generator of a markovian sem1group Scherazade Benhabib *
Abstract Ill, where the central question was: under suitab le regularity condit-ions, what is t he form of the infinitesimal generator of a Markov semigroup?
This work is based on Nelson's paper
the elementary approach using 1ST [2] , the idea is to replace the ![{ with a finite state space X possibly containing an unlimited number of points. The topology on X arises
In
continuous state space, such as naturally
from
the
probability theory.
For :1: E X, let. 'I.r.
be
the set
of all
h E M vanishing at x where M is the multiplier algebra of the doma.iu 'D of the iufiui tcsimal generator. To desaihe the st.rneLm:e of the scmigroup
l::y EX\{x} a(a; , y) h(y) so that of the points far from x appears separately. A defini tion of the quantity O:ah ( x ) = l:yEF a.(;t, y) h(y) is given using the least upper bo und of the stun..<; on all intemal sets T-V included in the external set F. Tl:ris leads to the characterization of the
generator A, we want
to
split Ah(a;)
the contribution of the external set Fx
global part of
11.1
=
the infiuitesimal generator.
Introduction
Let X be a finite state space possibly containing an uulimit.ed unrnbcr N of points. For all x in X, let a(x, y ) be a real number for each y on X such that a(x, y) is posi tive if y -=/=- x and L y a(x, y) = 0. Then A = (a(x, y)) is a finite N x N matrix, with positive off- diagonal elements and row sums 0. L n t'��" exists and is a markovian semigroup with infinitesimal Thus p t generator A. =
•EIGSI, 17041 La Rochelle, France. scherazade .benhabib@eigs i . fr
11.1. Introduction
171
Then we can define externally the domain of definition of A and its multi plier algebra as follows. Definition 1 1 . 1 . 1
A is the external set
The domain D of definition of the infinitesimal generator
D = { f E � X / f limited and Af limited}
(11.1.1)
And its multiplier algebra is the external set M = { f E D/ Vg E D fg E D}
(11. 1.2)
The topology on X arises naturally from the probability theory and a proximity relation is defined on X, more particulary from the way the functions in the multiplier algebra M of the domain D of the infinitesimal generator act on X. Definition 1 1 . 1 .2
and only if
Let u and v be in X, we say that u is close to v (u Vh E M h(u)
�
�
v) if
h(v)
Thus, the elements of M have a macroscopic property of continuity for mally analogous to the S-continuity. With this relation, we define the external sets :
�
Cx
=
X}
(11. 1.3)
Fx
= {y E X y rf. X}
( 11.1.4)
{y E X y
of points close to x and :
of those far from x. For each x in X, (a(x, y)) are positive real numbers if x -/=- y and can take unlimited values. Let Ix be the set of all h in M vanishing at x, and for h in Ix let us define ( 11.1.5 ) Ah(x) = L a(x, y) h (y) yE X \{x}
To describe the structure of the semigroup generator, we want to split Ah(x) so that the contribution of the points far from x in X. appears separately. One is tempted to define directly the quantity
aa h (x) = L a(x, y)h (y) yEFx
( 11.1.6 )
11. The infinitesimal generator of a markovian semigroup
172
which alas has no meaning because of the external character of the set of indices F:r Nevertheless, we will show in Section 1 1.2 how we can attach a definite meaning to it. That leads in Section 1 1 .3 to a definition for an ax-integrable function. Theorem 11.3.1 establishes the representation of Ah(x) for functions in M which have a zero at x of the third order. This is the global or integral part of A. Theorem 11.3.2 and its corollary extend the notion of ax-integrable to functions which have a zero of the first or the second order. 11.2
Construction of the least upper bound of sums in 1ST
Let E be an external subset of X and f a positive function defined on X. If there exists a standard natural number no such that for all internal sets W contained in E we have
Lemma 1 1 . 2 . 1
L f(y) :S: no
(11.2.1)
yEW
then there exists a unique up to an infinitesimal least number a( ! ) such that
L f(y) � a( ! )
(11.2.2)
yEW
for all internal sets W contained in E. Proof. Let no be a standard natural number such that for all internal sets W contained in E we have ( 11.2.1). By external induction, there is a least no such that (1 1.2.1) holds. Now for each standard natural k there is a largest natural number j with 0 :S: j :S: 2 k such that for all such W (11.2.3) L f(y) :S: no - k yEW
1
Let a(k) no - ik . Then for each standard k we have a standard a ( k ) , so there is a standard sequence k -+ a( k) . This sequence is decreasing, therefore it has a standard limit a (f) . Moreover, for all standard k and all such W , D ( a (f) - Ly Ew f(y)) :S: 21k · This proof uses very elementary tools. It can easily be formulated in the minimal non-standard analysis introduced by Nelson in [3] in which "standard" =
1 1.2. Construction of the least upper bound of sums in 1ST
1 73
a(O)
Step 0:
no - 1 Step 1:
no - 1
/,� i)\ : : J)\ n
(2
Step 2:
no - 1
no a(1) no a(2) no
Figure 11.1 applies only to natural numbers. On the contrary, if all the force of 1ST is used, one could check that s a (f) sup x E �+ ; 3 intw C E L f(y) :S x
=
{
yEW
}·
Figure 11.1 exhibits the way the sequence is built. Definition 1 1 . 2 . 1 1.
If f is a positive function defined on X, and if the conditions required for Lemma 1 1 . 2. 1 are verified the quantity (11.2.4) af = L f(y) yEE
is defined to be the standard limit a (f) . 2. If the conditions for Lemma 1 1 . 2. 1 are not verified, let af be the formal symbol x and say that (1 1 . 2. 2) is not defined. 3. In the general case, let f f + - f - be the decomposition of f into the difference of two positive functions. Say that af is defined in case both aJ + and a1- are defined, and let a f be their difference:
=
Notation 1 1 . 2 . 1
of af .
For each x in X, if f depends on x, write aJ (x) instead
11. The infinitesimal generator of a markovian semigroup
174
11.3
The global part of the infinitesimal generator
For x E X and h E M , let f = a(x, ·)h, then h is said to be ax-integrable if and only if aJ (x) is defined.
Definition 1 1 . 3 . 1
Notation 1 1 . 3 . 1
In that case write aa h (x) instead of aJ (x) .
Definition 1 1 .3.2 1.
h is a function in Ix if and only if h E M and h(x)
2. h is a function in I� if and only if h E M and h limited and eb gk ·in Ix .
= 0.
=
I:f=l e k gk with p
3. h is a function in I� if and only if h E M and is of the form h Ll e k fk gk with e k , fk , gk E Ix and p limited. 4. We say that h has a zero at x of the first order when h E Ix, of the second order when h E I�, of the third order when h E I� . If h has a zero at x of the third order, then h is ax-integrable and Ah ( x) is infinitely close to aah ( x) .
Theorem 1 1 . 3 . 1
Proof.
The proof goes through the following three steps:
1 . Let h be in I� , therefore it is of the form h and fk , gk in Ix .
=
I:i f� gk with q limited
,
2. I f f g E I.:r then P g is ax-integrable and so is h. These steps are proved as follows:
1. Let h E I�, as 1 1 1 efg = 4 (e + f) 2 g - 2 e 2 g - 2 f 2g, therefore h is of the mentioned form.
I L a(x, y)f2 (y)g+ (y) I w
:::;
l l g i i A(f2 ) (x)
1 1.3. The global part of the infinitesimal generator
175
As l l g l l and A(f 2 ) are limited, they are both infinitely close to a standard number. Taking the integer part of o (l lgi iA(f2 ) (x)) plus 1, we get the existence of the natural number no required by Lemma 11.2.1. The same argument applies to f 2g - . Thus aa( J2 g + ) (x ) and aa(j 2 g-) (x ) exist and as O!a( J 2 g) (x ) = aa( J 2 g + ) (x ) - aa(j 2g-) (x ) , then f2 g is ax integrable, and so is h. 3. Let (3 » 0. Since g E Ix there is an internal set W of Fx such that g + (y) :::; (3 for y E W 0 . We have
I A(f2 g + ) (x) - aa( J 2g+) I
=
IL
yE X \{x}
a (x , y) f2 (y)g + (y) - aa( J 2g + )
I
L a (x , y)f2 (y)g+ (y) - L a (x , y)f2 (y)g+ (y) L L a(x, y)f2 (y) :::; (3 L a (x , y) f 2 (y)
<
yEW
yE X \{x}
yEWr"\{x}
:::; {3
=
yEW0\{x} yE X \{x}
(3A(f2 ) (x)
Since A(f2 ) is limited and (3 » 0 is arbitrary, A(f 2 g + ) aa( J 2 g + ) (x ) . The same applies to f 2 g - . Then A(f 2 g - ) (x) ::: aa( J2 g-) (x) and aa( J2 g) = aa( J2 g + ) (x) + aa( J2 g-) (x) . D Thus A(f2 g) (x) ::: aa( J 2g) (x ) . Therefore A(h) (x) ::: a(ah) (x ) . :::
If h zs positive and has a zero at x of the first order, then h is ax-integrable and ah is less or infinitely close to Ah(x) . Theorem 1 1 .3.2 Proof.
Let W be any internal subset of Fx and h a positive function in I� , so
0 :::;
L a (x, y)h (y) :::; A(h (x w
)
)
As A (h) (x) is limited, we argue as in Theorem 11.3.1 and apply Lemma 1 1.2.1. One concludes that h is ax-integrable. As the inequality above holds for all internal subset W of Fx , we get that aah (x ) is less or infinitely close to A(h) (x) . D
176
11. The infinitesimal generator of a markovian semigroup
Corollary 1 1 . 3 . 1
If h has a zero at
integrable.
x
of the second order, then h is ax
Let h be a function in I� , as fg = -41 (e + g) 2 - -41 (e - g) 2 h is also of the form h = Lk = l Pk ff with Pk = ±1, q limited and f'f in I"} . Consequently we can apply Theorem 1 1 .3.2 and h is ax-integrable. D
Proof.
1 1 .4
Remarks
The next goal will be to find an 1ST construction of the pure diffusion part of the generator of the semi-group and to complete a work already in progress concerning the rescaling of the time parameter for the markovian semigroup pt .
I would like to thank Professor E. Nelson for the initial suggestion of this problem and numerous enlightening discussions. I would also like to thank Professor G. Wallet of the University of la Rochelle for his support.
Acknowledgment
References
[1]
E. NELSON, " Representation of a Markovian Semi-group and Its Infinitesi mal Generator", Journal of Mathematics and Mechanics, 7 ( 1958) 997-988.
[2]
E. NELSON, "Internal Set Theory: a new approach to nonstandard analy sis", Bulletin Amer. Math. Soc., 83 ( 1977) 1165-1 198.
[3]
E. NELSON,
[4]
Press, 1987 E.
B.
Radically Elementary Probability Theory, Princeton University
DYNKIN,
Markov Processes, Springer-Verlag, 2 vols .. 1965.
[5] W. FELLER, An Introduction to Pmbability Theory and Its Applications, John Wiley & Sons. [6] I . VAN DEN BERG, Non Standard Asymptotic Analysis, Lectures Notes in Mathematics, 1249 , Springer-Verlag, 1987.
On two recent applications of nonstandard analysis to the theory of financial markets * Frederik S. Herzberg
Abstract Suitable notions of "unfairness" that measure how far an empirical dis counted asset price process is fi·om being a martingale arc introduced for complete and incomplete-market settings. Several limit processes are i nvolved each tirue, prompting a nonfltandard approach to the this concept. This leads to
( rather
traded
than a
011
martingale
several stock
a
analysi
s of
existence result for a "fairest price measure"
measure ) for an
asset
exchanges. This approach
describing the impact of
12 . 1
an
that is simultaneously also proves useful when
currency tr ansaction tax.
Introduction
Nonstandard analysis is most successful when it concerns itself with
ematical concepts that. i nvolve several limit
math p ro ecss cs in a non-trivial way. One
such exampl e is the quantification of a stochastic process's distance from being a martingale.
between the existence of a martingale mea..sure for a discounted asset price process and the non-existence of atbitrage opportunities, there is a natural economic interpretation to the compru·ison of two positive stochastic processes in regard to "how fru·" they actually ru·e from being a martingale. Vole will l'encler two economic questions related to such conceived "unfairness" mathematical : (1) Is there a "fairest price measure" (rather than a m�u·tingale measure ) for an asset that is sinmltaneously traded at mul t iple stock exchanges? (2) Does a currency transaction tax imposed on a currency that is sub j ect to herd behaviour among traders have a fairnessGiven the well-known correspondence
· Mathematical Institute, University of Oxford, Oxford OXl :3LB, United Kingdom. herzberg@maths . ox . ac . uk / herzberg@wiener . iam . uni -bonn . de
12.
178
Applications to the theory of financial markets
enhancing impact on the currency exchange rates preceding a financial crash? Both questions will be shown to allow for an affirmative answer. Techniques from nonstandard analysis have already been successfully ap plied to mathematical finance in the work of Cutland, Kopp and Willinger [5] . This contribution is based on two more recent papers by the author [8, 9] . 12.2
A fair price for a multiply traded asset
In this Section, we will en pass ant motivate notions of "unfairness" for both complete-market as well as incomplete-market settings. Theorem 12.2.1 Let n E N, p > 0 and c, N > 0 . Consider an adapted probability space (r, Q, IP') and B[O, 1 ] ® Y1-measurable geometric Brownian mo tions with constant multiplicative drift g� : r x [0, 1 ] �d·n , i E { 1 , . . . , n}. Then there exist processes gi , i E { 1, . . . , n} on an adapted probability space (D, F, CQ) , equ.ivalent to the processes g� on r (in the sense of adapted equiv alence [7}), such that there is a probability measure Mm on n in the class of measur-e s Q probability measure, VA E F1 iJ · CQ(A) :S: Q(A) :S: N CQ(A) , > vz .../.r. J. E { 1 , . . . , n } 0 I( ) I s c minimising ____,
1 1 CovQ((g,)s, (gJ)Jd .t.Q 9t9J s
}
·
w·
_
�
in the class of Loeb extensions of finitely additive measures from (*C) (D, G) (G being an arbitrary lifting of g). Analogously, there is a probability measure Mn minimising
(where nn ( Q, g) is defined to be +oo if the derivative in 0 in this definition does not a.s. exist as a continuous function in t) in the class of Loeb extensions of finitely additive measures from (*C) (D, G) . Moreover, inf, mn (·, g) :S: inf mr ( , g) C(D g )
as well as
C(r,g)
·
inf nr (·, g ) . inf nn (-, g) :S: C(r,g)
C(D,g)
12.2. A fair price for a multiply traded asset
1 79
The original paper [8} does not state the Theorem and the subs equent Lemmas as precisely as it is done here, although the exact result becomes clear from the proofs in that paper.
Remark 12.2. 1
The proof for this Theorem can be split into the following Lemmas which might also be interesting in their own right.
Using the notation of the previous Theorem hyperfinite adapted space n [12},
Lemma 12.2.1
12. 2. 1,
for any
inf mn (· , g) :::; inf mr (·. g) . C (r,g)
C(D.g)
Under the asswnptions of Theorem 12.2. 1 and choosing n to be any hyperfinite adapted space, the infimum of mn (- , g) in the class of Loeb extensions of finitely additive measures from (*C) (D, G) is attained by some measure Mm E C(D. g) . Proofs for both of these Lemmas can be found in a recent paper by the author [8] . Although they look very similar, it is technically slightly more demanding to prove the following two Lemmas ( which in turn obviously entail the second half of the Theorem, i.e. the assertions concerned with the map n) . Lemma 12.2.2
Using the notation of the previous Theorem hyperfinite adapted space n [12},
Lemma 12.2.3
12. 2. 1 ,
for any
nr (· , g ) . inf nn (· , g) :::; C inf (r,g)
C(D.g)
Under the assumptions of Theorem 12.2. 1 and choosing n to be any hyperfinite adapted space, the infimum of nn (·, g) on C(D, g) is attained by some measure Mn E C(D, g) .
Lemma 12.2.4
Easy results are Lemma 12.2.5 A semimartingale X is a ?-martingale on n if and only if 1 mn (P, x ) = 0 . The function mn (P, · ) v on the space of measurable processes of n satisfies the triangle inequality and is 1-homogeneous. For p = 2, it defines
an inner product on the space [.
:=
{x : n
x
[0, 1]
--+
�d
:
x
measurable, rn(P, x )
which becomes a HilbeTt space by this constr-uction.
<
+oo }
12. Applications to the theory of financial markets
180
A semimartingale X is a ?-martingale on n if and only if The function nn (P, ·) on the space of measurable processes of n remains unchanged when multiplying the argument by constants (scaling invariance) .
Lemma 12.2.6 nn (P, x) = 0.
We can generalise this to the following Definition 12.2.1
Let D be an adapted probability space. Define
£ (Sl, �d ) :
:=
{ X : Sl
X
[0, 1] --+ �d :
X measurable } .
A function Y £ ( n, �d ) --+ [0, +oo] is an incomplete-market notion of un fairness if and only if it satisfies the triangle inequality, is 1-homogeneous, and assigns 0 to a semimartingale y if and only if y is a martingale. Y is said to be a complete-market notion of unfairness if and only if it remains unchanged under multiplication by constants and Y vanishes exactly for those semimartin gales that are in fact martingales. 1
By Lemmas 12.2.5 and 12.2.6 respectively, the function mn (Q, - ) P (for a fixed probability measure Q) is an example for an incomplete-market notion of unfairness, whereas similarly nn (Q: - ) , again for a fixed probability measure Q, is an example for a complete-market notion of unfairness.
The distinction between notions of unfairness for complete and incomplete mar-kets can be justified by the following reasoning: If it is, under assumption of completeness, possible to buy as much of an asset as one intends to, multiplication of the discounted price process by a constant does not enhance the arising arbitrage opportunities at all; therefore, for complete markets, a suitable notion of unfairness should be scaling invariant in that it does not change under multiplication of the argument - which is conceived as being a discounted price process - by constants.
Remark 12.2.2
12.3
Fairness-enhancing effects o f a currency transaction tax
In this Section, we shall analyse the empirical price of an asset that is subject to herd-behaviour preceding a financial crash and how the resulting distortion can be mitigated through imposing a transaction tax. This is of particular relevance if the crashing asset in question is a currency, given the massive (usually destabilising and therefore adverse) macroeconomic conse quences of such financial crises.
12.4. How to minimize "unfairness"
181
We shall restrict our attention to a model of currency prices where extrap olation from the observed behaviour of other traders, up to white noise and constant inflation, completely accounts for the evolution of the currency price. This is to say that, in analogy to a Nash equilibrium, we assume that every agent is acting in such a manner that he gains most if all other agents follow his pattern. In our model this pattern will consist in using some average value of past currency prices as a "sunspot", that is a proxy for a general perception that depreciation or appreciation of the particular currency in question is due. In order to introduce the model for the pre-crash discounted currency price, consider a � ----+ � ' a piecewise constant function, such that a = a(1) > 0 on (O, + x) a = a(- 1) < 0 on (-oo, O). We assume that the logarithmic discounted price process x ( v ) is governed, given some initial condition that without loss of generality can be taken to be x ( v ) 0, by the stochastic differential equation :
=
(
x �v ) = a x �v ) - L Pu . x ((�2 u ) vo uEI
d
J2
dt + J . dbt - 2 '
)
X{
(v ) _ '>'
I xt
. (v)
dt I } (12.3. 1)
L.. n E I Pn x ( t- n)VO ;:o:v
where r > 0 is the logarithmic discount rate (assumed to be constant) , b is the one-dimensional Wiener process, (Pu)uEI is a convex combination - i.e. I C (0, + oo) is finite, Vu E I Pu > 0 and L uEI Pu = 1. The parameter v depends very much on the tax rate we assume. If p is the logarithmic tax rate and T the expected time during which one will hold the asset (that is the expected duration of the upward or downward tendency of the stock price) , one can compute v as follows: v = T · p. The equation (12.3.1), is of course first of all only a formal equation that thanks to the boundedness of a can be made rigorous using the theory of stochastic differential equations developed by Hoover and Perkins [11] or Albeverio et al. [2] for instance. We will introduce the following abbreviation: n;,(v) - X{ 1 · 1 2: v } a . 'f/ -
·-
.
12.4
,
How to minimize "unfairness"
Intuitively, the map nn (P, · ) (for a fixed probability measure P on a proba bility space D) when applied to a discounted asset price process measures how
12. Applications to the theory of financial markets
182
often ( in terms of time and probability ) and how much it will be the case that one may expect to obtain a multiple ( or a fraction) of one's portfolio simply by selling or buying the stock under consideration. For the following, we will drop the first component of n ( indicating the probability measure ) if no ambiguity can arise; for internal hyperfinite adapted spaces and Loeb hyperfinite adapted spaces, we will assume that the canon ical measure ( the internal uniform counting measure and its Loeb measure, respectively) on the space is referred to. First of all we derive a formula that will make explicitly computing n easier in our specific setting: Lemma 12.4.1 If x ( v ) satisfies (12. 3. 1) for some v > 0 on an adapted prob ability space (r, g , CQ), then the discounted price process exp x� v) : t ::0: 0)
( ( )
is of finite unfairness. More specifically,
( ( ))
nr exp xl"l
[ IE [ 1 ,;,1" (x;"1 fr p;x:;1 i)vo) I] dt [ IE [ I d: l .,�o IE [ xi�¥,] + �' I ] dt I
�
-
The proof is more or less a formal calculation, provided one is aware of the path-continuity of our process and the fact that the filtrations generated by b and x(v ) are identical. For this implies that, given t > 0, the value Pro of.
'1/J ( v )
(
)
( ) ( v)u - ""' xt+ 6 Pi X ( t+ u -� ) vo ( w ) i EI v
does not change within sufficiently small times u - almost surely for all those paths w where x�v ) (w) - L i E I p� x/��� ) vo(w) tf. { ±v }, this condition itself being satisfied with probability 1 . Now, using this result and the martingale property of the quotient of the exponential Brownian motion and its exponential bracket, we can deduce that for all t > 0 almost surely:
How to minimize "unfairness"
12.4.
183
Analogously, one may prove the second equation in the Lemma: for, one readily has almost surely
In order to proceed from these pointwise almost sure equations to the assertion of the Theorem, one will apply Lebesgue's Dominated Convergence Theorem, yielding
For finite hyperfinite adapted probability spaces, an elementary proof for the main Theorem of this Section can be contrived: Lemma 12.4.2 For any hyperfinite number H we will let for all v > 0 denote the solution to the hyperfinite inztial value problem
x6v) { x ( v ) - x (v ) - � } (x(v) - "" . x(v) ) X{
\it E
=
0, 0, . . . , 1 t
t+ J, -
x (v)
a
!
-
t
+ J . 1ft+ J,
6 Pu
uEI .
( t-u) VO
2 1 J 1 (2H ! ) 1/'2 2 H !
I
(v )
xt
-
(u)
L Pu ·X (t- u )V O
uEI
I
?: v
}
.� H!
(1 2.4. 1)
12.
184
Applications to the theory of financial markets
(where 1'1£jH ! : n { ± 1 } H ' --+ { ± 1 } is for all hyperfinite e <::.:: H! the projection to the f!-th coordinate) which is just the hyperfinite analogue to (1 2. 3. 1) . Using this notation, and considering a hyperfinite adapted probability space of mesh size H!, one has for all k < H!, =
""' IE Xk(v)/H ! - IE [X (v ) I FkjH !] - 2J2 1 H! -"-±f
<::; 6
If
k
for all 2: v . As a consequence, m (xO! n) is monotonely decreasing for all hyperfinite adapted probability spaces Sl = { ±1 } H ! . Pro of of Lemma 12.4.2. It suffices to prove the result for finite ( rather than merely hypcrfinitc) adapted spaces. By transfer to the nonstandard universe, we will obtain the same result for infinite hyperfinite H as well. The proof of this Lemma for finite H relics on exploiting the assumption that a is piecewise constant, since a = a ( 1 )x(O,+=) + a ( - 1 )x(-=.O) + a (O)x{o} yields Vk < H! Vv > 0 T
[ (v) I J v) (
J2 1
IE X kJ} Fk/ H ! - X J'r, + 2 H!
v
(
- �a x( l - 6 ""' pu kj H ! H!
_
1
_
- H!
(
·
u EI
a(1)x
{
(v
X ( �,l -u)v o
(c, · J
c'·l
) {l
xk/H ' - L Pu·X .J£. uEI HI
+ a( - 1 ) x
{
C uJ
xk/H' - L Pu ·X uEl
u
x
1t
) VO
(C kJ - u ) JTf
(v) xk/H'
;:::v }
VO
::; -v
" p " L-
uEl
)} '
.x (v )
k - u) V O (w
l>-v}
which immediately follows from the construction of Anderson's random walk [3] B. = v�Jr. H, and the recursive difference equation defining the process x(v) . However,2 this last equation implies Vk < H! Vv > 0
I
[ (v) I ] (v)
J2 1
IE IE X k}i,1 Fk/ H ! - X J'r, + 2 H! 1
= -
H!
a ( 1)X
IE
{
(v )
I
((v)
:.:C: v } s-v } )
xk/ lf ' - L Pu ·X k m u) V O uEl
+ a(-1)x
{
X
��� , - uLE I Pu X ((vm� - u
VO
12.4. How to minimize "unfairness"
185
} "'"' IP' "'"' { 6 XkjH! - 6 Pu · X �, -u)vo ? v
Now all that remains to be shown is that (v)
k< H! and
(v)
(
uEI
"'"' IP' { XkjH! - "'"' 6 Pu . X );, -u)vo 6 (v)
k< H!
(v)
(
uEI
<::;
-v
}
are monotonely decreasing in v. The former statement is a consequence of the following assertion:
Vv' ::; v \If! < H!
IP' { xt�! - L Pu . xt�, -u)vo v } L k�R uEI "'"' "'"' Pu . X --", -u)vo 6 1P' { Xk/ H ' - 6 '2
H
<::::
(v' )
k�R
(v')
(H
uEI
2::
v
1
}
(12.4. 2)
One can prove this estimate by considering the minimal f! such that the point wise inequality
L k
(v)
(v)
xk/H' - L Pu ·X ( _k_ ;:o: v uEI HI u V O
)
} ::; L k
(v')
(v')
::?: v xk f H' - L Pu · X ( _b_ HI u VO uE I
)
fails to hold. Then one has an w E S1 such that Vk < f! (w ) (vJ CvJ
X{
xk/H ' - L Pu · X ( k uEI HT - u
= X{
1 0
(v')
)
vo
::?:v
}
(v' )
xk/H' - L Pu · X ( k ::?: w u VO v uEI
X{ = X{
(v )
(v)
(v' )
(v')
)
' } (w) ,
)
::?:v xf! H ' - L Pu · X ( £ uEI HI u VO
)
'}
::?: v XR f H' - L Pu ·X ( £ uEI HI u VO
(12.4.4 )
} (w) ,
( 12.4.5 ) ( 12.4.6)
) ' } (w .
But equation ( 12.4.4 ) implies, via the difference equation for inductively in k the relation Vk < f! Xf(w ) = X;;:' (w ) .
(12.4.3)
x ()
(12.4. 1),
12.
186
Applications to the theory of financial markets
If one combines this with
(which is equation (12.4.5)) and v ::; v' , one can derive - again via the recur sive difference equation (12.4. 1) - that x , :::: x ! applied in t = �! as well as the estimates
i;2
X { XR/H' - L (v ' )
uEI
Pu · X
(v ' ) k
( H!
-u
) VO
2:v ' } (w)
> >
X{ X{ X{
i;1
(v ' )
xf/H' - L Pu · X uEI
(v )
xf/ H ' - L Pu X uEI
(v )
·
xt/ H ' - L Pu · X uE l
1.
This contradicts equation (12.4.6) . Hence, the estimate tablished for all k < H!, leading to (12.4.2). S imilarly, one can prove
(v )
(t
w -u
(v )
(f
w-u
(v )
w_ - u
(t
)VO ) VO ) VO
(12.4.3)
2:v ' } (w) 2:v' } (w) 2:v } (w)
has been es
(v) - L Pu · X (v ), - O ::; -v } L IP' { Xk/H' ( H u)V k�R uEI "" IP' { Xk/H' "" Pu . X((v')l,) -u)vo ::; ' } (v' ) - L._., ::; L._., k�R uEI which entails that Lk < H! IP' { Xk/�! - 'I:, Pu · X (v1 _ u)vo ::; - v } must be monouEI ( H ! Vv' ::; v W <
H!
·
k
-v
tonely decreasing in v.
D
Using nonstandard analysis and the model theory of stochastic processes as developed by Keisler and others [10, 12, 7] , we can prove the following result:
Suppose (y(v) : v > 0 ) is a family of stochastic processes on an adapted probability space r such that y(v) solves the stochastic differential equation (12. 3. 1) formulated above for all v > 0. Then the function J f---+ nr (y(" l ) attains its minim·um on [0, S] in S.
Theorem 12.4.1
Pro of. B y the previous Lemmas 12.4.2 and the formula for n from Lemma 12.4. 1, the assertion of the Theorem holds true internally for hyperfi nite adapted spaces r, if we replace y(o-) by a lifting y(o-) and if we let nn when applied to internal processes denote the hyperfinite analogue of the standard nn . Now, according to results by Hoover and Perkins [11] as well as Albeverio
187
References
et al. [2] , the solution x(v ) of the hyperfinite initial value problem (12.4.1) is a lifting for the solution x(v ) of ( 12.3.1) on a hyperfinite adapted space for any v 2: 0. Now, y c---+ nn ( y ) is the expectation of a conditional process in the sense of Fajardo and Keisler [7] . Therefore, due to the Adapted Lifting Theorem [7] , we must have Vv 2: 0 °nn x(v ) = nn ( x(v ) )
( )
(where we identify n with its internal analogue when applied to internal pro cesses) . Since the internal equivalent of the Theorem's assertion holds for internal hyperfinite adapted space, the previous equation implies that it is also true for Loeb hyperfinite adapted spaces. Now let (y (v ) : v > 0) be a family of processes on some (not necessarily hy perfinite) adapted probability space r with the properties as in the Theorem . Because o f the universality o f hyperfinite adapted spaces [7, 12] , we will find a process x (v ) on any hyperfinite adapted space n such that x and y are automor phic to each other. This implies [2] that x ( v ) satisfies ( 12.3.1) as well. Further more, as one can easily see using Lebesgue's Dominated Convergence Theorem, Vv
>
0 nn ( x ( v) )
=
nr ( y ( v ) ) .
Due to our previous remarks on the solutions of (12.3.1) on hyperfinite adapted spaces, this suffices to prove the Theorem. D Acknowledgements. The author gratefully acknowledges funding from the German National Academic Foundation ( Studienstiftung des deutschen Volkes ) and a pre-doctoral research grant of the German Academic Exchange Service ( Doktorandenstipendi1Lm des Dwtschen Akademischen A 1Lstauschdienstes ) . He is also indebted to his advisor, Professor Sergio Albeverio, as well as an anony mous referee for helpful comments on the first version of this paper.
References
[1]
S . ALBEVERIO, Some personal remarks on nonstandard analysis in prob ability theory and mathematical physics, in Prnceedings of the V!Ilth In ternational Congress on Mathematical Physics - Marseille 1986, eds. M . Mebkhout , R. Seneor, World Scientific, Singapore, 1987.
[2]
S . ALBEVERIO , J. FENSTAD , R. H0EGH-KROHN and T . LINDSTR0M ,
Nonstandard methods in stochastic analysis and mathematical physics, 1986.
Academic Press, Orlando,
[3]
R. M . ANDERSON, "A nonstandard representation for Brownian motion and Ito integration", Israel .Journal of Mathematics. 25 (1976) 15-46.
188
12. Applications to the theory of financial markets
[4] A. CoRCOS ET AL . , "Imitation and contrarian behaviour: hyperbolic bubbles, crashes and chaos", Quantitative Finance, 2 (2002) 264-281. [5] N. CUTLAND, E . KoPP and W . WILLINGER, "A nonstandard treatment of options driven by Poisson processes", Stochastics and Stochastics Re ports, 42 ( 1 993) 1 1 5- 133. [6] l\1 . D REHMANN, .J . 0ECHSSLER and A . RoiDER, Herding with and with out payoff externalities - an internet experiment , mimoe 2004. [7] S . FAJARDO and H. J. KEISLER, Model theory of stochastic Lecture Notes in Logic 14, A. K Peters, Natick (Mass . ) , 2002.
processes,
[8] F . S . HERZBERG, "The fairest price of an asset in an environment of tem porary arbitrage", International Journal of Pure and Applied Mathemat ics, 18 (2005) 121 - 131. [9] F . S . HERZBERG, On measures of unfairness and an optimal currency transaction tax, arXiv Preprint math. PR/0410543. http : //www . arxiv . org/pdf/math . PR/04 10543 [10] D . N . HOOVER and H . .J . KEISLER, "Adapted probability distributions", Transactions of the American Mathematical Society, 286 ( 1 984) 1 59-201. [ 1 1] D . N . HooVER and E . PERKINS, " Nonstandard construction of the stochastic integral and applications to stochastic differential equations I, II", Transactions of the American Mathematical Society, 275 ( 1 983) 1-58. [12] H. J. KEISLER, lnfinitesimals in probability theory, in Nonstandard anal ysis and its applications, ed. N. Cutland, London 1Iathematical Society Student Texts 10, Cambridge University Press, Cambridge, 1988. [13] P . A . LOEB , " Conversion from nonstandard to standard measure and ap plications in probablility theory", Transactions of the American Mathe matical Society, 2 1 1 ( 1 974) 1 13-122 . [14] E . NELSON, Radically elementary probability theory, Annals of Mathemat ics Studies 1 17. Princeton University Press, Princeton (NJ) , 1987. [15] E. PERKINS, Stochastic processes and nonstandard analysis , in Nonstan dard analysis-recent developments, ed. A.E. Hurd, Lecture Notes in Math ematics 983, Springer-Verlag, Berlin, 1983. [16] K . D . STROYAN and .J . M . B AYOD, Foundations of infinitesimal stochastic analysis, Studies in Logic and the Foundations of Mathematics 1 1 9, North Holland, Amsterdam, 1986.
Quantun1 Bernoulli exp eriments and quantum stochastic processes Manfred
\iVolff*
Based on a
W ...-algebraic
Abstract
approach to quantmn probability theory we
construct basic discret e in terna l quantum stochastic pro cesses with in
d ep eiHlent increments. We ob tain Bernoulli
exp eriments
a one-parameter family of (classical)
as linear combinations of these basi c processes .
Then we use the nonstandard hull of the internal GN S-Hilbert space corresponding to the chosen state
T
( the
?-{,.
un derlying quantum probabil
i ty measure) in o rder to derive nonstandard hulls of our internal pro cesses.
Finally continuity requirements lead to the specification of a
certain flUhf;pace £ of
nal pro cesses to
the
can
Hr
to which the nonstandard hulls of our inter
be restricted and
wh ch
i
turns out to be isomorphic
Loeb-Guicltardet space intro d uced by Lci tz-Martini
space of £ the.n ifl shown to he isom orphic to
F+
(L2 ([0, 1] , >.))
1 101.
A sub space
flymmetric Fock
and om· basic processes agree with the processes of
Hudson and Pa.rtltasarathy on this
13. 1
t.he
subspace.
Introduction
In the early 1980's Hudson and Parthasarathy [5], Hudson and Lindsay [4] . and Hudson and Streater [6] started the theory of quantum stochastic pro cesses, in pcu·ticular of quantum Brownian motion. In [12[ Parthao:;arathy showed one way how to make the passage from quantum random walk to diffu sion. All theS(' topics are extensively treated in P.A. Meyer's compendium [ 1 1 [ . For another general introduction to this field see fl3] where an extensive mo tivation ti·om qua.ntum physics may be found. The Hudson-Part.hasarathy ap proach is based on t.he classical symmetric Fock space over L2 (R+ , >.) where ·Mathematisches Institut, Eberhard-Karls-Univ. Tiibingen, manfred . wolff�uni-tuebingen . de
190
13.
Quantum Bernoulli Experiments
A denotes the Lebesgue measure (see section 13.6 ) . Guichardet [3] gave an interesting representation of this Fock space as an L 2 -direct sum of spaces L� = L 2 (Xn) where Xn is the space of all subsets of the unit interval [0, 1] having exactly n elements. The measure on Xn is defined via the conesponding Lebesgue measure on �f- , This representation was extensively used by Maassen developing his kernel approach to general quantum stochastic processes. Journe [7] invented the so called toy Fock spaces (bebe Fock in French) as discrete approximations of the symmetric Fock space. Let Do = { 0, 1} be equipped with the uniform distribution f-LO · Then the toy Fock space of order n is the space L 2 (D0, p, � n) . A rigorous discrete approximation of the Guichardet space and the basic quantum stochastic processes defined on it which uses the N space L2 (D � , p,� ) as a toy Fock space is given by Attal [2] . There is another approach based also on the Guichardet space to prove such approximation theorems using nonstandard analysis which was developed by Leitz-Martini [10] . He discretized the Guichardet space in the following manner: let T = { � : k E *Z , 0 :::; k :::; N } be the hyperfinite time line where N E *N is infinitely large. Let r n be the set of all internal subsets of T of internal cardinality n and set r = u�=O rk . Now let ]1.1 be an internal subset of r and set where IAI denotes the internal cardinality of A. Then m is an internal measure on r with m(f) � e. The space L 2 (r, Lm) , where Lm denotes the Loeb measure associated to m, contains the Guichardet space as a Banach sublattice. In fact L 2 (r, Lm) is the nonstandard version of the Guichardct space, so to speak the Loeb- Guichardet space over the time interval [0, 1] , Among other things Leitz-Martini constructed all the relevant discrete quantum stochastic processes and showed that their nonstandard hulls exist in a precise manner and form the basic quantum stochastic processes: the time process, the creation and annihilation processes, and the number process. All approaches mentioned so far start with some kind of discrete approxi mation of the symmetric Fock space or the isomorphic Guichardet space over �+ , [0 , 1] respectively. In contrast to these approaches we present here a new one based on the more natural W* -algebraic foundation of quantum stochastic as described e.g. in [8] , In [13] the author sketched a different though similar approach in the finite-dimensional setting but he was not able to make the transition from the finite-dimensional to the continuous infinite-dimensional case. Our access is exactly the noncommutative version of Anderson's way [1] to Brownian mo tion. In particular we arc able to ju.s tify the usc of the symmetric Fock space (or equivalently the Guichardet space) in the context of quantum stochastic
191
13.2. Abstract quantum probability spaces
processes. We believe that by our approach the applications of nonstandard analysis as given by Leitz-Martini [ 10] are also better understandable. We begin with the discrete quantum Bernoulli experiment modelled in the von Neumann algebra of all 2 n x 2 n-matrices over CC. Then we prove a l\loivre-Laplace type theorem for quantum Bernoulli experiments, i.e. we show that these discrete stochastic processes converge to quantum Brownian motion in the same sense in which the classical approximation of the usual Brownian motion is treated by Anderson [ 1] . Furthermore we construct the basic quantum stochastic processes out of the corresponding discrete versions in the case of a vacuum state. Finally we show how the symmetric Fock space approach fits into our setting. Applications to the theory of stochastic processes are under preparation .
13 . 2
Abstract quantum probability spaces
Recall that almost all information about a given probability space (D, I:, JL ) is to be found in the pair (A, JL) with A = L= (n, I:, JL). Let us denote by [! ] the equivalence class modulo negligible functions in which the essentially f( w ) dJL( w ) = : bounded measurable function f is contained. Then [f] ----+ JL(f) defines a positive, linear, order continuous normalized functional on A. Analogously a quantum probability space is a pair (A, T) where A denotes a W*-algebra and T is a positive, linear order continuous normalized functional on A, or a normal state for short. The reader not familiar with the abstract theory of W*-algebras may look at them as subalgebras of the algebra of all bounded operators on an appropriate Hilbert space which arc closed under involution * : a ----+ a* and which are also closed with respect to the strong operator topology. In this context order continuity means the following: whenever a downward directed net (aa) of nonnegative selfadjoint operators from A converges to the operator 0 with respect to the strong operator topology then lima T(aa) = 0 holds. In particular one may interpret L= (n, l::JL ) as the W*-algebra of all multiplication operators MJ : g ----+ MJ (g) = fg (! E L= (n, I:, JL)) on the Hilbert space L 2 (D, I:, JL ) . Let (A, T) be a quantum probability space. Let A1 , A2 be W*-subalgebras generating the W*-subalgebra A3; moreover let Tk be the restriction of T to Ak (k = 1 , 2, 3). Then A1 and A2 are called stochastically independent if (A3 , T3) is isomorphic to (A1 ®A2 , Tl ®T2) where ® denotes the W*-tensor product .
fn
Remark: Let us point out that this notion of independence agrees with the usual one in the classical (commutative) case A = L= (n, I:, JL) but that
13. Quantum Bernoulli Experiments
192
there are other notions of independence in the quantum stochastic setting also generalizing the classical one (e.g. free independence) . Two probability spaces (A. T) and (A', T1) are called equivalent if there exists an order continuous algebraic isomorphism rp : A --+ A' with T1 = T o rp . Now let us construct the L 2 -space corresponding to the probability space (A, T). It is nothing else than the so called GNS-space (after Gelfand, Naimark, and Segal) . To this end we introduce the C-valued mapping (al b) = T(a*b) on A x A. It is scsquilincar, that means, it is linear in the second argument, antilinear in the first argument, and it satisfies (a l a) 2 0 for all a E A. The space LT = {a : (a I a) = 0} is a left ideal, and on A/ LT there is well-defined a scalar product by (a l b) = ( a l b) where a = a + LT denotes the equivalence class in which a is contained. 7-{T is the completion of A/ LT with respect to the associated scalar product norm 11 a11 = � = JT(a* a) . The representation JrT : A --+ J:(HT ) is given by JrT (a)(b + LT) = ab + LT which is well-defined since LT is a left ideal. The representation is injective whenever A is simple (i.e. has no nontrivial closed ideals) , e.g. A = Mn (C), the algebra of all n x n-matrices. In case A = L = (n, p,) the space 7-{T turns out indeed to be the space 2 L (D, p,) and in this way L = (n, p,) is represented as the algebra of operators of multiplication by L =-functions (see above) . 13 . 3
Quantum Bernoulli experiments
Let us begin with the easiest example of a quantum probability space: Let
A = M2 (C) be the W*-algcbra of all complex 2 x 2 matrices a = (a;k ) and choose A E] 1/2, 1] . Then T.A (a) = >-au + ( 1 - >.)a22 defines a normal state on A. As in the case of classical probability we will often write IE ,\ (a) in place of a.
T.A (a) , and we call it the expectation of Now consider the following model of tossing a fair coin: choose Ao as the commutative W*-algebra C { O . l } and let p,o : Ao --+ C be given by p,o(f) = � (! ( 0) + f ( 1)). The underlying classical probability space is to be rediscovered in Ao as the set of two idempotents 1 { o } and 1 { 1 } where 1 A denotes the indicator function of a subset A of a given set. Ao is spanned also by the elements 1r
We now construct all injective *-algebra homomorphisms : Ao --+ A satisfy ing T,\ o = f-LO · In the sense of section 13.2 this means that we will find all abstract probability spaces (B, T,\ 1 13 ) which arc equivalent to (Ao, p,o). An easy calculation shows that they are given by := with 1r
1r
1rz
-
z
1
) = : Qz
13.3.
Quantum Bernoulli experiments
and linear extension, where Pz - Q z =
( � 0 ) = : Xz .
z E lC
193
is a parameter with l z l
= 1. n2 (X) =
In summary we have seen that the simplest quantum probability space (A. T.\) contains a one-parameter family (Az , T.\ IAJ of models of classical coin tossing. For w = eis, z = e it ( -n < s, t :<:: n) the commutator [Xw , X2] . = XwXz X2Xw is easily determined: [Xw , Xz] = 2 i
sin(s - t)
( � -� ) .
So Xw and X2 commute if w = z or w = -z. We obtain JE.\ ( [Xw , X2] ) = 2 i (2>. - 1) sin(s - t). The absolute value of it attains its maximum at - t = ±n /2. The pair (Xw , X2) with z = - iw is called a quantum coin tossing. It is unique up to automorphisms. More precisely this means the following: choose w = e it (t E] - n, n] ) , and consider the automorphism 1.{) on A given by I.{)( a) = u*au where 0 e- it/2 u. 0 e it/2 Then i.p(Xl ) = Xw ' i.p(X- i ) = x- iw and T.\ 1.{) = T.\ . So in the following we need only to consider the quantum coin tossing (X1 , X_ i ) . Notice that X1 = ax , X_i = ay and [Xw , X_,w]x = 2ia2 , where ax , a y, az denote the Pauli matrices. The following important matrices can be constructed by (ax , ay) : 1 0 1 . (13.3. 1 ) (ax + wy ) , b2 0 0 1 0 0 . (13.3. 2) b+ 2 (ax - wy ) , 1 0 1 0 0 ( 13.3.3) 1 - [ax , ay] · bo 0 1 2i Obviously the following formulae hold: s
_
(
( ( (
0
)
) ) )
ax = b+ + b - , ay = i · (b+ - b - ) , [b - , b+] = a2 = 1 - 2b0 , Xw = wb+ + wb - .
These formulae show that the random variables b+ and b- are in a certain sense more basic than Xw though they are not selfadjoint. As in the classical case we describe the experiment of n ( E N) independent coin tossings by the n-fold tensor product (A®n , T�n) . The algebra correspond ing to the k-th trial is described by the elements 1 129 · · • 129 1 ®x 129 1 129 · · · 129 1 = : X k '-v-" (k- 1 ) times ( n -k) times
'-v-"
194
13.
Quantum Bernoulli Experiments
where x E A is arbitrary. Describing k times repetition of our quantum coin tossing we obtain Sw. k := L;= l Xw1 . We have k [Sw ,k, s- iw, k] = 2i k·
La
J =l
z,
The pair (Sw, k l S- iw, k ) is called a quantum Bernoulli experiment. Setting Ak := A0 k ® 1 ® · · · ® 1 = {a ® 1 ® · · · ® 1 : a E A0 k } '-v-" '-v-" n - k times n - k times we obtain a natural filtering lC · 1 C A1 C · · · C An = A0n . Moreover there also exists a conditional expectation !Ek from An onto Ak which is given by IEk (a ® b) = T; ( n- k ) (b) · a , where b E A0 ( n- k ) , and linear extension.
13.4
The internal quantum processes
Now we consider a polysaturated model *V(JR:.) of the full structure V(JR:.) over JR:.. As usual we replace the standard integer above by an infinitely large integer N. Then all considerations in the previous section remain true for internal objects. We use the discrete time interval T = { � : 0 <:.:: k < N } denoting its elements by §., t, JJ . . . . Moreover we rescale also the family (Ak) by setting At- := ANt · Set p � JN · Then we introduce n
a±t_ a'l_ •
at
pbf , b'j , p
2
(0 �). 1
( 13.4. 1 ) ( 13.4.2) (1 3.4.3)
These elements are the internal increments by which we construct the basic internal stochastic processes A£ = L: o :S;�
( A i ) -t is called the internal creation process, (Ai )t the annihilation pro ( A! ) t the time process and finally (Ai)t th� �umber process. The internal Brownian motion corresponding to the parameter w E lC then is given by Bw,t wAt + wA_t ( l w l = 1 ) . It satisfies the internal difference equation dBw,t = w at+ + w at .
ce ss ,
13.4. The internal quantum processes
195
Like in the previous section we consider the state Tf: N obtain
T.\ ,N and we
JE.\,N ( Bw,t_ ) : = T,\,N ( Bw,t_ ) = 0, JE.\ ,N(B�,t. ) = t_.
(13.4.4)
The second equation follows from the facts that
((wa; wa-:;- ) 2 )
for §. # 11:, but T>-,N - + The commutator is
= T>-,N (1/N) =
1/N.
The so-called internal Ito-table for the increments is easily computed:
a• a+o a§. a;,
pa-2:a: I a0-; I a0-� I p2a-a:;; p2 a; 0 0 p2 a� 0 a+§. a§.o 0 0 a• a;, 0
p-tv =
A-� + lvi B-"-,t. + l v l 2 A-; lvl
s
s
§.
Let 0 # v E *IC be arbitrary. Then the process (P.�_) given by is called the Poisson Process with parameter v . Now we compute the characteristic operator functions of these pro cesses. Whenever V = (ifi)t_ is a stochastic process its characteristic oper ator function is defined by fv (u, t) = exp( i uvt), where u E *IF!:.. Obviously A ( t ) l u= O = iifi and fv ( u, t) is unitary iff Vi is selfadjoint . The processes V = (Vi) we considered so far are all of the form u,
Vi =
I: d§.,
O:S;§.
where
d8 = 1 Q9 · · • Q9 1 Q9 d Q9 1 Q9 · · · Q9 1 '-v--"' '-v--"' ' N13- 1 times N-N13 times and d E A is appropriately chosen. Since d'IJ,, dy_ commute for 11: # 1!. we obtain
fv (u, t)
=
@ (exp( i ud) ) 13• O:S:i3<.1.
13. Quantum Bernoulli Experiments
196
The most important formulas are the following ones:
@ (cos( pu)! + i sin(u)Xw).e_ O <;.s
13.5
From the internal to the standard world
The operator norm topology on A is too fine in order to obtain reason able nonstandard hulls. Moreover the processes discussed so far are internally bounded but not necessarily S-bounded. For example Bw, kjN is selfadjoint, hence its operator norm is equal to its spectral radius. This number is easily computed as )N, or in other words I I Bw.t. ll = VN · t In the following we only consider T;.. for >. = 1 . The other case will be treated elsewhere. We set T1 = : T and we construct the Hilbert space 7-{T corresponding to (A, T) (A the algebra of 2 2-matrices, see section 13.2) . To this end we denote the columns of the 2 2-matrix a by a = (ai , a�) . Then T(a* b) = (ai I bi ) where the latter is the canonical scalar product on IC 2 . Hence LT = {a : a � = 0} and nT (a) (b + LT) = abi + LT. In particular 7-{T S=' IC2 , where the isometric isomorphism is given by a + LT ---+ ai. We have previously introduced the random variable X1 ax . Its equiva lence class in 7-{T is denoted by xl = x l + LT We set eo = b�1 = ( 6 ) = xp and e 1 = b11 = ( ? ) = X1 . Now we consider TN = T® N Obviously 7-{TN S=' (*IC2)® N holds. Let w E {0, 1 }T be an arbitrary internal function. Then we define ew by e w = @�=[} e w ( k/N ) · The set {e w : w E {0, 1 V } forms an orthonormal basis in 7-{TN · 7-{TN is an internal Hilbert space, so its nonstandard hull if.TN is a Hilbert space. The formulae (13.3.1) up to ( 13.4.3) above lead to the following equations, which result from the fact that 7-{TN is the GNS-Hilbert space of (A N , TN ) · In order to make the formulae as simple as possible we denote the addition mod 2 by EB, i.e. we consider D = {0, 1 V as the cartesian product of the group (Z2 , EB). Then we set w + = 1r EB w and w - = w for w E {0, 1 }T . Moreover we write 1.t. in place of 1 {.1.} . x
x
=
13.5. From the internal to the standard world
197
With all theses conventions we obtain
w± (.t.) e
(13.5. 1)
w+ (.t.) ew - a - a + ew,
(13.5. 2)
VFJ wEB1t '
t t ----_;::;w (.t.) ew = N · ata-; ew. -
13. 5 . 1
(13.5.3)
Brownian motion
First of all we show that our internal Brownian motion ( Bw,t) leads to the standard Brownian motion on a subspace of HTN . To this end we recall that the standard Brownian motion (f3t) on L 2 ( D , L'") (with D = {0, 1}r, f-L f-LN f-L� N , L the corresponding Loeb measure) can be viewed as a family of multiplication operators f {3tf on L2 ( D L'") which are selfadjoint but unbounded (cf. the end of section 13.2) . From equation (13.4.4) it follows that Bw,t is S-bounded in 7-{N . We claim that classical Brownian motion (or better to say: Anderson ' s Brownian motion) is equivalent (in the sense of section 13.2) to our CBw , ot) where (Bw.ot) denotes the family of selfadjoint operators on a subspace of HTN coming from the family (Bw,t_). To this end let l w l = 1 and =
=
'"
f---+
,
Po = � 2
( -w
-w 1
l
).
For w E n we set Pw = @o-::;. k < N pw ( kjN) · It follows TN (Pw) = 2 - N = !-L({w}) . We denote the internal W*-algebra generated by {Pw : w E {0, 1}T} by B ( w ) . The formula p bw ,t .· - - - (P1 - - p1 ) w at+ + w at t - 2 t , shows that ( Bw t) L o < s < t bw.t is contained in B ( w). The internal L= -sp;-e -L= (n, f-L) is nothing else than L=({0, 1}, f-Lo) 0 N . Thus it is not very hard to see that 11N := 11� N (see section 13.2) maps L= (n, f-L) onto B(w) with TN 11N IB (w ) = f-L. Now let D = {f E L= (n, f-L) : f is S-bounded} . Then -
=
+
c
o
11N ( D ) C {a E AN : llall is S-bounded} C { x E 7-{TN : llxll 2 = VT ( x* x ) is S-bounded}.
Moreover for j, g E D we have
13.
198
Quantum Bernoulli Experiments
because of 1rN (Jg) = 1rN (j)*nN (g) . Since L 2 (D, L'") is the completion of ef : f E D} the mapping 0/ ---+ ;;;(}) can be extended to a linear isometry U from L2 (D, L'") onto a subspace M , say, of 7-{TN · For t E [0, 1] set t min{§. E T : §. > t}. We show that U(f3t ) Bw, t · Defi ne =
Yt
(w)
=
{ -11
=
w(.t.) w(.t.)
=
1 0 =
and l'i = }N L O :S.£oc f3t li\1n = f3t holds in L2 (D, L'") . Therefore for every standard E > 0 there exists a standard no with llf3t(1D - 1 Mn ) ll 2 < E for n 2 no standard. But this in turn implies 11Yt(1D - 1 MJ ll 2 < E for n standard, n 2 no . Since 7rN is an isometry also for the internal L 2 -norm on 7-{TN we obtain IIBw, t7rN(1 D - 1 Mn ) ll 2 < E for these n 2 no. I I Bw. t 7rN (1 Mn ) l l 2 = I I Yt1 Mn ll 2 � n implies that Bw, t 7rN ( 1 M, ) E 7-{TN ,fin and U(f3t 1 MJ Bw ,t--;;;{i AJJ . But this in turn gives U(f3t) = Bw, t · That the operator of multiplication by f3t is mapped onto the operator of multiplication by Bw ,t follows from an easy additional argument. =
13.5 . 2
The nonstandard hulls of the basic internal processes
The deeper problem is to find a joint subspace JC of HTN such that all pro cesses have standard parts as closable operators densely defined in JC. We begin the construction with some more notations: For w E { 0 , 1}T =: D we set Mw = {.t. : w(.t.) = 1 }, and lwl := I Mw l , that is the (internal) car dinality of lvlw . Using these notations we obtain the following formulae by means of ( 1 3.4.4)-(13.5.2) . Let y LwED Yw ew be arbitrary. Then =
A_t y Aiy Aty Az y
L �L O:S,s.
) ( L( L ) ) L (� L ) L (� L w
+
( •)
(13.5.4)
Yw'w
wED
wED
tpED
O:S,s.
w (')
O:S,s.
(13.5.5)
Yw'w
11,an,'P- ( •)
1!,an,'P
+
(,)
'"
(1 3 . 5 . 6 )
'"
(13.5. 7)
13.5. From the internal to the standard world
199
Consider now the projection IE.t. from 7-{ onto 1-l.t. which is the Hilbert space coming from A..t. (see section 13.3 ) . IE..t. is given by lEt- ( ew ) Then we obtain IE_.t.A�
=
{ ew 0
w (�) = 0 for all � 2> t
else
A�IE..t. for each rt E family (A�h< 1 is ada�ted t� (H..t.h < 1 ·
{ • , o, + , - }
=
or in other words the
We prove now some continuity properties. To this end we introduce 7-{ ( n)
:=
{ L Yw ew : Yw E *lC} l w l= n
and we set 7-{ : = 7-{TN for short. Then 7-{ = 1_;{= 0 7-{ (n) where _i denotes the orthogonal direct sum. More over A; (H( n) ) C 7-{ ( n) Ai (H( n) ) C 7-{ ( n) Ai (H( n ) ) C 7-{n + 1 , and finally Ai- (H( ;;:) ) C 7-{ ( n-1 ) where 7-f ( -1 ) := {0 } = : 7-{ ( N+ 1 ) . For y = L l w l =n Yw ew and 0 :S §. < t we obtain ,
,
L I� L
II A� y - A� y ll 2
lw l =n
§."5cy
w+ ( s ) I 2 1Yw l 2
1 1 2 1 Yw l 2 L L I� "5cy <.t. w
<
=
( t - �) 2 II Y II 2 . (13.5. 8)
l l=n §. It follows that II A; - A: ll :S (t - §.) , in particular the mapping t S-continuous from -T to L(H) with respect to the operator norm. Let Y = L l w l = n Yw E 7-{ ( n) , and 0 :S � < t
II Ai y - A� y ll 2
=
L(L
l w l=n §."5cY.<.t.
f---+
A� is
w( �) r1Yw l 2 ·
It follows that II A� IJt(n) I :S but the mapping t A�y is not S-continuous in general. So finally we have to choose an appropriate subspace in order to get S-continuity of t --+ A�y. Next we show the following inequality: n,
Proposition 1
holds.
For- 0 :S � < t
f---+
(13.5.9 )
13. Quantum Bernoulli Experiments
200 Proof.
Let y = L l w l = n Ywew E Ji( n ) be arbitrary. Then
holds. If ip(u)
=
0 then
l iP
EB
t,,,l
=
<
n + 1 hence Y'Pffil:Yc
=
0. It follows
n+1 N
Let w E D be arbitrary with lwl = n . Then there exist at most N(t. - ..s.) - lw · 1 [� ,![ 1 different ip with ip EB 11' = w and .§. :S 1J < t_. This gives I (Ai - A! ) Y II2 :S D N (t;�) ( n + 1 ) II Y II2, and the asserted inequality follows. Corollary 1
( 13.5. 1 0)
Ai is the adjoint of Ai. By co�struction we have 'H( n) l_Ji( m ) for n # So the subspace JC= of H , generated by all the spaces i{( n ) ( n E N) is nothing else than the orthogonal direct sum JC= = l_ n ENo i{(n ) . Recall the definition t = min{JJ E T : > t.}. Proof.
m.
Then from the inequality (13.5.8) it follows that by
1J
A;,n Y (A[,ny ) /\ there is uniquely defined an operator on i{( n) bounded by t. So we obtain the operator A� = l_ n ENo At . n on JCoc which is selfadjoint and bounded by t. Moreover I I A� - A: II :S t - holds. D In order to define the nonstandard hull of one of the other operators A-� (� E { +, - , 0}) we choose the following joint domain of definition: JC� : = { Y E }(00 : Y = l_n ENo Yn, Yn E i{(n ) , � nll :iJn ll § < 00} =
s
which is dense in JC=. From the inequalities (13.5.9) to (13.5.10) we obtain that by
13.5.
201
From the internal to the standard world
:
the operators A� K0 --+ K 00 are uniquely defined. Moreover the following proposition holds: Proposition 2
A�
is selfadjoint and Ai and Ai are adjoint to each other.
Proof. Set At n = A� I joint, whereas Atn and is obvious.
H17• These operators are bounded and A�, n is selfad A�( n+ l ) are adjoint to each other. Now the assertion D
The final problem we have to solve is to find an appropriate filtration with the necessary conditions of continuity. To this end we calculate the difference IE.t - IE.e_ for :<:: §. < t For y E 7-{ ( n) we obtain
0
_e.
(IE_t - IE Let t. =
)y =
k/N, = l/N. It follows §.
l
1 Yw 2
l w l = n , w9 [o: ..t[
l
max 1 Yw 2
<
lwl = n
(k n- l)
17 max 1 Yw 2 Nn (t_ - §.)
l
lwl =n
•
n 1 1 (1 - k --l ) · · · ( 1 - k -- l ) . I
So the mapping y --+ IE.tY will be S-continuous if max lwl = n Yw 1 2 N17 will be finite. This consideration leads to the internal measure m on D = given by m ( w } ) = NL . Then (D, m) is the direct sum of (D17, mn)n :5o N with Dn = = and mn = m bn · Notice that m(Dn) = (�) · Jn , so that N m(D) = L�= O ( � ) · = ( + it ) :::::J e. Moreover L�= L m(D k ) :::::J for all L :::::J oo. Let (D, Lm) be the Loeb measure space associated to (D, m) . Then D ) = e and D is an Lm - null set. Finally L 2 (D, Lm) � _l n N L (D17 , LmJ where Lmn is the Loeb measure associated to m17 • Consider the external subspace of all S-bounded internal *complex val ued functions on D . Then for E the complex-valued function : --+ is in L 2 (D. Lm) and the space E is dense in L 2 (D, Lm) . Mor eover = 0fk in the L2 -sense, where = Now we map onto a subspace Y of 7-{ by the mapping V defined as follows: ( ) - I wl / 2 ew , V( ) =
{ {w E D : l w l
n}
Jk
Lm (Uk EN k E 2 0( j (w ))
0f
1
{0 . 1 }T 0
\ (U kE N Dk)
X f X
LkENo
X
ef : f X} fk f Ink .
f Lfw N wED
°f
w
13.
202
Quantum Bernoulli Experiments
and set
W(j) = 0]). Then Jr2 l f l 2 dm II V ( f ) ll 2 . Let .C b e the closure o f {W(j) : f E X} = : .[( b) in JC=. Then the last equation shows L2( D, Lm ) � .C. Moreover Xk = {f E X : f ( De ) = 0 for £ # k} is mapped onto a subspace of Ji ( k) ( k standard) . Let .C k be the closure in JC= of {W(f) : f E Xk } =: .C�b) . Then .C = ..lkENLk and .Ck � L 2( D b Lm k ) . The following facts arc easily seen to hold:
Theorem 1
_c k(b) .Ai• _c k(b) Aio _c k(b) .A �+ _c (b) k .A - _c k(b) �
c JC'ff for k E No c .C k c .C k c _c (b) k+l
c .c�bl_l .
Moreover .C n JC0 is dense in .C and it is the joint domain of definition of the operators A� , � E { +, - } which are closable and essentially selfadjoint in case � = and adjoint to each other in case � = +, - . •, o,
•, o,
Remark: We map an internal set !vi of T onto its indicator function This mapping 7/J is bijective and therefore we obtain an isometric isomorphism U of m ) onto the internal Guichardet space of Leitz-Martini. This shows that our considerations concerning the continuity of the filtering leads in a very natural manner to the Loeb-Guichardet space for the basic quantum stochastic processes cf. section 13. 1).
1M E {0, 1 }T =
D.
L2( D,
(
13.6
The symmetric Fock space and its embedding into .C
Let 'H be a Hilbert space and let 'Hr:om be the nth tensor product of 'H . We denote the full symmetric group of n elements by Then by
§n .
there is uniquely defined an orthogonal projection, the range of which is called the nth symmetric tensor product The symmetric Fock space
JiO n .
13.6.
The symmetric Fock space and its embedding into .C
203
+ ( H ) over H is the orthogonal sum :F+ ( H ) = l_':= o H O n where as usual H O 0 lC. For the special case H = L 2 ( [0, 1], >.) (>.: Lebesgue measure) the tensor n
:F
=
product H® is nothing else than L2 ( [0, 1] 71 , .\71 ) where A 71 denotes the dimensional Lebesgue measure. and the projection Pn is given by
n
Now we give the more or less classical definition of the basis quantum processes. To this end we set
h o · · · fn : = Pn ( h Q9 · · · � fn ) · 0
For
0 :S t
<
1
the definition of the creation operator is given by
Ai (( h · · · fn ) : = 1 [o, t [ h · · · fn 0
0
0
0
0
(13.6. 1)
and linear extension t o the largest possible domain. Similarly the annihilation operator is given by
n Ai ( h o . . . o fn ) = L (1 [o, t [ l fJ ) h o . . . o jj o . . . o fn , J= l
(13.6. 2)
where the expression jj indicates that this factor is omitted. The number operator is given by
A� (fl o · · · o fn ) = 1 [o, t [ · fl o · · · o fn + · · · + fl o f2 o · · · o fn - l o 1 [o, t[ · fn , (13.6. 3) whereas the time-operator is
A� (h o · · · o fn ) = t fl o · · · o fn ·
(13.6.4)
Remark: These operators are those ones introduced by Hudson and Parthasarathy [5] as the basic quantum processes. Consider now the set Xn = {(t 1 , t 2 , . . . , t n ) : 0 :S t 1 < · · · < t71 :S 1}. It is a measurable subset of [0, 1] 71 • Let f be an element of L 2 (X71, .\ 71 ) . Setting
f-( t 1 , · · · , tn ) =
{ OJ (t 1 , . . . , tn)
(t 1 , . . . , t n ) E Xn
otherwise
13 . Quantum Bernoulli Experiments
204
we obtain an element j of L 2 ( [0 , l]n, An) . Then Pn (]) E L 2 ( [0, l] , A) O n and II Pn (]) ll 2 = fxn l l 2 An , i.e. llfll = II Pn (]) ll holds. On the other hand let E L2 ( [0, 1] , A )0 n be arbitrary. Then = Pn (jl xn ) (equality in the L2sense) . It follows that the mapping ---+ Pn (]) is a linear isometry from L2 ( Xn , An) onto L 2 ( [0, 1] , A) O n. Its inverse is given by 91 xn =: Un (g ) . Now we embed L2 (Xn , An) isometrically into the space Ln constructed at the end of the previous section. To this end let w E Dn be arbitrary. Set (w) = min(� : w(�) = 1) and by induction �k+ 1 (w) = min(� > h : w(�) = 1). Then I(w) := (h (w) , . . . , �n (w)) E *Xn n Tn . Moreover if f := (kl /N. . . . , kn/N) E *Xn n Tn then f = f( w) for w = 1 M where M = {h (w) , . . . , �n (w) }. We consider the dense subspace Cn of L2 (Xn , An) consisting of the re strictions to Xn of continuous functions on the closure Xn . For E Cn we set S(f) (w) = * (f(w)) . This is an element of L2 (D n , mn ) satisfying l l f l l 2 :::::J II S(f) ll 2 · It follows that Cn is linearly and isometrically embedded into L2(D n , LmJ , and this embedding can obviously be extended to the whole of L2 (Xn , An) . Since L2 (D n , Lmn ) is linearly and isometrically embedded in Ln , we obtain that the symmetric tensor product L2 ( [0, l] , A) O n can be em bedded in Ln . An obvious extension then yields an embedding denoted by U of the symmetric Fock space F+ ( L2 ( [0 1 ] , A) into £. Call y the image of this embedding and set Yo = G n K0 .
fd
f
f
f n!
g n! --->
t1
f
f
,
2 Yo is dense in y. Moreover the restrictions of A� to Yo yield closed densely defined operators which are selfadjoint for � E { •} and adjoint to each other in the other cases and which moreover satisfy
Theorem
on u- 1 (Qo) where to (13. 6.!J
o,
A�
aTe the operators given by equations
(13. 6. 1)
'UP
The proof is obvious.
References [ 1 ] R. M . ANDERSON, "A nonstandard representation for Brownian motion and Ito integral", Israel .J. Mathern. , 25 15-46. [2] S . ATTAL, Approximating the Fock space with the toy Fockspace, in .J. Azema, I\1 . Emery, M. Ledoux, I\L Yor (eds.), XXXVI, Lecture Notes in Mathematics 180L Springer-Verlag, Berlin New York, 2003.
Seminaire de Probabilites
References
[3] A.
GUICHARDET,
205
Symmetric Hilbert spaces and related topics, Lecture
Notes in Mathematics 26L Springer-Verlag, Berlin, 1972.
[4] R.
L . HUDSON and J . M. LINDSAY, "A noncommutative martingale rep resentation theorem for non-Fock- Brownian motion", .T . Funct. Anal., 6 1
(1985) 202-221 .
[5] R.
R . PARTHASARATHY , "Quantum Ito ' s formula and stochastic evolutions", Comm. Math. Physics, 93 (1 984) 311-323. L. HUDSON and K .
[6] R.
L. HUDSON and R. F. STREATER, "Ito ' s formula is the chain rule with Wick ordering", Phys. Letters, 86 ( 1982) 277-279.
[7]
"Structure des cocycles markoviens sur respace de Fock", Prob. Theory Re. Fields, 75 (1987) 291 -316.
.T . L . .T OURNE.
[8] B .
KDMMERER and H. MAASSEN , "Elements of quantum probability", Quantum Probab. Communications, QP-PQ, 10 (1998) 73-100.
[9]
H . MAASSEN, Quantum Markov processes on Fock space described by integral kernels, in L. Accardi, W. von Waldenfels, Lecture Notes in Math ematics 1136, Springer-Verlag, Berlin. New York, 1985.
Quantum probability and applications II, Proceedings Heidelberg 1984, [10] M. LEITZ-MARTINI. Quantum stochastic calculus using infinitesimals, Ph.-D. Thesis, University of Tubingen, 2001 . [11] P . A . MEYER. Quantum probability for probabilists, Lecture Notes Mathematics 1 538, Springer-Verlag, Berlin, New York, 1993.
[12]
m
K. R. PARTHASARATHY, The passage from random walk to diffusion in quantum probability, (1988) , Ap plied Probability Trust, Sheffield, 231 - 245.
Celebration Volume in Appl. Probability [13] K. R. PARTHASARATHY, An introduction to quantum stochastic calculus, Birkhauser. Basel, 1992.
Applications of rich measure spaces formed from nonstandard models Peter Loeb*
Abstract \i'Ve review some recent work by Yeneng Sun and the author. Sun'i:l work shows that there
are
results, some used for decades without a rigourous
that arc only true for spaces with tho rich structmo of Loeb measure spacel:l. His j oint work with the author uses that structure to extend an important result on the purification of measure valued maps. foundat.ion,
14. 1 In
Introduction 1975 [ 1 1] ,
the author constructed a class of standard measure spaces
fanned on nonstandard models.
These spaces, nmv called "Loeb spaces" in
the literature, arc very close to the underlying internal spaces, and ru·c rich in
s t ruc t ure.
(Sec
1 121 by Yeneng Sun
the author's throe clmptcrs and Osswald's two chapters in
for background. ) 'vVe will briefly review here some recent work
that uses these measure spaces. Sun has shown that there are results, some
used in applications for decades without a rigorous foundation, that are only true for spaces with the rich structure of Loeb measure spaces. We will fol l ow the description of Sun'::; work with a detailed proof of a special case of t.hc recent
result in
[H] by Yeneng Sun and the author on A counterexample shows that the
valued maps.
the purification of measure
result we give is false if the
Loeb space we use is replaced by the unit interval with Lebesgue measure. We
note in passing hero that the result in
[13]
by Osswald, Sun, Zhang and the
author presents yet another example needing rich measure ::;paces.
*
Department
of
Mathematics, 'University
loeb@math. uiuc . edu
of
Illinois, Urbana, IL 61801.
14.2. Recent work of Yeneng Sun
14.2
207
Recent work of Yeneng Sun
We begin with some work in the late 1990's of Yeneng Sun ( [16] , [17] , [18] , and Chapter 7 of [12] ) . That work, Sun's alone, is published elsewhere, so what is said here is an invitation to read, and not a substitute for, the original articles. To set the background we consider the following question: Does it make sense to speak of an infinite number of independent individuals or random variables indexed by points in a uniform probability space? Can one, for example, reasonably consider an infinite number of independent tosses of a fair coin with the tosses indexed by a uniform probability space, and if so, does it make sense to say that half the tosses should be heads? Of course, there is no problem in speaking of independent random variables indexed by the first integers with each integer having probability 1/ An infinite index set with a uniform probability measure, however, must be uncountable; there is no uniform probability measure on the full set of natural numbers. The problem thus evolves to finding the possible meaning of an uncountable family of independent random variables. Whatever way one approaches this problem, the usual measure-theoretic tools fail. A natural attempt to generalize coin tossing replaces the natural numbers with points in the interval [0, 1], and thus replaces sequences of 1 ' s and - 1 ' s with functions from [0, 1] to the two-point set { -1, 1 } . This is a reasonable model for an uncountable family of independent coin tosses. In 1937, Doob [2] exhibited a problem with this and similar spaces of functions when standard techniques arc applied. To sec the problem, let denote the set of { - 1, 1 } valued functions on [0, 1] , and let be the product measure on constructed from the measure taking the values 1 / 2 at 1 and 1/2 at - 1 . In the usual construction of an appropriate a-algebra on measurable sets are formed from the algebra of cylinder sets, with functions in each cylinder set restricted at only a finite number of elements of [0, 1] to take either the value 1 or - 1 . It follows that each measurable set in is determined in a way described below by a countable subset of [0, 1 ] , and so the following result holds.
n
n.
P
D
D
D,
D Proposition 14.2.1 Fix any h E D. Set Mh := {w E D : w(t) = h(t) except for countably many t E [0, 1 ] } . Then Mh has P-outer measure 1 . Proof. For each measurable B � D, there is a countable set C [0, 1] such that for all o:, (3 in D, if o:(t) = (3 (t) for all t E C, then E B if and only if (3 E B. Suppose Mh � B . Given w E D, Let w' agree with w on C and agree with h on [0, 1] \ C. Then w' E Mh, so w' E B. It then follows that w E B . Thus B = D, so the outer measure P*( Mh ) = 1 . a
C
D
14. Applications of rich measure spaces
208
Remark 14.2.2 Note that if w E lvh, then since Lebesgue measure A of a countable set is 0, w = A-a.e. on [0, 1 ] . This is true if is nonmeasurable, or if 1, or if - 1 . Now outer measure when applied to the intersection of measurable sets with Mh is finitely additive, hence countably additive. Since the outer measure of Mh is 1 , one can trivially extend P to a measure P with P(Mh) = 1 . Thus, no matter what might be, one can claim that P almost every function is equal to at A-almost very point of [0, 1]. This, and other highly questionable arguments have been used for decades to work around the measure theoretic problem indicated by Doob's example.
h
=
h
=
h
h
h
h
Another approach to representing a continuum of independent random vari ables is to consider a function w , called a process, where is an index from an uncountable probability space called the parameter space (the probability measure need not be uniform) and w is taken from a second probability space called the sample space. The question then is whether it makes sense to work with the usual product of these two probability spaces. Sun has shown in Proposition 7.33 of [12] that no matter what kind of measure spaces, even Loeb measure spaces, one might take as the parameter space and sample space of a process, independence and joint measurability with respect to the classical measure-theoretic product, i.e. , formed using measurable rectangles as in [15] , are never compatible with each other except for a trivial case. Here is the exact statement of that proposition.
f(i, )
i
Let (I, I, ) and (X, X, v) be any two probability spaces. Form the classical, complete product probability space (I x X, I 129 X, 129 v ) . Let f be a function from I x X to a separable metric space. If f is jointly measurable on the product probability space, and for 11-almost all (i 1 , i 2 ) E !xi, h and fi2 are independent (call this almost sure pairwise in dependence), then, for tt-almost all i E I, f( i. ) is a constant f1m ction on X. Proposition 14.2.3 (Sun)
f1
f1
f1 129
·
Sun notes that Proposition 14.2.3 is still valid when f1 has an atom A . The almost sure pairwise independence condition implies the essential constancy of the random variables fi for almost all i E A. In the articles cited at the beginning of this section, Sun has shown that a construction overcoming these measure-theoretic problems is obtained by forming the internal product of internal factors, and then taking not just the Loeb space of each factor, but also the Loeb space of the internal product. This yields a rich extension of the usual product a-algebra formed from the Loeb factors, one that still has the Fubini Property equating the integral over the product space to the iterated integrals over the factor spaces forming that product. Here in more detail is that construction.
14.2. Recent work of Yeneng Sun
209
Sun's starts with internal spaces ( T, T, A) and ( D, A, P) . The space T may be a hyperfinite set with A given by uniform weights. He then forms the Loeb spaces (T, L>. (T) ) ) and (D, L!L (A) , P ) . He lets A Q9 P denote the internal product measure, while T Q9 A denotes the internal product a-algebra, and L>. (T) Q9 Lp (A) denotes the classical product a-algebra formed from L>. (T) and Lp (A) as in [15] . On the other hand, forming the Loeb space from the internal product T Q9 A produces a larger a-algebra L>.0P (T Q9 A) on T n . ( Sec the following propositions. ) Here arc some properties of what we shall call the big product space (T x D, L>.0p (T Q9 A) , �) . X
The big product space depends only on the Loeb factor spaces (T, L>. (T) , >:) and (D, Lp (A) , P) . Proposition 14.2.5 (Anderson [1] ) If E E L>. (T) Q9 Lp (A) , then E E L>.0p (T � A) and � (E) = ); ® P(E) . Proposition 14.2.6 (Hoover (first example) , Sun [ 1 7] ) The inclusion of L>. (T) Q9 Lp (A) 'in L>.0P (T Q9 A) is strict if and only if both ); and P have non-atomic parts. Proposition 14.2. 7 (Keisler [6] ) A Fubini Theorem holds for the big prod uct space, Proposition 14.2.4 (Keisler-Sun [7] )
In his articles, cited above, Sun shows that to work with independence in a continuum setting, as has been attempted in informal mathematical applica tions without rigor, and for decades, one needs a rich product a-algebra such as the a-algebra of a big product space. Here is that general result as stated in Proposition 7.4.1 of [12] and proved in Theorem 6.2 of [17] .
Let X be a complete, separable and metrizable topological space. Let M (X) be the space of Borel probability measures on X, wher·e M(X) is endowed with the topology of weak convergence of measures, Let be any Borel probability measure on the space M(X) . If both ); and P are atomless, then there is a process f from (T n , L>.0P (T Q9A), GP) to X such that the random variables ft = f ( t, ) are almost surely pairwise independent (i,e,, for �-almost all (t1 , t2 ) E T x T, fh and ft2 are independent ), and the probability measure on M(X) induced by the function Pft- 1 from T to M (X) is the given measure Remark 14.2.9 Here, for any given t E T, P ft- 1 is the probability measure on X induced by the random variable ft D ---+ X. It is the measurable mapping from T to M (X) taking the value P ft- 1 at each t E T that induces Proposition 14.2.8 (Sun) f-L
·
X
f-L .
:
the measure f-L on M (X).
14. Applications of rich measure spaces
210 Remark 14.2.10
(
A consequence of the proposition is that when the space
T. L>.. (T), :\) is a hyperfinite Loeb counting probability space and 'ji is a non
atomic Loeb probability measure, it makes sense to use the big product space as the underlying product space for an infinite number of equally weighted, independent random variables or agents. As part of his work with large product spaces, Sun has extended the law of large numbers. The usual strong law states that if random variables Xi , E N, are independent with the same distribution and finite mean m, then � L:i= l Xi tends almost surely to the constant random variable m. That is, for almost all samples the value of the sequence at tends to the constant m.
i
w, w Theorem 14.2. 1 1 (Sun) Let f be a real-valued integrable process on the big product space. If the random variables ft := f(t, ·) are almost surely pair wise independent, then for almost all samples w E D, the mean of the sample function fw := f(·,w) on the parameter space T is the mean off viewed as a random variable on the big product space. There is no requirement of identi cal distributions. Another facet of this same work deals with independence. It is well known that for a finite collection of random variables, pairwise independence is strictly weaker than mutual independence. Sun has shown that for processes on big product spaces, pairwise independent and mutual independent coalesce. and they coalesce with other notions of independence that are distinct for a finite number of random variables. This implies asymptotic results for finite families of random variables where the families are ordered by containment and have increasing cardinality.
14.3
Purification of measure-valued maps
We now turn to a special case of the joint work of Yeneng Sun with the author in [14] . That special case generalizes the following celebrated theorem of Dvoretzky, Wald and Wolfowitz (see [3] , [4] , [5] ) .
Let A be a finite set and M(A) the space of probability measures on A. Let (T, T) be a measurable space, and I-Lk ! k = 1 , · · · , finite, atomless signed measures on (T, T) . Given f : T ---+ M (A) so that for each a E A, f( ·) ( {a}) is T-measurable, there is aT-measurable map g : T A so that for each a E A, and each k l f(t)({a})df-Lk (t) = f-Lk ({t E T : g(t) = a}). Theorem 14.3.1
m,
---+
:<:: m,
14.3. Purification of measure-valued maps
211
This theorem justifies the elimination, i.e., purification, of randomness in some settings. For example, in games, T represents information available to the players, and A represents the actions players may choose, given E T. Every player�s objective is to maximize her own expected payoff, but that payoff depends on the actions chosen by all the players. For each player, a mapping from T to A is called a pure strategy. A mapping from T to M (A) is called a mixed strategy; in this case, each player chooses a "lottery on A". A Nash equilibrium is achieved if every player is satisfied with her own choice of strategy given the choices of the other players. In quite general settings, such an equilibrium can be achieved using mixed strategies. When results such as Theorem 14.3.1 apply, those mixed strategies can be purified yielding an equilibrium with the same expected payoffs. We re fer the reader to [14] for more information on the game-theoretic consequences of Theorem 14.3.1 and its extension. We will concentrate here on the proof of that extension, a proof simpler than that of the more general result in [14] . We extend the DWW Theorem from a finite set A to a complete, sepa rable metric space. There always exists a Borel bijection from such a space to a compact metric space. That is, if A is uncountable, then it follows from Kuratowski's theorem (see [15] , p. 406) that there is a Borel bijection from A to 1]. On the other hand, for a countable set A, one can use a bijection from A to {0, 1 , 1/2, . . , 1 / , . . . } . Therefore, it suffices to let A be a compact metric space. For simplicity we will work with a finite set of measures, but may extend to a countable collection.
t
[0,
. n
Let K be a finite set, and let A be a compact metric space. For each k E K, let be a nonatomic, finite, signed Loeb measure on a Loeb measurable space (T, T) . If f is a T-measurable mapping from T to M (A), then there is a T -measurable mapping g from T to A such that for each k E K and for all Borel sets B in A, f f (t ) ( B) ( dt) = (g- 1 [Bl) . This is equivalent to the condition that for each k E K and for any bounded Borel measurable function e on A, l l B( a)f(t)(da )f-Lk( dt) l B(g( t )) !-Lk (dt). Theorem 14.3.2
f-Lk
r
f-Lk
f-Lk
=
Example 14.3.3 Sun and the author show by a counter example in [14] that the Loeb measures of the theorem cannot be replaced with measures absolutely continuous with respect to Lebesgue measure on [0, 1 ] . In their example, the compact set A is the interval [ -1, 1], and the measure-valued map is given by E [0, 1 ] . The example uses just two measures, : = (5t + L t )/2 for each /-L l = >. on [0, 1 ] , and f-L 2 = 2 >. on 1]. If there is a function that works, then it is not hard to see using the functions on A given by and
f(t)
t t [0 ,
g B(a) l a l B(a) a2 =
=
14. Applications of rich measure spaces
212
(t l g(t)1 ) 2 >.. ( dt) g
g(t )
that J01 must take the value t or - t >..- a.e. = 0. That is, on [0, 1 ] . It is also not hard to see that this is impossible. The moral is that a Lebesgue measurable can't switch values on [0, 1] fast enough to work.
fik
To set up the proof of the theorem. we let be the signed internal measure generating for each k E K. Also, we set Po = where is the internal total variation of and c = Then Po is an internal probability measure on and for each k E K, < < Po . Let The probability measu � P is the Loeb measure generated P=
f-Lk
fik
T,
st(c) L.kE K l f-Lk 1.
f-Lk f3k
�L.k EK 1/ikl , L.kEK 1/ik I (T). fik
f3k f-Lk
1/ikl
by P0 , and for each k E K, < < P. Let be the internal Radon-Nikodym derivative of with respect to Po . Since < < P, is S-integrable with � respect to Po and := st is the Radon-Nikodym derivative of with respect to P. We let B denote the collection of Borel subsets of The following lemma is the only part of the proof that needs nonstandard analysis.
fik
f3k
{ik
A.
f-Lk
Let { ¢, : i E N} be a countable, dense (with respect to the sup norm topology) subcollection of the continuous real-val1Led functions on A. As sume that there is a sequence ofT-measurable mappings {gn , n E N} from T to A such that for each i E N and k E K, the sequence c/J2 (gn(t)) f3k (t)P(dt) converges; let c,,k E rn:. denote the limit. Then, there is aTfr-measurable mapping g from T to A such that for each i E N and k E K, l c/J, (g(t)) f3k (t ) P (dt) ci k Proof. For each n E N, let hn : T ---+ *A be a To-measurable lifting of gn with respect to the internal measure Po . Then for each and i E N and each k E K, Lemma 14.3.4
=
,
·
n
and so
�i�
n --t CXJ
( l l *¢i(hn(t)){ik (t)Po(dt) - i,k l ) st
c
hn
= 0.
Using N 1 -saturation, we may extend the sequence to an internal sequence and choose an unlimited integer H E *N so that for every E N and each k E K,
The desired function
t E T.
i
g is obtained by setting g(t) := st (hH ( )) E A at each t
D
14.3. Purification of measure-valued maps
213
( )
Now for the proof of Theorem 14.3.2, we note first that since M A is a compact metric space under the Prohorov metric p which induces the topol ogy of weak convergence of measures , there is a sequence of simple functions Un } �= l from T, T to M A such that
(
)
( )
(
)
Vt E T, nlim p (jn (t) , j(t)) = 0. ---t oo Assume we know that for each E N, there is a T-measurable mapping n
9n from T to A such that for each k E K, and any bounded Borel measurable function e on A ,
fr l e(a) fn(t) (da)p,k (dt) = fr e(gn(t))!Lk (dt) .
Let g = { cPi : i E N} be a countable dense subset of the continuous real-valued functions on A with the sup-norm topology. For a given cPi E g and each t E T, A ¢� (a)fn (t) (da) ----+ A cjJ, (a)j (t) (da) . Moreover, each integral is bounded by the maximum value of l¢i l on A , so by the bounded convergence theorem, for each k E K,
f
f
L cPi (gn (t) )fJk (t)P(dt) L cP2 (gn (t))tLk (dt) = L l cPi (a)fn (t) (da)p,k (dt) ----+ L l cPi (a)j (t) (da)p,k (dt) =
By the lemma, there is a T-measurable mapping g from T to A such that for each k E K,
L cPi (g(t) )tLk (dt) = L cPi (g(t) )f3k (t) P(dt) = L l cPi (a) j(t) (da)tLk (dt) .
Since this is true for each cPi in Q, it is true with cPi replaced by an arbi trary bounded Borel measurable function e on A. Therefore, without loss of generality, we may assume that f : T ----+ M A is simple. Next, we fix a sequence of Borel measurable, finite partitions pm { A , . . . , A } of A such that the diameter of each set in Pm is at most 1/2m , and Pm + l is a refinement of Pm . Also for each l, 1 ::; l ::; lm , we pick a point a[ E A . Since f is a simple function from T to M A , there is a T-measurable partition { Sj }f= l of T such that f = "'/j E M A on Sj . It follows that for
( )
1
=
Z:
[
( ) ( )
14. Applications of rich measure spaces
214
each B E B, and each k E K, fr f(t ) ( B ) p,k (dt) = Lf= l "(j ( B ) p,k(Sj ) . By Lyapunov's Theorem, each 51 can be decomposed by a finite, T-measurable partition {Tf' m , . . . , Tz:":'} so that for every l :::.; lm and k E K, f1k (Tf 'm ) = ,.YJ (A[ )p,k (Sj ) , whence
l j(t) (A[ ) p,k (dt) f; "(j (A[n ) !1k ( Sj ) =
N
N
=
( )
L /1k Tf 'm . j= l
(As an alternative to the above use of the Lyapunov theorem, one can with small modifications of the proof here use the author's Lyapunov theorem [10] , but then all of the simple functions must be modified on a P-null set T0 so that for each of them, the corresponding partition sets Sj of T are internal. ) Now for each m 2: 1 , we define a T-measurable mapping 9m : T ----> A so that for each l :::.; lm and each j :::.; N, 9m ( t) = a[ on T/'m . For each continuous, real-valued 7/J on A , for each m _2: 1 and each k E K,
lm N
= L L ( 7/J (a [ )rj (A[ ) ) f1 k (Sj ) l=l J = l
lm N
( )
= L L 7/J (a[ ) !1 k T/'m l=l j = l
approximates as m ----> oo the integral
£ (l >/� (a)f(t) (da) ) Mk (dt)
�
·
·
t, £ (1r t, � 1, (1r
)
>,b (a) j(t) (da) �k (dt)
)
>,b(a) o, (da) Mk (dt ;
215
References so
1/J (a[ ) !Lk (Tzj,m ) ----. L (1 1/J (a)j(t)(da) ) fLk (dt) It follows from the lemma that there is a T-measurable mapping g from T to lm N =LL l=l j = l
A such that for each k E K and for each continuous real-valued function e on A from a countable dense set of such functions, and therefore for each bounded Borel measurable function e on A,
L B(g(t))tLk (dt) L l B(a)j(t)(da) fLk (dt). =
D
References [1] R. M . ANDERSON, "A nonstandard representation of Brownian motion and Ito integration", Israel J . Math . , 25 (1976) 15-46. [2] .T . L . D ooB, " Stochastic processes depending on a continuous parameter", Trans. Amer. Math. Soc., 42 (1937) 107- 140. [3] A. DVORETSKY, A. WALD and .J . WoLFOWITZ, "Elimination of random ization in certain problems of statistics and of the theory of games", Proc. Nat . Acad. Sci. USA, 36 (1950) 256-260.
[4] A. DVORETSKY, A. WALD and .J . WoLFOWITZ, "Relations among certain ranges of vector measures", Pac . .J. Math. , 1 (1951) 59- 74. [5] A . DVORETSKY, A . WALD and .J . WoLFOWITZ, ""Elimination of ran domization in certain statistical decision problems in certain statistical decision procedures and zero-sum two-person games", Ann. Math. Stat . , 22 (1951) 1 -21.
[6] H . .J . KEISLER,
An infinitesimal approach to stochastic analysis, Memoirs
Amer. Math. Soc.
48, 1984.
[7] H .. T . KEISLER and Y . N . SUN, "A metric on probabilities, and products of Loeb spaces", .Jour. London Math. Soc . , 69 (2004) 258-272.
14. Applications of rich measure spaces
216
[8] 1\ I . A . K HAN , K . P . RATH and Y. N. SuN. "The Dvoretzky-Wald Wolfowitz theorem and purification in atomless finite-action games", In ternational Journal of Game Theory, 34 (2006) 91 - 104.
[9] M . A . KHAN and Y. N . Su N , "Non-cooperative games on hyperfinite Loeb spaces", J. Math. Econ. , 31 (1999) 455-492. [10] P . A . LOEB, "A combinatorial analog of Lyapunov's Theorem for infinites imally generated atomic vector measures". Proc. Amer. Math. Soc . , 39
(1973) 585-586. [ 1 1] P . A . L OEB, " Conversion from nonstandard to standard measure spaces and applications in probability theory", Trans. Amcr. Math. Soc., 2 1 1
(1975) 1 1 3- 122.
Nonstandard Analysis for the Working Mathematician. Kluwer Academic Publishers, Amsterdam, 2000.
[12] P . A . LOEB and M. WoLFF, cds.,
[13] P . A . L OEB, H . OsswALD, Y. SuN and Z . ZHANG, "Uncorrclatcdncss and orthogonality for vector-valued processes", Tran. Amer. Math. Soc . , 356
(2004) 3209 -3225. [14] P . A . LOEB and Y. Su N , "Purification of measure-valued maps", Doob Memorial Volume of the Illinois Journal of Mathematics, 50 (2006) 747- 762. [15] H . L . RoYDEN,
Real Analyszs, third edition. Macmillan, New York, 1988.
[16] Y. SuN. "Hyperfinite law of large numbers", Bull. Symbolic Logic, 2 (1996) 189-198. [17] Y. Su N , "A theory of hyperfinite processes: the complete removal of in dividual uncertainty via exact LLN". J. Math. Econ. , 29 (1998) 419-503. [18] Y. SU N , "The almost equivalence of pairwise and mutual independence and the duality with exchangeability", Probab. Theory and Relat. Fields, 1 1 2 (1998) 425-456.
More on S-measures David A. Ross
15.1
*
Introduction
In their important. (but. often overlooked ) paper [1] . C. Ward Henson and Frank \iVattenberg introduced the notion of S-measura.biz.ity, and showed that S-measurable functions are "approximately standarcP' ( in a sense made precise in the next section) . In a recent paper ([3]), the author used this machinery to transform a well known nonstandard plausibility argument for the Radon-Nikodym theorem into a correct and complete nonstandard proof of the theorem. The problem of finding an "essentially nonstandard" proof for Radon-Nikodym had been one of long standing. A ltho ugh Luxemburg gave a nonstandard proof as long ago as 1972 ([2] ) , he obtained the result as a consequence of another equally deep theorem in analysis clue to Riesz. ( Beate Zimmer [6] has recently proved vector-valued extensions of Radon-Nikoclym starting from the same plausibility argument, though using different standardizing machinery than that in [3] or the present paper. ) In this paper I use an S-measure argument very like the one in [3J to give an intuitive nonstandard proof of the Riesz result used by Luxemburg. Along the way [ gi ve a new proof for the main technical result from [1] on S-measures, a uew noustaudard proof for Egoroff's Theorem, and a nonst.
15.2
Loeb measures and S-measures
I will assume that we work in a nonstandard model in the sense of Robin son , and that this model is as saturated as it needs to be to carry out all constructions; in particular, it is au enlargement. *Department of Mathematics, University of Hawaii, Honolulu, HI 96822. ross@math . hawai i . edu
218
15. More on S-measures
Suppose X a set and A is an algebra on X. There are two natural algebras on *X : Ao = {*A : A E A} (the algebra of subsets of *X) , and *A. Note that except in the simplest cases, (i) neither Ao nor *A are a-algebras; (ii) Ao is external; and (iii) *A is vastly larger than Ao . These leads to two distinct a-algebras:
standard
1 . As
=
the smallest a-algebra containing Ao
2. AL
=
the smallest a-algebra containing *A
Recall that if IL is a (finitely- or countably-additive) finite measure on (X. A) then *IL maps *A to * [0 , oo ) , and in particular is not normally a measure, un less the range of IL is finite. However, 0*1L takes its values in [0 , oo ) , and so (*X, *A, 0*1L ) is an external, standard, finitely-additive finite measure space. The following was first noticed by Loeb. It is an immediate consequence of N rsaturation and the Caratheodory Extension Theorem, or can be proved directly; sec [4] for details. Theorem 1 °*1L VE E AL
extends to a a-additive measure ILL on (*X , AL ) . Moreover, ILL(E)
=
=
inf{ILL (A) : E c:;; A E *A} sup{ILL(A) : A c:;; E, A E *A}
( 1 5 . 2. 1 ) ( 1 5 . 2 . 2)
Of course, the measure ILL remains a-additive when restricted to any a algebra contained in AL, in particular As; this corresponds to replacing *A by Ao as the generating algebra. However, it is not so obvious that the approx imation properties ( 1 5 . 2 . 1 ) and ( 15 . 2 . 2) hold with this replacement as well. The next lemma, which asserts that they do, guarantees that a set E c:;; *X has 0" in the sense of Henson and Wattenberg [1] precisely when E c:;; D for some D E As with ILL(D) = 0. For this lemma, and the duration of the paper, it will be convenient to assume that A is a a-algebra.
"S-measure
Lemma 1 VE E As, �LL (E)
=
=
inf{ �L(A) : E c:;; *A, A E A} sup{IL(A) : *A c:;; E, A E A}
Proof. Let
'B
{ E E As : Vc > 0 ::JA, B E A such that *A c:;; E c:;; *B and IL(B \ A) < c} { E E As : Vc > 0 ::JA, B E A such that *A c:;; E c:;; *B and ILL (*B) < ILL(E) + c and ILL (*A) > ILL (E) - c } .
(1 5.2.3) ( 1 5 . 2 . 4)
219
15.2. Loeb measures and S-measures
E
E
Evidently *A 'B for every A A. It suffices to show that 'B is a a-algebra, so that As � 'B. If A � E � B then B e � Ec � A c and f-LL(B c \ A c ) = f-LL (A \ B) , so 'B is closed under complements. It remains to show that 'B is closed under countable unions. Let E = U n En where En 'B ( n N) increases to E. and let c > 0. For some N, ILL( EN ) > f-LL(E) - c/2, and for some A A, *A � EN and f-LL (*A) > f-LL (EN ) - c/2; it follows that *A � E and f-LL(*A) > f-LL(E) - c. For the exterior approximation, there exists Bn A with En � *Bn and f-LL (*Bn \ En ) < c2 - (n + 1 ) . Put B = U n Bn , then E = U n En � U n *Bn � *B ' and
E
E
E
E
f-L(B)
=
f-LL ( *B)
Call a function
(
)
((
) )
/-L L *B \ U *Bn + ILL U *Bn \ E + f-LL(E) n n n 1 < 0 + L c T ( + ) + f-LL(E) S f-LL(E) + c. n S
f : *X ---+ rn:.
D
approximately standard provided:
1. f is As-measurable;
f
2.
the restriction to JR:. ; and
g = f ix
3.
f :::::J *g almost
everywhere (with respect to
of
to X is an A-measurable function from X
f-LL) .
For example, suppose h : X ---+ rn:. i s a bounded A-measurable function. For r rn:. , 0*h - 1 ( - oo, = n nE N * h - 1 ( - oo , + 1/n) , so 0 *h is As-measurable. For X, = = 0*h(x) , so h = (0*h) lx. It follows that 0*h is approximately standard. The main result of this section is the theorem of Henson and Wattenberg, that As-measurable functions are approximately standard. The proof here differs from theirs. and makes it possible to prove some new results about integrability. Denote by the set of all approximately standard functions. The following enumerates some useful propert ies of
r] x EE h(x) *h(x)
r
all
APS
APS.
Lemma 2
APS is closed under finite linear combmations. 2. If f, g E APS then min{!, g} E APS and max{!, g} E APS. 3. If fn E APS, n E N, and fn mono tonically increases pointwise to f, then f E APS . 1.
220
4.
15. More on S-measures
Let h : X rn:. be an A-measurable function, and put E = {x E *X : l *h(x) l < oo}. Then (i) E E As, (ii) f-LL(*X \ E) = 0, and (iii) 0(*hxE ) E APS (where XE is the characteristic function of E). ---+
Proof.
f, g *X rn:. and (af (3f) l x = (af l x f3f l x ) . 2. As in ( 1 ) , note that max{f, g} l x = max{ f l x , g l x } and min{!, g} l x = min{ f l x , g l x }. 3. Let 9n = fn l x , An = { x E *X : *gn (x) ';f:; fn(x)}, and A = U n EN A n. Since f-LL( An) = 0 for each f-LL( A) = 0. Let g = f i x and note g = upn 9n · Fix a standard c 0, and for E N let En = {x E X : 9n (x) g(x) - c }. Since X = Un EN En, f-LL(*En) = f-L(En) increases to f-L(X) = f-LL(*X), so f-LL(A U (*X \ U nE N *En )) = 0 . Suppose x E ( *X \ A) UnEN *En . For some m E N, x E *E and fm(x) f(x) - c. It follows that *g (x) < *g (x) + c ::::::; fn (x) + c f(x) + c < fm(x) + 2c ::::::; *gm (x) + 2c *g(x) + 2r::n. Since c was arbitrary, *g (x) ::::::; f(x). 4. Put En = {x E X : l h (x) l < } , so E = Un EN *En E As . X = U n EN En, so f-LL(*En) f-L(En) increases to f-L(X) f-LL(*X), and f-L L(*X \ E) 0. 1 . Follows immediately from the observation that if E rn:. then + +
a , (3
---+
n,
s
>
n
>
n
n,
:S
:S
n
=
n
>
=
=
The proof of (iii) is now like the example preceding the statement of this lemma. D
Every As-measurable function is approximately standard. Proof. Note that if A E A then X*A = *xA = 0*XA is in APS by Lemma 2 ( 4) .
Theorem 2
By ( 1 ) and (3) of Lemma 2 and a suitable version of the Monotone Class Theorem (for example, Theorem 3 . 1 4 of [5] ) , every bounded As-measurable function is in APS. If 2 is As-measurable then = supn max{f, n so is in APS by (2) and (3) of Lemma 2. Any general As-measurable can be written = max{!, - max{ so is in APS by (1) and (2) of Lemma 2. D
f 0
f
f
f
},
0} f, 0} For example, suppose E E As ; denote by S(E) the set X n E of standard elements of E . If f is the characteristic function of E then g = f i x is the characteristic function of S(E) . By the theorem, S(E) is A-measurable and f-L(S(E)) = f-LL(*S(E)) = f *g df-LL = f f df-LL = IL L( E) . Corollary 1 Let f : *X be approximately standard, and p 0. Put g = f i x . Then f E £P(ttL) if and only if g E £P(tt), in which case J fPdf-LL = J gPdf-L and l f l v = l g l v · ---+ JR:.
>
221
15.3. Egoroff's Theorem
Proof. Without loss of generality, f 2: 0. Let s 71 : *X ---+ rn:., n E N, be simple functions increasing pointwise to fP. Put t71 = s 71 l x, then t71 is a sequence of simple functions on X increasing pointwise to gP. Moreover, if s71 = L7:=1 CYk XEk then t n = L 7:= 1 CYk XS ( Ek ) , and j s n df-LL = L7:=1 CYk f-LL(Ek ) = '5:."7:= 1 CYk f-L(S(Ek )) = J t 71 df-L. Let n ---+ oo, and it follows that J fPdf-L L and J gPdf-L arc either both infinite or arc both finite and equal. D The next result lets us extend the notion of approximate standardness to completion-measurable functions.
Let f : *X ---+ JR:.; the following are equivalent: (i) f is measurable with respect to the ILL-completion of As; (ii) f i x is measurable with respect to the f-L-completion of A, and f :::::J * (f i x) off a f-LL-nullset in As .
Lemma 3
Proof. Recall (without proof) the standard fact that a function is completion measurable if and only if it agrees with a measurable function off a nullset . (i =? ii) There is an As-measurable f' and a f-LL-nullset A E As such that f = f' off A. Let g = f i x and g' = f' l x , then g' is A-measurable, *g' :::::J f' off a f-LL-nullset B E As, and {x E X : g(x) # g'(x)} � S(A) . Since f-LL(A) = 0, f-L(S ( A)) = 0 by the example above, and so g' is measurable with respect to the f-L-completion of A. Note also that *f-L(S(A)) = 0, so f-LL (A U B U *S(A)) = 0. For x E *X , x rJ. A U B U *S(A) , f(x) = f'(x) :::::J g'(x) = g(x) , proving (ii) . (ii =? i) Let A E As be a f-LL-nullset with f :::::J * (fix) of!:" A. Let g = fix, g' A-measurable such that g = g' off a f-L-nullset B E A, E = {x E *X : l *g'(x) l < oo }, and f' = 0(*g' XE ) · By Lemma 2, f' is in APS. For x rJ. E U *B U A, f'(x) :::::J *g ' (x) = *g(x) :::::J f(x) , so in fact f'(x) = f(x) . Since f' is As measurable, f is completion measurable. D
15.3
Egoroff's Theorem
The most striking application [1] made of the S-measure construction was a proof of Egoroff's Theorem. Their proof relied on a nonstandard condition shown by Robinson to be equivalent to approximate uniform convergence. Here I use the machinery above to give an alternate proof of the theorem not depending on Robinson"s condition. :
Let (X, A, f-L) be a finite meas1Lre space, j, fn X ---+ rn:. measur able, fn ---+ f a. e. Then Vc > 0 3A E A f-L(A) > f-L( X ) - c & fn ---+ f uniformly on A.
Theorem 3
222
15. More on S-measures
Proof. For n E N put 9n = inf m> n fm and h n = supm > n fm · Note that for almost all x, hn (x) - gn (x) is nonnegative and nondecreasing in n with limn_, = hn(x) - 9n(x) = 0. Put ?Jn = 0 *gn , h n = 0 *h n . Let E = {x E *X : limn _,= hn(x) - ?Jn (x) c/c 0}. Note E E As, so fLL(E) = p,(S(E)) = p,(0) = 0. It follows that for some A E A, *A c;;;; E C and p,(A) > p,(X) - c . It remains to show that fn converges to f uniformly on A; equivalently, that hn - 9n converges to 0 uniformly on A. Fix 6 > 0. For x E *A there is a k E N such that hk(x) - gk(x) < 6. Note *h k( x ) - *g k (x) < 6 as well. Let ¢(x) be the least k such that *h k (x) - *g k (x) < 6. The function ¢ : *A ---+ N is internal and finite-valued, so has a standard upper bound N E N. Then *h k - *g k < 6 on *A for every k 2 N, so h k - 9k < 6 on A; this completes the proof. D
15.4
A Theorem of Riesz
Let T be a continuous linear real functional on .C 2 (X, A, fL ); then there is a g such that for every f E .C 2 (X, A, p,), T(f) = J fg dp,.
Theorem 4
g is actually in .C 2 (X, A, p,) . By saturation let A be a *-finite algebra with A0 c;;;; A c;;;; *A . There
After the proof we show that the function
Proof. is an internal *-partition II of *X which corresponds to A in the sense that the latter is the internal closure of the former under hyperfinite unions. Now, define
i (x)
:=
{
*T( xv ) *p, (p )
0,
'
x E p E II and *p, (p )
>
otherwise.
Let a : II ---+ *X be an internal choice function, that is, For any bounded, measurable f : X ---+ rn:.,
T (f) = L * T (*f xv ) p p p
0;
ap E p for p E II. ( 1 5.4. 1 ) ( 1 5.4.2) ( 1 5.4.3) (1 5.4.4)
223
1 5 .4. A Theorem of Riesz
1p � L 1 *j(x yY (x) *df1 p p = J *f :Y *d/1 =
L *f(avYf (x) *d/1
(1 5.4. 5)
p
( 1 5.4. 6) ( 1 5.4. 7)
The steps from ( 1 5.4. 1 ) to ( 15.4.2) and (15.4.5) to ( 1 5.4.6) follow from boundedness of f and the definition of A. For (15.4.2) to ( 1 5 . 4.3) note that by continuity of T, if p E II and *!1(P ) = 0 then *T( xv ) = 0. Moreover, if *f is replaced in the above by any internal function h : *X ---+ *JR:. with the property that h is constant on each p E II, then all but the first equality in the above still holds, and we obtain *T(h) = J hi d*f1 . In particular, if h = XA for some A E A then *T( x A ) = fA :Y d*f1. The proof now proceeds as follows : (i) Show :Y is finite almost every where (and therefore 1 =0 :Y exists almost everywhere) . (ii) Show that :Y is S-integrable (and therefore 1 =0 :Y is integrable) . (iii) Put G = IE[riAs] (the conditional expectation of 1 ) . (iv) Let g be the restriction of G to X; by Theorem 2 g is A-measurable. (v) Show that g works. For (i) , write [:Y < n] = {x E *X : :Y(x) < n } ( n E *N) , and [i < oo] = U n EN [:Y < n] . Suppose (for a contradiction) that f1L ( [:Y < oo] ) < 1 - r for some standard r > 0. Then !1 ( [:Y < n ] ) < 1 - r for each standard n E N, so !1 ( [:Y < H] ) < 1 - r for some infinite H. But then oo > T(1) � *J1:Yd*f1 (by the note above) 2 *J [:Y ? H] :Yd*/1 2 H*!1 ( [:Y 2 H] ) > rH, which is infinite, a contradiction. For (ii) , the reader is referred to [4] for a discussion of S-integrability. In particular, to show that :Y is S-integrable, it suffices to show that VH in finite, *J :Y > H] :Yd*/1 � 0. (Indeed, this can be adopted as the definition of I S-integrability. ) So, fix such an H. Note [:Y > H] E A; it follows that * J :Y > H] :Yd*/1 = I *T(X[:Y > HJ ) · Suppose (for a contradiction) that *T(X[:Y > HJ ) > r > 0, r stan dard. By (i) , *!1 ( [:Y > H] ) � 0. It follows from transfer that for every stan dard n E N there is a Bn E A with T(XBn ) > r and f1(Bn) < 1 / 2 -n . Put B n := Um > n Bm . Then 11(B n ) < L m > n 2 - m = 2 - n + l , but T(XBn ) > r. As n ---+ oo, X;;n ---+ 0 in £ 2 but T(XBn ) > -:;., contradicting continuity of T. It follows from S-integrability of i that 1 =0 :Y is integrable, so its con ditional expectation with respect to As, IE[riAs] , exists; put G = IE[riAs] . (Conditional expectation is defined in the next section, where a simple non standard proof for its existence is given. The reader is referred to chapter 9 of [5] for properties of the conditional expectation.)
224
1 5 . More on S-measures
Finally, let g G l x , which ( as noted above ) is A-measurable by Theorem 2. It remains to show that g satisfies the conclusion of Theorem 4. Let f E J:} (X, A, p,) , and suppose first that f is bounded. This ensures that (*!)1 is S-integrable, and (0*j)r E J:} (*X, AL, p,L) . Then =
J *FI d *p, � J (0*!) { dp,L = j IE W *f)r i A s ] dp,L j C *f) IE [riAs] dp,L = J (0*j)G dp,L = J fg dp,
T(j) �
=
( 1 5.4.8) ( 1 5.4.9) ( 15.4. 1 0) ( 15.4. 1 1 ) (15.4. 12) (15.4. 1 3)
The step from ( 15.4.8 ) to ( 15.4.9 ) is by S-integrability, ( 1 5.4. 10 ) to ( 15.4. 1 1 ) is a standard property of conditional expectation ( using the fact that 0*j is As-measurable ) , and (15.4.12 ) to ( 1 5.4. 13 ) is Corollary 1 with p = 1 . For unbounded f E J:} (X, A, p, ) and n E N, let fn = max { -n, min { !, n } } . By the result above , T(jn ) = J fn g dp,. By continuity of T and Lebesgue's Dominated Convergence Theorem ([ 5 ] , Theorem 5.9 ) , T(j) = J fg dp,. D The Riesz Theorem is usually stated in the following nominally stronger form.
Let T be a continuous linear real functional on .C 2 (X, A, p,) ; then there is a g E .C 2 (X, A, p,) such that for every f E .C 2 (X, A, p,), T(j) = J fg dp,.
Corollary 2
Proof. It suffices to show that any g satisfying the conclusion of Theorem 4 is already in .C 2 (X, A, p,). Since T is continuous, it is bounded, so there is a constant C such that for any f E .C 2 ( X, A, p,) , T(j) � CIIJII 2 · Put 9n = min { g, n } . Then ll9n ll� = Jg� dp, S fgn g dp, = T(gn ) S Cll9n l l 2 · Divide both sides of this inequality by ll9n ll 2 and square, obtain J g� dp, ll9nll � S C 2 . The result now follows by Fatou's Lemma ([5] , Lemma 5.4) . D
15.4. A Theorem of Riesz 1 5 .4 . 1
225
Conditional expectation
Theorem 5 Suppose (X, A, f-L) zs a probabdzty measure, that 'B C:: A is another a-algebra, and that j E ,.C}