1. Introduction and preliminaries

Set-valued functions in Banach spaces have been developed in the last decades. The pioneering article by Aumann [1] and Debreu [2] were inspired by problems arising in control theory and mathematical economics. We can refer to the articles by Arrow and Debreu [3], McKenzie [4], the monographs by Hindenbrand [5], Aubin and Frankow [6], Castaing and Valadier [7], Klein and Thompson [8] and the survey by Hess [9]. Let Y be a Banach space. We define the following:

2Y : 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 cb (Y): the set of all closed convex bounded subsets of Y.

On 2Y we consider the addition and the scalar multiplication as follows:

C + C = x + x : x C , x C , λ C = λ x : x C ,

where C, C' ∈ 2Y and λ ∈ ℝ. Further, if C, C' ∈ C c (Y), then we denote by C C = C + C ¯ .

It is easy to check that

λ C + λ C = λ C + C , λ + μ C λ C + μ C .

Furthermore, when C is convex, we obtain (λ + μ)C = λC + μC for all λ, μ ∈ ℝ+.

For a given set C ∈ 2Y, 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 reveals some properties of the Hausdorff distance.

Proposition 1.1. For every C, C', K, K' ∈ C cb (Y) and λ > 0, the following properties hold

  1. (a)

    h(CC', KK') ≤ h(C, K) + h(C', K');

  2. (b)

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

Let (C cb (Y), ⊕, h) be endowed with the Hausdorff distance h. Since Y is a Banach space, (C cb (Y), ⊕, h) is a complete metric semigroup (see [7]). Debreu [2] proved that (C cb (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 cb (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)

    jA) = λj(A);

  3. (c)

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

  4. (d)

    j(C cb (Y)) is closed in C(B Y * )

for all A, BC cb (Y ) and all λ 0.

Let f : Ω (C cb (Y), h) be a set-valued function from a complete finite measure space (Ω, Σ, ν) into C cb (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 cb (Y) such that j((D) ∫Ω fdν) is the Bochner integral of jf. The set of Debreu integrable functions from Ω to C cb (Y) will be denoted by D(Ω, C cb (Y)). Furthermore, on D(Ω, C cb (Y)), we define (f + g)(ω) = f(ω) ⊕ g(ω) for all f, gD(Ω, C cb (Y)). Then we obtain that ((Ω, C cb (Y)), +) is an abelian semigroup.

Set-valued functional equations have been extensively investigated by a number of authors and there are many interesting results concerning this problem (see [1118]).

The stability problem of functional equations was originated from a question of Ulam [19] concerning the stability of group homomorphisms. Hyers [20] gave a first affirmative partial answer to the question of Ulam for Banach spaces. Hyers' Theorem was generalized by Aoki [21] for additive mappings and by Rassias [22] for linear mappings by considering an unbounded Cauchy difference. The article of Rassias [22] has provided a lot of influence in the development of what we call Hyers-Ulam stability or Hyers-Ulam-Rassias stability of functional equations. A generalization of the Rassias theorem was obtained by Găvruta [23] by replacing the unbounded Cauchy difference by a general control function in the spirit of Rassias' approach

The functional equation

f x + y + f x - y = 2 f x + 2 f y

is called a quadratic functional equation. In particular, every solution of the quadratic functional equation is said to be a quadratic mapping. The Hyers-Ulam stability of the quadratic functional equation was proved by Skof [24] for mappings f : X → Y, where X is a normed space and Y is a Banach space. Cholewa [25] noticed that the theorem of Skof is still true if the relevant domain X is replaced by an Abelian group. Czerwik [26] proved the Hyers-Ulam stability of the quadratic functional equation. 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 [11, 2123, 2761]).

In [52], Najati considered the following functional equation

f x + y 2 + z + f x + z 2 + y + f y + z 2 + x = 2 f x + f y + f z
(1.1)

for all x, y, zX. It is easy to show that the function f(x) = x satisfies the functional Equation (1.1), which is called a Cauchy-Jensen type additive functional equation and every solution of the Cauchy-Jensen type additive functional equation is said to be a Cauchy-Jensen type additive mapping.

In [57], Park considered the following functional equation

2 f x + y 2 + f x - y 2 + f y - x 2 = f x + f y
(1.2)

for all x, yX. It is easy to show that the function f(x) = x+x2 satisfies the functional Equation (1.2), which is called a Jensen type additive-quadratic functional equation and every solution of the Jensen type additive-quadratic functional equation is said to be a Jensen type additive-quadratic mapping.

In [48], Jun and Cho considered the following functional equation

f x + y r + s z + f x + y r - s z + f x - y r + s z + f x - y r - s z = 4 r 2 f x + 4 r 2 f y + 4 s 2 f z
(1.3)

for all x, y, zX, where r, s are real numbers with r, s ≠ 0. It is easy to show that the function f(x) = x2 satisfies the functional Equation (1.3), which is called a generalized quadratic functional equation and every solution of the generalized quadratic functional equation is said to be a generalized quadratic mapping.

In [62], Kim et al. considered the following functional equation

f 3 x + y 2 + f x + 3 y 2 = 12 f x + y 2 + f x + f y
(1.4)

for all x, yX. It is easy to show that the function f(x) = x3 satisfies the functional Equation (1.4), which is called a Jensen type cubic functional equation and every solution of the Jensen type cubic functional equation is said to be a Jensen type cubic mapping.

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.

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 L ≥ 0 such that d(Tx, Ty) ≤ Ld(x, y) for all x, yX. If the Lipschitz constant L is less than 1, then the operator T is called a strictly contractive operator. Note that the distinction between the generalized metric and the usual metric is that the range of the former is permitted to include the infinity. We recall the following theorem by Margolis and Diaz.

Theorem 1.3. [31, 63] 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(Jnx, Jn+1x) < ∞, ∀n ≥ n0;

  2. (2)

    the sequence {Jnx} converges to a fixed point y* of J;

  3. (3)

    y* is the unique fixed point of J in the set Y= y X | d J n 0 x , y < ;

  4. (4)

    d y , y * 1 1 - L d y , J y for all yY.

In 1996, Isac and Rassias [47] were the first to provide applications of stability theory of functional equations for the proof of new fixed point theorems with applications. By using fixed point methods, the stability problems of several functional equations have been extensively investigated by a number of authors (see [32, 33, 56, 58, 64]).

Using the fixed point method, we prove the Cauchy-Jensen type additive set-valued functional equation, the Jensen type additive-quadratic set-valued functional equation, the generalized quadratic set-valued functional equation and the Jensen type cubic set-valued functional equation.

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

2. Stability of the Cauchy-Jensen type additive set-valued functional Equation (1.1)

Using the fixed point method, we prove the Hyers-Ulam stability of the Cauchy-Jensen type additive set-valued functional equation.

Definition 2.1. [52] Let f : X → C cb (Y). The Cauchy-Jensen type additive set-valued functional equation is defined by

f x + y 2 + z f x + z 2 + y f y + z 2 + x = 2 f x f y f z

for all x, y, zX. Every solution of the Cauchy-Jensen type additive set-valued functional equation is called an Cauchy-Jensen type additive set-valued mapping.

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

φ x , y , z L 2 φ 2 x , 2 y , 2 z

for all x, y, zX. Suppose that f : X → (C cb (Y), h) is a mapping satisfying

h f x + y 2 + z f x + z 2 + y f y + z 2 + x , 2 f x f y f z φ x , y , z
(2.1)

for all x, y, zX. Then

A x = lim n 2 n f x 2 n ,

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

h f x , A x L 6 - 6 L φ x , x , x
(2.2)

for all xX.

Proof. Let x = y = z in (2.1). Since f(x) is convex, we get

h f 2 x , 2 f x 1 3 φ x , x , x
(2.3)

and so

h f x , 2 f x 2 1 3 φ x 2 , x 2 , x 2 L 6 φ x , x , x
(2.4)

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 X ,

where, as usual, inf ϕ = +. It is easy to show that (S, d) is complete (see [41, Theorem 2.4]).

Now we consider the linear mapping J : SS such that

J g x : = 2 g x 2

for all xX.

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

h g x , f x ε φ x , x , x

for all xX. Hence

h J g x , J f x = h 2 g x 2 , 2 f x 2 = 2 h g x 2 , f x 2 L φ x , x , x

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

d J g , J f L d g , f

for all g, fS.

It follows from (2.4) that d f , J f L 6 .

By Theorem 1.1, there exists a mapping A : X → Y satisfying the following:

  1. (1)

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

    A x 2 = 1 2 A x
    (2.5)

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.5) such that there exists a μ ∈ (0, ) satisfying

h f x , A x μ φ x , x , x

for all xX;

  1. (2)

    d(Jnf, 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 , J f , which implies the inequality

    d f , A L 6 - 6 L .

This implies that the inequality (2.2) holds.

By (2.1),

h 2 n f x + y 2 n + 1 + z 2 n 2 n f x + z 2 n + 2 + y 2 n 2 n f y + z 2 n + 1 + x 2 n , 2 n + 1 f x 2 n 2 n + 1 f y 2 n 2 n + 1 f z 2 n 2 n ϕ x 2 n , y 2 n , z 2 n L n ϕ x , y , z ,

which tends to zero as n → ∞ for all x, y, zX. Thus

A x + y 2 + z A x + z 2 + y A y + z 2 + x = 2 A x A y A z ,

as desired.    □

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

h f x + y 2 + z f x + z 2 + y f y + z 2 + x , 2 f x f y f z θ x p + y p + z p
(2.6)

for all x, y, zX. Then

A x = lim n 2 n f x 2 n

exists for all xX and defines a unique Cauchy-Jensen type additive set-valued mapping A : XY satisfying

h f x , A x θ x p 2 p - 2

and for all xX.

Proof. The proof follows from Theorem 2.2 by taking

φ x , y , z : = θ x p + y p + z p

for all x, y, zX. Then we can choose L = 21-pand we get the desired result.    □

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

φ x , y , z 2 L φ x 2 , y 2 , z 2

for all x, yX. Suppose that f : X → (C cb (Y), h) is a mapping satisfying (2.1).Then there exists a unique Cauchy-Jensen type additive set-valued mapping A : X → (C cb (Y), h) such that

h f x , A x 1 6 - 6 L φ x , x , x

and

A x = lim n f 2 n x 2 n

for all xX.

Proof. It follows from (2.3) that

h f x , 1 2 f 2 x 1 6 φ x , x , x

for all xX.

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

Corollary 2.5. Let 0 < p < 1 and θ ≥ 0 be real numbers, and let X be a real normed space. Suppose that f : X → (C cb (Y), h) is a mapping satisfying (2.6). Then

A x = lim n f 2 n x 2 n

exists for all xX and defines a unique Cauchy-Jensen type additive set-valued mapping A : XY satisfying

h f x , A x θ x p 2 - 2 p

for all xX.

Proof. The proof follows from Theorem 2.4 by taking

φ x , y , z : = θ x p + y p + z p

for all x, y, zX. Then we can choose L = 2p-1 and we get the desired result.    □

3. Stability of the Jensen type AQ set-valued functional Equation (1.2)

Using the fixed point method, we prove the Hyers-Ulam stability of the Jensen type additive-quadratic set-valued functional equation.

3.1. An odd case

Theorem 3.1. Let φ : X2 [0, ) be a function such that there exists an L < 1 with

φ x , y L 2 φ 2 x , 2 y

for all x, yX. Suppose that f : X → (C cb (Y), h) is an odd mapping satisfying

h 2 f x + y 2 f x - y 2 f y - x 2 , f x f y φ x , y
(3.1)

for all x, yX. Then

A x = lim n 2 n f x 2 n

exists for all xX and defines a unique Jensen type additive set-valued mapping A : X → (C cb (Y), h) such that

h f x , A x 1 1 - L φ x , 0

for all xX.

Proof. Let y = 0 in (3.1). Since f(x) is convex, we get

h f x , 2 f x 2 φ x , 0
(3.2)

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 , 0 , x X ,

where, as usual, inf ϕ = +. It is easy to show that (S, d) is complete (see [41, Theorem 2.4]).

Now we consider the linear mapping J : S → S such that

J g x : = 2 g x 2

for all xX.

It follows from (3.2) that d(f, Jf) 1.

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

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

h 2 f x + y 2 f x - y 2 f y - x 2 , f x f y θ x p + y p
(3.3)

for all x, yX. Then

A x = lim n 2 n f x 2 n

exists for all xX and defines a unique Jensen type additive set-valued mapping A : XY satisfying

h f x , A x 2 p θ x p 2 p - 2

for all xX.

Proof. The proof follows from Theorem 3.1 by taking

φ x , y : = θ x p + y p

for all x, yX. Then we can choose L = 21-pand we get the desired result.    □

Theorem 3.3. Let φ : X2 [0, ) be a function such that there exists an L < 1 with

φ 2 x , 2 y 2 L φ x , y

for all x, yX. Suppose that f : X → (C cb (Y), h) is a mapping satisfying (3.1). Then there exists a unique Jensen type additive set-valued mapping A : X → (C cb (Y), h) such that

h f x , A x L 1 - L φ x , 0

for all xX.

Proof. It follows from (3.2) that

h f x , 1 2 f 2 x 1 2 φ 2 x , 0

for all xX.

The rest of the proof is similar to the proofs of Theorems 2.2 and 3.1.    □

Corollary 3.4. Let 0 < p < 1 and θ ≥ 0 be real numbers, and let X be a real normed space. Suppose that f : X → (C cb (Y), h) is a mapping satisfying (3.3). Then there exists a unique Jensen type additive set-valued mapping A : X → Y satisfying

h f x , A x 2 p θ x p 2 - 2 p

for all xX.

Proof. The proof follows from Theorem 3.3 by taking

φ x , y : = θ x p + y p

for all x, yX. Then we can choose L = 2p-1 and we get the desired result. □

3.2. An even case

Theorem 3.5. Let φ : X2 [0, ) be a function such that there exists an L < 1 with

φ x , y L 4 φ 2 x , 2 y

for all x, yX. Suppose that f : X → (C cb (Y), h) is an even mapping with f(0) = {0} satisfying (3.1). Then there exists a unique Jensen type quadratic set-valued mapping Q : X → (C cb (Y), h) such that

h f x , Q x 1 1 - L φ x , 0

for all xX.

Proof. Let y = 0 in (3.1). Since f(x) is convex, we get

h f x , 4 f x 2 φ x , 0
(3.4)

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 = i n f μ 0 , : h g x , f x μ φ x , 0 , x X ,

where, as usual, inf ϕ = +. It is easy to show that (S, d) is complete (see [41, Theorem 2.4]).

Now we consider the linear mapping J : S → S such that

J g x : = 4 g x 2

for all xX.

It follows from (3.4) that d(f, Jf) 1.

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

Corollary 3.6. Let p > 2 and θ ≥ 0 be real numbers, and let X be a real normed space. Suppose that f : X → (C cb (Y), h) is an even mapping with f(0) = {0} satisfying (3.3). Then there exists a unique Jensen type quadratic set-valued mapping Q : XY satisfying

h f x , Q x 2 p θ x p 2 p - 4

for all xX.

Proof. The proof follows from Theorem 3.5 by taking

φ x , y : = θ x p + y p

for all x, yX. Then we can choose L = 22-pand we get the desired result.    □

Theorem 3.7. Let φ : X2 → [0, ) be a function such that there exists an L < 1 with

φ 2 x , 2 y 4 L φ x , y

for all x, yX. Suppose that f : X → (C cb (Y), h) is an even mapping with f(0) = {0} and satisfying (3.1). Then there exists a unique Jensen type quadratic set-valued mapping Q : X → (C cb (Y), h) such that

h f x , Q x L 1 - L φ x , 0

for all xX.

Proof. It follows from (3.4) that

h f x , 1 4 f 2 x 1 4 φ 2 x , 0

for all xX.

The rest of the proof is similar to the proofs of Theorems 2.2 and 3.5.   □

Corollary 3.8. Let 0 < p < 2 and θ ≥ 0 be real numbers, and let X be a real normed space. Suppose that f : X → (C cb (Y), h) is an even mapping with f(0) = {0} and satisfying (3.3). Then there exists a unique Jensen type quadratic set-valued mapping Q : XY satisfying

h f x , Q x 2 p θ x p 4 - 2 p

for all xX.

Proof. The proof follows from Theorem 3.7 by taking

φ x , y : = θ x p + y p

for all x, yX. Then we can choose L = 2p-2 and we get the desired result.    □

4. Stability of the generalized quadratic set-valued functional Equation (1.3)

Using the fixed point method, we define a generalized quadratic set-valued functional equation and prove the Hyers-Ulam stability of the generalized quadratic set-valued functional equation.

Remark 4.1. For convenience, let f(u ± v) = f(u + v) ⊕ f(u - v).

Definition 4.2. Let f : X → C cb (Y). The generalized quadratic set-valued functional equation is defined by

f x + y r ± s z f x - y r ± s z = 4 r 2 f x 4 r 2 f y 4 s 2 f z

for all x, y, zX. Every solution of the generalized quadratic set-valued functional equation is called a generalized quadratic set-valued mapping.

Theorem 4.3. Let φ : X3 → [0, ) be a function such that there exists an L < 1 with

φ r x 2 , r y 2 , r z 2 4 L r 2 φ x , y , z

for all x, y, zX. Suppose that f : X → (C cb (Y), h) is a mapping with f(0) = {0} and satisfying

h f x + y r ± s z f x - y r ± s z , 4 r 2 f x 4 r 2 f y 4 s 2 f z φ x , y , z
(4.1)

for all x, y, zX, and r, s ≠ 0. Then there exists a unique generalized quadratic set-valued mapping Q : X → (C cb (Y), h) such that

h f x , Q x 2 L r 2 1 - L φ x , x , 0

for all xX.

Proof. Let x = y and z = 0 in (4.1). Since f(x) is convex, we get

h 2 f 2 x r , 8 r 2 f ( x ) φ x , x , 0
(4.2)

and so

h f x , 4 r 2 f r x 2 1 2 φ r x 2 , r x 2 , 0
(4.3)

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 = i n f μ 0 , : h g x , f x μ φ x , x , 0 , x X ,

where, as usual, inf ϕ = +. It is easy to show that (S, d) is complete (see [41, Theorem 2.4]).

Now we consider the linear mapping J : SS such that

J g x : = 4 r 2 g r x 2

for all xX.

It follows from (4.3) that d f , J f 2 L r 2 .

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

Corollary 4.4. Let p > 2, θ ≥ 0 be real numbers and 0 < |r| < 2. Let X be a real normed space. Suppose that f : X → (C cb (Y), h) is a mapping with f(0) = {0} and satisfying

h f x + y r ± s z f x - y r ± s z , 4 r 2 f x 4 r 2 f y 4 s 2 f z θ x p + y p + z p
(4.4)

for all x, y, zX, and r, s ≠ 0. Then there exists a unique generalized quadratic set-valued mapping Q : X → Y satisfying

h f x , Q x 16 r p - 2 θ r 2 2 p - 4 r p - 2 x p

for all xX.

Proof. The proof follows from Theorem 4.3 by taking

φ x , y : = θ x p + y p + z p

for all x, yX. Then we can choose L= r 2 p - 2 and we get the desired result.    □

Theorem 4.5. Let φ : X3 → [0, ) be a function such that there exists an L < 1 with

φ 2 x r , 2 y r , 2 z r r 2 L 4 φ x , y , z

for all x, y, zX. Suppose that f : X → (C cb (Y), h) is a mapping with f(0) = {0} and satisfying (4.1). Then there exists a unique generalized quadratic set-valued mapping Q : X → (C cb (Y), h) such that

h f x , Q x r 2 8 - 8 L φ x , x , 0

for all xX.

Proof. It follows from (4.2) that

h f x , r 2 4 f 2 x r r 2 8 φ x , x , 0

for all xX.

The rest of the proof is similar to the proofs of Theorems 2.2 and 4.3.    □

Corollary 4.6. Let 0 < p < 2, θ ≥ 0 be real numbers and |r| > 2. Let X be a real normed space. Suppose that f : X → (C cb (Y), h) is a mapping with f(0) = {0} and satisfying (4.4). Then there exists a unique generalized quadratic set-valued mapping Q : XY satisfying

h f x , Q x r 4 - p θ x p 4 r 2 - p - 2 2 - p

for all xX.

Proof. The proof follows from Theorem 4.5 by taking

φ x , y , z : = θ x p + y p + z p

for all x, yX. Then we can choose L= 2 r 2 - p and we get the desired result.    □

5. Stability of the Jensen type cubic set-valued functional Equation (1.4)

Definition 5.1. Let f : XC cb (Y). The Jensen type cubic set-valued functional equation is defined by

f 3 x + y 2 f x + 3 y 2 = 12 f x + y 2 f x f y

for all x, yX. Every solution of the Jensen type cubic set-valued functional equation is called a Jensen type cubic set-valued mapping.

Theorem 5.2. Let φ : X2 → [0, ) be a function such that there exists an L < 1 with

φ x 2 , y 2 8 L φ x , y

for all x, yX. Suppose that f : X → (C cb (Y), h) is a mapping satisfying

h f 3 x + y 2 f x + 3 y 2 , 12 f x + y 2 f x f y φ x , y
(5.1)

for all x, yX. Then there exists a unique Jensen type cubic set-valued mapping C : X → (C cb (Y), h) such that

h f x , C x 4 L 1 - L φ x , x
(5.2)

for all xX.

Proof. Let x = y in (5.1). Since f(x) is convex, we get

h f 2 x , 8 f x 1 2 φ x , x
(5.3)

and so

h f x , 8 f x 2 1 2 φ x 2 , x 2 4 L φ x , x
(5.4)

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 [41, Theorem 2.4]).

Now we consider the linear mapping J : SS such that

J g x : = 8 g x 2

for all xX.

It follows from (5.4) that d(f, Jf) ≤ 4L.

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

Corollary 5.3. Let p > 3 and θ ≥ 0 be real numbers, and let X be a real normed space. Suppose that f : X → (C cb (Y), h) is a mapping satisfying

h f 3 x + y 2 f x + 3 y 2 , 12 f x + y 2 f x f y θ x p + y p
(5.5)

for all x, yX Then there exists a unique Jensen type cubic set-valued mapping. C : XY satisfying

h f x , C x 64 θ x p 2 p - 8

for all xX.

Proof. The proof follows from Theorem 5.2 by taking

φ x , y : = θ x p + y p

for all x, yX. Then we can choose L = 23-pand we get the desired result.    □

Theorem 5.4. Let φ : X2 → [0, ) be a function such that there exists an L < 1 with

φ 2 x , 2 y L 8 φ x , y

for all x, yX. Suppose that f : X → (C cb (Y), h) is a mapping satisfying (5.1). Then there exists a unique Jensen type cubic set-valued mapping C : X → (C cb (Y), h) such that

h f x , C x 1 16 - 16 L φ x , x

for all xX.

Proof. It follows from (5.3) that

h f x , 1 8 f 2 x 1 16 φ x , x

for all xX.

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

Corollary 5.5. Let 0 < p < 3 and θ ≥ 0 be real numbers, and let X be a real normed space. Suppose that f : X → (C cb (Y), h) is a mapping satisfying (5.5). Then there exists a unique Jensen type cubic set-valued mapping C : X → Y satisfying

h f x , C x θ x p 8 - 2 p

for all ×X.

Proof. The proof follows from Theorem 5.4 by taking

φ x , y : = θ x p + y p

for all x, yX. Then we can choose L = 2p-3 and we get the desired result.    □

6. Conclusions

We have defined the Cauchy-Jensen type additive set-valued functional equation, the Jensen type additive-quadratic set-valued functional equation, the generalized quadratic set-valued functional equation and the Jensen type cubic set-valued functional equation, and we have proved the Hyers-Ulam stability of the Cauchy-Jensen type additive set-valued functional equation, the Jensen type additive-quadratic set-valued functional equation, the generalized quadratic set-valued functional equation and the Jensen type cubic set-valued functional equation by using the fixed point method.