<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd"><article xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" dtd-version="1.3" article-type="research-article"><front><journal-meta><journal-id journal-id-type="issn">2460-0245</journal-id><journal-title-group><journal-title>Journal of the Indonesian Mathematical Society</journal-title><abbrev-journal-title>JIMS</abbrev-journal-title></journal-title-group><issn pub-type="epub">2460-0245</issn><issn pub-type="ppub">2086-8952</issn><publisher><publisher-name>IndoMS</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22342/jims.v32i1.1551</article-id><article-categories></article-categories><title-group><article-title>Generalized Implicit Function Theorem and General Fundamental Theorem of Calculus</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Dhara</surname><given-names>Ashish</given-names></name><address><country country="IN">India</country><email>ashishdhara1982@gmail.com</email></address><xref ref-type="aff" rid="AFF-1"></xref></contrib><contrib contrib-type="author"><name><surname>Pedgaonkar</surname><given-names>Anil</given-names></name><address><country country="IN">India</country><email>profanilp@gmail.com</email></address><xref ref-type="aff" rid="AFF-1"></xref></contrib><contrib contrib-type="author"><name><surname>Dasre</surname><given-names>Narendrakumar Ramchandra</given-names></name><address><country country="IN">India</country><email>narendasre@rait.ac.in</email></address><xref ref-type="aff" rid="AFF-2"></xref><xref ref-type="corresp" rid="cor-0"></xref></contrib></contrib-group><contrib-group><contrib contrib-type="editor"><name><surname>Nurwigantara</surname><given-names>Mu'amar Musa</given-names></name><address><country country="ID">Indonesia</country><email>muamar.musa.n@mail.ugm.ac.id</email></address></contrib></contrib-group><aff id="AFF-1"><institution content-type="dept">Department of Mathematics</institution><country>Institute of Science</country></aff><aff id="AFF-2"><institution-wrap><institution>Holon Institute of Technology</institution><institution-id institution-id-type="ror">https://ror.org/02prqh017</institution-id></institution-wrap><country country="IL">Israel</country></aff><author-notes><corresp id="cor-0">Corresponding author: Narendrakumar Ramchandra Dasre. Email: <email>narendasre@rait.ac.in</email></corresp></author-notes><pub-date date-type="pub" iso-8601-date="2026-01-14" publication-format="electronic"><day>14</day><month>01</month><year>2026</year></pub-date><pub-date date-type="collection" iso-8601-date="2026-01-05" publication-format="electronic"><day>05</day><month>01</month><year>2026</year></pub-date><volume>32</volume><issue>1</issue><issue-title>MARCH</issue-title><fpage>1</fpage><lpage>10</lpage><history><date date-type="received" iso-8601-date="2023-10-11"><day>11</day><month>10</month><year>2023</year></date><date date-type="accepted" iso-8601-date="2025-10-03"><day>03</day><month>10</month><year>2025</year></date></history><permissions><copyright-statement>Copyright (c) 2026 Journal of the Indonesian Mathematical Society</copyright-statement><copyright-year>2026</copyright-year><copyright-holder>Journal of the Indonesian Mathematical Society</copyright-holder><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/"><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc-nd/4.0/</ali:license_ref><license-p>This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.</license-p></license></permissions><self-uri xlink:href="https://jims-a.org/index.php/jimsa/article/view/1551" xlink:title="1551"></self-uri><abstract><p>We present the notion of Henstock-Kurzweil integral for mappings assuming values in Hausdorff topological vector spaces using the direct set of gauges and derive a version of Mean Value Theorem. We use the definition of Frechet derivative and obtain a general version of <italic>Implicit Function Theorem</italic> for mappings from <italic>X × Y → Z</italic> where, for existence and continuity of the function, <italic>X</italic> needs to be merely a topological space and for differentiability, <italic>X</italic> can be a Topological Vector Space (TVS) while <italic>Z </italic>is a Hausdorff topological vector space and <italic>Y</italic> is a Banach space. The implicit function theorem is proved in 3 parts as existence, continuity of the partial derivative and invertibility of the partial derivative. The proof is very similar to the classical proof.</p></abstract><kwd-group><kwd>Frechet Derivative</kwd><kwd>Henstock-Kurzweil Integral</kwd><kwd>Topological Vector Space (TVS)</kwd><kwd>Gauge</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>File created by JATS Editor</meta-name><meta-value>https://jatseditor.com</meta-value></custom-meta><custom-meta><meta-name>issue-created-year</meta-name><meta-value>2026</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec id="sec-1"><title>1. INTRODUCTION</title><p>This paper will discuss the generalized <italic>Implicit Mapping Theorem</italic> for mappings <inline-formula><tex-math id="math-1"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \times Y Z \end{document} ]]></tex-math></inline-formula> . Only <italic>Y </italic>is required to be a Banach space. <italic>Z</italic> can be a Hausdorf topological vector space. For the existence and continuity, it sufices that <italic>X</italic> is a topological space and for diferentiability, <italic>X</italic> should be a topological vector space. Our proof is modelled on the classical proof given in <xref ref-type="bibr" rid="BIBR-1">[1]</xref>. With minor modifications, a definition of derivative for a mapping from a topological space to a topological group and the theorem holds when <italic>X</italic> is a topological space and <italic>Z</italic> is a Hausdorf topological group can be coined. In the final section, the Fundamental Theorem of Calculus for Henstock-Kurzeweil Integral for mappings assuming values in a Hausdorf topological vector space is obtained.</p></sec><sec id="sec-2"><title>2. PRELIMINARY</title><p>The abbreviation L.T. for a linear transformation is used and nbd for neighbourhood. The following facts about topological vector space from <xref ref-type="bibr" rid="BIBR-2">[2]</xref> are recalled. Topological Vector Space (TVS): A vector space <inline-formula><tex-math id="math-2"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb{X} \end{document} ]]></tex-math></inline-formula> over a field <inline-formula><tex-math id="math-3"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathcal { F } ( \mathcal { F } \end{document} ]]></tex-math></inline-formula> can be <inline-formula><tex-math id="math-4"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb{R} \text{ or } \mathbb{C} \end{document} ]]></tex-math></inline-formula>) is called a topological vector space, abbreviated as TVS, if <italic>X</italic> is vector space and there is a topology on <inline-formula><tex-math id="math-5"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb{X} \end{document} ]]></tex-math></inline-formula>such that the addition <inline-formula><tex-math id="math-6"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle + : \mathcal { F } \times \mathcal { X } \mathcal { F } \end{document} ]]></tex-math></inline-formula> as well as scalar multiplication, <inline-formula><tex-math id="math-7"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \cdot : \mathbb { R } \times \mathbb { X } \to \mathbb { R } \end{document} ]]></tex-math></inline-formula> is continuous.</p><p><bold>Remark 2.1.</bold><italic>Any normed linear space is a TVS.</italic></p><p><bold>Definition 2.1.</bold><italic> In a vector space V over </italic><inline-formula><tex-math id="math-8"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \mathcal { F } } , \end{document} ]]></tex-math></inline-formula><italic> , we define the following concepts.</italic></p><p>For any set <inline-formula><tex-math id="math-9"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subset V,\quad -A=\left\{-a:a\in A\right\} \end{document} ]]></tex-math></inline-formula> . A set A is called <bold>symmetric</bold><inline-formula><tex-math id="math-10"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle i f - A = A \end{document} ]]></tex-math></inline-formula> For any subset <inline-formula><tex-math id="math-11"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D \subset { \mathcal { F } } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-12"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subset V , D a = \{ d \cdot a : d \in D , a \in A \} . \ A + b \end{document} ]]></tex-math></inline-formula> is translate of A by the vector b and <inline-formula><tex-math id="math-13"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A + b = \{ a + b : b \in B \} \end{document} ]]></tex-math></inline-formula> . A set A is called <bold>balanced</bold> if <inline-formula><tex-math id="math-14"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t A \subset A \end{document} ]]></tex-math></inline-formula> , for all scalars t with <inline-formula><tex-math id="math-15"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | t | \leq 1 \end{document} ]]></tex-math></inline-formula></p><p><bold>Remark 2.2.</bold><italic>Choosing </italic><inline-formula><tex-math id="math-16"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t = - 1 \end{document} ]]></tex-math></inline-formula><italic> shows that a balanced set is symmetric.</italic></p><p><bold>Example 1.</bold><italic>Let A be a non-square plane rectangle. A is balanced as a subset of </italic><inline-formula><tex-math id="math-17"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 2 } \end{document} ]]></tex-math></inline-formula><italic> . But A is not balanced in the complex vector space C over C as </italic><inline-formula><tex-math id="math-18"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle i A \not \subset A \end{document} ]]></tex-math></inline-formula></p><p>A set <italic>A</italic> is a TVS, is called bounded if for each nbd <italic>U</italic> of 0, if there exist <inline-formula><tex-math id="math-19"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta > 0 \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-20"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t A \subset A \end{document} ]]></tex-math></inline-formula> , for all scalars t with <inline-formula><tex-math id="math-21"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | t | < \delta \end{document} ]]></tex-math></inline-formula>. This is equivalent to any one of the following properties:</p><list list-type="order"><list-item><p>There exists <inline-formula><tex-math id="math-22"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \epsilon > 0 \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-23"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \epsilon A \subset U \end{document} ]]></tex-math></inline-formula> , for any nbd <italic>U</italic> of 0.</p></list-item><list-item><p>There exists a scalar s such that <inline-formula><tex-math id="math-24"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subset s U . \end{document} ]]></tex-math></inline-formula></p></list-item><list-item><p>There exists an integer n such that <inline-formula><tex-math id="math-25"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A \subset n U . \end{document} ]]></tex-math></inline-formula></p></list-item></list><p>Clearly finite union of bounded sets is bounded and each finite set is bounded. It can be noted that translation and multiplication by a non-zero scalar are homeomorphisms and topology on a <italic>TVS</italic> can be defined using only neighbourhoods of 0. Also, it can be noted that each neighbourhood (nbd) of 0 contains a balanced closed nbd of 0. Scalar multiple or translate of a bounded set is bounded. Given a nbd <italic>U</italic> of 0, there exists a nbd <italic>V</italic> of 0 such that <inline-formula><tex-math id="math-26"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V + V \subset U \end{document} ]]></tex-math></inline-formula> . Our vector spaces are over the field <inline-formula><tex-math id="math-27"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb{R} \end{document} ]]></tex-math></inline-formula>.</p></sec><sec id="sec-3"><title>3. Definition of Frechet derivative</title><p><bold>Definition 3.1.</bold><italic>Let </italic><inline-formula><tex-math id="math-28"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, </italic><inline-formula><tex-math id="math-29"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Y \end{document} ]]></tex-math></inline-formula><italic> be a TVS. A mapping </italic><inline-formula><tex-math id="math-30"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f : X \to Y \end{document} ]]></tex-math></inline-formula><italic> is called diferentiable at a point x in </italic><inline-formula><tex-math id="math-31"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> if there exist a continuous L.T. </italic><inline-formula><tex-math id="math-32"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f ^ { \prime } ( x ) = D \end{document} ]]></tex-math></inline-formula><italic> such that, </italic><inline-formula><tex-math id="math-33"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \lim _ {h \to 0} \frac {f (x + t h) - f (x)}{t} - D \cdot h \to 0 \end{document} ]]></tex-math></inline-formula></p><p>uniformly for any h in a bounded set, that is, <inline-formula><tex-math id="math-34"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f ( x + t h ) - f ( x ) - D \cdot t h = R ( h ) \end{document} ]]></tex-math></inline-formula> and given a nbd U of 0 in Y, there exist <inline-formula><tex-math id="math-35"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta > 0 \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-36"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle R ( h ) \in U \end{document} ]]></tex-math></inline-formula> when <inline-formula><tex-math id="math-37"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < | t | < \delta \end{document} ]]></tex-math></inline-formula> We say <inline-formula><tex-math id="math-38"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle R ( h ) \end{document} ]]></tex-math></inline-formula> is a δ-tangent or simply tangent.</p><p><bold>Remark 3.1.</bold><italic>The definition is clearly equivalent to the usual definition in Frechet spaces as shown in </italic>[<xref ref-type="bibr" rid="BIBR-3">3</xref>, <xref ref-type="bibr" rid="BIBR-4">4</xref>] <italic>that the usual laws of diferentiation including the chain rule holds but a diferentiable mapping need not be continuous, however merely sequentially continuous.</italic></p><p><bold>Definition 3.2.</bold><italic>A topological space X is called sequential if for any subset </italic><inline-formula><tex-math id="math-39"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A , \end{document} ]]></tex-math></inline-formula><italic> each cluster point a of A is the limit of a sequence of points in A. When X is a sequential space, each mapping diferentiable at a is continuous at a.</italic></p><p><bold>Definition 3.3</bold> (Topology on<italic></italic><inline-formula><tex-math id="math-40"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { L } ( \mathrm { X } , \mathrm { Y } ) ) \end{document} ]]></tex-math></inline-formula><italic></italic><inline-formula><tex-math id="math-41"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L ( X , Y ) \end{document} ]]></tex-math></inline-formula><italic> is the space of continuous linear maps with the topology of uniform convergence on bounded subsets of E.</italic></p><p><inline-formula><tex-math id="math-42"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( B , V ) = \{ T : X \to L ( X , Y ) | T ( B ) \subset V \} \end{document} ]]></tex-math></inline-formula><italic> denotes a basic 0 − neighbourhood in the space </italic><inline-formula><tex-math id="math-43"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L ( X , Y ) \end{document} ]]></tex-math></inline-formula><italic> . B is a bounded subset of X, V is a 0 − neighbourhood in Y.</italic></p><p><bold>Definition 3.4.</bold><italic>A mapping </italic><inline-formula><tex-math id="math-44"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f : \mathbb { X } \to \mathbb { Y } \end{document} ]]></tex-math></inline-formula><italic> is called a </italic><inline-formula><tex-math id="math-45"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C ^ { 1 } \end{document} ]]></tex-math></inline-formula><italic> mapping in an open set E if the mapping </italic><inline-formula><tex-math id="math-46"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \to f ^ { \prime } ( x ) \end{document} ]]></tex-math></inline-formula><italic> is a sequentially continuous mapping </italic><inline-formula><tex-math id="math-47"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { X } \to L ( \mathbb { X } , \mathbb { Y } ) \end{document} ]]></tex-math></inline-formula><italic> , the space of continuous linear maps: </italic><inline-formula><tex-math id="math-48"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { X } \to \mathbb { Y } \end{document} ]]></tex-math></inline-formula></p><p><bold>Definition 3.5</bold><italic>(Norm of a linear mapping). In the case when </italic><inline-formula><tex-math id="math-49"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb{X} \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-50"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb{Y} \end{document} ]]></tex-math></inline-formula><italic> are normed spaces, the Norm of a continuous </italic><inline-formula><tex-math id="math-51"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L . T . \ T \in \ L ( \mathbb { X } , \mathbb { Y } ) \end{document} ]]></tex-math></inline-formula><italic> is sup </italic><inline-formula><tex-math id="math-52"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \{ | T x | : | x | \leq 1 \} \end{document} ]]></tex-math></inline-formula><italic> . It is denoted by </italic><inline-formula><tex-math id="math-53"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | | T | | \end{document} ]]></tex-math></inline-formula><italic> . It satisfies </italic><inline-formula><tex-math id="math-54"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | T x | \leq | | T | | \ | x | , \forall x \in \mathbb { X } \end{document} ]]></tex-math></inline-formula></p><p><bold>Definition 3.6</bold><italic>(Derivative for mappings of real variable). We note that when we consider mappings </italic><inline-formula><tex-math id="math-55"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } \to X \end{document} ]]></tex-math></inline-formula><italic> , where X is Hausdorf, the derivative can be identified with a vector in X and can be equivalently defined as in </italic><inline-formula><tex-math id="math-56"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F : \mathbb { R } X \end{document} ]]></tex-math></inline-formula><italic> , we define derivative</italic></p><disp-formula id="equation-1"><tex-math id="math-57"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ^ {\prime} (x) = \lim _ {h \to 0} \frac {F (x + h) - F (x)}{h}. \end{document} ]]></tex-math></disp-formula><p><bold>Definition 3.7</bold><italic>(Primitive of a mapping </italic><inline-formula><tex-math id="math-58"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f ) \end{document} ]]></tex-math></inline-formula><italic> . Let </italic><inline-formula><tex-math id="math-59"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K = [ a , b ] \end{document} ]]></tex-math></inline-formula><italic> be a closed cell in R. Let F and f be mappings defined on K with values in a Hausdorf TVS space </italic><inline-formula><tex-math id="math-60"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Y \end{document} ]]></tex-math></inline-formula><italic> . Let </italic><inline-formula><tex-math id="math-61"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \boldsymbol { D } = \left( a , b \right) \end{document} ]]></tex-math></inline-formula><italic> . A continuous mapping </italic><inline-formula><tex-math id="math-62"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula><italic> on K is said to be a primitive of f on K if F is </italic><inline-formula><tex-math id="math-63"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle d i f f e \end{document} ]]></tex-math></inline-formula><italic> rentiable on D, with </italic><inline-formula><tex-math id="math-64"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ^ { \prime } ( t ) = f ( t ) \end{document} ]]></tex-math></inline-formula></p><p><bold>Definition 3.8.</bold><italic>A division ofcell </italic><inline-formula><tex-math id="math-65"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle [ a , b ] \end{document} ]]></tex-math></inline-formula><italic> into mutually separated cells </italic><inline-formula><tex-math id="math-66"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { k } = [ u _ { k } , v _ { k } ] , 1 \le \end{document} ]]></tex-math></inline-formula><italic></italic><inline-formula><tex-math id="math-67"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \leq \kappa _ { . } \end{document} ]]></tex-math></inline-formula><italic> , for some </italic><inline-formula><tex-math id="math-68"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \kappa \in \mathbb { N } , u _ { k } < v _ { k } , u _ { 1 } = a , v _ { \kappa } = b , K _ { k } \end{document} ]]></tex-math></inline-formula><italic> is called a block in the partition of cell </italic><inline-formula><tex-math id="math-69"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle [ a , b ] \end{document} ]]></tex-math></inline-formula></p><p>We briefly discuss Henstock-Kurzweil Integral. The details can be found in [<xref ref-type="bibr" rid="BIBR-5">5</xref>, <xref ref-type="bibr" rid="BIBR-6">6</xref>],[<xref ref-type="bibr" rid="BIBR-7">7</xref>, <xref ref-type="bibr" rid="BIBR-8">8</xref>], <xref ref-type="bibr" rid="BIBR-9">[9]</xref>, <xref ref-type="bibr" rid="BIBR-10">[10]</xref> and <xref ref-type="bibr" rid="BIBR-11">[11]</xref>.</p><p><bold>Definition 3.9</bold> (Gauge)<italic>. A gauge is a strictly positive function δ, defined on </italic><inline-formula><tex-math id="math-70"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { * } \end{document} ]]></tex-math></inline-formula><italic> taking values in </italic><inline-formula><tex-math id="math-71"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { * } , \delta ( \infty ) = \delta ( - \infty ) \end{document} ]]></tex-math></inline-formula></p><list list-type="order"><list-item><p>∀x <inline-formula><tex-math id="math-72"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \neq \pm \infty \end{document} ]]></tex-math></inline-formula> , the gauge determines a closed interval <inline-formula><tex-math id="math-73"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta [ x ] \end{document} ]]></tex-math></inline-formula> often denoted by <inline-formula><tex-math id="math-74"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { x } \end{document} ]]></tex-math></inline-formula> and we set <inline-formula><tex-math id="math-75"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta [ x ] = [ x - \delta ( x ) , x + \delta ( x ) ] \end{document} ]]></tex-math></inline-formula></p><p>The intervals <inline-formula><tex-math id="math-76"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta [ \infty ] = \left[ { \frac { 1 } { \delta ( \infty ) } } , \infty \right] , \delta [ - \infty ] = \left[ - \infty , { \frac { 1 } { \delta ( - \infty ) } } \right] . \end{document} ]]></tex-math></inline-formula></p></list-item><list-item><p>If for any <inline-formula><tex-math id="math-77"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x , \delta ( x ) = \infty , \end{document} ]]></tex-math></inline-formula> we set <inline-formula><tex-math id="math-78"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta \bar { [ } x ] = \delta _ { x } = \mathbb { R } ^ { * } \bar { = } \mathbb { X } f o \tau \end{document} ]]></tex-math></inline-formula> that point x.</p></list-item></list><p>A gauge allows the selection of tag points from an interval at which the Riemann sum is evaluated. It controls the size of the blocks in the partition. If <inline-formula><tex-math id="math-79"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-80"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \lambda \end{document} ]]></tex-math></inline-formula>are two gauges on X, then there exist a gauge denoted by <inline-formula><tex-math id="math-81"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta \cap \lambda . \end{document} ]]></tex-math></inline-formula> defined as <inline-formula><tex-math id="math-82"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \delta \cap \lambda ) ( x ) = m i n \{ \delta ( x ) , \lambda ( x ) \} \end{document} ]]></tex-math></inline-formula> , for all <inline-formula><tex-math id="math-83"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in \mathbb { R } ^ { * } \end{document} ]]></tex-math></inline-formula> . Note: <inline-formula><tex-math id="math-84"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \delta \cap \lambda ) [ x ] \subset \delta [ x ] \cap \lambda [ x ] \end{document} ]]></tex-math></inline-formula></p><p><bold>Definition 3.10</bold> (Tagged Partition of a cell <italic>K</italic>)<italic>. By a tagged partition P of a cell </italic><inline-formula><tex-math id="math-85"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K \end{document} ]]></tex-math></inline-formula><italic> , we mean a finite collection </italic><inline-formula><tex-math id="math-86"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P = \{ ( x _ { k } , K _ { k } ) : k = 1 , 2 , . . \kappa \} \end{document} ]]></tex-math></inline-formula><italic> , where the collection </italic><inline-formula><tex-math id="math-87"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { k } : k = 1 , 2 , . . , \kappa \end{document} ]]></tex-math></inline-formula><italic> is a partition of K, xk is a tag of </italic><inline-formula><tex-math id="math-88"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { k } , x _ { k } \in K _ { k } { } ^ { * } ( = K _ { k } \end{document} ]]></tex-math></inline-formula><italic> on the real line). The </italic><inline-formula><tex-math id="math-89"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p a i r \left( x _ { k } , K _ { k } \right) \end{document} ]]></tex-math></inline-formula><italic> is called as a tagged block.</italic></p><p><bold>Definition 3.11</bold> (<inline-formula><tex-math id="math-90"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta \end{document} ]]></tex-math></inline-formula><italic>−</italic> fine partitions)<italic>. For a gauge δ, a block </italic><inline-formula><tex-math id="math-91"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x , J ) \end{document} ]]></tex-math></inline-formula><italic> of a tagged partition </italic><inline-formula><tex-math id="math-92"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P \end{document} ]]></tex-math></inline-formula><italic>, is said to be </italic><inline-formula><tex-math id="math-93"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta - \ f n e \end{document} ]]></tex-math></inline-formula><italic> , </italic><inline-formula><tex-math id="math-94"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle i f J \subset \delta _ { x } \end{document} ]]></tex-math></inline-formula><italic> . The tagged partition P is called </italic><inline-formula><tex-math id="math-95"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta - \end{document} ]]></tex-math></inline-formula><italic> fine if each tagged block is </italic><inline-formula><tex-math id="math-96"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta - \ f n e \end{document} ]]></tex-math></inline-formula><italic> . We say </italic><inline-formula><tex-math id="math-97"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P \ll \delta \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p><bold>Definition 3.12</bold> (Riemann sum)<italic>. Let </italic><inline-formula><tex-math id="math-98"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P = \{ ( x _ { k } , K _ { k } ) , k = 1 , 2 , \ldots , n \} \end{document} ]]></tex-math></inline-formula><italic> be a </italic><inline-formula><tex-math id="math-99"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta - \ f n e \end{document} ]]></tex-math></inline-formula><italic> tagged partition for some gauge δ. We evaluate the mapping f at the tag points to form the Riemann sums </italic><inline-formula><tex-math id="math-100"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle S ( P , \delta , f ) = \sum _ { k = 1 } ^ { n } f ( x _ { k } ) | K _ { k } | \end{document} ]]></tex-math></inline-formula><italic> , where </italic><inline-formula><tex-math id="math-101"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | K _ { k } | \end{document} ]]></tex-math></inline-formula><italic> is the length of the sub-interval </italic><inline-formula><tex-math id="math-102"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { k } \end{document} ]]></tex-math></inline-formula><italic>.</italic></p><p>The gauges form a directed set and <inline-formula><tex-math id="math-103"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta 0 \end{document} ]]></tex-math></inline-formula> implies <inline-formula><tex-math id="math-104"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta ( t ) 0 \end{document} ]]></tex-math></inline-formula> . The Riemann sums form a net in the <inline-formula><tex-math id="math-105"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { T V S ~ \mathbb { X } } \end{document} ]]></tex-math></inline-formula>.</p><p><bold>Definition 3.13.</bold><italic>The mapping f with values in a TVS X is said to be Henstock–Kurzweil integrable over a cell </italic><inline-formula><tex-math id="math-106"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K = [ a , b ] \end{document} ]]></tex-math></inline-formula><italic> , if there exist </italic><inline-formula><tex-math id="math-107"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \in X \end{document} ]]></tex-math></inline-formula><italic> , such that </italic><inline-formula><tex-math id="math-108"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { \operatorname* { l i m } _ { \delta \to 0 } S ( P , \delta , f ) = I } \end{array} \end{document} ]]></tex-math></inline-formula> , <italic>that is with the property, given a balanced nbd U of 0, a gauge </italic><inline-formula><tex-math id="math-109"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta \end{document} ]]></tex-math></inline-formula><italic> such that, for </italic><inline-formula><tex-math id="math-110"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P \ll \delta , \ S ( P , \delta , f ) - I \in U \end{document} ]]></tex-math></inline-formula></p></sec><sec id="sec-4"><title>4. IMPLICIT FUNCTION THEOREM</title><p><bold>Theorem 4.1</bold> (Implicit Function Theorem). <italic>Let </italic><inline-formula><tex-math id="math-111"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> be a topological space, </italic><inline-formula><tex-math id="math-112"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Y \end{document} ]]></tex-math></inline-formula><italic> a Banach space and </italic><inline-formula><tex-math id="math-113"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \textit { Z a } \end{document} ]]></tex-math></inline-formula><italic> Hausdorf TVS.</italic></p><list list-type="order"><list-item><p>(Let F be a continuous mapping of an open set <inline-formula><tex-math id="math-114"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle E = D \times V \subset X \times Y \to Z \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-115"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( a , b ) = 0 \end{document} ]]></tex-math></inline-formula> for some point <inline-formula><tex-math id="math-116"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( a , b ) \in E \end{document} ]]></tex-math></inline-formula></p></list-item><list-item><p><inline-formula><tex-math id="math-117"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \forall x \in D \end{document} ]]></tex-math></inline-formula><italic> , let the mapping </italic><inline-formula><tex-math id="math-118"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F _ { x } ( y ) = F ( x , y ) \end{document} ]]></tex-math></inline-formula><italic> on V be diferentiable with respect to y and the derivative </italic><inline-formula><tex-math id="math-119"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { \partial F } { \partial y } \end{document} ]]></tex-math></inline-formula><italic> is continuous on E.</italic></p></list-item><list-item><p>Let <inline-formula><tex-math id="math-120"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A = { \frac { \partial F } { \partial y } } ( a , b ) \end{document} ]]></tex-math></inline-formula> be an invertible continuous <inline-formula><tex-math id="math-121"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L . T . \colon Y \to Z \end{document} ]]></tex-math></inline-formula> , with continuous inverse.</p></list-item></list><p><bold>Part I:</bold> There exist a open nbd <inline-formula><tex-math id="math-122"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U \subset D , W \subset Y \end{document} ]]></tex-math></inline-formula> with <inline-formula><tex-math id="math-123"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \in U , b \in W \end{document} ]]></tex-math></inline-formula>, having the following property: there exist a continuous mapping <inline-formula><tex-math id="math-124"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi : U \to W \end{document} ]]></tex-math></inline-formula>, such that <inline-formula><tex-math id="math-125"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y = \phi ( x ) , F ( x , \phi ( x ) ) = 0 , b = \phi ( a ) \end{document} ]]></tex-math></inline-formula></p><p><bold>Part II:</bold> When <inline-formula><tex-math id="math-126"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is TVS and the map <inline-formula><tex-math id="math-127"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle h : X \to F ( x , b ) \end{document} ]]></tex-math></inline-formula> is diferentiable with respect to x at the point <inline-formula><tex-math id="math-128"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = a \end{document} ]]></tex-math></inline-formula> with the derivative as <inline-formula><tex-math id="math-129"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle T = \frac { \partial { \cal F } } { \partial x } ( a , b ) \end{document} ]]></tex-math></inline-formula> , then <inline-formula><tex-math id="math-130"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi \end{document} ]]></tex-math></inline-formula> is diferentiable at <inline-formula><tex-math id="math-131"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a , \phi ^ { \prime } ( a ) = \frac { d y } { d x } ( x = b ) = - A ^ { - 1 } \circ T \ . ^ { \prime } \circ ^ { \prime } \end{document} ]]></tex-math></inline-formula> stands for composite of linear maps. The assertion holds in a nbd of a and when F is <inline-formula><tex-math id="math-132"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { C ^ { 1 } , \phi } \end{document} ]]></tex-math></inline-formula> is <inline-formula><tex-math id="math-133"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C ^ { 1 } \end{document} ]]></tex-math></inline-formula></p><p><italic>Proof.</italic> The proof works even if <inline-formula><tex-math id="math-134"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( \boldsymbol { a } , \boldsymbol { b } ) \end{document} ]]></tex-math></inline-formula> is a constant <inline-formula><tex-math id="math-135"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle c \neq 0 . \ F ( x , y ) \end{document} ]]></tex-math></inline-formula> is replaced with <inline-formula><tex-math id="math-136"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x , y ) - c \end{document} ]]></tex-math></inline-formula> which now satisfies the conditions in the theorem.</p><sec id="sec-5"><title>Proof of the First Part</title><p><bold>Step 1:</bold> As <inline-formula><tex-math id="math-137"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } , F \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-138"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { \partial F } { \partial y } \end{document} ]]></tex-math></inline-formula> are continuous on E and <inline-formula><tex-math id="math-139"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( a , b ) = 0 \end{document} ]]></tex-math></inline-formula> , select a nbd <inline-formula><tex-math id="math-140"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U \subset D \end{document} ]]></tex-math></inline-formula> of a and <inline-formula><tex-math id="math-141"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle r > 0 , W { \stackrel { \smile } { = } } B ( b , r ) \subset B [ b , r ] \subset V \end{document} ]]></tex-math></inline-formula> , such that, for <inline-formula><tex-math id="math-142"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( x , y ) \in D \end{document} ]]></tex-math></inline-formula> ,<target id="anchor-9e0649a1-f9d6-4211-83b6-afe031ceb304" target-type="reference-target"/></p><disp-formula id="equation-2"><tex-math id="math-143"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| \left| A ^ {- 1} \left(\frac {\partial F}{\partial y} - A\right) \right| \right| = \left| \left| A ^ {- 1} \frac {\partial F}{\partial y} - I \right| \right| < \frac {1}{2}, | A ^ {- 1} F (x, b) | < \frac {r}{2}\tag{4.1} \end{document} ]]></tex-math></disp-formula><p>Consider the continuous mapping <inline-formula><tex-math id="math-144"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K ( x , y ) = y - A ^ { - 1 } F ( x , y ) \ \forall x \in D \end{document} ]]></tex-math></inline-formula> Define the mapping <inline-formula><tex-math id="math-145"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } : W \to Y , \end{document} ]]></tex-math></inline-formula> as <inline-formula><tex-math id="math-146"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } ( y ) = y - A ^ { - 1 } F ( x , y ) \end{document} ]]></tex-math></inline-formula></p><p>Then <inline-formula><tex-math id="math-147"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x , y ) = 0 \end{document} ]]></tex-math></inline-formula> if and only if <inline-formula><tex-math id="math-148"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } ( y ) = y , \end{document} ]]></tex-math></inline-formula> that is y is a fixed point of <inline-formula><tex-math id="math-149"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K \end{document} ]]></tex-math></inline-formula> . </p><p><bold>Step 2:</bold><inline-formula><tex-math id="math-150"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } \end{document} ]]></tex-math></inline-formula> is shown as a contraction mapping for all <inline-formula><tex-math id="math-151"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \in D \end{document} ]]></tex-math></inline-formula> Consider the mapping <inline-formula><tex-math id="math-152"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H = A ^ { - 1 } F - I . \end{document} ]]></tex-math></inline-formula> . By chain rule, noting that as I and <inline-formula><tex-math id="math-153"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } \end{document} ]]></tex-math></inline-formula> are linear mappings, derivative of <inline-formula><tex-math id="math-154"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } \end{document} ]]></tex-math></inline-formula> is <inline-formula><tex-math id="math-155"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } \end{document} ]]></tex-math></inline-formula> and derivative of I is I. We have,</p><disp-formula id="equation-3"><tex-math id="math-156"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac {\partial H}{\partial y} = A ^ {- 1} \frac {\partial F}{\partial y} - I\tag{4.2} \end{document} ]]></tex-math></disp-formula><p>So by Mean Value Theorem applied to the line segment joining <inline-formula><tex-math id="math-157"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y _ { 1 } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-158"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y _ { 2 } \end{document} ]]></tex-math></inline-formula> , we have,<target id="anchor-ceeeeb35-9ed6-4438-85ba-1393d3ae7028" target-type="reference-target"/></p><disp-formula id="equation-4"><tex-math id="math-159"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \left| H \left(y _ {1}\right) - H \left(y _ {2}\right) \right| \leq \sup \left| \left| \frac {\partial H}{\partial y} \right| \right| \cdot \left| y _ {1} - y _ {2} \right| < \frac {\left| y _ {1} - y _ {2} \right|}{2}\tag{4.3} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-5"><tex-math id="math-160"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{r l} & {| K _ {x} (y _ {2}) - K _ {x} (y _ {1}) | = | y _ {1} - y _ {2} - A ^ {- 1} [ F (x, y _ {1}) - F (x, y _ {2}) ] |} \\ & {\qquad = | A ^ {- 1} [ A (y _ {1} - y _ {2}) - F (x, y _ {1}) - F (x, y _ {2}) ] |. \mathrm{Thus},} \end{array} \end{document} ]]></tex-math></disp-formula><p><target id="anchor-c917c1e9-df50-4fe8-a245-31438cf8fd90" target-type="reference-target"/></p><disp-formula id="equation-6"><tex-math id="math-161"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | K _ {x} (y _ {2}) - K _ {x} (y _ {1}) | = | H (y _ {1}) - H (y _ {2}) | < \frac {1}{2} | y _ {1} - y _ {2} |\tag{4.4} \end{document} ]]></tex-math></disp-formula><p>Thus <inline-formula><tex-math id="math-162"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } \end{document} ]]></tex-math></inline-formula> is a contraction mapping with contracting factor <inline-formula><tex-math id="math-163"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \frac { 1 } { 2 } } \end{document} ]]></tex-math></inline-formula>. </p><p><bold>Step 3:</bold> To show <inline-formula><tex-math id="math-164"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } \end{document} ]]></tex-math></inline-formula> maps <inline-formula><tex-math id="math-165"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B [ b , r ] B [ b , r ] \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-166"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B ( b , r ) { \bf \bar { \cal B } } ( b , r ) \end{document} ]]></tex-math></inline-formula></p><p>Consider, for <inline-formula><tex-math id="math-167"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \in B [ b , r ] \end{document} ]]></tex-math></inline-formula></p><disp-formula id="equation-7"><tex-math id="math-168"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l} | K _ {x} (y) - b | \leq | K _ {x} (y) - K _ {x} (b) | + | K _ {x} (b) - b | \\ \quad \leq \frac {1}{2} r + | A ^ {- 1} F (x, b) | \\ \quad = \frac {r}{2} + \frac {r}{2} \\ \quad = r, \qquad \text . \end{array} \end{document} ]]></tex-math></disp-formula><p>by using (<xref ref-type="custom" custom-type="reference-target" rid="anchor-9e0649a1-f9d6-4211-83b6-afe031ceb304">4.1</xref>).</p><p>So given <inline-formula><tex-math id="math-169"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x , K _ { x } \end{document} ]]></tex-math></inline-formula> has unique fixed point say, y in <inline-formula><tex-math id="math-170"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle B [ b , r ] \end{document} ]]></tex-math></inline-formula> . To find <inline-formula><tex-math id="math-171"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x , \phi ( x ) ) \end{document} ]]></tex-math></inline-formula> let <inline-formula><tex-math id="math-172"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y _ { x } = \phi ( x ) \end{document} ]]></tex-math></inline-formula> . Consider <inline-formula><tex-math id="math-173"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x , y _ { x } ) = A ( y _ { x } - K _ { x } ( y _ { x } ) ) = A ( y _ { x } - y _ { x } ) = 0 \end{document} ]]></tex-math></inline-formula> . Since the fixed point is unique, <inline-formula><tex-math id="math-174"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi ( a ) = b ; \end{document} ]]></tex-math></inline-formula> as <inline-formula><tex-math id="math-175"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( a , b ) = 0 \end{document} ]]></tex-math></inline-formula>. </p><p><bold>Step 4:</bold> To show  <inline-formula><tex-math id="math-176"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi \end{document} ]]></tex-math></inline-formula> is continuous. Consider,</p><disp-formula id="equation-8"><tex-math id="math-177"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | \phi (x) - \phi (x ^ {\prime}) | = | K (x, \phi (x)) - K (x ^ {\prime}, \phi (x ^ {\prime})) | \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-9"><tex-math id="math-178"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l} \leq | K (x, \phi (x)) - K (x, \phi (x ^ {\prime}) | + | K (x, \phi (x ^ {\prime}) - K (x ^ {\prime}, \phi (x ^ {\prime}) | \\ \leq | K _ {x} (\phi (x)) - K _ {x} (\phi (x ^ {\prime})) | + | K (x, \phi (x ^ {\prime})) - K (x ^ {\prime}, \phi (x ^ {\prime})) | \\ \leq \frac {1}{2} | \phi (x) - \phi (x ^ {\prime}) | + | K (x, \phi (x ^ {\prime})) - K (x ^ {\prime}, \phi (x ^ {\prime})) |, \quad \text \\ | \phi (x) - \phi (x ^ {\prime}) | \leq 2 | K (x, \phi (x ^ {\prime})) - K (x ^ {\prime}, \phi (x ^ {\prime})) | \end{array} \tag {4.5} \end{document} ]]></tex-math></disp-formula><p>by using (<xref ref-type="custom" custom-type="reference-target" rid="anchor-c917c1e9-df50-4fe8-a245-31438cf8fd90">4.4</xref>)</p><p>Therefore, <inline-formula><tex-math id="math-179"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi \end{document} ]]></tex-math></inline-formula> is continuous as K is continuous.</p></sec><sec id="sec-6"><title>Proof of the Second Part</title><p><bold>Step 5:</bold> Without loss of generality, let <inline-formula><tex-math id="math-180"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi ( a ) = b = 0 \end{document} ]]></tex-math></inline-formula> . The map <inline-formula><tex-math id="math-181"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle g : U \to Z \end{document} ]]></tex-math></inline-formula> where, <inline-formula><tex-math id="math-182"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle g ( x ) = F ( x , 0 ) \end{document} ]]></tex-math></inline-formula> is diferentiable at <inline-formula><tex-math id="math-183"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = a \end{document} ]]></tex-math></inline-formula> , with derivative <inline-formula><tex-math id="math-184"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \frac { \partial F } { \partial x } } ( a , 0 ) = T \end{document} ]]></tex-math></inline-formula> . Consider <inline-formula><tex-math id="math-185"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac{\phi(a+tv)-\phi(a)}{t}+A^{-1}T\cdot v=\frac{\phi(a+tv)-\phi(a)+A^{-1}T\cdot tv}{t}=\frac{\phi(x)-\phi(a)+A^{-1}T\cdot h}{t} \end{document} ]]></tex-math></inline-formula> where, <inline-formula><tex-math id="math-186"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = a + t v , h = t v \end{document} ]]></tex-math></inline-formula>. Given <inline-formula><tex-math id="math-187"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \epsilon > 0 \end{document} ]]></tex-math></inline-formula> , as <inline-formula><tex-math id="math-188"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { \stackrel { t } { \partial } \boldsymbol { F } } { \partial \boldsymbol { y } } \end{document} ]]></tex-math></inline-formula> is continuous on <inline-formula><tex-math id="math-189"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle D \times V \end{document} ]]></tex-math></inline-formula> , there exist a nbd <inline-formula><tex-math id="math-190"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U ^ { \prime } \end{document} ]]></tex-math></inline-formula> of <inline-formula><tex-math id="math-191"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a , U ^ { \prime } \subset U \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-192"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < s < r \end{document} ]]></tex-math></inline-formula> such that, if we set <inline-formula><tex-math id="math-193"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle W ^ { \prime } = B ( 0 , s ) \end{document} ]]></tex-math></inline-formula> then on <inline-formula><tex-math id="math-194"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U ^ { \prime } \times W ^ { \prime } , | | A ^ { - 1 } [ \frac { \partial F } { \partial y } ( x , y ) - \frac { \partial F } { \partial y } ( a , 0 ) ] | = | | \frac { \partial h } { \partial y } | | < \epsilon . \end{document} ]]></tex-math></inline-formula> . We now use (<xref ref-type="custom" custom-type="reference-target" rid="anchor-ceeeeb35-9ed6-4438-85ba-1393d3ae7028">4.3</xref>) and then <inline-formula><tex-math id="math-195"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A^{-1}\left[F(x,\overline{y})-F(x,0)-A(y-0)\right] \end{document} ]]></tex-math></inline-formula><inline-formula><tex-math id="math-196"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle = A ^ { - 1 } [ F ( x , y ) - A y ] - A ^ { - 1 } [ F ( x , 0 ) - A 0 ] \end{document} ]]></tex-math></inline-formula> . Hence we have,</p><disp-formula id="equation-10"><tex-math id="math-197"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ {- 1} [ F (x, y) - F (x, 0) - A (y - 0) ] = H y - H 0 \leq \epsilon | y |\tag{4.6} \end{document} ]]></tex-math></disp-formula><p>Given <inline-formula><tex-math id="math-198"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y \in W ^ { \prime } \end{document} ]]></tex-math></inline-formula> we write <inline-formula><tex-math id="math-199"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y = \phi ( x ) \end{document} ]]></tex-math></inline-formula> and y is a fixed point of <inline-formula><tex-math id="math-200"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { x } \end{document} ]]></tex-math></inline-formula> . Also <inline-formula><tex-math id="math-201"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi ( a ) = b = 0 \end{document} ]]></tex-math></inline-formula>.</p><disp-formula id="equation-11"><tex-math id="math-202"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{r l} \frac {\phi (x) + A ^ {- 1} T \cdot h}{t} & = \frac {y - A ^ {- 1} [ F (x , y) - T \cdot h ]}{t} \\ & = \frac {y - A ^ {- 1} [ F (x , y) - F (x , 0) - A y + A y ] - A ^ {- 1} [ F (x , 0) - T \cdot h ]}{t} \\ & = \frac {y - A ^ {- 1} [ F (x , y) - F (x , 0) - A (y - 0) ] - A ^ {- 1} A y + A ^ {- 1} [ F (x , 0) - T \cdot h ]}{t} \end{array} \end{document} ]]></tex-math></disp-formula><p><inline-formula><tex-math id="math-203"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \leq \epsilon | y | + A ^ { - 1 } R ( h ) \end{document} ]]></tex-math></inline-formula> where, <inline-formula><tex-math id="math-204"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle R ( h ) \end{document} ]]></tex-math></inline-formula> is tangent in <inline-formula><tex-math id="math-205"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> as <inline-formula><tex-math id="math-206"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { \partial f } { \partial x } \end{document} ]]></tex-math></inline-formula> exists at <inline-formula><tex-math id="math-207"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x = a \end{document} ]]></tex-math></inline-formula></p><p>Now, <inline-formula><tex-math id="math-208"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | y | = | \phi ( x ) | = | K _ { x } ( y ) | = | K _ { x } ( y ) - K _ { x } ( 0 ) + K _ { x } ( 0 ) | \leq | y - K _ { x } ( 0 ) | + | K _ { x } ( 0 ) | . \end{document} ]]></tex-math></inline-formula> Thus, <inline-formula><tex-math id="math-209"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { | y | \le \frac { 1 } { 2 } | y | + | K ( x , 0 ) | = \frac { 1 } { 2 } | y | + | - A ^ { - 1 } F ( x , 0 ) | } \end{array} \end{document} ]]></tex-math></inline-formula> , by the definition of the mapping <inline-formula><tex-math id="math-210"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K . \ \bar { \mathrm { S o } } , \ | y | \leq 2 | A ^ { - 1 } [ F ( \bar { a } , 0 ) + T \cdot h + t R ( h ) ] | \end{document} ]]></tex-math></inline-formula> , where <inline-formula><tex-math id="math-211"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle R ( h ) \end{document} ]]></tex-math></inline-formula> is tangent in <inline-formula><tex-math id="math-212"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>. But <inline-formula><tex-math id="math-213"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( a , 0 ) = 0 \end{document} ]]></tex-math></inline-formula> . Therefore, <inline-formula><tex-math id="math-214"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | y | \le | 2 A ^ { - 1 } t R ( h ) | + | 2 A ^ { - 1 } T ( h ) | \end{document} ]]></tex-math></inline-formula> |. As <inline-formula><tex-math id="math-215"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } T \end{document} ]]></tex-math></inline-formula> is continuous, <inline-formula><tex-math id="math-216"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { g i v e n } \ \epsilon > 0 . \end{document} ]]></tex-math></inline-formula> , we can select the nbd of <inline-formula><tex-math id="math-217"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x , \end{document} ]]></tex-math></inline-formula> so that <inline-formula><tex-math id="math-218"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | A ^ { - 1 } T ( h ) | < \epsilon \end{document} ]]></tex-math></inline-formula> . Since <inline-formula><tex-math id="math-219"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle R ( h ) \end{document} ]]></tex-math></inline-formula> is tangent and <inline-formula><tex-math id="math-220"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } \end{document} ]]></tex-math></inline-formula> is continuous <inline-formula><tex-math id="math-221"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | y | \end{document} ]]></tex-math></inline-formula> is tangent in <inline-formula><tex-math id="math-222"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula>.</p><p><bold>Step 6:</bold> Now suppose <inline-formula><tex-math id="math-223"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle g ( x ) \end{document} ]]></tex-math></inline-formula> is <inline-formula><tex-math id="math-224"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C ^ { 1 } \end{document} ]]></tex-math></inline-formula> mapping from <inline-formula><tex-math id="math-225"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X Z \end{document} ]]></tex-math></inline-formula> . We see (by the lemma which follows) that, as A is invertible at <inline-formula><tex-math id="math-226"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( a , 0 ) \end{document} ]]></tex-math></inline-formula> , there exist a nbd <inline-formula><tex-math id="math-227"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U = G \times W \end{document} ]]></tex-math></inline-formula> of <inline-formula><tex-math id="math-228"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( a , 0 ) \end{document} ]]></tex-math></inline-formula> in which <inline-formula><tex-math id="math-229"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \frac { \partial F } { \partial y } } f ( x , y ) \end{document} ]]></tex-math></inline-formula> is invertible. So there is nothing special about the point <inline-formula><tex-math id="math-230"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( a , 0 ) \end{document} ]]></tex-math></inline-formula> . So <inline-formula><tex-math id="math-231"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi \end{document} ]]></tex-math></inline-formula> is diferentiable at <italic>x</italic>, in a small neighbourhood around <italic>x</italic>. Now as <inline-formula><tex-math id="math-232"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { d y } { d x } = - \bigg ( \frac { \partial F } { \partial y } \bigg ) ^ { - 1 } \cdot \frac { \partial F } { \partial x } , \frac { d y } { d x } \end{document} ]]></tex-math></inline-formula> will be sequentially continuous when <inline-formula><tex-math id="math-233"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { \partial F } { \partial x } \end{document} ]]></tex-math></inline-formula> is sequentially continuous. Thus <inline-formula><tex-math id="math-234"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \phi \end{document} ]]></tex-math></inline-formula> is <inline-formula><tex-math id="math-235"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle C ^ { 1 } \end{document} ]]></tex-math></inline-formula> . □</p><p><bold>Lemma 4.2.</bold><italic>A nbd of the point </italic><inline-formula><tex-math id="math-236"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( a , 0 ) \end{document} ]]></tex-math></inline-formula><italic> exists in which </italic><inline-formula><tex-math id="math-237"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \frac { \partial F } { \partial y } ( x , y ) \end{document} ]]></tex-math></inline-formula><italic> is invertible.</italic></p><p><italic>Proof.</italic> Let <inline-formula><tex-math id="math-238"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \frac { \partial F } { \partial y } } ( x , y ) = P \end{document} ]]></tex-math></inline-formula> . It can be noted that L.T. <italic>B</italic> such that <inline-formula><tex-math id="math-239"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | | B | | < 1 \end{document} ]]></tex-math></inline-formula> is invertible, as it is the sum of the convergent geometric series <inline-formula><tex-math id="math-240"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( I + B + B ^ { 2 } + \cdots ) \end{document} ]]></tex-math></inline-formula> So any L. T. M such that <inline-formula><tex-math id="math-241"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | | \boldsymbol { M } - \boldsymbol { I } | | < 1 \end{document} ]]></tex-math></inline-formula> is invertible, as <inline-formula><tex-math id="math-242"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \lvert \lvert \boldsymbol { M } \rvert \rvert = \lvert \lvert \boldsymbol { I } - ( \boldsymbol { I } - \boldsymbol { M } ) \rvert \rvert \end{document} ]]></tex-math></inline-formula> So <inline-formula><tex-math id="math-243"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { | | \dot { A } ^ { - 1 } P - I | | < \frac { 1 } { 2 } } \end{array} \end{document} ]]></tex-math></inline-formula> . Hence <inline-formula><tex-math id="math-244"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle A ^ { - 1 } P \end{document} ]]></tex-math></inline-formula> is invertible. Thus, <inline-formula><tex-math id="math-245"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P = A A ^ { - 1 } P \end{document} ]]></tex-math></inline-formula> is invertible as <inline-formula><tex-math id="math-246"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P ^ { - 1 } = \left( A ^ { - 1 } P \right) ^ { - 1 } A ^ { - 1 } \end{document} ]]></tex-math></inline-formula> .□</p><p><bold>Remark 4.1.</bold><italic>An Inverse Function Theorem can be deduced as in</italic><xref ref-type="bibr" rid="BIBR-12">[12]</xref>.</p></sec></sec><sec id="sec-7"><title>5. Henstock-Kurzweil Integration</title><p><bold>Theorem 5.1.</bold><italic>The integral is well defined.</italic></p><p><italic>Proof.</italic> Cousin’s lemma [<xref ref-type="bibr" rid="BIBR-9">9</xref>, <xref ref-type="bibr" rid="BIBR-11">11</xref>, <xref ref-type="bibr" rid="BIBR-13">13</xref>, <xref ref-type="bibr" rid="BIBR-14">14</xref>] ensures that given any gauge <inline-formula><tex-math id="math-247"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta \end{document} ]]></tex-math></inline-formula>− fine tagged partition <inline-formula><tex-math id="math-248"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P \end{document} ]]></tex-math></inline-formula> exists. Suppose I and I<sup>′</sup> are two values of the integral. Given a balanced nbd <inline-formula><tex-math id="math-249"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U \end{document} ]]></tex-math></inline-formula> of 0 select a balanced nbd <inline-formula><tex-math id="math-250"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V \end{document} ]]></tex-math></inline-formula> of 0 such that <inline-formula><tex-math id="math-251"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v + V \subset U . \end{document} ]]></tex-math></inline-formula> . As I is a value of the integral given <inline-formula><tex-math id="math-252"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V \end{document} ]]></tex-math></inline-formula> , there exist a gauge <inline-formula><tex-math id="math-253"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { 1 } \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-254"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle S ( P , \delta _ { 1 } , f ) - I \in V \end{document} ]]></tex-math></inline-formula> . As I<sup>′</sup> is a value of the integral given <inline-formula><tex-math id="math-255"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V \end{document} ]]></tex-math></inline-formula> , a gauge <inline-formula><tex-math id="math-256"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { 2 } \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-257"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle S ( P , \delta _ { 2 } , f ) - I ^ { \prime } \in V \end{document} ]]></tex-math></inline-formula> . Consider the gauge <inline-formula><tex-math id="math-258"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta = \delta _ { 1 } \cap \delta _ { 2 } \end{document} ]]></tex-math></inline-formula>.</p><p>For <inline-formula><tex-math id="math-259"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle P \ll \delta \end{document} ]]></tex-math></inline-formula> we have <inline-formula><tex-math id="math-260"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle S ( P , f ) - I + I ^ { \prime } - S ( P , f ) \in V + V \subset U \end{document} ]]></tex-math></inline-formula> , that is <inline-formula><tex-math id="math-261"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I - I ^ { \prime } \in U \end{document} ]]></tex-math></inline-formula> Since <inline-formula><tex-math id="math-262"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula> is Hausdorf, <inline-formula><tex-math id="math-263"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I = I ^ { \prime } \end{document} ]]></tex-math></inline-formula> . If <inline-formula><tex-math id="math-264"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle { \boldsymbol { I } } \neq { \boldsymbol { I } } ^ { \prime } \end{document} ]]></tex-math></inline-formula> they should have disjoint nbds. So we arrive at a contradiction unless <inline-formula><tex-math id="math-265"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I = I ^ { \prime } \end{document} ]]></tex-math></inline-formula> □</p><p>It is now shown that every derivative of a continuous function is integrable over a closed interval. This is not true for Riemann or Lebesgue integral.</p></sec><sec id="sec-8"><title>6. Fundamental Theorem of Calculus</title><p><target id="anchor-a4a3eae0-f95e-40bd-8ec2-84ff9f3f4dce" target-type="reference-target"/></p><p><bold>Theorem 6.1</bold> (Fundamental theorem of Calculus)<italic>. Let </italic><inline-formula><tex-math id="math-266"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula><italic> be a primitive of a mapping f on a closed cell </italic><inline-formula><tex-math id="math-267"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle J = [ a , b ] \end{document} ]]></tex-math></inline-formula><italic> in R. Then </italic><inline-formula><tex-math id="math-268"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { \int _ { a } ^ { b } f ( x ) d x = F ( b ) - F ( a ) } \end{array} \end{document} ]]></tex-math></inline-formula></p><p>The proof of the theorem depends upon the following simple lemma. It must be noted that only consider balanced neighbourhoods of 0 have to be considered.</p><p><bold>Lemma 6.2</bold> (Straddle Lemma)<italic>. If F is diferentiable at a point t, with the derivative </italic><inline-formula><tex-math id="math-269"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ^ { \prime } ( t ) \end{document} ]]></tex-math></inline-formula><italic> denoted by </italic><inline-formula><tex-math id="math-270"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f ( t ) \end{document} ]]></tex-math></inline-formula><italic> , then for each nbd U of 0, there exist </italic><inline-formula><tex-math id="math-271"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { \epsilon } ( t ) > 0 \end{document} ]]></tex-math></inline-formula><italic> and a cell </italic><inline-formula><tex-math id="math-272"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle T _ { t } , = \left[ t - \delta _ { \epsilon } ( t ) , t + \delta _ { \epsilon } ( t ) \right] \end{document} ]]></tex-math></inline-formula><italic> such that whenever x </italic><inline-formula><tex-math id="math-273"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \geq t \geq y \end{document} ]]></tex-math></inline-formula><italic> are in </italic><inline-formula><tex-math id="math-274"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle T _ { t } \end{document} ]]></tex-math></inline-formula><italic>, that is </italic><inline-formula><tex-math id="math-275"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle [ y , x ] \ll \delta _ { U } \end{document} ]]></tex-math></inline-formula><italic>, </italic><inline-formula><tex-math id="math-276"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x ) - F ( y ) - f ( t ) ( x - y ) \in U \end{document} ]]></tex-math></inline-formula><italic>, that is, </italic><inline-formula><tex-math id="math-277"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x ) - F ( y ) - f ( t ) ( x - y ) \to 0 \end{document} ]]></tex-math></inline-formula><italic> as </italic><inline-formula><tex-math id="math-278"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { U } ( t ) \to 0 \end{document} ]]></tex-math></inline-formula>.</p><p><italic>Proof.</italic> As <inline-formula><tex-math id="math-279"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula> is diferentiable at <inline-formula><tex-math id="math-280"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t , \end{document} ]]></tex-math></inline-formula> the derivative <inline-formula><tex-math id="math-281"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ^ { \prime } ( t ) \end{document} ]]></tex-math></inline-formula> being given by <inline-formula><tex-math id="math-282"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { f ( t ) , \frac { F ( z ) - F ( t ) } { z - t } \to } \end{array} \end{document} ]]></tex-math></inline-formula><inline-formula><tex-math id="math-283"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f ( t ) , { \mathrm { ~ a s ~ } } z \to t . \end{document} ]]></tex-math></inline-formula> . As each nbd of origin contains a balanced nbd, given a balanced nbd <inline-formula><tex-math id="math-284"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle U \end{document} ]]></tex-math></inline-formula> of <inline-formula><tex-math id="math-285"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 , \end{document} ]]></tex-math></inline-formula> , consider a balanced nbd <inline-formula><tex-math id="math-286"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V \end{document} ]]></tex-math></inline-formula> of 0 such that <inline-formula><tex-math id="math-287"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V + V \subset U \end{document} ]]></tex-math></inline-formula> . So corresponding to <inline-formula><tex-math id="math-288"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V \end{document} ]]></tex-math></inline-formula>, a number <inline-formula><tex-math id="math-289"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { u } ( t ) > 0 \end{document} ]]></tex-math></inline-formula> , such that <inline-formula><tex-math id="math-290"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { \delta _ { u } ( t ) < \frac { 1 } { 2 } } \end{array} \end{document} ]]></tex-math></inline-formula> . So, <inline-formula><tex-math id="math-291"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( z ) - F ( t ) - f ( t ) \cdot ( z - t ) \in \end{document} ]]></tex-math></inline-formula><inline-formula><tex-math id="math-292"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle | z - t | V , \forall z \in T _ { U } = [ t - \delta _ { \epsilon } ( t ) , t + \delta _ { \epsilon } ( t ) ] \end{document} ]]></tex-math></inline-formula> ]. Choose <inline-formula><tex-math id="math-293"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x , y \in T _ { U } \end{document} ]]></tex-math></inline-formula> such that <inline-formula><tex-math id="math-294"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \geq t \geq y _ { \mathrm { : } } \end{document} ]]></tex-math></inline-formula><inline-formula><tex-math id="math-295"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x ) - F ( t ) - f ( t ) ( x - t ) \in ( x - t ) V \subset V , F ( x ) - F ( t ) - f ( t ) ( x - t ) \in ( x - t ) V \subset V \end{document} ]]></tex-math></inline-formula> The result follows by the addition, using the triangle inequality on the real line and the order <inline-formula><tex-math id="math-296"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x \geq t \geq y \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-297"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle V + V \in U \end{document} ]]></tex-math></inline-formula> . So <inline-formula><tex-math id="math-298"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x ) - F ( y ) - f ( t ) ( x - y ) \in U \end{document} ]]></tex-math></inline-formula> . Hence we have <inline-formula><tex-math id="math-299"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( x ) - F ( y ) - f ( t ) ( x - y ) \to 0 , \end{document} ]]></tex-math></inline-formula> , as <inline-formula><tex-math id="math-300"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { U } ( t ) 0 . \end{document} ]]></tex-math></inline-formula> □</p><p><bold>Remark 6.1</bold>. <xref ref-type="bibr" rid="BIBR-15">[15]</xref><italic>p and q need to straddle r, that is r is between p and q. The lemma states that the slope of the chord joining the points, with ordinates p and q and the slope of the tangent at the point whose ordinate is r are approximately equal as shown in Figure 1.</italic></p><fig id="figure-1"><label>Figure 1.</label><caption><p>Figure showing the positions of p, q and r</p></caption><graphic xlink:href="https://jims-a.org/index.php/jimsa/article/download/1551/557/13954" mime-subtype="jpeg" mimetype="image"><alt-text>Figure 1.</alt-text></graphic></fig><p><italic>Proof</italic>. of theorem <xref ref-type="custom" custom-type="reference-target" rid="anchor-a4a3eae0-f95e-40bd-8ec2-84ff9f3f4dce">6.1</xref>. We do this for every point t. So a gauge <inline-formula><tex-math id="math-301"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta _ { u } \end{document} ]]></tex-math></inline-formula> is obtained having the property. Let the gauge <inline-formula><tex-math id="math-302"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \delta ( t ) = \delta _ { u } ( t ) \end{document} ]]></tex-math></inline-formula> as in the Straddle lemma. Let <inline-formula><tex-math id="math-303"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle T = \{ ( x _ { k } , K _ { k } ) | k = 1 , 2 , \ldots , \kappa \} \end{document} ]]></tex-math></inline-formula> be <inline-formula><tex-math id="math-304"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \textrm { a } \delta - \end{document} ]]></tex-math></inline-formula> fine tagged partition of J. <inline-formula><tex-math id="math-305"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle K _ { k } = [ v _ { k - 1 } , v _ { k } ] \end{document} ]]></tex-math></inline-formula> where, <inline-formula><tex-math id="math-306"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 1 , 2 , \ldots , \kappa \end{document} ]]></tex-math></inline-formula> so that <inline-formula><tex-math id="math-307"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle v _ { 0 } = a , v _ { \kappa } = b \end{document} ]]></tex-math></inline-formula>.</p><disp-formula id="equation-12"><tex-math id="math-308"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \sum_ {x _ {k} \notin \mathbb {Z}} F (v _ {k}) - F (v _ {k - 1}) - f (x _ {k}) \cdot (v _ {k} - v _ {k - 1}) = [ F (b) - F (a) ] - S (P, f). \end{document} ]]></tex-math></disp-formula><p>By Straddle lemma, <inline-formula><tex-math id="math-309"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( v _ { k } ) - F ( v _ { k - 1 } ) - f ( t ) ( v _ { k } - v _ { k - 1 } ) \to 0 \end{document} ]]></tex-math></inline-formula> , for each k adding finitely many terms. So, <inline-formula><tex-math id="math-310"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle , | S ( P , f ) - [ F ( b ) - F ( a ) ] | \to 0 \end{document} ]]></tex-math></inline-formula> adding the constant mapping <inline-formula><tex-math id="math-311"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ( b ) - F ( a ) , S ( P , f ) F ( b ) - F ( a ) \end{document} ]]></tex-math></inline-formula>. □</p><p><bold>Theorem 6.3</bold> (Mean Value theorem for Vector valued mappings). <xref ref-type="bibr" rid="BIBR-15">[15]</xref><italic>Let F be a mapping continuous on </italic><inline-formula><tex-math id="math-312"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle [ c , d ] \end{document} ]]></tex-math></inline-formula><italic> assuming values in a Hausdorf TVS X and diferentiable in </italic><inline-formula><tex-math id="math-313"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( c , d ) \end{document} ]]></tex-math></inline-formula><italic> , then </italic><inline-formula><tex-math id="math-314"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array} { r } { F ( d ) - F ( c ) = h \cdot \int _ { 0 } ^ { 1 } F ^ { \prime } ( c + \theta \cdot h ) d \theta } \end{array} \end{document} ]]></tex-math></inline-formula><italic> , where </italic><inline-formula><tex-math id="math-315"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle h = d - c \end{document} ]]></tex-math></inline-formula></p><p><italic>Proof</italic>. <inline-formula><tex-math id="math-316"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \textstyle F ( d ) - F ( c ) = \int _ { c } ^ { d } F ^ { \prime } ( t ) d t \end{document} ]]></tex-math></inline-formula> by the Fundamental Theorem of Calculus. By chain rule <inline-formula><tex-math id="math-317"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula> is a diferentiable mapping of θ and for <inline-formula><tex-math id="math-318"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t = c + \theta \cdot h . \end{document} ]]></tex-math></inline-formula> , derivative of <inline-formula><tex-math id="math-319"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula> with respect to <inline-formula><tex-math id="math-320"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t \end{document} ]]></tex-math></inline-formula> is the derivative of <inline-formula><tex-math id="math-321"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula> with respect to θ multiplied by <inline-formula><tex-math id="math-322"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle h \end{document} ]]></tex-math></inline-formula>. The proof follows from Fundamental Theorem of Calculus, noting that h is constant. □</p><p><bold>Corollary 6.4</bold>.<italic> If </italic><inline-formula><tex-math id="math-323"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic> is locally convex, that is each nbd contains a convex nbd then if </italic><inline-formula><tex-math id="math-324"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F ^ { \prime } ( x ) \end{document} ]]></tex-math></inline-formula><italic> is 0 in a path connected open set in </italic><inline-formula><tex-math id="math-325"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle X \end{document} ]]></tex-math></inline-formula><italic>, then </italic><inline-formula><tex-math id="math-326"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula><italic> is constant.</italic></p><p><italic>Proof</italic>. Since any nbd of a point <italic>a</italic> in the open set contains a convex nbd <italic>U</italic> so that any two points can be joined by a straight line segment <inline-formula><tex-math id="math-327"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle x=\{ta+(1-t)b\mid t\in[0,1]\} \end{document} ]]></tex-math></inline-formula>By Mean Value Theorem, as the derivative is 0 we have<inline-formula><tex-math id="math-328"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula> ( b ) = F ( a )$ . So F is locally constant. As the domain is path connected, <inline-formula><tex-math id="math-329"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F \end{document} ]]></tex-math></inline-formula> is constant. □</p><p>As in <xref ref-type="bibr" rid="BIBR-16">[16]</xref> and <xref ref-type="bibr" rid="BIBR-17">[17]</xref> one can deduce Mean Value theorem for a mapping <inline-formula><tex-math id="math-330"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F : X Y \end{document} ]]></tex-math></inline-formula> 7 where both are TVS and X is locally convex.</p></sec><sec id="sec-9"><title>7. CONCLUDING REMARKS</title><p>In this article a new version of Mean Value theorem is obtained and proved on TVS using gauges. The Implicit Function Theorem is generalised on TVS. The conditions for existence, continuity and diferentiability are also provided for a mapping in TVS. In this article, TVS, Hausdorf TVS and Banach Space are linked with the mapping in generalised version of Implicit Function Theorem. It’s a fundamental tool in multivariable calculus and has applications in various fields, including physics, economics, and diferential geometry. This theorem allows us to express one or more variables in a system of equations as functions of the remaining variables, under certain conditions on the partial derivatives.</p></sec></body><back><ack><title>Acknowledgement.</title><p>We extend our sincere gratitude to Dr. Mukesh D. Patil, Principal of RAIT, for his unwavering support and guidance. We also wish to thank the Head of the Department of Mathematics and the Principal of the Institute of Science, Mumbai, for their continuous encouragement throughout the course of this research. Our heartfelt thanks also go to the esteemed reviewers for their valuable suggestions, which have significantly contributed to the improvement of this article.</p></ack><ref-list><title>REFERENCES</title><ref id="BIBR-1"><element-citation publication-type="book"><article-title>Foundations of Modern Analysis</article-title><person-group person-group-type="author"><name><surname>Dieuodenne</surname><given-names>J.</given-names></name></person-group><year>1956</year><page-range>3457542----</page-range><publisher-name>Academic Press</publisher-name><ext-link xlink:href="https://www" ext-link-type="uri" xlink:title="Website link">Website link</ext-link></element-citation></ref><ref id="BIBR-2"><element-citation publication-type="book"><article-title>Functional Analysis</article-title><person-group person-group-type="author"><name><surname>Willansky</surname><given-names>A.</given-names></name></person-group><year>1964</year><publisher-name>Blaisdell Publishing Company</publisher-name></element-citation></ref><ref id="BIBR-3"><element-citation publication-type="journal"><article-title>Two topics in the diferential calculus on topological linear spaces</article-title><source>Bulletin of the Australian Mathematical Society</source><volume>9</volume><issue>2</issue><person-group person-group-type="author"><name><surname>Lloyd</surname><given-names>J.</given-names></name></person-group><year>1973</year><page-range>305-306,</page-range></element-citation></ref><ref id="BIBR-4"><element-citation publication-type="journal"><article-title>A convergence theorem for ap-henstock-kurzweil integral and its relation to topology</article-title><source>Filomat</source><volume>36</volume><issue>20</issue><person-group person-group-type="author"><name><surname>Kalita</surname><given-names>H.</given-names></name><name><surname>Hazarika</surname><given-names>B.</given-names></name></person-group><year>2022</year><page-range>6831-6839,</page-range><pub-id pub-id-type="doi">10.2298/FIL2220831K</pub-id></element-citation></ref><ref id="BIBR-5"><element-citation publication-type="book"><article-title>A modern theory of Integrations</article-title><person-group person-group-type="author"><name><surname>Bartle</surname><given-names>R.</given-names></name></person-group><year>2001</year><publisher-name>American mathematical Society</publisher-name></element-citation></ref><ref id="BIBR-6"><element-citation publication-type="journal"><article-title>On the henstock-kurzweil integral for riesz-space-valued functions defined on unbounded intervals</article-title><source>Czechoslovak Mathematical Journal</source><volume>54</volume><person-group person-group-type="author"><name><surname>Boccuto</surname><given-names>A.</given-names></name><name><surname>Riečan</surname><given-names>B.</given-names></name></person-group><year>2004</year><page-range>591-607,</page-range><pub-id pub-id-type="doi">10.1007/s10587-004-6411-y</pub-id></element-citation></ref><ref id="BIBR-7"><element-citation publication-type="journal"><article-title>Integrals of set valued functions</article-title><source>Journal Of Mathematical Analysis and Applications</source><volume>12</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Aumann</surname><given-names>R.J.</given-names></name></person-group><year>1965</year><page-range>1-12,</page-range><ext-link xlink:href="https://www.sciencedirect.com/journal/" ext-link-type="uri" xlink:title="Journal">Journal</ext-link></element-citation></ref><ref id="BIBR-8"><element-citation publication-type="journal"><article-title>Henstock - kurzweil integral for banach valued function</article-title><source>Mathematics and Statistics</source><volume>10</volume><issue>5</issue><person-group person-group-type="author"><name><surname>Thange</surname><given-names>T.G.</given-names></name><name><surname>Gangane</surname><given-names>S.S.</given-names></name></person-group><year>2022</year><page-range>1038-1049,</page-range><pub-id pub-id-type="doi">10.13189/ms.2022.100515</pub-id></element-citation></ref><ref id="BIBR-9"><element-citation publication-type="thesis"><article-title>Henstock-Kurzeweil Integration</article-title><person-group person-group-type="author"><name><surname>Pedgaonkar</surname><given-names>A.</given-names></name></person-group><year>2014</year><comment>thesis submitted to BAMU, Aurangabad,</comment></element-citation></ref><ref id="BIBR-10"><element-citation publication-type="journal"><article-title>Diferential and integral equations with henstock–kurzweil integrable functions</article-title><source>Journal of Mathematical Analysis and Applications</source><volume>379</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Heikkila</surname><given-names>S.</given-names></name></person-group><year>2011</year><page-range>171-179,</page-range><pub-id pub-id-type="doi">10.1016/j.jmaa.2010.12.050</pub-id></element-citation></ref><ref id="BIBR-11"><element-citation publication-type="journal"><article-title>Fundamental theorem of calculus for henstock-kurzeweil integral</article-title><source>Bulletin of Marathwada Mathematical Society</source><volume>14</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Pedgaonkar</surname><given-names>A.</given-names></name></person-group><year>2013</year><page-range>71-80,</page-range></element-citation></ref><ref id="BIBR-12"><element-citation publication-type="book"><article-title>Non-linear Functional Analysis:A First Course</article-title><person-group person-group-type="author"><name><surname>Kesavan</surname><given-names>S.</given-names></name></person-group><year>2004</year><publisher-name>Hindusthan Book Agency</publisher-name><ext-link xlink:href="https://www.hindbook.com/index.php/nonlinear-functional-analysis-a-first-course" ext-link-type="uri" xlink:title="Nonlinear functional analysis a first course">Nonlinear functional analysis a first course</ext-link></element-citation></ref><ref id="BIBR-13"><element-citation publication-type="journal"><article-title>Set-valued kurzweil–henstock–pettis integral</article-title><source>Set-Valued Analysis</source><volume>13</volume><person-group person-group-type="author"><name><surname>Piazza</surname><given-names>D.</given-names></name><name><surname>Musial</surname><given-names>K.</given-names></name></person-group><year>2005</year><page-range>167-179,</page-range><pub-id pub-id-type="doi">10.1007/s11228-004-0934-0</pub-id></element-citation></ref><ref id="BIBR-14"><element-citation publication-type="journal"><article-title>On the henstock-kurzweil integral for riesz-spacevalued functions on time scales</article-title><source>J. Nonlinear Sci. Appl</source><volume>10</volume><issue>5</issue><person-group person-group-type="author"><name><surname>You</surname><given-names>X.</given-names></name><name><surname>Zhao</surname><given-names>D.</given-names></name><name><surname>Torres</surname><given-names>D.F.M.</given-names></name></person-group><year>2017</year><page-range>2487-2500,</page-range><pub-id pub-id-type="doi">10.22436/jnsa.010.05.18</pub-id></element-citation></ref><ref id="BIBR-15"><element-citation publication-type="journal"><article-title>Existence results for weakly coupled systems of ψ-caputo fractional diferential equations with nonlinear boundary conditions</article-title><source>J. Math. Comput. Sci</source><volume>12</volume><person-group person-group-type="author"><name><surname>Gudade</surname><given-names>S.K.</given-names></name><name><surname>K.Panchal</surname><given-names>S.</given-names></name><name><surname>Dhaigude</surname><given-names>D.B.</given-names></name></person-group><year>2022</year><page-range>1-15,</page-range><ext-link xlink:href="https://scik.org/index.php/jmcs/article/" ext-link-type="uri" xlink:title="Article">Article</ext-link></element-citation></ref><ref id="BIBR-16"><element-citation publication-type="book"><article-title>Mathematical Analysis</article-title><person-group person-group-type="author"><name><surname>Apostol</surname><given-names>T.</given-names></name></person-group><year>2002</year><publisher-name>Narosa Publising House</publisher-name><ext-link xlink:href="https://www.narosa.com/" ext-link-type="uri" xlink:title="Website link">Website link</ext-link></element-citation></ref><ref id="BIBR-17"><element-citation publication-type="book"><article-title>Analysis I</article-title><person-group person-group-type="author"><name><surname>Lang</surname><given-names>S.</given-names></name></person-group><year>1956</year><publisher-name>Addison Wesley</publisher-name></element-citation></ref></ref-list></back></article>