Introduction

The starting point of the stability theory of functional equations was the problemformulated by S. M. Ulam in 1940 (see [1]), during a conference at Wisconsin University:

Let(G,.)be a group(B,.,d)be ametric group. Does for every ε > 0, there exists a δ > 0 such that if a function f : GB satisfies the inequality

d ( f ( xy ) , f ( x ) f ( y ) ) δ , x , y G ,

there exists a homomorphism g : GB such that

d ( f ( x ) , g ( x ) ) ε , x G ?

In 1941, D.H. Hyers [2] gave an affirmative partial answer to this problem. This is the reasonfor which today this type of stability is called Hyers-Ulam stability of functionalequation. In 1950, Aoki [3] generalized Hyers’ theorem for approximately additive functions. In1978, Th. M. Rassias [4] generalized the theorem of Hyers by considering the stability problemwith unbounded Cauchy differences. Taking this fact into account, the additivefunctional equation f(x + y) = f(x) +f(y) is said to have the Hyers-Ulam-Rassias stability on(X,Y). This terminology is also applied to the case of otherfunctional equations. On the other hand, J. M. Rassias [57] considered the Cauchy difference controlled by a a product of differentpowers of norm. However, there was a singular case; for this singularity acounterexample was given by P. Gavruta [8]. This stability is called Ulam-Gavruta-Rassias stability. In addition, J.M. Rassias considered the mixed product-sum of powers of norms as the controlfunction. This stability is called J.M.Rassias stability (see also [912]). For more detailed definitions of such terminologies one can refer to [13] and [14]. Thereafter, the stability problem of functional equations has beenextended in various directions and studied by several mathematicians (see, e.g., [1529]).

The Hyers-Ulam stability of mappings is in development and several authors haveremarked interesting applications of this theory to various mathematical problems.In fact the Hyers-Ulam stability has been mainly used to study problems concerningapproximate isometries or quasi-isometries, the stability of Lorentz and conformalmappings, the stability of stationary points, the stability of convex mappings, orof homogeneous mappings, etc [3034].

Of the most importance is the linear functional equation in general form (see [35])

f(ρ(x))=p(x)f(x)+q(x)
(1.1)

where ρ, p and q are given functions on an intervalI and f is unknown. When q(x) ≡ 0this equation, i.e.,

f(ρ(x))=p(x)f(x)
(1.2)

is called homogeneous linear equation. We refer the reader to [35, 36] for numerous results and references concerning this equation and itsstability in the sense of Ulam.

In 1991 Baker [37] discussed Hyers-Ulam stability for linear equations (1.1). Moreconcretely, the Hyers-Ulam stability and the generalized Hyers-Ulam-Rassiasstability for equation

f(x+p)=kf(x)
(1.3)

were discussed by Lee and Jun [38]. Also the gamma functional equation is a special form of homogeneouslinear equation (1.2) were discussed by S. M. Jung [3941] proved the modified Hyers-Ulam stability of the gamma functionalequation. Thereafter, the stability problem of gamma functional equations has beenextended and studied by several mathematicians [4246].

Throughout this paper, assume that X is a nonempty set, F = Q , R or C and B is a Banach spaces over F and also ψ : X R + , f,g : XB, p: XF∖{0} and q : XB are functions and also σ : XX is a arbitrary map.

In the first section of this paper, we present some results about Hyers-Ulam-Rassiasstability via a fixed point approach for the linear functional equation in generalform (1.1) and its Pexiderized

f(ρ(x))=p(x)g(x)+q(x)
(1.4)

under some suitable conditions. Note that the main results of this paper can beapplied to the well known stability results for the gamma, beta, Abel,Schrö der, iterative and G-function type’s equations, andalso to certain other forms.

In 1979, another type of stability was observed by J. Baker, J. Lawrence and F.Zorzitto [47]. Indeed, they proved that if a function is approximately exponential,then it is either a true exponential function or bounded. This result was the firstresult concerning the superstability phenomenon of functional equations see also [4851]). Later, J. Baker [52] (see also [51]) generalized this famous result as follows:

Let (S,·) be an arbitrary semigroup, and let f map Sinto the field C of all complex numbers. Assume that f is anapproximately exponential function, i.e., there exists a nonnegative numberε such that

f ( x · y ) f ( x ) f ( y ) ε

for all x,yS. Then f is either boundedor exponential.

The result of Baker, Lawrence and Zorzitto [47] was generalized by L. Székelyhidi [53] in another way and he obtained the following result.

Theorem 1.1

[53] Let (G,.) be an Abelian group with identity and let f , m : G C be functions such that there exist functions M1,M2:→[0,) with

f ( x . y ) f ( x ) m ( y ) min { M 1 ( x ) , M 2 ( y ) }

for all x,yG. Then either f isbounded or m is an exponential and f(x) =f(1)g(x) for all xG.

During the thirty-first International Symposium on Functional Equations, Th. M.Rassias [54] introduced the term mixed stability of the function f : E R (or C ), where E is a Banach space, with respect to twooperations ‘addition’ and ‘multiplication’ among any twoelements of the set {x y f(x),f(y)}. Especially, he raised an openproblem concerning the behavior of solutions of the inequality

f ( x . y ) f ( x ) f ( y ) θ ( x p + y p ) .

During the 13st International Conference on Functional Equations and Inequalities2009, G. L. Forti posed following problem.

Problem. Consider functional equations of the form

i = 1 n a i f( k = 1 n i b ik x k )=0 i = 1 n a i 0
(1.5)

and

i = 1 n α i f( k = 1 n i β ik x k )=0 i = 1 n β i 0
(1.6)

where all parameters are real and f : RR. Assumethat the two functional equations are equivalent, i.e., they have the same set ofsolutions. Can we say something about the common stability? More precisely, if (1.5)is stable, what can we say about the stability of (1.6). Under which additionalconditions the stability of (1.5) implies that of (1.6)?

In connection the above problem we consider the term of common stability for systemsof functional equations. In this paper, Usually the functional equations

E 1 ( f ) = E 2 ( f ) ;
(1.7)
D 1 ( f ) = D 2 ( f )
(1.8)

is said to have common Hyers-Ulam stability if for a common approximate solutionf s such that

E 1 ( f s ( x ) ) E 2 ( f s ( x ) ) δ 1 ;
(1.9)
D 1 ( f s ( x ) ) D 2 ( f s ( x ) ) δ 2
(1.10)

for some fixed constant δ1,δ2 ≥ 0 there exists a common solution f of equations (1.7)and (1.8) such that

f(x) f s (x)ε;
(1.11)

for some positive constant ε.

In the last section of this paper, In connection with the problem of G. L. Forti weconsider some systems of homogeneous linear equations and our aim is to establishsome common Hyers-Ulam-Rassias stability for these systems of functional equations.As a consequence of these results, we give some superstability results for theexponential functional equation. Furthermore, in connection with problem of Th. M.Rassias, we generalized the theorem of Baker, Lawrence and Zorzitto and theorem ofL. Székelyhidi.

For the reader’s convenience and explicit later use, we will recall twofundamental results in fixed point theory.

Definition 1.2

The pair (X,d) is called a generalized complete metric space ifX is a nonempty set and d : X2 → [0,] satisfies the following conditions:

  1. 1.

    d(x,y) ≥ 0 and the equality holds if and only if x = y;

  2. 2.

    d(x,y) = d(y,x);

  3. 3.

    d(x,z) ≤ d(x,y) + d(y,z);

  4. 4.

    every d-Cauchy sequence in X is d-convergent.

for all x,yX.

Note that the distance between two points in a generalized metric space is permittedto be infinity.

Definition 1.3

Let (X,d) be a metric space. A mapping J : XX satisfies a Lipschitz condition with Lipschitzconstant L ≥ 0 if

d ( J ( x ) , J ( y ) ) Ld ( x , y )

for all x,yX. If L<1, thenJ is called a strictly contractive map.

Theorem 1.4

(Banach’s contraction principle) Let (X, d) be a complete metric space andlet J : XX be strictly contractive mapping.Then

  1. 1.

    the mapping J has a unique fixed point x = J(x );

  2. 2.

    the fixed point x is globally attractive, i.e.,

    lim n J n ( x ) = x

    for any starting point xX;

  3. 3.

    one has the following estimation inequalities:

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

for all nonnegative integers n and all xX.

Theorem 1.5

[55] Let (X,d) be a generalized complete metric spaceand J : XX be strictly contractive mapping.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 integern0 such that

  1. 1.

    d(J n(x),J n + 1(x)) < , for all nn 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={yX:d( J n 0 (x),y)<};

  4. 4.
    d(y, y ) 1 1 L d(J(y),y)

    .

Stability of the linear functional equation and its Pexiderized

In this section, First we consider the Hyers-Ulam-Rassias stability via a fixed pointapproach for the linear functional equation (1.1) and then applying these result wewill investigate Pexiderized linear functional equation (1.4).

Theorem 2.1

Let f:XB be a function and

f(ρ(x))p(x)f(x)q(x)ψ(x)
(2.1)

for all xX. If there exists a real 0 < L< 1 such that

ψ(ρ(x))L|p(ρ(x))|ψ(x)
(2.2)

for all xX. Then there is an unique function T: XB such thatT(ρ(x)) =p(x)T(x) + q(x) and

f ( x ) T ( x ) ψ ( x ) ( 1 L ) | p ( x ) |

for all xX.

Proof

Let us consider the set A : = { h : X B } and introduce the generalized metric on A :

d ( u , h ) = sup { x X ; ψ ( x ) 0 } | p ( x ) | g ( x ) h ( x ) ψ ( x ) .

It is easy to show that ( A , d ) is generalized complete metric space. Now we define thefunction J : A A with

J ( h ( x ) ) = 1 p ( x ) h ( ρ ( x ) ) q ( x ) p ( x )

for all h A and xX. Sinceψ(ρ(x)) ≤L|p(ρ(x))|ψ(x)for all xX and ρ is a surjection map,so

d ( J ( u ) , J ( h ) ) = sup { x X ; ψ ( x ) 0 } | p ( x ) | u ( ρ ( x ) ) h ( ρ ( x ) ) | p ( x ) | ψ ( x ) sup { x X ; ψ ( ρ ( x ) ) 0 } L | p ( ρ ( x ) ) | u ( ρ ( x ) ) h ( ρ ( x ) ) ψ ( ρ ( x ) ) = Ld ( u , h )

for all u , h A , that is J is a strictly contractive selfmapping of A , with the Lipschitz constant L (note that 0 <L < 1). From (2.1), we get

f ( ρ ( x ) ) p ( x ) q ( x ) p ( x ) f ( x ) ψ ( x ) | p ( x ) |

for all xX, which says thatd(J(f),f) ≤ 1 <. So, by Theorem (1.4), there exists a mapping T :XB such that

  1. 1.

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

    T(ρ(x))=p(x)T(x)+q(x)
    (2.3)

    for all xS. The mapping T is a unique fixedpoint of J in the set A ~ = { h A : d ( f , h ) < } . This implies that T is a unique mapping satisfying(2.3) such that there exists C ∈ (0,) satisfying

    f ( x ) T ( x ) C ψ ( x ) | p ( x ) |

    for all xX.

  2. 2.

    d(J n(f),T) → 0 as n. This implies that

    T ( x ) = lim n f ( ρ n ( x ) ) i = 0 n 1 p ( ρ i ( x ) ) k = 0 n 1 q ( ρ i ( x ) ) i = 0 k p ( ρ i ( x ) )

    for all xX.

  3. 3.
    d(f,T) 1 1 L d(J(f),f)

    , which implies,

    d ( f , T ) 1 1 L

    or

    f ( x ) T ( x ) ψ ( x ) ( 1 L ) | p ( x ) |

    for all xX.

Z. Gajda in his paper [56] showed that the theorem of Th. Rassias [4] is false for some special control function and give the following co-counterexample.

Theorem 2.2

Let f : R R be a function and

|f(x+y)f(x)f(y)|θ(|x|+|y|)
(2.4)

for all x , y R and some θ > 0. But there is no constantδ ∈ [0,) and no additive function T : R R satisfying the condition

|f(x)T(x)|δ|x|
(2.5)

for all x R .

With the above Theorem, its easy to show that the following result.

Corollary 2.3

Let f : R R be a function and

|f(2x)2f(x)||x|
(2.6)

for all x R . But there is no constant δ ∈[0,) and no function T : R R satisfying the conditions

T ( 2 x ) = 2 T ( x )
(2.7)
| f ( x ) T ( x ) | δ | x |
(2.8)

for all x R .

Its obvious that the above corollary is a counterexample for the Theorem (2.1), whenL = 1.

With Theorem (2.1), its easy to show that the following Corollary.

Corollary 2.4

Let f : XB be a function and

f(ρ(x))p(x)f(x)q(x)δ
(2.9)

for all xX and some δ > 0. If a≤ |p(x)| for all xX andsome real a > 1, then there is an unique function T :XB such that T(ρ(x))= p(x)T(x) + q(x)

f ( x ) T ( x ) δ a 1

for all xX.

Similarly we prove that a Hyers-Ulam-Rassias stability for the linear functionalequation with another suitable conditions.

Theorem 2.5

Let f : XB be a function and

f(ρ(x))p(x)f(x)q(x)ψ(x)
(2.10)

for all xX. Let there exists a positive real L< 1 such that

|p(x)|ψ( ρ 1 (x))(x)
(2.11)

for all xX and also ρ be a permutationof X. Then there is an unique function T : XB such that T(ρ(x))= p(x)T(x) + q(x)

f ( x ) T ( x ) 1 1 L ψ ( ρ 1 ( x ) )

for all xX.

Proof

Let us consider the set A : = { h : X B } and introduce the generalized metric on A :

d ( u , h ) = sup { x X ; ψ ( x ) 0 } g ( x ) h ( x ) ψ ( ρ 1 ( x ) ) .

It is easy to show that ( A , d ) is generalized complete metric space. Now we define thefunction J : A A with

J ( h ( x ) ) = p ( ρ 1 ( x ) ) h ( ρ 1 ( x ) ) + q ( ρ 1 ( x ) )

for all h A and xX. Since|p(x)|ψ(ρ−1(x)) ≤ (x) for allxX, so

d ( J ( u ) , J ( h ) ) = sup { x X ; ψ ( x ) 0 } | p ( ρ 1 ( x ) ) | u ( ρ 1 ( x ) ) h ( ρ 1 ( x ) ) ψ ( ρ 1 ( x ) ) sup { x X ; ψ ( ρ 1 ( x ) ) 0 } L u ( ρ 1 ( x ) ) h ( ρ 1 ( x ) ) ψ ( ρ 2 ( x ) ) = Ld ( u , h )

for all u , h A , that is J is a strictly contractive selfmapping of A , with the Lipschitz constant L (note that 0 <L < 1). From (2.10), we get

f ( x ) p ( ρ 1 ( x ) ) f ( ρ 1 ( x ) ) ψ ( ρ 1 ( x ) )

for all xX, which says thatd(J(f),f) ≤ 1 <. So, by Theorem (1.4), there exists a mapping T :XB such that

  1. 1.

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

    T(ρ(x))=p(x)T(x)+q(x)
    (2.12)

    for all xS. The mapping T is a unique fixedpoint of J in the set A ~ = { h A : d ( f , h ) < } . This implies that T is a unique mapping satisfying(2.12) such that there exists C ∈(0,) satisfying

    f ( x ) T ( x ) C ψ ( x ) | p ( x ) |

    for all xX.

  2. 2.

    d(J n(f),T) → 0 as n. This implies that

    T ( x ) = lim n i = 1 n p ( ρ i ( x ) ) f ( ρ n ( x ) ) k = 1 n q ( ρ k ( x ) ) × i = 0 k 1 p ( ρ i ( x ) )

    for all xX and in the above formula, we setp(ρi(x)) := 1, when i = 0.

  3. 3.
    d ( f , T ) 1 1 L d ( J ( f ) , f )

    , which implies,

    d ( f , T ) 1 1 L . f ( x ) T ( x ) 1 1 L ψ ( ρ 1 ( x ) )

    for all xX.

Similar to the Corollary (2.3), we get the following result, where itscounterexample for the Theorem (2.5), when L = 1.

Corollary 2.6

Let f : R R be a function and

f ( 1 2 x ) 1 2 f ( x ) |x|
(2.13)

for all x R . But there is no constant δ ∈[0,) and no function T : R R satisfying the conditions

T 1 2 x = 1 2 T ( x )
(2.14)
| f ( x ) T ( x ) | δ | x |
(2.15)

for all x R .

Corollary 2.7

Let f : XB be a function and

f(ρ(x))p(x)f(x)q(x)δ
(2.16)

for all xX and some δ > 0. If|p(x)| ≤ L for all xX and some real 0 < L < 1, then there is an uniquefunction T :XB such thatT(ρ(x)) =p(x)T(x) + q(x)

f ( x ) T ( x ) δ 1 L

for all xX.

Corollary 2.8

Let f : XB be a function such that Xbe a normed linear space over F and

f(ax)kf(x)x p
(2.17)

for all xX, in which pR,aF. If p ≤ 0, |a| > 1and |k| > 1 or p ≤ 0, |a| < 1 and|k| < 1 or p ≥0, |a| > 1 and|k| < 1 or p ≥ 0, |a| < 1 and|k| > 1, then there is a unique function T such thatT(ax) = aT(x)

f ( x ) T ( ρ , k ) ( x ) x p | | k | 1 |

for all xX.

Proof

Set ρ(x) := ax and ψ(x) :=∥xpfor all xX and then apply Theorem (2.1) andTheorem (2.5).

Now in the following we consider the Hyers-Ulam-Rassias stability of Pexiderizedlinear functional equation (1.4).

Theorem 2.9

Let f,g : XB be a function and

f(ρ(x))p(x)g(x)q(x)ψ(x)
(2.18)

for all xX. If there exists a positive realL<1 such that

ψ ( ρ ( x ) ) L | p ( ρ ( x ) ) | ψ ( x ) ;
(2.19)
f ( ρ ( x ) ) g ( ρ ( x ) ) L f ( x ) g ( x )
(2.20)

for all xX. Then there is an function T suchthat T(ρ(x)) =p(x)T(x) + q(x)

f ( x ) T ( x ) ψ ~ ( x ) ( 1 L ) | p ( x ) | g ( x ) T ( x ) L 1 L ψ ~ ( x ) + ψ ( x ) | p ( x ) |

for all xX, in which ψ ~ ( x ) = ψ ( x ) + | p ( x ) | f ( x ) g ( x ) for all xX.

Proof

Applying (2.18), we get

f ( ρ ( x ) ) p ( x ) f ( x ) q ( x ) ψ ( x ) + | p ( x ) | f ( x ) g ( x )
(2.21)
ψ ~ ( x )
(2.22)

for all xX. From (2.19) and (2.20), its easy to showthat the following inequality

ψ ~ ( ( ρ ( x ) ) L | p ( ρ ( x ) ) | ψ ~ ( x )

for all xX. So, by Theorem (2.1), there is an uniquefunction T : XB such thatT(ρ(x)) =p(x)T(x) + q(x)

f ( x ) T ( x ) ψ ~ ( x ) ( 1 L ) | p ( x ) |

for all xX. So from the above inequality, we have

f ( ρ ( x ) ) T ( ρ ( x ) ) ψ ~ ( ρ ( x ) ) ( 1 L ) | p ( ρ ( x ) ) |

for all xX. We show that T is a linearequation, thus from the above inequality and (2.18), we get

g ( x ) T ( x ) L 1 L [ ψ ~ ( x ) + ψ ( x ) | p ( x ) | ]

for all xX. The proof is complete.

Common stability for the systems of homogeneous linear equations

Throughout this section, assume that {p i : XF∖{0}}iI, {ρ i :XX}iI and { ψ i : X R + } i I be three family of functions. Here i is a variableranging over the arbitrary index set I. Also we define the functionsPi,n: XF∖{0} and θ i , n ( x ) : X R + with

P i , n ( x ) = k = 0 n 1 p i ( ρ i k ( x ) )

and

θ i , n ( x ) = ( 1 L i n ) ψ i ( x ) ( 1 L i ) | p i ( x ) |

for a family of positive reals {L i }iI, all xX, any index i and positive integern.

In this section, we consider some systems of homogeneous linear equations

f( ρ i (x))= p i (x)f(x),
(3.1)

and our aim is to establish some common Hyers-Ulam-Rassias stability for thesesystems of functional equations. As a consequence of these results, we give somegeneralizations of well-known Baker’s superstability result for exponentialfunctional equation to the a family of functional equations. Note that the followingTheorem is partial affirmative answer to problem 1, in the 13st ICFEI.

Theorem 3.1

Let f : XB be a function and

f( ρ i (x)) p i (x)f(x) ψ i (x)
(3.2)

for all xX and iI. Assumethat

  1. 1.

    there exists a family of positive reals {L i }iIsuch that L i < 1 and

    ψ i ( ρ i ( x ) ) L i | p i ( ρ i ( x ) ) | ψ i ( x )

    for all xX and iI;

  2. 2.

    ρ i ρ j = ρ i ρ j for all i,jI;

  3. 3.

    p i (ρ j (x)) = p i (x) for all distinct i,jI;

  4. 4.
    lim n θ i , n ( ρ j n ( x ) ) | P j , n ( x ) | = 0

    for all xX and every distinct i,jI.

    Then there is a unique function T such that

    T ( ρ i ( x ) ) = p i ( x ) T ( x )

for all xX and iI and also

f ( x ) T ( x ) inf i I ψ i ( x ) ( 1 L i ) | p i ( x ) |

for xX.

Proof

It follows from (2.1), there is an unique set of functions T i : XB such that T i (ρ i (x)) = p i (x)T i (x)

f ( x ) T i ( x ) ψ i ( x ) ( 1 L i ) | p i ( x ) |

for all xX. Moreover, The function T i is given by

T i ( x ) = lim n f ( ρ i n ( x ) ) k = 0 n 1 p i ( ρ i k ( x ) ) = lim n J i n ( f )

for all xX and any fixed iI. In the proof of Theorem (2.1), we show that

d ( J i ( f ) , f ) 1 .

By induction, its easy to show that

d ( J i n ( f ) , f ) 1 L i n 1 L i ,

which means that

f ( ρ i n ( x ) ) k = 0 n 1 p i ( ρ i k ( x ) ) f ( x ) k = 0 n 1 p i ( ρ i k ( x ) ) × ( 1 L i n ) ψ i ( x ) ( 1 L i ) | p i ( x ) |

for all xX and iI. Now weshow that T i = T j for any i,jI. Let i andj be two arbitrary fixed indexes of I. So, from lastinequality, we obtain

f ( ρ i n ( x ) ) P i , n ( x ) f ( x ) | P i , n ( x ) | θ i , n ( x ) ;
(3.3)
f ( ρ j n ( x ) ) P j , n ( x ) f ( x ) | P j , n ( x ) | θ j , n ( x )
(3.4)

for all xX. On the replacing x by ρ j n ( x ) in (3.3) and x by ρ i n ( x ) in (3.4), we have

f ( ρ i n ( ρ j n ( x ) ) ) P i , n ( ρ j n ( x ) ) f ( ρ j n ( x ) ) | P i , n ( ρ j n ( x ) ) | θ i , n × ( ρ j n ( x ) ) ;
(3.5)
f ( ρ j n ( ρ i n ( x ) ) ) P j , n ( ρ i n ( x ) ) f ( ρ i n ( x ) ) | P j , n ( ρ i n ( x ) ) | θ j , n × ( ρ i n ( x ) )
(3.6)

for all xX. From assumption (3.1), its obvious that f ( ρ i n ( ρ j n ( x ) ) ) = f ( ρ j n ( ρ i n ( x ) ) ) , P i , n ( ρ j n ( x ) ) = P i , n ( x ) and P j , n ( ρ i n ( x ) ) = P j , n ( x ) for all xX. So, Combining (3.5) and(3.6), we have

P i , n ( x ) f ( ρ j n ( x ) ) P j , n ( x ) f ( ρ i n ( x ) ) | P i , n ( x ) | θ i , n ( ρ j n ( x ) ) + | P j , n ( x ) | θ j , n ( ρ i n ( x ) )

or

f ( ρ j n ( x ) ) P j , n ( x ) f ( ρ i n ( x ) ) P i , n ( x ) θ i , n ( ρ j n ( x ) ) | P j , n ( x ) | + θ j , n ( ρ i n ( x ) ) | P i , n ( x ) |

for all xX. From assumption lim n θ i , n ( ρ j n ( x ) ) | P j , n ( x ) | = 0 for all xX and every distincti,jI, so, its implies that T i = T j .

Now set T = T i and since f ( x ) T i ( x ) ψ i ( x ) ( 1 L i ) | p i ( x ) | for all xX and all xI, there is a unique function T such that

T ( ρ i ( x ) ) = p i ( x ) T ( x )

for all xX and iI and also

f ( x ) T ( x ) inf i I ψ i ( x ) ( 1 L i ) | p i ( x ) |

for xX.

Corollary 3.2

Let f : XB be a function and

f( ρ i (x)) c i f(x) ψ i (x)
(3.7)

for all xX and iI, where{c i }iI and {δ i }iI are two family of real numbers such that δ i ≥ 0 and |c i | > 1. Assume that ρ i ρ j = ρ i ρ j for all i,jI and also

ψ i ( ρ i ( x ) ) ψ i ( x )

for all xX and any iI,then there is a unique function T such that

T ( ρ i ( x ) ) = c i T ( x )

for all xX and iI and also

f ( x ) T ( x ) inf i I ψ i ( x ) c i 1

for xX.

Proof

Sets p i := c i and ψ i := δ i and applying Theorem (3.1).

In the following, the results are applied to the study of some superstability resultsfor the exponential functional equation.

Theorem 3.3

Let (S, + ) be an commutative semigroup and f , g : S C satisfying

f(x+y)g(y)f(x)ϕ(x,y)
(3.8)

for all x,yS, where ϕ : S 2 R + is function. Let g be a unbounded function and

ϕ ( x + i , y ) ϕ ( x , y )

for all x,yS and iI, where I = {iS|∥g(i)| > 1}. Then f(x +y) = g(y)f(x) for allx,yS.

Proof

Let g be a unbounded function and I = {iS ∥ |g(i)| > 1}, then sets ρ i (x) := x + i, c i := g(i) and ψ i := ϕ(x,i) for all xS and any iI. Since ρ i ρ j = ρ i ρ j and ψ i (ρ i (x)) ≤ ψ i (x) for all xS and any iI , so by Corollary (3.2), there is an unique functionT such that

T ( ρ i ( x ) ) = c i T ( x )

for all xX and iI and also

f ( x ) T ( x ) inf i I { ψ i c i 1 }

for xX. Since g is a unbounded function,from last inequality T = f, which implies that

f ( ρ i ( x ) ) = c i f ( x )

or

f(x+i)=g(i)f(x)
(3.9)

for all xS and iI. On thereplacing x by x + ni in (3.8)

f ( ( x + y ) + ni ) g ( y ) f ( x + ni ) ϕ ( x , y )

or

f ( ( x + y ) + ni ) g ( i ) n g ( y ) f ( x + ni ) g ( i ) n ϕ ( x + ni , y ) | g ( i ) | n

for all x,yS, any fixed iI and positive integer n. From equation(3.9), its easy to show that f(x + ni) =g(i)nf(x) and ϕ(x + ni,y)≤ ϕ(x,y) for all xS, any fixed iI andpositive integer n. So, we have

f ( x + y ) g ( y ) f ( x ) ϕ ( x , y ) | g ( i ) | n

for all x,yS, any fixed iI and positive integer n (note that|g(i)| > 1), which implies that f(x+ y) = g(y)f(x) for allx,yS. The proof is complete.

With the above Theorem, its obvious that the following corollaries.

Corollary 3.4

Let (S, + ) be a commutative semigroup and f,g :SC satisfying

f(x+y)g(y)f(x)δ
(3.10)

for all x,yS and some δ >0. Then g is either bounded or f(x + y)= g(y)f(x) for all x,yS.

Corollary 3.5

Let (S, + ) be a commutative semigroup and f : SC satisfying

f(x+y)f(y)f(x)δ
(3.11)

for all x,yS. Then f is eitherbounded or f is exponential.

Endnote

2000 Mathematics Subject Classification. Primary 39B72, 39B52; Secondary 47H09.

Author’s contributions

The authors did not provide this information.