1. Introduction

A classical question in the theory of functional equations is the following: "When is it true that a function which approximately satisfies a functional equation must be close to an exact solution of the equation?" If the problem accepts a solution, then we say that the equation is stable. The first stability problem concerning group homomorphisms was raised by Ulam [1] in 1940. In the following year, Hyers [2] gave a positive answer to the above question for additive groups under the assumption that the groups are Banach spaces. In 1978, Rassias [3] proved a generalization of Hyers' theorem for additive mappings. Furthermore, in 1994, a generalization of the Rassias' theorem was obtained by Găvruta [4] by replacing the bound ε (||x|| p + ||y|| p ) by a general control function ϕ(x, y).

The functional equation f(x + y) + f(x - y) = 2f(x) + 2f(y) is called a quadratic functional equation. In particular, every solution of the quadratic functional equation is said to be a quadratic mapping. In 1983, the Hyers-Ulam stability problem for the quadratic functional equation was proved by Skof [5] for mappings f : XY, where X is a normed space and Y is a Banach space. In 1984, Cholewa [6] noticed that the theorem of Skof is still true if the relevant domain X is replaced by an Abelian group and, in 2002, Czerwik [7] 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 [812]).

Using fixed point method, we prove the Hyers-Ulam stability of the following functional equation

f ( m x + n y ) = ( m + n ) f ( x + y ) 2 + ( m - n ) f ( x - y ) 2
(1)

in various spaces, which was introduced and investigated in [13].

2. Preliminaries

In this section, we give some definitions and lemmas for the main results in this article.

A valuation is a function | · | from a field K into [0, ∞) such that, for all r,sK, the following conditions hold:

  1. (a)

    |r| = 0 if and only if r = 0;

  2. (b)

    |rs| = |r||s|;

  3. (c)

    |r + s| ≤ |r| + |s|.

A field K is called a valued field if K carries a valuation. The usual absolute values of ℝ and ℂ are examples of valuations.

In 1897, Hensel [14] has introduced a normed space which does not have the Archimedean property.

Let us consider a valuation which satisfies a stronger condition than the triangle inequality. If the triangle inequality is replaced by

| r + s | max { | r | , | s | }

for all r,sK then the function | · | is called a non-Archimedean valuation and the field is called a non-Archimedean field. Clearly, |1| = | -1| = 1 and |n| ≤ 1 for all n ∈ ℕ.

A trivial example of a non-Archimedean valuation is the function | · | taking everything except for 0 into 1 and |0| = 0.

Definition 2.1. Let X be a vector space over a field K with a non-Archimedean valuation | · |. A function || · || : X → [0, ∞) is called a non-Archimedean norm if the following conditions hold:

(a) ||x|| = 0 if and only if x = 0 for all xX;

(b) ||rx|| = |r| ||x|| for all rK and xX;

(c) the strong triangle inequality holds:

| | x + y | | max { | | x | | , | | y | | }

for all x, yX. Then (X, || · ||) is called a non-Archimedean normed space.

Definition 2.2. Let {x n } be a sequence in a non-Archimedean normed space X.

(a) The sequence {x n } is called a Cauchy sequence if, for any ε > 0, there is a positive integer N such that ||x n - x m || ≤ ε for all n, mN.

(b) The sequence {x n } is said to be convergent if, for any ε > 0, there are a positive integer N and xX such that ||x n - x|| ≤ ε for all nN. Then the point xX is called the limit of the sequence {x n }, which is denote by limn→∞x n = x.

(c) If every Cauchy sequence in X converges, then the non-Archimedean normed space X is called a non-Archimedean Banach space.

It is noted that

| | x n - x m | | max { | | x j + 1 - x j : m j n - 1 }

for all m, n ≥ 1 with n > m.

In the sequel (in random stability section), we adopt the usual terminology, notions, and conventions of the theory of random normed spaces as in [15].

Throughout this article (in random stability section), let Γ+ denote the set of all probability distribution functions F : ℝ ∪ [-∞, +∞] → [0,1] such that F is left-continuous and nondecreasing on ℝ and F(0) = 0, F(+∞) = 1. It is clear that the set D+ = {F ∈ Γ+ : l-F(-∞) = 1}, where l - f ( x ) = l i m t x - f ( t ) , is a subset of Γ+. The set Γ+ is partially ordered by the usual point-wise ordering of functions, i.e., FG if and only if F(t) ≤ G(t) for all t ∈ ℝ. For any a ≥ 0, the element H a (t) of D+ is defined by

H a ( t ) = 0 if t a , 1 if t > a .

We can easily show that the maximal element in Γ+ is the distribution function H0(t).

Definition 2.3. [15] A function T : [0, 1]2 → [0, 1] is a continuous triangular norm (briefly, a t-norm) if T satisfies the following conditions:

(a) T is commutative and associative;

(b) T is continuous;

(c) T(x, 1) = x for all x ∈ [0, 1];

(d) T(x, y) ≤ T(z, w) whenever xz and yw for all x, y, z, w ∈ [0, 1].

Three typical examples of continuous t-norms are as follows: T(x, y) = xy, T(x, y) = max{a + b - 1, 0}, and T(x, y) = min(a, b).

Definition 2.4. [16] A random normed space (briefly, RN-space) is a triple (X, μ, T), where X is a vector space, T is a continuous t-norm, and μ : XD+ is a mapping such that the following conditions hold:

(a) μ x (t) = H0(t) for all xX and t > 0 if and only if x = 0;

(b) μ α x ( t ) = μ x ( t | α | ) for all α ∈ ℝ with α ≠ 0, xX and t ≥ 0;

(c) μx+y(t + s) ≥ T (μ x (t), μ y (s)) for all x, yX and t, s ≥ 0.

Definition 2.5. Let (X, μ, T) be an RN-space.

  1. (1)

    A sequence {x n } in X is said to be convergent to a point xX (write x n x as n → ∞) if lim n μ x n - x ( t ) =1for all t > 0.

  2. (2)

    A sequence {x n } in X is called a Cauchy sequence in X if lim n μ x n - x m ( t ) =1 for all t > 0.

  3. (3)

    The RN-space (X, μ, T) is said to be complete if every Cauchy sequence in X is convergent.

Theorem 2.1. [15]If (X, μ, T) is an RN-space and {x n } is a sequence such that x n x, then lim n μ x n ( t ) = μ x ( t ) .

Definition 2.6. [17]Let X be a real vector space. A function N : X × ℝ → [0, 1] is called a fuzzy norm on X if for all x, yX and all s, t ∈ ℝ,

(N 1) N(x, t) = 0 for t ≤ 0;

(N 2) x = 0 if and only if N(x, t) = 1 for all t > 0;

(N 3) N ( c x , t ) =N ( x , t | c | ) if c ≠ 0;

(N 4) N(x + y, s + t) ≥ min{N(x, s), N(y, t)};

(N 5) N(x,.) is a non-decreasing function ofand limt→∞N (x, t) = 1;

(N 6) for x ≠ 0, N(x,.) is continuous on ℝ.

The pair (X, N) is called a fuzzy normed vector space. The properties of fuzzy normed vector space are given in [18].

Example 2.1. Let (X, || · ||) be a normed linear space and α, β > 0. Then

N ( x , t ) = α t α t + β x t > 0 , x X 0 t 0 , x X

is a fuzzy norm on X.

Definition 2.7. [17]Let (X, N) be a fuzzy normed vector space. A sequence {x n } in X is said to be convergent or converge if there exists an xX such that limt→∞N (x n - x, t) = 1 for all t > 0. In this case, x is called the limit of the sequence {x n } in X and we denote it by N - limt→∞x n = x.

Definition 2.8. [17]Let (X, N) be a fuzzy normed vector space. A sequence {x n } in X is called Cauchy if for each ε > 0 and each t > 0 there exists an n0 ∈ ℕ such that for all nn0and all p > 0, we have N (xn+p- x n , t) > 1 - ε.

It is well known that every convergent sequence in a fuzzy normed vector space is Cauchy. If each Cauchy sequence is convergent, then the fuzzy norm is said to be complete and the fuzzy normed vector space is called a fuzzy Banach space.

Example 2.2. Let N : ℝ × ℝ → [0, 1] be a fuzzy norm ondefined by

N ( x , t ) = t t + | x | t > 0 0 t 0 .

Then (ℝ, N) is a fuzzy Banach space.

We say that a mapping f : XY between fuzzy normed vector spaces X and Y is continuous at a point xX if for each sequence {x n } converging to x0X, then the sequence {f(x n )} converges to f (x0). If f : XY is continuous at each xX, then f : XY is said to be continuous on X[19].

Throughout this article, assume that X is a vector space and that (Y, N) is a fuzzy Banach space.

Definition 2.9. Let X be a set. A function d : X × X → [0, ∞] is called a generalized metric on X if d satisfies the following conditions:

(a) d(x, y) = 0 if and only if x = y for all x, yX;

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

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

Theorem 2.2. [20, 21]Let (X, d) be a complete generalized metric space and J : XX be a strictly contractive mapping with Lipschitz constant L < 1. Then, for all xX, either

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

for all non-negative integers n or there exists a positive integer n 0 such that

(a) d(Jnx, Jn+1x) < ∞ for all n0n0;

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

(c) y* is the unique fixed point of J in the setY= { y X : d ( J n 0 x , y ) < } ;

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

3. Non-Archimedean stability of the functional equation (1)

In this section, using the fixed point alternative approach, we prove the Hyers-Ulam stability of the functional equation (1) in non-Archimedean normed spaces.

Throughout this section, let X be a non-Archimedean normed space and Y a complete non-Archimedean normed space. Assume that |m| ≠1.

Lemma 3.1. Let X and Y be linear normed spaces and f : XY a mapping satisfying (1). Then f is an additive mapping.

Proof. Letting y = 0 in (1), we obtain

f ( m x ) =mf ( x )

for all xX. So one can show that

f ( m n x ) = m n f ( x )

for all xX and all n ∈ ℕ.□

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

| m | ζ ( x , y ) L ζ ( m x , m y )

for all x, yX. If f : XY is a mapping satisfying f(0) = 0 and the inequality

f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 ζ ( x , y )
(2)

for all x, yX, then there is a unique additive mapping A : XY such that

f ( x ) - A ( x ) L ζ ( x , 0 ) | m | - | m | L .
(3)

Proof. Putting y = 0 and replacing x by x m in (2), we have

m f x m - f ( x ) ζ x m , 0 L | m | ζ ( x , 0 )
(4)

for all xX. Consider the set

S : = { g : X Y ; g ( 0 ) = 0 }

and the generalized metric d in S defined by

d ( f , g ) = inf μ + : g ( x ) - h ( x ) μ ζ ( x , 0 ) , x X ,

where inf ∅ = +∞. It is easy to show that (S, d) is complete (see [[22], Lemma 2.1]).

Now, we consider a linear mapping J : SS such that

J h ( x ) : = m h x m

for all xX. Let g, hS be such that d(g, h) = ε. Then we have

g ( x ) - h ( x ) ε ζ ( x , 0 )

for all xX and so

J g ( x ) - J h ( x ) = m g x m - m h x m | m | ε ζ x m , 0 | m | ε L | m | ζ ( x , 0 )

for all xX. Thus d(g, h) = ε implies that d(Jg, Jh) ≤ . This means that

d ( J g , J h ) L d ( g , h )

for all g, hS. It follows from (4) that

d ( f , J f ) L | m | .

By Theorem 2.2, there exists a mapping A : XY satisfying the following:

  1. (1)

    A is a fixed point of J, that is,

    A x m = 1 m A ( x )
    (5)

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

Ω = { h S : d ( g , h ) < } .

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

f ( x ) - A ( x ) μ ζ ( x , 0 )

for all xX.

  1. (2)

    d(Jnf, A) → 0 as n → ∞. This implies the equality

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

for all xX.

  1. (3)

    d ( f , A ) d ( f , J f ) 1 - L with f ∈ Ω, which implies the inequality

    d ( f , A ) L | m | - | m | L .

This implies that the inequality (3) holds. By (2), we have

m n f m x + n y m n - m n ( m + n ) f ( x + y m n ) 2 - m n ( m - n ) f ( x - y m n ) 2 | m | n ζ x m n , y m n | m | n L n | m | n ζ ( x , y )

for all x, yX and n ≥ 1 and so

A ( m x + n y ) - ( m + n ) A ( x + y ) 2 - ( m - n ) A ( x - y ) 2 = 0

for all x, yX.

On the other hand

m A x m - A ( x ) = lim n m n + 1 f x m n + 1 - lim n m n f x m n = 0 .

Therefore, the mapping A : XY is additive. This completes the proof. □

Corollary 3.1. Let θ ≥ 0 and p be a real number with 0 < p < 1. Let f : XY be a mapping satisfying f(0) = 0 and the inequality

f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 θ ( | | x | | p + | | y | | p )
(6)

for all x, yX. Then, for all xX,

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

exists and A : XY is a unique additive mapping such that

f ( x ) - A ( x ) | m | θ | | x | | p | m | p + 1 - | m | 2
(7)

for all xX.

Proof. The proof follows from Theorem 3.1 if we take

ζ ( x , y ) = θ ( | | x | | p + | | y | | p )

for all x, yX. In fact, if we choose L = |m|1-p, then we get the desired result. □

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

ζ ( m x , m y ) | m | L ζ ( x , y )

for all x, yX. Let f : XY be a mapping satisfying f(0) = 0 and (2). Then there is a unique additive mapping A : XY such that

f ( x ) - A ( x ) ζ ( x , 0 ) | m | - | m | L .

Proof. The proof is similar to the proof of Theorem 3.1. □

Corollary 3.2. Let θ ≥ 0 and p be a real number with p > 1. Let f : XY be a mapping satisfying f(0) = 0 and (6). Then, for all xX

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

exists and A : XY is a unique additive mapping such that

f ( x ) - A ( x ) θ | | x | | p | m | - | m | p

for all xX.

Proof. The proof follows from Theorem 3.2 if we take

ζ ( x , y ) = θ ( | | x | | p + | | y | | p )

for all x, yX. In fact, if we choose L = |2m|p-1, then we get the desired result. □

Example 3.1. Let Y be a complete non-Archimedean normed space. Let f : YY be a mapping defined by

f ( z ) = z , z { m x + n y : m x + n y < 1 } { x - y : x - y < 1 } 0 , o t h e r w i s e .

Then one can easily show that f : YY satisfies (3.5) for the case p = 1 and that there does not exist an additive mapping satisfying (3.6).

4. Random stability of the functional equation (1)

In this section, using the fixed point alternative approach, we prove the Hyers-Ulam stability of the functional equation (1) in random normed spaces.

Theorem 4.1. Let X be a linear space, (Y, μ, T) a complete RN-space and Φ a mapping from X2to D+ (Φ(x, y) is denoted by Φx,y) such that there exists0<α< 1 m such that

Φ m x , m y t α Φ x , y ( t )
(8)

for all x, yX and t > 0. Let f : XY be a mapping satisfying f(0) = 0 and

μ f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 ( t ) Φ x , y ( t )
(9)

for all x, yX and t > 0. Then, for all xX

A ( x ) : = lim n m n f x m n

exists and A : XY is a unique additive mapping such that

μ f ( x ) - A ( x ) ( t ) Φ x , 0 ( 1 - m α ) t α
(10)

for all xX and t > 0.

Proof. Putting y = 0 in (9) and replacing x by x m , we have

μ m f x m - f ( x ) ( t ) Φ x m , 0 ( t )
(11)

for all xX and t > 0. Consider the set

S * : = { g : X Y ; g ( 0 ) = 0 }

and the generalized metric d* in S* defined by

d * ( f , g ) = inf u ( 0 , + ) { μ g ( x ) - h ( x ) ( u t ) Φ x , 0 ( t ) , x X , t > 0 } ,

where inf ∅ = +∞. It is easy to show that (S*, d*) is complete (see [[22], Lemma 2.1]).

Now, we consider a linear mapping J : S* → S* such that

J h ( x ) : = m h x m

for all xX.

First, we prove that J is a strictly contractive mapping with the Lipschitz constant . In fact, let g, hS* be such that d*(g, h) < ε. Then we have

μ g ( x ) - h ( x ) ( ε t ) Φ x , 0 ( t )

for all xX and t > 0 and so

μ J g ( x ) - J h ( x ) ( m α ε t ) = μ m g x m - m h x m ( m α ε t ) = μ g x m - h x m ( α ε t ) Φ x m , 0 ( α t ) Φ x , 0 ( t )

for all xX and t > 0. Thus d*(g, h) < ε implies that d*(Jg, Jh) < mαε. This means that

d * ( J g , J h ) m α d ( g , h )

for all g, hS*. It follows from (11) that

d * ( f , J f ) α .

By Theorem 2.2, there exists a mapping A : XY satisfying the following:

  1. (1)

    A is a fixed point of J, that is,

    A x m = 1 m A ( x )
    (12)

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

Ω = { h S * : d * ( g , h ) < } .

This implies that A is a unique mapping satisfying (12) such that there exists u ∈ (0, ∞) satisfying

μ f ( x ) - A ( x ) ( u t ) Φ x , 0 ( t )

for all xX and t > 0.

  1. (2)

    d*(Jnf, A) → 0 as n → ∞. This implies the equality

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

for all xX.

  1. (3)

    d * ( f , A ) d * ( f , J f ) 1 - m α with f ∈ Ω, which implies the inequality

    d * ( f , A ) α 1 - m α

and so

μ f ( x ) - A ( x ) α t 1 - m α Φ x , 0 ( t )

for all xX and t > 0. This implies that the inequality (10) holds.

On the other hand

μ m n f m x + n y m n - m n ( m + n ) f x + y m n 2 - m n ( m - n ) f x - y m n 2 ( t ) Φ x m n , y m n t m n

for all x, yX, t > 0 and n ≥ 1 and so, from (8), it follows that

Φ x m n , y m n t m n Φ x , y t m n α n .

Since

lim n Φ x , y t m n α n = 1

for all x, yX and t > 0, we have

μ A ( m x + n y ) - ( m + n ) A ( x + y ) 2 - ( m - n ) A ( x - y ) 2 ( t ) = 1

for all x, yX and t > 0.

On the other hand

A ( m x ) - m A ( x ) = lim n m n f x m n - 1 - m lim n m n f x m n = m lim n m n - 1 f x m n - 1 - lim n m n f x m n = 0 .

Thus the mapping A : XY is additive. This completes the proof. □

Corollary 4.1. Let X be a real normed space, θ ≥ 0 and let p be a real number with p > 1. Let f : XY be a mapping satisfying f(0) = 0 and

μ f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 ( t ) t t + θ | | x | | p + | | y | | p
(13)

for all x, yX and t > 0. Then, for all xX,

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

exists and A : XY is a unique additive mapping such that

μ f ( x ) - A ( x ) ( t ) m p ( 1 - m 1 - p ) t m p ( 1 - m 1 - p ) t + θ | | x | | p
(14)

for all xX and t > 0.

Proof. The proof follows from Theorem 4.1 if we take

Φ x , y ( t ) = t t + θ | | x | | p + | | y | | p

for all x, yX and t > 0. In fact, if we choose α = m-p, then we get the desired result. □

Theorem 4.2. Let X be a linear space, (Y, μ, T) a complete RN-space and Φ a mapping from X2to D+( Φ(x, y) is denoted by Φx,y) such that for some 0 < α < m

Φ x m , y m ( t ) Φ x , y ( α t )

for all x, yX and t > 0. Let f : XY be a mapping satisfying f(0) = 0 and

μ f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 ( t ) Φ x , y ( t )

for all x, yX and t > 0. Then, for all xX,

A ( x ) : = lim n f ( m n x ) m n

exists and A : XY is a unique additive mapping such that

μ f ( x ) - A ( x ) ( t ) Φ x , 0 ( ( m - α ) t )
(15)

for all xX and t > 0.

Proof. The proof is similar to the proof of Theorem 4.1. □

Corollary 4.2. Let X be a real normed space, θ ≥ 0 and let p be a real number with 0 < p < 1. Let f : XY be a mapping satisfying f(0) = 0 and

μ f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 ( t ) t t + θ | | x | | p + | | y | | p

for all x, yX and t > 0. Then, for all xX,

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

exists and A : XY is a unique additive mapping such that

μ f ( x ) - A ( x ) ( t ) ( m - m p ) t ( m - m p ) t + θ | | x | | p

for all xX and t > 0.

Proof. The proof follows from Theorem 4.2 if we take

Φ x , y ( t ) = t t + θ | | x | | p + | | y | | p

for all x, yX and t > 0. In fact, if we choose α = mp , then we get the desired result. □

Example 4.1. Let (Y, μ, T) be a normed complete RN-space. Let f : YY be a mapping defined by

f ( z ) = z , z { m x + n y : | | m x + n y | | < 1 } { x - y : | | x - y | | < 1 } 0 , o t h e r w i s e .

Then one can easily show that f : YY satisfies (4.6) for the case p = 1 and that there does not exist an additive mapping satisfying (4.7).

5. Fuzzy stability of the functional equation (1)

Throughout this section, using the fixed point alternative approach, we prove the Hyers-Ulam stability of the functional equation (1) in fuzzy normed spaces.

In the rest of the article, assume that X is a vector space and that (Y, N) is a fuzzy Banach space.

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

φ x m , y m L m φ ( x , y )

for all x, yX. Let f : XY be a mapping satisfying f(0) = 0 and

N f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 , t t t + φ ( x , y )
(16)

for all x, yX and all t > 0. Then the limit

A ( x ) : = N - lim n m n f x m n

exists for each xX and defines a unique additive mapping A : XY such that

N ( f ( x ) - A ( x ) , t ) ( m - m L ) t ( m - m L ) t + L φ ( x , 0 ) .

for all x, yX and all t > 0.

Proof. Putting y = 0 in (16) and replacing x by x m , we have

N m f x m - f ( x ) , t t t + φ x 2 , 0

for all xX and t > 0. Consider the set

s * * : = { g : X Y , g ( 0 ) = 0 }

and the generalized metric d** in S** defined by

d * * ( f , g ) = inf μ + : N ( g ( x ) - h ( x ) , μ t ) t t + φ ( x , 0 ) , x X , t > 0 ,

where inf ∅ = +∞. It is easy to show that (S**, d**) is complete (see [[22], Lemma 2.1]).

Now, we consider a linear mapping J : S** → S** such that

J g ( x ) : = m g x m

for all xX.

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

Corollary 5.1. Let θ ≥ 0 and let p be a real number with p > 1. Let X be a normed vector space with norm || · ||. Let f : XY be a mapping satisfying f(0) = 0 and

N f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 , t t t + θ | | x | | p + | | y | | p
(17)

for all x, yX and all t > 0. Then

A ( x ) : = N - lim n m n f x m n

exists for each xX and defines an additive mapping A : XY such that

N ( f ( x ) - A ( x ) , t ) ( m p + 1 - m 2 ) t ( m p + 1 - m 2 ) t + m θ | | x | | p .
(18)

Proof. The proof follows from Theorem 5.1 by taking

φ ( x , y ) : = θ ( | | x | | p + | | y | | p )

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

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

φ ( m x , m y ) m L φ ( x , y )

for all x, yX. Let f : XY be a mapping satisfying f(0) = 0 and

N f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 , t t t + ϕ ( x , y )

for all x, yX and all t > 0. Then the limit

R ( x ) : = N - lim n f ( m n x ) m n

exists for each xX and defines an additive mapping A : XY such that

N ( f ( x ) - A ( x ) , t ) ( m - m L ) t ( m - m L ) t + φ ( x , 0 )

for all x, yX and all t > 0.

Proof. The proof is similar to that of the proofs of Theorems 4.1 and 5.1. □

Corollary 5.2. Let θ ≥ 0 and let p be a real number with 0 < p < 1. Let X be a normed vector space with norm || · ||. Let f : XY be a mapping satisfying f(0) = 0 and

N f ( m x + n y ) - ( m + n ) f ( x + y ) 2 - ( m - n ) f ( x - y ) 2 , t t t + θ | | x | | p + | | y | | p

for all x, yX and all t > 0. Then the limit

A ( x ) : = N - lim n f ( m n x ) m n

exists for each xX and defines a unique additive mapping A : XY such that

N ( f ( x ) - A ( x ) , t ) ( m - m p ) t ( m - m p ) t + θ | | x | | p .

Proof. The proof follows from Theorem 5.2 by taking

φ ( x , y ) : = θ ( | | x | | p + | | y | | p )

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

Example 5.1. Let (Y, N) be a normed fuzzy Banach space. Let f : YY be a mapping defined by

f ( z ) = z , z { m x + n y : m x + n y < 1 } { x - y : x - y < 1 } 0 , o t h e r w i s e .

Then one can easily show that f : YY satisfies (5.2) for the case p = 1 and that there does not exist an additive mapping satisfying (5.3).

6. Conclusion

We linked here five different disciplines, namely, the random normed spaces, non-Archimedean normed spaces, fuzzy normed spaces, functional equations, and fixed point theory. We established the Hyers-Ulam stability of the functional equation (1) in various normed spaces by using fixed point method.