Completeness for vector lattices (Q2414746)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7056426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness for vector lattices |
scientific article; zbMATH DE number 7056426 |
Statements
Completeness for vector lattices (English)
0 references
17 May 2019
0 references
\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\).
0 references
vector lattice
0 references
unbounded order convergence
0 references
universal completeness
0 references
0.7600345015525818
0 references
0.7599653005599976
0 references
0.7526174187660217
0 references
