<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd"><article xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" dtd-version="1.3" article-type="research-article"><front><journal-meta><journal-id journal-id-type="issn">2460-0245</journal-id><journal-title-group><journal-title>Journal of the Indonesian Mathematical Society</journal-title><abbrev-journal-title>JIMS</abbrev-journal-title></journal-title-group><issn pub-type="epub">2460-0245</issn><issn pub-type="ppub">2086-8952</issn><publisher><publisher-name>IndoMS</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22342/jims.v32i2.1611</article-id><article-categories></article-categories><title-group><article-title>On Generalization of Unbounded Order Convergence in Riesz Spaces</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Diyaldin</surname><given-names>Fahreezan Sheraz</given-names></name><address><country country="ID">Indonesia</country><email>fahreezansheraz@mail.ugm.ac.id</email></address><xref ref-type="aff" rid="AFF-1"></xref><xref ref-type="corresp" rid="cor-0"></xref></contrib><contrib contrib-type="author"><name><surname>Tantrawan</surname><given-names>Made</given-names></name><address><country country="ID">Indonesia</country><email>made.tantrawan@ugm.ac.id</email></address><xref ref-type="aff" rid="AFF-1"></xref></contrib></contrib-group><contrib-group><contrib contrib-type="editor"><name><surname>Elfiyanti</surname><given-names>Gustina</given-names></name><address><country country="ID">Indonesia</country><email>gustina.elfiyanti@uinjkt.ac.id</email></address><xref ref-type="aff" rid="EDITOR-AFF-1"></xref></contrib></contrib-group><aff id="AFF-1"><institution content-type="dept">Department of Mathematics</institution><institution-wrap><institution>Universitas Gadjah Mada</institution><institution-id institution-id-type="ror">https://ror.org/03ke6d638</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><aff id="EDITOR-AFF-1"><institution-wrap><institution>Syarif Hidayatullah State Islamic University Jakarta</institution><institution-id institution-id-type="ror">https://ror.org/00c7fav87</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><author-notes><corresp id="cor-0">Corresponding author: Fahreezan Sheraz Diyaldin. Email: <email>fahreezansheraz@mail.ugm.ac.id</email></corresp></author-notes><pub-date date-type="pub" iso-8601-date="2026-04-23" publication-format="electronic"><day>23</day><month>04</month><year>2026</year></pub-date><pub-date date-type="collection" iso-8601-date="2026-04-23" publication-format="electronic"><day>23</day><month>04</month><year>2026</year></pub-date><volume>32</volume><issue>2</issue><issue-title>JUNE</issue-title><fpage>1</fpage><lpage>10</lpage><history><date date-type="received" iso-8601-date="2023-12-27"><day>27</day><month>12</month><year>2023</year></date><date date-type="accepted" iso-8601-date="2025-11-15"><day>15</day><month>11</month><year>2025</year></date></history><permissions><copyright-statement>Copyright (c) 2026 Journal of the Indonesian Mathematical Society</copyright-statement><copyright-year>2026</copyright-year><copyright-holder>Journal of the Indonesian Mathematical Society</copyright-holder><license xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/"><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc-nd/4.0/</ali:license_ref><license-p>This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.</license-p></license></permissions><self-uri xlink:href="https://jims-a.org/index.php/jimsa/article/view/1611" xlink:title="1611"></self-uri><abstract><p>Order convergence is a crucial concept in the theory of Riesz spaces. A generalization of order convergence, known as unbounded order convergence (or uo convergence), has been introduced. In this paper, we present a further generalization of uo convergence by using an arbitrary nonempty subset of the positive cone of the space. We then investigate the properties of this generalization, including uniqueness of limits, algebraic properties, and the relationships among these types of convergence. In particular, we show that the generalizations of uo convergence generated by two subsets are equivalent if and only if the bands generated by those subsets are equal.</p></abstract><kwd-group><kwd>Riesz spaces</kwd><kwd>order convergence</kwd><kwd>unbounded order convergence</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>File created by JATS Editor</meta-name><meta-value>https://jatseditor.com</meta-value></custom-meta><custom-meta><meta-name>issue-created-year</meta-name><meta-value>2026</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec id="sec-1"><title>1. INTRODUCTION</title><p>Functional analysis is one branch of mathematics that focuses on the study of vector spaces equipped with specific structures. One of the theories within it is the theory of Riesz spaces, first investigated independently by Frigyes Riesz, Leinid Kantorovich, and Hans Freudenthal around 1935. Riesz spaces consist of vector spaces equipped with a partially ordered relation (usually denoted by <inline-formula><tex-math id="math-1"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle “≤” \end{document} ]]></tex-math></inline-formula>) that forms a lattice and is compatible with the structure of the vector space. Furthermore, there is a structure derived from Riesz spaces known as Banach lattices. This structure comprises Riesz spaces equipped with a norm and satisfying certain axioms.</p><p>One of the important concepts in the theory of Riesz spaces is the order convergence. This concept is significant because its definition involves only the order relation inherent in the Riesz space and does not depend on a specific topology.</p><p>Recall that a net in a  Riesz space <inline-formula><tex-math id="math-2"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is a function from a directed set to <inline-formula><tex-math id="math-3"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>. A net <inline-formula><tex-math id="math-4"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) _ { \alpha \in \Lambda } \end{document} ]]></tex-math></inline-formula> in the Riesz space <inline-formula><tex-math id="math-5"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is said to converge in order to <inline-formula><tex-math id="math-6"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula>, denoted by <inline-formula><tex-math id="math-7"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x_{\alpha}\overset{o}{\longrightarrow}x \end{document} ]]></tex-math></inline-formula>, if there exists a net <inline-formula><tex-math id="math-8"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( z _ { \beta } ) _ { \beta \in \Pi } \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-9"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-10"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z _ { \beta } \downarrow 0 \end{document} ]]></tex-math></inline-formula>, and for each <inline-formula><tex-math id="math-11"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \beta \in \Pi \end{document} ]]></tex-math></inline-formula>, there exists <inline-formula><tex-math id="math-12"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 0 } \in \Lambda \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-13"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x _ { \alpha } - x | \le z _ { \beta } \end{document} ]]></tex-math></inline-formula> for every <inline-formula><tex-math id="math-14"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha  \in \Lambda \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-15"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \geq \alpha _ { 0 } \end{document} ]]></tex-math></inline-formula>. Throughout this paper, unless ambiguity arises, we write <inline-formula><tex-math id="math-16"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> in place of <inline-formula><tex-math id="math-17"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) _ { \alpha \in \Lambda } \end{document} ]]></tex-math></inline-formula>. The concept of order convergence has many applications not only in functional analysis but also in other fields such as financial mathematics.</p><p>Some researchers then attempted to generalize the concept of order convergence. In 1948, Hidegoro Nakano <xref ref-type="bibr" rid="BIBR-1">[1]</xref> introduced a concept of convergence that he called individual convergence. Subsequently, in 1964, Ralph DeMarr <xref ref-type="bibr" rid="BIBR-2">[2]</xref> defined the unbounded order convergence, abbreviated as uo convergence, which is essentially equivalent to individual convergence. The term uo convergence later became more popular and widely used to this day. A net <inline-formula><tex-math id="math-18"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-19"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is said to converge uo to <inline-formula><tex-math id="math-20"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula>, denoted as <inline-formula><tex-math id="math-21"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \ { \stackrel { \mathrm { u o } } { \longrightarrow } } \ x , \operatorname { i f } \ | x _ { \alpha } - x | \wedge u \ { \stackrel { \mathrm { o } } { \to } } \ 0 \end{document} ]]></tex-math></inline-formula> for every <inline-formula><tex-math id="math-22"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in X ^ { + } \end{document} ]]></tex-math></inline-formula>. Over time, many researchers have examined the properties and applications of uo convergence, including Kaplan <xref ref-type="bibr" rid="BIBR-3">[3]</xref> investigating the relationship between uo convergence and weak units, Gao and Xanthos <xref ref-type="bibr" rid="BIBR-4">[4]</xref> discussing applications of uo convergence in martingales without probability, and Niushan Gao <xref ref-type="bibr" rid="BIBR-5">[5]</xref> studying uo convergence in dual spaces.</p><p>In this paper, we introduce a novel form of convergence that generalizes the concept of unbounded order convergence. This new convergence reduces the condition from "For all <inline-formula><tex-math id="math-23"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u\in X^+ \end{document} ]]></tex-math></inline-formula>" to “for all <inline-formula><tex-math id="math-24"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u\in A \end{document} ]]></tex-math></inline-formula>", where <inline-formula><tex-math id="math-25"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula> is specified, and is referred to as A-unbounded order convergence, abbreviated as A-uo convergence. We will investigate some properties of this new concept, including the limit uniqueness and its relation to other convergences. Before that, we establish a new criterion for <inline-formula><tex-math id="math-26"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula>, denoted order density on positive cones, inspired by the notion of order dense Riesz subspaces. It will become apparent later in the paper that this criterion is intricately linked to the uniqueness of the limit of A-uo convergent nets.</p></sec><sec id="sec-2"><title>2. ORDER DENSE SETS ON POSITIVE CONES</title><p>Throughout this paper, <inline-formula><tex-math id="math-27"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> denotes a Riesz space. The set of all positive elements of <inline-formula><tex-math id="math-28"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is denoted by <inline-formula><tex-math id="math-29"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>. Analogously, for all <inline-formula><tex-math id="math-30"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X , A ^ { + } \end{document} ]]></tex-math></inline-formula> is the set of all positive elements of <inline-formula><tex-math id="math-31"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula>. Moreover, we use the symbols <inline-formula><tex-math id="math-32"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I _ { A } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-33"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ⟨A⟩ \end{document} ]]></tex-math></inline-formula> to represent the ideal and band generated by <inline-formula><tex-math id="math-34"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula>, respectively. Definitions and fundamental concepts of Riesz spaces are referenced from <xref ref-type="bibr" rid="BIBR-6">[6]</xref>.</p><p>We start this section by recalling the definition of order dense Riesz subspaces given by Aliprantis and Burkinshaw <xref ref-type="bibr" rid="BIBR-7">[7]</xref>. A Riesz subspace <inline-formula><tex-math id="math-35"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Y \end{document} ]]></tex-math></inline-formula> of <inline-formula><tex-math id="math-36"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is said to be order dense in <inline-formula><tex-math id="math-37"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> if for any <inline-formula><tex-math id="math-38"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in X ^ { + } \end{document} ]]></tex-math></inline-formula>, there exist <inline-formula><tex-math id="math-39"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \in Y \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-40"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \leq y \leq x \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-41"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \ne 0 \end{document} ]]></tex-math></inline-formula>. For the rest of the paper, we write "<inline-formula><tex-math id="math-42"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a<b \end{document} ]]></tex-math></inline-formula>" to denote <inline-formula><tex-math id="math-43"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \leq b \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-44"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \neq b \end{document} ]]></tex-math></inline-formula>. Inspired by this definition, we propose the definition of order density on a positive cone as follows.<target id="anchor-ca338cf6-1288-4de0-abd1-98939007f3ce" target-type="reference-target"/></p><p><bold>Definition 2.1.</bold><italic>A set </italic><inline-formula><tex-math id="math-45"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> is said to be order dense in </italic><inline-formula><tex-math id="math-46"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> if for any u </italic><inline-formula><tex-math id="math-47"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \in X ^ { + } \end{document} ]]></tex-math></inline-formula><italic>, there exist </italic><inline-formula><tex-math id="math-48"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \in I _ { A } \end{document} ]]></tex-math></inline-formula><italic> such that </italic><inline-formula><tex-math id="math-49"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < y \le u \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p>Clearly, this definition is related to the concept of order dense Riesz subspace as <inline-formula><tex-math id="math-50"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-51"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-52"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I _ { A } \end{document} ]]></tex-math></inline-formula> is an order dense ideal. It is also important to notice that <inline-formula><tex-math id="math-53"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-54"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-55"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I _ { A } ^ { + } \end{document} ]]></tex-math></inline-formula> is also order dense in <inline-formula><tex-math id="math-56"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>.</p><p>We now present two lemmas of order dense sets on the positive cone that will be usefull in the next discussion.<target id="anchor-1586b17e-23e9-474f-b2b2-594dac47635f" target-type="reference-target"/></p><p><bold>Lemma 2.2.</bold><italic>Let </italic><inline-formula><tex-math id="math-57"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> be an Archimedean Riesz space and </italic><inline-formula><tex-math id="math-58"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic>. Then, </italic><inline-formula><tex-math id="math-59"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula><italic> is order dense in </italic><inline-formula><tex-math id="math-60"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> if and only if </italic><inline-formula><tex-math id="math-61"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle A \rangle = X \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p><italic>Proof</italic>. Consider that</p><p><inline-formula><tex-math id="math-62"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}A&\text{ is order dense set in }X^+\\&\Longleftrightarrow I_A\text{ is order dense ideal in }X\\&\Longleftrightarrow \forall x\in X,\;|x|=\sup\{y\in I_A:0\le y\le|x|\}&&\text{(by Theorem 1.34 in [7])}\\&\Longleftrightarrow \forall x\in X,\;x\in\langle I_A\rangle&&\text{(by Theorem 7.8 in [6])}\\&\Longleftrightarrow X\subseteq\langle I_A\rangle=\langle A\rangle\\&\Longleftrightarrow X=\langle A\rangle&&\text{(since }\langle A\rangle\subseteq X\text{ always holds)}\end{aligned}\end{equation*} \end{document} ]]></tex-math></inline-formula></p><p>Hence, it is true that <inline-formula><tex-math id="math-63"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense set in <inline-formula><tex-math id="math-64"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-65"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle A\rangle=X \end{document} ]]></tex-math></inline-formula>.<target id="anchor-d31cdadd-63a9-46ee-9805-d693e9bdd505" target-type="reference-target"/></p><p><bold>Lemma 2.3.</bold><italic>Let </italic><inline-formula><tex-math id="math-66"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-67"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle J \end{document} ]]></tex-math></inline-formula><italic> be order dense ideals in </italic><inline-formula><tex-math id="math-68"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>. Then, </italic><inline-formula><tex-math id="math-69"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I ^ { + } \cap J ^ { + } \end{document} ]]></tex-math></inline-formula><italic> is an order dense set in </italic><inline-formula><tex-math id="math-70"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p><italic>Proof.</italic> Let <inline-formula><tex-math id="math-71"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-72"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x > 0 \end{document} ]]></tex-math></inline-formula> be arbitrary. Since <inline-formula><tex-math id="math-73"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-74"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-75"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < u \leq x \end{document} ]]></tex-math></inline-formula> for some <inline-formula><tex-math id="math-76"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in I ^ { + } \end{document} ]]></tex-math></inline-formula>. Next, since <inline-formula><tex-math id="math-77"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle J \end{document} ]]></tex-math></inline-formula> is also order dense in <inline-formula><tex-math id="math-78"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, we can find <inline-formula><tex-math id="math-79"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in J ^ { + } \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-80"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < v \le u \end{document} ]]></tex-math></inline-formula>. The fact that <inline-formula><tex-math id="math-81"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> is an ideal gives <inline-formula><tex-math id="math-82"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in I \end{document} ]]></tex-math></inline-formula>, so that <inline-formula><tex-math id="math-83"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in ( I \cap J ) ^ { + } = I ^ { + } \cap J ^ { + } \end{document} ]]></tex-math></inline-formula>, and we also have <inline-formula><tex-math id="math-84"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < v \leq u \leq x \end{document} ]]></tex-math></inline-formula>. Therefore, it can be concluded that <inline-formula><tex-math id="math-85"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I ^ { + } \cap J ^ { + } \end{document} ]]></tex-math></inline-formula> is an order dense set in <inline-formula><tex-math id="math-86"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>.</p><p>We end this section by giving some examples.<target id="anchor-8a0325aa-84c8-4fc3-8cee-87dd80213756" target-type="reference-target"/></p><p>Example 2.4.</p><list list-type="order"><list-item><p>In the Riesz space <inline-formula><tex-math id="math-87"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> equipped with pointwise ordering, the set <inline-formula><tex-math id="math-88"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{ ( 1 , 1 ) \} \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-89"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \mathbb { R } ^ { 2 } ) ^ { + } \end{document} ]]></tex-math></inline-formula> since the ideal generated by it is the whole <inline-formula><tex-math id="math-90"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula>. On the other hand, the set <inline-formula><tex-math id="math-91"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{ ( 1 , 0 ) \} \end{document} ]]></tex-math></inline-formula> is not order dense in <inline-formula><tex-math id="math-92"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \mathbb { R } ^ { 2 } ) ^ { + } \end{document} ]]></tex-math></inline-formula> since there is no <inline-formula><tex-math id="math-93"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in I _ { \{ ( 1 , 0 ) \} } =\{ ( r , 0 ) : r \in \mathbb { R } \} \end{document} ]]></tex-math></inline-formula>  satisfying <inline-formula><tex-math id="math-94"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( 0 , 0 ) < x \leq ( 0 , 1 ) \end{document} ]]></tex-math></inline-formula>.</p></list-item><list-item><p>Let <inline-formula><tex-math id="math-95"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { \mathbb { N } } \end{document} ]]></tex-math></inline-formula> be the Riesz space of all sequences in <inline-formula><tex-math id="math-96"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } \end{document} ]]></tex-math></inline-formula> with pointwise ordering. Denote by <inline-formula><tex-math id="math-97"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E : = \{ e _ { n } : n \in \mathbb { N } \} \end{document} ]]></tex-math></inline-formula> the standard basis of <inline-formula><tex-math id="math-98"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { \mathbb { N } } \end{document} ]]></tex-math></inline-formula>. We are going to prove that <inline-formula><tex-math id="math-99"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E \end{document} ]]></tex-math></inline-formula> is an order dense set in <inline-formula><tex-math id="math-100"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \mathbb { R } ^ { \mathbb { N } } ) ^ { + } \end{document} ]]></tex-math></inline-formula>. To do this, take any <inline-formula><tex-math id="math-101"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in ( \mathbb { R } ^ { \mathbb { N } } ) ^ { + } \end{document} ]]></tex-math></inline-formula> which means <inline-formula><tex-math id="math-102"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \end{document} ]]></tex-math></inline-formula> has (at least) one positive term, say its k-th term with <inline-formula><tex-math id="math-103"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \in \mathbb N \end{document} ]]></tex-math></inline-formula>. It is clear that <inline-formula><tex-math id="math-104"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x ( k ) e _ { k } \in I _ { E } \end{document} ]]></tex-math></inline-formula> and furthermore, <inline-formula><tex-math id="math-105"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < x ( k ) e _ { k } \le x \end{document} ]]></tex-math></inline-formula>. It follows that <inline-formula><tex-math id="math-106"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-107"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \mathbb { R } ^ { \mathbb { N } } ) ^ { + } \end{document} ]]></tex-math></inline-formula>.</p></list-item></list></sec><sec id="sec-3"><title>3. BASIC PROPERTIES OF A-UO CONVERGENCE AND LIMIT UNIQUENESS</title><p>After performing the idea in defining order dense sets on the positive cone, we continue our discussion to the new concept of convergence we mentioned before. We propose the definition as follows.<target id="anchor-35abb501-f0f9-451c-ab92-ecc56c991f1e" target-type="reference-target"/></p><p><bold>Definition 3.1.</bold><italic>Given a nonempty set </italic><inline-formula><tex-math id="math-108"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic>. A net </italic><inline-formula><tex-math id="math-109"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic> in </italic><inline-formula><tex-math id="math-110"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> is said to be A-unbounded order convergent to </italic><inline-formula><tex-math id="math-111"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula><italic>, denoted by </italic><inline-formula><tex-math id="math-112"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { x _ { \alpha } \xrightarrow { A - u o } x , i f | x _ { \alpha } - x | \wedge u \xrightarrow { o } 0 } \end{array} \end{document} ]]></tex-math></inline-formula><italic> for all </italic><inline-formula><tex-math id="math-113"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in A \end{document} ]]></tex-math></inline-formula><italic>. Subsequently, the net </italic><inline-formula><tex-math id="math-114"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) \end{document} ]]></tex-math></inline-formula><italic> is said to be A-unbounded order convergence if there exists </italic><inline-formula><tex-math id="math-115"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula><italic> such that </italic><inline-formula><tex-math id="math-116"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - u o } x \end{document} ]]></tex-math></inline-formula><italic>. In this case, </italic><inline-formula><tex-math id="math-117"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \end{document} ]]></tex-math></inline-formula><italic> is called the </italic><inline-formula><tex-math id="math-118"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A - u o \end{document} ]]></tex-math></inline-formula><italic> limit of </italic><inline-formula><tex-math id="math-119"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p>As mentioned before, we write "<italic>A</italic>-uo" as an abbreviation of “<italic>A</italic>-unbounded order”. If <inline-formula><tex-math id="math-120"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - \mathrm { u o } } x \end{document} ]]></tex-math></inline-formula>, we call the element <inline-formula><tex-math id="math-121"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \end{document} ]]></tex-math></inline-formula> as <italic>A</italic>-uo limit of <inline-formula><tex-math id="math-122"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) \end{document} ]]></tex-math></inline-formula>. For <inline-formula><tex-math id="math-123"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = X ^ { + } \end{document} ]]></tex-math></inline-formula>, the convergence provided in Definition <xref ref-type="custom" custom-type="reference-target" rid="anchor-35abb501-f0f9-451c-ab92-ecc56c991f1e">3.1</xref> is equivalent to the definition of unbounded order presented in Section <xref ref-type="sec" rid="3cce471c-a258-b965-5ef1-3064b53c47ad">1</xref>. So, we will use the term "uo" instead of "<inline-formula><tex-math id="math-124"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } { - } \mathrm { u o } \end{document} ]]></tex-math></inline-formula>".</p><p>Before exploring some properties, it is important to notice the following equivalence:</p><disp-formula id="equation-1"><tex-math id="math-125"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}x_{\alpha}\xrightarrow{A-uo}x&\Longleftrightarrow|x_{\alpha}-x|\wedge u\xrightarrow{o}0\quad\text{for all }u\in A\\&\Longleftrightarrow\left||x_{\alpha}-x|-0\right|\wedge u\xrightarrow{o}0\quad\text{for all }u\in A\\&\Longleftrightarrow|x_{\alpha}-x|\xrightarrow{A-u_o}0.\end{aligned}\tag{1}\end{equation*} \end{document} ]]></tex-math></disp-formula><p>Thus, when studying some properties of <italic>A</italic>-uo convergence, it is suficient to study the <italic>A</italic>-uo convergence of positive nets to zero.</p><p>We now discuss the first property. The set <inline-formula><tex-math id="math-126"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> in the definition of <italic>A</italic>-uo convergence can be "extended” to <inline-formula><tex-math id="math-127"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I _ { A } ^ { + } \end{document} ]]></tex-math></inline-formula> in the following sense.<target id="anchor-c9882d47-519b-4cdd-80a7-21ef9d5d9ae4" target-type="reference-target"/></p><p><bold>Theorem 3.2.</bold><italic>Given </italic><inline-formula><tex-math id="math-128"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula><italic> and a nonempty set </italic><inline-formula><tex-math id="math-129"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic>. For any net </italic><inline-formula><tex-math id="math-130"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic> in </italic><inline-formula><tex-math id="math-131"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, we have </italic><inline-formula><tex-math id="math-132"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } { \xrightarrow { \ A - u o \ } } x \end{document} ]]></tex-math></inline-formula><italic> if and only if </italic><inline-formula><tex-math id="math-133"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { I _ { A } ^ { + } - u o } x \end{document} ]]></tex-math></inline-formula>.</p><p><italic>Proof.</italic> Since <inline-formula><tex-math id="math-134"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq I _ { A } ^ { + } \end{document} ]]></tex-math></inline-formula>, the backward implication is trivial. To prove the forward one, we may assume that <inline-formula><tex-math id="math-135"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> is in <inline-formula><tex-math id="math-136"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-137"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = 0 \end{document} ]]></tex-math></inline-formula> according to equivalence <xref ref-type="disp-formula" rid="equation-1">(1)</xref>.</p><p>Now, take any <inline-formula><tex-math id="math-138"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in I _ { A } ^ { + } \end{document} ]]></tex-math></inline-formula>. Then, there are <inline-formula><tex-math id="math-139"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n \in \mathbb { N } \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-140"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u _ { 1 } , u _ { 2 } , \dotsc , u _ { n } \in A \end{document} ]]></tex-math></inline-formula>, and nonnegative numbers <inline-formula><tex-math id="math-141"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle r _ { 1 } , r _ { 2 } , \ldots , r _ { n } \in \mathbb { R } \end{document} ]]></tex-math></inline-formula> such that</p><disp-formula id="equation-2"><tex-math id="math-142"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \leq \sum_ {k = 1} ^ {n} r _ {k} u _ {k}. \end{document} ]]></tex-math></disp-formula><p>From the assumption that <inline-formula><tex-math id="math-143"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A \mathrm { - u o } } 0 \end{document} ]]></tex-math></inline-formula>, we have <inline-formula><tex-math id="math-144"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge u _ { k } \stackrel { \mathrm { o } } { \to } 0 \end{document} ]]></tex-math></inline-formula> for all <inline-formula><tex-math id="math-145"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \in \{ 1 , 2 , \dots , n \} \end{document} ]]></tex-math></inline-formula>, so</p><disp-formula id="equation-3"><tex-math id="math-146"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}x_{\alpha}\wedge v&\leqx_{\alpha}\wedge\sum_{k=1}^{n}r_k u_k\leq\sum_{k=1}^{n}x_{\alpha}\wedge(r_k u_k)\\[1ex]&\leq\sum_{k=1}^{n}\left((r_k+1)x_{\alpha}\right)\wedge\left((r_k+1)u_k\right)\\[1ex]&=\sum_{k=1}^{n}(r_k+1)\left(x_{\alpha}\wedge u_k\right)\xrightarrow{o}0.\end{aligned}\end{equation*} \end{document} ]]></tex-math></disp-formula><p>Hence, <inline-formula><tex-math id="math-147"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { I _ { A } ^ { + } - \mathrm { u o } } 0 \end{document} ]]></tex-math></inline-formula> as desired.</p><p>Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-c9882d47-519b-4cdd-80a7-21ef9d5d9ae4">3.2</xref> provides convenience in proving the A-uo convergence of nets. If <inline-formula><tex-math id="math-148"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> is an ideal, instead of showing that <inline-formula><tex-math id="math-149"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle |x_{\alpha}-x|\wedge u\xrightarrow{o}0 \end{document} ]]></tex-math></inline-formula> for all <inline-formula><tex-math id="math-150"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in I ^ { + } \end{document} ]]></tex-math></inline-formula>, it is suficient to show the convergence for all u in a set that generates <inline-formula><tex-math id="math-151"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula>.<target id="anchor-34f97293-1d18-4eb5-b709-835b48ea4706" target-type="reference-target"/></p><p>Example 3.3.</p><list list-type="order"><list-item><p>Let <inline-formula><tex-math id="math-152"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle c _ { 0 0 } \end{document} ]]></tex-math></inline-formula> be the Riesz space of all sequences in <inline-formula><tex-math id="math-153"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } \end{document} ]]></tex-math></inline-formula> containing a finite number of nonzero terms equipped with pointwise ordering. Let <inline-formula><tex-math id="math-154"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E \end{document} ]]></tex-math></inline-formula> be the standard basis as in Example <xref ref-type="custom" custom-type="reference-target" rid="anchor-8a0325aa-84c8-4fc3-8cee-87dd80213756">2.4</xref>(2). As a subset of <inline-formula><tex-math id="math-155"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle c _ { 0 0 } \end{document} ]]></tex-math></inline-formula>, it is easy to see that the ideal generated by <inline-formula><tex-math id="math-156"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E \end{document} ]]></tex-math></inline-formula> is <inline-formula><tex-math id="math-157"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle c _ { 0 0 } \end{document} ]]></tex-math></inline-formula> itself.</p></list-item></list><p>Now, consider the sequence <inline-formula><tex-math id="math-158"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( n e _ { n } ) \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-159"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle c _ { 0 0 } \end{document} ]]></tex-math></inline-formula>. For any <inline-formula><tex-math id="math-160"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n , m \in \mathbb { N } \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-161"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n > m \end{document} ]]></tex-math></inline-formula>, we have <inline-formula><tex-math id="math-162"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( n e _ { n } ) \wedge e _ { m } = 0 \end{document} ]]></tex-math></inline-formula>, where <inline-formula><tex-math id="math-163"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \end{document} ]]></tex-math></inline-formula> is the zero sequence. This means the sequence <inline-formula><tex-math id="math-164"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( n e _ { n } \land e _ { m } ) _ { n \in \mathbb { N } } \end{document} ]]></tex-math></inline-formula> converge to 0 in order for all <inline-formula><tex-math id="math-165"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m \in \mathbb { N } \end{document} ]]></tex-math></inline-formula>. Thus, it gives <inline-formula><tex-math id="math-166"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n e _ { n } \xrightarrow { E - u o } 0 \end{document} ]]></tex-math></inline-formula>  and it implies <inline-formula><tex-math id="math-167"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n e _ { n } \xrightarrow { u o } 0 \end{document} ]]></tex-math></inline-formula> by Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-c9882d47-519b-4cdd-80a7-21ef9d5d9ae4">3.2</xref>.</p><list list-type="order"><list-item><p>In the Riesz space <inline-formula><tex-math id="math-168"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> with pointwise ordering, consider the sequence <inline-formula><tex-math id="math-169"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( ( 0 , n ) ) \end{document} ]]></tex-math></inline-formula> and ideal <inline-formula><tex-math id="math-170"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I = \{ ( r , 0 ) : r \in \mathbb { R } \} \end{document} ]]></tex-math></inline-formula>. It’s easy to see that <inline-formula><tex-math id="math-171"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | ( 0 , n ) - ( 0 , s ) | \wedge ( 1 , 0 ) \ { \overset { o } { \to } } \ ( 0 , 0 ) \end{document} ]]></tex-math></inline-formula> for all <inline-formula><tex-math id="math-172"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle s \in \mathbb R \end{document} ]]></tex-math></inline-formula>. Hence, since I is generated by <inline-formula><tex-math id="math-173"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{ ( 0 , 1 ) \} \end{document} ]]></tex-math></inline-formula>, we have <inline-formula><tex-math id="math-174"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( 0 , n ) \xrightarrow { I ^ { + } - u o } ( 0 , s ) \end{document} ]]></tex-math></inline-formula> for any <inline-formula><tex-math id="math-175"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle s \in \mathbb { R } \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p>Example <xref ref-type="custom" custom-type="reference-target" rid="anchor-34f97293-1d18-4eb5-b709-835b48ea4706">3.3</xref>(2) shows that the <italic>A</italic>-uo limit of a net is not unique in general. We provide a suficient condition for the uniqueness in the theorem below together with some algebraic properties of <italic>A</italic>-uo limit.<target id="anchor-643feb5d-6b47-4cf1-8ee4-99fa64f3c3c6" target-type="reference-target"/></p><p><bold>Theorem 3.4.</bold><italic>Let </italic><inline-formula><tex-math id="math-176"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> be a nonempty set, </italic><inline-formula><tex-math id="math-177"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-178"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( y _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic> be two nets in </italic><inline-formula><tex-math id="math-179"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, and </italic><inline-formula><tex-math id="math-180"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x , y \in X \end{document} ]]></tex-math></inline-formula><italic>. If </italic><inline-formula><tex-math id="math-181"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \ x _ { \alpha } \xrightarrow { A - u o } x \end{document} ]]></tex-math></inline-formula><italic>  and </italic><inline-formula><tex-math id="math-182"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y _ { \alpha } \xrightarrow { A - u o } y \end{document} ]]></tex-math></inline-formula><italic>, then</italic></p><list list-type="order"><list-item><p>if <inline-formula><tex-math id="math-183"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-184"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-185"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - u o } z \end{document} ]]></tex-math></inline-formula> for some <inline-formula><tex-math id="math-186"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z \in X \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-187"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z = x ; \end{document} ]]></tex-math></inline-formula></p></list-item><list-item><p><inline-formula><tex-math id="math-188"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { r x _ { \alpha } + s y _ { \alpha } \xrightarrow { A - u o } r x + s y  } \end{array} \end{document} ]]></tex-math></inline-formula><italic>  for all </italic><inline-formula><tex-math id="math-189"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle r , s \in \mathbb { R } ; \end{document} ]]></tex-math></inline-formula></p></list-item><list-item><p><inline-formula><tex-math id="math-190"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x _ { \alpha } | \xrightarrow { A - u o } | x | , x _ { \alpha } \vee y _ { \alpha } \xrightarrow { A - u o } x \vee y , x _ { \alpha } \wedge y _ { \alpha } \xrightarrow { A - u o } x \wedge y , x _ { \alpha } ^ { + } \xrightarrow { A - u o } x ^ { + } \end{document} ]]></tex-math></inline-formula><italic>, and </italic><inline-formula><tex-math id="math-191"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } ^ { - } \xrightarrow { A - u o } x ^ { - } ; \end{document} ]]></tex-math></inline-formula></p></list-item><list-item><p>if <inline-formula><tex-math id="math-192"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-193"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-194"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \le y _ { \alpha } \end{document} ]]></tex-math></inline-formula> for all index <inline-formula><tex-math id="math-195"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-196"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \leq y \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p><italic>Proof.</italic> According to Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-c9882d47-519b-4cdd-80a7-21ef9d5d9ae4">3.2</xref>, it can be assumed that <inline-formula><tex-math id="math-197"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = I ^ { + } \end{document} ]]></tex-math></inline-formula> for some ideal <inline-formula><tex-math id="math-198"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-199"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>.</p><list list-type="order"><list-item><p>Suppose <inline-formula><tex-math id="math-200"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x - z | > 0 \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-201"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-202"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>, there exists <inline-formula><tex-math id="math-203"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in A \end{document} ]]></tex-math></inline-formula> satisfying <inline-formula><tex-math id="math-204"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < v \leq | x - z | \end{document} ]]></tex-math></inline-formula>. Next, since <inline-formula><tex-math id="math-205"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - \mathsf { u o } } x \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-206"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A \mathrm { - u o } } z \end{document} ]]></tex-math></inline-formula>, we have</p></list-item></list><disp-formula id="equation-4"><tex-math id="math-207"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v = | x - z | \wedge v \leq \left(| x _ {\alpha} - x | + | x _ {\alpha} - z |\right) \wedge v \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-5"><tex-math id="math-208"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \leq | x _ {\alpha} - x | \wedge v + | x _ {\alpha} - z | \wedge v \stackrel {{\mathrm{o}}} {{\to}} 0, \end{document} ]]></tex-math></disp-formula><p>which implies <inline-formula><tex-math id="math-209"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v = 0 \end{document} ]]></tex-math></inline-formula>, a contradiction. As conclusion, <inline-formula><tex-math id="math-210"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x - z | = 0 \end{document} ]]></tex-math></inline-formula> or equivalently, <inline-formula><tex-math id="math-211"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z = x \end{document} ]]></tex-math></inline-formula>.</p><list list-type="order"><list-item><p>Pick any <inline-formula><tex-math id="math-212"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in A \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-213"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A \mathrm { - u o } } x \end{document} ]]></tex-math></inline-formula>  and <inline-formula><tex-math id="math-214"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y _ { \alpha } \xrightarrow { A \mathrm { - u o } } y \end{document} ]]></tex-math></inline-formula>, we have</p></list-item></list><disp-formula id="equation-6"><tex-math id="math-215"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l} 0 \leq | r x _ {\alpha} + s y _ {\alpha} - (r x + s y) | \wedge u \\ \quad \leq (| r | | x _ {\alpha} - x | + | s | | y _ {\alpha} - y |) \wedge u \\ \quad \leq (| r | | x _ {\alpha} - x |) \wedge u + (| s | | y _ {\alpha} - y |) \wedge u \\ \quad \leq ((| r | + 1) | x _ {\alpha} - x |) \wedge (| r | + 1) u + ((| s | + 1) | y _ {\alpha} - y |) \wedge (| s | + 1) u \\ = (| r | + 1) (| x _ {\alpha} - x | \wedge u) + (| s | + 1) (| y _ {\alpha} - y | \wedge u) \xrightarrow {o} 0. \end{array} \end{document} ]]></tex-math></disp-formula><p>Therefore, <inline-formula><tex-math id="math-216"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { r x _ { \alpha } + s y _ { \alpha } \xrightarrow { A - \mathrm { u o } } r x + s y \vphantom { A ^ { \alpha } } } \end{array} \end{document} ]]></tex-math></inline-formula>, as desired.</p><list list-type="order"><list-item><p>Let <inline-formula><tex-math id="math-217"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in A \end{document} ]]></tex-math></inline-formula> be arbitrary. Notice that <inline-formula><tex-math id="math-218"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ||x_{\alpha}|-|x||\leq|x_{\alpha}-x| \end{document} ]]></tex-math></inline-formula>. We have</p></list-item></list><disp-formula id="equation-7"><tex-math id="math-219"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \leq | | x _ {\alpha} | - | x | | \wedge u \leq | x _ {\alpha} - x | \wedge u \xrightarrow {o} 0, \end{document} ]]></tex-math></disp-formula><p>so that <inline-formula><tex-math id="math-220"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \vert \vert x _ { \alpha } \vert - \vert x \vert \vert \wedge u \ { \overset { \mathrm { o } } { \to } } \ 0 \end{document} ]]></tex-math></inline-formula>. Hence, <inline-formula><tex-math id="math-221"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| x _ { \alpha } \right| \xrightarrow { A \mathrm { - u o } } \left| x \right| \end{document} ]]></tex-math></inline-formula>. Furthermore, combining with part (2), we obtain</p><disp-formula id="equation-8"><tex-math id="math-222"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ {\alpha} \vee y _ {\alpha} = \frac {1}{2} (x _ {\alpha} + y _ {\alpha} + | x _ {\alpha} - y _ {\alpha} |) \xrightarrow {A \mathrm{-uo}} \frac {1}{2} (x + y + | x - y |) = x \vee y, \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-9"><tex-math id="math-223"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ {\alpha} \wedge y _ {\alpha} = \frac {1}{2} (x _ {\alpha} + y _ {\alpha} - | x _ {\alpha} - y _ {\alpha} |) \xrightarrow {A \mathrm{-uo}} \frac {1}{2} (x + y - | x - y |) = x \wedge y, \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-10"><tex-math id="math-224"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ {\alpha} ^ {+} = \frac {1}{2} (x _ {\alpha} + | x _ {\alpha} |) \xrightarrow {A - \mathrm{uo}} \frac {1}{2} (x + | x |) = x ^ {+}, \text {and} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-11"><tex-math id="math-225"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ {\alpha} ^ {-} = x _ {\alpha} ^ {+} - x _ {\alpha} \xrightarrow {A \mathrm{-uo}} x ^ {+} - x = x ^ {-}. \end{document} ]]></tex-math></disp-formula><list list-type="order"><list-item><p>Notice that <inline-formula><tex-math id="math-226"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge y _ { \alpha } \xrightarrow { A \mathrm { - u o } } x \wedge y \end{document} ]]></tex-math></inline-formula>. On the other hand, <inline-formula><tex-math id="math-227"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge y _ { \alpha } = x _ { \alpha } \xrightarrow { A - \mathrm { u o } } x . \end{document} ]]></tex-math></inline-formula> Using Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-643feb5d-6b47-4cf1-8ee4-99fa64f3c3c6">3.4</xref>(1), we have <inline-formula><tex-math id="math-228"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = x \land y \leq y \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p>The first result in Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-643feb5d-6b47-4cf1-8ee4-99fa64f3c3c6">3.4</xref> states that the order density of <inline-formula><tex-math id="math-229"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-230"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> guarantees the uniqueness of the <italic>A</italic>-uo limit of <italic>A</italic>-uo convergence net. We now show that this fact can be strengthened. Specifically, if <inline-formula><tex-math id="math-231"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-232"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B \end{document} ]]></tex-math></inline-formula> are order dense set in <inline-formula><tex-math id="math-233"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>, the <italic>A</italic>-uo and <italic>B</italic>-uo limit of any net (if exists) must be same. The converse is also true.<target id="anchor-ad75e0fd-f929-485c-b139-7fa59949ea34" target-type="reference-target"/></p><p><bold>Theorem 3.5.</bold><italic>Let </italic><inline-formula><tex-math id="math-234"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A , B \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> be two nonempty sets. These two statements are equivalent.</italic></p><list list-type="order"><list-item><p>Both <inline-formula><tex-math id="math-235"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-236"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B \end{document} ]]></tex-math></inline-formula> are order dense in <inline-formula><tex-math id="math-237"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>.</p></list-item><list-item><p>For every net <inline-formula><tex-math id="math-238"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) \end{document} ]]></tex-math></inline-formula> in X with <inline-formula><tex-math id="math-239"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - u o } x \end{document} ]]></tex-math></inline-formula>  and <inline-formula><tex-math id="math-240"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { B \textrm { - } u o } y \end{document} ]]></tex-math></inline-formula> for some <inline-formula><tex-math id="math-241"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x , y \in X \end{document} ]]></tex-math></inline-formula>, we have <inline-formula><tex-math id="math-242"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = y \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p>In particular, if <inline-formula><tex-math id="math-243"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = B \end{document} ]]></tex-math></inline-formula>, the order density of <inline-formula><tex-math id="math-244"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-245"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> is necessary and suficient to ensure the A-uo limit uniqueness.</p><p><italic>Proof.</italic> First, we may assume that <inline-formula><tex-math id="math-246"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = I ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-247"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B = J ^ { + } \end{document} ]]></tex-math></inline-formula> for some ideals <inline-formula><tex-math id="math-248"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-249"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle J \end{document} ]]></tex-math></inline-formula>. Now, it’s known that <inline-formula><tex-math id="math-250"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-251"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B \end{document} ]]></tex-math></inline-formula> are order dense in <inline-formula><tex-math id="math-252"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-253"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \ { \xrightarrow { \ A - \mathrm { u o } } } \ x \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-254"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A \cap B \mathrm { - u o } } x \end{document} ]]></tex-math></inline-formula>. On the other hand, since <inline-formula><tex-math id="math-255"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \ { \xrightarrow { B \mathrm { - u o } } } \ y , \end{document} ]]></tex-math></inline-formula> we also have <inline-formula><tex-math id="math-256"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A \cap B \mathrm { - u o } } y . \end{document} ]]></tex-math></inline-formula> Notice that <inline-formula><tex-math id="math-257"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \cap B \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-258"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> according to Lemma <xref ref-type="custom" custom-type="reference-target" rid="anchor-d31cdadd-63a9-46ee-9805-d693e9bdd505">2.3</xref>. Using Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-643feb5d-6b47-4cf1-8ee4-99fa64f3c3c6">3.4</xref>(1), we can conclude that <inline-formula><tex-math id="math-259"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = y \end{document} ]]></tex-math></inline-formula>.</p><p>For the reverse direction, it’s known that for every net <inline-formula><tex-math id="math-260"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-261"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-262"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \mathrm { i f ~ } } x _ { \alpha } { \xrightarrow { \ A - \mathrm { u o } } } x \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-263"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \ { \xrightarrow { B \mathrm { - u o } } } \ y , \end{document} ]]></tex-math></inline-formula> then <inline-formula><tex-math id="math-264"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = y \end{document} ]]></tex-math></inline-formula>. Suppose <inline-formula><tex-math id="math-265"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> isn’t order dense in <inline-formula><tex-math id="math-266"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>. It means that there is <inline-formula><tex-math id="math-267"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z \in X ^ { + } \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-268"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z > 0 \end{document} ]]></tex-math></inline-formula> and for any <inline-formula><tex-math id="math-269"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in A \end{document} ]]></tex-math></inline-formula> satisfying <inline-formula><tex-math id="math-270"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \leq z \end{document} ]]></tex-math></inline-formula>, we must have <inline-formula><tex-math id="math-271"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u = 0 \end{document} ]]></tex-math></inline-formula>. Now, pick <inline-formula><tex-math id="math-272"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \in A \end{document} ]]></tex-math></inline-formula> arbitrarily. Since <inline-formula><tex-math id="math-273"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = I ^ { + } \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-274"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> is an ideal, then <inline-formula><tex-math id="math-275"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \wedge z \in A \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-276"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \wedge z \leq z \end{document} ]]></tex-math></inline-formula>, so that <inline-formula><tex-math id="math-277"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | 0 - z | \wedge a = 0 \end{document} ]]></tex-math></inline-formula> must hold. It implies, <inline-formula><tex-math id="math-278"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \xrightarrow { A - \mathrm { u o } } z \end{document} ]]></tex-math></inline-formula>. However, it’s also true that <inline-formula><tex-math id="math-279"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \xrightarrow { B \mathrm { - u o } } 0 \end{document} ]]></tex-math></inline-formula>. Hence, we must have <inline-formula><tex-math id="math-280"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z = 0 \end{document} ]]></tex-math></inline-formula>, which is a contradiction. Therefore, <inline-formula><tex-math id="math-281"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> must be order dense in <inline-formula><tex-math id="math-282"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>, and it can be shown analogously that so is <inline-formula><tex-math id="math-283"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B \end{document} ]]></tex-math></inline-formula>. </p></sec><sec id="sec-4"><title>4. EXTENSION OF A TO \langle A \rangle ^ { + }</title><p>In Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-c9882d47-519b-4cdd-80a7-21ef9d5d9ae4">3.2</xref>, it has been shown that the set <inline-formula><tex-math id="math-284"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> in the definition of <italic>A</italic>-uo convergence can be expanded to <inline-formula><tex-math id="math-285"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I _ { A } ^ { + } \end{document} ]]></tex-math></inline-formula>. Now, it’s natural to ask whether we can extend <inline-formula><tex-math id="math-286"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> to the larger set, such as <inline-formula><tex-math id="math-287"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle A \rangle ^ { + } \end{document} ]]></tex-math></inline-formula>. This theorem below states that such expansion is possible in the Archimedean Riesz spaces.<target id="anchor-e1d076a6-a3fa-4a18-9abe-60694b44daa2" target-type="reference-target"/></p><p><bold>Theorem 4.1.</bold><italic>Let </italic><inline-formula><tex-math id="math-288"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> be an Archimedean Riesz space, </italic><inline-formula><tex-math id="math-289"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> be a nonempty set, and </italic><inline-formula><tex-math id="math-290"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula><italic>. For every net </italic><inline-formula><tex-math id="math-291"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic> in </italic><inline-formula><tex-math id="math-292"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, we have </italic><inline-formula><tex-math id="math-293"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - u o } x \end{document} ]]></tex-math></inline-formula><italic>  if and only if </italic><inline-formula><tex-math id="math-294"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { \langle A \rangle ^ { + } - u o } x \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p><italic>Proof.</italic> We first assume that <inline-formula><tex-math id="math-295"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = I ^ { + } \end{document} ]]></tex-math></inline-formula> for some ideal <inline-formula><tex-math id="math-296"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-297"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>. Also, we may assume that <inline-formula><tex-math id="math-298"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> is in <inline-formula><tex-math id="math-299"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-300"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = 0 \end{document} ]]></tex-math></inline-formula> based on equivalence (1). The backward implication of this theorem is trivial since <inline-formula><tex-math id="math-301"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq \langle A \rangle ^ { + } \end{document} ]]></tex-math></inline-formula>. So, it remains to show the forward one.</p><p>For the proof, we will use the notion of Dedekind completion of <inline-formula><tex-math id="math-302"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, denoted by <inline-formula><tex-math id="math-303"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula>. Readers who are not familiar with this concept may refer to <xref ref-type="bibr" rid="BIBR-8">[8]</xref> for details. We also use the fact provided in <xref ref-type="bibr" rid="BIBR-9">[9]</xref>, which states <inline-formula><tex-math id="math-304"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \stackrel { \mathrm { ~ o ~ } } { \to } x \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-305"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is equivalent to <inline-formula><tex-math id="math-306"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \stackrel { \mathrm { ~ o ~ } } { \to } x \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-307"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula> for any net <inline-formula><tex-math id="math-308"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-309"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-310"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula>. The assumption of Archimedean space for <inline-formula><tex-math id="math-311"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is needed since only Archimedean spaces have Dedekind completion.</p><p>Now, take any <inline-formula><tex-math id="math-312"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u\in\langle A\rangle^+ \end{document} ]]></tex-math></inline-formula>. Consider <inline-formula><tex-math id="math-313"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } \wedge u ) \end{document} ]]></tex-math></inline-formula> as a net on <inline-formula><tex-math id="math-314"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula>. Since it is bounded above by <inline-formula><tex-math id="math-315"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \end{document} ]]></tex-math></inline-formula> and bounded below by <inline-formula><tex-math id="math-316"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \end{document} ]]></tex-math></inline-formula>, we have</p><disp-formula id="equation-12"><tex-math id="math-317"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \limsup _ {\alpha} x _ {\alpha} \wedge u = \inf _ {\alpha} \sup _ {\beta \geq \alpha} x _ {\beta} \wedge u \end{document} ]]></tex-math></disp-formula><p>exists in <inline-formula><tex-math id="math-318"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula> . Next, we are going to show that <inline-formula><tex-math id="math-319"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname* { lim \: sup } _ { \alpha } x _ { \alpha } \wedge u = 0 \end{document} ]]></tex-math></inline-formula>.</p><p>Suppose on the contrary that <inline-formula><tex-math id="math-320"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname* { lim \: s u p } _ { \alpha } x _ { \alpha } \wedge u \neq 0 \end{document} ]]></tex-math></inline-formula> is true. This means that we can find a lower bound <inline-formula><tex-math id="math-321"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \in X ^ { \delta } \end{document} ]]></tex-math></inline-formula> for the net <inline-formula><tex-math id="math-322"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( \operatorname* { s u p } _ { \beta \geq \alpha } x _ { \beta } \wedge u \right) \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-323"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \not \leq 0 \end{document} ]]></tex-math></inline-formula>. Without loss of generality, we may assume that <inline-formula><tex-math id="math-324"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y > 0 \end{document} ]]></tex-math></inline-formula> (otherwise, pick <inline-formula><tex-math id="math-325"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \vee 0 \end{document} ]]></tex-math></inline-formula> to replace <inline-formula><tex-math id="math-326"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y ) \end{document} ]]></tex-math></inline-formula>. Using the definition of Dedekind completion, there exists <inline-formula><tex-math id="math-327"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z \in X \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-328"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < z \le y \end{document} ]]></tex-math></inline-formula>. Notice that for every index <inline-formula><tex-math id="math-329"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \end{document} ]]></tex-math></inline-formula>,</p><disp-formula id="equation-13"><tex-math id="math-330"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < z \leq y \leq \sup _ {\beta \geq \alpha} x _ {\beta} \wedge u \leq \sup _ {\beta \geq \alpha} u = u, \end{document} ]]></tex-math></disp-formula><p>so, since <inline-formula><tex-math id="math-331"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \in \langle A \rangle ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-332"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ⟨A⟩ \end{document} ]]></tex-math></inline-formula> is an ideal in <inline-formula><tex-math id="math-333"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, we get <inline-formula><tex-math id="math-334"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z \in \langle A \rangle ^ { + } \end{document} ]]></tex-math></inline-formula>.</p><p>Now, using Theorem 7.8 in <xref ref-type="bibr" rid="BIBR-6">[6]</xref>, <inline-formula><tex-math id="math-335"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z=\sup\{v\in A:v\le z\} \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-336"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z > 0 \end{document} ]]></tex-math></inline-formula>, we can find <inline-formula><tex-math id="math-337"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in A \end{document} ]]></tex-math></inline-formula> satisfying <inline-formula><tex-math id="math-338"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0<v\le z \end{document} ]]></tex-math></inline-formula>. Futhermore, <inline-formula><tex-math id="math-339"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \end{document} ]]></tex-math></inline-formula> also satisfy  <inline-formula><tex-math id="math-340"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0<v<z\le y\le u \end{document} ]]></tex-math></inline-formula>, so </p><p><inline-formula><tex-math id="math-341"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}v\wedge\sup_{\beta\ge\alpha}x_\beta\wedge u&\ge v\wedge y\\&\Longleftrightarrow\sup_{\beta\ge\alpha}x_\beta\wedge u\wedge v\ge v\\&\Longleftrightarrow\sup_{\beta\ge\alpha}x_\beta\wedge v\ge v\\&\Longrightarrow\lim_{\alpha}\sup x_\alpha\wedge v\ge\inf_{\alpha}v=v>0.\end{aligned}\end{equation*} \end{document} ]]></tex-math></inline-formula></p><p>On the other hand, <inline-formula><tex-math id="math-342"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \in A \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-343"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - \mathrm { u o } } 0 \end{document} ]]></tex-math></inline-formula> on <inline-formula><tex-math id="math-344"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>, so we have <inline-formula><tex-math id="math-345"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge v \ { \overset { \mathrm { o } } { \to } } \: 0 \end{document} ]]></tex-math></inline-formula> on <inline-formula><tex-math id="math-346"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> which implies <inline-formula><tex-math id="math-347"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge v \ { \overset { \mathrm { o } } { \to } } 0 \end{document} ]]></tex-math></inline-formula> di <inline-formula><tex-math id="math-348"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula>. It contradicts with the fact that <inline-formula><tex-math id="math-349"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname* { lim \: s u p } _ { \alpha } x _ { \alpha } \wedge v > 0 \end{document} ]]></tex-math></inline-formula> di <inline-formula><tex-math id="math-350"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula>. Hence, it must be true that <inline-formula><tex-math id="math-351"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname* { lim \: s u p }_{ \alpha } x _ { \alpha } \wedge u = 0 \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-352"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula>.</p><p>Last, notice also that <inline-formula><tex-math id="math-353"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname* { lim \: i n f }_{ \alpha } x _ { \alpha } \wedge u \geq \operatorname* { lim \: i n f }_{ \alpha } 0 = 0 \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-354"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula>, so it can be conclude that <inline-formula><tex-math id="math-355"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge u \ { \overset { \mathrm { o } } { \to } } \ 0 \end{document} ]]></tex-math></inline-formula> di <inline-formula><tex-math id="math-356"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { \delta } \end{document} ]]></tex-math></inline-formula> which gives <inline-formula><tex-math id="math-357"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \wedge u \ { \overset { \mathrm { o } } { \to } } \ 0 \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-358"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>. As conclusion, <inline-formula><tex-math id="math-359"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { \mathrm { u o } } 0 \end{document} ]]></tex-math></inline-formula> .</p><p>An element <inline-formula><tex-math id="math-360"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle e > 0 \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-361"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is called weak (order) unit if <inline-formula><tex-math id="math-362"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle \{ e \} \rangle = X \end{document} ]]></tex-math></inline-formula>. If <inline-formula><tex-math id="math-363"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is Archimedean and has a weak unit <inline-formula><tex-math id="math-364"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle e , \end{document} ]]></tex-math></inline-formula> Samuel Kaplan <xref ref-type="bibr" rid="BIBR-3">[3]</xref> and Gao and Xanthos <xref ref-type="bibr" rid="BIBR-4">[4]</xref> gave a fact that to verify the uo convergence of <inline-formula><tex-math id="math-365"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) \end{document} ]]></tex-math></inline-formula> to <inline-formula><tex-math id="math-366"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula>, it is suficient to check whether <inline-formula><tex-math id="math-367"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x _ { \alpha } - x | \wedge e \end{document} ]]></tex-math></inline-formula> is convergent in order to <inline-formula><tex-math id="math-368"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \end{document} ]]></tex-math></inline-formula>. In this paper, we have a stronger statement as a corollary of Lemma <xref ref-type="custom" custom-type="reference-target" rid="anchor-1586b17e-23e9-474f-b2b2-594dac47635f">2.2</xref> and Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-e1d076a6-a3fa-4a18-9abe-60694b44daa2">4.1</xref>.</p><p><bold>Corollary 4.2.</bold><italic>Given an Archimedean Riesz space </italic><inline-formula><tex-math id="math-369"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, a nonempty set </italic><inline-formula><tex-math id="math-370"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic>,  </italic><inline-formula><tex-math id="math-371"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula><italic>, and a net </italic><inline-formula><tex-math id="math-372"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula><italic> in </italic><inline-formula><tex-math id="math-373"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><list list-type="order"><list-item><p>If <inline-formula><tex-math id="math-374"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is order dense in <inline-formula><tex-math id="math-375"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X ^ { + } \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-376"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - u o } x \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-377"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { u o } x \end{document} ]]></tex-math></inline-formula>.</p></list-item><list-item><p>If <inline-formula><tex-math id="math-378"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> has a weak unit <inline-formula><tex-math id="math-379"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle e > 0 \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-380"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { u o } x \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-381"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| x _ { \alpha } - x \right| \wedge e { \overset { o } { \to } } 0 \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p>In general, <italic>A</italic>-uo convergence is not equivalent to <italic>B</italic>-uo convergence for two diferent sets <inline-formula><tex-math id="math-382"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A , B \in X ^ { + } \end{document} ]]></tex-math></inline-formula>. It raises a question about when <italic>A</italic>-uo and <italic>B</italic>-uo convergence are actually equivalent. Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-e1d076a6-a3fa-4a18-9abe-60694b44daa2">4.1</xref> gives a suficient condition for it in an Archimedean space, that is when <inline-formula><tex-math id="math-383"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B = \langle A \rangle ^ { + } \end{document} ]]></tex-math></inline-formula>. In fact, using this theorem, we can deduce a suficient and necessary condition for the equivalence.<target id="anchor-fec92dda-a60e-4e1c-ac7c-e0527e8910c4" target-type="reference-target"/></p><p><bold>Theorem 4.3.</bold><italic>Let </italic><inline-formula><tex-math id="math-384"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> be an Archimedean Riesz space and </italic><inline-formula><tex-math id="math-385"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A , B \subseteq X ^ { + } \end{document} ]]></tex-math></inline-formula><italic> be two nonempty sets. The following two statements are equivalent.</italic></p><list list-type="order"><list-item><p><inline-formula><tex-math id="math-386"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle A \rangle = \langle B \rangle \end{document} ]]></tex-math></inline-formula><italic>.</italic></p></list-item><list-item><p>For every net <inline-formula><tex-math id="math-387"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-388"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-389"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in X \end{document} ]]></tex-math></inline-formula>, we have <inline-formula><tex-math id="math-390"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A - u o } x \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-391"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { B - u o } x . \end{document} ]]></tex-math></inline-formula></p></list-item></list><p><italic>Proof.</italic> The implication <inline-formula><tex-math id="math-392"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( 1 ) \implies ( 2 ) \end{document} ]]></tex-math></inline-formula> is clear according to Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-e1d076a6-a3fa-4a18-9abe-60694b44daa2">4.1</xref>. It remains to show the reverse implication. To do that, we may assume at first that <inline-formula><tex-math id="math-393"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = I ^ { + } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-394"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B = J ^ { + } \end{document} ]]></tex-math></inline-formula> for some ideals <inline-formula><tex-math id="math-395"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I , J \subseteq X \end{document} ]]></tex-math></inline-formula> based on Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-c9882d47-519b-4cdd-80a7-21ef9d5d9ae4">3.2</xref>.</p><p>Now, take any <inline-formula><tex-math id="math-396"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle b \in B \end{document} ]]></tex-math></inline-formula> and let <inline-formula><tex-math id="math-397"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D = \{ a \in A : a \leq b \} \end{document} ]]></tex-math></inline-formula>. For each <inline-formula><tex-math id="math-398"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a _ { 1 } , a _ { 2 } \in D \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-399"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a _ { 1 } \vee a _ { 2 } \in A \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-400"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a _ { 1 } \vee a _ { 2 } \le b \end{document} ]]></tex-math></inline-formula> hold, so that <inline-formula><tex-math id="math-401"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a _ { 1 } \vee a _ { 2 } \in D \end{document} ]]></tex-math></inline-formula>. Consequently, <inline-formula><tex-math id="math-402"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D \end{document} ]]></tex-math></inline-formula> is a directed set with the same order relation as <inline-formula><tex-math id="math-403"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>. Next, define a net <inline-formula><tex-math id="math-404"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x _ { \alpha } ) _ { \alpha \in D } \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-405"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } = \alpha \end{document} ]]></tex-math></inline-formula> for each <inline-formula><tex-math id="math-406"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in D \end{document} ]]></tex-math></inline-formula>. It is clear that <inline-formula><tex-math id="math-407"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \uparrow \end{document} ]]></tex-math></inline-formula>.</p><p>Pick any <inline-formula><tex-math id="math-408"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \in A \end{document} ]]></tex-math></inline-formula>. We obtain <inline-formula><tex-math id="math-409"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( b - x _ { \alpha } ) \wedge a \ \downarrow \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-410"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 \end{document} ]]></tex-math></inline-formula> is the lower bound of the net <inline-formula><tex-math id="math-411"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( ( b - x _ { \alpha } ) \wedge a ) _ { \alpha \in D } \end{document} ]]></tex-math></inline-formula>. Next, take any lower bound of the net, say <inline-formula><tex-math id="math-412"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v \end{document} ]]></tex-math></inline-formula>. It is obtained that <inline-formula><tex-math id="math-413"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u = v \vee 0 \end{document} ]]></tex-math></inline-formula> is also its lower bound or in other words, <inline-formula><tex-math id="math-414"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \leq ( b - x _ { \alpha } ) \wedge \: a \end{document} ]]></tex-math></inline-formula> for every <inline-formula><tex-math id="math-415"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in D \end{document} ]]></tex-math></inline-formula>. This fact gives <inline-formula><tex-math id="math-416"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \leq a \end{document} ]]></tex-math></inline-formula>, so that <inline-formula><tex-math id="math-417"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u + \alpha \in A \end{document} ]]></tex-math></inline-formula> for all <inline-formula><tex-math id="math-418"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in D \end{document} ]]></tex-math></inline-formula> since <inline-formula><tex-math id="math-419"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = I ^ { + } \end{document} ]]></tex-math></inline-formula> for some ideal <inline-formula><tex-math id="math-420"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \end{document} ]]></tex-math></inline-formula>. We also have <inline-formula><tex-math id="math-421"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u + \alpha = u + x _ { \alpha } \leq b \end{document} ]]></tex-math></inline-formula>. Therefore, <inline-formula><tex-math id="math-422"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u + a \in D \end{document} ]]></tex-math></inline-formula>, which implies <inline-formula><tex-math id="math-423"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \leq ( b - x _ { u + \alpha } ) \wedge a \end{document} ]]></tex-math></inline-formula> for all <inline-formula><tex-math id="math-424"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in D \end{document} ]]></tex-math></inline-formula>. Using mathematical induction, it can be shown that for every <inline-formula><tex-math id="math-425"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n \in \mathbb { N } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-426"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in D \end{document} ]]></tex-math></inline-formula>, we have <inline-formula><tex-math id="math-427"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \leq ( b - x _ { n u + \alpha } ) \wedge a . \end{document} ]]></tex-math></inline-formula></p><p>From the result above, we obtain  <inline-formula><tex-math id="math-428"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle nu ≤ nu + ~ \alpha ~ = ~ n u + x _ { \alpha } ~ \le ~ b \end{document} ]]></tex-math></inline-formula> for all <inline-formula><tex-math id="math-429"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle n \in \mathbb N \end{document} ]]></tex-math></inline-formula>. It implies that <inline-formula><tex-math id="math-430"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle u \end{document} ]]></tex-math></inline-formula> must be zero since <inline-formula><tex-math id="math-431"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is Archimedean. This results in in <inline-formula><tex-math id="math-432"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname* { i n f }_{ \alpha \in D } ( b - x _ { \alpha } ) \wedge a = 0 \end{document} ]]></tex-math></inline-formula>, so that <inline-formula><tex-math id="math-433"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x _ { \alpha } - b | \wedge a = ( b - x _ { \alpha } ) \wedge a \ { \stackrel { \mathrm { o } } { \to } } \ 0 \end{document} ]]></tex-math></inline-formula>. So, since <inline-formula><tex-math id="math-434"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> is arbitrary, we obtain <inline-formula><tex-math id="math-435"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A \mathrm { - u o } } b \end{document} ]]></tex-math></inline-formula>.</p><p>Finally, using the assumption (2), we get <inline-formula><tex-math id="math-436"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \ { \xrightarrow { \ B - \mathrm { u o } } } \ b \end{document} ]]></tex-math></inline-formula>, so that <inline-formula><tex-math id="math-437"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | b - x _ { \alpha } | = | b - x _ { \alpha } | \wedge b { \ } { \overset { \mathrm { o } } { \to } } 0 \end{document} ]]></tex-math></inline-formula>  or equivalently, <inline-formula><tex-math id="math-438"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \stackrel { \mathrm { ~ o ~ } } { \to } b \end{document} ]]></tex-math></inline-formula>. Consequently <inline-formula><tex-math id="math-439"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \uparrow b \end{document} ]]></tex-math></inline-formula>, so that</p><disp-formula id="equation-14"><tex-math id="math-440"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sup \{a \in A: a \leq b \} = \sup D = \sup \left\{x _ {\alpha}: \alpha \in D \right\} = b, \end{document} ]]></tex-math></disp-formula><p>Based on Theorem 7.8 in <xref ref-type="bibr" rid="BIBR-6">[6]</xref>, we obtain <inline-formula><tex-math id="math-441"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle b \in \langle A \rangle \end{document} ]]></tex-math></inline-formula>, which implies <inline-formula><tex-math id="math-442"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B \subseteq \langle A \rangle \end{document} ]]></tex-math></inline-formula>. Analogously, we can show <inline-formula><tex-math id="math-443"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subseteq \langle B \rangle \end{document} ]]></tex-math></inline-formula>. Thus, it is proven that <inline-formula><tex-math id="math-444"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle A \rangle = \langle B \rangle \end{document} ]]></tex-math></inline-formula>.</p><p>As a remark, we note that Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-fec92dda-a60e-4e1c-ac7c-e0527e8910c4">4.3</xref> may not be hold in non-Archimedean Riesz spaces. For instance, on the Riesz space <inline-formula><tex-math id="math-445"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> with lexicographic order relation, let <inline-formula><tex-math id="math-446"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = \{ ( 0 , y ) : y \in \mathbb { R } \} \end{document} ]]></tex-math></inline-formula>. It can be shown that <inline-formula><tex-math id="math-447"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \end{document} ]]></tex-math></inline-formula> is a band in <inline-formula><tex-math id="math-448"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula>. Now, take any net <inline-formula><tex-math id="math-449"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> in <inline-formula><tex-math id="math-450"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-451"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-452"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } { \xrightarrow { A ^ { + } - u \mathrm { o } } } x \end{document} ]]></tex-math></inline-formula>. We have <inline-formula><tex-math id="math-453"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle |x_{\alpha}-x|\wedge(0,2)\xrightarrow{o}(0,0) \end{document} ]]></tex-math></inline-formula>, so there is a net <inline-formula><tex-math id="math-454"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( z _ { \beta } \right) \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-455"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z _ { \beta } \downarrow ( 0 , 0 ) \end{document} ]]></tex-math></inline-formula> and for each index <inline-formula><tex-math id="math-456"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \beta \end{document} ]]></tex-math></inline-formula>, there is index <inline-formula><tex-math id="math-457"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { \beta } \end{document} ]]></tex-math></inline-formula> such that for every index <inline-formula><tex-math id="math-458"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-459"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \geq \alpha _ { \beta } , | x _ { \alpha } - x | \land ( 0 , 2 ) \leq z _ { \beta } \end{document} ]]></tex-math></inline-formula> is hold.</p><p>Since <inline-formula><tex-math id="math-460"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> is totally ordered, there must be an index <inline-formula><tex-math id="math-461"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \beta ^ { \prime } \end{document} ]]></tex-math></inline-formula> satisfying <inline-formula><tex-math id="math-462"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z _ { \beta ^ { \prime } } \leq ( 0 , 1 ) \end{document} ]]></tex-math></inline-formula>. Consequently, for any index <inline-formula><tex-math id="math-463"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-464"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \geq \alpha _ { \beta ^ { \prime } } \end{document} ]]></tex-math></inline-formula>, we have</p><p><inline-formula><tex-math id="math-465"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| x _ {\alpha} - x \right| \wedge (0, 2) \leq z _ {\beta^ {\prime}} \leq (0, 1) \end{document} ]]></tex-math></inline-formula></p><p>which gives <inline-formula><tex-math id="math-466"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | x _ { \alpha } - x | \leq ( 0 , 2 ) \end{document} ]]></tex-math></inline-formula>. So, for each index <inline-formula><tex-math id="math-467"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \beta \end{document} ]]></tex-math></inline-formula>, there is an index <inline-formula><tex-math id="math-468"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 0 } \end{document} ]]></tex-math></inline-formula> which is an upper bound of <inline-formula><tex-math id="math-469"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \big \{ \alpha _ { \beta } , \alpha _ { \beta ^ { \prime } } \big \} \end{document} ]]></tex-math></inline-formula> such that for each index <inline-formula><tex-math id="math-470"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-471"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \geq \alpha _ { 0 } \end{document} ]]></tex-math></inline-formula>, it is true that</p><disp-formula id="equation-15"><tex-math id="math-472"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| x _ {\alpha} - x \right| = \left| x _ {\alpha} - x \right| \wedge (0, 2) \leq z _ {\beta}, \end{document} ]]></tex-math></disp-formula><p>which means <inline-formula><tex-math id="math-473"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \stackrel { \mathrm { ~ o ~ } } { \to } x \end{document} ]]></tex-math></inline-formula>.</p><p>Since an order convergent net is also uo convergent, we obtain <inline-formula><tex-math id="math-474"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \ { \xrightarrow { \mathrm { u o } } } \ x \end{document} ]]></tex-math></inline-formula>. This shows that <inline-formula><tex-math id="math-475"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { A ^ { + } - \mathsf { u o } } x \end{document} ]]></tex-math></inline-formula> is equivalent to <inline-formula><tex-math id="math-476"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x _ { \alpha } \xrightarrow { \mathrm { u o } } x \end{document} ]]></tex-math></inline-formula> for each <inline-formula><tex-math id="math-477"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left( x _ { \alpha } \right) \end{document} ]]></tex-math></inline-formula> net in <inline-formula><tex-math id="math-478"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-479"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \boldsymbol { x } \in \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula>. However, it is easy to see that <inline-formula><tex-math id="math-480"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \langle A ^ { + } \rangle \neq \langle ( \mathbb { R } ^ { 2 } ) ^ { + } \rangle \end{document} ]]></tex-math></inline-formula>. Thus, Theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-fec92dda-a60e-4e1c-ac7c-e0527e8910c4">4.3</xref> does not hold on the Riesz spaces <inline-formula><tex-math id="math-481"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula> with lexicographic order relation.</p></sec></body><back><ref-list><title>REFERENCES</title><ref id="BIBR-1"><element-citation publication-type="journal"><article-title>Ergodic theorems in semi-ordered linear spaces</article-title><source>Annals of Mathematics</source><volume>49</volume><issue>3</issue><person-group person-group-type="author"><name><surname>Nakano</surname><given-names>H.</given-names></name></person-group><year>1948</year><page-range>538-556,</page-range><pub-id pub-id-type="doi">10.2307/1969044</pub-id></element-citation></ref><ref id="BIBR-2"><element-citation publication-type="journal"><article-title>Partially ordered linear spaces and locally convex linear topological spaces</article-title><source>Illinois Journal of Mathematics</source><volume>8</volume><issue>4</issue><person-group person-group-type="author"><name><surname>DeMarr</surname><given-names>R.</given-names></name></person-group><year>1964</year><page-range>601-606,</page-range><pub-id pub-id-type="doi">10.1215/ijm/1256059459</pub-id></element-citation></ref><ref id="BIBR-3"><element-citation publication-type="journal"><article-title>On unbounded order convergence</article-title><source>Real Analysis Exchange</source><volume>23</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Kaplan</surname><given-names>S.</given-names></name></person-group><year>1997</year><page-range>175-184,</page-range><ext-link xlink:href="https://sl1nk.com/UvsTy" ext-link-type="uri" xlink:title="UvsTy">UvsTy</ext-link></element-citation></ref><ref id="BIBR-4"><element-citation publication-type="journal"><article-title>Unbounded order convergence and application to martingales without probability</article-title><source>Journal of Mathematical Analysis and Applications</source><volume>415</volume><person-group person-group-type="author"><name><surname>Gao</surname><given-names>N.</given-names></name><name><surname>Xanthos</surname><given-names>F.</given-names></name></person-group><year>2014</year><page-range>931-943,</page-range><pub-id pub-id-type="doi">10.1016/j.jmaa.2014.01.078</pub-id></element-citation></ref><ref id="BIBR-5"><element-citation publication-type="journal"><article-title>Unbounded order convergence in dual spaces</article-title><source>Journal of Mathematical Analysis and Applications</source><volume>419</volume><person-group person-group-type="author"><name><surname>Gao</surname><given-names>N.</given-names></name></person-group><year>2014</year><page-range>347-354,</page-range><pub-id pub-id-type="doi">10.1016/j.jmaa.2014.04.067</pub-id></element-citation></ref><ref id="BIBR-6"><element-citation publication-type="book"><article-title>Introduction to operator theory in Riesz spaces</article-title><person-group person-group-type="author"><name><surname>Zaanen</surname><given-names>A.C.</given-names></name></person-group><year>1997</year><publisher-name>Springer</publisher-name><pub-id pub-id-type="doi">10.1007/978-3-642-60637-3</pub-id></element-citation></ref><ref id="BIBR-7"><element-citation publication-type="book"><article-title>Positive operators</article-title><person-group person-group-type="author"><name><surname>Aliprantis</surname><given-names>C.D.</given-names></name><name><surname>Burkinshaw</surname><given-names>O.</given-names></name></person-group><year>2006</year><publisher-name>Springer</publisher-name><pub-id pub-id-type="doi">10.1007/978-1-4020-5008-4</pub-id></element-citation></ref><ref id="BIBR-8"><element-citation publication-type="book"><article-title>Riesz spaces</article-title><person-group person-group-type="author"><name><surname>Luxemburg</surname><given-names>W.A.J.</given-names></name><name><surname>Zaanen</surname><given-names>A.C.</given-names></name></person-group><year>1971</year><publisher-name>North-Holland Publishing Company</publisher-name><pub-id pub-id-type="doi">10.1016/s0924-6509(08)70481-1</pub-id></element-citation></ref><ref id="BIBR-9"><element-citation publication-type="journal"><article-title>On order convergence of nets</article-title><source>Positivity</source><volume>9</volume><person-group person-group-type="author"><name><surname>Abramovich</surname><given-names>Y.</given-names></name><name><surname>Sirotkin</surname><given-names>G.</given-names></name></person-group><year>2005</year><page-range>287-292,</page-range><pub-id pub-id-type="doi">10.1007/s11117-004-7543-x</pub-id></element-citation></ref></ref-list></back></article>