1 Introduction and preliminaries

After the pioneering papers were written by Aumann [1] and Debreu [2], set-valued functions in Banach spaces have been developed in the last decades. We can refer to the papers by Arrow and Debreu [3], McKenzie [4], the monographs by Hindenbrand [5], Aubin and Frankowska [6], Castaing and Valadier [7], Klein and Thompson [8] and the survey by Hess [9]. The theory of set-valued functions has been much related with the control theory and the mathematical economics.

Let Y be a Banach space. We define the following:

2 Y : the set of all subsets of Y;

C b (Y): the set of all closed bounded subsets of Y;

C c (Y): the set of all closed convex subsets of Y;

C c b (Y): the set of all closed convex bounded subsets of Y;

C c c (Y): the set of all closed compact subsets of Y.

We can consider the addition and the scalar multiplication on 2 Y as follows:

C+ C = { x + x : x C , x C } ,λC={λx:xC},

where C, C 2 Y and λR. Further, if C, C C c (Y), then we denote by

C C = C + C ¯ .

We can easily check that

λC+λ C =λ ( C + C ) ,(λ+μ)CλC+μC,

where C, C 2 Y and λ,μR. Furthermore, when C is convex, we obtain

(λ+μ)C=λC+μC

for all λ,μ R + .

For a given set C 2 Y , the distance function d(,C) and the support function s(,C) are, respectively, defined by

d ( x , C ) = inf { x y : y C } , x Y , s ( x , C ) = sup { x , x : x C } , x Y .

For every pair C, C C b (Y), we define the Hausdorff distance between C and C by

h ( C , C ) =inf { λ > 0 : C C + λ B Y , C C + λ B Y } ,

where B Y is the closed unit ball in Y.

The following proposition is related with some properties of the Hausdorff distance.

Proposition 1.1 For every C, C ,K, K C c b (Y) and λ>0, the following properties hold:

  1. (a)

    h(C C ,K K )h(C,K)+h( C , K );

  2. (b)

    h(λC,λK)=λh(C,K).

Let ( C c b (Y),,h) be endowed with the Hausdorff distance h. Since Y is a Banach space, ( C c b (Y),,h) is a complete metric semigroup (see [7]). Debreu [2] proved that ( C c b (Y),,h) is isometrically embedded in a Banach space as follows.

Lemma 1.2 [2]

Let C( B Y ) be the Banach space of continuous real-valued functions on B Y endowed with the uniform norm u . Then the mapping j:( C c b (Y),,h)C( B Y ), given by j(A)=s(,A), satisfies the following properties:

  1. (a)

    j(AB)=j(A)+j(B);

  2. (b)

    j(λA)=λj(A);

  3. (c)

    h(A,B)= j ( A ) j ( B ) u ;

  4. (d)

    j( C c b (Y)) is closed in C( B Y )

for all A,B C c b (Y) and all λ0.

Let f:Ω( C c b (Y),h) be a set-valued function from a complete finite measure space (Ω,Σ,ν) into C c b (Y). Then f is Debreu integrable if the composition jf is Bochner integrable (see [10]). In this case, the Debreu integral of f in Ω is the unique element (D) Ω fdν C c b (Y) such that j((D) Ω fdν) is the Bochner integral of jf. The set of Debreu integrable functions from Ω to C c b (Y) will be denoted by D(Ω, C c b (Y)). Furthermore, on D(Ω, C c b (Y)), we define (f+g)(ω)=f(ω)g(ω) for all f,gD(Ω, C c b (Y)). Then we find that ((Ω, C c b (Y)),+) is an abelian semigroup.

The stability problem of functional equations originated from a question of Ulam [11] concerning the stability of group homomorphisms. Hyers [12] gave a first affirmative partial answer to the question of Ulam for Banach spaces. Hyers’ Theorem was generalized by Aoki [13] for additive mappings and by Rassias [14] for linear mappings by considering an unbounded Cauchy difference. A generalization of the Rassias theorem was obtained by Găvruta [15] by replacing the unbounded Cauchy difference by a general control function in the spirit of Rassias’ approach. The stability problems of several functional equations have been extensively investigated by a number of authors and there are many interesting results concerning this problem (see [12, 14, 1620]).

Let X be a set. A function d:X×X[0,] is called a generalized metric on X if d satisfies

  1. (1)

    d(x,y)=0 if and only if x=y;

  2. (2)

    d(x,y)=d(y,x) for all x,yX;

  3. (3)

    d(x,z)d(x,y)+d(y,z) for all x,y,zX.

Note that the distinction between the generalized metric and the usaul metric is that the range of the former includes the infinity.

Let (X,D) be a generalized metric space. An operator T:XX satisfies a Lipschitz condition with Lipschitz constant L if there exists a constant L0 such that d(Tx,Ty)Ld(x,y) for all x,yX. If the Lipschitz constant is less than 1, then the operator T is called a strictly contractive operator. We recall a fundamental result in the fixed point theory.

Theorem 1.3 [21, 22]

Let (X,d) be a complete generalized metric space and let J:XX be a strictly contractive mapping with Lipschitz constant L<1. Then for each given element xX, either

d ( J n x , J n + 1 x ) =

for all nonnegative integers n or there exists a positive integer n 0 such that

  1. (1)

    d( J n x, J n + 1 x)<, n n 0 ;

  2. (2)

    the sequence { J n x} converges to a fixed point y of J;

  3. (3)

    y is the unique fixed point of J in the set Y={yXd( J n 0 x,y)<};

  4. (4)

    d(y, y ) 1 1 L d(y,Jy) for all yY.

In 1996, Isac and Rassias started to use the fixed point theory for the proof of stability theory of functional equations. Afterwards the stability problems of several functional equations by using the fixed point methods have been extensively investigated by a number of authors [19, 20, 23].

Set-valued functional equations have been studied by a number of authors and there are many interesting results concerning this problem (see [2431]). In this paper, we define generalized additive set-valued functional equations and prove the Hyers-Ulam stability of generalized additive set-valued functional equations by using the fixed point method.

Throughout this paper, let X be a real vector space and Y a Banach space.

2 Stability of a generalized additive set-valued functional equation

Definition 2.1 Let f:X C c b (Y) be a set-valued function. The generalized additive set-valued functional equation is defined by

f( x 1 ++ x l )=(l1)f ( x 1 + + x l 1 l 1 ) f( x l )
(2.1)

for all x 1 ,, x l X. Every solution of the generalized additive set-valued functional equation is called a generalized additive set-valued mapping.

Theorem 2.2 Let φ: X l [0,) be a function such that there exists an L<1 with

φ( x 1 ,, x l ) L l φ(l x 1 ,,l x l )
(2.2)

for all x 1 ,, x l X. Suppose that f:X( C c b (Y),h) is a mapping satisfying

h ( f ( x 1 + + x l ) , ( l 1 ) f ( x 1 + + x l 1 l 1 ) f ( x l ) ) φ( x 1 ,, x l )
(2.3)

for all x 1 ,, x l X. Then there exists a unique generalized additive set-valued mapping A:X( C c b (Y),h) such that

h ( f ( x ) , A ( x ) ) L l ( 1 L ) φ(x,,x)
(2.4)

for all xX.

Proof Let x 1 == x l =x in (2.3). Since f(x) is a convex set, we get

h ( f ( l x ) , l f ( x ) ) φ(x,,x)
(2.5)

and if we replace x by x l in (2.6), then we obtain

h ( f ( x ) , l f ( x l ) ) φ ( x l , , x l ) L l φ(x,,x)
(2.6)

for all xX. Consider

S:= { g : g : X C c b ( Y ) , g ( 0 ) = { 0 } }

and introduce the generalized metric on X,

d(g,f)=inf { μ ( 0 , ) : h ( g ( x ) , f ( x ) ) μ φ ( x , , x ) , x X } ,

where, as usual, infφ=+. It is easy to show that (S,d) is complete (see [23], Theorem 2.5). Now we consider the linear mapping J:SS such that

Jg(x):=lg ( x l )

for all xX. Let g,fS be given such d(g,f)=ε. Then

h ( g ( x ) , f ( x ) ) εφ(x,,x)

for all xX. Hence

h ( J g ( x ) , J f ( x ) ) =h ( l g ( x l ) , l f ( x l ) ) =lh ( g ( x l ) , f ( x l ) ) εLφ(x,,x)

for all xX. So d(g,f)=ε implies the d(Jg,Jf)Lε. This means that

d(Jg,Jf)Ld(g,f)

for all g,fS. Furthermore we can have d(f,Jf) L l from (2.6). By Theorem 1.3, there exists a mapping A:XY satisfying the following:

  1. (1)

    A is a fixed point of J, i.e.,

    A ( x l ) = 1 l A(x)
    (2.7)

for all xX. The mapping A is a unique fixed point of J in the set

M= { g S : d ( f , g ) < } .

This implies that A is a unique mapping satisfying (2.7) such that there exists a μ(0,) satisfying

h ( f ( x ) , A ( x ) ) μφ(x,,x)

for all xX;

  1. (2)

    d( J n f,A)0 as n. This implies the equality

    lim n l n f ( x l n ) =A(x)

for all xX;

  1. (3)

    d(f,A) 1 1 L d(f,Jf), which implies the inequality

    d(f,A) L l l L .

This implies that the inequality (2.4) holds. By (2.3),

h ( l n f ( x 1 l n + x 2 l n + + x l l n ) , l n ( l 1 ) f ( x 1 + x 2 + + x l 1 l n ( l 1 ) ) l n f ( x l l n ) ) l n φ ( x 1 l n , x 2 l n , , x l l n ) L n φ ( x 1 , x 2 , , x l ) ,

which tends to zero as n for all x 1 , x 2 ,, x l X. Thus

A( x 1 + x 2 ++ x l )=(l1)A( x 1 ++ x l 1 )A( x l ),

as desired. □

Corollary 2.3 Let 1>p>0 and θ0 be real numbers, and let X be a real normed space. Suppose that f:X( C c b (Y),h) is a mapping satisfying

h ( f ( x 1 + + x l ) , ( l 1 ) f ( x 1 + + x l 1 l 1 ) f ( x l ) ) θ j = 1 l x j p
(2.8)

for all x 1 ,, x l X. Then there exists a unique generalized additive set-valued mapping A:XY satisfying

h ( f ( x ) , A ( x ) ) l θ l l p x p

for all xX.

Proof The proof follows from Theorem 2.2 by taking

φ( x 1 ,, x l ):=θ j = 1 l x j p

for all x 1 ,, x l X. □

Theorem 2.4 Let φ: X l [0,) be a function such that there exists an L<1 with

φ( x 1 ,, x l )lLφ ( x 1 l , , x l l )
(2.9)

for all x 1 ,, x l X. Suppose that f:X( C c b (Y),h) is a mapping satisfying (2.3). Then there exists a unique generalized additive set-valued mapping A:X( C c b (Y),h) such that

h ( f ( x ) , A ( x ) ) L 1 L φ(x,,x)

for all xX.

Proof It follows from (2.5) that

h ( 1 l f ( l x ) , f ( x ) ) Lφ ( x l , , x l )
(2.10)

for all xX.

The rest of the proof is similar to the proof of Theorem 2.2. □

Corollary 2.5 Let p>1 and θ0 be real numbers, and let X be a real normed space. Suppose that f:X( C c b (Y),h) is a mapping satisfying (2.8). Then there exists a unique generalized additive set-valued mapping A:XY satisfying

h ( f ( x ) , A ( x ) ) l θ l p l x p

for all xX.

Proof The proof follows from Theorem 2.4 by taking

φ( x 1 ,, x l ):=θ j = 1 l x j p

for all x 1 ,, x l X. □

3 Stability of a generalized Cauchy-Jensen type additive set-valued functional equation

Definition 3.1 Let f:X C c b (Y) be a set-valued function. The generalized Cauchy-Jensen type additive set-valued functional equation is defined by

f ( x 1 + + x l 1 l 1 + x l ) f ( x 1 + + x l 2 + x l l 1 + x l 1 ) f ( x 2 + + x l l 1 + x 1 ) = 2 [ f ( x 1 ) f ( x 2 ) f ( x l ) ]
(3.1)

for all x 1 ,, x l X. Every solution of the generalized Cauchy-Jensen type additive set-valued functional equation is called a generalized Cauchy-Jensen type additive set-valued mapping.

Theorem 3.2 Let ϕ: X l [0,) be a function such that there exists an L<1 with

φ( x 1 , x 2 ,, x l ) L 2 φ(2 x 1 ,2 x 2 ,,2 x l )

for all x 1 , x 2 ,, x l X. Suppose that f:X( C c b (Y),h) is a mapping satisfying

h ( f ( x 1 + + x l 1 l 1 + x l ) f ( x 1 + + x l 2 + x l l 1 + x l 1 ) f ( x 2 + + x l l 1 + x 1 ) , 2 [ f ( x 1 ) f ( x 2 ) f ( x l ) ] ) φ ( x 1 , x 2 , , x l )
(3.2)

for all x 1 , x 2 ,, x l X. Then

A(x)= lim n 2 n f ( x 2 n )

exists for each xX and defines a unique generalized Cauchy-Jensen type additive set-valued mapping A:X( C c b (Y),h) such that

A ( x 1 + + x l 1 l 1 + x l ) A ( x 1 + + x l 2 + x l l 1 + x l 1 ) A ( x 2 + + x l l 1 + x 1 ) = 2 [ A ( x 1 ) A ( x 2 ) A ( x l ) ]
(3.3)

and

h ( f ( x ) , A ( x ) ) L 2 l 2 l L φ(x,,x)
(3.4)

for all xX.

Proof Let x 1 == x l in (3.2). Since f(x) is a convex set, we get

h ( l f ( 2 x ) , 2 l f ( x ) ) φ(x,,x)
(3.5)

and so

h ( f ( x ) , 2 f ( x 2 ) ) 1 l φ ( x 2 , , x 2 ) L 2 l φ(x,,x)
(3.6)

for all xX. Consider

S:= { g : g : X C c b ( Y ) , g ( 0 ) = { 0 } }

and introduce the generalized metric on X,

d(g,f)=inf { μ ( 0 , ) : h ( g ( x ) , f ( x ) ) μ φ ( x , , x ) , x X } ,

where, as usual, infφ=+. Then (S,d) is complete. Now we consider the linear mapping J:SS such that

Jg(x):=2g ( x 2 )

for all xX. Let g,fS be given such that d(g,f)=ε. Then

h ( g ( x ) , f ( x ) ) εφ(x,,x)

for all xX. Hence

h ( J g ( x ) , J f ( x ) ) =h ( 2 g ( x 2 ) , 2 f ( x 2 ) ) =2h ( g ( x 2 ) , f ( x 2 ) ) Lεφ(x,,x)

for all xX. So d(g,f)=ε implies the d(Jg,Jf)Lε. This means that

d(Jg,Jf)Ld(g,f)

for all g,fS. It follows from (3.6) that d(f,Jf) L 2 l . By Theorem 1.3, there exists a mapping A:XY satisfying the following:

  1. (1)

    A is a fixed point of J, i.e.,

    A ( x 2 ) = 1 2 A(x)
    (3.7)

for all xX. The mapping A is a unique fixed point of J in the set

M= { g S : d ( f , g ) < } .

This implies that A is a unique mapping satisfying (3.7) such that there exists a μ(0,) satisfying

h ( f ( x ) , A ( x ) ) μφ(x,,x)

for all xX;

  1. (2)

    d( J n f,A)0 as n. This implies the equality

    lim n 2 n f ( x 2 n ) =A(x)

for all xX;

  1. (3)

    d(f,A) 1 1 L d(f,Jf), which implies the inequality

    d(f,A) L 2 l 2 l L .

This implies that the inequality (3.4) holds. By (3.3),

h ( 2 n f ( x 1 + x 2 + + x l 1 2 n ( l 1 ) + x l 2 n ) 2 n f ( x 1 + + x l 2 + x l 2 n ( l 1 ) + x l 1 2 n ) 2 n f ( x 2 + + x l 2 n ( l 1 ) + x 1 2 n ) , 2 n + 1 [ f ( x 1 2 n ) f ( x 2 2 n ) f ( x l 2 n ) ] ) 2 n φ ( x 1 2 n , x 2 2 n , , x l 2 n ) ,

which tends to zero as n for all x 1 , x 2 ,, x l X. Thus we can have

A ( x 1 + + x l 1 l 1 + x l ) A ( x 1 + + x l 2 + x l l 1 + x l 1 ) A ( x 2 + + x l l 1 + x 1 ) = 2 [ A ( x 1 ) A ( x 2 ) A ( x l ) ]
(3.8)

as desired. □

Corollary 3.3 Let 1>p>0 and θ0 be real numbers, and let X be a real normed space. Suppose that f:X( C c b (Y),h) is a mapping satisfying

h ( f ( x 1 + x 2 + + x l 1 ( l 1 ) + x l ) f ( x 1 + + x l 2 + x l ( l 1 ) + x l 1 ) f ( x 2 + + x l ( l 1 ) + x 1 ) , 2 [ f ( x 1 ) f ( x 2 ) f ( x l ) ] ) θ j = 1 l x j p
(3.9)

for all x 1 ,, x l X. Then there exists a unique generalized Cauchy-Jensen type additive set-valued mapping A:XY satisfying (3.3) and

h ( f ( x ) , A ( x ) ) l θ l l p x p

for all xX.

Proof The proof follows from Theorem 3.2 by taking

φ( x 1 ,, x l ):=θ j = 1 l x j p

for all x 1 ,, x l X. □

Theorem 3.4 Let φ: X l [0,) be a function such that there exists an L<1 with

φ( x 1 , x 2 ,, x l )2Lφ ( x 1 2 , x 2 2 , , x l 2 )
(3.10)

for all x 1 ,, x l X. Suppose that f:X( C c b (Y),h) is a mapping satisfying (3.2). Then there exists a unique generalized Cauchy-Jensen type additive set-valued mapping A:X( C c b (Y),h) satisfying (3.3) and

h ( f ( x ) , A ( x ) ) L l l L φ(x,,x)

for all xX.

Proof It follows from (3.10) that

h ( 1 2 f ( 2 x ) , f ( x ) ) L l φ ( x 2 , , x 2 )

for all xX.

The rest of the proof is similar to the proof of Theorem 3.2. □

Corollary 3.5 Let p>1 and θ0 be real numbers and let X be a real normed space. Suppose that f:X( C c b (Y),h) is a mapping satisfying (3.2). Then there exists a unique generalized Cauchy-Jensen type additive set-valued mapping A:XY satisfying (3.3)

h ( f ( x ) , A ( x ) ) l θ l p l x p

for all xX.

Proof The proof follows from Theorem 3.4 by taking

φ( x 1 ,, x l ):=θ j = 1 l x j p

for all x 1 ,, x l X. □