Sums of Order Bounded Disjointness Preserving Linear Operators
- 7 Downloads
Necessary and sufficient conditions are found under which the sum of N order bounded disjointness preserving operators is n-disjoint with n and N naturals. It is shown that the decomposition of an order bounded n-disjoint operator into a sum of disjointness preserving operators is unique up to “Boolean permutation,” the meaning of which is clarified in the course of the presentation.
Keywordsvector lattice purely n-disjoint operator Boolean permutation factorization
Unable to display preview. Download preview PDF.
- 5.Radnaev V. A. On Metric n–Indecomposability in Ordered Lattice Normed Spaces and Its Applications, [Russian], PhD Thesis, Sobolev Institute Press, Novosibirsk (1997).Google Scholar
- 8.Abramovich Y. A. and Kitover A. K., Inverses of Disjointness Preserving Operators, Amer. Math. Soc., Providence (2000) (Mem. Amer. Math. Soc., vol. 143, no. 679).Google Scholar
- 10.Boulabiar K., Buskes G., and Triki A., “Results in f–algebras,” in: Positivity (Eds. Boulabiar K., Buskes G., Triki A.), Birkhäuser, Basel, 2000, 73–96.Google Scholar
- 11.Gutman A. E., “Disjointness preserving operators,” in: Vector Lattices and Integral Operators (Ed. Kutateladze S. S.), Kluwer, Dordrecht, 1996, 361–454.Google Scholar