<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Appl. Math. Stat.</journal-id>
<journal-title>Frontiers in Applied Mathematics and Statistics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Appl. Math. Stat.</abbrev-journal-title>
<issn pub-type="epub">2297-4687</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fams.2024.1387012</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Applied Mathematics and Statistics</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Expand-contract plasticity on the real line</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Langemann</surname> <given-names>Dirk</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Zavarzina</surname> <given-names>Olesia</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2645435/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Institute of Partial Differential Equations, Technische Universit&#x000E4;t Braunschweig</institution>, <addr-line>Braunschweig</addr-line>, <country>Germany</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Mathematics and Informatics, V.N. Karazin Kharkiv National University</institution>, <addr-line>Kharkiv</addr-line>, <country>Ukraine</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Kateryna Buryachenko, Humboldt University of Berlin, Germany</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Ivan Kovalyov, Osnabr&#x000FC;ck University, Germany</p>
<p>Evgeniy Petrov, Institute of Applied Mathematics and Mechanics (NAN Ukraine), Ukraine</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Olesia Zavarzina <email>olesia.zavarzina&#x00040;yahoo.com</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>21</day>
<month>03</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>10</volume>
<elocation-id>1387012</elocation-id>
<history>
<date date-type="received">
<day>16</day>
<month>02</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>03</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2024 Langemann and Zavarzina.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Langemann and Zavarzina</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license></permissions>
<abstract>
<p>The study deals with plastic and non-plastic sub-spaces <italic>A</italic> of the real-line &#x0211D; with the usual Euclidean metric <italic>d</italic>. It investigates non-expansive bijections, proves properties of such maps, and demonstrates their relevance by hands of examples. Finally, it is shown that the plasticity property of a sub-space <italic>A</italic> contains at least two complementary questions, a purely geometric and a topological one. Both contribute essential aspects to the plasticity property and get more critical in higher dimensions and more abstract metric spaces.</p></abstract>
<kwd-group>
<kwd>metric space</kwd>
<kwd>non-expansive map</kwd>
<kwd>plastic space</kwd>
<kwd>expand-contract plasticity</kwd>
<kwd>Banach space</kwd>
</kwd-group>
<counts>
<fig-count count="3"/>
<table-count count="0"/>
<equation-count count="26"/>
<ref-count count="14"/>
<page-count count="8"/>
<word-count count="5117"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Numerical Analysis and Scientific Computation</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Here, we investigate properties of plastic metric spaces. Shortly speaking, a metric space is plastic if every non-expansive bijection is an isometry, cf. Section 2.</p>
<p>We will observe that the plasticity property consists of a geometrical sub-problem and a topological sub-problem. That is the reason why plasticity of a metric space, which can be easily defined, evolves as a challenging mathematical problem. In particular, we observe that the plasticity of a metric space is not inherited from sup-spaces, i. e., from including spaces, and it does not inherit to sub-spaces, i. e., to included spaces.</p>
<p>In this study, we concentrate on metric spaces which are sub-spaces of the real axis, and in this apparently simple situation, the typical difficulties come to the light.</p>
<p>The probably first study devoted to the plasticity problem is the study mentioned in the reference [<xref ref-type="bibr" rid="B1">1</xref>]; however, the term &#x00022;plasticity&#x00022; appeared much later and the problem itself remained unnoticed for several decades. A short literature survey and the information about the current progress in solution of the problem are shown in Section 2.2.</p>
<p>The study is organized as follows. Section 2 introduces the basic concepts and illustrates the existence of non-expansive bijections in the case that the metric space is a union of closed intervals. This case demonstrates the geometrical aspects of the problem. Then, Section 3 discusses the plasticity of metric spaces by means of metric spaces which are unbounded sequences of points, investigates the relevance of accumulation points and continuous subsets, and attacks the more topological parts of the plasticity concept. Finally, Section 4 resumes the observations and gives a short outlook to further research.</p></sec>
<sec id="s2">
<title>2 Basic concepts</title>
<p>We denote a metric space by (<italic>A, d</italic>) where <italic>A</italic> is the set of points and <italic>d</italic> : <italic>A</italic> &#x000D7; <italic>A</italic> &#x02192; &#x0211D;<sub>&#x0002B;</sub> &#x0003D; {<italic>x</italic> &#x02208; &#x0211D;: <italic>x</italic> &#x02265; 0} is the distance obeying the known axioms of positivity, symmetry, non-degeneracy, and the triangle inequality.</p>
<sec>
<title>2.1 Non-expansive maps</title>
<p>A map &#x003C6;: <italic>A</italic>&#x02192;<italic>A</italic> from the metric space <italic>A</italic> into itself is called non-expansive if</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext class="textrm" mathvariant="normal">&#x000A0;for all&#x000A0;</mml:mtext><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>is fulfilled. If the equality holds for all pairs <italic>x, y</italic> &#x02208; <italic>A</italic>, &#x003C6; is an isometry.</p>
<p>The condition in <xref ref-type="disp-formula" rid="E1">Equation (1)</xref> is equivalent to the Lipschitz-continuity of the map &#x003C6; on <italic>A</italic> with Lipschitz constant 1. Thus, a non-expansive &#x003C6; is also continuous on <italic>A</italic>.</p>
<p>We will investigate metric spaces <italic>A</italic> &#x02286; <italic>A</italic><sub>ex</sub> which are embedded in a metric sup-space (<italic>A</italic><sub>ex</sub>, <italic>d</italic><sub>ex</sub>) because the space <italic>A</italic><sub>ex</sub> might be known and well understood, and thus, its points or rather a selection of them serve as elements of <italic>A</italic>. Now, it is obvious that the restriction of the metric space (<italic>A</italic><sub>ex</sub>, <italic>d</italic><sub>ex</sub>) to the set <italic>A</italic> leads to the metric space (<italic>A, d</italic>) by the restriction of the distance <italic>d</italic> &#x0003D; <italic>d</italic><sub>ex</sub>|<sub><italic>A</italic>&#x000D7;<italic>A</italic></sub> to the set <italic>A</italic>. It is less obvious whether a metric space (<italic>A, d</italic>) can be extended to a sup-set <italic>A</italic><sub>ex</sub> by choosing an appropriate <italic>d</italic><sub>ex</sub>. However, it is always possible, to choose a function <inline-formula><mml:math id="M2"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x02192;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula>, which fulfills the properties of symmetry, non-degeneracy, and positivity with <inline-formula><mml:math id="M3"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>d</mml:mi></mml:math></inline-formula>, which of course is not a metric in general. Then, we can define the metric</p>
<disp-formula id="E2"><mml:math id="M4"><mml:mrow><mml:msub><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">inf</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo class="qopname">&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo class="qopname">^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>as the infimum over all possible paths of arbitrary length between <italic>x</italic> and <italic>y</italic>. However, such a metric <inline-formula><mml:math id="M5"><mml:msub><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> may not really be an extension. As in the real life, if one builds a new paths, which are shorter, the old ones may no longer be used. In our notation, this means that it may happen <inline-formula><mml:math id="M6"><mml:msub><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> for some <italic>x, y</italic> &#x02208; <italic>A</italic>.</p>
<p>Nevertheless, one may define a real extension <italic>d</italic><sub>ex</sub> of the metric <italic>d</italic>, which is more artificial and a bit similar to the French railways metric in the following way. Let us fix a point <italic>x</italic><sub>0</sub> of the set <italic>A</italic> and define an arbitrary metric <italic>d</italic><sub><italic>A</italic><sub>ex</sub></sub> on the set (<italic>A</italic><sub>ex</sub>\<italic>A</italic>) &#x0222A; {<italic>x</italic><sub>0</sub>}, which might be the discrete metric or any other metric. Although less intuitive, the needed extension is</p>
<disp-formula id="E3"><mml:math id="M7"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x02216;</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0222A;</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#x0007D;</mml:mo><mml:mo>;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>x</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x02216;</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow> </mml:mrow></mml:math></disp-formula>
<p>existing and easily available. Therefore, we will not distinguish between <italic>d</italic><sub>ex</sub> and <italic>d</italic> in the following but use the distance <italic>d</italic> in the extended metric space and sub-space.</p>
<p>Oppositely, it is not evident whether the existence of a non-expansive map &#x003C6;<sub>ex</sub>: <italic>A</italic><sub>ex</sub> &#x02192; <italic>A</italic><sub>ex</sub> provides a non-expansive map &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> because the simple restriction &#x003C6; &#x0003D; &#x003C6;<sub>ex</sub>|<italic>A</italic>, although still Lipschitz continuous, is not necessarily a map into <italic>A</italic>. It might happen that the image im&#x003C6; &#x0003D; &#x003C6;(<italic>A</italic>) &#x02286; <italic>A</italic><sub>ex</sub> is not a subset of <italic>A</italic>. The opposite question whether a non-expansive &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> can be extended to a non-expansive map on the extended space <italic>A</italic><sub>ex</sub> is the question about the extension of Lipschitz maps, preserving the Lipschitz constant. In particular, it is always possible for real-valued functions according to McShane&#x00027;s extension theorem [<xref ref-type="bibr" rid="B2">2</xref>]. For functions from a subset of &#x0211D;<sup><italic>n</italic></sup> to &#x0211D;<sup><italic>n</italic></sup>, the extension to the whole Euclidean space is possible due to Kirszbraun&#x00027;s theorem [<xref ref-type="bibr" rid="B3">3</xref>]. We will observe that non-expansive maps pose a lot of interesting questions and some of them can be answered.</p></sec>
<sec>
<title>2.2 Plastic metric spaces</title>
<p>Let us define a plastic metric space.</p>
<p>Definition 2.1. A metric space A is called expand-contract plastic (EC-plastic)&#x02014;or just plastic&#x02014;if every bijective non-expansive map &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> is an isometry.</p>
<p>Definition 2.1 defines a plastic metric space <italic>A</italic> via the non-existence of any non-expansive bijection of the metric space <italic>A</italic> to itself, which is not an isometry. Some simple examples are the non-plastic metric space <italic>A</italic> &#x0003D; &#x0211D; with the non-isometric non-expansive bijective map &#x003C6;: <italic>x</italic> &#x021A6; <italic>x</italic>/2 and the plastic metric space <italic>A</italic> &#x0003D; [0, 1] &#x02282; &#x0211D; with exactly the two non-expansive bijections &#x003C6;<sub>1</sub> &#x0003D; <italic>id</italic>. and &#x003C6;<sub>2</sub>: <italic>x</italic> &#x021A6; 1&#x02212;<italic>x</italic>, which are both isometries.</p>
<p>The only general result concerning plasticity of metric space states that every totally bounded metric space is plastic, see Naimpally et al. [<xref ref-type="bibr" rid="B4">4</xref>] for details. In fact, in the study mentioned in the reference [<xref ref-type="bibr" rid="B4">4</xref>], a more general result was obtained, i. e., so-called strong plasticity of totally bounded metric spaces was shown.</p>
<p>Definition 2.2. A metric space <italic>A</italic> is called strongly plastic if for every mapping &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> the existence of points <italic>x, y</italic> &#x02208; <italic>A</italic> with <italic>d</italic>(&#x003C6;(<italic>x</italic>), &#x003C6;(<italic>y</italic>)) &#x0003E; <italic>d</italic>(<italic>x, y</italic>) implies the existence of two points <inline-formula><mml:math id="M8"><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x0007E;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mi>&#x01EF9;</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi></mml:math></inline-formula> for which <inline-formula><mml:math id="M9"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x01EF9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">&#x0007E;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mi>&#x01EF9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> holds true.</p>
<p>This property and its uniform version were researched in the study mentioned in the reference [<xref ref-type="bibr" rid="B5">5</xref>]. It says that any expansion of a distance between two points implies the existence of two other points which are contracted by the map &#x003C6;. Observe it is extremely important not to interchange expansion and contraction.</p>
<p>In the study mentioned in the reference [<xref ref-type="bibr" rid="B6">6</xref>], the following intriguing question was posed.</p>
<p>Problem 2.3. Is it true, that the unit ball of an arbitrary Banach space is plastic?</p>
<p>Observe that in finite dimensions, this question is answered positively since in finite dimensions, the unit ball is compact and thus totally bounded. Moreover, the question is open only in the infinite dimensional case and the following more general problem.</p>
<p>Problem 2.4. For which pairs (<italic>X, Y</italic>) of Banach spaces, every bijective non-expansive map &#x003C6;: <italic>B</italic><sub><italic>X</italic></sub>(0) &#x02192; <italic>B</italic><sub><italic>Y</italic></sub>(0) between the unit balls is an isometry?</p>
<p>There are a number of relatively recent particular results, devoted to these problems, see Angosto et al. [<xref ref-type="bibr" rid="B7">7</xref>], Haller et al. [<xref ref-type="bibr" rid="B8">8</xref>], Kadets andd Zavarzina [<xref ref-type="bibr" rid="B9">9</xref>], Leo [<xref ref-type="bibr" rid="B10">10</xref>], and Zavarzina [<xref ref-type="bibr" rid="B11">11</xref>]. There exists also a circle of problems connected with plasticity property of the unit balls. In the study mentioned in the references [<xref ref-type="bibr" rid="B12">12</xref>] and [<xref ref-type="bibr" rid="B13">13</xref>], the so called linear expand-contract plasticity of ellipsoids in separable Hilbert spaces was studied, which means that only the linear non-expansive bijections were considered in the definition of plasticity.</p>
<p>Many natural questions concerning plasticity seem to have no answer or even have not yet been considered. In 2020, Behrends [<xref ref-type="bibr" rid="B14">14</xref>] draw attention to the fact that nobody studied the subsets of the real line with respect to the plasticity problem. He tried to attack this problem and received some results in this direction, however, decided not to publish them. Moreover, the following problem is still open.</p>
<p>Problem 2.5. What characterizes plastic sub-spaces of the real line &#x0211D; with the usual metric <italic>d</italic>?</p>
<p>In spite of the seeming simplicity of the question, it is not so easy to deal with. Let us first list the previously known results. As we mentioned before, the set &#x0211D; itself with the usual metric is not plastic. If one considers any bounded subset, it is already plastic due to its total boundedness.</p>
<p>On the other hand, it is easy to show that the set of integers &#x02124; with the same usual metric is plastic in spite of its unboundedness and the set &#x0211D;\&#x02124;. The proof of the plasticity of both mentioned spaces may be found in the study mentioned in the reference [<xref ref-type="bibr" rid="B4">4</xref>]. In the proof of plasticity of the set &#x0211D;\&#x02124;, one of the possible cases was missed; nevertheless, the statement is still correct.</p>
<p>Already, these examples show that there is no simple answer to the question whether a metric space is plastic or not. Rather we could give the interpretation that there are some critical points, e. g., the integers in these examples, which every non-expansive bijection &#x003C6; definitely has to pass, what relates to the geometry of the metric space <italic>A</italic>, and that there are some parts of the metric space which cannot be glued to each other such as singular points or open intervals, what relates to the topological aspects of plasticity. We observe that sub-spaces of the real axis are already sufficiently multifaceted to study the plasticity problem of metric spaces. The question whether more general metric spaces are plastic, provoke analogous difficulties, and again contain geometrical and topological aspects.</p>
<p>Here, we will generalize the known results and say something more about plastic sub-spaces of the real line. The previously mentioned results explain why we consider only unbounded sets in what follows.</p>
<p>All over the text, we use the notion <italic>d</italic> for the usual Euclidean metric <italic>d</italic>(<italic>x, y</italic>) &#x0003D; |<italic>x</italic> &#x02212; <italic>y</italic>| for <italic>x, y</italic> &#x02208; &#x0211D;. Round brackets denote open intervals (<italic>x, y</italic>) &#x0003D; {<italic>z</italic> &#x02208; &#x0211D;: <italic>x</italic> &#x0003C; <italic>z</italic> &#x0003C; <italic>y</italic>} and square brackets denote closed intervals [<italic>x, y</italic>] &#x0003D; {<italic>z</italic> &#x02208; &#x0211D;: <italic>x</italic> &#x02264; <italic>z</italic> &#x02264; <italic>y</italic>}.</p></sec>
<sec>
<title>2.3 A subset of the real axis</title>
<p>We have observed that the real axis &#x0211D; has sufficiently interesting metric sub-spaces for the investigation of plasticity. The Lipschitz condition in <xref ref-type="disp-formula" rid="E1">Equation (1)</xref> lets us easily decide whether a map &#x003C6;:&#x0211D; &#x02192; &#x0211D; is non-expansive or not&#x02014;just by the graph of the map &#x003C6;, see <xref ref-type="fig" rid="F1">Figure 1</xref>. Due to our considerations in Section 2.1, which is applied here with <italic>A</italic> as union of intervals and <italic>A</italic><sub>ex</sub> &#x0003D; &#x0211D;, the map &#x003C6; can be extended&#x02014;not necessarily in a unique manner&#x02014;as non-expansive function &#x003C6;<sub>ex</sub> on the entire axis &#x0211D;. Thus, &#x003C6;<sub>ex</sub> is continuous on &#x0211D;.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Non-expansive maps <italic>&#x003C6;</italic><sub>1</sub>, <italic>&#x003C6;</italic><sub>2</sub>, and <italic>id</italic>. and an expansive map &#x003C7; for a union <italic>A</italic> &#x02282; &#x0211D; of closed intervals of increasing length. The Cartesian product <italic>A</italic> &#x000D7; <italic>A</italic> is given in gray, and the bijections are black.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fams-10-1387012-g0001.tif"/>
</fig>
<p><xref ref-type="fig" rid="F1">Figure 1</xref> shows examples of bijective maps from the union of intervals <italic>A</italic> &#x0003D; &#x02026;&#x0222A;[<italic>a</italic><sub>2</sub>, <italic>a</italic><sub>3</sub>]&#x0222A;[<italic>a</italic><sub>4</sub>, <italic>a</italic><sub>5</sub>]&#x0222A;&#x02026; &#x02282; &#x0211D; onto itself. In this example, the closed interval and the interspaces have increasing lengths, in detail <italic>a</italic><sub>&#x02113;&#x0002B;1</sub>&#x02212;<italic>a</italic><sub>&#x02113;</sub> &#x02265; <italic>a</italic><sub>&#x02113;&#x02212;1</sub>&#x02212;<italic>a</italic><sub>&#x02113;&#x02212;2</sub> for all &#x02113; &#x02208; &#x02124;. Due to its continuity, every bijection &#x003C6; passes monotonically a rectangle in <italic>A</italic> &#x000D7; <italic>A</italic>. In this example, with increasing lengths of the respective intervals, we easily detect particular extensions &#x003C6;<sub>ex</sub>:&#x0211D; &#x02192; &#x0211D; with &#x003C6;<sub>ex</sub>|<sub><italic>A</italic></sub> &#x0003D; &#x003C6; and a slope bounded by 1 because the endpoints of the interspace could be used in <xref ref-type="disp-formula" rid="E1">Equation (1)</xref>. Hence, the functions <italic>id</italic>. and &#x003C6;<sub><italic>i</italic></sub>, <italic>i</italic> &#x0003D; 1, 2 below the diagonal are non-expansive, and the function &#x003C7; above the diagonal is expansive.</p></sec></sec>
<sec id="s3">
<title>3 Main results</title>
<p>Let us start with some interesting observations on simple situations of <italic>A</italic>, e. g., some sets of singular points.</p>
<p>Proposition 3.1. Let <inline-formula><mml:math id="M10"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi></mml:math></inline-formula> be an increasing sequence that obeys</p>
<disp-formula id="E4"><label>(2)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext class="textrm" mathvariant="normal">&#x000A0;for all&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x02124;</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>and</p>
<disp-formula id="E5"><label>(3)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext class="textrm" mathvariant="normal">&#x000A0;for at least one&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x02124;</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Then (<italic>A, d</italic>) is not plastic.</p>
<p><italic>Proof.</italic> The shift &#x003C6;: <italic>a</italic><sub><italic>i</italic></sub> &#x021A6; <italic>a</italic><sub><italic>i</italic>&#x02212;1</sub> is an example of a non-expansive bijection which is not an isometry.</p>
<p>Remark 3.2. The relation sign in <xref ref-type="disp-formula" rid="E4">Equations (2)</xref>, (<xref ref-type="disp-formula" rid="E5">3</xref>) might be commonly inverted so that the distances between two subsequent points of <italic>A</italic> decrease instead of increase, and the statement remains unchanged.</p>
<p>Furthermore, let us consider sets which are bounded from one side. Let us recall the definition of an accumulation point, which we will use in what follows.</p>
<p>Definition 3.3. An accumulation point (or limit point) of a set <italic>A</italic> in a metric space <italic>X</italic> is a point <italic>x</italic>, such that every neighborhood of <italic>x</italic> with respect to the metric on <italic>X</italic> contains a point of <italic>A</italic> which differs from the point <italic>x</italic>.</p>
<p>An accumulation point of a set <italic>A</italic> does not have to be an element of <italic>A</italic>. We will proceed with the following lemma.</p>
<p>Lemma 3.4. Let <italic>A</italic> &#x02282; &#x0211D; be a set without accumulation points which is bounded from one side. Let <italic>a</italic> be a minimal&#x02014;or maximal&#x02014;element of <italic>A</italic> and &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> be a bijective non-expansive map. Then &#x003C6;(<italic>a</italic>) &#x0003D; <italic>a</italic>.</p>
<p><italic>Proof</italic>. Without loss of generality, we may consider the case when <italic>a</italic> is a minimal element. Assume &#x003C6;(<italic>a</italic>) &#x02260; <italic>a</italic>. Then there is <italic>b</italic> &#x02208; <italic>A</italic> such that &#x003C6;(<italic>b</italic>) &#x0003D; <italic>a</italic>.</p>
<p>Claim: <italic>Let be</italic> <italic>c</italic> &#x02208; <italic>A</italic><italic>. Then</italic> <italic>c</italic> &#x02264; <italic>b</italic> <italic>implies</italic> &#x003C6;<sup><italic>n</italic></sup>(<italic>c</italic>) &#x02264; <italic>b</italic> <italic>for every</italic> <italic>n</italic> &#x02208; &#x02115;.</p>
<p><italic>Proof of the Claim:</italic> We will use the induction in <italic>n</italic>. Indeed, if &#x003C6;<sup><italic>n</italic></sup>(<italic>c</italic>) &#x02264; <italic>b</italic> and &#x003C6;<sup><italic>n</italic>&#x0002B;1</sup>(<italic>c</italic>) &#x0003E; <italic>b</italic> we have</p>
<disp-formula id="E6"><mml:math id="M13"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C6;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02265;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C6;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003E;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula>
<p><italic>This contradiction completes the proof of the Claim</italic>.</p>
<p>Since</p>
<disp-formula id="E7"><mml:math id="M14"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02265;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<p>we have &#x003C6;(<italic>a</italic>) &#x02264; <italic>b</italic>. Thus, the Claim provides &#x003C6;<sup><italic>n</italic></sup>(<italic>a</italic>) &#x02264; <italic>b</italic> for every <italic>n</italic> &#x02208; &#x02115;. Now, the segment [<italic>a, b</italic>] is a trap for those points, which were mapped there. Our aim is to find such a &#x0201C;trapped&#x0201D; point out of the interior of the segment [<italic>a, b</italic>] and show that this leads to a contradiction. There are only two possible cases.</p>
<p><bold>Case 1:</bold> &#x003C6;(<italic>a</italic>) &#x0003D; <italic>b</italic>. In this case, points <italic>a</italic> and <italic>b</italic> were swapped by &#x003C6;. Then, such a &#x0201C;trapped&#x0201D; point is the closest from the right-hand side point to <italic>b</italic>. There is <italic>c</italic> &#x0003E; <italic>b</italic> such that <italic>d</italic>(<italic>b, c</italic>) &#x0003C; <italic>d</italic>(<italic>b, d</italic>) for any <italic>d</italic> &#x0003E; <italic>b</italic>. Such point <italic>c</italic> exists since <italic>A</italic> is unbounded from above and there is no accumulation points. The point <italic>c</italic> cannot be mapped outside the segment [<italic>a, b</italic>] since it gives the contradiction with non-expansiveness of &#x003C6;.</p>
<p><bold>Case 2:</bold> &#x003C6;(<italic>a</italic>) &#x0003C; <italic>b</italic>. With such a condition, a &#x0201C;trapped&#x0201D; point is &#x003C6;(<italic>a</italic>) itself.</p>
<p>In both cases, we have a point <italic>t</italic> which does not belong to the interior of the segment [<italic>a, b</italic>] such that &#x003C6;(<italic>t</italic>) belongs to this interior. Consider an orbit of this point <italic>t</italic>, i. e., the set <inline-formula><mml:math id="M15"><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C6;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. Due to the bijectivity of &#x003C6;, this orbit does not have repeating elements. Thus, we have obtained a bounded infinite subset in <italic>A</italic> which contradicts the fact that <italic>A</italic> does not have accumulation points.</p>
<p>Remark 3.5. The condition about the absence of accumulation points in Lemma 3.4 cannot be omitted.</p>
<p>This remark is confirmed by the following example.</p>
<p>Example 3.6. Let <italic>A</italic> &#x0003D; &#x02124;<sub>&#x0002B;</sub> &#x0222A; <italic>Q</italic>, where <inline-formula><mml:math id="M16"><mml:mi>Q</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x02265;</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula>. The bijective non-expansive map &#x003C6; is</p>
<disp-formula id="E8"><mml:math id="M17"><mml:mi>&#x003C6;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>a</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x02115;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>4</mml:mn></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>4</mml:mn></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:mo>&#x02208;</mml:mo><mml:mi>Q</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow> </mml:mrow></mml:math></disp-formula>
<p>We observe that &#x003C6; is bijective and it does not save the minimal element of <italic>A</italic>. We check that it is non-expansive.</p>
<list list-type="order">
<list-item><p>For all <italic>a, b</italic> &#x02208; &#x02115;, the isometry <italic>d</italic>(&#x003C6;(<italic>a</italic>), &#x003C6;(<italic>b</italic>)) &#x0003D; <italic>d</italic>(<italic>a, b</italic>) is valid.</p></list-item>
<list-item><p>For <italic>a</italic> &#x02208; &#x02115;, <italic>b</italic> &#x0003D; 0, it holds <inline-formula><mml:math id="M18"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mi>a</mml:mi><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>&#x0003C;</mml:mo><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p>For <italic>a</italic> &#x02208; &#x02115;, <inline-formula><mml:math id="M19"><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x02208;</mml:mo><mml:mi>Q</mml:mi></mml:math></inline-formula>, we have <inline-formula><mml:math id="M20"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mi>a</mml:mi><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>&#x0003C;</mml:mo><mml:mo>|</mml:mo><mml:mi>a</mml:mi><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p>For <italic>a</italic> &#x0003D; 0, <inline-formula><mml:math id="M21"><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x02208;</mml:mo><mml:mi>Q</mml:mi></mml:math></inline-formula>, it holds <inline-formula><mml:math id="M22"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>&#x0003C;</mml:mo><mml:mo>|</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>|</mml:mo><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p>In the case <inline-formula><mml:math id="M23"><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x02208;</mml:mo><mml:mi>Q</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M24"><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x02208;</mml:mo><mml:mi>Q</mml:mi></mml:math></inline-formula>, without loss of generality we may assume <italic>n</italic>&#x0003C;<italic>m</italic>. Then</p>
<p><disp-formula id="E9"><mml:math id="M25"><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x0003C;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p></list-item>
</list>
<p>The described set is shown on the left of <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p><bold>(Left)</bold> Illustration of Example 3.6. <bold>(Right)</bold> Illustration of Example 3.8. The gray dots on the axes indicate <italic>A</italic>. The black dots mark the respective bijection. Clearly, no connection of two points has a slope larger than 1.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fams-10-1387012-g0002.tif"/>
</fig>
<p>Lemma 3.4 immediately implies the following corollary.</p>
<p>Corollary 3.7. Let <italic>A</italic> &#x02282; &#x0211D; be an unbounded set without accumulation points. Let <italic>A</italic> have a minimal or maximal element and let &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> be a bijective non-expansive map. Then, &#x003C6; is an isometry, moreover, the identity.</p>
<p><italic>Proof</italic>. Without loss of generality, we may consider the case when <italic>a</italic> is a minimal element. Let us show that &#x003C6;(<italic>x</italic>) &#x0003D; <italic>x</italic> for every <italic>x</italic> &#x02208; <italic>A</italic>. Indeed, for the minimal element <italic>a</italic>, Lemma 3.4 ensures that &#x003C6;(<italic>a</italic>) &#x0003D; <italic>a</italic>. Now suppose for some fixed <italic>y</italic> &#x02208; <italic>A</italic>, the condition &#x003C6;(<italic>x</italic>) &#x0003D; <italic>x</italic> holds for every <italic>x</italic> &#x0003C; <italic>y, x</italic> &#x02208; <italic>A</italic>. Consider</p>
<disp-formula id="E10"><mml:math id="M26"><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mo>\</mml:mo><mml:mrow><mml:mo stretchy="true">{</mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:munder></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
<p>Then, &#x003C6;|<sub><italic>A</italic><sub>1</sub></sub>: <italic>A</italic><sub>1</sub> &#x02192; <italic>A</italic><sub>1</sub> is a bijective non-expansive map, and <italic>y</italic> is a minimal element. Then &#x003C6;(<italic>y</italic>) &#x0003D; <italic>y</italic> due to Lemma 3.4.</p>
<p>Proposition 4.1 in Naimpally et al. [<xref ref-type="bibr" rid="B4">4</xref>] states that for convex (in the sense of the same study) metric spaces, hereditarily EC-plasticity implies boundedness. Moreover, for convex subsets in Euclidean &#x0211D;<sup><italic>n</italic></sup>, hereditarily EC-plasticity and boundedness are equivalent. However, the authors note that convexity is a too strong condition.</p>
<p>In Naimpally et al. [<xref ref-type="bibr" rid="B4">4</xref>], Theorem 4.3 states that an unbounded metric space with at least one accumulation point contains a non-plastic subspace. Corollary 3.7 demonstrates that the presence of an accumulation point is essential in the mentioned theorem, since it allows to build examples of unbounded hereditarily plastic spaces.</p>
<p>Let us go back to Example 3.6 and remark another interesting property of non-expansive bijections on &#x0211D;. Suppose we have a set <italic>A</italic> &#x02282; &#x0211D; and a function &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic>. We will say that &#x003C6; preserves the relation &#x0201C;between&#x0201D; on the set <italic>A</italic> if for any <italic>x, y, z</italic> &#x02208; <italic>A</italic> with <italic>x</italic> &#x0003C; <italic>y</italic> &#x0003C; <italic>z</italic> we have &#x003C6;(<italic>x</italic>) &#x0003C; &#x003C6;(<italic>y</italic>) &#x0003C; &#x003C6;(<italic>z</italic>). Example 3.6 shows that non-expansive bijections do not have to preserve the relation &#x0201C;between.&#x0201D; Surprisingly, there is an example demonstrating the same property with a set without any accumulation points.</p>
<p>Example 3.8. Let <italic>A</italic> &#x0003D; &#x02115; &#x0222A; <italic>Q</italic>, where <italic>Q</italic> &#x0003D; {2<italic>k, k</italic> &#x02208; &#x02124;<sub>&#x02212;</sub>}. The bijective non-expansive map &#x003C6; is defined by</p>
<disp-formula id="E11"><mml:math id="M27"><mml:mi>&#x003C6;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>a</mml:mi><mml:mo>+</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>if&#x000A0;</mml:mtext><mml:mi>a</mml:mi><mml:mo>&#x02264;</mml:mo><mml:mo>&#x02212;</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>a</mml:mi><mml:mo>+</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>otherwise</mml:mtext><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow> </mml:mrow></mml:math></disp-formula>
<p>The map &#x003C6; does not preserve the relation &#x0201C;between&#x0201D; since &#x02212;4 &#x0003C; &#x02212;2 &#x0003C; 0 but &#x003C6;(&#x02212;2) &#x0003C; &#x003C6;(&#x02212;4) &#x0003C; &#x003C6;(0). Let us check that &#x003C6; is non-expansive.</p>
<list list-type="order">
<list-item><p>If both <italic>a, b</italic> &#x02265; &#x02212;2 or both <italic>a, b</italic> &#x02264; &#x02212;4, the non-expansiveness of &#x003C6; is obvious.</p></list-item>
<list-item><p>If <italic>a</italic> &#x02265; &#x02212;2 and <italic>b</italic> &#x02264; &#x02212;4, <italic>d</italic>(&#x003C6;(<italic>a</italic>), &#x003C6;(<italic>b</italic>)) &#x0003D; |<italic>a</italic>&#x02212;<italic>b</italic>&#x02212;3| &#x02264; |<italic>a</italic>&#x02212;<italic>b</italic>| &#x0003D; <italic>d</italic>(<italic>a, b</italic>). Only for <italic>a</italic> &#x0003D; &#x02212;2 and <italic>b</italic> &#x0003D; &#x02212;4, the inequality <italic>a</italic>&#x02212;<italic>b</italic> &#x0003C; 3 is valid, but even in this case, the previous inequality is true.</p></list-item>
</list>
<p>The described set is shown on the right of <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<p>Furthermore, we are going to present a sufficient condition for a set in &#x0211D; to be plastic. Let us introduce the set</p>
<disp-formula id="E12"><mml:math id="M28"><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x0211D;</mml:mi><mml:mo>:</mml:mo><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext class="textrm" mathvariant="normal">&#x000A0;for some&#x000A0;</mml:mtext><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi><mml:mtext class="textrm" mathvariant="normal">&#x000A0;with&#x000A0;</mml:mtext><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x02229;</mml:mo><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula>
<p>Obviously, several pairs of points may be situated in the same distance. That is why for every <italic>p</italic> &#x02208; <italic>D</italic><sub><italic>A</italic></sub>, we call its multiplicity the number of pairs of points in <italic>A</italic> which are on the distance <italic>p</italic>. This multiplicity may be finite or infinite.</p>
<p>Theorem 3.9. Let <italic>A</italic> &#x02282; &#x0211D; has no accumulation points and let <italic>D</italic><sub><italic>A</italic></sub> has a maximal element of finite multiplicity or a minimal element of finite multiplicity. Then, (<italic>A, d</italic>) is a plastic metric space.</p>
<p><italic>Proof</italic>. Without loss of generality, we may assume that <italic>D</italic><sub><italic>A</italic></sub> has a minimal element <italic>a</italic> &#x02208; &#x0211D; of finite multiplicity <italic>k</italic> &#x02208; &#x02115;. Let us denote</p>
<disp-formula id="E13"><mml:math id="M29"><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>k</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula>
<p>Let us take <italic>x</italic><sub><italic>i</italic></sub> &#x02264; <italic>x</italic><sub><italic>j</italic></sub> for all <italic>i, j</italic> with 1 &#x02264; <italic>i</italic> &#x0003C; <italic>j</italic> &#x02264; 2<italic>k</italic>. Consider an arbitrary non-expansive bijection &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic>. Due to the non-expansiveness of &#x003C6;, we may conclude that &#x003C6; maps <italic>X</italic><sub><italic>a</italic></sub> bijectively onto itself. Thus, &#x003C6;|<sub><italic>X</italic><sub><italic>a</italic></sub></sub> is an isometry on <italic>X</italic><sub><italic>a</italic></sub>. In particular, we find <italic>d</italic>(<italic>x</italic><sub>1</sub>, <italic>x</italic><sub>2<italic>k</italic></sub>) &#x0003D; <italic>d</italic>(&#x003C6;(<italic>x</italic><sub>1</sub>), &#x003C6;(<italic>x</italic><sub>2<italic>k</italic></sub>)). Since this distance is the biggest one on <italic>X</italic><sub><italic>a</italic></sub>, either &#x003C6;(<italic>x</italic><sub>1</sub>) &#x0003D; <italic>x</italic><sub>1</sub> and &#x003C6;(<italic>x</italic><sub>2<italic>k</italic></sub>) &#x0003D; <italic>x</italic><sub>2<italic>k</italic></sub> or &#x003C6;(<italic>x</italic><sub>1</sub>) &#x0003D; <italic>x</italic><sub>2<italic>k</italic></sub> and &#x003C6;(<italic>x</italic><sub>2<italic>k</italic></sub>) &#x0003D; <italic>x</italic><sub>1</sub>. We will refer them as cases 1 and 2, respectively. In the first case, obviously, for every <italic>x</italic> &#x02208; <italic>A</italic> with <italic>x</italic><sub>1</sub> &#x0003C; <italic>x</italic> &#x0003C; <italic>x</italic><sub>2<italic>k</italic></sub>, we get &#x003C6;(<italic>x</italic>) &#x0003D; <italic>x</italic>, so, in this case, &#x003C6;|<sub>[<sub><italic>x</italic></sub><sub>1</sub>, <italic>x</italic><sub>2<italic>k</italic></sub>]&#x02229;<italic>A</italic></sub> is the identity. In the second case, if the structure of <italic>A</italic> allows it, &#x003C6;|<sub>[<sub><italic>x</italic></sub><sub>1</sub>, <italic>x</italic><sub>2<italic>k</italic></sub>]&#x02229;<italic>A</italic></sub> is the inversion, called total symmetry. Furthermore, following the similar procedure as in Lemma 3.4, we have that in the first case, &#x003C6; is the identity, and in the second case &#x003C6; is the total symmetry.</p>
<p>Remark 3.10. The conditions of Theorem 3.9 are sufficient but not necessary for the plasticity of a set without accumulation points.</p>
<p>To make sure that the previous Remark 3.10 is true, one may consider the space (&#x02124;, <italic>d</italic>). For <italic>D</italic><sub>&#x02124;</sub>, the minimal and the maximal elements are equal to 1 and have infinite multiplicity, but the space is plastic. However, we constructed the next example, which is less trivial, to show that plastic spaces which do not satisfy the condition of the previous theorem may have richer structure.</p>
<p>Example 3.11. Let <inline-formula><mml:math id="M30"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi></mml:math></inline-formula>, where <inline-formula><mml:math id="M31"><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is an increasing sequence such that</p>
<disp-formula id="E14"><mml:math id="M32"><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mo>&#x0007C;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x0007C;</mml:mo><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x02124;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi>k</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x02115;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mo>&#x0007C;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x0007C;</mml:mo><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>for&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi>k</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mi>&#x02124;</mml:mi><mml:mo>&#x02212;</mml:mo></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow> </mml:mrow></mml:math></disp-formula>
<p>The corresponding <italic>D</italic><sub><italic>A</italic></sub> has no minimal or maximal element. However, (<italic>A, d</italic>) is plastic. In fact, let &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> be a non-expansive bijection. Then,</p>
<disp-formula id="E15"><mml:math id="M33"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo></mml:math></disp-formula>
<p>Suppose <inline-formula><mml:math id="M34"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac></mml:math></inline-formula>, where <italic>n</italic> &#x02265; 2. Consider the open ball with the radius <italic>n</italic> &#x02212; 1 centered in &#x003C6;(<italic>a</italic><sub>0</sub>). Due to the structure of <italic>A</italic>, this ball contains only the point &#x003C6;(<italic>a</italic><sub>1</sub>), except for the center. On the other hand, the open ball with the radius <italic>n</italic> &#x02212; 1 centered in <italic>a</italic><sub>0</sub>, and for <italic>n</italic> &#x02265; 3, it contains more than two points, and for <italic>n</italic> &#x0003D; 2, it contains two points but does not contain <italic>a</italic><sub>1</sub>. In both cases, we have a contradiction to the non-expansiveness of the map &#x003C6;. That is why the only possible option is as follows:</p>
<disp-formula id="E16"><mml:math id="M35"><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003C6;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo></mml:math></disp-formula>
<p>Furthermore, just in the same way as in Theorem 3.9, we have that &#x003C6; is either the identity or the inversion.</p>
<p>Now let us speak about the subsets which contain a continuous part. One may prove the following statement in the same way as the Proposition 3.1.</p>
<p>Proposition 3.12. Let be</p>
<disp-formula id="E17"><mml:math id="M36"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
<p>where <italic>b</italic><sub><italic>i</italic></sub> &#x0003C; <italic>a</italic><sub><italic>i</italic>&#x0002B;1</sub> be such a sequence of intervals that</p>
<disp-formula id="E18"><label>(4)</label><mml:math id="M37"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>and</p>
<disp-formula id="E19"><label>(5)</label><mml:math id="M38"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02264;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>for all <italic>i</italic> &#x02208; &#x02124;. Furthermore, there exists <italic>j</italic> &#x02208; &#x02124; such that</p>
<disp-formula id="E20"><label>(6)</label><mml:math id="M39"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext class="textrm" mathvariant="normal">&#x000A0;or&#x000A0;</mml:mtext><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0003C;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Then, (<italic>A, d</italic>) is not plastic.</p>
<p>Remark 3.13. In the same way as in Proposition 3.1, the relation signs in <xref ref-type="disp-formula" rid="E18">Equations (4</xref>-<xref ref-type="disp-formula" rid="E20">6)</xref> might be commonly inverted.</p>
<p>Here is one more observation.</p>
<p>Proposition 3.14. Let <italic>A</italic> &#x02282; &#x0211D; contain an interval (<italic>a</italic>, &#x0002B;&#x0221E;) or (&#x02212;&#x0221E;, <italic>a</italic>). Then, (<italic>A, d</italic>) is not plastic.</p>
<p><italic>Proof</italic>. Without loss of generality, we discuss the case with (<italic>a</italic>, &#x0002B;&#x0221E;). Let us define the map &#x003C6; with</p>
<disp-formula id="E21"><mml:math id="M40"><mml:mi>&#x003C6;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo> <mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>if&#x000A0;</mml:mtext><mml:mi>x</mml:mi><mml:mo>&#x02209;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x0221E;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>&#x003C6;</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>otherwise</mml:mtext><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow> </mml:mrow></mml:math></disp-formula>
<p>This map is non-expansive, bijective, and, at the same time, not an isometry.</p>
<p>In Naimpally et al. [<xref ref-type="bibr" rid="B4">4</xref>], Theorem 3.9 shows the plasticity of the space &#x0211D;\&#x02124;. Unfortunately, the proof misses the case that the non-expansive bijection is a symmetry. However, the statement itself is true. One may use the same reasoning to prove the next proposition.</p>
<p>Proposition 3.15. Let</p>
<disp-formula id="E22"><mml:math id="M41"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
<p>where</p>
<disp-formula id="E23"><mml:math id="M42"><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext class="textrm" mathvariant="normal">&#x000A0;and&#x000A0;</mml:mtext><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
<p>Then, (<italic>A, d</italic>) is plastic.</p>
<p>Remark 3.16. Propositions 3.12 and 3.15 hold true with the closed intervals.</p>
<p>Remark 3.17. On the other hand, if we consider in the statement of Proposition 3.15 half-intervals,</p>
<disp-formula id="E24"><mml:math id="M43"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi><mml:mtext class="textrm" mathvariant="normal">&#x000A0;or&#x000A0;</mml:mtext><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi></mml:mrow></mml:math></disp-formula>
<p>(A, d) is already a non-plastic space.</p>
<p>Remark 3.18. If we consider in the same statement the set of the form,</p>
<disp-formula id="E25"><mml:math id="M44"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x0222A;</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x022C3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x02282;</mml:mo><mml:mi>&#x0211D;</mml:mi><mml:mo>,</mml:mo><mml:mtext class="textrm" mathvariant="normal">&#x000A0;where&#x000A0;</mml:mtext><mml:mi>n</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>&#x02115;</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
<p>(A, d) is also a non-plastic space.</p>
<p><xref ref-type="fig" rid="F3">Figure 3</xref> illustrates the previous remark.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Oppositely to <xref ref-type="fig" rid="F1">Figure 1</xref>, half-open intervals allow that <italic>&#x003C6;</italic> does not pass entire rectangles in <italic>A</italic> &#x000D7; <italic>A</italic>. Rather, it might jump where the intervals can be glued to each other. Remark that this example contains a first half-open interval and all the following intervals are half-open, cf. bijectivity. The topological properties of the intervals in <italic>A</italic> enter the plasticity problem.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fams-10-1387012-g0003.tif"/>
</fig>
<p>The reader easily provides more examples which consist of open or closed intervals together with half-intervals, all with the same lengths. Again, we remark that the end-points of the intervals are critical points for the plasticity property.</p></sec>
<sec sec-type="conclusions" id="s4">
<title>4 Conclusion</title>
<p>The analysis of plastic sub-spaces <italic>A</italic> of the real-line &#x0211D; has shown that first, the Lipschitz continuity of the map &#x003C6;: <italic>A</italic> &#x02192; <italic>A</italic> with Lipschitz constant 1 leads to useful and instructive illustrations of the non-expansivity of the map &#x003C6;, to which it is identical.</p>
<p>The plasticity property of a metric space turned out to contain two complementary aspects, a purely geometrical one and a topological one. Already on the real-line &#x0211D;, the different nature of both aspects become visible. Whereas the geometrical aspect is an extension of the non-expansivity of &#x003C6; on a simply connected interval, the topological aspect leads to the question whether two or more sub-intervals can be glued at critical points by piecewise translations. Therefore, the investigation of sub-spaces of the real-line &#x0211D; gives an appropriate framework for the investigation of the plasticity of metric spaces.</p>
<p>We expect that the interplay between the two types of nature of the problem gets more severe in higher dimensions. Already unions of rectangles and cuboids as sub-spaces of the <italic>d</italic>-dimensional Euclidean space &#x0211D;<sup><italic>d</italic></sup> give a tremendous multiplicity of open, half-open, and closed edges and sides&#x02014;complete or partial.</p>
<p>The named interplay between geometry and topology of the metric spaces gets more and more complicated and less intuitive the more abstract and the more elaborated the metric spaces are. We do not expect any clarification, for example, metric spaces of functions before sub-spaces of the Euclidean spaces are understood.</p>
<p>Future research will concentrate on the question, what else can be said about plastic and non-plastic sub-spaces of the space (&#x0211D;, <italic>d</italic>). Furthermore, we will explore the extension of a metric space <italic>A</italic> to larger sets in <italic>A</italic><sub>ex</sub> which contain <italic>A</italic>. In particular, the metric hull, i. e., the set</p>
<disp-formula id="E26"><mml:math id="M45"><mml:mtable class="eqnarray" columnalign="right"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mo class="qopname">hull</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mo>&#x02203;</mml:mo><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>A</mml:mi><mml:mo>:</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x02286;</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>gives interesting perspectives in the context of the plasticity problem for the specification <italic>A</italic><sub>ex</sub> &#x0003D; &#x0211D;. We conjecture that the metric hull is the smallest proper extension of the metric space, which is simply connected to <italic>A</italic><sub>ex</sub> and where the plasticity is dominated by the geometry. Therefore, the topology might be sub-ordinated. In the medium term, we hope for an insight into the question how geometry and topology interact in the plasticity of a metric space.</p></sec>
<sec sec-type="data-availability" id="s5">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p></sec>
<sec sec-type="author-contributions" id="s6">
<title>Author contributions</title>
<p>OZ: Writing &#x02013; review &#x00026; editing, Writing &#x02013; original draft, Project administration, Formal analysis, Conceptualization. DL: Validation, Writing &#x02013; review &#x00026; editing, Writing &#x02013; original draft, Visualization, Methodology.</p></sec>
</body>
<back>
<sec sec-type="funding-information" id="s7">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. The research was partially supported by the Volkswagen Foundation grant within the frameworks of the international project &#x0201C;From Modeling and Analysis to Approximation.&#x0201D; OZ was also partially supported by Akhiezer Foundation grant, 2023.</p>
</sec>
<ack><p>The authors are grateful to Vladimir Kadets for valuable remarks and pointing us the results about the extension of Lipschitz maps. The authors are also thankful to Ehrhard Behrends for drawing our attention to the problem considered in this study.</p>
</ack>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s8">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Freudenthal</surname> <given-names>H</given-names></name> <name><surname>Hurewicz</surname> <given-names>W</given-names></name></person-group>. <article-title>Dehnungen, verk&#x000FC;rzungen, isometrien</article-title>. <source>Fund Math</source>. (<year>1936</year>) <volume>26</volume>:<fpage>120</fpage>&#x02013;<lpage>2</lpage>. <pub-id pub-id-type="doi">10.4064/fm-26-1-120-122</pub-id></citation>
</ref>
<ref id="B2">
<label>2.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>McShane</surname> <given-names>EJ</given-names></name></person-group>. <article-title>Extension of range of functions</article-title>. <source>Bull Amer Math Soc</source>. (<year>1934</year>) <volume>40</volume>:<fpage>837</fpage>&#x02013;<lpage>42</lpage>. <pub-id pub-id-type="doi">10.1090/S0002-9904-1934-05978-0</pub-id></citation>
</ref>
<ref id="B3">
<label>3.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kirszbraun</surname> <given-names>MD</given-names></name></person-group>. <article-title>&#x000DC;ber die zusammenziehende und lipschitzsche transformationen</article-title>. <source>Fund Math</source>. (<year>1934</year>) <volume>22</volume>:<fpage>77</fpage>&#x02013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.4064/fm-22-1-77-108</pub-id></citation>
</ref>
<ref id="B4">
<label>4.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naimpally</surname> <given-names>SA</given-names></name> <name><surname>Piotrowski</surname> <given-names>Z</given-names></name> <name><surname>Wingler</surname> <given-names>EJ</given-names></name></person-group>. <article-title>Plasticity in metric spaces</article-title>. <source>J Math Anal Appl</source>. (<year>2006</year>) <volume>313</volume>:<fpage>38</fpage>&#x02013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1016/j.jmaa.2005.04.070</pub-id></citation>
</ref>
<ref id="B5">
<label>5.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kadets</surname> <given-names>V</given-names></name> <name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Plastic pairs of metric spaces</article-title>. <source>J Math Anal Appl</source>. (<year>2023</year>) <fpage>127435</fpage>. <pub-id pub-id-type="doi">10.1016/j.jmaa.2023.127435</pub-id></citation>
</ref>
<ref id="B6">
<label>6.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cascales</surname> <given-names>B</given-names></name> <name><surname>Kadets</surname> <given-names>V</given-names></name> <name><surname>Orihuela</surname> <given-names>J</given-names></name> <name><surname>Wingler</surname> <given-names>EJ</given-names></name></person-group>. <article-title>Plasticity of the unit ball of a strictly convex Banach space</article-title>. <source>Rev Real Acad Cienc Exactas F</source>&#x000ED;<italic>s Nat A Mat</italic>. (<year>2016</year>) <volume>110</volume>:<fpage>723</fpage>&#x02013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1007/s13398-015-0261-3</pub-id></citation>
</ref>
<ref id="B7">
<label>7.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Angosto</surname> <given-names>C</given-names></name> <name><surname>Kadets</surname> <given-names>V</given-names></name> <name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Non-expansive bijections, uniformities and polyhedral faces</article-title>. <source>J Math Anal Appl</source>. (<year>2019</year>) <volume>471</volume>:<fpage>38</fpage>&#x02013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.1016/j.jmaa.2018.10.058</pub-id></citation>
</ref>
<ref id="B8">
<label>8.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haller</surname> <given-names>R</given-names></name> <name><surname>Leo</surname> <given-names>N</given-names></name> <name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Two new examples of Banach spaces with a plastic unit ball</article-title>. <source>Acta Comment Univ Tartu Math</source>. (<year>2022</year>) <volume>26</volume>:<fpage>89</fpage>&#x02013;<lpage>101</lpage>. <pub-id pub-id-type="doi">10.12697/ACUTM.2022.26.07</pub-id></citation>
</ref>
<ref id="B9">
<label>9.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kadets</surname> <given-names>V</given-names></name> <name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Nonexpansive bijections to the unit ball of the &#x02113;_1-sum of strictly convex Banach spaces</article-title>. <source>Bull Aust Math Soc</source>. (<year>2018</year>) <volume>97</volume>:<fpage>285</fpage>&#x02013;<lpage>92</lpage>. <pub-id pub-id-type="doi">10.1017/S0004972717001150</pub-id></citation>
</ref>
<ref id="B10">
<label>10.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Leo</surname> <given-names>N</given-names></name></person-group>. <article-title>Plasticity of the unit ball of <italic>c</italic> and <italic>c</italic>_0</article-title>. <source>J Math Anal Appl</source>. (<year>2022</year>) <volume>507</volume>:<fpage>125718</fpage>. <pub-id pub-id-type="doi">10.1016/j.jmaa.2021.125718</pub-id></citation>
</ref>
<ref id="B11">
<label>11.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Nonexpansive bijections between unit balls of Banach spaces</article-title>. <source>Ann Funct Anal</source>. (<year>2018</year>) <volume>9</volume>:<fpage>271</fpage>&#x02013;<lpage>81</lpage>. <pub-id pub-id-type="doi">10.1215/20088752-2017-0050</pub-id></citation>
</ref>
<ref id="B12">
<label>12.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karpenko</surname> <given-names>I</given-names></name> <name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Linear expand-contract plasticity of ellipsoids revisited</article-title>. <source>Mat Stud</source>. (<year>2022</year>) <volume>57</volume>:<fpage>192</fpage>&#x02013;<lpage>201</lpage>. <pub-id pub-id-type="doi">10.30970/ms.57.2.192-201</pub-id></citation>
</ref>
<ref id="B13">
<label>13.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zavarzina</surname> <given-names>O</given-names></name></person-group>. <article-title>Linear expand-contract plasticity of ellipsoids in separable Hilbert spaces</article-title>. <source>Mat Stud</source>. (<year>2019</year>) <volume>51</volume>:<fpage>86</fpage>&#x02013;<lpage>91</lpage>. <pub-id pub-id-type="doi">10.15330/ms.51.1.86-91</pub-id></citation>
</ref>
<ref id="B14">
<label>14.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Behrends</surname> <given-names>E</given-names></name></person-group>. <source>Free University of Berlin, Private Communication</source>. (<year>2020</year>).</citation>
</ref>
</ref-list>
</back>
</article> 