Completeness for vector lattices (Q2414746): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963522816 / rank | |||
Normal rank | |||
Revision as of 20:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness for vector lattices |
scientific article |
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
