Open Access Research

On the super-stability of exponential Hilbert-valued functional equations

H Rezaei* and M Sharifzadeh

Author Affiliations

Department of Mathematics, College of Sciences, Yasouj University, Yasouj-75914-74831, Iran

For all author emails, please log on.

Journal of Inequalities and Applications 2011, 2011:114 doi:10.1186/1029-242X-2011-114


The electronic version of this article is the complete one and can be found online at: http://www.journalofinequalitiesandapplications.com/content/2011/1/114


Received:24 July 2011
Accepted:21 November 2011
Published:21 November 2011

© 2011 Rezaei and Sharifzadeh; licensee Springer.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We generalize the well-known Baker's super-stability result for exponential mappings with values in the field of complex numbers to the case of an arbitrary Hilbert space with the Hadamard product. Then, we will prove an even more general result of this type.

2000 MSC: primary: 39B72, secondary: 46E40.

Keywords:
exponential functions; stability; Hilbert-valued function

1. Introduction

The stability problem of functional equations goes back to a question of Ulam [1] concerning the stability of group homomorphisms. Hyers [2] gave a first affirmative partial answer to the question of Ulam for Banach spaces (see also [3]). Hyers's theorem was generalized by Aoki [4] for additive mappings and by Rassias [5,6] for linear mappings by considering an unbounded Cauchy difference. Baker et al. [7] have proved the super-stability of the exponential functional equation: If a function f: ℝ → ℝ is approximately exponential function, i.e., there exists a nonnegative number α such that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M1','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M1">View MathML</a>

for x, y ∈ ℝ, then f is either bounded or exponential. This theorem was the first result concerning the super-stability phenomenon of functional equations. Baker [8] generalized this famous result to any function f: (G, +) → ℂ where (G, +) is a semigroup. The same result is also true for approximately exponential mappings with values in a normed algebra with the property that the norm is multiplicative.

Theorem 1.1. Let (G, +) be a semigroup and Y be a normed algebra in which the norm is multiplicative. Then, for a function f: G Y satisfying the inequality

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M2','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M2">View MathML</a>

for all x; y G and for some α > 0, either <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M3','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M3">View MathML</a> for all x G or f is an exponential function.

In the other world every approximately exponential map f: (G, +) → Y is either bounded or exponential.

Rassias [5,6] introduced the term mixed stability of the function f: E → ℝ, where E is a Banach space, with respect to two operations addition and multiplication among any two elements of the set {x, y, f(x), f(y)}. Especially, he raised an open problem concerning the behavior of solutions of the inequality:

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M4','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M4">View MathML</a>

(see also [9,10]). In connection with this open problem, Gavruta [11] gave an answer to this problem in the spirit of Rassiass approach:

Theorem 1.2 (Gavruta). Let X and Y be a real normed space and a normed algebra with multiplicative norm, respectively. If a function f: X Y satisfies the inequality

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M5','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M5">View MathML</a>

for all x; y X and for some p > 0 and θ > 0, then either ||f(x)|| ≤ δ||x||p for all x X with ||x|| ≥ 1 or f is an exponential function, where <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M6','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M6">View MathML</a>.

Baker [8] gave an example to present that the Theorem 1.1 is false if the algebra Y does not have the multiplicative norm: Given δ > 0, choose an ε > 0 with |ε - ε2| = δ. Let M2(ℂ) denote the space of 2 × 2 complex matrices with the usual norm and f: ℝ → M2(ℂ) is defined by f(x) = exe11 + exe22 where eij is defined as the 2 × 2 matrix with 1 in the (i, j) entry and zeroes elsewhere. We will show that such behavior is typical for approximately exponential mappings with values in Hilbert spaces with Hadamard product which is not multiplicative.

Let H be a Hilbert space with a countable orthonormal basis {en: n ∈ ℕ}. For two vectors x, y H, we have the Hadamard product (named after French mathematician Jacques Hadamard), also known as the entrywise product on Hilbert space H as the following:

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M7','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M7">View MathML</a>

The Cauchy-Schwartz inequality together with the Parseval identity insure that Hadamard multiplication is well defined. In fact,

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M8','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M8">View MathML</a>

In the present paper, we state a super-stability result for the approximately exponential Hilbert-valued functional equation by Hadamard product, see Theorem 2.1 below. As a consequence, we prove if a surjective function f: H H satisfies the inequality

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M9','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M9">View MathML</a>

for some α ≥ 0 and for all x; y H, then it must be exponential with this product, i.e.,

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M10','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M10">View MathML</a>

Then, we will prove an even more general result of this type. We also generalized Theorem 2.1 concerning the mixed stability for Hilbert-valued functions.

2. Main results

The function f(x) = ax is said to be an exponential function, where a > 0 is a fixed real number. The exponent law of exponential functions is well represented by the exponential equation f(x + y) = f(x)f(y). Hence, we call every solution function of the exponential equation as exponential function. A general solution of the exponential equation was introduced in [12]. In fact, a function f: ℝ → ℂ is an exponential function if and only if either f(x) = exp(A(x) + ia(x)) for all x ∈ ℝ or f(x) = 0 for all x ∈ ℝ; where A: ℝ → ℝ is an additive function and a: ℝ → ℝ satisfies

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M11','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M11">View MathML</a>

(1)

for all x, y ∈ ℝ. Indeed, a function f: ℝ → ℝ continuous at a point is an exponential function if and only if f(x) = ax for all x ∈ ℝ or f(x) = 0 for all x ∈ ℝ, where a > 0 is a constant.

Definition 2.1. For a Hilbert space H and a semi-group (G,.), a function F: G H is said to be exponential when

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M12','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M12">View MathML</a>

for every x, y G.

The following proposition characterizes the Hilbert-valued function satisfying the exponential equation:

Proposition 2.2. Let H be a separable complex Hilbert space and the mapping F: ℝ → H be exponential then either F ≡ 0 or there exist a positive integer N such that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M13','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M13">View MathML</a>

for all x H where An: ℝ → ℝ is an additive function and an is a function satisfying (1) for n = 1, 2,..., N.

Proof. For every integer n ≥ 1, consider the function en F: ℝ → ℂ by

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M14','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M14">View MathML</a>

for every h H. Since F is exponential, so is en F for every integer n ≥ 1. Indeed, for n ≥ 1 and x, y H, we see that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M15','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M15">View MathML</a>

This yields the exponential property of en F for every n ≥ 1. Hence, either

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M16','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M16">View MathML</a>

(2)

for all x ∈ ℝ or (en F)(x) = 0 for all x ∈ ℝ; here An: ℝ → ℝ is an additive function and an is a function satisfying (1). The continuation of proof depend on the dimension of H. In fact, if H is infinite dimensional, since

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M17','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M17">View MathML</a>

for every x H as n → +∞ Equation 2 is not possible for infinitely many positive integer n and hence there exists some positive integer N such that en F = 0 for every integer n > N. Thus, F can be represented as

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M18','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M18">View MathML</a>

In the case that H is of finite dimensional type, the proof is clear.

In the following theorem, we generalize the well-known Baker's super-stability result for exponential mappings with values in the field of complex numbers to the case of an arbitrary Hilbert space with the Hadamard product.

Theorem 2.3. Let G be a semigroup and let α > 0 be given. If a function f: G H satisfies the inequality

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M19','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M19">View MathML</a>

(3)

for all x; y G, then either there exists an integer k ≥ 1 such that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M20','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M20">View MathML</a>

(4)

for all x G or

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M21','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M21">View MathML</a>

for all x; y G.

Proof. Assume that the first conclusion (i.e., (4)) is not true. Hence, for every integer k ≥ 1, there exists a ak G such that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M22','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M22">View MathML</a>

Let <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M23','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M23">View MathML</a>, fk(x) = 〈f(x), ek〉, and gk = 2-k fk. Then, β2 - 2β = α, β > 2 and |fk(ak)| > 2kβ whence |gk(ak)| > β. By applying the Parseval identity and definition of Hadamard product with together relation (3), we find that each scalar-valued function fk is approximately exponential, i.e.,

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M24','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M24">View MathML</a>

(5)

for every integer k ≥ 1 and x, y G. Let

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M25','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M25">View MathML</a>

then γk > 1 for every integer k ≥ 1. It follows from (5) for x = y = ak that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M26','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M26">View MathML</a>

and so

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M27','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M27">View MathML</a>

Now, make the induction hypothesis

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M28','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M28">View MathML</a>

(6)

Then, by using (5) for <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M29','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M29">View MathML</a> and (6), we observe that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M30','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M30">View MathML</a>

and (6) is established for all n ∈ ℕ. Hence, by definition of fk and gk, we see that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M31','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M31">View MathML</a>

(7)

On the other hand, for every x, y, z G, we have

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M32','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M32">View MathML</a>

Consequently, for h(x, y) = f(x.y) - f(x) * f(y), one can see

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M33','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M33">View MathML</a>

Now, by using Parseval identity for h(x, y) * f(z) observe that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M34','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M34">View MathML</a>

Applying the last relation for <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M35','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M35">View MathML</a> and relation (7) to deduce that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M36','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M36">View MathML</a>

It follows that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M37','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M37">View MathML</a>

for all x, y G and any n ∈ ℕ. Letting n → +∞, we conclude that h(x, y) = 0 and so f(x.y) = f(x) * f(y) for all x, y G.

Notice that if f: H H is a surjection function, then every component function en f is unbounded. In fact, for every positive integer n, there exists some xn H such that f(xn) = nen, and so (en f)(xn) = n. This led to the following corollary:

Corollary 2.4. If a surjective function f: H H satisfies the inequality

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M38','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M38">View MathML</a>

for some α ≥ 0 and for all x; y G, then f(x * y) = f(x) * f(y) for all x; y G.

In the next theorem, we generalize the Gavruta Theorem on mixed stability for Hilbert-valued function with Hadamard product:

Theorem 2.5. Let X be a normed space and H be a separable Hilbert space. If a function f: X H satisfies the inequality

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M39','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M39">View MathML</a>

(8)

for all x; y X and for some p > 0 and θ > 0, then either there exists an integer k ≥ 1 such that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M40','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M40">View MathML</a>

(9)

for all x X with ||x|| ≥ 1 or

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M41','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M41">View MathML</a>

for all x; y X. where <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M42','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M42">View MathML</a>.

Proof. Assume that for every integer k ≥ 1 there exists an xk X with ||xk|| ≥ 1 such that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M43','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M43">View MathML</a>

If we set fk(x): = 〈f(x), ek〉 and gk := 2-kfk, this is equivalent with

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M44','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M44">View MathML</a>

It follows from Parseval identity, definition of Hadamard product and relation (8) that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M45','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M45">View MathML</a>

(10)

for every x, y X and k ≥ 1. In particular, for x = y = xk

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M46','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M46">View MathML</a>

Since β2 = 2p + 1 β + 2θ, hence

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M47','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M47">View MathML</a>

Now, make the induction hypothesis

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M48','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M48">View MathML</a>

(11)

Then, by using (10) for x = y = 2nxk and (11), we get

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M49','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M49">View MathML</a>

which in turn proves that the inequality (11) is true for all n ∈ ℕ. Hence, by definition of fk and gk, we see that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M50','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M50">View MathML</a>

(12)

Choose x; y; z X with f(z) ≠ 0. It then follows from (8) that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M51','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M51">View MathML</a>

and again by (8) we get

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M52','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M52">View MathML</a>

which together with the last relation yields

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M53','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M53">View MathML</a>

(13)

where

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M54','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M54">View MathML</a>

Let h(x, y) = f(x + y) - f(x) * f(y), then by (13)

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M55','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M55">View MathML</a>

and so

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M56','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M56">View MathML</a>

In particular, by using the last relation for zk = 2nxk and by considering (12) we deduce that

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M57','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M57">View MathML</a>

and consequently,

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M58','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M58">View MathML</a>

for all x, y X and any n ∈ ℕ. Letting n → +∞, we conclude that h(x, y) = 0 and so f(x + y) = f(x) * f(y) for all x, y X.

At the end of this paper, let us consider the other type multiplication in a Hilbert space. In fact, for a separable Hilbert space H and two elements <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M59','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M59">View MathML</a> and <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M60','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M60">View MathML</a> of H, one can define the convolution product by

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M61','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M61">View MathML</a>

where the numbers <a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M62','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M62">View MathML</a> can be obtained by discrete convolution:

<a onClick="popup('http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M63','MathML',630,470);return false;" target="_blank" href="http://www.journalofinequalitiesandapplications.com/content/2011/1/114/mathml/M63">View MathML</a>

Hence, it is interesting to study and to phrase the super-stability phenomenon for functions with values in (H, •). For instance, it is desirable to have a sufficient condition for approximately exponential mappings with values in (H, •) to be exponential with the convolution product.

3. Competing interests

The authors declare that they have no competing interests.

4. Authors' contributions

All authors carried out the proof. All authors conceived of the study, and participated in its design and coordination. All authors read and approved the final manuscript.

References

  1. Ulam, SM: A Collection of Mathematical Problems, Interscience Tracts in Pure and Applied Mathematics, no. 8. Interscience. New York (1960)

  2. Hyers, DH: On the stability of the linear functional equation. Proc Nat Acad Sci USA. 27, 222–224 (1941). PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  3. Hyers, DH, Rassias, ThM: Approximate homomorphisms. Aequat Math. 44, 125–153 (1992). Publisher Full Text OpenURL

  4. Aoki, T: On the stability of the linear transformation in Banach spaces. J Math Soc Japan. 2, 64–66 (1950). Publisher Full Text OpenURL

  5. Rassias, ThM: Problem 18, in Report on the 31st ISFE. Aequat Math. 47, 312–313 (1994)

  6. Rassias, ThM: On the stability of the linear mapping in Banach spaces. Proc Am Math Soc. 72(2), 297–300 (1978). Publisher Full Text OpenURL

  7. Baker, JA, Lawrence, J, Zorzitto, F: The stability of the equation f(x + y) = f(x)f(y). Proc Am Math Soc. 74, 242–246 (1979)

  8. Baker, JA: The stability of the cosine equation. Proc Am Math Soc. 80, 411–416 (1980). Publisher Full Text OpenURL

  9. Jung, SM: Hyers-Ulam-Rassias Stability of Functional Equations in Nonlinear Analysis, Springer, New York (2011)

  10. Kuczma, M: An Introduction to the Theory of Functional Equations and Inequalities. PWN, Warszawa, Krak ow, and Katowice (1985)

  11. Gavruta, P: An answer to a question of Th.M. Rassias and J. Tabor on mixed stability of mappings. Bul Stiint Univ Politeh Timis Ser Mat Fiz. 42, 1–6 (1997)

  12. Czerwik, S: Functional Equations and Inequalities in Several Variables. World Scientific, Hackensacks (2002)