Completeness for vector lattices

From MaRDI portal
Publication:2414746



Abstract: The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice is universally complete if and only if it is unboundedly order complete. Another notion of completeness will be treated is the notion of sup-completion introduced by Donner.


\textit{H. Li} and \textit{Z.-L. Chen} proved that a vector lattice \(X\), having the countable \(\sup\) property, is universally complete if it is \(uo\)-complete [Positivity 22, No. 1, 83--90 (2018; Zbl 1397.46002)]. The author shows that this remains true without any assumption on \(X\).











This page was built for publication: Completeness for vector lattices

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