1 Introduction

If a closed convex subset has the fixed point property for all nonexpansive self-mappings, then is it necessarily bounded? This has long been an open question in metric fixed point theory. The answer is ‘yes’ if X is a Hilbert space (see [1]). It has been shown recently (see [2]) that the failure of the fixed point property for every unbounded convex closed set is not a characteristic of Hilbert spaces; more precisely, for every unbounded closed convex set in c 0 , there exists a fixed point free nonexpansive self-mapping of the set. On the other hand, it is obvious that nontrivial nonexpansive mappings defined on unbounded sets may have fixed points. Consider, for example, simple rotations in the plane. However, in this case the mapping has bounded orbits. Indeed, the following result is found in the original 1965 paper of Kirk [3].

Theorem 1.1 Suppose K is a nonempty closed and convex subset of a reflexive Banach space, and suppose K has a normal structure. Suppose f:KK is a nonexpansive mapping, and suppose { f n (p)} is bounded for some (hence all) pK. Then f has a fixed point.

The proof rests on the following fact (also proved in [3]).

Lemma 1.1 Suppose K is a convex subset of a normed linear space and suppose f:KK is nonexpansive. If { f n (p)} is bounded for some pK, then some bounded convex subset of K is mapped into itself by f.

The above observations served as motivation for the following result.

Theorem 1.2 (Theorem 3.1 of [4])

Let C be a closed convex subset of a Banach space X, let be a finite commuting family of nonexpansive self-mappings of C, and suppose { f n (p)} is bounded for some pC and all fF. Then there is a nonempty bounded closed and convex subset of C which is mapped into itself by each member of .

This theorem in conjunction with Theorem 4 of [5] assures that in the setting of Theorem 1.1 finite commuting families of nonexpansive mappings with bounded orbits always have a common fixed point.

It is our objective in this paper to examine when analogs of the above results hold in broader contexts, and whether they hold for more general classes of mappings.

2 The setting

The results in this paper will depend strongly on the notions of metric convexity. The following definition is discussed in detail by Kohlenbach in [6].

(X,ρ,W) is called a hyperbolic space if (X,ρ) is a metric space and W:X×X×[0,1]X is a function satisfying

  1. (i)

    x,y,zX and λ[0,1],

    ρ ( z , W ( x , y , λ ) ) (1λ)ρ(z,x)+λρ(z,y);
  2. (ii)

    x,yX and λ 1 , λ 2 [0,1],

    ρ ( W ( x , y , λ 1 ) , W ( x , y , λ 2 ) ) =| λ 1 λ 2 |ρ(x,y);
  3. (iii)

    x,yX and λ[0,1], W(x,y,λ)=W(y,x,1λ);

  4. (iv)

    x,y,z,wX and λ[0,1],

    ρ ( W ( x , z , λ ) , W ( y , w , λ ) ) (1λ)ρ(x,y)+λρ(z,w).

If only condition (i) is satisfied, then (X,ρ,W) is a convex metric space in the sense of Takahashi (cf. [7]). The first three conditions are equivalent to saying (X,ρ,W) is a space of hyperbolic type in the sense of [8]. In this case the set

[x,y]:= { W ( x , y , λ ) : λ [ 0 , 1 ] }

is called the metric segment joining x and y (condition (iii) ensures that [x,y] is an isometric image of the real line interval [0,ρ(x,y)]). Hyperbolic spaces include all normed linear spaces and convex subsets thereof, as well as all CAT(0) spaces in the sense of Gromov (see [9]). Another important class of hyperbolic spaces are the so-called Busemann spaces (see [10]). These are precisely the hyperbolic spaces that are uniquely geodesic [11]. (We will not invoke condition (iv) in this paper.) For fixed point theory in these spaces, we refer the reader to [1218].

We say that a subset K of a Takahashi convex metric space is convex if W(x,y,λ)K for all x,yK and λ[0,1]. For some of our results discussed below this is all that is needed. With this convention all closed and open metric balls are convex and the intersection of any family of convex sets is also convex. We use B(x;r) to denote the closed ball centered at xX with radius r>0. We adopt the customary notation and write W(x,y,λ)=(1λ)xλy.

3 Preliminaries

We begin with an abstract version of Lemma 1.1.

Lemma 3.1 Suppose K is a convex subset of a Takahashi convex metric space and suppose f:KK is nonexpansive. If { f n (p)} is bounded for some pK, then some bounded convex subset of K is mapped into itself by f.

Proof Choose r>0 so that ρ(p, f n (p))r for each nN, and let K n =B( f n (p);r)K. If u K n , then ρ(u, f n (p))r; hence ρ(f(u), f n + 1 (p))ρ(u, f n (p))r, and it follows that f(u) K n + 1 . For each kN, let

W k = i = k K i .

Then f: W k W k + 1 . Also p W k for each k, so W k is nonempty. Clearly W k is convex and bounded (diam( W k )2r). Therefore { W k } k = 1 is an increasing sequence of uniformly bounded convex sets in K. It follows that W= k = 0 W k is a bounded convex set which is invariant under f. □

A Takahashi convex metric space X is said to have the FPP if every bounded closed convex subset of X has the fixed point property for nonexpansive mappings. In view of Lemma 3.1 the following is immediate.

Theorem 3.1 Let X be a Takahashi convex metric space which has the FPP, and let K be a nonempty closed and convex subset of X. Suppose f:KK is a nonexpansive mapping, and suppose { f n (p)} is bounded for some pK. Then f has a fixed point.

Remark 1 In connection with Theorem 3.1 the following example is noteworthy.

Example If K is an admissible subset (i.e., and intersection of closed balls) of a hyperconvex metric space X, then the set W in the proof of Lemma 3.1 is the union of an increasing sequence of admissible sets. However, the closure of W need not be admissible, or even hyperconvex. Stan Prus has given an example of a fixed point free nonexpansive mapping (actually an isometry) defined on H= which has bounded orbits. Indeed define T:HH by setting

T ( ( x 1 , x 2 , x 3 , ) ) = ( 1 + lim U x n , x 1 , x 2 , ) ,

where is a nontrivial ultrafilter on the set of positive integers. The mapping T is an isometry and has no fixed point. On the other hand, for nN,

T n ( ( 0 , 0 , 0 , ) ) = ( 1 , 1 , , 1 n -times , 0 , 0 , ) ,

so T has bounded orbits.

4 Eventually nonexpansive maps

In this section we point out that Theorem 3.1 extends to a wider class of mappings in more restricted settings.

Definition 4.1 Let (X,ρ) be a metric space. A mapping T:XX is said to be eventually uniformly Lipschitzian if there exist a sequence { k n } of positive numbers and an integer NN such that for all nN,

ρ ( T n x , T n y ) k n ρ(x,y)

for all x,yX. If lim n k n =1, T is said to be asymptotically nonexpansive. If k n 1 for n sufficiently large, T is said to be eventually nonexpansive (see [19]). The following lemma is obtained by slightly adjusting the argument in the proof of Lemma 3.1.

Lemma 4.1 Suppose K is a convex subset of a Takahashi convex metric space and suppose f:KK is a mapping which is eventually nonexpansive. If { f n (p)} is bounded for some pK, then there exist n 0 N and a bounded convex subset of K which is mapped into itself by each of the mappings f n , n n 0 .

Proof Choose r>0 so that ρ(p, f n (p))r for each nN, let K n =B( f n (p);r)K, and for each kN, let

W k = i = k K i .

Also p W k for each k, so W k is nonempty. Clearly W k is convex and bounded (diam( W k )2r). Therefore { W k } k = 1 is an increasing sequence of uniformly bounded convex sets in K. It follows that W= k = 0 W k is bounded and convex.

Since f is eventually nonexpansive, there exists n 0 N such that u K n ρ( f m (u), f n + m (p))ρ(u, f n (p))r for m n 0 . Thus f m (u) K n + m . So, for m sufficiently large, f m : K n K n + m . In particular, W ¯ is a bounded closed convex subset of K which is invariant under f m . □

Theorem 4.1 Let X be a reflexive or separable Banach space which has the FPP, let K be a closed convex subset of X, and suppose f:KK is eventually nonexpansive. If f n (p) is bounded for some pK, then f has a fixed point.

Proof Let W be as in Lemma 4.1. Then in particular W ¯ is a bounded closed convex set which in invariant under the commuting nonexpansive mappings f m and f m + 1 . One can now apply a classical result of Bruck [20] to conclude that f m and f m + 1 have a common fixed point which is necessarily a fixed point of f. □

ℝ-trees (or metric trees) are a class of hyperbolic spaces which have interesting geometric properties.

Definition 4.2 An ℝ-tree is a metric space X such that

  1. (i)

    there is a unique geodesic (metric) segment denoted by [x,y] joining each pair of points x and y in X; and

  2. (ii)

    [y,x][x,z]={x}[y,x][x,z]=[y,z].

Theorem 4.1 extends to complete ℝ-trees without any additional assumptions.

Theorem 4.2 Let (X,ρ) be a complete ℝ-tree, let K be a closed convex subset of X, and suppose f:KK is a mapping which is eventually nonexpansive and for which f n (p) is bounded for some pK. Then f has a fixed point.

Theorem 4.2 is an immediate consequence of the following two facts. Proposition 4.1 was first proved in [21]. For convenience of the reader, we repeat the proof here.

Theorem 4.3 ([22])

Let (X,ρ) be a complete ℝ-tree, and suppose T:XX has bounded orbits and satisfies, for all nN sufficiently large,

ρ ( T n x , T n y ) k n ρ(x,y)

for all x,yX, where lim sup n k n <2. Then T has a fixed point.

Proposition 4.1 Let (X,ρ) be a metric space and suppose T:XX is eventually uniformly Lipschitzian for a sequence { k n }, and suppose T has a bounded orbit. If lim sup n k n <, then all orbits of T are bounded.

Proof Assume there exist xX and r>0 such that { T n (x)}B(x;r). Choose k>0 so that lim sup n k n <k. Then, if yX, it is possible to choose mN so that for all nm,

ρ ( T n ( x ) , T n ( y ) ) kρ(x,y).

Then, for nm,

ρ ( x , T n ( y ) ) ρ ( x , T n ( x ) ) +ρ ( T n ( x ) , T n ( y ) ) r+kρ(x,y).

This proves that { T n ( y ) } n m B(x;d), where d=r+kρ(x,y). Let

d =max { ρ ( x , T i ( y ) ) : i = 1 , , m 1 } .

Then { T n (y)}B(x; d ), where d =max{d, d }. Since y is arbitrary, all orbits of T are bounded. □

Remark Some form of asymptotic control over the behavior of the mapping is needed for the validity of Proposition 4.1, even if the mapping is continuous and X is the real line. It is easy to construct continuous mappings of the real line that have exactly one fixed point and all other orbits are unbounded. However, it is shown in [21] that if T is assumed to be continuous in Theorem 4.3, then the assumption that lim sup n k n <2 may be replaced with the much weaker assumption that lim sup n k n <.

5 Bounded orbits of families of mappings

Our next theorem is an analog of Theorem 3.1 in [4] which is formulated there in a Banach space setting. Note that commutativity of appears (at least in some sense) to be essential to the proof. As noted in [4], this result shows that the assumption of strict convexity is not needed for Theorem 4 of [23]. (As Bula remarks in [23], this theorem is not true for infinite families.)

Theorem 5.1 Let (X,ρ) be a Takahashi convex metric space, and let K be a convex subset of X, and let be a finite commutative family of nonexpansive self-mappings of K. Suppose { f n (p)} is bounded for some (and hence all) pK and each fF. Then there is a bounded convex subset of K which is left invariant by each member of .

Proof We first prove the theorem when F={f,g}. The general case is a straightforward adaptation of this procedure (although the details are rather tedious). By assumption there exist r 1 , r 2 >0 such that { f n (p)}B(p; r 1 ) and { g n (p)}B(p; r 2 ). Thus, for m,nN,

ρ ( f n g m ( p ) , p ) ρ ( f n g m ( p ) , f n ( p ) ) + ρ ( f n ( p ) , p ) ρ ( g m ( p ) , p ) + ρ ( f n ( p ) , p ) r 2 + r 1 : = r .

Therefore { f n g m ( p ) } m , n = 1 B(p;r). For each m,nN, let

S n , m : = { u K : ρ ( u , f i g j ( p ) ) r i n , j m } = ( i n , j m B ( f i g j ( p ) ; r ) ) K ,

and let S= n , m = 1 S n , m . Because balls in X are convex, each of the sets S m , n is convex. Moreover, the family { S m , n } m , n = 1 is directed upward by set inclusion, so S is convex. Also, if u S n , m , then

ρ ( f ( u ) , f i g j ( u ) ) ρ ( u , f i 1 g j ( u ) ) ri1n,jm,

so f(u) S n + 1 , m . Similarly,

ρ ( g ( u ) , f i g j ( u ) ) = ρ ( g ( u ) , g f i g j 1 ( u ) ) ρ ( u , f i g j 1 ( u ) ) r i n , j 1 m

and g(u) S n , m + 1 . (Notice that here we use the fact that the mappings f and g commute.) It follows that S is a bounded convex set which is invariant under both f and g.

We now briefly indicate how to prove Theorem 5.1 in its full generality. (The assertion in [4] that the general case follows by induction seems to oversimplify the situation.) Suppose F={ f 1 ,, f k } and let

r 0 =sup { ρ ( p , f j n ( p ) ) : 1 j k , n = 1 , 2 , } .

Then

ρ ( p , f 1 i 1 f 2 i 2 f k i k ( p ) ) ρ ( p , f 1 i 1 ( p ) ) + ρ ( f 1 i 1 ( p ) , f 1 i 1 f 2 i 2 f k i k ( p ) ) r 0 + ρ ( p , f 2 i 2 f k i k ( p ) ) r 0 + ρ ( p , f 2 i 2 ( p ) ) + ρ ( f 2 i 2 ( p ) , f 2 i 2 f k i k ( p ) ) 2 r 0 + ρ ( p , f 3 i 3 f k i k ( p ) ) k r 0 : = r .

Let

S( i 1 , i 2 ,, i k )= m j i j B ( f 1 m 1 f 2 m 2 f k m k ( p ) ; r ) K.

Then p is in each of the sets S( i 1 , i 2 ,, i k ). The family

{ S ( i 1 , i 2 , , i k ) }

of convex sets is directed upward by set inclusion because any two sets

S( i 1 , i 2 ,, i k )andS( j 1 , j 2 ,, j k )

are contained in S( n 1 , n 2 ,, n k ), where n ν =max( i ν , j ν ), ν=1,,k. Let

S= i 1 , , i k = 1 S( i 1 , i 2 ,, i k ).

Then S is a bounded convex set which is invariant under each of the mappings in . □

Theorem 5.1 has a different proof if the space X is of hyperbolic type. For this we need the following fact. Recall that a mapping f of a metric space (X,ρ) into itself is said to be asymptotically regular if for each xX, lim n ρ( f n (x), f n + 1 (x))=0. The following is a consequence of results of [8]; also see [24].

Proposition 5.1 Let K be a bounded convex subset of a space (X,ρ) of hyperbolic type, and suppose f:KK is nonexpansive. Fix α(0,1), and define f α :KK by setting f α (x)=αx(1α)f(x). Then f α is asymptotically regular. In particular, inf{ρ(x,f(x)):xK}=0.

Second proof of Theorem 5.1 We consider only the case F={f,g}. If X is of hyperbolic type, in view of Lemma 3.1 some bounded convex subset H of K is mapped into itself by g. Consequently, by Proposition 5.1

inf { ρ ( x , g ( x ) ) : x H } =0.

Let δ>0 and choose pH such that ρ(p,g(p))δ. Let

F δ (g):= { x K : ρ ( x , g ( x ) ) δ } .

Clearly g: F δ (g) F δ (g). Let x F δ (g). Then

ρ ( g f ( x ) , f ( x ) ) =ρ ( f g ( x ) , f ( x ) ) ρ ( g ( x ) , x ) δ.

Therefore it is also the case that f: F δ (g) F δ (g), and thus f i g j (p)=g f i g j 1 (p) for all i,j0.

The proof is now completed as in the first proof. □

Remark 2 An interesting feature of the second proof is that it is only necessary to assume that f and g commute on the set F δ (g) for some δ>0 rather than on the entire domain.

6 A condition of Djebali-Hammache

In [25] the authors present some new versions of fixed point theorems for nonexpansive mappings defined on closed, convex subsets of Banach spaces which are not necessarily bounded. In this section we discuss a result which they compare with Theorem 2.4 of [4] (see below). The following definition and notation are taken from [25].

Definition 6.1 Let Q be a nonempty closed convex subset of a Banach space X. A mapping f:QX is said to have the property (K) if there exists a nonempty bounded closed convex subset KX such that f(QK)K.

(Implicit in the above is the assumption also that QK.)

Notation 1 Define the set

S=S(f,Q)= { { x n } Q : x n = ( 1 1 n ) f ( x n ) n N } .
(6.1)

By the Banach contraction mapping theorem, this set is always nonempty if f is nonexpansive and Q is a nonempty convex subset of X which contains the origin.

Now let AX be nonempty and bounded, and let α(A) denote the Kuratowski measure of noncompactness of A. For ε,c>0 with 0<c<α(A)+ε, set

N ε c (A)= { ( x , y ) A 2 : c x y α ( A ) + ε } .

This set is denoted by N ε c (f,A) when A depends explicitly on some function f.

Let S be given by (6.1), and for any closed bounded convex subset K of X, define

S K =SK.

The following is Theorem 3.2 of [25]. Here

F δ 0 (f, S K )= { x S K : x f ( x ) δ 0 } .

Theorem 6.1 Let X be a Banach space, Q be a convex closed subset of X containing the origin, and let f:QQ be a nonexpansive mapping satisfying property (K). Let K be the bounded closed convex subset of X whose existence is assured by Definition  6.1. Assume that there exist δ 0 , ε 0 >0 such that c(0,α( S K )+ ε 0 ),

[ F δ 0 ( f , S K ) × F δ 0 ( f , S K ) ] N ε 0 c (f, S K )=.
(6.2)

Then f has a fixed point.

This theorem is an immediate consequence of the following lemma (Lemma 3.1 in [25]).

Lemma 6.1 Under the assumptions of Theorem  6.1, α( S K )=0.

A Banach space X is said to have the FPP if each of its bounded closed convex subsets has the fixed point property for nonexpansive self-mappings. The following is Theorem 2.4 of [4].

Theorem 6.2 Let X be a Banach space which has the FPP, let C be a closed convex subset of X, and suppose f:CC is a nonexpansive mapping for which F δ (f,C) is nonempty and bounded for some δ>0. Then f has a fixed point.

The authors of [25] compare Theorem 6.1 with Theorem 6.2 and remark that in Theorem 6.1 the boundedness of F δ (f,Q) is relaxed and the assumption that the space has the FPP is dropped. However, the added condition in Theorem 6.1 that the mapping satisfies property (K) in conjunction with the fact that f:QQ implies f:QKQK immediately reduces Theorem 6.1 to the bounded case. Also, the nonexpansiveness of f is used in the proof of Theorem 6.1 only to guarantee the existence of an approximate fixed point sequence for f and to guarantee that f is continuous. Finally, condition (6.2) in Theorem 6.1 is deceptively strong and, as the following result shows, Theorem 6.1 is essentially trivial.

Theorem 6.3 Let X be a Banach space, Q be a subset of X, let f:QQ be a mapping, and suppose f has a bounded approximate fixed point sequence S in Q. Also assume that there exist δ 0 , ε 0 >0 such that c(0,α(S)+ ε 0 ),

[ F δ 0 ( f , S ) × F δ 0 ( f , S ) ] N ε 0 c (f,S)=.
(6.3)

Then S is finite. (Thus, f can have no nontrivial approximate fixed point sequence.)

The proof of this theorem hinges on the fact that since c(0,α(S)+ ε 0 ) is arbitrary, condition (6.3) actually implies the following. There exist δ 0 , ε 0 >0 such that for x,yS, if xf(x) δ 0 and yf(y) δ 0 , then xy<α(S)+ ε 0 x=y. Otherwise one could take c=xy and conclude that

[ F δ 0 ( f , S ) × F δ 0 ( f , S ) ] N ε 0 c (f,S).

We omit the details since a more general theorem is proved below.

There is a weaker version of condition (6.3) that is somewhat more realistic. In fact this appears to be the version the authors of [25] actually use in their applications.

In the following (X,ρ) denotes a metric space, QX and f:QQ. For δ>0, F δ (f,S) and for ε>0 and c(0,α(S)+ε), N ε c (f,S) denote their Banach space analogs defined above with ρ() replacing .

Theorem 6.4 Let Q be a closed subset of a complete metric space (X,ρ), and suppose f:QQ is a mapping which has a bounded approximate fixed point sequence S. Assume that there exists ε>0 such that c(0,α(S)+ε) there exists δ>0 such that

[ F δ ( f , S ) × F δ ( f , S ) ] N ε c (f,S)=.
(6.4)

Then α(S)=0. In particular, if f is continuous, then f has a fixed point.

Proof Let S:={ x n } and assume α(S)>0. Then, by passing to a subsequence if necessary, we may further assume that there exists c>0 such that for x,yS, xyρ(x,y)c. Also, by the definition of α, there exist subsets of { Ω i } i = 1 m of S such that S i = 1 m Ω i and such that for each i{1,,m}, diam( Ω i )α(S)+ε. Therefore, for x,y Ω i ,

xycρ(x,y)α(S)+ε;

thus (x,y) N ε c (S). Now choose i{1,,m} such that Ω i is infinite. Then Ω i contains an infinite number of terms of { x n } which lie in F δ (f,S). In particular it is possible to choose x,y Ω i such that xy and such that (x,y)[ F δ (f,S)× F δ (f,S)]. Therefore

(x,y) [ F δ ( f , S ) × F δ ( f , S ) ] N ε c (S),

which contradicts (6.4). □

Remark In view of Theorem 6.4, condition (6.4) reduces to the following assumption. Given c(0,ε) there exists δ(c)>0 such that

ρ ( x , f ( x ) ) δ ( c ) , ρ ( y , f ( y ) ) δ ( c ) } ρ(x,y)<corρ(x,y)>ε.

Now suppose u and v are fixed points of f with uv. Choose c(0,ε) so that c<ρ(u,v). Since ρ(u,f(u))δ(c) and ρ(v,f(v))δ(c), it must be the case that ρ(u,v)>ε. Thus condition (6.4) implies that the fixed point set of f is always discrete.

We conclude with an application of Theorem 6.4 to mappings that are not necessarily continuous. Recall that the mapping f:QQ is said to satisfy Suzuki’s condition (C) on Q if

1 2 ρ ( x , f ( x ) ) ρ(x,y)ρ ( f ( x ) , f ( y ) ) ρ(x,y)

for all x,yQ (see [26]).

Theorem 6.5 Let Q be a bounded closed subset of a complete metric space (X,ρ), and suppose f:QQ is a mapping which has a bounded approximate fixed point sequence S. Assume that there exists ε>0 such that c(0,α(S)+ε) there exists δ>0 such that

[ F δ ( f , S ) × F δ ( f , S ) ] N ε c (f,S)=.
(6.5)

If f satisfies Suzuki’s condition (C), then f has a fixed point.

Proof We follow the argument used in Theorem 2 of [26]. It follows from Theorem 6.4 that α(S)=0. There exists a subsequence { x n } of S and zQ such that { x n } converges to z. By Lemma 7 of [26] (which can be formulated for metric spaces), we have

ρ ( x n , f ( z ) ) 3ρ ( x n , f ( x n ) ) +ρ( x n ,z)
(6.6)

for all n. So { x n } converges to f(z) and hence f(z)=z. □

Remark If Q is a bounded convex subset of a Banach space and f satisfies Suzuki’s condition (C), then f always has a bounded approximate fixed point sequence by Lemma 6 of [26].

7 Historical comment about bounded orbits

A G-space R in the sense of Busemann [27] is a metric space which is (i) finitely compact (or proper, i.e., bounded closed sets are compact), (ii) metrically convex, and for which (iii) prolongation is locally possible and unique. Precisely, (iii) means that to every point pR there corresponds a number ρ p >0 such that if x,yU(p; ρ p ) (the open ball) with xy, there exists a point zR for which

d(x,y)+d(y,z)=d(x,z);

and moreover, if d(x,y)+d(y, z 1 )=d(x, z 1 ) and d(x,y)+d(y, z 2 )=d(x, z 2 ), then d(y, z 1 )=d(y, z 2 ) z 1 = z 2 .

Theorem 7.1 ([28])

If R is a straight G-space (has unique metric segments) which has convex spheres, and if ϕ is a motion of R (an isometry of R onto itself) for which { ϕ n (p)} is bounded for some pR, then ϕ has a fixed point.

It was subsequently shown in Kirk [29] that it suffices to assume only that some subsequence of { ϕ n (p)} is bounded in Theorem 7.1, an assumption later shown by Całka [30] to be (nontrivially) equivalent to the original.