Disjointness in partially ordered vector spaces

DOI10.1007/S11117-005-0015-0MaRDI QIDQ850594zbMATH OpenOpenAlexFDO

Publication date 3 November 2006

Published in Positivity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11117-005-0015-0

band preserving operator disjoint complement disjointness disjointness preserving operator order dense subspace partially ordered vector space pre-Riesz space Riesz completion

Mathematics Subject Classification ID

Ordered topological linear spaces, vector lattices (46A40)

Review text

If \(X\) is a vector lattice, \(x,y\in X\) and \(| x| \wedge| y| =0\), then \(x\) and \(y\) are disjoint. This instance of disjointness amounts to the equality \(| x+y| =| x-y| \). In other words, any upper bound of \(x+y\) and \(-x-y\) is an upper bound of \(x-y\) and \(y-x\). The latter property does not involve the lattice structure of \(X\). The authors take it as the definition of disjointness in an arbitrary ordered vector space. The notion of disjointness leads to the natural concept of the disjoint complement of a subset \(M\) of~\(X\). The authors study the relevant analogues of the objects and properties that are tied with disjointness, among them order dense subspaces of vector lattices, directed ordered vector spaces, bands in these spaces, and band preserving operators. The article is full of elementary but relevant examples.

Recommendations

Cites work

Cited in

(21)

This page was built for publication: Disjointness in partially ordered vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850594)