﻿<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD with MathML3 v1.2 20190208//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article
    xmlns:mml="http://www.w3.org/1998/Math/MathML"
    xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">IJMEBAC</journal-id>
      <journal-title-group>
        <journal-title>International Journal of Mathematical, Engineering, Biological and Applied Computing</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2832-5273</issn>
      <issn pub-type="ppub"></issn>
      <publisher>
        <publisher-name>Science Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.31586/ijmebac.2022.468</article-id>
      <article-id pub-id-type="publisher-id">IJMEBAC-468</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>
          Asymptotic Properties of the Semigroup Generated by a Continuous Interval Map
        </article-title>
      </title-group>
      <contrib-group>
<contrib contrib-type="author">
<name>
<surname>Romanenko</surname>
<given-names>O. Yu.</given-names>
</name>
<xref rid="af1" ref-type="aff">1</xref>
<xref rid="cr1" ref-type="corresp">*</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Sharkovsky</surname>
<given-names>O. M.</given-names>
</name>
<xref rid="af1" ref-type="aff">1</xref>
</contrib>
      </contrib-group>
<aff id="af1"><label>1</label>Institute of Mathematics, National Academy of Sciences, Kyiv, Ukraine</aff>
<author-notes>
<corresp id="c1">
<label>*</label>Corresponding author at: Institute of Mathematics, National Academy of Sciences, Kyiv, Ukraine
</corresp>
</author-notes>
      <pub-date pub-type="epub">
        <day>26</day>
        <month>10</month>
        <year>2022</year>
      </pub-date>
      <volume>1</volume>
      <issue>2</issue>
      <history>
        <date date-type="received">
          <day>26</day>
          <month>10</month>
          <year>2022</year>
        </date>
        <date date-type="rev-recd">
          <day>26</day>
          <month>10</month>
          <year>2022</year>
        </date>
        <date date-type="accepted">
          <day>26</day>
          <month>10</month>
          <year>2022</year>
        </date>
        <date date-type="pub">
          <day>26</day>
          <month>10</month>
          <year>2022</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>&#xa9; Copyright 2022 by authors and Trend Research Publishing Inc. </copyright-statement>
        <copyright-year>2022</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
          <license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p>
        </license>
      </permissions>
      <abstract>
        The article's purpose is twofold. First, we wish to draw attention to the insufficiently known field of continuous-time difference equations. These equations are paradigmatic for modeling complexity and chaos. Even the simplest equation , easily leads to complex dynamics, its solutions are perfectly suited to simulate strong nonlinear phenomena such as large-to-small cascades of structures, intermixing, formation of fractals, etc. Second, in the main body of the article we present a small but very important part of the theory behind the above equation marked by . Just as the discrete-time analog of this equation induces the one-dimensional dynamical system  on some interval , so the equation  induces the infinite-dimensional dynamical system  on the space of functions . In the latter case, not only are the long-term behaviours of solutions critically dependent on the limit behaviour of the sequence  (as in the discrete case) but also on the internal structure of  as . Assuming  to be continuous, we consider the iterations of  as the semigroup  generated by  on the space of continuous maps, and introduce the notion of a limit semigroup for  in a wider map space in order to investigate asymptotic properties of . We construct a limit semigroup in the space of upper semicontinuous maps. This enables us to describe both of the aforementioned aspects of our interest around the iterations of.
      </abstract>
      <kwd-group>
        <kwd-group><kwd>One-Dimensional Map; Continuous-Time Difference Equation; Chaotic Dynamics</kwd>
</kwd-group>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
<title>Introduction</title><p>The study of continuous-time difference equations pave the way for the discovery of new kinds of complexity. These equations appear as models of systems whose future depends not only on the current state but also on part of the past history. Even the simplest nonlinear continuous-time difference equation</p>

<disp-formula id="FD1"><label>(1)</label><math> <semantics>  <mrow>   <mi>x</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mi>f</mi><mrow><mo>(</mo>    <mrow>     <mi>x</mi><mrow><mo>(</mo>      <mi>t</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;</mtext><mi>t</mi><mo>&#x2208;</mo><msup>    <mi>&#x211D;</mi>    <mo>+</mo>   </msup>   <mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mtext>&#x00A0;is&#x00A0;a&#x00A0;continuous&#x00A0;interval&#x00A0;map,</mtext></mrow>   </semantics></math></disp-formula><p>gives a wonderful example of how very complex behaviors can be described with the help of very simple models (for example, see [
<xref ref-type="bibr" rid="R13">13</xref>,<xref ref-type="bibr" rid="R14">14</xref>] and references therein). Over last decades, the focus of our research has been on this equation. As a result, the qualitative theory of equation (1) was completed and published not so long ago in [
<xref ref-type="bibr" rid="R8">8</xref>] (the key ideas were put forward in [
<xref ref-type="bibr" rid="R7">7</xref>,<xref ref-type="bibr" rid="R11">11</xref>]).</p>
<p>Each solution of (1) is determined by its values on <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo></mrow>   </semantics></math> and can be written as</p>

<inline-formula><math> <semantics>  <mrow>   <mi>x</mi><mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>=</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>&#x03C6;</mi><mo stretchy='false'>(</mo><mi>t</mi><mo>&#x2212;</mo><mi>n</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>t</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mi>n</mi><mo>,</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mrow>   <mi>&#x03C6;</mi><mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>x</mi><mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>t</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math></inline-formula><p>where <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>f</mi><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mrow>     <mi>n</mi><mo>&#x2212;</mo><mn>1</mn></mrow>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mn>0</mn>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>z</mi></mrow>   </semantics></math>. Typical solutions of (1), even solutions of any smoothness index, behave in bizarre ways, for example as inFigure <xref ref-type="fig" rid="fig1"> 1</xref>.</p>
<fig id="fig1">
<label>Figure 1</label>
<caption>
<p>Typical solution of the equation  with  for , where .</p>
</caption>
<graphic xlink:href="468.fig.001" />
</fig><p>To describe the long-term properties of the solutions and explain how and why they occur, it is necessary to examine both the asymptotic properties of the iterative sequence <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mi>n</mi>     </msup>     <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x007D;</mo></mrow>    <mi>n</mi>   </msub>   </mrow>   </semantics></math> and the internal structure of the maps <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> by themselves for large <math> <semantics>  <mi>n</mi>   </semantics></math>. As a rule, the structure of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> becomes more and more intricate with the increase of <math> <semantics>  <mi>n</mi>   </semantics></math>. The complexities in the behaviour of trajectories of the one-dimensional dynamical system <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x21A6;</mo><mi>f</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> are transformed into a very complicated (even chaotic) structure of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> as <math> <semantics>  <mrow>   <mi>n</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </semantics></math>. But, at the same time, the sequence <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mi>n</mi>     </msup>     <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x007D;</mo></mrow>    <mi>n</mi>   </msub>   </mrow>   </semantics></math> is in a certain way (explained below) asymptotically periodic for almost all <math> <semantics>  <mi>f</mi>   </semantics></math>.</p>
<p>With the aim to present in a uniform manner the findings in this direction, we considered the maps <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mn>0</mn>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>,</mo><mi>f</mi><mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>,</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>,</mo><mtext>&#x00A0;</mtext><mo>&#x2026;</mo><mtext>,&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>&#x2026;</mo></mrow>   </semantics></math> as the semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> generated by the map <math> <semantics>  <mrow>   <mi>f</mi><mo>:</mo><mi>I</mi><mo>&#x2192;</mo><mi>I</mi></mrow>   </semantics></math> in the space <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> of continuous maps of <math> <semantics>  <mi>I</mi>   </semantics></math> into itself (with <math> <semantics>  <mi>I</mi>   </semantics></math> being a closed bounded interval of the real line). If <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is finite, then the sequence <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mi>n</mi>     </msup>     <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x007D;</mo></mrow>    <mi>n</mi>   </msub>   </mrow>   </semantics></math> is periodic and hence the structure of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is simple and repetitive as <math> <semantics>  <mi>n</mi>   </semantics></math> increases. To study the general case where <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is infinite, we developed the notion of a <italic>limit </italic><italic>semigroup</italic> for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> in a wider map space. We succeeded in constructing a limit semigroup in the space of upper semicontinuous maps (naturally, this space is the first thing that comes to mind because semicontinuous maps are pointwise limits of sequences of continuous maps). All this enabled us to achieve our aim as well as to discover some new insights.</p>
<p>The results just discussed was published only in Russian and, moreover, in their entirety only in [
<xref ref-type="bibr" rid="R8">8</xref>]. Therefore, we thought it appropriate to cover them all in this article (with some unimportant simplifications and omissions for brevity).</p>
</sec><sec id="sec2">
<title>Case of Finite Semigroup</title><p>In order to indicate conditions for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> to be infinite, we introduce the set of maps</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x2111;</mi><mo>=</mo><mo>&#x007B;</mo><mi>g</mi><mo>&#x2208;</mo><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo><mo>:</mo><mtext>&#x00A0;</mtext><msup>    <mi>g</mi>    <mn>2</mn>   </msup>   <mo>=</mo><mi>g</mi><mo>&#x007D;</mo><mo>.</mo></mrow>   </semantics></math></inline-formula><p>Clearly, the set <math> <semantics>  <mi>&#x2111;</mi>   </semantics></math> consists of continuous maps <math> <semantics>  <mrow>   <mi>g</mi><mo>:</mo><mi>I</mi><mo>&#x2192;</mo><mi>I</mi></mrow>   </semantics></math> such that for each one there exists an interval <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <msub>     <mi>z</mi>     <mn>1</mn>    </msub>    <mo>,</mo><msub>     <mi>z</mi>     <mn>2</mn>    </msub>    </mrow> <mo>]</mo></mrow><mo>&#x2286;</mo><mi>I</mi><mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>&#x2264;</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo>,</mo></mrow>   </semantics></math> with the properties:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>g</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>z</mi><mtext>&#x00A0;&#x00A0;for&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>,</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo stretchy='false'>]</mo><mo>,</mo></mrow>   </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mrow>   <mi>g</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2208;</mo><mo stretchy='false'>[</mo><msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>,</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo stretchy='false'>]</mo><mtext>&#x00A0;&#x00A0;for&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>&#x003C;</mo><msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mtext>&#x00A0;and&#x00A0;</mtext><mi>z</mi><mo>&#x003E;</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo>.</mo></mrow>   </semantics></math></inline-formula><p>If <math> <semantics>  <mrow>   <mi>g</mi><mo>&#x2208;</mo><mi>&#x2111;</mi><mo>,</mo></mrow>   </semantics></math> then <math> <semantics>  <mrow>   <msup>    <mi>g</mi>    <mi>n</mi>   </msup>   <mo>&#x2208;</mo><mi>&#x2111;</mi><mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <mi>n</mi><mo>=</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math>. If in addition <math> <semantics>  <mi>g</mi>   </semantics></math> is smooth, then either <math> <semantics>  <mrow>   <mi>g</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>z</mi></mrow>   </semantics></math> or <math> <semantics>  <mrow>   <mi>g</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2261;</mo><mtext>const</mtext></mrow>   </semantics></math>.</p>
<p></p>
<p><bold>Theorem 1</bold>   <italic>The </italic><italic>semigroup</italic> <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> <italic>is finite if and only if</italic></p>

<disp-formula id="FD2"><label>(2)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>m</mi>   </msup>   <mo>&#x2208;</mo><mi>&#x2111;</mi><mo>&#x00A0;</mo><mo>&#x00A0;</mo><mo>&#x00A0;</mo><mo>&#x00A0;</mo><mtext>for&#x00A0;a&#x00A0;certain&#x00A0;&#x00A0;&#x00A0;</mtext><mi>m</mi><mo>&#x2265;</mo><mn>1.</mn></mrow>   </semantics></math></disp-formula><p><bold>Proof.</bold>   The `if' part is obvious since <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mn>2</mn><mi>m</mi></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>m</mi>   </msup>   <mo>.</mo></mrow>   </semantics></math> Consider the `only if' part. If <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is finite, then one can find <math> <semantics>  <mrow>   <mi>k</mi><mo>,</mo><mi>l</mi><mo>&#x2265;</mo><mn>1</mn></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mi>l</mi></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>k</mi>   </msup>   <mo>.</mo></mrow>   </semantics></math> This gives<math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>i</mi><mi>k</mi><mo>+</mo><mi>j</mi><mtext>&#x200A;</mtext><mi>l</mi></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mrow>     <mi>i</mi><mi>k</mi></mrow>   </msup>   </mrow>   </semantics></math> for all <math> <semantics>  <mrow>   <mi>i</mi><mo>,</mo><mi>j</mi><mo>&#x2265;</mo><mn>1.</mn></mrow>   </semantics></math> Putting <math> <semantics>  <mrow>   <mi>i</mi><mo>=</mo><mi>l</mi><mo>,</mo><mi>j</mi><mo>=</mo><mi>k</mi><mo>,</mo></mrow>   </semantics></math> we get<math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mn>2</mn><mi>k</mi><mi>l</mi></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mi>l</mi></mrow>   </msup>   <mo>,</mo></mrow>   </semantics></math> and consequently,<math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mi>l</mi></mrow>   </msup>   <mo>&#x2208;</mo><mi>&#x2111;</mi><mo>.</mo></mrow>   </semantics></math></p>
<fig id="fig2">
<label>Figure 2</label>
<caption>
<p>Maps that generate finite semigroups.</p>
</caption>
<graphic xlink:href="468.fig.002" />
</fig><p>The dynamics of maps generating finite semigroups is very simple (seeFigure <xref ref-type="fig" rid="fig2"> 2</xref>). Let <math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, and <math> <semantics>  <mrow>   <mi mathvariant='script'>D</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> be the sets of fixed, periodic, and unstable points of <math> <semantics>  <mi>f</mi>   </semantics></math>, respectively.</p>
<p></p>
<p><bold>Theorem 2  </bold> <italic>If </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math><italic> is finite, then </italic><math> <semantics>  <mrow>   <mi mathvariant='script'>D</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math><italic> is empty, </italic><math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math><italic> is connected and </italic><italic>hence </italic><math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>.</p>
<p></p>
<p><bold>Proof.</bold>   As <math> <semantics>  <mi>f</mi>   </semantics></math> bing continuous, whatever <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math>, and <math> <semantics>  <mrow>   <mi>n</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math>, there exists <math> <semantics>  <mrow>   <msub>    <mi>&#x03B4;</mi>    <mi>n</mi>   </msub>   <mo>=</mo><msub>    <mi>&#x03B4;</mi>    <mi>n</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo>,</mo><mi>&#x03B5;</mi><mo stretchy='false'>)</mo><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <mo>&#x007C;</mo><msup>    <mi>f</mi>    <mi>i</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2212;</mo><msup>    <mi>f</mi>    <mi>i</mi>   </msup>   <mo stretchy='false'>(</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo stretchy='false'>)</mo><mo>&#x007C;</mo><mo>&#x003C;</mo><mi>&#x03B5;</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo><mi>n</mi></mrow>   </semantics></math>, if <math> <semantics>  <mrow>   <mo>&#x007C;</mo><mi>z</mi><mo>&#x2212;</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>&#x007C;</mo><mo>&#x003C;</mo><msub>    <mi>&#x03B4;</mi>    <mi>n</mi>   </msub>   </mrow>   </semantics></math>. As <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is finite, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mn>2</mn><mi>m</mi></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>m</mi>   </msup>   </mrow>   </semantics></math> for a certain <math> <semantics>  <mrow>   <mi>m</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math>. Therefore <math> <semantics>  <mrow>   <mo>&#x007C;</mo><msup>    <mi>f</mi>    <mi>i</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2212;</mo><msup>    <mi>f</mi>    <mi>i</mi>   </msup>   <mo stretchy='false'>(</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo stretchy='false'>)</mo><mo>&#x007C;</mo><mo>&#x003C;</mo><mi>&#x03B5;</mi></mrow>   </semantics></math> for all <math> <semantics>  <mrow>   <mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math>, if <math> <semantics>  <mrow>   <mo>&#x007C;</mo><mi>z</mi><mo>&#x2212;</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>&#x007C;</mo><mo>&#x003C;</mo><msub>    <mi>&#x03B4;</mi>    <mrow>     <mn>2</mn><mi>m</mi></mrow>   </msub>   </mrow>   </semantics></math>, i.e., all points <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math> are stable under <math> <semantics>  <mi>f</mi>   </semantics></math> and <math> <semantics>  <mrow>   <mi mathvariant='script'>D</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math>.</p>
<p></p>
<p>If <math> <semantics>  <mrow>   <mi mathvariant='script'>D</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math>, then the set <math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is connected: otherwise one can find <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>z</mi>    <mo>&#x2033;</mo>   </msup>   <mo>&#x2208;</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>z</mi>    <mo>&#x2033;</mo>   </msup>   <mo stretchy='false'>)</mo><mo>&#x2229;</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math>; therefore the function <math> <semantics>  <mrow>   <mi>f</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2212;</mo><mi>z</mi></mrow>   </semantics></math> maintains its sign in <math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>z</mi>    <mo>&#x2033;</mo>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> and hence one of the points <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>z</mi>    <mo>&#x2033;</mo>   </msup>   </mrow>   </semantics></math> is unstable under <math> <semantics>  <mi>f</mi>   </semantics></math>, which gives a contradiction. Since <math> <semantics>  <mrow>   <mi mathvariant='script'>D</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math> implies <math> <semantics>  <mrow>   <mi mathvariant='script'>D</mi><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math>, all the sets <math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math> are connected. Hence, if <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>&#x003C;</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo>&#x003C;</mo><mo>&#x2026;</mo><mo>&#x003C;</mo><msub>    <mi>z</mi>    <mi>n</mi>   </msub>   </mrow>   </semantics></math> form a cycle of <math> <semantics>  <mi>f</mi>   </semantics></math>, then <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>,</mo><msub>    <mi>z</mi>    <mi>n</mi>   </msub>   <mo stretchy='false'>]</mo><mo>&#x2282;</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math> i.e. <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>z</mi></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>,</mo><msub>    <mi>z</mi>    <mi>n</mi>   </msub>   <mo stretchy='false'>]</mo><mo>.</mo></mrow>   </semantics></math> As is known [
<xref ref-type="bibr" rid="R1">1</xref>], this equality cannot hold for <math> <semantics>  <mrow>   <mi>n</mi><mo>&#x2265;</mo><mn>3.</mn></mrow>   </semantics></math> Consequently, <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> coincides with <math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> and is therefore connected.</p>
<p>From Theorem 2 it follows that the set of continuous maps generating finite semigroups is exhausted by the maps <math> <semantics>  <mi>f</mi>   </semantics></math> with the property: for <math> <semantics>  <mi>f</mi>   </semantics></math> there exists its own interval <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <msub>     <mi>z</mi>     <mn>1</mn>    </msub>    <mo>,</mo><msub>     <mi>z</mi>     <mn>2</mn>    </msub>    </mrow> <mo>]</mo></mrow><mo>&#x2286;</mo><mi>I</mi><mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>&#x2264;</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo>,</mo></mrow>   </semantics></math>such that</p>

<disp-formula id="FD3"><label>(3)</label><math> <semantics>  <mtable columnalign='left'>   <mtr>    <mtd>     <mo stretchy='false'>(</mo><mi>a</mi><mo stretchy='false'>)</mo><mtext>&#x00A0;&#x00A0;</mtext>    </mtd>   </mtr>   <mtr>    <mtd>     <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mo>=</mo><mi>z</mi><mo>,</mo><mtext>&#x00A0;z</mtext><mo>&#x2208;</mo><mrow><mo>[</mo> <mrow>      <msub>       <mi>z</mi>       <mn>1</mn>      </msub>      <mo>,</mo><msub>       <mi>z</mi>       <mn>2</mn>      </msub>      </mrow> <mo>]</mo></mrow><mo>,</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mtext>&#x00A0;&#x003E;&#x00A0;</mtext><msub>      <mi>z</mi>      <mn>1</mn>     </msub>     <mo>,</mo><msub>      <mtext>&#x00A0;z&#x00A0;&#x003C;&#x00A0;z</mtext>      <mn>1</mn>     </msub>     <mtext>&#x00A0;&#x00A0;&#x00A0;and&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mtext>&#x00A0;&#x003C;&#x00A0;</mtext><msub>      <mi>z</mi>      <mn>2</mn>     </msub>     <mo>,</mo><msub>      <mtext>&#x00A0;z&#x00A0;&#x003C;&#x00A0;z</mtext>      <mn>2</mn>     </msub>     <mo>,</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><msup>      <mi>f</mi>      <mn>2</mn>     </msup>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mo>&#x2260;</mo><mi>z</mi><mo>,</mo><mtext>&#x00A0;z</mtext><mo>&#x2209;</mo><mrow><mo>[</mo> <mrow>      <msub>       <mi>z</mi>       <mn>1</mn>      </msub>      <mo>,</mo><msub>       <mi>z</mi>       <mn>2</mn>      </msub>      </mrow> <mo>]</mo></mrow><mo>,</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mi>o</mi><mi>r</mi><mtext>&#x00A0;&#x00A0;&#x00A0;(b)&#x00A0;&#x00A0;&#x00A0;item&#x00A0;&#x00A0;&#x00A0;(a)&#x00A0;&#x00A0;&#x00A0;is&#x00A0;met&#x00A0;for&#x00A0;&#x00A0;&#x00A0;</mtext><mi>h</mi><mo>=</mo><msup>      <mi>f</mi>      <mn>2</mn>     </msup>         </mtd>   </mtr>  </mtable>     </semantics></math></disp-formula><p>Two simplest maps that satisfy (3) are shown inFigure <xref ref-type="fig" rid="fig2"> 2</xref>. In the case where the semigroup<math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is finite, its structure is easily derived from (3) by elementary calculations.</p>
<p></p>
<p><bold>Theorem 3  </bold> <italic>Let </italic><math> <semantics>  <mrow>   <mi>k</mi><mo>=</mo><mi>min</mi><mrow><mo>{</mo> <mrow>    <mi>m</mi><mo>&#x003E;</mo><mn>0</mn><mo>:</mo><msup>     <mi>f</mi>     <mi>m</mi>    </msup>    <mo>&#x2208;</mo><mi>&#x2111;</mi></mrow> <mo>}</mo></mrow><mo>.</mo></mrow>   </semantics></math><italic> </italic><italic>Then</italic><italic> </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math><italic> is finite </italic><italic>semigroup</italic><italic> that has:</italic></p>
<p><italic>type</italic><italic> </italic><math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math><italic> </italic><italic>if </italic><math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo><mo>=</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math></p>
<p><italic>type</italic><italic> </italic><math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><mi>k</mi><mo>,</mo><mn>2</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math><italic> </italic><italic>if </italic><math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo><menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math><italic> </italic><italic>and</italic><italic> </italic><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>&#x2212;</mo><mn>1</mn></mrow>   </msup>   <mo stretchy='false'>(</mo><mi>I</mi><mo stretchy='false'>)</mo><menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math></p>
<p><italic>type</italic><italic> </italic><math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><mi>k</mi><mo>&#x2212;</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math><italic> </italic><italic>if </italic><math> <semantics>  <mrow>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo><menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math><italic> </italic><italic>and</italic><italic> </italic><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>&#x2212;</mo><mn>1</mn></mrow>   </msup>   <mo stretchy='false'>(</mo><mi>I</mi><mo stretchy='false'>)</mo><mo>=</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math></p>
<p><italic>and</italic><italic> </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math><italic> is a group if and only if </italic><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mn>2</mn>   </msup>   </mrow>   </semantics></math><italic> is the identity map</italic><italic>.</italic></p>
<p></p>
<p>The map ofFigure <xref ref-type="fig" rid="fig2"> 2</xref>(a) generates a semigroup of type (1,1), and the map ofFigure <xref ref-type="fig" rid="fig2"> 2</xref>(b) generates a semigroup of type (1,2). Theorem 3 defines completely the finite semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>. For example, if <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> has type <math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><mi>k</mi><mo>,</mo><mn>2</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math> then <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> consists of the maps<math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mn>0</mn>   </msup>   <mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <mi>f</mi><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mn>1</mn></mrow>   </msup>   <mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mn>2</mn></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>k</mi>   </msup>   <mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mn>3</mn></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mn>1</mn></mrow>   </msup>   <mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mn>4</mn></mrow>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>k</mi>   </msup>   <mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mo>&#x2026;</mo>   </semantics></math></p>
</sec><sec id="sec3">
<title>Limit Semigroup Concept</title><p>The above section shows that the semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is typically infinite. In this case, we will try to describe its asymptotic properties using another, simpler semigroup.</p>
<p></p>
<p><bold>Definition 1</bold>   Let the space <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> be embedded in a wider space <math> <semantics>  <mrow>   <msub>    <mi>H</mi>    <mi>&#x03BD;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> of maps <math> <semantics>  <mrow>   <mi>h</mi><mo>:</mo><mi>I</mi><mo>&#x2192;</mo><mi>I</mi></mrow>   </semantics></math>, endowed with the metric <math> <semantics>  <mrow>   <mi>&#x03BD;</mi><mo>.</mo></mrow>   </semantics></math> If there exists a periodic or almost periodic semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>h</mi><mo>&#x232A;</mo></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>h</mi><mo>&#x2208;</mo><msub>    <mi>H</mi>    <mi>&#x03BD;</mi>   </msub>   </mrow>   </semantics></math>, such that</p>

<disp-formula id="FD4"><label>(4)</label><math> <semantics>  <mrow>   <mi>v</mi><mrow><mo>(</mo>    <mrow>     <msup>      <mi>f</mi>      <mi>n</mi>     </msup>     <mo>,</mo><msup>      <mi>h</mi>      <mi>n</mi>     </msup>     </mrow>   <mo>)</mo></mrow><mo>&#x2192;</mo><mn>0</mn><mtext>&#x00A0;&#x00A0;&#x00A0;as&#x00A0;&#x00A0;&#x00A0;</mtext><mi>n</mi><mo>&#x2192;</mo><mi>&#x221E;</mi><mo>,</mo></mrow>   </semantics></math></disp-formula><p>then we say that <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>h</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is the <italic>limit </italic><italic>semigroup</italic> for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> in <math> <semantics>  <mrow>   <msub>    <mi>H</mi>    <mi>&#x03BD;</mi>   </msub>   <mo>.</mo></mrow>   </semantics></math></p>
<p></p>
<p><bold>Definition 2</bold>   The semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>h</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is called <italic>periodic</italic> if there exists a positive integer <math> <semantics>  <mi>N</mi>   </semantics></math> such that <math> <semantics>  <mrow>   <msup>    <mi>h</mi>    <mrow>     <mi>n</mi><mo>+</mo><mi>N</mi></mrow>   </msup>   <mo>=</mo><msup>    <mi>h</mi>    <mi>n</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math> with <math> <semantics>  <mi>N</mi>   </semantics></math> referring to as the period of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>h</mi><mo>&#x232A;</mo></mrow>   </semantics></math>;</p>
<p>The semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>h</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is called <italic>almost periodic</italic> if there are positive integers <math> <semantics>  <mrow>   <msub>    <mi>N</mi>    <mn>1</mn>   </msub>   <mo>,</mo><mtext>&#x00A0;</mtext><msub>    <mi>N</mi>    <mn>2</mn>   </msub>   <mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> such that for any <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> one can find <math> <semantics>  <mrow>   <msub>    <mi>N</mi>    <mi>k</mi>   </msub>   </mrow>   </semantics></math> satisfying <math> <semantics>  <mrow>   <mi>v</mi><mrow><mo>(</mo>    <mrow>     <msup>      <mi>h</mi>      <mrow>       <mi>n</mi><mo>+</mo><mi>j</mi><msub>        <mi>N</mi>        <mi>k</mi>       </msub>       </mrow>     </msup>     <mo>,</mo><msup>      <mi>h</mi>      <mi>n</mi>     </msup>     </mrow>   <mo>)</mo></mrow><mo>&#x003C;</mo><mi>&#x03B5;</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>,</mo><mi>j</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math> with <math> <semantics>  <mrow>   <msub>    <mi>N</mi>    <mn>1</mn>   </msub>   <mo>,</mo><msub>    <mi>N</mi>    <mn>2</mn>   </msub>   <mo>,</mo><msub>    <mi>N</mi>    <mn>3</mn>   </msub>   <mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> referring to as the almost-periods of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>h</mi><mo>&#x232A;</mo></mrow>   </semantics></math>.</p>
<p>Given <math> <semantics>  <mrow>   <msub>    <mi>H</mi>    <mi>&#x03BD;</mi>   </msub>   </mrow>   </semantics></math>, the semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> have just one limit semigroup or none at all. Taking for <math> <semantics>  <mrow>   <msub>    <mi>H</mi>    <mi>&#x03BD;</mi>   </msub>   </mrow>   </semantics></math> this or that map space and using the corresponding limit semigroup (if exists), one can describe the asymptotic properties of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> in less or more detail.</p>
<p>In this connection, the question arises whether <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> can have a limit semigroup in ``its own'' space <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. From the above section it follows that every finite <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> has a limit semigroup in <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and this is its largest subgroup. Indeed, let <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> be finite. Then the map</p>

<disp-formula id="FD5"><label>(5)</label><math> <semantics>  <mrow>   <msub>    <mi>h</mi>    <mo>&#x22C6;</mo>   </msub>   <mo>=</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;where&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>k</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><mi>k</mi><mo>=</mo><mi>min</mi><mrow><mo>{</mo> <mrow>    <mi>m</mi><mo>&#x003E;</mo><mn>0</mn><mo>:</mo><msup>     <mi>f</mi>     <mi>m</mi>    </msup>    <mo>&#x2208;</mo><mi>&#x2111;</mi></mrow> <mo>}</mo></mrow><mo>,</mo></mrow>   </semantics></math></disp-formula><p>generates the semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><msub>    <mi>h</mi>    <mo>&#x22C6;</mo>   </msub>   <mo>&#x232A;</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>h</mi><mo>&#x2208;</mo><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, which consists of the one element <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> if <math> <semantics>  <mrow>   <mtext>Per</mtext><mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow><mo>=</mo><mtext>Fix</mtext><mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow><mo>,</mo></mrow>   </semantics></math> and of the two elements <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>+</mo><mn>1</mn></mrow>   </msup>   </mrow>   </semantics></math> otherwise. Hence <math> <semantics>  <mrow>   <mo>&#x2329;</mo><msub>    <mi>h</mi>    <mo>&#x22C6;</mo>   </msub>   <mo>&#x232A;</mo></mrow>   </semantics></math> is a periodic group with period 1 or 2; moreover, <math> <semantics>  <mrow>   <mo>&#x2329;</mo><msub>    <mi>h</mi>    <mo>&#x22C6;</mo>   </msub>   <mo>&#x232A;</mo></mrow>   </semantics></math> is the largest subgroup of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>. By virtue of Theorem 3, <math> <semantics>  <mrow>   <mo>&#x2016;</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2212;</mo><msubsup>    <mi>h</mi>    <mo>&#x22C6;</mo>    <mi>n</mi>   </msubsup>   <mo>&#x2016;</mo><mo>&#x2192;</mo><mn>0</mn></mrow>   </semantics></math> as <math> <semantics>  <mrow>   <mi>n</mi><mo>&#x2192;</mo><mi>&#x221E;</mi><mo>.</mo></mrow>   </semantics></math> Consequently: <italic>If </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math><italic> is finite, then its largest subgroup </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math><italic> is the limit </italic><italic>semigroup</italic><italic> for </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math><italic> in</italic> <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math></p>
<p>There is a representation for <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math>, in which <math> <semantics>  <mi>k</mi>   </semantics></math> does not appear explicitly. Let <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> be for the <math> <semantics>  <mi>&#x03C9;</mi>   </semantics></math>-limit set of the trajectory of the point <math> <semantics>  <mi>z</mi>   </semantics></math> under <math> <semantics>  <mi>f</mi>   </semantics></math>. The map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> can be written as</p>

<disp-formula id="FD6"><label>(6)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <msub>       <mi>&#x03C9;</mi>       <mi>f</mi>      </msub>      <mrow><mo>(</mo>       <mi>z</mi>      <mo>)</mo></mrow><mo>=</mo><munder>       <mrow>        <mi>lim</mi></mrow>       <mrow>        <mtext>&#x200A;</mtext><mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>      </munder>      <msup>       <mi>f</mi>       <mi>i</mi>      </msup>      <mrow><mo>(</mo>       <mi>z</mi>      <mo>)</mo></mrow><mo>,</mo><mtext>&#x00A0;&#x00A0;if&#x00A0;&#x00A0;Per</mtext><mrow><mo>(</mo>       <mi>f</mi>      <mo>)</mo></mrow><mo>=</mo><mtext>Fix</mtext><mrow><mo>(</mo>       <mi>f</mi>      <mo>)</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <msub>       <mi>&#x03C9;</mi>       <mrow>        <msup>         <mi>f</mi>         <mn>2</mn>        </msup>        </mrow>      </msub>      <mrow><mo>(</mo>       <mi>z</mi>      <mo>)</mo></mrow><mo>=</mo><munder>       <mrow>        <mi>lim</mi></mrow>       <mrow>        <mtext>&#x200A;</mtext><mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>      </munder>      <msup>       <mi>f</mi>       <mrow>        <mn>2</mn><mi>i</mi></mrow>      </msup>      <mrow><mo>(</mo>       <mi>z</mi>      <mo>)</mo></mrow><mo>,</mo><mtext>&#x00A0;&#x00A0;if&#x00A0;&#x00A0;Per</mtext><mrow><mo>(</mo>       <mi>f</mi>      <mo>)</mo></mrow><mo>&#x2260;</mo><mtext>Fix</mtext><mrow><mo>(</mo>       <mi>f</mi>      <mo>)</mo></mrow>     </mtd>    </mtr>   </mtable>    </mrow></mrow>   </semantics></math></disp-formula>
<disp-formula id="FD7"><label>(7)</label><math> <semantics>  <mrow>   <mtext>furthermore&#x00A0;&#x00A0;&#x00A0;</mtext><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mtext>&#x00A0;&#x00A0;&#x00A0;and&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo>&#x2218;</mo><mi>f</mi><mo>.</mo></mrow>   </semantics></math></disp-formula><p>The map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> in the form (6) can also exist for certain continuous maps that generate infinite semigroup. These are maps <math> <semantics>  <mi>f</mi>   </semantics></math> with the property: for <math> <semantics>  <mi>f</mi>   </semantics></math> there is its own interval <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <msub>     <mi>z</mi>     <mn>1</mn>    </msub>    <mo>,</mo><msub>     <mi>z</mi>     <mn>2</mn>    </msub>    </mrow> <mo>]</mo></mrow><mo>&#x2286;</mo><mi>I</mi><mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mn>1</mn>   </msub>   <mo>&#x2264;</mo><msub>    <mi>z</mi>    <mn>2</mn>   </msub>   <mo>,</mo></mrow>   </semantics></math> such that</p>

<disp-formula id="FD8"><label>(8)</label><math> <semantics>  <mtable columnalign='left'>   <mtr>    <mtd>     <mo stretchy='false'>(</mo><msup>      <mi>a</mi>      <mo>&#x2032;</mo>     </msup>     <mo stretchy='false'>)</mo><mtext>&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mo>=</mo><mi>z</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mrow><mo>[</mo> <mrow>      <msub>       <mi>z</mi>       <mn>1</mn>      </msub>      <mo>,</mo><msub>       <mi>z</mi>       <mn>2</mn>      </msub>      </mrow> <mo>]</mo></mrow><mo>,</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>f</mi><mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mo>&#x003E;</mo><mi>z</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><mo>&#x003C;</mo><msub>      <mi>z</mi>      <mn>1</mn>     </msub>     <mo>,</mo><mtext>&#x00A0;and&#x00A0;</mtext><mi>f</mi><mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><mo>&#x003C;</mo><mi>z</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><mo>&#x003E;</mo><msub>      <mi>z</mi>      <mn>2</mn>     </msub>     <mo>,</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><msup>      <mi>f</mi>      <mn>2</mn>     </msup>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow><menclose notation='updiagonalstrike'>      <mo>=</mo>     </menclose>     <mi>z</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><menclose notation='updiagonalstrike'>      <mo>&#x2208;</mo>     </menclose>     <mrow><mo>[</mo> <mrow>      <msub>       <mi>z</mi>       <mn>1</mn>      </msub>      <mo>,</mo><msub>       <mi>z</mi>       <mn>2</mn>      </msub>      </mrow> <mo>]</mo></mrow><mo>,</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mtext>or&#x00A0;&#x00A0;</mtext><mo stretchy='false'>(</mo><mi>b</mi><mo stretchy='false'>)</mo><mtext>&#x00A0;</mtext><mi>i</mi><mi>t</mi><mi>e</mi><mi>m</mi><mtext>&#x00A0;</mtext><mo stretchy='false'>(</mo><mi>a</mi><mo stretchy='false'>)</mo><mtext>&#x00A0;is&#x00A0;met&#x00A0;for&#x00A0;</mtext><mi>h</mi><mo>=</mo><msup>      <mi>f</mi>      <mn>2</mn>     </msup>     <mo>;</mo>    </mtd>   </mtr>  </mtable>     </semantics></math></disp-formula><p>An illustration is inFigure <xref ref-type="fig" rid="fig3"> 3</xref>: although <math> <semantics>  <mrow>   <mo>&#x2329;</mo><msub>    <mi>f</mi>    <mn>1</mn>   </msub>   <mo>&#x232A;</mo></mrow>   </semantics></math> is finite and <math> <semantics>  <mrow>   <mo>&#x2329;</mo><msub>    <mi>f</mi>    <mn>2</mn>   </msub>   <mo>&#x232A;</mo></mrow>   </semantics></math> is infinite, (6) yields <math> <semantics>  <mrow>   <msubsup>    <mi>f</mi>    <mn>1</mn>    <mo>&#x22C6;</mo>   </msubsup>   <mo>=</mo><msubsup>    <mi>f</mi>    <mn>2</mn>    <mo>&#x22C6;</mo>   </msubsup>   </mrow>   </semantics></math>.</p>
<p>If (8) is not met, then <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> no longer has a limit semigroup in <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and we need a wider map space. We choose the space <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> of upper semicontinuous maps <math> <semantics>  <mrow>   <mi>h</mi><mo>:</mo><mi>I</mi><mo>&#x2192;</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo>,</mo></mrow>   </semantics></math> endowed with the metric</p>

<inline-formula><math> <semantics>  <mrow>   <msub>    <mi>&#x03C1;</mi>    <mi>H</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>h</mi>      <mn>1</mn>     </msub>     <mo>,</mo><msub>      <mi>h</mi>      <mn>2</mn>     </msub>     </mrow>   <mo>)</mo></mrow><mo>=</mo><msub>    <mrow>     <mtext>dist</mtext></mrow>    <mi>H</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <mtext>gr</mtext><msub>      <mi>h</mi>      <mn>1</mn>     </msub>     <mo>,</mo><mtext>gr</mtext><msub>      <mi>h</mi>      <mn>2</mn>     </msub>     </mrow>   <mo>)</mo></mrow><mo>,</mo></mrow>   </semantics></math></inline-formula><fig id="fig3">
<label>Figure 3</label>
<caption>
<p>Maps that generate limit semigroups in the continuous map space.</p>
</caption>
<graphic xlink:href="468.fig.003" />
</fig><p>where <math> <semantics>  <mrow>   <mtext>gr</mtext><mi>h</mi></mrow>   </semantics></math> is for the graph of <math> <semantics>  <mi>h</mi>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>dist</mtext></mrow>    <mi>H</mi>   </msub>   <mo stretchy='false'>(</mo><mo>&#x22C5;</mo><mo>,</mo><mo>&#x22C5;</mo><mo stretchy='false'>)</mo></mrow>   </semantics></math> is for the Hausdorff distance between two sets. The space <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> is compact in the topology induced by <math> <semantics>  <mrow>   <msub>    <mi>&#x03C1;</mi>    <mrow>     <msub>      <mtext>&#x200B;</mtext>      <mrow>       <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mi>H</mi></mrow>     </msub>     </mrow>   </msub>   </mrow>   </semantics></math>, and <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is embedded in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>.</p>
<p>Let <math> <semantics>  <mrow>   <mtext>Lim</mtext></mrow>   </semantics></math> denote the operation of passing to the limit in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>. The meaning of the convergence in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> becomes clear from the equivalence of the relations</p>

<disp-formula id="FD9"><label>(9)</label><math> <semantics>  <mrow>   <mi>L</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>=</mo><msub>    <mi>h</mi>    <mo>&#x2217;</mo>   </msub>   <msub>    <mrow>     <mtext>&#x00A0;&#x00A0;&#x00A0;and&#x00A0;&#x00A0;&#x00A0;Lt</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>=</mo><mtext>gr</mtext><msub>    <mi>h</mi>    <mo>&#x2217;</mo>   </msub>   <mo>,</mo></mrow>   </semantics></math></disp-formula><p>where <math> <semantics>  <mrow>   <mtext>Lt</mtext></mrow>   </semantics></math> is for the operation of passing to the topological limit. Thus, the convergence of maps in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> reduced to the existence of the topological limit of their graphs, which are treated as sets in the plane. It is therefore important to understand how the convergence of map graphs is related to the local behaviour of these maps. The answer is given by the following lemma.</p>
<p></p>
<p><bold>Lemma 1</bold>   Let <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msub>      <mi>g</mi>      <mi>i</mi>     </msub>     <mo stretchy='false'>(</mo><mi>w</mi><mo stretchy='false'>)</mo><mo>&#x007D;</mo></mrow>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> be a sequence of maps from <math> <semantics>  <mrow>   <mi>C</mi><mrow><mo>(</mo>    <mrow>     <msup>      <mi>J</mi>      <mo>&#x2032;</mo>     </msup>     <mo>,</mo><msup>      <mi>J</mi>      <mo>&#x2033;</mo>     </msup>     </mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> with <math> <semantics>  <mrow>   <msup>    <mi>J</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>J</mi>    <mo>&#x2033;</mo>   </msup>   </mrow>   </semantics></math> being closed bounded intervals, and let <math> <semantics>  <mrow>   <msub>    <mi>V</mi>    <mi>&#x03B5;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>w</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> stand for the <math> <semantics>  <mi>&#x03B5;</mi>   </semantics></math>-neighborhood of <math> <semantics>  <mrow>   <mi>w</mi><mo>&#x2208;</mo><msup>    <mi>J</mi>    <mo>&#x2032;</mo>   </msup>   <mo>.</mo></mrow>   </semantics></math> The limit <math> <semantics>  <mrow>   <mo>&#x00A0;</mo><msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> exists if and only if the limit <math> <semantics>  <mrow>   <mo>&#x00A0;</mo><mi>L</mi><msub>    <mi>t</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>w</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> exists for any <math> <semantics>  <mrow>   <mi>w</mi><mo>&#x2208;</mo><msup>    <mi>J</mi>    <mo>&#x2032;</mo>   </msup>   </mrow>   </semantics></math> and any <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> less than a certain <math> <semantics>  <mrow>   <msub>    <mi>&#x03B5;</mi>    <mi>w</mi>   </msub>   <mo>&#x003E;</mo><mn>0.</mn></mrow>   </semantics></math> Moreover, if so, then</p>

<disp-formula id="FD10"><label>(10)</label><math> <semantics>  <mrow>   <mi>L</mi><msub>    <mi>t</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mo>=</mo><mi>G</mi><mo>:</mo><mo>=</mo><mrow><mo>{</mo> <mrow>    <mrow><mo>(</mo>     <mrow>      <mi>w</mi><mo>,</mo><mi>z</mi></mrow>    <mo>)</mo></mrow><mo>:</mo><mi>w</mi><mo>&#x2208;</mo><msup>     <mi>J</mi>     <mo>&#x2032;</mo>    </msup>    <mo>,</mo><mi>z</mi><mo>&#x2208;</mo><msub>     <mi>G</mi>     <mi>w</mi>    </msub>    </mrow> <mo>}</mo></mrow><mo>,</mo><msub>    <mi>G</mi>    <mi>w</mi>   </msub>   <mo>=</mo><mstyle displaystyle='true'>    <munder>     <mo>&#x2229;</mo>     <mrow>      <mn>0</mn><mo>&#x003C;</mo><mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>       <mi>&#x03B5;</mi>       <mi>w</mi>      </msub>      </mrow>    </munder>    <mrow>     <msub>      <mrow>       <mtext>Lt</mtext></mrow>      <mrow>       <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>     </msub>     </mrow>   </mstyle><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>w</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>.</mo></mrow>   </semantics></math></disp-formula><p><bold>Proof.</bold>   The 'if' part is proved by verifying that <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Ls</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mo>&#x2286;</mo><mi>G</mi><mo>&#x2286;</mo><msub>    <mrow>     <mtext>Li</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> with <math> <semantics>  <mrow>   <mtext>Ls</mtext></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mtext>Li</mtext></mrow>   </semantics></math> being for the upper and lower topological limits, respectively. Take, say, the latter inclusion. If <math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><mi>w</mi><mo>,</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2208;</mo><mi>G</mi><mo>,</mo></mrow>   </semantics></math> then <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>L</mi><msub>    <mi>t</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>w</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>    <mi>&#x03B5;</mi>    <mi>w</mi>   </msub>   </mrow>   </semantics></math>, i.e., for any <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>    <mi>&#x03B5;</mi>    <mi>w</mi>   </msub>   </mrow>   </semantics></math> there is a sequence of points <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mrow>     <mi>i</mi><mo>,</mo><mi>&#x03B5;</mi></mrow>   </msub>   <mo>&#x2208;</mo><msup>    <mi>J</mi>    <mo>&#x2033;</mo>   </msup>   </mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mrow>     <mi>i</mi><mo>,</mo><mi>&#x03B5;</mi></mrow>   </msub>   <mo>&#x2208;</mo><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>V</mi>    <mi>&#x03B5;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>w</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mrow>     <mi>i</mi><mo>,</mo><mi>&#x03B5;</mi></mrow>   </msub>   <mo>&#x2192;</mo><mi>z</mi></mrow>   </semantics></math> as <math> <semantics>  <mrow>   <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </semantics></math>. Let us consider the sequence <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msub>      <mi>z</mi>      <mrow>       <mi>i</mi><mo>,</mo><mtext>&#x200A;</mtext><mn>1</mn><mo>/</mo><mi>i</mi></mrow>     </msub>     <mo>&#x007D;</mo></mrow>    <mi>i</mi>   </msub>   <mo>,</mo><mtext>&#x00A0;</mtext><mi>i</mi><mo>&#x003E;</mo><mn>1</mn><mo>/</mo><msub>    <mi>&#x03B5;</mi>    <mi>w</mi>   </msub>   <mo>.</mo></mrow>   </semantics></math> Since <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mrow>     <mi>i</mi><mo>,</mo><mtext>&#x200A;</mtext><mn>1</mn><mo>/</mo><mi>i</mi></mrow>   </msub>   <mo>&#x2208;</mo><msub>    <mi>&#x03C6;</mi>    <mi>i</mi>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>V</mi>    <mrow>     <mn>1</mn><mo>/</mo><mi>i</mi></mrow>   </msub>   <mo stretchy='false'>(</mo><mi>w</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo></mrow>   </semantics></math>, one can find <math> <semantics>  <mrow>   <msub>    <mi>w</mi>    <mi>i</mi>   </msub>   <mo>&#x2208;</mo><msub>    <mi>V</mi>    <mrow>     <mn>1</mn><mo>/</mo><mi>i</mi></mrow>   </msub>   <mo stretchy='false'>(</mo><mi>w</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <mi>g</mi><mo stretchy='false'>(</mo><msub>    <mi>w</mi>    <mi>i</mi>   </msub>   <mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>z</mi>    <mrow>     <mi>i</mi><mo>,</mo><mn>1</mn><mo>/</mo><mi>i</mi></mrow>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>w</mi>    <mi>i</mi>   </msub>   <mo>&#x2192;</mo><mi>w</mi></mrow>   </semantics></math> as <math> <semantics>  <mrow>   <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi><mo>.</mo></mrow>   </semantics></math> Therefore <math> <semantics>  <mrow>   <mo stretchy='false'>(</mo><msub>    <mi>w</mi>    <mi>i</mi>   </msub>   <mo>,</mo><mi>g</mi><mo stretchy='false'>(</mo><msub>    <mi>w</mi>    <mi>i</mi>   </msub>   <mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>&#x2192;</mo><mo stretchy='false'>(</mo><mi>w</mi><mo>,</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> as <math> <semantics>  <mrow>   <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </semantics></math>, and hence <math> <semantics>  <mrow>   <mrow><mo>(</mo>    <mrow>     <mi>w</mi><mo>,</mo><mi>z</mi></mrow>   <mo>)</mo></mrow><mo>&#x2208;</mo><msub>    <mrow>     <mtext>Li</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> as claimed.</p>
<p>The 'only if' part follows from the definition of topological limit. If <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msub>    <mi>g</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> exists, then <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>g</mi>    <mi>i</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>w</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> also exists for every given <math> <semantics>  <mrow>   <mi>w</mi><mo>&#x2208;</mo><msup>    <mi>J</mi>    <mo>&#x2032;</mo>   </msup>   </mrow>   </semantics></math> and sufficiently small <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math>. Hence, the set <math> <semantics>  <mrow>   <msub>    <mi>G</mi>    <mi>w</mi>   </msub>   </mrow>   </semantics></math> is well defined and, by what was just shown, (10) holds.</p>
<p>The composition <math> <semantics>  <mrow>   <msup>    <mi>h</mi>    <mo>&#x2032;</mo>   </msup>   <mo>&#x2218;</mo><msup>    <mi>h</mi>    <mo>&#x2033;</mo>   </msup>   </mrow>   </semantics></math> of <math> <semantics>  <mrow>   <msup>    <mi>h</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>h</mi>    <mo>&#x2033;</mo>   </msup>   <mo>&#x2208;</mo><mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> is understood as the map <math> <semantics>  <mrow>   <msup>    <mi>h</mi>    <mo>&#x2032;</mo>   </msup>   <mo>&#x2218;</mo><msup>    <mi>h</mi>    <mo>&#x2033;</mo>   </msup>   <mo>=</mo><mstyle displaystyle='true'>    <munder>     <mo>&#x222A;</mo>     <mrow>      <mi>u</mi><mo>&#x2208;</mo><mtext>&#x200A;</mtext><msup>       <mi>h</mi>       <mo>&#x2033;</mo>      </msup>      <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>    </munder>    <msup>     <mi>h</mi>     <mo>&#x2032;</mo>    </msup>       </mstyle><mo stretchy='false'>(</mo><mi>u</mi><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math> which obviously belongs to <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math> Let <math> <semantics>  <mrow>   <mi>h</mi><mo>&#x2208;</mo><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>&#x2208;</mo><mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> From the topological sense of the convergence in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>, it follows that, if <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>h</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> exists, then <math> <semantics>  <mrow>   <mi>L</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mi>h</mi><mo>&#x2218;</mo><msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>,</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mi>L</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mi>h</mi><mo>&#x2218;</mo><mi>h</mi></mrow>   </semantics></math> also exist, moreover,</p>

<disp-formula id="FD11"><label>(11)</label><math> <semantics>  <mrow>   <mi>L</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mi>h</mi><mo>&#x2218;</mo><msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>=</mo><mi>h</mi><mo>&#x2218;</mo><msub>    <mi>h</mi>    <mo>&#x2217;</mo>   </msub>   <mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;where&#x00A0;&#x00A0;&#x00A0;</mtext><msub>    <mi>h</mi>    <mo>&#x2217;</mo>   </msub>   <mo>=</mo><mi>L</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>.</mo></mrow>   </semantics></math></disp-formula><p>The equality <math> <semantics>  <mrow>   <mi>L</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msub>    <mi>h</mi>    <mi>i</mi>   </msub>   <mo>&#x2218;</mo><mi>h</mi><mo>=</mo><msub>    <mi>h</mi>    <mo>&#x2217;</mo>   </msub>   <mo>&#x2218;</mo><mi>h</mi></mrow>   </semantics></math> is usually not satisfied.</p>
</sec><sec id="sec4">
<title>Resolvent Map</title><p>Now the goal is to construct a special map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2208;</mo><mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> so as <math> <semantics>  <mrow>   <mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> to generates a limit semigroup for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> (of course, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> must be identical to <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math>, if <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is finite). We call <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> the <italic>resolvent</italic><italic> map</italic> for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> and accept that</p>

<disp-formula id="FD12"><label>(12)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>!</mo></mrow>   </msup>   <mo>.</mo></mrow>   </semantics></math></disp-formula><p>So far, this is only a formal notation for <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math>, since the existence of the limit in (12) is not obvious. If <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> exists, then it belongs to the space <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mover accent='true'>    <mrow>     <msup>      <mn>2</mn>      <mi>I</mi>     </msup>     </mrow>    <mo stretchy='true'>&#x005E;</mo>   </mover>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>, where <math> <semantics>  <mrow>   <mover accent='true'>    <mrow>     <msup>      <mn>2</mn>      <mi>I</mi>     </msup>     </mrow>    <mo stretchy='true'>&#x005E;</mo>   </mover>   </mrow>   </semantics></math> is the subset of <math> <semantics>  <mrow>   <msup>    <mn>2</mn>    <mi>I</mi>   </msup>   </mrow>   </semantics></math>, consisting of closed intervals (including degenerated ones).<math> <semantics>  <mrow></mrow>   </semantics></math> </p>
<p></p>
<p>Let <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. Then <math> <semantics>  <mrow>   <mi>L</mi><msub>    <mi>t</mi>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mi>i</mi>   </msup>   <mrow><mo>(</mo>    <mi>V</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> exists for any connected <math> <semantics>  <mrow>   <mi>V</mi><mo>&#x2282;</mo><mover accent='true'>    <mi>I</mi>    <mo>&#x005E;</mo>   </mover>   </mrow>   </semantics></math> (see [
<xref ref-type="bibr" rid="R6">6</xref>]) and, by Lemma 1, the sequences <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mi>i</mi>     </msup>     <mo>&#x007D;</mo></mrow>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mrow>       <mi>k</mi><mo>!</mo></mrow>     </msup>     <mo>&#x007D;</mo></mrow>    <mi>k</mi>   </msub>   </mrow>   </semantics></math> converge in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mover accent='true'>    <mi>I</mi>    <mo>&#x005E;</mo>   </mover>   <mo>,</mo><mover accent='true'>    <mi>I</mi>    <mo>&#x005E;</mo>   </mover>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> to the same limit. Therefore <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mi>i</mi>   </msup>   </mrow>   </semantics></math>; an example is inFigure <xref ref-type="fig" rid="fig4"> 4</xref>. If <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>s</mi>   </msup>   <mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>s</mi><mo>&#x003E;</mo><mn>0</mn><mo>,</mo></mrow>   </semantics></math> similar arguments lead to the formula <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>i</mi><mi>s</mi></mrow>   </msup>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> for finite <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>.</p>
<fig id="fig4">
<label>Figure 4</label>
<caption>
<p>Resolvent map  in the case where .</p>
</caption>
<graphic xlink:href="468.fig.004" />
</fig><p>Where <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>s</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> for any <math> <semantics>  <mrow>   <mi>s</mi><mo>&#x003E;</mo><mn>0</mn><mo>,</mo></mrow>   </semantics></math> the resolvent map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> may not exist. The simplest example occurs when some interval <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>,</mo><msup>    <mi>z</mi>    <mo>&#x2033;</mo>   </msup>   <mo stretchy='false'>]</mo><mo>&#x2282;</mo><mi>I</mi></mrow>   </semantics></math> collapses to a point, say, <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>*</mo>   </msup>   </mrow>   </semantics></math> under  <math> <semantics>  <mi>f</mi>   </semantics></math>. Then <math> <semantics>  <mrow>   <mi>L</mi><msub>    <mi>t</mi>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <mtext>gr</mtext><msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>!</mo></mrow>   </msup>   <mrow><mo>|</mo><mrow>    <mrow><mo>[</mo> <mrow>     <msup>      <mi>z</mi>      <mo>&#x2032;</mo>     </msup>     <mo>,</mo><msup>      <mi>z</mi>      <mo>&#x2033;</mo>     </msup>     </mrow> <mo>]</mo></mrow></mrow></mrow><mo>=</mo><munder>    <mrow>     <mtext>lim</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </munder>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>!</mo></mrow>   </msup>   <mrow><mo>(</mo>    <mrow>     <msup>      <mi>z</mi>      <mo>&#x2217;</mo>     </msup>     </mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> when the limit on the right-hand side exists. If the trajectory of <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>*</mo>   </msup>   </mrow>   </semantics></math> is neither asymptotically periodic nor asymptotically almost-periodic, then the sequence <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mrow>       <mi>k</mi><mo>!</mo></mrow>     </msup>     <mo>&#x007D;</mo></mrow>    <mi>k</mi>   </msub>   </mrow>   </semantics></math> diverges and <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> cannot exist. An example is delivered by the maps drawn inFigure <xref ref-type="fig" rid="fig5"> 5</xref>. For each of <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>, almost all points of [<italic>a,b</italic>] are not asymptotically periodic or asymptotically almost-periodic. Thereby, <math> <semantics>  <mrow>   <msubsup>    <mi>f</mi>    <mn>1</mn>    <mi>&#x0394;</mi>   </msubsup>   </mrow>   </semantics></math> is non-existent for almost all z* (because <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <msup>     <mi>z</mi>     <mo>&#x2032;</mo>    </msup>    <mo>,</mo><msup>     <mi>z</mi>     <mo>&#x2033;</mo>    </msup>    </mrow> <mo>]</mo></mrow></mrow>   </semantics></math> collapses to <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>*</mo>   </msup>   </mrow>   </semantics></math> under <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>) and <math> <semantics>  <mrow>   <msubsup>    <mi>f</mi>    <mn>2</mn>    <mi>&#x0394;</mi>   </msubsup>   </mrow>   </semantics></math> exists for all <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>*</mo>   </msup>   </mrow>   </semantics></math> regardless of whether <math> <semantics>  <mi>z</mi>   </semantics></math> has the periodicity property or not, namely, <math> <semantics>  <mrow>   <msubsup>    <mi>f</mi>    <mn>2</mn>    <mi>&#x0394;</mi>   </msubsup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math>. Trajectories of almost all points of <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math> are dense in <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math> under both <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>. This is what ensures the existence of <math> <semantics>  <mrow>   <msubsup>    <mi>f</mi>    <mn>2</mn>    <mi>&#x0394;</mi>   </msubsup>   </mrow>   </semantics></math>, but for <math> <semantics>  <mrow>   <msubsup>    <mi>f</mi>    <mn>1</mn>    <mi>&#x0394;</mi>   </msubsup>   </mrow>   </semantics></math> this argument does not ``work'' whenever <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>*</mo>   </msup>   </mrow>   </semantics></math> does not have periodicity properties under <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>.</p>
<p>Thus, in order for <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> to exists, <math> <semantics>  <mi>f</mi>   </semantics></math> must be subject to further restrictions. Before stating the theorem on the resolvent map, we need few more notions.</p>
<fig id="fig5">
<label>Figure 5</label>
<caption>
<p>Examples on the question of the existence of resolvent maps.</p>
</caption>
<graphic xlink:href="468.fig.005" />
</fig><p><bold>Definition 3</bold>   The set</p>

<disp-formula id="FD13"><label>(13)</label><math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><munder>    <mo>&#x2229;</mo>    <mrow>     <mi>&#x03B4;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </munder>   <munder>    <mo>&#x2229;</mo>    <mrow>     <mi>j</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </munder>   <mover accent='true'>    <mrow>     <munder>      <mo>&#x222A;</mo>      <mrow>       <mi>i</mi><mo>&#x003E;</mo><mi>j</mi></mrow>     </munder>     <msup>      <mi>f</mi>      <mi>i</mi>     </msup>     <mrow><mo>(</mo>      <mrow>       <msub>        <mi>V</mi>        <mi>&#x03B4;</mi>       </msub>       <mrow><mo>(</mo>        <mi>z</mi>       <mo>)</mo></mrow></mrow>     <mo>)</mo></mrow></mrow>    <mo stretchy='true'>&#x00AF;</mo>   </mover>   <mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mi>I</mi><mo>,</mo><mtext>&#x00A0;</mtext><msub>    <mi>V</mi>    <mi>&#x03B4;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>(</mo><mi>z</mi><mo>&#x2212;</mo><mi>&#x03B4;</mi><mo>,</mo><mi>z</mi><mo>+</mo><mi>&#x03B4;</mi><mo stretchy='false'>)</mo><mo>&#x2229;</mo><mi>I</mi><mo>,</mo></mrow>   </semantics></math></disp-formula><p>is called the <italic>domain of influence</italic> of the point <math> <semantics>  <mi>z</mi>   </semantics></math> under the map <math> <semantics>  <mi>f</mi>   </semantics></math>.</p>
<p>The set <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is nothing but the upper topological limit of the sets <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>i</mi>   </msup>   <mo stretchy='false'>(</mo><msub>    <mi>V</mi>    <mi>&#x03B4;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>i</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math> as <math> <semantics>  <mrow>   <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mi>&#x03B4;</mi><mo>&#x2192;</mo><mn>0</mn></mrow>   </semantics></math>. Consequently, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> shows how far from the trajectory of the point <math> <semantics>  <mi>z</mi>   </semantics></math> the trajectories of its nearby points go. For example, inFigure <xref ref-type="fig" rid="fig4"> 4</xref>, the fixed point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math> is attracting and the fixed point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><msub>    <mi>&#x03B3;</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math> is repelling. Therefore, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> is the one-point set <math> <semantics>  <mrow>   <mo>&#x007B;</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   <mo>&#x007D;</mo></mrow>   </semantics></math> (moreover, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x007B;</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   <mo>&#x007D;</mo></mrow>   </semantics></math> for all <math> <semantics>  <mi>z</mi>   </semantics></math> that are attracted to <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>), and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>&#x03B3;</mi>    <mn>2</mn>   </msub>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> is the interval <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   <mo>,</mo><mi>b</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math>.</p>
<p>Let <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> stand for the <math> <semantics>  <mi>&#x03C9;</mi>   </semantics></math>-limit set of the trajectory of <math> <semantics>  <mi>z</mi>   </semantics></math> under <math> <semantics>  <mi>f</mi>   </semantics></math>. Clearly, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> contains <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. More precisely: if <math> <semantics>  <mrow>   <mi>z</mi><menclose notation='updiagonalstrike'>    <mo>&#x2208;</mo>   </menclose>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, then <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> has no interior points, but if <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, then at least one of its half-neighborhoods ``expands'' under <math> <semantics>  <mi>f</mi>   </semantics></math>, therefore the interior of <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is nonempty and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x2287;</mo><msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>.</p>
<p>The notion of the domain of influence of a point produces the notion of the domain of influence of a set:</p>

<inline-formula><math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>A</mi><mo stretchy='false'>)</mo><mo>=</mo><munder>    <mo>&#x2229;</mo>    <mrow>     <mi>&#x03B4;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </munder>   <munder>    <mo>&#x2229;</mo>    <mrow>     <mi>j</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </munder>   <mover accent='true'>    <mrow>     <munder>      <mo>&#x222A;</mo>      <mrow>       <mi>i</mi><mo>&#x003E;</mo><mi>j</mi></mrow>     </munder>     <msup>      <mi>f</mi>      <mi>i</mi>     </msup>     <mrow><mo>(</mo>      <mrow>       <msub>        <mi>V</mi>        <mi>&#x03B4;</mi>       </msub>       <mrow><mo>(</mo>        <mi>A</mi>       <mo>)</mo></mrow></mrow>     <mo>)</mo></mrow></mrow>    <mo stretchy='true'>&#x00AF;</mo>   </mover>   <mo>,</mo><mtext>&#x00A0;</mtext><msub>    <mi>V</mi>    <mi>&#x03B4;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>A</mi><mo stretchy='false'>)</mo><mtext>&#x00A0;is&#x00A0;the&#x00A0;</mtext><mi>&#x03B4;</mi><mtext>-neighborhood&#x00A0;of&#x00A0;</mtext><mi>A</mi><mo>&#x2282;</mo><mi>I</mi><mo>,</mo></mrow>   </semantics></math></inline-formula><p>which, of course, is equivalent to the formula <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>A</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mo>&#x222A;</mo>    <mrow>     <mi>z</mi><mo>&#x2208;</mo><mover accent='true'>      <mi>A</mi>      <mo stretchy='true'>&#x00AF;</mo>     </mover>     </mrow>   </msub>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>A</mi><mo>&#x2282;</mo><mi>I</mi></mrow>   </semantics></math>.</p>
<p><bold>Definition 4</bold>   A non-degenerated interval is called a <math> <semantics>  <mi>&#x03BE;</mi>   </semantics></math>-<italic>interval</italic> of <math> <semantics>  <mi>f</mi>   </semantics></math>, if the trajectories of all its points have the same <math> <semantics>  <mi>&#x03C9;</mi>   </semantics></math>-limit set that is different from a cycle or the closure of an almost periodic trajectory.</p>
<p>The simplest variant of <math> <semantics>  <mi>&#x03BE;</mi>   </semantics></math>-intervals is an interval that collapses (under <math> <semantics>  <mi>f</mi>   </semantics></math>) into a point whose trajectory is neither asymptotically periodic nor asymptotically almost periodic, as inFigure <xref ref-type="fig" rid="fig5"> 5</xref>(b).</p>
<p></p>
<p><bold>Definition 5</bold>   An ordered set of intervals <math><semantics><mrow><msub><mrow><mi>J</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><msub><mrow><mi>J</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><msub><mrow><mi>j</mi></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></msub></mrow></semantics></math> is said to be a <italic>cycle of intervals</italic> of the map <math><semantics><mrow><mi>f</mi></mrow></semantics></math> with period <math><semantics><mrow><mi>N</mi></mrow></semantics></math> if these intervals are cyclically permutated by <math><semantics><mrow><mi>f</mi></mrow></semantics></math> and have mutually no common interior points.</p>
<p></p>
<p>Having introduced these definitions, we can pass to the resolvent map.</p>
<p></p>
<p><bold>Theorem 4</bold>   <italic>If the map </italic><math> <semantics>  <mi>f</mi>   </semantics></math><italic> has no </italic><math> <semantics>  <mi>&#x03BE;</mi>   </semantics></math><italic>-intervals, then the </italic><italic>resolvent</italic><italic> map </italic><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math><italic> exists and it can be written in the form</italic></p>

<disp-formula id="FD14"><label>(14)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><mstyle displaystyle='true'>    <munder>     <mo>&#x2229;</mo>     <mrow>      <mi>k</mi><mo>&#x003E;</mo><mn>0</mn></mrow>    </munder>    <mrow>     <msub>      <mi>Q</mi>      <mrow>       <msup>        <mi>f</mi>        <mrow>         <mi>k</mi><mo>!</mo></mrow>       </msup>       </mrow>     </msub>     </mrow>   </mstyle><mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mi>I</mi><mo>.</mo></mrow>   </semantics></math></disp-formula><p><bold>Proof.</bold>   The full proof is too long to include here, but the idea is that the theorem will be confirmed (in view of Lemma 1) if we will show that for any <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math> there is <math> <semantics>  <mrow>   <msub>    <mi>&#x03B5;</mi>    <mi>z</mi>   </msub>   <mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <mi>L</mi><msub>    <mi>t</mi>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>!</mo></mrow>   </msup>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> exists for <math> <semantics>  <mrow>   <mn>0</mn><mo>&#x003C;</mo><mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>    <mi>&#x03B5;</mi>    <mi>z</mi>   </msub>   </mrow>   </semantics></math> and</p>

<disp-formula id="FD15"><label>(15)</label><math> <semantics>  <mrow>   <mstyle displaystyle='true'>    <munder>     <mo>&#x2229;</mo>     <mrow>      <mn>0</mn><mo>&#x003C;</mo><mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>       <mi>&#x03B5;</mi>       <mi>z</mi>      </msub>      </mrow>    </munder>    <mrow>     <msub>      <mrow>       <mtext>Lt</mtext></mrow>      <mrow>       <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>     </msub>     </mrow>   </mstyle><msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>!</mo></mrow>   </msup>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>=</mo><mstyle displaystyle='true'>    <munder>     <mo>&#x2229;</mo>     <mrow>      <mi>k</mi><mo>&#x003E;</mo><mn>0</mn></mrow>    </munder>    <mrow>     <msub>      <mi>Q</mi>      <mrow>       <msup>        <mi>f</mi>        <mrow>         <mi>k</mi><mo>!</mo></mrow>       </msup>       </mrow>     </msub>     </mrow>   </mstyle><mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>.</mo></mrow>   </semantics></math></disp-formula><p>We consider only the simplest case where <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is an attracting cycle. If so, then: <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>i</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>i</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math>;   <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>j</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>j</mi><mi>N</mi></mrow>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> with <math> <semantics>  <mi>N</mi>   </semantics></math> being the period of the attracting cycle, and there exists <math> <semantics>  <mrow>   <msub>    <mi>&#x03B5;</mi>    <mi>z</mi>   </msub>   <mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <msup>    <mi>z</mi>    <mo>&#x2032;</mo>   </msup>   <mo>&#x2208;</mo><msub>    <mi>V</mi>    <mi>&#x03B5;</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> if <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>    <mi>&#x03B5;</mi>    <mi>z</mi>   </msub>   </mrow>   </semantics></math>. Consequently,</p>

<inline-formula><math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>j</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>j</mi><mi>N</mi></mrow>   </msup>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>=</mo><msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>j</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>j</mi><mi>N</mi></mrow>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mtext>&#x00A0;if&#x00A0;</mtext><mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>    <mi>&#x03B5;</mi>    <mi>z</mi>   </msub>   <mo>.</mo></mrow>   </semantics></math></inline-formula><p>As <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mrow>       <mi>k</mi><mo>!</mo></mrow>     </msup>     <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x007D;</mo></mrow>    <mrow>     <mi>k</mi><mo>&#x2265;</mo><mi>N</mi></mrow>   </msub>   </mrow>   </semantics></math> is a subsequence of <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>f</mi>      <mrow>       <mi>j</mi><mi>N</mi></mrow>     </msup>     <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x007D;</mo></mrow>    <mi>j</mi>   </msub>   </mrow>   </semantics></math>, we obtain (15) from the equalities</p>

<inline-formula><math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lt</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>k</mi><mo>!</mo></mrow>   </msup>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>V</mi>      <mi>&#x03B5;</mi>     </msub>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mtext>&#x00A0;if&#x00A0;</mtext><mi>&#x03B5;</mi><mo>&#x003C;</mo><msub>    <mi>&#x03B5;</mi>    <mi>z</mi>   </msub>   <mo>,</mo><mtext>&#x00A0;and&#x00A0;</mtext><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mrow>       <mi>k</mi><mo>!</mo></mrow>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>N</mi>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>.</mo></mrow>   </semantics></math></inline-formula><p>In case <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is the closure of an almost-periodic trajectory, the proof is similar but more technically involved, it is presented in [
<xref ref-type="bibr" rid="R11">11</xref>]. A proof that covers all cases can be found in [
<xref ref-type="bibr" rid="R8">8</xref>], so far only in Russian.</p>
<p></p>
<p>Theorem 4 will hold if</p>
<p><math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> <italic>is</italic><italic> a cycle or the closure of an almost-periodic trajectory for all </italic><math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math> . It is known [
<xref ref-type="bibr" rid="R10">10</xref>,<xref ref-type="bibr" rid="R12">12</xref>] that (i) certainly holds if <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is closed (then <math> <semantics>  <mrow>   <msub>    <mi>&#x03C9;</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is a cycle whatever <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math>) and fails if <math> <semantics>  <mi>f</mi>   </semantics></math> has a cycle with a non-power-of-two period. Furthermore, (i) is no longer guaranteed if <math> <semantics>  <mi>f</mi>   </semantics></math> has cycles of all periods <math> <semantics>  <mrow>   <mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><msup>    <mn>2</mn>    <mn>2</mn>   </msup>   <mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> but no others.</p>
<p>Here is another sufficient condition for Theorem 4</p>
<p><math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math><italic> </italic><italic>is</italic><italic> a cycle or a cycle of intervals for all </italic><math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math><italic>.</italic></p>
<p></p>
<p>If (ii) is modified as follows</p>
<p>(iii) <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math><italic> is a cycle or a cycle of intervals for all </italic><math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math><italic> and their periods are uniformly bounded,</italic></p>
<p></p>
<p>then <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> takes the very simple form</p>

<disp-formula id="FD16"><label>(16)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mn>2</mn><mi>p</mi><mi>k</mi></mrow>   </msup>   <mtext>&#x00A0;&#x00A0;&#x00A0;and&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mrow>       <mn>2</mn><mi>p</mi></mrow>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>,</mo></mrow>   </semantics></math></disp-formula><p>where <math> <semantics>  <mrow>   <mi>p</mi><mo>&#x003C;</mo><mi>&#x221E;</mi></mrow>   </semantics></math> is the least common multiple of the periods of all <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>f</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mi>I</mi><mo>.</mo></mrow>   </semantics></math></p>
<p>So, the resolvent map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> may or may not exist, and when it does, it is usually arranged complexly. The main properties of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> are listed below.</p>
<p>The map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math> thought of as a function form <math> <semantics>  <mi>I</mi>   </semantics></math> into <math> <semantics>  <mrow>   <msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo>,</mo></mrow>   </semantics></math> is upper semicontinuous. Its value is a non-degenerated closed interval for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and a one-point set (singleton) for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math></p>
<p>The map <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math> thought of as a function form <math> <semantics>  <mi>I</mi>   </semantics></math> into <math> <semantics>  <mi>I</mi>   </semantics></math>, is single-valued and continuous over <math> <semantics>  <mrow>   <mi>I</mi><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, and is multi-valued over <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math></p>
<p></p>
<p><bold>Definition </bold><bold>6</bold>   The set of values that <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> takes on for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is called its <italic>spectrum of </italic><italic>jumps</italic> and denoted by <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>.</p>
<p></p>
<p>Two simple illustrations are given by the maps ofFigure <xref ref-type="fig" rid="fig4"> 4</xref> andFigure <xref ref-type="fig" rid="fig5"> 5</xref>(b): here <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> consists of the interval <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><msub>    <mi>&#x03B3;</mi>    <mn>1</mn>   </msub>   <mo>,</mo><mi>b</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msubsup>    <mi>f</mi>    <mn>2</mn>    <mi>&#x0394;</mi>   </msubsup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> consists of the intervals <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <mi>a</mi><mo>,</mo><mi>b</mi></mrow> <mo>]</mo></mrow></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <mi>c</mi><mo>,</mo><mi>b</mi></mrow> <mo>]</mo></mrow></mrow>   </semantics></math>.</p>
<p>The spectrum of jumps <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> is composed from the connected component of domains of influence of the unstable points of <math> <semantics>  <mi>f</mi>   </semantics></math>. Any two elements of <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> either do not have common interior points, or one of them contains the other.</p>
<p>In typical situations, <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> as well as the set of values of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> on <math> <semantics>  <mrow>   <mi>I</mi><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> are finite (in particular, this is the case for structurally stable <math> <semantics>  <mi>f</mi>   </semantics></math>).</p>
<p>In many cases, the graph of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> is locally self-similar and, furthermore, fractal: <math> <semantics>  <mrow>   <mtext>gr</mtext><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> is a plane curve whose fractal dimension is greater than 1.</p>
<p>The first four properties are easy to obtain from Theorem 4, and the last one needs some comments. Let <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>dim</mtext></mrow>    <mrow>     <mtext>&#x200A;</mtext><mtext>box</mtext></mrow>   </msub>   </mrow>   </semantics></math> denote the box-counting dimension (one of the commonly used versions of fractal dimension). It is clear that</p>
<p>usually holds (at least when <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> is finite). The set <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is known to be often fractal. Therefore, if <math> <semantics>  <mrow>   <mi>d</mi><mi>i</mi><msub>    <mi>m</mi>    <mrow>     <mtext>box</mtext></mrow>   </msub>   <mi>D</mi><mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow><mo>&#x2260;</mo><mn>0</mn><mo>,</mo></mrow>   </semantics></math> then the fractal dimension of <math> <semantics>  <mrow>   <mtext>gr</mtext><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> is greater than 1 and, moreover, it can even be equal to 2 (the latter is always the case where <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> contains an interval).</p>
<p>More details and arguments about <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> can be found in [
<xref ref-type="bibr" rid="R8">8</xref>], but here the properties of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> are illustrated inFigure <xref ref-type="fig" rid="fig6"> 6</xref>, which displays the resolvent map for the logistics parabola</p>

<disp-formula id="FD17"><label>(17)</label><math> <semantics>  <mrow>   <mi>&#x03B7;</mi><mo>:</mo><mi>z</mi><mo>&#x2192;</mo><mi>&#x03BB;</mi><mi>z</mi><mo stretchy='false'>(</mo><mn>1</mn><mo>&#x2212;</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo><mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;</mtext><mi>&#x03BB;</mi><mo>&#x003E;</mo><mn>0</mn><mtext>&#x00A0;-&#x00A0;parameter</mtext><mo>.</mo></mrow>   </semantics></math></disp-formula><p>The dynamical properties of (17) are well known, so we use them without explanations.</p>
<p>If <math> <semantics>  <mrow>   <mi>&#x03BB;</mi><mo>=</mo><mn>3.5</mn></mrow>   </semantics></math>, then <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> has an attracting period-4 cycle, which attracts all points of [
<xref ref-type="bibr" rid="R1">1</xref>] except for the set <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, which consists of the repelling period-1 and period-2 periodic points of <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> and their inverse images, and is therefore countable and nowhere dense. The resolvent map <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, thought of as a function <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo><mo>&#x2192;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math>, is piecewise constant over <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and takes on four values that correspond to the points of the attracting cycle, but over <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, it becomes interval-valued with the spectrum of jumps consisting of three intervals (seeFigure <xref ref-type="fig" rid="fig6"> 6</xref>(a)).</p>
<fig id="fig6">
<label>Figure 6</label>
<caption>
<p>Resolvent maps for .</p>
</caption>
<graphic xlink:href="468.fig.006" />
</fig><p>Where <math> <semantics>  <mrow>   <mi>&#x03BB;</mi><mo>=</mo><mn>3.83</mn></mrow>   </semantics></math> and <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> has an attractive period-3 cycle and repelling cycles of any period, the properties of <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> are nearly the same as in the previous case (seeFigure <xref ref-type="fig" rid="fig6"> 6</xref>(c)). The only difference is that <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, over which <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is interval-valued, is already uncountable but again nowhere dense (now <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is a Cantor-like set, since it is the closure of the repelling periodic points of <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> and their inverse images). In addition, <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> has positive fractal dimension and, hence, the graph of <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is a fractal.</p>
<p></p>
<p>Now a very different situation where <math> <semantics>  <mrow>   <mi>&#x03BB;</mi><mo>=</mo><msub>    <mi>&#x03BB;</mi>    <mi>&#x221E;</mi>   </msub>   <mo stretchy='false'>(</mo><mo>&#x2248;</mo><mn>3.57</mn><mo stretchy='false'>)</mo></mrow>   </semantics></math> with <math> <semantics>  <mrow>   <msub>    <mi>&#x03BB;</mi>    <mi>&#x221E;</mi>   </msub>   </mrow>   </semantics></math> being the parameter value at which <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> has only cycles with periods <math> <semantics>  <mrow>   <mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><msup>    <mn>2</mn>    <mn>2</mn>   </msup>   <mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> (seeFigure <xref ref-type="fig" rid="fig6"> 6</xref>(b)). These cycles are repelling and their inverse images are dense on <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <mn>0</mn><mo>,</mo><mn>1</mn></mrow> <mo>]</mo></mrow></mrow>   </semantics></math>. Hence, <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is a countable dense set and all points of <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> are attracted to the Cantor-like set <math> <semantics>  <mi mathvariant='script'>K</mi>   </semantics></math> consisting of the condensation points of <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. It follows that <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is singleton-valued over <math> <semantics>  <mrow>   <mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and its values run through the continual set <math> <semantics>  <mi mathvariant='script'>K</mi>   </semantics></math>; whereas <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is interval-valued over <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and its spectrum of jumps is countable (the infimum of the lengths of intervals from <math> <semantics>  <mrow>   <mtext>J</mtext><mo stretchy='false'>(</mo><msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> equals <math> <semantics>  <mn>0</mn>   </semantics></math>).</p>
<p></p>
<p>Graphics shown inFigure <xref ref-type="fig" rid="fig6"> 6</xref> have local self-similarity in the vicinity of each ``largest'' vertical segment in case (a), and each vertical segment in cases (b) and (c). Moreover, in the last case, there are an uncountable number of vertical segments, which leads to the fractality of the graph.</p>
</sec><sec id="sec5">
<title>Limit Semigroup in the Space of Upper Semicontinuous Maps</title><p>The existence of <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> given by (12) does not in itself guarantee that <math> <semantics>  <mrow>   <mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> generates the limit semigroup for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>. The last is automatically true if</p>

<disp-formula id="FD18"><label>(18)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mtext>&#x00A0;&#x00A0;and&#x00A0;&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mi>f</mi><mo>=</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math></disp-formula><p>(the former of these equalities entails the latter, but not the other way around).</p>
<p></p>
<p>The condition of Theorem 4, generally speaking, do not imply (18). A confirming example comes fromFigure <xref ref-type="fig" rid="fig7"> 7</xref>. For <math> <semantics>  <mi>f</mi>   </semantics></math> depicted there, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> exists, but <math> <semantics>  <mi>f</mi>   </semantics></math> and <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> do not commute: <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>a</mi><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mi>c</mi><mo>,</mo><mi>&#x03B3;</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>f</mi><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>a</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mi>c</mi><mo>,</mo><mi>&#x03B3;</mi><mo stretchy='false'>]</mo></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>(</mo><mi>a</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>&#x03B3;</mi><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mi>c</mi><mo>,</mo><msub>    <mi>&#x03B3;</mi>    <mn>2</mn>   </msub>   <mo stretchy='false'>]</mo></mrow>   </semantics></math>, and hence <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mi>f</mi><mo>=</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math>. Besides, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math>. Here, either of the equalities in (18) fails because <math> <semantics>  <mi>f</mi>   </semantics></math> has an extremum at the unstable point <math> <semantics>  <mrow>   <msub>    <mi>z</mi>    <mo>&#x00B0;</mo>   </msub>   </mrow>   </semantics></math>.</p>
<p></p>
<p>There are maps for which only the former equality in (18) breaks down. One example are </p>

<inline-formula><math> <semantics>  <mrow>   <mi>g</mi><mo>:</mo><mi>z</mi><mo>&#x2192;</mo><mrow><mo>{</mo> <mrow>    <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mtable columnalign='left'>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <msup>         <mi>z</mi>         <mn>2</mn>        </msup>        <mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>      </mtd>     </mtr>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <mo stretchy='false'>(</mo><mi>z</mi><mo>+</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>/</mo><mn>2</mn><mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo><mo>,</mo></mrow>      </mtd>     </mtr>         </mtable></mrow> </mrow><mtext>&#x00A0;&#x00A0;and&#x00A0;&#x00A0;</mtext><msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   <mo>:</mo><mi>z</mi><mo>&#x2192;</mo><mrow><mo>{</mo> <mrow>    <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mtable columnalign='left'>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <mn>0</mn><mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>      </mtd>     </mtr>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <mtext>&#x00A0;</mtext><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo><mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>=</mo><mn>1</mn><mo>,</mo></mrow>      </mtd>     </mtr>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <mn>1</mn><mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>(</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo></mrow>      </mtd>     </mtr>         </mtable></mrow> </mrow></mrow>   </semantics></math></inline-formula><p>(the drawing is left to the reader). Here, <math> <semantics>  <mi>g</mi>   </semantics></math> has the semi-attracting fixed point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><mn>1</mn></mrow>   </semantics></math>, which leads to that the domain of influence of a point <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math> does not coincide with the domain of influence of its <math> <semantics>  <mi>&#x03C9;</mi>   </semantics></math>-limit set, namely: <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>g</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mi>g</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x007B;</mo><mn>1</mn><mo>&#x007D;</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>g</mi>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>&#x03C9;</mi>    <mi>g</mi>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math>. Therefore, <math> <semantics>  <mrow>   <msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mn>1</mn></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo><mo>.</mo></mrow>   </semantics></math> In order for the last equality in (18) to be also violated, we ``improve'' <math> <semantics>  <mi>g</mi>   </semantics></math> by replacing it with </p>

<inline-formula><math> <semantics>  <mrow>   <mi>g</mi><mo>:</mo><mi>z</mi><mo>&#x2192;</mo><mrow><mo>{</mo> <mrow>    <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mtable columnalign='left'>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <msup>         <mi>z</mi>         <mn>2</mn>        </msup>        <mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>,</mo></mrow>      </mtd>     </mtr>     <mtr columnalign='left'>      <mtd columnalign='left'>       <mrow>        <mtext>1</mtext><mo>,</mo><mtext>&#x200B;</mtext><mtext>&#x200B;</mtext></mrow>      </mtd>      <mtd columnalign='left'>       <mrow>        <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo><mo>,</mo></mrow>      </mtd>     </mtr>         </mtable></mrow> </mrow></mrow>   </semantics></math></inline-formula><p>which has much the same dynamical property as <math> <semantics>  <mi>g</mi>   </semantics></math>. More precisely: <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>       </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>&#x03C9;</mi>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>       </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x007B;</mo><mn>1</mn><mo>&#x007D;</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>       </msub>   <mo stretchy='false'>(</mo><msub>    <mi>&#x03C9;</mi>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>       </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>(</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo><mo>.</mo></mrow>   </semantics></math> As a result, <math> <semantics>  <mrow>   <msup>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>        <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math>, but <math> <semantics>  <mrow>   <msup>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>        <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mover accent='true'>    <mi>g</mi>    <mo>&#x00AF;</mo>   </mover>   <menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <mover accent='true'>    <mi>g</mi>    <mo>&#x00AF;</mo>   </mover>   <mo>&#x2218;</mo><msup>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>        <mi>&#x0394;</mi>   </msup>   <mo>,</mo></mrow>   </semantics></math> whereas <math> <semantics>  <mrow>   <msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mi>g</mi><mo>=</mo><mi>g</mi><mo>&#x2218;</mo><msup>    <mi>g</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math>. Indeed, <math> <semantics>  <mrow>   <msup>    <mover accent='true'>     <mi>g</mi>     <mo>&#x00AF;</mo>    </mover>        <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mover accent='true'>    <mi>g</mi>    <mo>&#x00AF;</mo>   </mover>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mover accent='true'>    <mi>g</mi>    <mo stretchy='true'>&#x00AF;</mo>   </mover>   <mrow><mo>(</mo>    <mrow>     <msup>      <mrow>       <mover accent='true'>        <mi>g</mi>        <mo stretchy='true'>&#x00AF;</mo>       </mover>       </mrow>      <mi>&#x0394;</mi>     </msup>     <mrow><mo>(</mo>      <mi>z</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo> <mn>1</mn> <mo>}</mo></mrow></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math>.</p>
<p></p>
<p>There are smooth maps for which (18) is not satisfied, for example, <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x21A6;</mo><mn>4</mn><msup>    <mi>z</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>(</mo><mn>1</mn><mo>&#x2212;</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math></p>
<fig id="fig7">
<label>Figure 7</label>
<caption>
<p>Example of a map that does not commutate with its associated resolvent map.</p>
</caption>
<graphic xlink:href="468.fig.007" />
</fig><p>As the above examples demonstrate, violating (18) occurs when the set</p>

<inline-formula><math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x007B;</mo><mi>z</mi><mo>&#x2208;</mo><mi>I</mi><mo>:</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>s</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>s</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>s</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mtext>&#x00A0;for&#x00A0;some&#x00A0;integer&#x00A0;</mtext><mi>s</mi><mo>=</mo><mi>s</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>&#x003E;</mo><mn>0</mn><mo>&#x007D;</mo></mrow>   </semantics></math></inline-formula><p>is non-empty. It is not difficult to realize that this condition is necessary and sufficient.</p>
<p></p>
<p><bold>Theorem 5</bold>   <italic>Let </italic><math> <semantics>  <mi>f</mi>   </semantics></math><italic> satisfy the condition of Theorem 4. The equalities </italic><italic>(18)</italic><italic> take place if and only if </italic><math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo><mo>.</mo></mrow>   </semantics></math></p>
<p></p>
<p><bold>Proof.</bold>   The 'only if' part is evident. The 'if' part follows from <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>m</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>m</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>n</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mi>m</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>f</mi>      <mrow>       <mi>r</mi><mo stretchy='false'>(</mo><mi>n</mi><mo>,</mo><mi>m</mi><mo stretchy='false'>)</mo></mrow>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> with <math> <semantics>  <mrow>   <mi>r</mi><mo>=</mo><mrow><mo>(</mo>    <mrow>     <mi>n</mi><mo>,</mo><mi>m</mi></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> being the greatest common divisor of <math> <semantics>  <mi>n</mi>   </semantics></math> and <math> <semantics>  <mi>m</mi>   </semantics></math>, because these formulas are valid only provided that <math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo><mo>.</mo></mrow>   </semantics></math></p>
<p></p>
<p>The condition <math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math> does not seem very good for practical use, but it is much easier to check it where <math> <semantics>  <mi>f</mi>   </semantics></math> satisfies (iii) and, hence, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> is given by (16) with some <math> <semantics>  <mrow>   <mi>p</mi><mo>&#x003C;</mo><mi>&#x221E;</mi></mrow>   </semantics></math>. It suffices to analyse just <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mn>2</mn><mi>p</mi></mrow>   </msup>   </mrow>   </semantics></math> and not all the iterations of <math> <semantics>  <mi>f</mi>   </semantics></math>.</p>
<p></p>
<p>Based on Theorem (5), from now on we will assume that</p>
<p></p>
<p>(v)the map <math> <semantics>  <mi>f</mi>   </semantics></math> has no <math> <semantics>  <mi>&#x03BE;</mi>   </semantics></math>-intervals, </p>
<p>(vv)<math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math>,</p>
<p>and refer to (v),(vv) as the <italic>limit </italic><italic>semigroup</italic><italic> conditions</italic> or LSG-conditions for short.</p>
<p></p>
<p>These conditions cover most of continuous intervals maps, in particular, structurally stable maps. For instance, the logistic parabola (17) is structurally stable (and, hence, satisfies LSG-conditions) on a parameter set containing an open subset; this subset consists of those <math> <semantics>  <mi>&#x03BB;</mi>   </semantics></math> for which there is an attracting cycle with multiplier less than 1 in absolute value. Of course, LSG-conditions can be met by maps that are not structurally stable. An example is again given by the logistic parabola. If <math> <semantics>  <mrow>   <mi>&#x03BB;</mi><mo>=</mo><mn>3</mn></mrow>   </semantics></math>, then <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> has the attracting fixed point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><mn>2</mn><mo>/</mo><mn>3</mn></mrow>   </semantics></math> whose multiplier is equal to <math> <semantics>  <mrow>   <mo>&#x2212;</mo><mn>1</mn></mrow>   </semantics></math>. In this case, <math> <semantics>  <mrow>   <mi>p</mi><mo>=</mo><mn>1</mn></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>Z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mrow>     <msub>      <mi>&#x03C9;</mi>      <mrow>       <msup>        <mi>&#x03B7;</mi>        <mn>2</mn>       </msup>       </mrow>     </msub>     <mrow><mo>(</mo>      <mi>Z</mi>     <mo>)</mo></mrow></mrow>   <mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <mrow><mo>{</mo> <mrow>       <mn>2</mn><mo>/</mo><mn>3</mn></mrow> <mo>}</mo></mrow><mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><mrow><mo>(</mo>       <mrow>        <mn>0</mn><mo>,</mo><mn>1</mn></mrow>      <mo>)</mo></mrow><mo>,</mo>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow><mo>[</mo> <mrow>       <mn>0</mn><mo>,</mo><mn>3</mn><mo>/</mo><mn>4</mn></mrow> <mo>]</mo></mrow><mo>,</mo><mtext>&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>=</mo><mn>0</mn><mo>,</mo><mi>z</mi><mo>=</mo><mn>1</mn><mo>,</mo>     </mtd>    </mtr>   </mtable>    </mrow></mrow>   </semantics></math>(seeFigure <xref ref-type="fig" rid="fig8"> 8</xref>), and thus the LSG-conditions are met.</p>
<fig id="fig8">
<label>Figure 8</label>
<caption>
<p>Example of a structurally unstable map that satisfies LSG-conditions.</p>
</caption>
<graphic xlink:href="468.fig.008" />
</fig><p>Once LSG-conditions are valid, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> exists and <math> <semantics>  <mrow>   <mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> generates in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math> the semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math> that consists of just the maps~<math> <semantics>  <mrow>   <msup>    <mi>h</mi>    <mi>n</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>,</mo></mrow>   </semantics></math> <math> <semantics>  <mrow>   <mi>n</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> Then from (11) and (18) it follows that</p>

<disp-formula id="FD19"><label>(19)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mtext>&#x00A0;&#x00A0;and&#x00A0;&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>n</mi><mo>+</mo><mi>k</mi><mo>!</mo></mrow>   </msup>   <mo>,</mo><mtext>&#x00A0;&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo><mo>,</mo></mrow>   </semantics></math></disp-formula><p>with the limit being uniform in <math> <semantics>  <mi>n</mi>   </semantics></math>.</p>
<p><bold>Theorem 6</bold>   <italic>Let LSG-conditions be met</italic>.</p>
<p><italic>The </italic><italic>semigroup</italic><italic> </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math><italic> is periodic or almost periodic.</italic></p>
<p><italic>The </italic><italic>semigroup</italic><italic> </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math><italic> is the limit </italic><italic>semigroup</italic><italic> for </italic><math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math><italic> in the </italic><italic>space </italic><math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math><italic>.</italic></p>
<p><bold>Proof.</bold>   We consider the simple case where <math> <semantics>  <mi>f</mi>   </semantics></math> satisfies (iii). Then <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> is written in the form (16) with some <math> <semantics>  <mrow>   <mi>p</mi><mo>&#x003C;</mo><mi>&#x221E;</mi></mrow>   </semantics></math>. Therefore <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mn>2</mn><mi>p</mi></mrow>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mi>n</mi><mo>+</mo><mn>2</mn><mi>p</mi></mrow>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math>.  Hence <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math> is periodic, as claimed in item 1. Item 2 can be considered true if we succeed in proving that</p>

<disp-formula id="FD20"><label>(20)</label><math> <semantics>  <mrow>   <msub>    <mi>&#x03C1;</mi>    <mrow>     <msub>      <mtext>&#x200B;</mtext>      <mrow>       <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mi>H</mi></mrow>     </msub>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo><mo>&#x2192;</mo><mn>0</mn><mtext>&#x00A0;&#x00A0;&#x00A0;as&#x00A0;&#x00A0;&#x00A0;</mtext><mi>n</mi><mo>&#x2192;</mo><mi>&#x221E;</mi><mo>.</mo></mrow>   </semantics></math></disp-formula><p>It is clear that <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mi>s</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> with some <math> <semantics>  <mrow>   <mn>0</mn><mo>&#x2264;</mo><mi>s</mi><mo>&#x2264;</mo><mn>2</mn><mi>p</mi><mo>&#x2212;</mo><mn>1</mn></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>s</mi><mo>=</mo><mi>s</mi><mo stretchy='false'>(</mo><mi>n</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. Since <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>s</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>s</mi><mo>+</mo><mn>2</mn><mi>p</mi><mi>k</mi></mrow>   </msup>   <mo>,</mo></mrow>   </semantics></math> for any <math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> there exists <math> <semantics>  <mrow>   <mi>K</mi><mo stretchy='false'>(</mo><mi>&#x03B5;</mi><mo>,</mo><mi>s</mi><mo stretchy='false'>)</mo><mo>&#x003E;</mo><mn>0</mn></mrow>   </semantics></math> such that <math> <semantics>  <mrow>   <msub>    <mi>&#x03C1;</mi>    <mi>H</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <msup>      <mi>f</mi>      <mrow>       <mi>s</mi><mo>+</mo><mn>2</mn><mi>p</mi><mi>k</mi></mrow>     </msup>     <mo>,</mo><msup>      <mi>f</mi>      <mi>s</mi>     </msup>     <mo>&#x2218;</mo><msup>      <mi>f</mi>      <mi>&#x0394;</mi>     </msup>     </mrow>   <mo>)</mo></mrow><mo>&#x2264;</mo><mi>&#x03B5;</mi></mrow>   </semantics></math> if <math> <semantics>  <mrow>   <mi>k</mi><mo>&#x003E;</mo><mi>K</mi><mo stretchy='false'>(</mo><mi>&#x03B5;</mi><mo>,</mo><mi>s</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. Hence,</p>

<inline-formula><math> <semantics>  <mrow>   <msub>    <mi>&#x03C1;</mi>    <mrow>     <msub>      <mtext>&#x200B;</mtext>      <mrow>       <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mi>H</mi></mrow>     </msub>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo><mo>&#x2264;</mo><mi>&#x03B5;</mi><mtext>&#x00A0;&#x00A0;for&#x00A0;&#x00A0;</mtext><mi>n</mi><mo>&#x003E;</mo><mn>2</mn><mi>p</mi><mo stretchy='false'>(</mo><mi>K</mi><mo>+</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>,</mo><mtext>&#x00A0;&#x00A0;</mtext><mi>K</mi><mo>=</mo><msub>    <mrow>     <mi>max</mi></mrow>    <mrow>     <mn>0</mn><mo>&#x2264;</mo><mi>s</mi><mo>&#x2264;</mo><mn>2</mn><mi>p</mi><mo>&#x2212;</mo><mn>1</mn></mrow>   </msub>   <mi>K</mi><mo stretchy='false'>(</mo><mi>&#x03B5;</mi><mo>,</mo><mi>s</mi><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math></inline-formula><p>which gives (20), and item 2 follows. If (iii) is not satisfied, the proof becomes more complicated and needs some additional background. It can be found in [
<xref ref-type="bibr" rid="R8">8</xref>].</p>
<p>If <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is finite (in which case <math> <semantics>  <mi>f</mi>   </semantics></math> satisfies (iii) with <math> <semantics>  <mrow>   <mi>p</mi><mo>=</mo><mn>1</mn></mrow>   </semantics></math> or <math> <semantics>  <mrow>   <mi>p</mi><mo>=</mo><mn>2</mn></mrow>   </semantics></math>), then its limit semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math> is periodic with period 1 or 2. At the same time, <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is typically not periodic. It is periodic only if <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mn>2</mn>   </msup>   </mrow>   </semantics></math> is the identity map, i.e., if either <math> <semantics>  <mrow>   <mi>f</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>z</mi><mo>,</mo></mrow>   </semantics></math> or <math> <semantics>  <mrow>   <mi>f</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2212;</mo><mi>z</mi><mo>+</mo><mn>2</mn><msub>    <mi>c</mi>    <mo>&#x00B0;</mo>   </msub>   </mrow>   </semantics></math> with <math> <semantics>  <mrow>   <msub>    <mi>c</mi>    <mo>&#x00B0;</mo>   </msub>   </mrow>   </semantics></math> being the midpoint of <math> <semantics>  <mi>I</mi>   </semantics></math>. Indeed, in both the cases, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mrow>     <mo>&#x2212;</mo><mn>1</mn></mrow>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>f</mi><mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and therefore <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is actually periodic with period 1 (in the former case) or 2 (in the latter one); moreover, <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> is the identity map, i.e., <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math> coincides with <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>, which means that <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> is the limit semigroup for itself in <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> as well as in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><msup>    <mn>2</mn>    <mi>I</mi>   </msup>   <mo stretchy='false'>)</mo></mrow>   </semantics></math>.</p>
<p>There is another approach to the study of transformation groups, which based on the notion of Ellis enveloping semigroup [
<xref ref-type="bibr" rid="R2">2</xref>,<xref ref-type="bibr" rid="R3">3</xref>,<xref ref-type="bibr" rid="R4">4</xref>]. For <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>, the enveloping semigroup <math> <semantics>  <mrow>   <mi>E</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is defined as the closure of the set <math> <semantics>  <mrow>   <mo>&#x007B;</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>:</mo><mi>I</mi><mo>&#x2192;</mo><mi>I</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>...</mn><mo>&#x007D;</mo></mrow>   </semantics></math> in the space <math> <semantics>  <mrow>   <msup>    <mi>I</mi>    <mi>I</mi>   </msup>   </mrow>   </semantics></math> of maps of <math> <semantics>  <mi>I</mi>   </semantics></math> into <math> <semantics>  <mi>I</mi>   </semantics></math>, equipped with the pointwise convergence topology. The asymptotic properties of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> are described by the following subset of <math> <semantics>  <mrow>   <mi>E</mi><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>:</p>

<inline-formula><math> <semantics>  <mrow>   <msup>    <mi>E</mi>    <mo>&#x2032;</mo>   </msup>   <mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo> <mrow>    <mi>h</mi><mo>&#x2208;</mo><msup>     <mi>I</mi>     <mi>I</mi>    </msup>    <mo>:</mo><mo>&#x2203;</mo><msub>     <mi>n</mi>     <mi>i</mi>    </msub>    <mo>&#x2192;</mo><mi>&#x221E;</mi><mo>&#x005C;</mo><mi>h</mi><mrow><mo>(</mo>     <mi>z</mi>    <mo>)</mo></mrow><mo>=</mo><munder>     <mrow>      <mi>lim</mi></mrow>     <mrow>      <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>    </munder>    <msup>     <mi>f</mi>     <mrow>      <mi>n</mi><mi>i</mi></mrow>    </msup>    <mrow><mo>(</mo>     <mi>z</mi>    <mo>)</mo></mrow><mo>,</mo><mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow> <mo>}</mo></mrow><mo>.</mo></mrow>   </semantics></math></inline-formula><p>Where <math> <semantics>  <mrow>   <msup>    <mi>E</mi>    <mo>&#x2032;</mo>   </msup>   <mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> is a finite semigroup, it can be regarded in a certain sense as an analogue of the limit semigroup for <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> in <math> <semantics>  <mrow>   <mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. Indeed, <math> <semantics>  <mrow>   <msup>    <mi>E</mi>    <mo>&#x2032;</mo>   </msup>   <mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> is finite if and only if</p>

<disp-formula id="FD21"><label>(21)</label><math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mtext>Fix</mtext><mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mrow>     <msup>      <mn>2</mn>      <mi>m</mi>     </msup>     </mrow>   </msup>   <mo stretchy='false'>)</mo><mtext>&#x00A0;&#x00A0;for&#x00A0;some&#x00A0;integer&#x00A0;&#x00A0;</mtext><mi>m</mi><mo>&#x003E;</mo><mn>0.</mn></mrow>   </semantics></math></disp-formula><p>Then <math> <semantics>  <mrow>   <msup>    <mi>E</mi>    <mo>&#x2032;</mo>   </msup>   <mrow><mo>(</mo>    <mi>f</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> is a periodic group of period <math> <semantics>  <mrow>   <msup>    <mn>2</mn>    <mi>m</mi>   </msup>   </mrow>   </semantics></math>, namely,</p>

<disp-formula id="FD22"><label>(22)</label><math> <semantics>  <mrow>   <msup>    <mi>E</mi>    <mo>&#x2032;</mo>   </msup>   <mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   <mo>&#x232A;</mo><mo>,</mo><mtext>&#x00A0;&#x00A0;where&#x00A0;&#x00A0;</mtext><msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><munder>    <mrow>     <mi>lim</mi></mrow>    <mrow>     <mi>i</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </munder>   <msup>    <mi>f</mi>    <mrow>     <mi>i</mi><mo>&#x22C5;</mo><msup>      <mn>2</mn>      <mi>m</mi>     </msup>     </mrow>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>.</mo></mrow>   </semantics></math></disp-formula><p>This statement is a direct consequence of the following well-known fact: the trajectories of all <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mi>I</mi></mrow>   </semantics></math> are asymptotically periodic under <math> <semantics>  <mi>f</mi>   </semantics></math> with their asymptotic periods being uniformly bounded, if and only if (21) holds (see [
<xref ref-type="bibr" rid="R9">9</xref>]). In this case, it is easy to verify that <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>z</mi><menclose notation='updiagonalstrike'>    <mo>&#x2208;</mo>   </menclose>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. Hence, <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   </mrow>   </semantics></math> is identical to the resolvent map over <math> <semantics>  <mrow>   <mi>I</mi><mo>&#x2216;</mo><mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>. In addition, <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   </mrow>   </semantics></math> is continuous just if <math> <semantics>  <mrow>   <mtext>D</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math> (or, equivalently, <math> <semantics>  <mrow>   <mtext>Per</mtext><mo stretchy='false'>(</mo><mi>f</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is connected) and then <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   <mo>=</mo><msup>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msup>   </mrow>   </semantics></math> over <math> <semantics>  <mi>I</mi>   </semantics></math>. Otherwise, <math> <semantics>  <mrow>   <msub>    <mi>f</mi>    <mo>&#x22C6;</mo>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is a first Baire class function. Thus, the limit semigroup approach, compared with the enveloping semigroup approach, can give more information about the asymptotic properties of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math> and allows one to study a wider class of maps <math> <semantics>  <mi>f</mi>   </semantics></math>.</p>
</sec><sec id="sec6">
<title>Limit Sequence</title><p>LSG-conditions (v),(vv) are always satisfied by structurally stable maps, and then the limit semigroup <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x232A;</mo></mrow>   </semantics></math> exists and consists of the maps</p>

<disp-formula id="FD23"><label>(23)</label><math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>,</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>,</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;&#x00A0;</mtext><mo>&#x2026;</mo><mo>.</mo></mrow>   </semantics></math></disp-formula><p>When <math> <semantics>  <mi>f</mi>   </semantics></math> is not structurally stable, LSG-conditions may not be met. If this is due to the failure of only (vv), then <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> exists, but its associated maps (23) can no longer form a semigroup. Nevertheless, it may happen that the maps (23) constitute a periodic or almost periodic sequence and still retain the principal property of limit semigroups</p>

<disp-formula id="FD24"><label>(24)</label><math> <semantics>  <mrow>   <msub>    <mi>&#x03C1;</mi>    <mrow>     <msub>      <mtext>&#x200B;</mtext>      <mrow>       <mtext>&#x200B;</mtext><mtext>&#x200B;</mtext><mi>H</mi></mrow>     </msub>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>n</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>)</mo><mo>&#x2192;</mo><mn>0</mn><mtext>&#x00A0;&#x00A0;&#x00A0;as&#x00A0;&#x00A0;</mtext><mi>n</mi><mo>&#x2192;</mo><mi>&#x221E;</mi><mo>.</mo></mrow>   </semantics></math></disp-formula><p>If so, the maps (23) continue to describe the asymptotic properties of <math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>. In particular, such a situation occurs where <math> <semantics>  <mi>f</mi>   </semantics></math> satisfies (iii). Then (v) holds and the sequence (23) is periodic. Consequently, (24) holds true regardless of whether (vv) holds or not.</p>
<p></p>
<p>As an example, we again take the logistic parabola <math> <semantics>  <mrow>   <mi>&#x03B7;</mi><mo>:</mo><mi>z</mi><mo>&#x21A6;</mo><msub>    <mi>&#x03BB;</mi>    <mo>*</mo>   </msub>   <mi>z</mi><mo stretchy='false'>(</mo><mn>1</mn><mo>&#x2212;</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>, where the parameter value <math> <semantics>  <mrow>   <msub>    <mi>&#x03BB;</mi>    <mo>&#x2217;</mo>   </msub>   <mrow><mo>(</mo>    <mrow>     <mo>&#x2248;</mo><mn>3.678</mn></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> is chosen so that the critical point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><mi>c</mi><mo>=</mo><mn>1</mn><mo>/</mo><mn>2</mn></mrow>   </semantics></math> is mapped onto the repelling fixed point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><mi>&#x03B3;</mi></mrow>   </semantics></math> in three iterations, i.e., <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mn>3</mn>   </msup>   <mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>&#x03B3;</mi></mrow>   </semantics></math> (seeFigure <xref ref-type="fig" rid="fig9"> 9</xref>(b)). In this case, the domain of influence of each <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>]</mo></mrow>   </semantics></math> is an interval. Namely, setting <math> <semantics>  <mrow>   <msub>    <mi>c</mi>    <mn>1</mn>   </msub>   <mo>=</mo><mi>&#x03B7;</mi><mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>c</mi>    <mn>2</mn>   </msub>   <mo>=</mo><msup>    <mi>&#x03B7;</mi>    <mn>2</mn>   </msup>   <mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo><mo>,</mo></mrow>   </semantics></math> we get that <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>&#x03B7;</mi>   </msub>   <mo stretchy='false'>(</mo><mn>0</mn><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>Q</mi>    <mi>&#x03B7;</mi>   </msub>   <mo stretchy='false'>(</mo><mn>1</mn><mo stretchy='false'>)</mo><mo>=</mo><mo stretchy='false'>[</mo><mn>0</mn><mo>,</mo><msub>    <mi>c</mi>    <mn>1</mn>   </msub>   <mo stretchy='false'>]</mo></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mi>&#x03B7;</mi>   </msub>   <mrow><mo>(</mo>    <mi>Z</mi>   <mo>)</mo></mrow><mo>=</mo><mrow><mo>[</mo> <mrow>    <msub>     <mi>c</mi>     <mi>z</mi>    </msub>    <mo>,</mo><msub>     <mi>c</mi>     <mn>1</mn>    </msub>    </mrow> <mo>]</mo></mrow></mrow>   </semantics></math> for <math> <semantics>  <mrow>   <mi>z</mi><menclose notation='updiagonalstrike'>    <mo>=</mo>   </menclose>   <mn>0</mn><mo>,</mo><mn>1</mn></mrow>   </semantics></math>, where <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <msub>     <mi>c</mi>     <mn>2</mn>    </msub>    <mo>,</mo><msub>     <mi>c</mi>     <mn>1</mn>    </msub>    </mrow> <mo>]</mo></mrow></mrow>   </semantics></math> absorbs all <math> <semantics>  <mrow>   <mi>z</mi><mo>&#x2208;</mo><mo stretchy='false'>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy='false'>)</mo></mrow>   </semantics></math>, each after finitely many iterations, and <math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <msub>     <mi>c</mi>     <mn>2</mn>    </msub>    <mo>,</mo><msub>     <mi>c</mi>     <mn>1</mn>    </msub>    </mrow> <mo>]</mo></mrow></mrow>   </semantics></math> can be split into two adjoint intervals: <math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mn>1</mn>   </msub>   <mo>=</mo><mrow><mo>[</mo> <mrow>    <mi>&#x03B3;</mi><mo>,</mo><msub>     <mi>c</mi>     <mn>1</mn>    </msub>    </mrow> <mo>]</mo></mrow></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mn>2</mn>   </msub>   <mo>=</mo><mrow><mo>[</mo> <mrow>    <msub>     <mi>c</mi>     <mn>2</mn>    </msub>    <mo>,</mo><mi>&#x03B3;</mi></mrow> <mo>]</mo></mrow></mrow>   </semantics></math> that passe into each other under <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> (seeFigure <xref ref-type="fig" rid="fig9"> 9</xref>(a)). It follows that <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math>, which is structurally unstable, satisfies (iii), and hence <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   </mrow>   </semantics></math> exists (seeFigure <xref ref-type="fig" rid="fig9"> 9</xref>(b)) and has the form (16) with <math> <semantics>  <mrow>   <mi>p</mi><mo>=</mo><mn>1</mn></mrow>   </semantics></math>, namely,</p>

<inline-formula><math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mrow><mo>(</mo>    <mi>z</mi>   <mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <mrow><mo>[</mo> <mrow>       <mn>0</mn><mo>,</mo><msub>        <mi>c</mi>        <mn>1</mn>       </msub>       </mrow> <mo>]</mo></mrow><mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>=</mo><mn>0</mn><mo>,</mo><mi>z</mi><mo>=</mo><mn>1</mn><mo>;</mo>     </mtd>    </mtr>    <mtr>     <mtd>      <msub>       <mi>J</mi>       <mi>n</mi>      </msub>      <mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mi>z</mi><mo>&#x2208;</mo><msub>       <mo>&#x222A;</mo>       <mrow>        <mi>j</mi><mo>&#x2265;</mo><mn>0</mn></mrow>      </msub>      <mtext>&#x00A0;</mtext><mi>int</mi><msup>       <mi>f</mi>       <mrow>        <mo>&#x2212;</mo><mn>2</mn><mi>j</mi></mrow>      </msup>      <mrow><mo>(</mo>       <mrow>        <msub>         <mi>J</mi>         <mi>n</mi>        </msub>        </mrow>      <mo>)</mo></mrow><mo>,</mo><mtext>&#x00A0;</mtext><mi>n</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>;</mo>     </mtd>    </mtr>    <mtr>     <mtd>      <msub>       <mi>J</mi>       <mn>1</mn>      </msub>      <mo>&#x222A;</mo><msub>       <mi>J</mi>       <mn>2</mn>      </msub>      <mo>,</mo><mtext>&#x00A0;&#x00A0;in&#x00A0;other&#x00A0;cases</mtext><mtext>.</mtext>     </mtd>    </mtr>   </mtable>    </mrow></mrow>   </semantics></math></inline-formula><p>But the condition (vv): <math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo><mo>=</mo><mo>&#x2205;</mo></mrow>   </semantics></math> is violated because of the critical point <math> <semantics>  <mrow>   <mi>z</mi><mo>=</mo><mi>c</mi><mo>=</mo><mn>1</mn><mo>/</mo><mn>2</mn></mrow>   </semantics></math>. Indeed, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>J</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><msub>    <mi>&#x03C9;</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mn>2</mn>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>&#x03B3;</mi><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>J</mi>    <mn>1</mn>   </msub>   <mo>&#x222A;</mo><msub>    <mi>J</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>. Therefore the critical point belongs to <math> <semantics>  <mrow>   <msub>    <mi mathvariant='script'>Q</mi>    <menclose notation='updiagonalstrike'>     <mo>=</mo>    </menclose>       </msub>   <mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> (the same goes for its inverse images). The result is that</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x03B7;</mi><mo stretchy='false'>(</mo><msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>J</mi>    <mn>2</mn>   </msub>   <mo>,</mo><mtext>&#x00A0;&#x00A0;</mtext><msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><mi>&#x03B7;</mi><mo stretchy='false'>(</mo><mi>c</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo stretchy='false'>(</mo><msub>    <mi>c</mi>    <mn>1</mn>   </msub>   <mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>J</mi>    <mn>1</mn>   </msub>   <mo>&#x222A;</mo><msub>    <mi>J</mi>    <mn>2</mn>   </msub>   <mo>,</mo><mtext>&#x00A0;&#x00A0;&#x00A0;and&#x00A0;hence&#x00A0;&#x00A0;&#x00A0;</mtext><msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mi>&#x03B7;</mi><mo>&#x2260;</mo><mi>&#x03B7;</mi><mo>&#x2218;</mo><msup>    <mi>&#x03B7;</mi>    <mi>&#x0394;</mi>   </msup>   <mo>.</mo></mrow>   </semantics></math></inline-formula><p>But even so, the ``limit'' property (24) holds for <math> <semantics>  <mi>&#x03B7;</mi>   </semantics></math> (this can be checked directly or by using <math> <semantics>  <mrow>   <msup>    <mi>&#x03B7;</mi>    <mi>n</mi>   </msup>   <mo stretchy='false'>(</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mi>n</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo><mo stretchy='false'>)</mo><mo>=</mo><msub>    <mi>Q</mi>    <mrow>     <msup>      <mi>&#x03B7;</mi>      <mi>n</mi>     </msup>     </mrow>   </msub>   <mo stretchy='false'>(</mo><mi>z</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math>). Since the sequence <math> <semantics>  <mrow>   <msub>    <mrow>     <mo>&#x007B;</mo><msup>      <mi>&#x03B7;</mi>      <mi>n</mi>     </msup>     <mo>&#x2218;</mo><msup>      <mi>&#x03B7;</mi>      <mi>&#x0394;</mi>     </msup>     <mo>&#x007D;</mo></mrow>    <mi>n</mi>   </msub>   </mrow>   </semantics></math> is periodic with period <math> <semantics>  <mn>2</mn>   </semantics></math>.</p>
<fig id="fig9">
<label>Figure 9</label>
<caption>
<p>Example of a map that generates a semigroup does not having a limit semigroup (although its associated resolvent map exists).</p>
</caption>
<graphic xlink:href="468.fig.009" />
</fig><p>Based on these facts, we arrive at the following generalization of the limit semigroup notion. To the iterative sequence <math> <semantics>  <mrow>   <mi>i</mi><mi>d</mi><mo>,</mo><mtext>&#x00A0;</mtext><mi>f</mi><mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><mo>&#x2026;</mo></mrow>   </semantics></math>, whose elements form the semigroup~<math> <semantics>  <mrow>   <mo>&#x2329;</mo><mi>f</mi><mo>&#x232A;</mo></mrow>   </semantics></math>, we assign the sequence (23) and call it the <italic>limit sequence</italic> in <math> <semantics>  <mrow>   <mi>S</mi><mi>C</mi><mo stretchy='false'>(</mo><mi>I</mi><mo>,</mo><mi>I</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> if it is periodic or almost periodic and has the ``limit'' property (24).</p>
<p></p>
<p>As the proof of Theorem 6 shows, the sequence (23) has the property (24) only if <math> <semantics>  <mrow>   <msub>    <mrow>     <mtext>Lim</mtext></mrow>    <mrow>     <mi>k</mi><mo>&#x2192;</mo><mi>&#x221E;</mi></mrow>   </msub>   <msup>    <mi>f</mi>    <mrow>     <mi>n</mi><mo>+</mo><mi>k</mi><mo>!</mo></mrow>   </msup>   </mrow>   </semantics></math> is uniform in <math> <semantics>  <mrow>   <mi>n</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>&#x2026;</mo></mrow>   </semantics></math> The uniformity of the limit is ensured by LSG-conditions (v),(vv). But they are not necessary, in particular, if <math> <semantics>  <mi>f</mi>   </semantics></math> satisfies (iii), then the uniformity follows from the periodicity of (23) (here (v) is met automatically and (vv) is optional). Thus, generally speaking, (24) needs verification.</p>
<p></p>
<p>Interestingly, the ``alternative'' sequence <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mi>f</mi><mo>,</mo><mtext>&#x00A0;</mtext><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><msup>    <mi>f</mi>    <mn>2</mn>   </msup>   <mo>,</mo><mtext>&#x00A0;&#x00A0;</mtext><mo>&#x2026;</mo></mrow>   </semantics></math>cannot be regarded as a limit sequence, of course except where <math> <semantics>  <mrow>   <msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>&#x2218;</mo><mi>f</mi><mo>=</mo><mi>f</mi><mo>&#x2218;</mo><msup>    <mi>f</mi>    <mi>&#x0394;</mi>   </msup>   <mo>.</mo></mrow>   </semantics></math></p>
<p></p>
</sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      
<ref id="R1">
<label>[1]</label>
<mixed-citation publication-type="other">Yu. S. Bogdanov, On the functional equation <math> <semantics>  <mrow>   <msup>    <mi>x</mi>    <mi>n</mi>   </msup>   <mo>=</mo><mi>t</mi></mrow>   </semantics></math>, Reports of the Academy of Sciences of the BSSR 5 (1961), pp. 235-237 (in Russian).
</mixed-citation>
</ref>
<ref id="R2">
<label>[2]</label>
<mixed-citation publication-type="other">I.U. Bronstein, Extensions of Minimal Transformation Groups, Springer, Dordrecht, 1979.
</mixed-citation>
</ref>
<ref id="R3">
<label>[3]</label>
<mixed-citation publication-type="other">R. Ellis, A semigroup associated with a transformation group, Trans. Amer. Math. Soc. 94 (1960), pp. 272-281.
</mixed-citation>
</ref>
<ref id="R4">
<label>[4]</label>
<mixed-citation publication-type="other">R. Ellis, Lectures on Topological Dynamics, W. A. Benjamin Inc., New York, 1969.
</mixed-citation>
</ref>
<ref id="R5">
<label>[5]</label>
<mixed-citation publication-type="other">V. V. Fedorenko, Simple dynamics of the interval maps, Preprint 186, Centre de recerca matematica Instut d'estudis Catalans, Barcelona (1993).
</mixed-citation>
</ref>
<ref id="R6">
<label>[6]</label>
<mixed-citation publication-type="other">V. V. Fedorenko, Topological limit of trajectories of intervals of simplest one-dimensional dynamical systems, Ukrainian Math. J. 54 (2002), pp. 527-532.
</mixed-citation>
</ref>
<ref id="R7">
<label>[7]</label>
<mixed-citation publication-type="other">E. Yu. Romanenko, Attractors of continuous difference equations, Computers and Math. with Appl. 36 (1998), pp. 377-390.
</mixed-citation>
</ref>
<ref id="R8">
<label>[8]</label>
<mixed-citation publication-type="other">O. Yu. Romanenko, Difference Equations With Continuous Argument, Kyiv: Institute of Math- ematics (National Academy of Sciences, Ukraine), 2014 (in Russian).
</mixed-citation>
</ref>
<ref id="R9">
<label>[9]</label>
<mixed-citation publication-type="other">A. N. Sharkovsky, On cycles and the structure of a continuous map, Ukrainskyi Matematychnyi Zhurnal 1965, pp. 104-111 (in Russian).
</mixed-citation>
</ref>
<ref id="R10">
<label>[10]</label>
<mixed-citation publication-type="other">A. N. Sharkovsky, Behaviour of a map in the vicinity of an attracting set, Ukrainskyi Matem- atychnyi Zhurnal 18 (1966), pp. 60-83 (in Russian).
</mixed-citation>
</ref>
<ref id="R11">
<label>[11]</label>
<mixed-citation publication-type="other">A. N. Sharkovsky, Yu. L. Maistrenko, and E. Yu. Romanenko, Difference Equations and Their Applications, Dordrecht: Kluwer Academic Publishers, 1993.
</mixed-citation>
</ref>
<ref id="R12">
<label>[12]</label>
<mixed-citation publication-type="other">A. N. Sharkovsky, Attractors of trajectories and their basins, Kyiv: Naukova Dumka, 2013 (in Russian).
</mixed-citation>
</ref>
<ref id="R13">
<label>[13]</label>
<mixed-citation publication-type="other">A. N. Sharkovsky and E. Yu. Romanenko, Turbulence: Ideal, Encyclopedia of Nonlinear Sci- ence, Alwyn Scott, ed., Routledge, New York and London, 2005, pp. 955-957.
</mixed-citation>
</ref>
<ref id="R14">
<label>[14]</label>
<mixed-citation publication-type="other">A. N. Sharkovsky, and E. Yu. Romanenko,Ideal turbulence: fractal and stochastic attractors of trajectories in idealised models of mathematical physics, Kyiv: Institute of Mathematics (National Academy of Sciences, Ukraine), 2020 (in Ukrainian, in Russian).
</mixed-citation>
</ref>
    </ref-list>
  </back>
</article>