Vladikavkazskii Matematicheskii Zhurnal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vladikavkaz. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vladikavkazskii Matematicheskii Zhurnal, 2019, Volume 21, Number 4, Pages 56–62
DOI: https://doi.org/10.23671/VNC.2019.21.44624
(Mi vmj706)
 

This article is cited in 2 scientific papers (total in 2 papers)

Unbounded order convergence and the Gordon theorem

E. Y. Emelyanovab, S. G. Gorokhovac, S. S. Kutateladzeb

a Middle East Technical University, 1 Dumlupinar Bulvari, Ankara 06800, Turkey
b Sobolev Institute of Mathematics, 4 Koptyug prospect, Novosibirsk 630090, Russia
c Southern Mathematical Institute VSC RAS, 22 Marcus St., Vladikavkaz 362027, Russia
Full-text PDF (216 kB) Citations (2)
References:
Abstract: 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.
Key words: unbounded order convergence, universally complete vector lattice, Boolean valued analysis.
Funding agency Grant number
Siberian Branch of Russian Academy of Sciences I.1.2, Project № 0314-2019-0005
The research was partially supported by the Science Support Foundation Program of the Siberian Branch of the Russian Academy of Sciences; № I.1.2, Project № 0314-2019-0005.
Received: 04.07.2019
Document Type: Article
UDC: 510.898, 517.98
MSC: 03H05, 46S20, 46A40
Language: English
Citation: E. Y. Emelyanov, S. G. Gorokhova, S. S. Kutateladze, “Unbounded order convergence and the Gordon theorem”, Vladikavkaz. Mat. Zh., 21:4 (2019), 56–62
Citation in format AMSBIB
\Bibitem{EmeGorKut19}
\by E.~Y.~Emelyanov, S.~G.~Gorokhova, S.~S.~Kutateladze
\paper Unbounded order convergence and the Gordon theorem
\jour Vladikavkaz. Mat. Zh.
\yr 2019
\vol 21
\issue 4
\pages 56--62
\mathnet{http://mi.mathnet.ru/vmj706}
\crossref{https://doi.org/10.23671/VNC.2019.21.44624}
Linking options:
  • https://www.mathnet.ru/eng/vmj706
  • https://www.mathnet.ru/eng/vmj/v21/i4/p56
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Владикавказский математический журнал
    Statistics & downloads:
    Abstract page:220
    Full-text PDF :73
    References:31
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024