1. Introduction

The study of stability problems for functional equations is related to a question of Ulam [1] concerning the stability of group homomorphisms and affirmatively answered for Banach spaces by Hyers [2]. Subsequently, this result of Hyers was generalized by Aoki [3] for additive mappings and by Rassias [4] for linear mappings by considering an unbounded Cauchy difference. The article of Rassias [4] has provided a lot of influence in the development of what we now call generalized Ulam-Hyers stability of functional equations. We refer the interested readers for more information on such problems to the article [517].

Recently, Alsina [18], Chang, et al. [19], Mirmostafaee et al. [20], [21], Miheţ and Radu [22], Miheţ et al. [23], [24], [25], [26], Baktash et al. [27], Eshaghi et al. [28], Saadati et al. [29], [30] investigated the stability in the settings of fuzzy, probabilistic, and random normed spaces.

In this article, we study the stability of the following functional equation

1 6 f ( x + 4 y ) + f ( 4 x - y ) = 3 0 6 9 f x + y 3 + f ( x + 2 y ) (1) + 1 3 6 f ( x - y ) - 1 3 9 4 f ( x + y ) + 4 2 5 f ( y ) - 1 5 3 0 f ( x ) (2) (3) 
(1.1)

in the various random normed spaces via different methods. Since ax4 is a solution of above functional equation, we say it quartic functional equation.

2. Preliminaries

In this section, we recall some definitions and results which will be used later on in the article.

A triangular norm (shorter t-norm) is a binary operation on the unit interval [0, 1], i.e., a function T : [0, 1] × [0, 1] → [0, 1] such that for all a, b, c ∈ [0, 1] the following four axioms satisfied:

  1. (i)

    T(a, b) = T(b, a) (commutativity);

  2. (ii)

    T(a, (T(b, c))) = T(T(a, b), c) (associativity);

  3. (iii)

    T(a, 1) = a (boundary condition);

  4. (iv)

    T(a, b) ≤ T(a, c) whenever bc (monotonicity).

Basic examples are the Lukasiewicz t-norm T L , T L (a, b) = max (a + b - 1, 0) ∀a, b ∈ [0, 1] and the t-norms T P , T M , T D , where T P (a, b) := ab, T M (a, b) := min {a, b},

T D ( a , b ) : = min ( a , b ) , if max ( a , b ) = 1 ; 0 , otherwise .

If T is a t-norm then x T ( n ) is defined for every x ∈ [0, 1] and nN ∪ {0} by 1, if n = 0 and T ( x T ( n - 1 ) , x ) , if n ≥ 1. A t-norm T is said to be of Hadžić-type (we denote by TH) if the family ( x T ( n ) ) n N is equicontinuous at x = 1 (cf. [31]).

Other important triangular norms are (see [32]):

  • the Sugeno-Weber family { T λ S W } λ [ - 1 , ] is defined by T - 1 S W = T D , T S W = T P and

    T λ S W ( x , y ) = max 0 , x + y - 1 + λ x y 1 + λ

if λ ∈ (-1, ∞).

  • the Domby family { T λ D } λ [ 0 , ] , defined by T D , if λ = 0, T M , if λ = ∞ and

    T λ D ( x , y ) = 1 1 + ( ( 1 x x ) λ + ( 1 y y ) λ ) 1 / λ

if λ ∈ (0, ∞).

  • the Aczel-Alsina family { T λ A A } λ [ 0 , ] , defined by T D , if λ = 0, T M , if λ = ∞ and

    T λ A A ( x , y ) = e - ( | log x | λ + | log y | λ ) 1 λ

if λ ∈ (0, ∞).

A t-norm T can be extended (by associativity) in a unique way to an n-array operation taking for (x1, ..., x n ) ∈ [0, 1]n the value T (x1, ..., x n ) defined by

T i = 1 0 x i = 1 , T i = 1 n x i = T ( T i = 1 n - 1 x i , x n ) = T ( x 1 , , x n ) .

T can also be extended to a countable operation taking for any sequence (x n )nNin [0, 1] the value

T i = 1 x i = lim n T i = 1 n x i .
(2.1)

The limit on the right side of (2.1) exists since the sequence { T i = 1 n x i } n is non-increasing and bounded from below.

Proposition 2.1. [32] (i) For TT L the following implication holds:

lim n T i = 1 x n + i = 1 n = 1 ( 1 - x n ) < .

(ii) If T is of Hadžić-type then

lim n T i = 1 x n + i = 1

for every sequence {x n }nNin [0, 1] such that limn→∞x n = 1.

(iii) If T { T λ A A } λ ( 0 , ) { T λ D } λ ( 0 , ) , then

lim n T i = 1 x n + i = 1 n = 1 ( 1 - x n ) α < .

(iv) If T { T λ S W } λ [ - 1 , ) , then

lim n T i = 1 x n + i = 1 n = 1 ( 1 - x n ) < .

Definition 2.2. [33] 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 μ is a mapping from X into D+ such that, the following conditions hold:

(RN1) μ x (t) = ε0(t) for all t > 0 if and only if x = 0;

(RN2) μ α x ( t ) = μ x t | α | for all xX, α ≠ 0;

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

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

  1. (1)

    A sequence {x n } in X is said to be convergent to x in X if, for every ε > 0 and λ > 0, there exists a positive integer N such that μ x n - x ( ε ) >1-λ whenever nN.

  2. (2)

    A sequence {x n } in X is called Cauchy if, for every ε > 0 and λ > 0, there exists a positive integer N such that μ x n - x m ( ε ) >1-λ whenever nmN.

  3. (3)

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

Theorem 2.4. [34] 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 ) almost everywhere.

3. Non-Archimedean random normed space

By a non-Archimedean field we mean a field K equipped with a function (valuation) | · | from K into [0, ∞] such that |r| = 0 if and only if r = 0, |rs| = |r| |s|, and |r + s| ≤ max{|r|, |s|} for all r,sK. Clearly |1| = | -1| = 1 and |n| ≤ 1 for all n ∈ ℕ. By the trivial valuation we mean the mapping | · | taking everything but 0 into 1 and |0| = 0. Let X be a vector space over a field K with a non-Archimedean non-trivial valuation | · |. A function ||||:X [ 0 , ] is called a non-Archimedean norm if it satisfies the following conditions:

  1. (i)

    ||x|| = 0 if and only if x = 0;

  2. (ii)

    for any rK, xX, ||rx|| = ||r|||x||;

  3. (iii)

    the strong triangle inequality (ultrametric); namely,

    | | x + y | | max { | | x | | , | | y | | } ( x , y X ) .

Then ( X , | | | | ) is called a non-Archimedean normed space. Due to the fact that

| | x n - x m | | max { | | x j + 1 - x j | | : m j n - 1 } ( n > m ) ,

a sequence {x n } is Cauchy if and only if {xn+1- xn} converges to zero in a non-Archimedean normed space. By a complete non-Archimedean normed space we mean one in which every Cauchy sequence is convergent.

In 1897, Hensel [35] discovered the p-adic numbers as a number theoretical analogue of power series in complex analysis. Fix a prime number p. For any non-zero rational number x, there exists a unique integer n x ∈ ℤ such that x= a b p n x , where a and b are integers not divisible by p. Then |x | p := p - n x defines a non-Archimedean norm on Q. The completion of Q with respect to the metric d(x, y) = |x - y| p is denoted by Q p , which is called the p-adic number field.

Throughout the article, we assume that X is a vector space and Y is a complete non-Archimedean normed space.

Definition 3.1. A non-Archimedean random normed space (briefly, non-Archimedean RN-space) is a triple ( X , μ , T ) , where X is a linear space over a non-Archimedean field K, T is a continuous t-norm, and μ is a mapping from X into D+ such that the following conditions hold:

(NA-RN1) μ x (t) = ε0(t) for all t > 0 if and only if x = 0;

(NA-RN2) μ α x ( t ) = μ x t | α | for all xX, t > 0, α ≠ 0;

(NA-RN3) μx+y(max{t, s}) ≥ T (μ x (t), μ y (s)) for all x,y,zX and t, s ≥ 0.

It is easy to see that if (NA-RN3) holds then so is

(RN3) μx+y(t + s) ≥ T (μ x (t), μ y (s)).

As a classical example, if ( X , | | . | | ) is a non-Archimedean normed linear space, then the triple ( X , μ , T M ) , where

μ x ( t ) = 0 t | | x | | 1 t > | | x | |

is a non-Archimedean RN-space.

Example 3.2. Let ( X , | | . | | ) be is a non-Archimedean normed linear space. Define

μ x ( t ) = t t + | | x | | , x X t > 0 .

Then ( X , μ , T M ) is a non-Archimedean RN-space.

Definition 3.3. Let ( X , μ , T ) be a non-Archimedean RN-space. Let {x n } be a sequence in X. Then {x n } is said to be convergent if there exists xX such that

lim n μ x n - x ( t ) = 1

for all t > 0. In that case, x is called the limit of the sequence {x n }.

A sequence {x n } in X is called Cauchy if for each ε > 0 and each t > 0 there exists n0 such that for all nn0 and all p > 0 we have μ x n + p - x n ( t ) >1-ε.

If each Cauchy sequence is convergent, then the random norm is said to be complete and the non-Archimedean RN-space is called a non-Archimedean random Banach space.

Remark 3.4. [36] Let ( X , μ , T M ) be a non-Archimedean RN-space, then

μ x n + p - x n ( t ) min { μ x n + j + 1 - x n + j ( t ) : j = 0 , 1 , 2 , , p - 1 }

So, the sequence {x n } is Cauchy if for each ε > 0 and t > 0 there exists n0 such that for all nn0 we have

μ x n + 1 - x n ( t ) > 1 - ε .

4. Generalized Ulam-Hyers stability for a quartic functional equation in non-Archimedean RN-spaces

Let K be a non-Archimedean field, X a vector space over K and let ( Y , μ , T ) be a non-Archimedean random Banach space over K.

We investigate the stability of the quartic functional equation

1 6 f ( x + 4 y ) + f ( 4 x - y ) = 3 0 6 9 f x + y 3 + f ( x + 2 y ) (1)  + 1 3 6 f ( x - y ) - 1 3 9 4 f ( x + y ) + 4 2 5 f ( y ) - 1 5 3 0 f ( x ) , (2)  (3) 

where f is a mapping from X to Y and f(0) = 0.

Next, we define a random approximately quartic mapping. Let Ψ be a distribution function on X×X× [ 0 , ] such that Ψ (x, y, ·) is symmetric, nondecreasing and

Ψ ( c x , c x , t ) Ψ x , x , t | c | ( x X , c 0 ) .

Definition 4.1. A mapping f:XY is said to be Ψ-approximately quartic if

μ 1 6 f ( x + 4 y ) + f ( 4 x - y ) - 3 0 6 9 f x + y 3 + f ( x + 2 y ) - 1 3 6 f ( x - y ) + 1 3 9 4 f ( x + y ) - 4 2 5 f ( y ) + 1 5 3 0 f ( x ) ( t ) Ψ ( x , y , t ) ( x , y X , t > 0 ) .
(4.1)

In this section, we assume that 4 ≠ 0 in K (i.e., characteristic of K is not 4). Our main result, in this section, is the following:

Theorem 4.2. Let K be a non-Archimedean field, X a vector space over K and let ( Y , μ , T ) be a non-Archimedean random Banach space over K. Let f:XY be a Ψ-approximately quartic mapping. If for some α ∈ ℝ, α > 0, and some integer k, k > 3 with |4k| < α,

Ψ ( 4 - k x , 4 - k y , t ) Ψ ( x , y , α t ) ( x X , t > 0 )
(4.2)

and

lim n T j = n M x , α j t | 4 | k j = 1 ( x X , t > 0 ) ,
(4.3)

then there exists a unique quartic mapping Q:XY such that

μ f ( x ) - Q ( x ) ( t ) T i = 1 M x , α i + 1 t | 4 | k i
(4.4)

for all xX and t > 0, where

M ( x , t ) : = T ( Ψ ( x , 0 , t ) , Ψ ( 4 x , 0 , t ) , , Ψ ( 4 k - 1 x , 0 , t ) ) ( x X , t > 0 ) .

Proof. First, we show by induction on j that for each xX, t > 0 and j ≥ 1,

μ f ( 4 j x ) - 2 5 6 j f ( x ) ( t ) M j ( x , t ) : = T ( Ψ ( x , 0 , t ) , , Ψ ( 4 j - 1 x , 0 , t ) ) .
(4.5)

Putting y = 0 in (4.1), we obtain

μ f ( 4 x ) - 2 5 6 f ( x ) ( t ) Ψ ( x , 0 , t ) ( x X , t > 0 ) .

This proves (4.5) for j = 1. Assume that (4.5) holds for some j ≥ 1. Replacing y by 0 and x by 4jx in (4.1), we get

μ f ( 4 j + 1 x ) 256 f ( 4 j x ) ( t ) Ψ ( 4 j x , 0 , t ) ( x X , t > 0 ) .

Since |256| ≤ 1,

μ f ( 4 j + 1 x ) 256 j + 1 f ( x ) ( t ) T ( μ f ( 4 j + 1 x ) 256 f ( 4 j x ) ( t ) , μ 256 f ( 4 j x ) 256 j + 1 f ( x ) ( t ) ) = T ( μ f ( 4 j + 1 x ) 256 f ( 4 j x ) ( t ) , μ f ( 4 j x ) 256 j f ( x ) ( t | 256 | ) ) T ( μ f ( 4 j + 1 x ) 256 f ( 4 j x ) ( t ) , μ f ( 4 j x ) 256 j f ( x ) ( t ) ) T ( Ψ ( 4 j x , 0 , t ) , M j ( x , t ) ) = M j + 1 ( x , t )

for all xX. Thus (4.5) holds for all j ≥ 1. In particular

μ f ( 4 k x ) 256 k f ( x ) ( t ) M ( x , t ) ( x X , t > 0 ) .
(4.6)

Replacing x by 4-(kn+k)x in (4.6) and using inequality (4.2), we obtain

μ f x 4 k n - 2 5 6 k f x 4 k n + k ( t ) M x 4 k n + k , t (1)  M ( x , α n + 1 t ) ( x X , t > 0 , n = 0 , 1 , 2 , ) . (2)  (3) 
(4.7)

Then

μ ( 4 4 k ) n f ( x ( 4 k ) n ) ( 4 4 k ) n + 1 f ( x ( 4 k ) n + 1 ) ( t ) M ( x , α n + 1 | ( 4 4 k ) n | t ) ( x X , t > 0 , n = 0 , 1 , 2 , ) .

Hence,

μ ( 4 4 k ) n f ( x ( 4 k ) n ) ( 4 4 k ) n + p f ( x ( 4 k ) n + p ) ( t ) T j = n n + p ( μ ( 4 4 k ) j f ( x ( 4 k ) j ) ( 4 4 k ) j + p f ( x ( 4 k ) j + p ) ( t ) ) T j = n n + p M ( x , α j + 1 | ( 4 4 k ) j | t ) T j = n n + p M ( x , α j + 1 | ( 4 k ) j | t ) ( x X , t > 0 , n = 0 , 1 , 2 , ) .

Since lim n T j = n M ( x , α j + 1 | ( 4 k ) j | t ) = 1 ( x X , t > 0 ) , { ( 4 4 k ) n f ( x ( 4 k ) n ) } n N , is a Cauchy sequence in the non-Archimedean random Banach space ( Y , μ , T ) . Hence, we can define a mapping Q:XY such that

lim n μ ( 4 4 k ) n f ( x ( 4 k ) n ) Q ( x ) ( t ) = 1 ( x X , t > 0 ) .
(4.8)

Next, for each n ≥ 1, xX and t > 0,

μ f ( x ) ( 4 4 k ) n f ( x ( 4 k ) n ) ( t ) = μ i = 0 n 1 ( 4 4 k ) i f ( x ( 4 k ) i ) ( 4 4 k ) i + 1 f ( x ( 4 k ) i + 1 ) ( t ) T i = 0 n 1 ( μ ( 4 4 k ) i f ( x ( 4 k ) i ) ( 4 4 k ) i + 1 f ( x ( 4 k ) i + 1 ) ( t ) ) T i = 0 n 1 M ( x , α i + 1 t | 4 4 k | i ) .

Therefore,

μ f ( x ) Q ( x ) ( t ) T ( μ f ( x ) ( 4 4 k ) n f ( x ( 4 k ) n ) ( t ) , μ ( 4 4 k ) n f ( x ( 4 k ) n ) Q ( x ) ( t ) ) T ( T i = 0 n 1 M ( x , α i + 1 t | 4 4 k | i ) , μ ( 4 4 k ) n f ( x ( 4 k ) n ) Q ( x ) ( t ) ) .

By letting n → ∞, we obtain

μ f ( x ) - Q ( x ) ( t ) T i = 1 M x , α i + 1 t | 4 k | i .

This proves (4.4).

As T is continuous, from a well-known result in probabilistic metric space (see e.g., [[34], Chapter 12]), it follows that

lim n μ ( 4 k ) n 16 f ( 4 k n ( x + 4 y ) ) + ( 4 k ) n f ( 4 k n ( 4 x y ) ) 306 [ ( 4 k ) n 9 f ( 4 k n ( x + y 3 ) ) + ( 4 k ) n f ( 4 k n ( x + 2 y ) ) ] 136 ( 4 k ) n f ( 4 k n ( x y ) ) + 1394 ( 4 k ) n f ( 4 k n ( x + y ) ) 425 ( 4 k ) n f ( 4 k n y ) + 1530 ( 4 k ) n f ( 4 k n x ) ( t ) = μ 16 Q ( x + 4 y ) + Q ( 4 x y ) 306 [ 9 Q ( x + y 3 ) + Q ( x + 2 y ) ] 136 Q ( x y ) + 1394 Q ( x + y ) 425 Q ( y ) + 1530 Q ( x ) ( t )

for almost all t > 0.

On the other hand, replacing x, y by 4-knx, 4-kny, respectively, in (4.1) and using (NA-RN2) and (4.2), we get

μ ( 4 k ) n 16 f ( 4 k n ( x + 4 y ) ) + ( 4 k ) n f ( 4 k n ( 4 x y ) ) 306 [ ( 4 k ) n 9 f ( 4 k n ( x + y 3 ) ) + ( 4 k ) n f ( 4 k n ( x + 2 y ) ) ] 136 ( 4 k ) n f ( 4 k n ( x y ) ) + 1394 ( 4 k ) n f ( 4 k n ( x + y ) ) 425 ( 4 k ) n f ( 4 k n y ) + 1530 ( 4 k ) n f ( 4 k n x ) ( t ) Ψ ( 4 k n x ,4 k n y , t | 4 k | n ) Ψ ( x , y , α n t | 4 k | n )

for all x,yX and all t > 0. Since lim n Ψ x , y , α n t | 4 k | n =1, we infer that Q is a quartic mapping.

If Q :XY is another quartic mapping such that μQ'(x)-f(x)(t) ≥ M(x, t) for all xX and t > 0, then for each nN, xX and t > 0,

μ Q ( x ) Q ( x ) ( t ) T ( μ Q ( x ) ( 4 4 k ) n f ( x ( 4 k ) n ) ( t ) , μ ( 4 4 k ) n f ( x ( 4 k ) n ) Q ( x ) ( t ) , t ) ) .

Thanks to (4.8), we conclude that Q = Q'. □

Corollary 4.3. Let K be a non-Archimedean field, X a vector space over K and let ( Y , μ , T ) be a non-Archimedean random Banach space over K under a t-norm TH. Let f:XY be a Ψ-approximately quartic mapping. If, for some α ∈ ℝ, α > 0, and some integer k, k > 3, with |4k| < α,

Ψ ( 4 - k x , 4 - k y , t ) Ψ ( x , y , α t ) ( x X , t > 0 ) ,

then there exists a unique quartic mapping Q:XY such that

μ f ( x ) - Q ( x ) ( t ) T i = 1 M x , α i + 1 t | 4 | k i

for all xX and all t > 0, where

M ( x , t ) : = T ( Ψ ( x , 0 , t ) , Ψ ( 4 x , 0 , t ) , , Ψ ( 4 k - 1 x , 0 , t ) ) ( x X , t > 0 ) .

Proof. Since

lim n M x , α j t | 4 | k j = 1 ( x X , t > 0 )

and T is of Hadžić type, from Proposition 2.1, it follows that

lim n T j = n M x , α j t | 4 | k j = 1 ( x X , t > 0 ) .

Now we can apply Theorem 4.2 to obtain the result. □

Example 4.4. Let ( X , μ , T M ) non-Archimedean random normed space in which

μ x ( t ) = t t + | | x | | , x X , t > 0 ,

and ( Y , μ , T M ) a complete non-Archimedean random normed space (see Example 3.2). Define

Ψ ( x , y , t ) = t 1 + t .

It is easy to see that (4.2) holds for α = 1. Also, since

M ( x , t ) = t 1 + t ,

we have

lim n T M , j = n M x , α j t | 4 | k j = lim n lim m T M , j = n m M x , t | 4 | k j (1) = lim n lim m t t + | 4 k | n (2) = 1 , x X , t > 0 . (3) (4)

Let f:XY be a Ψ-approximately quartic mapping. Thus all the conditions of Theorem 4.2 hold and so there exists a unique quartic mapping Q:XY such that

μ f ( x ) - Q ( x ) ( t ) t t + | 4 k | .

5. Fixed point method for random stability of the quartic functional equation

In this section, we apply a fixed point method for achieving random stability of the quartic functional equation. The notion of generalized metric space has been introduced by Luxemburg [37], by allowing the value +∞ for the distance mapping. The following lemma (Luxemburg-Jung theorem) will be used in the proof of Theorem 5.3.

Lemma 5.1. [38]. Let (X, d) be a complete generalized metric space and let A : XX be a strict contraction with the Lipschitz constant k such that d(x0, A(x0)) < +∞ for some x0X. Then A has a unique fixed point in the set Y := {yX, d(x0, y) < ∞} and the sequence (An(x))nNconverges to the fixed point x* for every xY. Moreover, d(x0, A(x0)) ≤ δ implies d ( x * , x 0 ) δ 1 - k .

Let X be a linear space, (Y, ν, T M ) a complete RN-space and let G be a mapping from X × R into [0, 1], such that G(x, .) ∈ D+ for all x. Consider the set E := {g : XY, g(0) = 0} and the mapping d G defined on E × E by

d G ( g , h ) = inf { u R + , ν g ( x ) - h ( x ) ( u t ) G ( x , t ) for all x X and t > 0 }

where, as usual, inf ∅ = +∞. The following lemma can be proved as in [22]:

Lemma 5.2. cf. [22, 39] d G is a complete generalized metric on E.

Theorem 5.3. Let X be a real linear space, t f a mapping from X into a complete RN-space (Y, μ , T M ) with f(0) = 0 and let Φ : X2D+ be a mapping with the property

α ( 0 , 2 5 6 ) : Φ 4 x , 4 y ( α t ) Φ x , y ( t ) , x , y X , t > 0 .
(5.1)

If

μ 1 6 f ( x + 4 y ) + f ( 4 x - y ) - 3 0 6 9 f x + y 3 + f ( x + 2 y ) - 1 3 6 f ( x - y ) + 1 3 9 4 f ( x + y ) - 4 2 5 f ( y ) + 1 5 3 0 f ( x ) ( t ) Φ x , y ( t ) , x , y X ,
(5.2)

then there exists a unique quartic mapping g : XY such that

μ g ( x ) - f ( x ) ( t ) Φ x , 0 M t , x X , t > 0 ,
(5.3)

where

M = ( 2 5 6 - α ) .

Moreover,

g ( x ) = lim n f ( 4 n x ) 4 4 n .

Proof. By setting y = 0 in (5.2), we obtain

μ f ( 4 x ) - 2 5 6 f ( x ) ( t ) Φ x , 0 ( t )

for all xX, whence

μ 1 2 5 6 f ( 4 x ) - f ( x ) ( t ) = μ 1 2 5 6 ( f ( 4 x ) - 2 5 6 f ( x ) ) ( t ) (1) = μ f ( 4 x ) - 2 5 6 f ( x ) 2 5 6 t (2) Φ x , 0 2 5 6 t , x X , t > 0 . (3) (4)

Let

G ( x , t ) : = Φ x , 0 2 5 6 t .

Consider the set

E : = { g : X Y , g ( 0 ) = 0 }

and the mapping d G defined on E × E by

d G ( g , h ) = inf { u R + , μ g ( x ) - h ( x ) ( u t ) G ( x , t ) for all x X and t > 0 } .

By Lemma 5.2, (E, d G ) is a complete generalized metric space. Now, let us consider the linear mapping J : EE,

J g ( x ) : = 1 2 5 6 g ( 4 x ) .

We show that J is a strictly contractive self-mapping of E with the Lipschitz constant k = α/256.

Indeed, let g, hE be mappings such that d G (g, h) < ε. Then

μ g ( x ) - h ( x ) ( ε t ) G ( x , t ) , x X , t > 0 ,

whence

μ J g ( x ) - J h ( x ) ( α 2 5 6 ε t ) = μ 1 2 5 6 ( g ( 4 x ) - h ( 4 x ) ) ( α 2 5 6 ε t ) (1) = μ g ( 4 x ) - h ( 4 x ) ( α ε t ) (2) G ( 4 x , α t ) ( x X , t > 0 ) . (3) (4)

Since G(4x, αt) ≥ G(x, t), μ J g ( x ) - J h ( x ) ( α 2 5 6 ε t ) G ( x , t ) , that is,

d G ( g , h ) < ε d G ( J g , J h ) α 2 5 6 ε .

This means that

d G ( J g , J h ) α 2 5 6 d G ( g , h )

for all g, h in E.

Next, from

μ f ( x ) - 1 2 5 6 f ( 4 x ) ( t ) G ( x , t )

it follows that d G (f, Jf ) ≤ 1. Using the Luxemburg-Jung theorem, we deduce the existence of a fixed point of J, that is, the existence of a mapping g : XY such that g(4x) = 256g(x) for all xX.

Since, for any xX and t > 0,

d G ( u , v ) < ε μ u ( x ) - v ( x ) ( t ) G x , t ε ,

from d G (Jnf, g) → 0, it follows that lim n f ( 4 n x ) 4 4 n =g ( x ) for any xX.

Also, d G ( f , g ) 1 1 - L d ( f , J f ) implies the inequality d G ( f , g ) 1 1 - α 2 5 6 from which it immediately follows ν g ( x ) - f ( x ) ( 2 5 6 2 5 6 - α t ) G ( x , t ) for all t > 0 and all xX. This means that

μ g ( x ) - f ( x ) ( t ) G x , 2 5 6 - α 2 5 6 t , x X , t > 0 .

It follows that

μ g ( x ) - f ( x ) ( t ) Φ x , 0 ( ( 2 5 6 - α ) t ) x X , t > 0 .

The uniqueness of g follows from the fact that g is the unique fixed point of J with the property: there is C ∈ (0, ∞) such that μg(x)-f(x)(Ct) ≥ G(x, t) for all xX and all t > 0, as desired. □

6. Intuitionistic random normed spaces

Recently, the notation of intuitionistic random normed space introduced by Chang et al. [19]. In this section, we shall adopt the usual terminology, notations, and conventions of the theory of intuitionistic random normed spaces as in [22], [31], [33], [34], [40], [41], [42].

Definition 6.1. A measure distribution function is a function μ : R → [0, 1] which is left continuous, non-decreasing on R, inftRμ(t) = 0 and suptRμ(t) = 1.

We will denote by D the family of all measure distribution functions and by H a special element of D defined by

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

If X is a nonempty set, then μ : XD is called a probabilistic measure on X and μ (x) is

denoted by μ x .

Definition 6.2. A non-measure distribution function is a function ν : R → [0, 1] which is right continuous, non-increasing on R, inftRν(t) = 0 and suptRν(t) = 1.

We will denote by B the family of all non-measure distribution functions and by G a special element of B defined by

G ( t ) = 1 , if t 0 , 0 , if t > 0 .

If X is a nonempty set, then ν : XB is called a probabilistic non-measure on X and ν (x) is denoted by ν x .

Lemma 6.3. [43], [44] Consider the set L* and operation L * defined by:

L * = { ( x 1 , x 2 ) : ( x 1 , x 2 ) [ 0 , 1 ] 2 a n d x 1 + x 2 1 } , ( x 1 , x 2 ) L * ( y 1 , y 2 ) x 1 y 1 , x 2 y 2 , ( x 1 , x 2 ) , ( y 1 , y 2 ) L * .

Then ( L * , L * ) is a complete lattice.

We denote its units by 0 L * = ( 0 , 1 ) and 1 L * = ( 1 , 0 ) . In Section 2, we presented classical t-norm. Using the lattice ( L * , L * ) , these definitions can be straightforwardly extended.

Definition 6.4. [44] A triangular norm (t-norm) on L* is a mapping T: ( L * ) 2 L * satisfying the following conditions:

  1. (a)

    ( x L * ) ( T ( x , 1 L * ) = x ) (boundary condition);

  2. (b)

    ( ( x , y ) ( L * ) 2 ) ( T ( x , y ) = T ( y , x ) ) (commutativity);

  3. (c)

    ( ( x , y , z ) ( L * ) 3 ) ( T ( x , T ( y , z ) ) = T ( T ( x , y ) , z ) ) (associativity);

  4. (d)

    ( ( x , x , y , y ) ( L * ) 4 ) ( x L * x  and  y L * y T ( x , y ) L * T ( x , y ) ) (monotonicity).

If ( L * , L * , T ) is an Abelian topological monoid with unit 1 L * , then T is said to be a continuous t-norm.

Definition 6.5. [44] A continuous t-norm T on L* is said to be continuous t-representable if there exist a continuous t-norm * and a continuous t-conorm ◇ on [0, 1] such that, for all x = (x1, x2), y = (y1, y2) ∈ L*,

T ( x , y ) = ( x 1 * y 1 , x 2 y 2 ) .

For example,

T ( a , b ) = ( a 1 b 1 , min { a 2 + b 2 , 1 } )

and

M ( a , b ) = ( min { a 1 , b 1 } , max { a 2 , b 2 } )

are continuous t-representable for all a = (a1, a2), b = (b1, b2) ∈ L*.

Now, we define a sequence T n recursively by T 1 =T and

T n ( x ( 1 ) , , x ( n + 1 ) ) = T ( T n - 1 ( x ( 1 ) , , x ( n ) ) , x ( n + 1 ) ) , n 2 , x ( i ) L * .

Definition 6.6. A negator on L* is any decreasing mapping N: L * L * satisfying N ( 0 L * ) = 1 L * and N ( 1 L * ) = 0 L * . If N ( N ( x ) ) =x for all xL*, then N is called an involutive negator. A negator on [0, 1] is a decreasing function N : [0, 1] → [0, 1] satisfying N(0) = 1 and N(1) = 0. N s denotes the standard negator on [0, 1] defined by

N s ( x ) = 1 - x , x [ 0 , 1 ] .

Definition 6.7. Let μ and ν be measure and non-measure distribution functions from X × (0, +∞) to [0, 1] such that μ x (t) + ν x (t) ≤ 1 for all xX and t > 0. The triple ( X , P μ , ν , T ) is said to be an intuitionistic random normed space (briefly IRN-space) if X is a vector space, T is continuous t-representable and P μ , ν is a mapping X × (0, +∞) → L* satisfying the following conditions: for all x, yX and t, s > 0,

  1. (a)

    P μ , ν ( x , 0 ) = 0 L * ;

  2. (b)

    P μ , ν ( x , t ) = 1 L * if and only if x = 0;

  3. (c)

    P μ , ν ( α x , t ) = P μ , ν ( x , t | α | ) for all α ≠ 0;

  4. (d)

    P μ , ν ( x + y , t + s ) L * T ( P μ , ν ( x , t ) , P μ , ν ( y , s ) ) .

In this case, P μ , ν is called an intuitionistic random norm. Here,

P μ , ν ( x , t ) = ( μ x ( t ) , ν x ( t ) ) .

Example 6.8. Let (X, || · ||) be a normed space. Let T ( a , b ) = ( a 1 b 1 , min ( a 2 + b 2 , 1 ) ) for all a = (a1, a2), b = (b1, b2) ∈ L* and let μ, ν be measure and non-measure distribution functions defined by

P μ , ν ( x , t ) = ( μ x ( t ) , ν x ( t ) ) = t t + | | x | | , | | x | | t + | | x | | , t R + .

Then ( X , P μ , ν , T ) is an IRN-space.

Definition 6.9. (1) A sequence {x n } in an IRN-space ( X , P μ , ν , T ) is called a Cauchy sequence if, for any ε > 0 and t > 0, there exists an n0 ∈ ℕ such that

P μ , ν ( x n - x m , t ) > L * ( N s ( ε ) , ε ) , n , m n 0 ,

where N s is the standard negator.

  1. (2)

    The sequence {x n } is said to be convergent to a point xX (denoted by x n P μ , ν x ) if P μ , ν ( x n - x , t ) 1 L * as n → ∞ for every t > 0.

  2. (3)

    An IRN-space ( X , P μ , ν , T ) is said to be complete if every Cauchy sequence in X is convergent to a point xX.

7. Stability results in intuitionistic random normed spaces

In this section, we prove the generalized Ulam-Hyers stability of the quartic functional equation in intuitionistic random normed spaces.

Theorem 7.1. Let X be a linear space and let ( X , P μ , ν , T ) be a complete IRN-space. Let f : XY be a mapping with f(0) = 0 for which there are ξ, ζ : X2D+, where ξ (x, y) is denoted by ξx,yand ζ(x, y)is denoted by ζx,y, further, (ξx,y(t), ζx,y(t)) is denoted by Qξ,ζ(x, y, t), with the property:

P μ , ν ( 16 f ( x + 4 y ) + f ( 4 x y ) 306 [ 9 f ( x + y 3 ) + f ( x + 2 y ) ] 136 f ( x y ) + 1394 f ( x + y ) 425 f ( y ) + 1530 f ( x ) , t ) L * Q ξ , ζ ( x , y , t ) .
(7.1)

If

T i = 1 ( Q ξ , ζ ( 4 n + i - 1 x , 0 , 4 4 n + 3 i + 3 t ) ) = 1 L *
(7.2)

and

lim n Q ξ , ζ ( 4 n x , 4 n y , 4 4 n t ) = 1 L *
(7.3)

for all x, yX and all t > 0, then there exists a unique quartic mapping Q : XY such that

P μ , ν ( f ( x ) - Q ( x ) , t ) L * T i = 1 ( Q ξ , ζ ( 4 i - 1 x , 0 , 4 3 i + 3 t ) ) .
(7.4)

Proof. Putting y = 0 in (7.1), we have

P μ , ν f ( 4 x ) 2 5 6 - f ( x ) , t L * Q ξ , ζ ( x , 0 , 4 4 t ) .
(7.5)

Therefore, it follows that

P μ , ν ( f ( 4 k + 1 x ) 4 4 ( k + 1 ) f ( 4 k x ) 4 4 k , t 4 4 k ) L * Q ξ , ζ ( 4 k x ,0,4 4 t ) ,
(7.6)

which implies that

A μ , ν ( f ( 4 k + 1 x ) 4 4 ( k + 1 ) f ( 4 k x ) 4 4 k , t ) L * Q ξ , ζ ( 4 k x ,0,4 4 ( k + 1 ) t ) ,
(7.7)

that is,

P μ , ν f ( 4 k + 1 x ) 4 4 ( k + 1 ) - f ( 4 k x ) 4 4 k , t 4 k + 1 L * Q ξ , ζ ( 4 k x , 0 , 4 4 ( k + 1 ) t )
(7.8)

for all kN and all t > 0. As 1 > 1/4 + ⋯ + 1/4n, from the triangle inequality, it follows

P μ , ν f ( 4 n x ) 2 5 6 n - f ( x ) , t L * T k = 0 n - 1 P μ , ν f ( 4 k + 1 x ) 4 4 ( k + 1 ) - f ( 4 k x ) 4 4 k , k = 0 n - 1 1 4 k + 1 t (1)  L * T i = 1 n ( Q ξ , ζ ( 4 i - 1 x , 0 , 4 3 i + 3 t ) ) . (2)  (3) 
(7.9)

In order to prove convergence of the sequence { f ( 4 n x ) 2 5 6 n } , replacing x with 4mx in (7.9), we get that for m, n > 0

P μ , ν ( f ( 4 n + m x ) 2 5 6 ( n + m ) - f ( 4 m x ) 2 5 6 m , t ) L * T i = 1 n ( Q ξ , ζ ( 4 i + m - 1 x , 0 , 4 3 i + 4 m + 3 t ) ) .
(7.10)

Since the right-hand side of the inequality tends 1L*as m tends to infinity, the sequence { f ( 4 n x ) 4 4 n } is a Cauchy sequence. So we may define Q ( x ) = lim n f ( 4 n x ) 4 4 n for all xX.

Now, we show that Q is a quartic mapping. Replacing x, y with 4nx and 4ny, respectively, in (7.1), we obtain

P μ , ν ( f ( 4 n ( x + 4 y ) ) 256 n + f ( 4 n ( 4 x y ) ) 256 n 306 [ 9 f ( 4 n ( x + y 3 ) ) + f ( 4 n ( x + 2 y ) ) 256 n 136 f ( 4 n ( x y ) ) 256 n + 1394 f ( 4 n ( x + y ) ) 256 n 425 f ( 4 n ( y ) ) 256 n + 1530 f ( 4 n ( x ) ) 256 n , t ) L * Q ξ , ζ ( 4 n x ,4 n y ,4 4 n t ) .
(7.11)

Taking the limit as n → ∞, we find that Q satisfies (1.1) for all x, yX.

Taking the limit as n → ∞ in (7.9), we obtain (7.4).

To prove the uniqueness of the quartic mapping Q subject to (7.4), let us assume that there exists another quartic mapping Q' which satisfies (7.4). Obviously, we have xX and all n ∈ ℕ. Hence it follows from (7.4) that

P μ , ν ( Q ( x ) Q ( x ) , t ) L * P μ , ν ( Q ( 4 n x ) Q ( 4 n x ) , 4 4 n t ) L * T ( P μ , ν ( Q ( 4 n x ) f ( 4 n x ) , 4 4 n 1 t ) , P μ , ν ( f ( 4 n x ) Q ( 4 n x ) , 4 4 n 1 t ) ) L * T ( T i = 1 ( Q ξ , ζ ( 4 n + i 1 x ,0,4 4 n + 3 i + 3 t ) ) , T i = 1 ( Q ξ , ζ ( 4 n + i 1 x ,0,4 4 n + 3 i + 3 t ) )

for all xX. By letting n → ∞ in (7.4), we prove the uniqueness of Q. This completes the proof of the uniqueness, as desired. □

Corollary 7.2. Let ( X , P μ , ν , T ) be an IRN-space and let ( Y , P μ , ν , T ) be a complete IRN-space. Let f : XY be a mapping such that

P μ , ν ( 16 f ( x + 4 y ) + f ( 4 x y ) 306 [ 9 f ( x + y 3 ) + f ( x + 2 y ) ] 136 f ( x y ) + 1394 f ( x + y ) 425 f ( y ) + 1530 f ( x ) , t ) L * P μ , ν ( x + y , t )

for all t > 0 in which

lim n T i = 1 ( P μ , ν ( x , 4 4 n + 3 i + 3 t ) ) = 1 L *

for all x, yX. Then there exists a unique quartic mapping Q : XY such that

P μ , ν ( f ( x ) - Q ( x ) , t ) L * T i = 1 ( P μ , ν ( x , 4 3 i + 3 t ) ) .

Now, we give an example to illustrate the main result of Theorem 7.1 as follows.

Example 7.3. Let (X, ||.||) be a Banach algebra, ( X , P μ , ν , M ) an IRN-space in which

P μ , ν ( x , t ) = t t + | | x | | , | | x | | t + | | x | |

and let ( Y , P μ , ν , M ) be a complete IRN-space for all xX. Define f : XX by f (x) = x4 + x0, where x0 is a unit vector in X. A straightforward computation shows that

P μ , ν ( 16 f ( x + 4 y ) + f ( 4 x y ) 306 [ 9 f ( x + y 3 ) + f ( x + 2 y ) ] 136 f ( x y ) + 1394 f ( x + y ) 425 f ( y ) + 1530 f ( x ) , t ) L * P μ , ν ( x + y , t ) , t > 0 .

Also

lim n M i = 1 ( P μ , ν ( 4 n + i - 1 x , 4 4 n + 3 i + 3 t ) ) = lim n lim m M i = 1 m ( P μ , ν ( x , 4 3 n + 2 i + 4 t ) ) (1)  = lim n lim m P μ , ν ( x , 4 3 n + 6 t ) (2)  = lim n P μ , ν ( x , 4 3 n + 6 t ) (3)  = 1 L * . (4)  (5) 

Therefore, all the conditions of 7.1 hold and so there exists a unique quartic mapping Q : XY such that

P μ , ν ( f ( x ) - Q ( x ) , t ) L * P μ , ν ( x , 4 6 t ) .