The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A linear operator T: X → Y between vector lattices is said to be disjointness preserving if T sends disjoint elements in X to disjoint elements in Y. Two closely related questions are discussed in this paper: (1) If T is invertible, under what assumptions does the inverse operator also preserve disjointness? (2) Under what assumptions is the operator T regular? These problems were considered by the authors in [5] but the current paper (closely related to [5] but self-contained) reflects the progress...
The following properties of C[0,1] are proved here. Let T: C[0,1] → Y be a disjointness preserving bijection onto an arbitrary vector lattice Y. Then the inverse operator is also disjointness preserving, the operator T is regular, and the vector lattice Y is order isomorphic to C[0,1]. In particular if Y is a normed lattice, then T is also automatically norm continuous. A major step needed for proving these properties is provided by Theorem 3.1 asserting that T satisfies some technical condition...
Download Results (CSV)