ISSN 1683-3414 (Print)   •   ISSN 1814-0807 (Online)
   Log in


Address: Vatutina st. 53, Vladikavkaz,
362025, RNO-A, Russia
Phone: (8672)23-00-54





Dear authors!
Submission of all materials is carried out only electronically through Online Submission System in personal account.
DOI: 10.23671/VNC.2019.21.44624

Unbounded Order Convergence and the Gordon Theorem

Emelyanov, E. Y. , Gorokhova, S. G. , Kutateladze, S. S.
Vladikavkaz Mathematical Journal 2019. Vol. 21. Issue 4.
The celebrated Gordon's theorem is a natural tool for dealing with universal completions of Archimedean vector lattices. Gordon's theorem allows us to clarify some recent results on unbounded order convergence. Applying the Gordon theorem, we demonstrate several facts on order convergence of sequences in Archimedean vector lattices. We present an elementary Boolean-Valued proof of the Gao-Grobler-Troitsky-Xanthos theorem saying that a sequence \(x_n\) in an Archimedean vector lattice \(X\) is \(uo\)-null (\(uo\)-Cauchy) in X if and only if \(x_n\) is \(o\)-null (\(o\)-convergent) in \(X^u\). We also give elementary proof of the theorem, which is a result of contributions of several authors, saying that an Archimedean vector lattice is sequentially \(uo\)-complete if and only if it is \(\sigma\)-universally complete. Furthermore, we provide a comprehensive solution to Azouzi's problem on characterization of an Archimedean vector lattice in which every \(uo\)-Cauchy net is \(o\)-convergent in its universal completion.
Keywords: unbounded order convergence, universally complete vector lattice, Boolean valued analysis.
Language: English Download the full text  
For citation: Emelyanov, E. Y., Gorokhova, S. G., Kutateladze, S. S. Unbounded Order Convergence and the Gordon Theorem, Vladikavkaz Math. J., 2019, vol. 21, no. 4, pp. 56-62. DOI 10.23671/VNC.2019.21.44624
+ References

← Contents of issue
  | Home | Editorial board | Publication ethics | Peer review guidelines | Latest issue | All issues | Rules for authors | Online submission systems guidelines | Submit manuscript |