Introduction

The purpose of this paper is to give an outline of a common fixed point theory for nonexpansive mappings defined on some subsets of modular function spaces. These spaces are natural generalizations of both function and sequence variants of many important, from applications perspective, spaces like Lebesgue, Orlicz, Musielak-Orlicz, Lorentz, Orlicz-Lorentz, Calderon-Lozanovskii spaces and many others. The current paper operates within the framework of convex function modulars. The importance for applications of nonexpansive mappings in modular function spaces consists in the richness of structure of modular function spaces, that-besides being Banach spaces (or F-spaces in a more general settings)-are equipped with modular equivalents of norm or metric notions, and also are equipped with almost everywhere convergence and convergence in submeasure. In many cases, particularly in applications to integral operators, approximation and fixed point results, modular type conditions are much more natural as modular type assumptions can be more easily verified than their metric or norm counterparts. There are also important results that can be proved only using the apparatus of modular function spaces. From this perspective, the fixed point theory in modular function spaces should be considered as complementary to the fixed point theory in normed spaces and in metric spaces.

The theory of contractions and nonexpansive mappings defined on convex subsets of Banach spaces has been well developed since the 1960s (see e.g. [16]), and generalized to other metric spaces (see e.g. [79]), and modular function spaces (see e.g. [1012]).

In this paper, we invesigate the structure of the fixed point set of ρ-nonexpansive mappings. In particular, we introduce and investigate the concept of one-local retracts in the framework of modular function spaces. Then we show a common fixed point in this setting.

Preliminaries

Let Ω be a nonempty set and ∑ be a nontrivial σ-algebra of subsets of Ω. Let P be a δ-ring of subsets of Ω, such that E A P for any E P and A ∈ ∑. Let us assume that there exists an increasing sequence of sets K n P such that Ω = ∪K n . By ℰ we denote the linear space of all simple functions with supports from P. By ℳ we will denote the space of all extended measurable functions, i.e. all functions f: Ω → [-∞, ∞] such that there exists a sequence{g n } ⊂ ℰ, |g n | ≤ | f | and g n (ω) → f(ω) for all ω ∈ Ω By 1 A we denote the characteristic function of the set A.

Definition 2.1. Let ρ: ℳ → [0, ∞] be a notrivial, convex and even function. We say that ρ is a regular convex function pseudomodular if:

  1. (i)

    ρ(0) = 0;

  2. (ii)

    ρ is monotone, i.e. |f(ω)||g(ω)| for all ω ∈ Ω implies ρ(f) ≤ ρ(g), where f, g ∈ ℳ;

  3. (iii)

    ρ is orthogonally subadditive, i.e ρ(f 1 A∪B ) ≤ ρ(f 1 A )+ρ(f 1 B ) for any A, B ∈ ∑ such that A ∩ B ≠ ∅, f ∈ ℳ;

  4. (iv)

    ρ has the Fatou property, i.e. |f n (ω)|↑|f(ω)| for all ω ∈ Ω implies ρ(f n ) ↑ρ(f), where f ∈ ℳ;

  5. (v)

    ρ is order continuous in ℰ, i.e. g n ∈ ℰ and |g n (ω)| ↓ 0 implies ρ(g n ) ↓ 0.

Similarly as in the case of measure spaces, we we say that a set A ∈ ∑ is ρ-null if ρ(g 1 A ) = 0 for every g ∈ ℰ. We say that a property holds ρ-almost everywhere if the exceptional set is ρ-null. As usual we identify any pair of measurable sets whose symmetric difference is ρ-null as well as any pair of measurable functions differing only on a ρ-null set. With this in mind we define

M ( Ω , Σ , P , ρ ) = { f M ; | f ( ω ) | < ρ - a . e } ,
(2.1)

where each fM ( Ω , Σ , P , ρ ) is actually an equivalence class of functions equal ρ-a.e. rather than an individual function. Where no confusion exists we will write ℳ instead of M ( Ω , Σ , P , ρ ) .

Definition 2.2. Let ρ be a regular function pseudomodular.

  1. (1)

    We say that ρ is a regular convex function semimodular if ρ(αf) = 0 for every α > 0 implies f = 0 ρ - a.e.;

  2. (2)

    We say that ρ is a regular convex function modular if ρ(f) = 0 implies f = 0 ρ - a.e.;

The class of all nonzero regular convex function modulars defined on Ω will be denoted by ℜ.

Let us denote ρ(f, E) = ρ (f 1 E ) for f ∈ ℳ, E ∈ ∑. It is easy to prove that ρ(f, E) is a function pseudomodular in the sense of Def. 2.1.1 in [13] (more precisely, it is a function pseudomodular with the Fatou property). Therefore, we can use all results of the standard theory of modular function spaces as per the framework defined by Kozlowski in [1315], see also Musielak [16] for the basics of the general modular theory.

Definition 2.3. [1315] Let ρ be a convex function modular.

  1. (a)

    A modular function space is the vector space L ρ (Ω, ∑), or briefly L ρ , defined by

    L ρ = { f M ; ρ ( λ f ) 0 a s λ 0 } .
  2. (b)

    The following formula defines a norm in L ρ (frequently called Luxemburg norm):

    f ρ = inf { α > 0 ; ρ ( f / α ) 1 } .

In the following theorem, we recall some of the properties of modular spaces that will be used later on in this paper.

Theorem 2.1. [1315]Let ρ ∈ ℜ.

  1. (1)

    L ρ , || f || ρ is complete and the norm || · || ρ is monotone w.r.t. the natural order in ℳ.

  2. (2)

    || f n || ρ → 0 if and only if ρ(af n ) → 0 for every α > 0.

  3. (3)

    If ρ (αf n ) → 0 for an α > 0 then there exists a subsequence {g n } of {f n } such that g n → 0 ρ - a.e.

  4. (4)

    If {f n } converges uniformly to f on a set E P then ρ (α (f n - f), E) → 0 for every α > 0.

  5. (5)

    Let f n f ρ - a.e. There exists a nondecreasing sequence of sets H k P such that H k ↑ Ω and {fn} converges uniformly to f on every H k (Egoroff Theorem).

  6. (6)

    ρ(f) ≤ lim inf ρ(f n ) whenever f n f ρ - a.e. (Note: this property is equivalent to the Fatou Property).

  7. (7)

    Defining L ρ 0 = { f L ρ ; ρ ( f , ) is order continuous} and E ρ = { f L ρ ; λ f L ρ 0 f o r e v e r y λ > 0 } we have:

  8. (a)

    L ρ L ρ 0 E ρ ,

  9. (b)

    E ρ has the Lebesgue property, i.e. ρ (αf, D k ) → 0 for α > 0, fE ρ and D k ↓ ∅.

  10. (c)

    E ρ is the closure of ℰ (in the sense of || · || ρ ).

The following definition plays an important role in the theory of modular function spaces.

Definition 2.4. Let ρ ∈ ℜ. We say that ρ has the Δ2-property if sup  n ρ ( 2 f n , D k ) 0 whenever D k ↓ ∅ and sup  n ρ ( f n , D k ) 0.

Theorem 2.2. Let ρ ∈ ℜ. The following conditions are equivalent:

  1. (a)

    ρ has Δ2,

  2. (b)

    L ρ 0 is a linear subspace of L ρ ,

  3. (c)

    L ρ = L ρ 0 = E ρ ,

  4. (d)

    if ρ (f n ) → 0 then ρ(2f n ) → 0,

  5. (e)

    if ρ(αf n ) → 0 for an α > 0 then || f n || ρ → 0, i.e. the modular convergence is equivalent to the norm convergence.

The following definition is crucial throughout this paper.

Definition 2.5. Let ρ ∈ ℜ.

  1. (a)

    We say that {f n } is ρ-convergent to f and write f n → 0 (ρ) if and only if ρ(f n - f) → 0.

  2. (b)

    A sequence {f n } where f n L ρ is called ρ-Cauchy if ρ (f n - f m ) → 0 as n, m → ∞.

  3. (c)

    A set BL ρ is called ρ-closed if for any sequence of f n B, the convergence f n → f (ρ) implies that f belongs to B.

  4. (d)

    A set BL ρ is called ρ-bounded if sup{ρ (f - g); fB, gB} <

  5. (e)

    Let fL ρ and CL ρ . The ρ-distance between f and C is defined as

    d ρ ( f , C ) = inf  { ρ ( f - g ) ; g C } .

Let us note that ρ-convergence does not necessarily imply ρ-Cauchy condition. Also, f n f does not imply in general λf n λf, λ > 1. Using Theorem 2.1 it is not difficult to prove the following

Proposition 2.1. Let ρ ∈ ℜ.

  1. (i)

    L ρ is ρ-complete,

  2. (ii)

    ρ-balls B ρ (x, r) = {yL ρ ; ρ(x - y) ≤ r} are ρ-closed.

The following property plays in the theory of modular function spaces a role similar to the reflexivity in Banach spaces (see e.g. [11]).

Definition 2.6. We say that L ρ has property (R) if and only if every nonincreasing sequence {C n } of nonempty, ρ-bounded, ρ-closed, convex subsets of L ρ has nonempty intersection.

Throughout this paper we will need the following.

Definition 2.7. Let ρ ∈ ℜ and CL ρ be nonempty.

  1. (a)

    By the ρ-diameter of C, we will understand the number

    δ ρ ( C ) = sup  { ρ ( f - g ) ; f , g C } .

The subset C is said to be ρ-bounded whenever δ ρ (C) < ∞.

  1. (b)

    The quantity r ρ (f, C) = sup{ρ(f - g);gC} will be called the ρ-Chebyshev radius of C with respect to f.

  2. (c)

    The ρ-Chebyshev radius of C is defined by R ρ (C) = inf {r ρ (f, C); fC}.

  3. (d)

    The ρ-Chebyshev center of C is defined as the set

    C ρ ( C ) = { f C ; r ρ ( f , C ) = R ρ ( C ) } .

Note that R ρ (C) ≤ r ρ (f, C) ≤ δ ρ (C) for all fC and observe that there is no reason, in general, for C ρ C to be nonempty.

Let us finish this section with the modular definitions of ρ-nonexpansive mappings. The definitions are straightforward generalizations of their norm and metric equivalents.

Definition 2.8. Let ρ ∈ ℜ and CL ρ be nonempty and ρ-closed. A mapping T: CC is called a ρ-nonexpansive mapping if

ρ ( T ( f ) - T ( g ) ) ρ ( f - g ) f o r a n y f , g C .

A point fC is called a fixed point of T whenever T(f) = f. The set of fixed point of T is denoted by Fix(T).

Penot compactness of admissible sets

The following definition is needed.

Definition 2.9. Let ρ ∈ ℜ and CL ρ be nonempty and ρ-bounded. We say that A is an admissible subset of C if

A = i I B ρ ( b i , r i ) C ,

where b i C, r i ≥ 0 and I is an arbitrary index set. By A ( C ) we denote the family of all admissible subsets of C.

Note that if C is ρ-bounded, then C A ( C ) . In order to prove an analogue of Kirk's fixed point theorem [3], Penot [17] introduced the following definition.

Definition 2.10. Let ρ ∈ ℜ and CL ρ be nonempty.

  1. (1)

    We will say that A ( C ) is ρ-normal if for any nonempty A A ( C ) , which has more than one point, we have R ρ (A) < δ ρ (A).

  2. (2)

    We will say that A ( C ) is compact if for any family { A α } α Γ A ( C ) we have

    α Γ A α ,

provided that α F A α for any finite subset F of Γ.

Clearly if A ( L ρ ) is compact, then L ρ has property (R). In [18], the authors discussed the concept of uniform convexity in modular function spaces. In particular they proved that uniform convexity implies the property (R). Next, we show that uniform convexity implies compactness in the sense of Penot [17] of the family of convex sets. First, let us recall the definition of uniform convexity in modular function spaces. For more on this, the reader may consult [18].

Definition 2.11. Let ρ ∈ ℜ.

  1. (i)

    Let r > 0, ε > 0. Define

    D ( r , ε ) = ( f , g ) ; f , g L ρ , ρ ( f ) r , ρ ( g ) r , ρ f - g 2 ε r .

Let

δ ( r , ε ) = inf 1 - 1 r ρ f + g 2 ; ( f , g ) D ( r , ε ) , i f D ( r , ε ) ,

and δ(r, ε) = 1 if D(r, ε) = ∅. We say that ρ satisfies (UC) if for every r > 0, ε > 0, δ(r, ε) > 0. Note, that for every r > 0, D(r, ε) ≠ ∅, for ε > 0 small enough.

  1. (ii)

    We say that ρ satisfies (UUC) if for every s ≥ 0, ε > 0 there exists

    η ( s , ε ) > 0

depending on s and ε such that

δ ( r , ε ) > η ( s , ε ) > 0 f o r r > s .
  1. (iii)

    We say that ρ is Strictly Convex, (SC), if for every f, gL ρ such that ρ(f) = ρ(g) and

    ρ f + g 2 = ρ ( f ) + ρ ( g ) 2

there holds f = g.

Note that in [11], the authors proved that in Orlicz spaces over a finite, atomless measure space, both conditions (UC) and (UUC) are equivalent. Typical examples of Orlicz functions that do not satisfy the Δ2 condition but are uniformly convex are: φ1(t) = e|t|-|t|-1 and φ 2 ( t ) = e t 2 -1. In these cases, the associated modular is (UUC).

It is shown in [18], that if ρ ∈ ℜ is (UUC), then for any nonempty, convex, and ρ-closed CL ρ , and any fL ρ such that d = d ρ (f, C) < ∞, there exists a unique best ρ-approximant of f in C, i.e. a unique g0C such that

ρ ( f - g 0 ) = d ρ ( f , C ) = inf { ρ ( f - g ) ; g C } .

Moreover it is also shown in [18] that if ρ ∈ ℜ is (UUC), then for any nonincreasing sequence {C n } of nonempty, convex, and ρ-closed subsets of L ρ , we have ∩n ≥ 1C n ≠ ∅, provided there exists fL ρ such that sup  n 1 d ρ ( f , C n ) <. The authors in [18] did not show that such conclusion is still valid for any decreasing family. A property useful to get the compactness of the admissible subsets.

Theorem 2.3. Let ρ ∈ ℜ. Assume ρ ∈ ℜ is (UUC). Let {C α }α∈Γbe a decreasing family of nonempty, convex, ρ-closed subsets of L ρ , where (Γ,≺) is upward directed. Assume that there exists f ∈ L ρ such that sup  α Γ d ρ ( f , C α ) <. Then, ∩α∈ΓC α ≠ ∅.

Proof. Set d= sup  α Γ d ρ ( f , C α ) . Without loss of generality, we may assume d > 0. For Any n ≥ 1, there exists a n ∈ Γ such that

d 1 - 1 n < d ρ ( f , C α n ) d .

Since (Γ,≺) is upward directed, we may assume α n αn+1. In particular we have C α n + 1 C α n for any n ≥ 1. Since ρ is (UUC), we get C 0 = n 1 C α n . Clearly C0 is ρ-closed and

d ρ ( f , C 0 ) = sup  n 1 d ρ ( f , C α n ) = d .

Again using the property (UUC) satisfied by ρ, there exists g0C0 unique such that d ρ (f, C0) = ρ (f - g0). Let us prove that g0C α for any α ∈ Γ. Fix α ∈ Γ. If for some n ≥ 1 we have αα n , then obviously we have g 0 C α n C α .

Therefore let us assume that αα n , for any n ≥ 1. Since Γ is upward directed, there exists β n ∈ Γ such that α n β n and αβ n for any n ≥ 1. We can also assume that β n βn+1for any n ≥ 1. Again we have C 1 = n 1 C β n . Since C β n C α n , for any n ≥ 1, we get C1C0. Moreover we have

d = d ρ ( f , C 0 ) d ρ ( f , C 1 ) = sup  n 1 d ρ ( f , C β n ) d .

Hence, d ρ (f, C1) = d which implies the existence of a unique point g1C1 such that d ρ (f, C1) = ρ(f - g1) = d. Since ρ is uniformly convex, it must be (SC). Hence, g0 = g1. In particular, we have g 0 C β n , for any n ≥ 1. Since αβ n , we get C β n C α , for any n ≥ 1, which implies g0C α . Since α was taking arbitrary in Γ, we get g0 ∈ ∩α∈Γ Cα, which implies ∩α∈Γ Cα ≠ ∅.    □

Since ρ is convex, ρ-closed balls are convex. Theorem 2.3 implies the following.

Corollary 2.1. Let ρ ∈ ℜ and CL ρ be nonempty, convex, ρ-closed, and ρ-bounded. Assume ρ is (UUC). Then A ( C ) is compact.

Remark 2.1. Note that under the above assumptions, A ( C ) is ρ-normal. Indeed let A A ( C ) nonempty and not reduced to one point. Let f, gA such that f ≠ g. Then ρ ( f - g 2 ) >0. Since ρ is (UUC), there exists η > 0 such that for any hA, we have

ρ h - f + g 2 ( 1 - η ) δ ρ ( A ) .

Hence, r ρ f + g 2 , A ( 1 - η ) δ ρ ( A ) , which implies R ρ (A) < δ ρ (A).

Finally, we state Penot's formulation of Kirk's fixed point theorem in modular function spaces. For the sake of completeness we will give its proof.

Theorem 2.4. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. Then any ρ-nonexpansive T: CC has a fixed point.

Proof. Since C is ρ-bounded, then we have C A ( C ) . Since A ( C ) is compact, the family F= { A A ( C ) ; T ( A ) A } has a minimal element K. Set

K 0 = { A ; A A ( C ) and T ( K ) A } K .

Note that T(K) ⊂ K0. This implies that K0 is nonempty and belongs to A ( C ) . Moreover since K0K, we get T(K0) ⊂ T(K) ⊂ K0. Hence K0 ∈ ℱ. The minimality of K implies that K = K0. Next let fK. By definition of the ρ-Chebyshev radius r ρ (f, K), we have KB ρ (f, r ρ (f, K)). Since T is ρ- nonexpansive, we have T(K) ⊂ B ρ (T(f), r ρ (f, K)). The definition of K0 implies K0B ρ (T(f), r ρ (f, K)). Since K = K0, we get KB ρ (T (f), r ρ (f, K)), which implies r ρ (T(f), K) ≤ r ρ (f, K). Fix fK and set r = r ρ (f, K). We have

K 1 = { g K ; r ρ ( g , K ) r } = h K B ρ ( h , r ) K .

Clearly, we have T(K1) ⊂ K1 and K 1 A ( C ) . Since K is minimal, we get K = K1 which implies that the ρ-Chebyshev radius r ρ (f, K) is constant. In particular, we have r ρ (f, K) = δ ρ (K), for any fK. Since A ( C ) is ρ-normal, we conclude that K does not have more than one point. Therefore, K = {f} which forces T (f) = f.    □

In the next section, we investigate the structure of the fixed point set of ρ-nonexpansive mappings.

One-local retract subsets in modular function spaces

Let ρ ∈ ℜ and CL ρ be nonempty. A nonempty subset D of C is said to be a one-local retract of C if for every family {B i ; i ∈ I} of ρ-balls centered in D such that C ∩ (∩iIB i ) ≠ ∅, it is the case that D ∩ (∩iIB i ) ≠ ∅. It is immediate that each ρ-nonexpansive retract of L ρ is a one-local retract (but not conversely). Recall that DC is a ρ-nonexpansive retract of C if there exists a ρ-nonexpansive map R: CD such that R(f) = f, for every fD.

The following result will shed some light on the interest generated around this concept.

Theorem 2.5. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. Then for any ρ-nonexpansive mapping T: CC, the fixed point set Fix(T) is a nonempty one-local retract of C.

Proof. Theorem 2.4 shows that Fix(T) is nonempty. Let us complete the proof by showing it is a one-local retract of C. Let {B ρ (f i , r i )}iIbe any family of ρ-closed balls such that f i ∈ Fix(T), for any iI, and

C 0 = C i I B ρ ( f i , r i ) .

Let us prove that Fix (T) ∩ (∩iIB ρ (f i , r i )) ≠ ∅. Since {fi}iI⊂ Fix(T), and T is ρ-nonexpansive, then T(C0) ⊂ C0. Clearly, C 0 A ( C ) and is nonempty. Then we have A ( C 0 ) A ( C ) . Therefore, A ( C 0 ) is compact and ρ-normal. Theorem 2.4 will imply that T has a fixed point in C0 which will imply

Fix ( T ) i I B ρ ( f i , r i ) .

   □

This result gives some information to the structure of the fixed point set. To the best of our knowledge this is the first attempt done in modular function spaces. Next we discuss some properties of one-local retract subsets.

Theorem 2.6. Let ρ ∈ ℜ and CL ρ be nonempty. Let D be a nonempty subset of C. The following are equivalent.

  1. (i)

    D is a one-local retract of C.

  2. (ii)

    D is a ρ-nonexpansive retract of D ∪ {f}, for every fC.

Proof. let us prove (i) ⇒ (ii). Let fC. We may assume that fD. In order to construct a ρ-nonexpansive retract R: D ∪ {f} → D, we only need to find R(f) ∈ D such that

ρ ( R ( f ) - g ) ρ ( f - g ) , for every  g D .

Since f ∈ ∩g∈DB ρ (g, ρ(f-g)) and fC, then

C g D B ρ ( g , ρ ( f - g ) ) .

Since D is a one-local retract of C, we get

D 0 = D g D B ρ ( g , ρ ( f - g ) ) .

Any point in D0 will work as R(f).

Next, we prove that (ii) ⇒ (i). In order to prove that D is a one-local retract of C, let {B ρ (f i , r i )}iIbe any family of ρ-closed balls such that f i D, for any iI, and

C 0 = C i I B ρ ( f i , r i ) .

Let us prove that D ∩ (∩iIB ρ (f i , r i )) = ∅. Let fC0. If fD, we have nothing to prove. Assume otherwise that fD. Property (ii) implies the existence of a ρ-nonexpansive retract R: D ∪ {f} → C. It is easy to check that R(f) ∈ D ∩ (∩iIB ρ (f i , r i )) = ∅, which completes the proof of our theorem. □

The following technical lemma will be useful for the next results.

Lemma 2.1. Let ρ ∈ ℜ and CL ρ be nonempty, and ρ-bounded. Let D be a nonempty one-local retract of C. Set c o C ( D ) =C ( { A ; A A ( C ) and DA}). Then

  1. (i)

    r ρ (f, D) = r ρ (f, co C (D)), for any fC;

  2. (ii)

    R ρ (co C (D)) = R ρ (D);

  3. (iii)

    δ ρ (co C (D)) = δ ρ (D).

Proof. Let us first prove (i). Fix fC. Since Dco C (D), we get r ρ (f, D) ≤ r ρ (f, co C (D)). Set r = r ρ (f, D). We have D B ρ ( f , r ) A ( C ) . The definition of co C (D) implies co C (D) ⊂ B ρ (f, r). Hence r ρ (f, co C (D)) ≤ r = r ρ (f, D), which implies r ρ (f, D) = r ρ (f, co C (D)).

Next, we prove (ii). Let fD. We have fco C (D). Using (i), we get r ρ (f, D) = r ρ (f, co C (D)) ≥ R ρ (co C (D)). Hence, R ρ (D) ≥ R ρ (co C (D)). Next, let fco C (D) and set r = r ρ (f, co C (D)). We have Dco C (D) ⊂ B ρ (f, r). Hence, f ∈ ∩gDB ρ (g, r). Hence, C ∩ (∩gDB ρ (g, r)) = ∅. Since D is a one-local retract of C, we get D0 = D ∩ (∩gDB ρ (g, r)) = ∅. Let gD0. Then it is easy to see that r ρ (g, D) ≤ r. Hence, R ρ (D) ≤ r. Since f was arbitrary taken in co C (D), we get R ρ (D) ≤ R ρ (co C (D)), which implies R ρ (D) = R ρ (co C (D)).

Finally, let us prove (iii). Since Dco C (D), we get δ ρ (D) ≤ δ ρ (co C (D)). Next set d = δ ρ (D). Then, for any fD, we have DB ρ (f, d). Hence co C (D) ⊂ B ρ (f, d). This implies f g c o C ( D ) ) B ρ ( g , d ) . Sice f was taken arbitrary in D, we get D g c o C ( D ) ) B ρ ( g , d ) . The definition of co C (D) implies c o C ( D ) g c o C ( D ) ) B ρ ( g , d ) . So for any f, gco C (D), we have ρ(f - g) ≤ d. Hence δ ρ (co C (D)) ≤ d = δ ρ (D), which implies δ ρ (D) = δ ρ (co C (D)). □

As an application of this lemma we get the following result.

Theorem 2.7. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. If D is a nonempty one-local retract of C, then A ( D ) is compact and ρ-normal.

Proof. Using the definition of one-local retract, it is easy to see that A ( D ) is compact. Let us show that A ( D ) is ρ-normal. Let A 0 A ( D ) nonempty and not reduced to one point. Set c o C ( A 0 ) =C ( { A ; A A ( C ) and A 0 A } ) . Then from the Lemma 2.1, we get

R ρ ( c o C ( A 0 ) ) = R ρ ( A 0 ) , and δ ρ ( c o C ( A 0 ) ) = δ ρ ( A 0 ) .

Since c o C ( A 0 ) A ( C ) , then we must have R ρ (co C (A0)) < δ ρ (co C (A0)) because A ( C ) is ρ-normal. Therefore, we have R ρ (A0) < δ ρ (A0), which completes the proof of our claim. □

The next result is amazing and has found many applications in metric spaces. Most of the ideas in its proof go back to Baillon's work [8].

Theorem 2.8. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. Let (C β )β∈Γbe a decreasing family of one-local retracts of C, where (Γ, ≺) is totally ordered. Then ∩β∈ ΓC β is not empty and is a one-local retract of C.

Proof. First, let us prove that β∈ ΓC β is not empty. Consider the family

F = β Γ A β ; A β A ( C β ) and ( A β ) is decreasing .

is not empty since β Γ C β F. will be ordered by inclusion, i.e., β Γ A β β Γ B β if and only if A β B β for any β ∈ Γ. From Theorem 2.7, we know that A ( C β ) is compact, for every β ∈ Γ. Therefore, satisfies the hypothesis of Zorn's lemma. Hence for every D, there exists a minimal element A such that AD. We claim that if A= β Γ A β is minimal, then there exists β0 ∈ Γ such that δ(A β ) = 0 for every ββ0. Assume not, i.e., δ(A β ) > 0 for every β ∈ Γ. Fix β ∈ Γ. For every KC, set

c o β ( K ) = f C β B ρ ( f , r ρ ( f , K ) ) .

Consider A = α Γ A α where

A α = c o β ( A β ) A α if α β A α = A α if α β .

The family ( A α β ) is decreasing since A. Let αγβ. Then A γ A α since A γ A α and A β = co β (A β ) ∩ A β . Hence the family ( A α ) is decreasing. On the other hand if αβ, then c o β ( A β ) A α A ( C α ) since C β C α . Hence A α A ( C α ) . Therefore, we have A' ∈ ℱ. Since A is minimal, then A = A'. Hence

A α = c o β ( A β ) A α , for every  α β .

Let fC β and aβ. Since A β A α , then r ρ (f, A β ) ≤ r ρ (f, A α ). Because c o β ( A β ) = g C β B ρ ( g , r ρ ( g , A β ) ) , then we have co β (A β ) ⊂ B ρ (g, r ρ (g, A β )) which implies r ρ (g, A β ) ≤ r ρ (g, A α ). Since A α co β (A β ), then

r ρ ( g , A β ) r ρ ( g , A α ) r ρ ( g , c o β ( A β ) ) r ρ ( g , A β ) .

Therefore, we have r ρ (g, A α ) ≤ r ρ (g, A β ) for every gC β . Using the definition of the ρ-Chebyshev radius R ρ , we get

R ρ ( A α ) R ρ ( A β ) .

Let fA α and set s = r ρ (f, A α ). Then fco β (A β ) since A α co β (A β ). Hence, f ( g A β B ρ ( g , s ) ) c o β ( A β ) . Since C β is a one-local retract of C, then

S β = C β ( g A β B ρ ( g , s ) ) c o β ( A β ) .

Since A β = C β co β (A β ), then we have

S β = A β g A β B ρ ( g , s ) .

Let hS β , then h g A β B ρ ( g , s ) . Hence, r ρ (h, A β ) ≤ s which implies R ρ (A β ) ≤ s = r ρ (f, A α ), for every fA α . Hence R ρ (A β ) ≤ R ρ (A α ). Therefore we have

R ρ ( A β ) = R ρ ( A α ) , for every  a , β Γ .

Since δ ρ (A β ) > 0 for every β ∈ Γ. Set A β to be the ρ-Chebyshev center of A β , i.e., A β = C ρ ( A β ) , for every β ∈ Γ. Since R ρ (A β ) = R ρ (A α ), for every α, β ∈ Γ, then the family ( A β ) is decreasing. Indeed, let αβ and f A β . Then we have r ρ (f, A β ) = R ρ (A β ). Since we proved that r ρ (g, A β ) = r ρ (g, A α ), for every gC β , then

r ρ ( f , A α ) = r ρ ( f , A β ) = R ρ ( A β ) = R ρ ( A α ) ,

which implies that f A α . Therefore, we have A = β Γ A β F. Since A''A and A is minimal, we get A = A''. Therefore, we have C ρ ( A β ) = A β for every β ∈ Γ. This contradicts the fact that A ( C β ) is normal for every β ∈ Γ. Hence there exists β0 ∈ Γ such that

δ ( A β ) = 0 , for every  β β 0 .

The proof of our claim is therefore complete. Then we have A β = {f }, for every ββ0. This clearly implies that f ∈ ∩β∈ΓC β ≠ ∅. In order to complete the proof, we need to show that S = ∩β∈ΓC β is a one-local retract of C. Let (B i )iIbe a family of ρ-balls centered in S such that ∩iIB i ≠ ∅. Set D β = (∩iIB i ) ∩ C β , for any β ∈ Γ. Since C β is a one-local retract of C, and the family (B i ) is centered in C β , then D β is not empty and D β A ( C β ) . Therefore, D= β Γ D β F. Let A= β Γ A β D be a minimal element of ℱ. The above proof shows that

β Γ A β β Γ D β .

The proof of Theorem 2.8 is therefore complete. □

The next theorem will be useful to prove the main result of the next section.

Theorem 2.9. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. Let (C β )β∈Γbe a family of one-local retracts of C such that for any finite subset I of Γ, ∩β ∈ ΓC β is not empty and is a one-local retract of C. Then ∩β ∈ ΓC β is not empty and is a one-local retract of C.

Proof. Consider the family ℱ of subsets I ⊂ Γ such that for any finite subset J ⊂ Γ (empty or not), we have ∩αIJC α is a nonempty one-local retract of C. Note that ℱ is not empty since any finite subset of Γ is in ℱ. Using Theorem 2.8, we can show that ℱ satisfies the hypothesis of Zorn's lemma. Hence ℱ has a maximal element I ⊂ Γ. Assume I ≠ Γ. Let α ∈ Γ \ I. Obviously we have I ∪ {α}∈ ℱ. This is a clear contradiction with the maximality of I. Therefore we have I = Γ ∈ ℱ, i.e., ∩β∈ΓC β is not empty and is a one-local retract of C.

Common fixed point result

In the previous section, we showed that under suitable conditions, any ρ-nonexpansive mapping has a fixed point. In this section we will discuss the existence of a fixed point common to a family of a commutative ρ-nonexpansive mappings. First we will need to discuss the case of finite families.

Theorem 2.10. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. Then for any finite family ℱ = {T1, T2,...T n } of commutative ρ-nonexpansive mappings defined on C has a common fixed point, i.e., Fix (T1) ∩ ··· ∩ Fix(Tn) ≠ ∅. Moreover, the set of common fixed point set, denoted Fix(ℱ) = Fix(T1)) ∩ ··· ∩ Fix(T n ), is a one local retract of C.

Proof. Let us first prove Theorem 2.10 for two mappings T1 and T2. Using Theorem 2.5, we know that Fix(T1) is a nonempty one-local retract of C. Since T1 and T2 are commutative, then T2(Fix(T1)) ⊂ Fix(T1). Theorems 2.4 and 2.7 show that the restriction of T2 to Fix(T1) has a fixed point. Again Theorem 2.5 will imply that the common fixed point set Fix(T1) ∩ Fix(T2) is a nonempty one-local retract of C. Using the same argument will show that the conclusion of Theorem 2.10 is valid for any finite number of mappings. □

Next we prove the main result of this section.

Theorem 2.11. Let ρ ∈ ℜ and CL ρ be nonempty, ρ-closed, and ρ-bounded. Assume that A ( C ) is compact and ρ-normal. Then for any family ℱ = {Ti; iI}of commutative ρ-nonexpansive mappings defined on C has a common fixed point, i.e., ∩ i∈I Fix(Ti) ≠ ∅. Moreover the set of common fixed point set, denoted Fix(ℱ) = i∈I Fix(Ti), is a one-local retract of C.

Proof. Let Γ = {β; β is a nonempty finite subset of I}. Theorem 2.10 implies that for every β ∈ Γ, the set F β of common fixed point set of the mappings T i , iβ, is a nonempty one-local retract of C. Clearly the family (F β )β∈Γis decreasing and satisfies the assumptions of Theorem 2.9. Therefore, we have ∩β∈ΓF β is nonempty and is a one-local retract of C. The proof of Theorem 2.11 is complete.

Using Corollary 2.1 and Remark 2.1 we get the following result.

Corollary 2.2. Let ρ ∈ ℜ and CL ρ be nonempty, convex, ρ-closed, andρ-bounded. Assume ρ is (UUC). Then for any family ℱ = {Ti; iI} of commutative ρ-nonexpansive mappings defined on C has a common fixed point, i.e., i∈I Fix(Ti) ≠ ∅. Moreover the set of common fixed point set, denoted Fix(ℱ) = i∈I Fix(Ti), is a one-local retract of C.