<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD with MathML3 v1.1d2 20140930//EN" "JATS-journalpublishing1-mathml3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="1.1d2" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">JAM</journal-id>
      <journal-id journal-id-type="publisher-id">ICCK</journal-id>
      <journal-title-group>
        <journal-title>ICCK Journal of Applied Mathematics</journal-title>
      </journal-title-group>
      <issn pub-type="ppub" publication-format="print"/>
      <issn pub-type="epub" publication-format="electronic">3068-5656</issn>
      <publisher>
        <publisher-name>Institute of Central Computation and Knowledge Inc</publisher-name>
        <publisher-loc>522 W RIVERSIDE AVE STE N, SPOKANE, WA, 99201, UNITED STATES</publisher-loc>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.62762/JAM.2025.997630</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Bornological Semi Continuous Maps</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-3474-2956</contrib-id>
          <name>
            <surname>AL-Basri</surname>
            <given-names>Fatma Kamil</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff1"><label>1</label>Department of Mathematics, College of Education, University of Al-Qadisiyah, Al-Diwaniyah 58001, Iraq</aff>
      </contrib-group>
      <author-notes>
        <corresp id="cor1">Corresponding Author: Fatma Kamil AL-Basri. Email: <email>fatma.Albasri@qu.edu.iq</email></corresp>
      </author-notes>
      <pub-date date-type="pub" pub-type="epub" publication-format="online">
        <day>04</day>
        <month>8</month>
        <year>2025</year>
      </pub-date>
      <volume>1</volume>
      <issue>2</issue>
      <fpage>62</fpage>
      <lpage>65</lpage>
      <history>
        <date date-type="received">
          <day>18</day>
          <month>6</month>
          <year>2025</year>
        </date>
        <date date-type="accepted">
          <day>11</day>
          <month>7</month>
          <year>2025</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2025 by the Author. Published by Institute of Central Computation and Knowledge. This is an open access article under the CC BY license (https://creati
vecommons.org/licenses/by/4.0/).</copyright-statement>
        <copyright-year>2025</copyright-year>
        <copyright-holder>The Author</copyright-holder>
        <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
        <license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
        </license>
      </permissions>
      <self-uri xlink:href="https://www.icck.org/article/abs/jam.2025.997630">This article is available from https://www.icck.org/article/abs/jam.2025.997630</self-uri>
      <abstract>
        <p>In the current study, a new approach had been constructed to define new maps using the concept of bornological semi open and bornological semi closed sets, which includes sequential bornological semi continuous maps, bornological semi closed (open) maps, bornological strongly semi closed (open) maps, and bornological semi-irresolute closed (open) maps. We investigate and study the properties of these concepts.</p>
      </abstract>
      <kwd-group kwd-group-type="author" xml:lang="en">
        <kwd>bornological semi open map</kwd>
        <kwd>bornological semi closed map</kwd>
        <kwd>bornological semi continuous map</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="S1">
      <label>1.</label>
      <title>Introduction</title>
      <p id="S1.p1">Bornology on a set and convergence of sequences in bornological vector space have been studied by H. Hogbe-Nlend after he introduced b-closed set (b-open set) [<xref rid="ref001" ref-type="bibr">1</xref>]. The concepts of a semi-bounded set, a semi-bounded linear map, semi-convergence, and the concept of a semi-unbounded linear map in bornological space and product space are also introduced by [<xref rid="ref002" ref-type="bibr">2</xref>]. In [<xref rid="ref003" ref-type="bibr">3</xref>, <xref rid="ref004" ref-type="bibr">4</xref>], Al-Basri studied the concepts of a bornological semi-convergent net in convex (bvs) space. Ameer [<xref rid="ref002" ref-type="bibr">2</xref>] defined the concept of semi-compactness in bornological space. Semi-open, strongly semi-open, and semi-irresolute open sets play an important role in the study of continuity generalizations in topological spaces. By using these sets, many authors introduced and investigated various types of modifications to continuity. In 1963, Levine [<xref rid="ref005" ref-type="bibr">5</xref>] introduced the notions of semi-open sets and semi-continuity in topological spaces. It is shown in [<xref rid="ref006" ref-type="bibr">6</xref>] that semi-continuity is equivalent to quasi-continuity based on the work of Marcus [<xref rid="ref007" ref-type="bibr">7</xref>]. The concepts of strongly continuous maps found in [<xref rid="ref008" ref-type="bibr">8</xref>] and semi-generalized irresolute maps can be found in [<xref rid="ref009" ref-type="bibr">9</xref>].</p>
      <p id="S1.p2">In this work, new types of maps in convex bornological vector space "cbvs" within bornological vector space <inline-formula><mml:math alttext="E" display="inline"><mml:mi>E</mml:mi></mml:math></inline-formula> will be introduced. Further properties about sequentially bornological semi continuous "seq bs-cont" maps, bornological semi closed "bs-cl" maps, bornological strongly semi closed "bss-cl" maps, bornological semi irresolute closed "bsi-cl" maps, bornological semi open "bs-op" maps, bornological strongly semi open "bss-op" maps, and bornological semi irresolute open "bsi-op" maps have been introduced with their relationships.</p>
    </sec>
    <sec id="S2">
      <label>2.</label>
      <title>Preliminaries</title>
      <statement id="Thmdefinition1">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmdefinition1.p1">
          <italic>Consider <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> as a bornological vector space (bvs). A subset <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> of <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> is said to be bornological semi-open (bs-op, in short) if for every sequence <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq E" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula>, and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\in A" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\forall n&gt;n_{o}" display="inline"><m:mrow><m:mrow><m:mo rspace="0.167em">∀</m:mo><m:mi>n</m:mi></m:mrow><m:mo>&gt;</m:mo><m:msub><m:mi>n</m:mi><m:mi>o</m:mi></m:msub></m:mrow></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmdefinition2">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmdefinition2.p1">
          <italic>Consider <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> as a bounded vector space (bvs). A subset <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> contained within <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> is termed bornological semi-closed or abbreviated as bs-cl if the following condition is satisfied: If you have a sequence <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\{x_{n}\}" display="inline"><m:mrow><m:mo stretchy="false">{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">}</m:mo></m:mrow></m:math></inline-formula> indexed by natural numbers <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\mathbb{N}" display="inline"><m:mi>ℕ</m:mi></m:math></inline-formula>, where all the elements are part of <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> and these elements <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}" display="inline"><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub></m:math></inline-formula> tend to approach a point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> according to the bornological semi convergence, then it must also be the case that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> belongs to the set <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmremark1">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmremark1.p1">
          <italic>In a (bvs) every b-op (b-cl) set is bs-op (bs-cl), but the converse is not true in general.</italic>
        </p>
      </statement>
      <statement id="Thmproposition1">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproposition1.p1">
          <italic>Take <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> be a b-op (b-cl) set in a (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>. Then:</italic>
        </p>
        <p>
          <list list-type="order" id="S2.I1">
            <list-item id="S2.I1.ix1">
              <p id="S2.I1.ix1.p1">
                <italic>If </italic>
                <inline-formula>
                  <mml:math alttext="B" display="inline">
                    <mml:mi>B</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, then </italic>
                <inline-formula>
                  <mml:math alttext="B\bigcap A" display="inline">
                    <mml:mrow>
                      <mml:mi>B</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo>⋂</mml:mo>
                        <mml:mi>A</mml:mi>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>.</italic>
              </p>
            </list-item>
            <list-item id="S2.I1.ix2">
              <p id="S2.I1.ix2.p1">
                <italic>If </italic>
                <inline-formula>
                  <mml:math alttext="B" display="inline">
                    <mml:mi>B</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> then </italic>
                <inline-formula>
                  <mml:math alttext="B\bigcap A" display="inline">
                    <mml:mrow>
                      <mml:mi>B</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo>⋂</mml:mo>
                        <mml:mi>A</mml:mi>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bs-open (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>.</italic>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmproof1">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof1.p1">
          <italic>(i) Take <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> to be a b-op and take <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq E" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> semi converging bornological to a point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A\cap B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mrow><m:mi>A</m:mi><m:mo>∩</m:mo><m:mi>B</m:mi></m:mrow></m:mrow></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>. If <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> and by Remark <xref rid="Thmremark1" ref-type="statement">1</xref><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> is bs-op then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\in A" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\forall" display="inline"><m:mo>∀</m:mo></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="n&gt;n_{o}" display="inline"><m:mrow><m:mi>n</m:mi><m:mo>&gt;</m:mo><m:msub><m:mi>n</m:mi><m:mi>o</m:mi></m:msub></m:mrow></m:math></inline-formula>. If <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-op then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\in B" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\forall" display="inline"><m:mo>∀</m:mo></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="n&gt;n_{o}" display="inline"><m:mrow><m:mi>n</m:mi><m:mo>&gt;</m:mo><m:msub><m:mi>n</m:mi><m:mi>o</m:mi></m:msub></m:mrow></m:math></inline-formula>, we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\in A\cap B" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>∈</m:mo><m:mrow><m:mi>A</m:mi><m:mo>∩</m:mo><m:mi>B</m:mi></m:mrow></m:mrow></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\forall" display="inline"><m:mo>∀</m:mo></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="n&gt;n_{o}" display="inline"><m:mrow><m:mi>n</m:mi><m:mo>&gt;</m:mo><m:msub><m:mi>n</m:mi><m:mi>o</m:mi></m:msub></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A\cap B" display="inline"><m:mrow><m:mi>A</m:mi><m:mo>∩</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula> is bs-op.</italic>
        </p>
        <p id="Thmproof1.p2">
          <italic>Now take <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> be a b-cl <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subset A\cap B" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊂</m:mo><m:mrow><m:mi>A</m:mi><m:mo>∩</m:mo><m:mi>B</m:mi></m:mrow></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq B" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq A" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula>. If <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq B" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula> and since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-cl we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>. If <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq A" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> and since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> is b-cl then by Remark <xref rid="Thmremark1" ref-type="statement">1</xref><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> is bs-cl we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A\cap B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mrow><m:mi>A</m:mi><m:mo>∩</m:mo><m:mi>B</m:mi></m:mrow></m:mrow></m:math></inline-formula>.</italic>
        </p>
        <p id="Thmproof1.p3">
          <italic>(ii) Same approach as above proof.</italic>
        </p>
      </statement>
      <statement id="Thmproposition2">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproposition2.p1">
          <italic>Take <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> be a (bvs) and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B\subseteq A\subseteq E" display="inline"><m:mrow><m:mi>B</m:mi><m:mo>⊆</m:mo><m:mi>A</m:mi><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula>. Then:</italic>
        </p>
        <p>
          <list list-type="order" id="S2.I2">
            <list-item id="S2.I2.ix1">
              <p id="S2.I2.ix1.p1">
                <italic>If </italic>
                <inline-formula>
                  <mml:math alttext="B" display="inline">
                    <mml:mi>B</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> and </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> then </italic>
                <inline-formula>
                  <mml:math alttext="B" display="inline">
                    <mml:mi>B</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>.</italic>
              </p>
            </list-item>
            <list-item id="S2.I2.ix2">
              <p id="S2.I2.ix2.p1">
                <italic>If </italic>
                <inline-formula>
                  <mml:math alttext="B" display="inline">
                    <mml:mi>B</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) set in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> then </italic>
                <inline-formula>
                  <mml:math alttext="B" display="inline">
                    <mml:mi>B</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op (bs-cl) in </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>.</italic>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmproof2">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof2.p1">
          <italic>(i) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq E" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>, thus <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in B\subseteq A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>B</m:mi><m:mo>⊆</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula>, since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> is bs-op set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq A" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in B" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>, since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-op in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq B" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>, we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-op in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmdefinition3">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmdefinition3.p1">
          <italic>If we take <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> to be a bounded vector space (bvs), then the bornological semi-closure of a subset <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, denoted as <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\text{bs-clr}(A)" display="inline"><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr</m:mtext><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula>, is the intersection of all bs-cl subsets of <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> that contain the set <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
    </sec>
    <sec id="S3">
      <label>3.</label>
      <title>Some Types of Bornological Semi Maps</title>
      <p id="S3.p1">This section includes some basic properties about sequentially bornological semi continuous map is denoted by seq bs-con map, bs-cl(bs-op) map, bss-cl(bss-op) map, bsi-cl(op) map and relationships among their maps are investigated.</p>
      <statement id="Thmdefinition4">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmdefinition4.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> are (bvs) and let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> be a mapping from <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> into <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>. We say that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is a seq bs-con map at a point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> if for any sequence <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}" display="inline"><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>. If <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is a seq bs-con map at every point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is called seq bs-con map.</italic>
        </p>
      </statement>
      <statement id="Thmexample1">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmexample1.p1">
          <italic>Inclusion map <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="i:A\rightarrow F" display="inline"><m:mrow><m:mi>i</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>A</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> in a bornological vector space (bvs) is sequential bornological semi continuous map (bs-con) map if and only if <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> is closed set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmdefinition5">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmdefinition5.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> are (bvs)s, a map <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> is called:</italic>
        </p>
        <p>
          <list list-type="order" id="S3.I1">
            <list-item id="S3.I1.ix1">
              <p id="S3.I1.ix1.p1">
                <italic>bs-cl map if </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <italic> b-cl set </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> in </italic>
                <inline-formula>
                  <mml:math alttext="X" display="inline">
                    <mml:mi>X</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, </italic>
                <inline-formula>
                  <mml:math alttext="f(A)" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bs-cl set in </italic>
                <inline-formula>
                  <mml:math alttext="F" display="inline">
                    <mml:mi>F</mml:mi>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
            <list-item id="S3.I1.ix2">
              <p id="S3.I1.ix2.p1">
                <italic>bss-cl map if </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <italic> bs-cl set </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, </italic>
                <inline-formula>
                  <mml:math alttext="f(A)" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is b-cl set in </italic>
                <inline-formula>
                  <mml:math alttext="F" display="inline">
                    <mml:mi>F</mml:mi>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
            <list-item id="S3.I1.ix3">
              <p id="S3.I1.ix3.p1">
                <italic>bsi-cl map if </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <italic> bs-cl set </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, </italic>
                <inline-formula>
                  <mml:math alttext="f(A)" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bs-cl set in </italic>
                <inline-formula>
                  <mml:math alttext="F" display="inline">
                    <mml:mi>F</mml:mi>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmdefinition6">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmdefinition6.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> are bornological vector spaces (bvs)s, a map <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> is called:</italic>
        </p>
        <p>
          <list list-type="order" id="S3.I2">
            <list-item id="S3.I2.ix1">
              <p id="S3.I2.ix1.p1">
                <italic>bs-op map if </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <italic> b-op set </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, </italic>
                <inline-formula>
                  <mml:math alttext="f(A)" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op set in </italic>
                <inline-formula>
                  <mml:math alttext="F" display="inline">
                    <mml:mi>F</mml:mi>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
            <list-item id="S3.I2.ix2">
              <p id="S3.I2.ix2.p1">
                <italic>bss-op map if </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <italic> bs-op set </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, </italic>
                <inline-formula>
                  <mml:math alttext="f(A)" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> b-op set in </italic>
                <inline-formula>
                  <mml:math alttext="F" display="inline">
                    <mml:mi>F</mml:mi>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
            <list-item id="S3.I2.ix3">
              <p id="S3.I2.ix3.p1">
                <italic>bsi-op map if </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <italic> bs-op set </italic>
                <inline-formula>
                  <mml:math alttext="A" display="inline">
                    <mml:mi>A</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> in </italic>
                <inline-formula>
                  <mml:math alttext="E" display="inline">
                    <mml:mi>E</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic>, </italic>
                <inline-formula>
                  <mml:math alttext="f(A)" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>A</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bs-op set in </italic>
                <inline-formula>
                  <mml:math alttext="F" display="inline">
                    <mml:mi>F</mml:mi>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmremark2">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmremark2.p1">
          <italic>Every b-cl (b-op) map is bs-cl (bs-op) map [<xref rid="ref010" ref-type="bibr">10</xref>].</italic>
        </p>
      </statement>
      <statement id="Thmtheorem1">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem1.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E,F" display="inline"><m:mrow><m:mi>E</m:mi><m:mo>,</m:mo><m:mi>F</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="H" display="inline"><m:mi>H</m:mi></m:math></inline-formula> are (bvs), <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g:F\rightarrow H" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>F</m:mi><m:mo stretchy="false">→</m:mo><m:mi>H</m:mi></m:mrow></m:mrow></m:math></inline-formula>, then, if <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is b-cl map and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> is bs-cl map, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g\circ f" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow></m:math></inline-formula> is bs-cl.</italic>
        </p>
      </statement>
      <statement id="Thmproof3">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof3.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A\subseteq E" display="inline"><m:mrow><m:mi>A</m:mi><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> is a b-cl set, since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> b-cl map then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(A)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> b-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, by <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> bs-cl map we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g(f(A))" display="inline"><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="H" display="inline"><m:mi>H</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g\circ f" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow></m:math></inline-formula> is bs-cl map.</italic>
        </p>
      </statement>
      <statement id="Thmtheorem2">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem2.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E,F" display="inline"><m:mrow><m:mi>E</m:mi><m:mo>,</m:mo><m:mi>F</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="H" display="inline"><m:mi>H</m:mi></m:math></inline-formula> are (bvs)s, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g:F\rightarrow H" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>F</m:mi><m:mo stretchy="false">→</m:mo><m:mi>H</m:mi></m:mrow></m:mrow></m:math></inline-formula></italic>
        </p>
        <p>
          <list list-type="order" id="S3.I3">
            <list-item id="S3.I3.ix1">
              <p id="S3.I3.ix1.p1">
                <italic>If </italic>
                <inline-formula>
                  <mml:math alttext="f" display="inline">
                    <mml:mi>f</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bss-cl map and </italic>
                <inline-formula>
                  <mml:math alttext="g" display="inline">
                    <mml:mi>g</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bss-cl map then </italic>
                <inline-formula>
                  <mml:math alttext="g\circ f" display="inline">
                    <mml:mrow>
                      <mml:mi>g</mml:mi>
                      <mml:mo lspace="0.222em" rspace="0.222em">∘</mml:mo>
                      <mml:mi>f</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bss-cl map.</italic>
              </p>
            </list-item>
            <list-item id="S3.I3.ix2">
              <p id="S3.I3.ix2.p1">
                <italic>If </italic>
                <inline-formula>
                  <mml:math alttext="f" display="inline">
                    <mml:mi>f</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bsi-cl map and </italic>
                <inline-formula>
                  <mml:math alttext="g" display="inline">
                    <mml:mi>g</mml:mi>
                  </mml:math>
                </inline-formula>
                <italic> is bsi-cl map then </italic>
                <inline-formula>
                  <mml:math alttext="g\circ f" display="inline">
                    <mml:mrow>
                      <mml:mi>g</mml:mi>
                      <mml:mo lspace="0.222em" rspace="0.222em">∘</mml:mo>
                      <mml:mi>f</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is bsi-cl map.</italic>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmproof4">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof4.p1">
          <italic>(i) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A\subseteq E" display="inline"><m:mrow><m:mi>A</m:mi><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> is a bs-cl set, since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> bss-cl map then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(A)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is b-cl set by Remark <xref rid="Thmremark2" ref-type="statement">2</xref> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(A)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, by <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> bss-cl map we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g(f(A))" display="inline"><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is b-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="H" display="inline"><m:mi>H</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g\circ f" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow></m:math></inline-formula> is bss-cl map.</italic>
        </p>
        <p id="Thmproof4.p2">
          <italic>(ii) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A\subseteq E" display="inline"><m:mrow><m:mi>A</m:mi><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> is a bs-cl set, since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> bsi-cl map, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(A)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bsi-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>. On the other hand, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> is bsi-cl map, we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g(f(A))" display="inline"><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bsi-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="H" display="inline"><m:mi>H</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g\circ f" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow></m:math></inline-formula> is bsi-cl map.</italic>
        </p>
      </statement>
      <statement id="Thmexample2">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmexample2.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> be subset of a (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, then the inclusion map <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="i:A\rightarrow E" display="inline"><m:mrow><m:mi>i</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>A</m:mi><m:mo stretchy="false">→</m:mo><m:mi>E</m:mi></m:mrow></m:mrow></m:math></inline-formula> is b-cl (bs-cl) iff <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> is b-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmtheorem3">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem3.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E,F" display="inline"><m:mrow><m:mi>E</m:mi><m:mo>,</m:mo><m:mi>F</m:mi></m:mrow></m:math></inline-formula> are (bvs)s. Assuming <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g:E\rightarrow F" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> seq bs-con map then:</italic>
        </p>
        <p>
          <list list-type="order" id="S3.I4">
            <list-item id="S3.I4.ix1">
              <p id="S3.I4.ix1.p1">
                <inline-formula>
                  <mml:math alttext="cf" display="inline">
                    <mml:mrow>
                      <mml:mi>c</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mi>f</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> where </italic>
                <inline-formula>
                  <mml:math alttext="cf:E\rightarrow F" display="inline">
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mi>c</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>f</mml:mi>
                      </mml:mrow>
                      <mml:mo lspace="0.278em" rspace="0.278em">:</mml:mo>
                      <mml:mrow>
                        <mml:mi>E</mml:mi>
                        <mml:mo stretchy="false">→</mml:mo>
                        <mml:mi>F</mml:mi>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> seq bs-con map </italic>
                <inline-formula>
                  <mml:math alttext="\forall" display="inline">
                    <mml:mo>∀</mml:mo>
                  </mml:math>
                </inline-formula>
                <inline-formula>
                  <mml:math alttext="c\in K" display="inline">
                    <mml:mrow>
                      <mml:mi>c</mml:mi>
                      <mml:mo>∈</mml:mo>
                      <mml:mi>K</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
            <list-item id="S3.I4.ix2">
              <p id="S3.I4.ix2.p1">
                <inline-formula>
                  <mml:math alttext="f+g" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mi>g</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> seq bs-con map</italic>
              </p>
            </list-item>
            <list-item id="S3.I4.ix3">
              <p id="S3.I4.ix3.p1">
                <inline-formula>
                  <mml:math alttext="f\cdot g" display="inline">
                    <mml:mrow>
                      <mml:mi>f</mml:mi>
                      <mml:mo lspace="0.222em" rspace="0.222em">⋅</mml:mo>
                      <mml:mi>g</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> is a seq bs-con map</italic>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmproof5">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof5.p1">
          <italic>(i) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in E" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\{x_{n}\}" display="inline"><m:mrow><m:mo stretchy="false">{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">}</m:mo></m:mrow></m:math></inline-formula> be a sequence in (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is a seq bs-con at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> implies <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="cf(x_{n})\overset{s}{\rightarrow}cf(x)" display="inline"><m:mrow><m:mi>c</m:mi><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>c</m:mi><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\forall" display="inline"><m:mo>∀</m:mo></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="c\in K" display="inline"><m:mrow><m:mi>c</m:mi><m:mo>∈</m:mo><m:mi>K</m:mi></m:mrow></m:math></inline-formula>. Then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\forall" display="inline"><m:mo>∀</m:mo></m:math></inline-formula><inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="cf" display="inline"><m:mrow><m:mi>c</m:mi><m:mo>⁢</m:mo><m:mi>f</m:mi></m:mrow></m:math></inline-formula> seq bs-con.</italic>
        </p>
        <p id="Thmproof5.p2">
          <italic>(ii) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in E" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\{x_{n}\}" display="inline"><m:mrow><m:mo stretchy="false">{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">}</m:mo></m:mrow></m:math></inline-formula> be a sequence in (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> seq bs-con map at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g(x_{n})\overset{s}{\rightarrow}g(x)" display="inline"><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})+g(x_{n})\overset{s}{\rightarrow}f(x)+g(x)" display="inline"><m:mrow><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>+</m:mo><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>+</m:mo><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>. We have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="(f+g)(x_{n})\overset{s}{\rightarrow}(f+g)(x)" display="inline"><m:mrow><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>+</m:mo><m:mi>g</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>+</m:mo><m:mi>g</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f+g" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>+</m:mo><m:mi>g</m:mi></m:mrow></m:math></inline-formula> is a seq bs-con map at every point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>. Then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is seq bs-con map.</italic>
        </p>
        <p id="Thmproof5.p3">
          <italic>(iii) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in E" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\{x_{n}\}" display="inline"><m:mrow><m:mo stretchy="false">{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">}</m:mo></m:mrow></m:math></inline-formula> be a sequence in (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> seq bs-con map at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g(x)\overset{s}{\rightarrow}g(x)" display="inline"><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\cdot g(x_{n})\overset{s}{\rightarrow}f(x)\cdot g(x)" display="inline"><m:mrow><m:mrow><m:mrow><m:mrow><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo rspace="0.055em" stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo rspace="0.222em">⋅</m:mo><m:mi>g</m:mi></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo rspace="0.055em" stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo rspace="0.222em">⋅</m:mo><m:mi>g</m:mi></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, hence <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="(f\cdot g)(x_{n})\overset{s}{\rightarrow}(fg)(x)" display="inline"><m:mrow><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo lspace="0.222em" rspace="0.222em">⋅</m:mo><m:mi>g</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mi>g</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> at every <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f\cdot g" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.222em" rspace="0.222em">⋅</m:mo><m:mi>g</m:mi></m:mrow></m:math></inline-formula> is seq bs-con map.</italic>
        </p>
      </statement>
      <statement id="Thmtheorem4">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem4.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> are (bvs)s and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> a non-empty subset of <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> if <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\overset{s}{\rightarrow}F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> is a seq bs-con map then the restriction <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f_{A}" display="inline"><m:msub><m:mi>f</m:mi><m:mi>A</m:mi></m:msub></m:math></inline-formula> is a seq bs-con map, where <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula> has the relative bornology <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B_{A}" display="inline"><m:msub><m:mi>B</m:mi><m:mi>A</m:mi></m:msub></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmproof6">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof6.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in A" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\left\{x_{n}\right\}_{n\in\mathbb{N}}\subseteq A" display="inline"><m:mrow><m:msub><m:mrow><m:mo>{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>}</m:mo></m:mrow><m:mrow><m:mi>n</m:mi><m:mo>∈</m:mo><m:mi>ℕ</m:mi></m:mrow></m:msub><m:mo>⊆</m:mo><m:mi>A</m:mi></m:mrow></m:math></inline-formula> such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A" display="inline"><m:mi>A</m:mi></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="A\subseteq E" display="inline"><m:mrow><m:mi>A</m:mi><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> is a seq bs-con map then if <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> hence <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f_{A}" display="inline"><m:msub><m:mi>f</m:mi><m:mi>A</m:mi></m:msub></m:math></inline-formula> is a seq bs-con map.</italic>
        </p>
      </statement>
      <statement id="Thmtheorem5">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem5.p1">
          <italic>A mapping <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> where <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> from a bornological vector spaces (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> into (bvs) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> is seq bs-con map, for every <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(B)" display="inline"><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmproof7">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof7.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, if <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(B)=\phi" display="inline"><m:mrow><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>=</m:mo><m:mi>ϕ</m:mi></m:mrow></m:math></inline-formula> and thus the proof is complete. If <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(B)\neq\phi" display="inline"><m:mrow><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>≠</m:mo><m:mi>ϕ</m:mi></m:mrow></m:math></inline-formula>. Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\in f^{-1}(B)" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>∈</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula> such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(B)\subseteq E" display="inline"><m:mrow><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>⊆</m:mo><m:mi>E</m:mi></m:mrow></m:math></inline-formula>, we have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\in B" display="inline"><m:mrow><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is seq bs-con map then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B" display="inline"><m:mi>B</m:mi></m:math></inline-formula> is bs-cl set then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x)\in B" display="inline"><m:mrow><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>∈</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula>. We have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x\in f^{-1}(B)" display="inline"><m:mrow><m:mi>x</m:mi><m:mo>∈</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(B)" display="inline"><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmtheorem6">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem6.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> are (bvs)s, if <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> is seq bs-con map then:</italic>
        </p>
        <p>
          <list list-type="order" id="S3.I5">
            <list-item id="S3.I5.ix1">
              <p id="S3.I5.ix1.p1">
                <inline-formula>
                  <mml:math alttext="f(\text{bs-clr }A)\subseteq\text{ bs-clr }f(A)" display="inline">
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mi>f</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mrow>
                            <mml:mtext class="ltx_mathvariant_italic">bs-clr </mml:mtext>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>A</mml:mi>
                          </mml:mrow>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                      <mml:mo>⊆</mml:mo>
                      <mml:mrow>
                        <mml:mtext class="ltx_mathvariant_italic"> bs-clr </mml:mtext>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>f</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>A</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> for every </italic>
                <inline-formula>
                  <mml:math alttext="A\subseteq E" display="inline">
                    <mml:mrow>
                      <mml:mi>A</mml:mi>
                      <mml:mo>⊆</mml:mo>
                      <mml:mi>E</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
            <list-item id="S3.I5.ix2">
              <p id="S3.I5.ix2.p1">
                <inline-formula>
                  <mml:math alttext="\text{bs-clr }f^{-1}(B)\subseteq f^{-1}(\text{bs-clr }B)" display="inline">
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mtext class="ltx_mathvariant_italic">bs-clr </mml:mtext>
                        <mml:mo>⁢</mml:mo>
                        <mml:msup>
                          <mml:mi>f</mml:mi>
                          <mml:mrow>
                            <mml:mo>−</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                        </mml:msup>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>B</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                      <mml:mo>⊆</mml:mo>
                      <mml:mrow>
                        <mml:msup>
                          <mml:mi>f</mml:mi>
                          <mml:mrow>
                            <mml:mo>−</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                        </mml:msup>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mrow>
                            <mml:mtext class="ltx_mathvariant_italic">bs-clr </mml:mtext>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>B</mml:mi>
                          </mml:mrow>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
                <italic> for every </italic>
                <inline-formula>
                  <mml:math alttext="B\subseteq F" display="inline">
                    <mml:mrow>
                      <mml:mi>B</mml:mi>
                      <mml:mo>⊆</mml:mo>
                      <mml:mi>F</mml:mi>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
              </p>
            </list-item>
          </list>
        </p>
      </statement>
      <statement id="Thmproof8">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof8.p1">
          <italic>(i) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> be seq bs-cont. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\text{bs-clr }f(A)" display="inline"><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(\text{bs-clr }f(A))" display="inline"><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> (Theorem <xref rid="Thmtheorem5" ref-type="statement">5</xref>) <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\text{bs-clr }f^{-1}(f(A))=f^{-1}(\text{bs-clr }f(A))" display="inline"><m:mrow><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>=</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(A)\subseteq\text{bs-clr }f(A)\Rightarrow A\subseteq f^{-1}(f(A))\subseteq f^%&#10;{-1}(\text{bs-clr }f(A))" display="inline"><m:mrow><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>⊆</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">⇒</m:mo><m:mi>A</m:mi><m:mo>⊆</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>⊆</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\text{bs-clr }A\subseteq f^{-1}(\text{bs-clr }f(A))" display="inline"><m:mrow><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>A</m:mi></m:mrow><m:mo>⊆</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula> [since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(f(A))" display="inline"><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> and by Remark 3]. We have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(\text{bs-clr }A)\subseteq f^{-1}(\text{bs-clr }f(A))" display="inline"><m:mrow><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>A</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>⊆</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>A</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula></italic>
        </p>
        <p id="Thmproof8.p2">
          <italic>(ii) Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> be seq bs-con map. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\text{bs-clr }B" display="inline"><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>, then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(\text{bs-clr }B)" display="inline"><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> is bs-cl set in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> (Theorem <xref rid="Thmtheorem5" ref-type="statement">5</xref>). <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(\text{bs-clr }B)=f^{-1}(B)" display="inline"><m:mrow><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>=</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula>. (1). Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="B\subset\text{bs-clr }B" display="inline"><m:mrow><m:mi>B</m:mi><m:mo>⊂</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f^{-1}(\text{bs-clr }B)\subseteq f^{-1}(B)" display="inline"><m:mrow><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>⊆</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula>. We have <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\text{bs-clr }f^{-1}(B)=\text{bs-clr }f^{-1}(\text{bs-clr }B)=f^{-1}(\text{bs-%&#10;clr }B)" display="inline"><m:mrow><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>=</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo>=</m:mo><m:mrow><m:msup><m:mi>f</m:mi><m:mrow><m:mo>−</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mtext class="ltx_mathvariant_italic">bs-clr </m:mtext><m:mo>⁢</m:mo><m:mi>B</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:mrow></m:math></inline-formula> [by (1)].</italic>
        </p>
      </statement>
      <statement id="Thmtheorem7">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmtheorem7.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula> and <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="H" display="inline"><m:mi>H</m:mi></m:math></inline-formula> be (bvs)s and let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f:E\rightarrow F" display="inline"><m:mrow><m:mi>f</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>F</m:mi></m:mrow></m:mrow></m:math></inline-formula> be a seq bs-cont map at a point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula>, <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g:F\rightarrow H" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>F</m:mi><m:mo stretchy="false">→</m:mo><m:mi>H</m:mi></m:mrow></m:mrow></m:math></inline-formula> be seq bs-con at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g\circ f:E\rightarrow H" display="inline"><m:mrow><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow><m:mo lspace="0.278em" rspace="0.278em">:</m:mo><m:mrow><m:mi>E</m:mi><m:mo stretchy="false">→</m:mo><m:mi>H</m:mi></m:mrow></m:mrow></m:math></inline-formula> be a seq bs-con map at a point <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
      <statement id="Thmproof9">
        <title>
          <bold>.</bold>
        </title>
        <p id="Thmproof9.p1">
          <italic>Let <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\{x_{n}\}" display="inline"><m:mrow><m:mo stretchy="false">{</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">}</m:mo></m:mrow></m:math></inline-formula> be a sequence in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="E" display="inline"><m:mi>E</m:mi></m:math></inline-formula> such that <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x_{n}\overset{s}{\rightarrow}x" display="inline"><m:mrow><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>x</m:mi></m:mrow></m:math></inline-formula> since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f" display="inline"><m:mi>f</m:mi></m:math></inline-formula> is a seq bs-con map at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x_{n})\overset{s}{\rightarrow}f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="\{f(x_{n})\}" display="inline"><m:mrow><m:mo stretchy="false">{</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">}</m:mo></m:mrow></m:math></inline-formula> a sequence in <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="F" display="inline"><m:mi>F</m:mi></m:math></inline-formula>. Since <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g" display="inline"><m:mi>g</m:mi></m:math></inline-formula> is a seq bs-con map at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="f(x)" display="inline"><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula> then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g(f(x_{n}))\overset{s}{\rightarrow}g(f(x))" display="inline"><m:mrow><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mi>g</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>f</m:mi><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula>. Then <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="(g\circ f)(x_{n})\overset{s}{\rightarrow}(g\circ f)(x)" display="inline"><m:mrow><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:msub><m:mi>x</m:mi><m:mi>n</m:mi></m:msub><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mover accent="true"><m:mo stretchy="false">→</m:mo><m:mo>𝑠</m:mo></m:mover><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow><m:mo stretchy="false">)</m:mo></m:mrow><m:mo>⁢</m:mo><m:mrow><m:mo stretchy="false">(</m:mo><m:mi>x</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mrow></m:math></inline-formula>. Hence <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="g\circ f" display="inline"><m:mrow><m:mi>g</m:mi><m:mo lspace="0.222em" rspace="0.222em">∘</m:mo><m:mi>f</m:mi></m:mrow></m:math></inline-formula> is a seq bs-con map at <inline-formula><m:math xmlns:m="http://www.w3.org/1998/Math/MathML" alttext="x" display="inline"><m:mi>x</m:mi></m:math></inline-formula>.</italic>
        </p>
      </statement>
    </sec>
    <sec id="S4">
      <label>4.</label>
      <title>Conclusion</title>
      <p id="S4.p1">In this study, we introduced and explored a novel framework for defining new classes of maps grounded in the notions of bornological semi open and bornological semi closed sets. Through this approach, we established and analyzed several types of maps, including sequential bornological semi continuous maps, bornological semi closed (open) maps, bornological strongly semi closed (open) maps, and bornological semi-irresolute closed (open) maps. Our investigation provided insight into the structural properties and interrelationships among these mappings, offering a foundation for further development in the field of bornological topology and its applications in general topological structures.</p>
    </sec>
  </body>
  <back>
    <ack>
      <title>Acknowledgments</title>
      <p id="ack.p1">This work was supported without any funding.</p>
    </ack>
    <sec id="sec0100" sec-type="COI-statement">
      <title>Conflict of interest</title>
      <p>The author declares no conflicts of interest.</p>
    </sec>
    <ref-list>
      <title>References</title>
      <ref id="ref001">
        <label>[1]</label>
        <mixed-citation> Hogbe-Nlend, H. (1977). <italic>Bornologies and functional analysis: introductory course on the theory of duality topology-bornology and its use in functional analysis</italic> (Vol. 26). Elsevier. </mixed-citation>
      </ref>
      <ref id="ref002">
        <label>[2]</label>
        <mixed-citation> Ameer, A. A., &amp; Huda, A. (2019). Semi Compactness Space in Bornological Space. <italic>Diyala Journal for Pure Science, 15</italic>(4). [<uri>https://doi.org/10.24237/djps.15.04.505A</uri>] </mixed-citation>
      </ref>
      <ref id="ref003">
        <label>[3]</label>
        <mixed-citation> Al-Basri, F. K. (2017). On Semi â€"Complete Bornological Vector Space. Journal of AL-Qadisiyah for computer science and mathematics, 9(1), 40-48. </mixed-citation>
      </ref>
      <ref id="ref004">
        <label>[4]</label>
        <mixed-citation> Al-Basri, F. K. M. (2014). The Relationship Between Boronological Convergence of Net and Topological Convergence of Net. <italic>Journal of AL-Qadisiyah for computer science and mathematics, 6</italic>(2), 65-76. </mixed-citation>
      </ref>
      <ref id="ref005">
        <label>[5]</label>
        <mixed-citation> Levine, N. (1963). Semi-open sets and semi-continuity in topological spaces. <italic>The American mathematical monthly, 70</italic>(1), 36-41. [<uri>https://doi.org/10.1080/00029890.1963.11990039</uri>] </mixed-citation>
      </ref>
      <ref id="ref006">
        <label>[6]</label>
        <mixed-citation> Neubrunnová, A. (1973). On certain generalizations of the notion of continuity. <italic>Matematický časopis, 23</italic>(4), 374-380. </mixed-citation>
      </ref>
      <ref id="ref007">
        <label>[7]</label>
        <mixed-citation> Marcus, S. (1961). Sur les fonctions quasicontinues au sens de S. Kempisty. In <italic>Colloquium Mathematicae</italic> (Vol. 8, No. 1, pp. 47-53). </mixed-citation>
      </ref>
      <ref id="ref008">
        <label>[8]</label>
        <mixed-citation> Balachandran, K. (1991). On generalized continuous maps in topological spaces. <italic>Mem. Fac. Sci. Kochi Univ. Ser. A Math., 12</italic>, 5-13. </mixed-citation>
      </ref>
      <ref id="ref009">
        <label>[9]</label>
        <mixed-citation> Cueva, M. C. (1995). Semi-generalized continuous maps in topological spaces. <italic>Portugaliae Mathematica, 52</italic>(4), 399-407. </mixed-citation>
      </ref>
      <ref id="ref010">
        <label>[10]</label>
        <mixed-citation> Al-Basri, F. K. (2018). Sequentially Bornological Compact Space. <italic>AL-Qadisiyah Journal of pure Science, 23</italic>(2). [<uri>https://doi.org/10.29350/jops.2018.23.2.762</uri>] </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>
