alphaFeedback

WorksMathematics

Plasticity of the unit sphere of the space c0c_0

AI contributions
Not recorded for this paper
View details

Abstract

In this paper, we prove that the unit sphere of the space c0c_{0} is plastic, i.e., every non-expansive bijection from this sphere onto itself is an isometry.

Introduction

Definition. A metric space (M,d)(M,d) is called plastic if every bijective non-expansive map F:M→MF:M\to M is an isometry.

Recall that a map FF is called non-expansive (non-contractive) if for any x,y∈Mx,y\in M

d(F(x),F(y))≤d(x,y).d(F(x),F(y)) \le d(x,y).

A map FF is called non-contractive if for any x,y∈Mx,y\in M the inverse inequality holds. In [2], Cascales, Kadets, Orihuela, and Wingler posed the following question:

Problem. Is it true that the unit balls of all Banach spaces are plastic?

This question has a number of partial positive results (see, for example, [2, 3, 5, 6, 13] and references therein), but is still open in full generality in infinite dimensions. In finite dimensions, the answer is positive due to the result on totally bounded metric spaces obtained by Naimpally, Piotrowski, and Wingler [10]. The problem of plasticity of the unit balls of Banach spaces may be considered as a continuation of the well-known results of Mazur–Ulam [9] extended by Mankiewicz [8].

Theorem 1.1. (Mazur–Ulam-Mankiewicz.) Every bijective isometry between the unit balls BXB_X and BYB_Y extends to a linear bijective isometry from XX onto YY.

In 1987, Tingley [12] raised the question of whether the unit balls in the aforementioned theorem could be replaced by unit spheres:

Problem. (Tingley.) Let f:SX→SYf:S_X\to S_Y be a bijective isometry between the unit spheres of two Banach spaces XX and YY. Does ff admit an extension to a linear isometry between XX and YY?

Despite numerous partial results for specific spaces (see, for example, [4], [11]), Tingley’s problem remains a challenging open question in dimensions three and higher. Moreover, it has been fully resolved in the two-dimensional setting by Banakh only in 2022 [1]. As its natural continuation, one may consider the plasticity problem for the unit spheres of Banach spaces, posed by V. Kadets in personal communication, 2024.

Problem. (Kadets.) Is it true that the unit spheres of all Banach spaces are plastic?

In [7] this question was answered positively for Hilbert spaces, ℓ1\ell_1, ℓ∞\ell_\infty, and cc. Observe also, for the unit ball of the space c0c_0 only conditional plasticity was shown. Namely, a bijective non-expansive map F:Bc0→Bc0F:B_{c_0}\to B_{c_0} is an isometry if FF is continuous [6]. It is currently unknown whether this additional condition may be omitted. As the title says, the main objective of this paper is to prove the plasticity (without any additional conditions) of Sc0S_{c_0}.

To facilitate our analysis, we introduce the necessary notation and structural definitions used throughout the text. For a real Banach space XX, let SXS_X and BXB_X denote its unit sphere and closed unit

2020 Mathematics Subject Classification. 46B20, 46C05.

Key words and phrases. Non-expansive map, non-contractive map, unit sphere, isometry, expand-contract plastic space.

The author was supported by the National Research Foundation of Ukraine, project No. 2025.07/0369 “Qualitative methods of nonlinear analysis of heterogeneous structures”. ball, respectively. In the context of the classical sequence space c0c_0, an element x∈Sc0x \in S_{c_0} is represented as a sequence x=(x1,x2,…)x = (x^1, x^2, \ldots) such that lim⁡n→∞xn=0\lim_{n \to\infty} x^n = 0 and max⁡n∈N∣xn∣=1\max_{n \in\mathbb{N}} |x^n| = 1.

We denote by Sc0∗S^*_{c_0} the dense subset of Sc0S_{c_0} consisting of all elements with finite support. For any vector x∈c0x \in c_0, its support is defined as the set of indices corresponding to non-zero coordinates:

supp⁡(x)={n∈N:xn≠0}.\operatorname{supp}(x) = \{n \in\mathbb{N} : x^n \ne0\}.

Thus, x∈Sc0∗x \in S^*_{c_0} if and only if ∣supp⁡(x)∣<∞|\operatorname{supp}(x)| < \infty.

Furthermore, let {en}n∈N\{e_n\}_{n \in\mathbb{N}} be the standard unit vector basis of c0c_0, where ene_n has 1 at the nn-th position and zeros elsewhere. We define EE as the set consisting of all standard basis vectors and their negatives:

E={±en:n∈N}.E = \{\pm e_n : n \in\mathbb{N}\}.

Evidently, E⊂Sc0∗⊂Sc0E \subset S^*_{c_0} \subset S_{c_0}. For any real number t∈Rt \in\mathbb{R}, its signum function is denoted by sgn⁡(t)\operatorname{sgn}(t).

The paper is organized as follows. In the second section, we collect and modify some results known for the unit spheres of some other sequence spaces or for Bc0B_{c_0} to adapt them to the case of Sc0S_{c_0}. These results imply that any bijective non-expansive mapping is tightly bound to a coordinate permutation and a sign-switching sequence. Roughly speaking, we “turn off” this coordinate permutation and sign-switching and obtain a function F~\widetilde{F}. This section also includes some previously known or slightly modified properties of this function. Section 3 is devoted to further investigation of the properties of F~\widetilde{F}, which finally allowed us to see that F~\widetilde{F} reduces to identity, which in turn means that FF reduces to an isometry.

Preliminaries

The analog of the first lemma of this section is Lemma 3.1 from [6], which was proved for Bc0B_{c_0} and BcB_c. The “only if” part was also proved in Lemma 4.1 in [7] for the unit spheres of ℓ∞\ell_\infty and cc. Although this result cannot be considered as a completely new one, for the reader’s convenience, we give it with proof.

Lemma 2.1. The points p,q∈Sc0p, q \in S_{c_0} satisfy the condition that for every x∈Sc0x \in S_{c_0}

(∥x−p∥≤1)∨(∥x−q∥≤1),(\lVert x-p\rVert\le1) \lor(\lVert x-q\rVert\le1),

if and only if p∈Ep \in E and q=−pq=-p.

Proof. Let us first show the “if” part. Suppose that without loss of generality p=enp=e_n, q=−enq=-e_n and fix arbitrary x∈Sc0x \in S_{c_0}. If xn=0x^n=0, then both inequalities from the lemma statement hold. If xn>0x^n>0, then ∥x−p∥≤1\lVert x-p\rVert\le1, otherwise ∥x−q∥≤1\lVert x-q\rVert\le1.

Conversely, let us prove the “only if” part. Suppose by contradiction that ∣supp⁡(p)∣>1|\operatorname{supp}(p)|>1. Then there exist two distinct indices kk and jj such that pk≠0p^k \ne0 and pj≠0p^j \ne0 and an index ll, which without loss of generality we may assume different from kk, such that ql≠0q^l \ne0. Let us construct a vector x∈Sc0x \in S_{c_0} as follows: set xk=−sgn⁡(pk)x^k=-\operatorname{sgn}(p^k), and xl=−sgn⁡(ql)x^l=-\operatorname{sgn}(q^l). All other coordinates of xx are set to zero. Then we clearly obtain:

∥x−p∥≥∣xk−pk∣=1+∣pk∣>1,\lVert x-p\rVert\ge|x^k-p^k|=1+|p^k|>1,

and by the choice of xlx^l, we also have ∥x−q∥≥∣xl−ql∣>1\lVert x-q\rVert\ge|x^l-q^l|>1, which contradicts the assumption.

Thus, ∣supp⁡(p)∣=∣supp⁡(q)∣=1|\operatorname{supp}(p)|=|\operatorname{supp}(q)|=1. Since p,q∈Sc0p,q \in S_{c_0}, this implies p=±enp=\pm e_n for some n∈Nn \in\mathbb{N}, meaning p∈Ep \in E. By symmetry, we also get q∈Eq \in E, so q=±emq=\pm e_m. If m≠nm \ne n, we can easily find x∈Sc0x \in S_{c_0} to violate the condition. Finally, if q=pq=p, then choosing x=−px=-p yields ∥x−p∥=∥−2p∥=2>1\lVert x-p\rVert=\lVert-2p\rVert=2>1, which is another contradiction. Therefore, we have q=−pq=-p. □

The next lemma was also proved in [7] (Lemma 4.2) for cc and ℓ∞\ell_\infty, however, it also works for c0c_0.

Lemma 2.2. Let F:Sc0→Sc0F:S_{c_0}\to S_{c_0} be a non-expansive bijection, and let x∈Ex\in E. Then F(x)∈EF(x)\in E and F(−x)=−F(x)F(-x)=-F(x).

Proof. For every y∈Sc0y \in S_{c_0} either ∥y−x∥≤1\lVert y-x\rVert\le1 or ∥y+x∥≤1\lVert y+x\rVert\le1, and the non-expansiveness of FF implies that min⁡(∥F(y)−F(x)∥,∥F(y)−F(−x)∥)≤1\min(\lVert F(y)-F(x)\rVert,\lVert F(y)-F(-x)\rVert)\le1 for every y∈Sc0y \in S_{c_0}. FF is bijective, so min⁡(∥y−F(x)∥,∥y−F(−x)∥)≤1\min(\lVert y-F(x)\rVert,\lVert y-F(-x)\rVert)\le1 for every y∈Sc0y \in S_{c_0}. Now all that remains is to apply the previous lemma. □

The next lemma was extracted from Lemma 3.2 in [6], where the same was proved for Bc0B_{c_0}.

Lemma 2.3. Let F:Sc0→Sc0F:S_{c_0}\to S_{c_0} be a non-expansive bijection. Then there is a bijection σ:N→N\sigma:\mathbb{N}\to\mathbb{N} and a sequence α:N→{−1,1}\alpha:\mathbb{N}\to\{-1,1\} such that for every x∈Sc0x\in S_{c_0} and n∈Nn\in\mathbb{N} the following holds:

  1. if xn=0x^n=0, then F(x)σ(n)=0F(x)^{\sigma(n)}=0;

  1. if xn<0x^n<0 and αn=1\alpha^n=1 (αn=−1\alpha^n=-1), then F(x)σ(n)≤0F(x)^{\sigma(n)}\leq0 (F(x)σ(n)≥0F(x)^{\sigma(n)}\geq0);

  1. if xn>0x^n>0 and αn=1\alpha^n=1 (αn=−1\alpha^n=-1), then F(x)σ(n)≥0F(x)^{\sigma(n)}\geq0 (F(x)σ(n)≤0F(x)^{\sigma(n)}\leq0).

Proof. Let us fix an arbitrary n∈Nn\in\mathbb{N}. By Lemma 2.2, for the elements ene_n and −en-e_n, we have F(en)=ekF(e_n)=e_k or F(en)=−ekF(e_n)=-e_k, and correspondingly, F(−en)=−ekF(-e_n)=-e_k or F(−en)=ekF(-e_n)=e_k for some k∈Nk\in\mathbb{N}. Define σ(n)=k\sigma(n)=k and αn=(F(en))k\alpha^n=(F(e_n))^k. The mapping σ\sigma defined in this way is injective due to the injectivity of FF.

In what follows, we show that conditions 1)–3) hold for all x∈Sc0x\in S_{c_0} and n∈Nn\in\mathbb{N}. Since Sc0∗S^*_{c_0} is dense in Sc0S_{c_0} and FF is continuous, it suffices to verify these conditions only for x∈Sc0∗x\in S^*_{c_0}, that is, for x∈Sc0x\in S_{c_0} with ∣supp⁡(x)∣<∞|\operatorname{supp}(x)|<\infty.

For every n∈supp⁡(x)n\in\operatorname{supp}(x) define ln=−sgn⁡(xn)enl_n=-\operatorname{sgn}(x^n)e_n. Observe that for every t∈Sc0t\in S_{c_0}, either ∥t−x∥≤1\lVert t-x\rVert\leq1 or there exists n∈supp⁡(x)n\in\operatorname{supp}(x) such that ∥t−ln∥≤1\lVert t-l_n\rVert\leq1. To demonstrate this, let us fix t∈Sc0t\in S_{c_0} and suppose ∥t−ln∥>1\lVert t-l_n\rVert>1 for every n∈supp⁡(x)n\in\operatorname{supp}(x). By the definition of lnl_n, this means sgn⁡(xntn)>0\operatorname{sgn}(x^nt^n)>0 for every n∈supp⁡(x)n\in\operatorname{supp}(x) and thus, ∥t−x∥≤1\lVert t-x\rVert\leq1. Since FF is non-expansive and bijective, for every t∈Sc0t\in S_{c_0}, either ∥t−F(x)∥≤1\lVert t-F(x)\rVert\leq1 or there is n∈supp⁡(x)n\in\operatorname{supp}(x) such that ∥t−F(ln)∥≤1\lVert t-F(l_n)\rVert\leq1. Further, we will construct a special sequence z∈Sc0z\in S_{c_0} and show ∥z−F(x)∥≤1\lVert z-F(x)\rVert\leq1. By the construction of zz, the latter inequality will automatically imply items (2) and (3). Let

zk={sgn⁡(xn)αn,for k=σ(n), n∈supp⁡(x),0,otherwise.z^k=\begin{cases} \operatorname{sgn}(x^n)\alpha^n, & \text{for } k=\sigma(n),\,n\in\operatorname{supp}(x),\\ 0, & \text{otherwise.} \end{cases}

Observe by its definition, z∈Sc0z\in S_{c_0} and ∥z−F(ln)∥>1\lVert z-F(l_n)\rVert>1 for every n∈supp⁡(x)n\in\operatorname{supp}(x), so ∥z−F(x)∥≤1\lVert z-F(x)\rVert\leq1, and thus items (2) and (3) are proved.

It remains to prove item (1). Let us fix k∉σ(supp⁡(x))k\notin\sigma(\operatorname{supp}(x)) and change the definition of zz such that zk=1z^k=1. We still have z∈Sc0∗z\in S^*_{c_0} and ∥z−F(ln)∥>1\lVert z-F(l_n)\rVert>1 for every n∈supp⁡(x)n\in\operatorname{supp}(x). Thus, ∥z−F(x)∥≤1\lVert z-F(x)\rVert\leq1, which implies F(x)k≥0F(x)^k\geq0. On the other hand, setting zk=−1z^k=-1, we have the opposite inequality F(x)k≤0F(x)^k\leq0. Thus, item (1) is proved.

The last step is to prove surjectivity of σ\sigma. Let us argue by contradiction. Suppose there is j∉σ(N)j\notin\sigma(\mathbb{N}). From the above we have F(x)j=0F(x)^j=0 for every x∈Sc0∗x\in S^*_{c_0}. Using the continuity of FF and density of Sc0∗S^*_{c_0} in Sc0S_{c_0} once again, we obtain F(x)j=0F(x)^j=0 for every x∈Sc0x\in S_{c_0}. This contradiction to the surjectivity of FF completes the proof.

:::

The preceding lemma yields a bijection σ:N→N\sigma:\mathbb{N}\to\mathbb{N} and a sequence α:N→{−1,1}\alpha:\mathbb{N}\to\{-1,1\}. Let us define the following isometric automorphism AA of c0c_0 by

(A(x))σ(n)=αnxn,(A(x))^{\sigma(n)}=\alpha^n x^n,

for all n∈Nn\in\mathbb{N}. Denote the restriction of this automorphism to Sc0S_{c_0} by GG. Observe that GG is a bijective isometry of Sc0S_{c_0} onto itself. To prove the plasticity of Sc0S_{c_0}, it suffices to show F=GF=G, or equivalently, to show that F~:=G−1∘F\widetilde{F}:=G^{-1}\circ F is the identity map on Sc0S_{c_0}. We shall establish this fact in what follows. By its definition, F~\widetilde{F} is a non-expansive bijection from Sc0S_{c_0} onto itself. Furthermore, Lemma 2.3 implies that F~\widetilde{F} acts as the identity on EE and satisfies the following properties (also extracted from analogous results for Bc0B_{c_0} proved in [6]).

Lemma 2.4. For each x∈Sc0x\in S_{c_0} and n∈Nn\in\mathbb{N},

  1. if xn=0x^n=0, then F~(x)n=0\widetilde{F}(x)^n=0;

  1. if xn<0x^n<0, then F~(x)n≤0\widetilde{F}(x)^n\leq0;

  1. if xn>0x^n>0, then F~(x)n≥0\widetilde{F}(x)^n\geq0.

Lemma 2.5. For each y∈Sc0y\in S_{c_0} and n∈Nn\in\mathbb{N}, if yn<0y^n<0, then F~−1(y)n<0\widetilde{F}^{-1}(y)^n<0, and if yn>0y^n>0, then F~−1(y)n>0\widetilde{F}^{-1}(y)^n>0.

The next lemma is extracted from Lemma 4.7 from [7]. This property was established for ℓ∞\ell_\infty and cc. However, almost the same argument works for c0c_0.

Lemma 2.6. Let x∈Sc0x \in S_{c_0}, y=F~(x)y = \widetilde{F}(x). Then for every k∈Nk \in\mathbb{N} the following inequalities hold:

∣yk∣≤∣xk∣,(1)|y^k| \leq|x^k|, \tag*{(1)}

and

sgn⁡(xk)sgn⁡(yk)≥0.(2)\operatorname{sgn}(x^k)\operatorname{sgn}(y^k) \geq0. \tag*{(2)}

Proof. Let k∈Nk \in\mathbb{N} be such that ∣xk∣<1|x^k| < 1, i.e. max⁡(∥x−ek∥,∥x+ek∥)<2\max(\lVert x-e_k\rVert,\lVert x+e_k\rVert) < 2. The non-expansiveness of F~\widetilde{F} then implies that max⁡(∥y−ek∥,∥y+ek∥)<2\max(\lVert y-e_k\rVert,\lVert y+e_k\rVert) < 2, i.e. ∣yk∣<1|y^k| < 1, and

∣xk∣=∥x−ek∥+∥x+ek∥−2≥∥y−ek∥+∥y+ek∥−2=∣yk∣.|x^k| = \lVert x-e_k\rVert+ \lVert x+e_k\rVert- 2 \geq\lVert y-e_k\rVert+ \lVert y+e_k\rVert- 2 = |y^k|.

This proves (1) for all k∈Nk \in\mathbb{N} such that ∣xk∣<1|x^k| < 1, and (1) is obviously true for all k∈Nk \in\mathbb{N} such that ∣xk∣=1|x^k| = 1. The claim (2) follows directly from Lemma 2.4. □

Main results

Let us consider the set KK of points with finite support, such that for any x∈Kx \in K and any xi∈supp⁡(x)x^i \in\operatorname{supp}(x), ∣xi∣=1|x^i| = 1.

Lemma 3.1. The map F~\widetilde{F} is the identity map on KK.

Proof. We will proceed by induction on the cardinality of the support. The base case of induction holds since F~\widetilde{F} is the identity on EE. Now, suppose for any a∈Ka \in K with ∣supp⁡(a)∣≤n−1|\operatorname{supp}(a)| \leq n-1, F~(a)=a\widetilde{F}(a) = a. Further, let us argue by contradiction. Without loss of generality we may consider

x=(x1,x2,…,xn,0,…),x = (x^1,x^2,\ldots,x^n,0,\ldots),

where ∣xi∣=1|x^i| = 1 for all i≤ni \leq n, and suppose F~(x)≠x\widetilde{F}(x) \neq x. By the previous results, one has

F~(x)=(y1,y2,…,yn,0,…),\widetilde{F}(x) = (y^1,y^2,\ldots,y^n,0,\ldots),

where, at least for some 1≤i≤n1 \leq i \leq n, 0<∣yi∣<10 < |y^i| < 1 and all yiy^i have the same signs as the corresponding xix^i. Consider the following element

x~=(sgn⁡(x1)(1−ε),…,sgn⁡(xi−1)(1−ε),sgn⁡(xi),sgn⁡(xi+1)(1−ε),…,sgn⁡(xn)(1−ε),0,…),\widetilde{x} = (\operatorname{sgn}(x^1)(1-\varepsilon),\ldots,\operatorname{sgn}(x^{i-1})(1-\varepsilon),\operatorname{sgn}(x^i),\operatorname{sgn}(x^{i+1})(1-\varepsilon),\ldots,\operatorname{sgn}(x^n)(1-\varepsilon),0,\ldots),

with some ε>0\varepsilon> 0. By Lemma 2.6, ∣F~(x~)k∣≤(1−ε)|\widetilde{F}(\widetilde{x})^k| \leq(1-\varepsilon), for all k≠ik \neq i. Moreover,

∥F~(x)−F~(x~)∥=max⁡1≤k≤n{∣F~(x)k−F~(x~)k∣}≤∥x−x~∥=ε.\lVert\widetilde{F}(x)-\widetilde{F}(\widetilde{x})\rVert= \max_{1 \leq k \leq n}\{|\widetilde{F}(x)^k-\widetilde{F}(\widetilde{x})^k|\} \leq\lVert x-\widetilde{x}\rVert= \varepsilon.

Thus, in particular,

∣F~(x)i−F~(x~)i∣≤ε,|\widetilde{F}(x)^i-\widetilde{F}(\widetilde{x})^i| \leq\varepsilon,

and since ε\varepsilon can be chosen arbitrarily small, we can achieve ∣F~(x~)i∣<1|\widetilde{F}(\widetilde{x})^i| < 1. We obtain the contradiction F~(x~)∉Sc0\widetilde{F}(\widetilde{x}) \notin S_{c_0}, which completes the proof. □

Lemma 3.2. Let xx and yy differ in one single coordinate. Moreover, ∣xi∣>∣yi∣|x^i| > |y^i| and F~(x)=x\widetilde{F}(x) = x. Then F~(y)i=yi\widetilde{F}(y)^i = y^i.

Proof. By Lemma 2.6, we have

∣F~(y)i∣≤∣yi∣,|\widetilde{F}(y)^i| \leq|y^i|,

and they have the same signs. On the other hand

∣xi−yi∣=∥x−y∥≥∥F~(x)−F~(y)∥=∥F~(y)−x∥≥∣xi−F~(y)i∣.|x^i-y^i| = \lVert x-y\rVert\geq\lVert\widetilde{F}(x)-\widetilde{F}(y)\rVert= \lVert\widetilde{F}(y)-x\rVert\geq|x^i-\widetilde{F}(y)^i|.

Together, these conditions give us the needed conclusion. □

Theorem 3.1. F~\widetilde{F} is the identity map on Sc0S_{c_0}.

Proof. Again, since F~\widetilde{F} is continuous and Sc0∗S_{c_0}^{*} is dense in Sc0S_{c_0}, it suffices to consider only elements x∈Sc0∗x \in S_{c_0}^{*}, that is, ∣supp⁡(x)∣<∞|\operatorname{supp}(x)| < \infty. Let us show F~(x)=x\widetilde{F}(x)=x gradually increasing the number of nonzero coordinates xkx^k. If xx has only one nonzero coordinate, then x=±ekx=\pm e_k for some k∈Nk \in\mathbb{N} and there is nothing to prove. If xx has two nonzero coordinates, the case with moduli of these coordinates equal to 1 is covered by Lemma 3.1. Now consider xx of the following form

x=(x1,x2,0,…),x=(x^1,x^2,0,\ldots),

with ∣x1∣=1|x^1|=1 and ∣x2∣<1|x^2|<1. Then ∣F~(x)1∣|\widetilde{F}(x)^1| is obviously equal to 1. Consider x~\widetilde{x} with x~k=sgn⁡xk\widetilde{x}^k=\operatorname{sgn}x^k and use Lemma 3.2. We have F~(x)2=x2\widetilde{F}(x)^2=x^2.

Analogously, by changing only one coordinate to its sign at each step, we may show F~(x)=x\widetilde{F}(x)=x for any x∈Sc0∗x \in S_{c_0}^{*} with arbitrarily many coordinates of modulus 1 and any finite number of coordinates whose moduli are less than 1.

Thus, F~(x)=x\widetilde{F}(x)=x holds for all x∈Sc0∗x \in S_{c_0}^{*}. Finally, by the density of Sc0∗S_{c_0}^{*} and the continuity of F~\widetilde{F}, we conclude that F~\widetilde{F} is the identity map on the entire sphere Sc0S_{c_0}.

Department of Mathematics and Informatics, V. N. Karazin Kharkiv National University, 61022 Kharkiv, Ukraine.

Email address: [email protected]

References

  1. [1]T. Banakh, Every 2-dimensional Banach space has the Mazur–Ulam property, Linear Algebra and its Applications 632 (2022), 268–280.DOI
  2. [2]B. Casales, V. Kadets, J. Orihuela, and E. J. Wingler, Plasticity of the unit ball of a strictly convex Banach space, Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A 110 (2016), no. 2, 723–727.
  3. [3]M. Fakhoury, Plasticity of the unit ball of some c(k) spaces, J. Math. Anal. Appl. 530 (2023), 127688.arxiv.org/abs/2208.07967
  4. [4]V. Kadets and M. Martín, Extension of isometries between unit spheres of finite-dimensional polyhedral Banach spaces, J. Math. Anal. Appl. 386 (2012), 441–447.DOI
  5. [5]V. Kadets and O. Zavarzina, Nonexpansive bijections to the unit ball of the ℓ₁-sum of strictly convex Banach spaces, Bull. Aust. Math. Soc. 97 (2018), no. 2, 285–292.DOI
  6. [6]N. Leo, Plasticity of the unit ball of c and c₀, Journal of Mathematical Analysis and Applications 507 (2022), no. 1, 125718.arxiv.org/abs/2106.06276
  7. [7]M. Levchenko and O. Zavarzina, On the plasticity of the unit spheres of ℓ₁, ℓ∞, c, and Hilbert spaces, arXiv:2605.06622.
  8. [8]P. Mankiewicz, On extension of isometries in normed linear spaces, Bulletin de l’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques, et Physiques 20 (1972), 367–371.
  9. [9]S. Mazur and S. Ulam, Sur les transformations isométriques d’espaces vectoriels normés, Comptes rendus hebdomadaires des séances de l’Académie des sciences, 194 (1932), 946–948.
  10. [10]S. A. Naimpally, Z. Piotrowski, and E. J. Wingler, Plasticity in metric spaces, J. Math. Anal. Appl. 313 (2006), no. 1, 38–48.DOI
  11. [11]D. Tan, X. Huang, and R. Liu, Generalized-lush spaces and the Mazur-Ulam property, Stud. Math 219 (2013), no. 2, 139–153.arxiv.org/abs/1210.7324
  12. [12]D. Tingley, Isometries of the unit sphere, Geom. Dedicata 22 (1987), 371–378.DOI
  13. [13]O. Zavarzina, N. Leo, and R. Haller, Two new examples of Banach spaces with a plastic unit ball, Acta Comment. Univ. Tartu. Math. 26 (2022), 89–101.arxiv.org/abs/2111.10122

Paper details

vlnc:W_pte6gf82
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents