×

Weak and strong martingale convergences of generalized conditional expectations in noncommutative \(L^p\)-spaces. (English) Zbl 1061.46046

The author considers strong operator and weak operator convergence of regular generalized martingales in a von Neumann algebra and their norm and weak convergence in noncommutative \(L^p\)-spaces over the algebra, with \(1\leq p<\infty\). The starting point is a von Neumann algebra \(M\) with a monotone net of subalgebras \(M_\alpha\), and an f.n.s. weight \(\varphi\) on \(M\) which is still semifinite when restricted to the \(M_\alpha\)’s. One deals with pointwise convergence of generalized conditional expectations from \(M\) into \(M_\alpha\) or their canonical extensions to maps from \(L^p(M)\) into \(L^p(M_\alpha)\), composed with the natural embeddings of \(M_\alpha\) into \(M\) or their extensions to maps from \(L^p(M_\alpha)\) into \(L^p(M)\). To avoid unnecessary complications, only the symmetric embedding is used.
Besides gathering most old results on the subject, the author completes the picture, especially for the case of non-finite measures. A surprising fact is that, in the increasing case, the norm limit of a regular martingale \((E_\alpha(x))\) in an \(L^p\)-space may be different from \(E_\infty(x)\), where \(E_\infty\) corresponds to the generalized conditional expectation on the limiting subalgebra \(M_\infty\). Another result shows that weak convergence of martingales in \(L^p\)-spaces implies their norm convergence. The differences between the increasing and decreasing cases are clearly indicated.

MSC:

46L53 Noncommutative probability and statistics
81S25 Quantum stochastic calculus
Full Text: DOI

References:

[1] DOI: 10.1016/0022-1236(82)90022-2 · Zbl 0483.46043 · doi:10.1016/0022-1236(82)90022-2
[2] Accardi L., Proc. R. Ir. Acad. 83 pp 251– (1983)
[3] DOI: 10.1142/S0219025799000369 · Zbl 1043.82506 · doi:10.1142/S0219025799000369
[4] DOI: 10.1006/jfan.1993.1139 · Zbl 0788.60060 · doi:10.1006/jfan.1993.1139
[5] Calderon A., Studia Math. 24 pp 113– (1964)
[6] Cecchini C., World Scientific 199 pp 149–
[7] DOI: 10.1016/0022-1236(90)90065-S · Zbl 0718.46038 · doi:10.1016/0022-1236(90)90065-S
[8] DOI: 10.1006/jfan.1999.3498 · Zbl 0955.46029 · doi:10.1006/jfan.1999.3498
[9] Fidaleo F., Math. Scand. 77 pp 289– (1995) · Zbl 0851.46041 · doi:10.7146/math.scand.a-12567
[10] DOI: 10.4171/ZAA/869 · Zbl 0933.46059 · doi:10.4171/ZAA/869
[11] Haagerup U., Colloq. Int. CNRS 274 pp 175– (1979)
[12] DOI: 10.1016/0022-1236(84)90077-6 · Zbl 0544.46037 · doi:10.1016/0022-1236(84)90077-6
[13] DOI: 10.1090/S0002-9947-1984-0732120-1 · doi:10.1090/S0002-9947-1984-0732120-1
[14] Hiai F., J. Operator Theory. 18 pp 265– (1987)
[15] DOI: 10.1142/S0129167X97000494 · Zbl 0904.46046 · doi:10.1142/S0129167X97000494
[16] DOI: 10.1142/S0129167X98000439 · Zbl 0934.46061 · doi:10.1142/S0129167X98000439
[17] DOI: 10.1016/0022-1236(84)90025-9 · Zbl 0604.46063 · doi:10.1016/0022-1236(84)90025-9
[18] DOI: 10.1142/S0129167X91000119 · Zbl 0746.46063 · doi:10.1142/S0129167X91000119
[19] DOI: 10.1007/BF01388497 · Zbl 0538.46045 · doi:10.1007/BF01388497
[20] DOI: 10.1007/BF02125124 · Zbl 0682.46045 · doi:10.1007/BF02125124
[21] DOI: 10.1007/BF02100488 · Zbl 0802.46075 · doi:10.1007/BF02100488
[22] DOI: 10.1007/BF01212345 · Zbl 0597.46067 · doi:10.1007/BF01212345
[23] DOI: 10.1007/s002200050224 · Zbl 0898.46056 · doi:10.1007/s002200050224
[24] DOI: 10.1016/0022-1236(88)90057-2 · Zbl 0646.46055 · doi:10.1016/0022-1236(88)90057-2
[25] DOI: 10.1016/0022-1236(72)90004-3 · Zbl 0245.46089 · doi:10.1016/0022-1236(72)90004-3
[26] Terp M., J. Operator Theory 8 pp 327– (1982)
[27] DOI: 10.2748/tmj/1178245177 · Zbl 0058.10503 · doi:10.2748/tmj/1178245177
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.