Hyperstability and Superstability
Abstract
This is a survey paper concerning the notions of hyperstability and superstability, which are connected to the issue of Ulam’s type stability. We present the recent results on those subjects.
1. Introduction
In this paper we provide some recent results concerning hyperstability and superstability of functional equations. Those two notions are very similar but somewhat different. They are connected with the issue of Ulam’s type stability.
Let us mention that various aspects of Ulam’s type stability, motivated by a problem raised by Ulam (cf. [1, 2]) in 1940 in his talk at the University of Wisconsin, have been a very popular subject of investigations for the last nearly fifty years (see, e.g., [3–11]). For example the following definition somehow describes the main ideas of such stability notion for equations in n variables (ℝ+ stands for the set of all nonnegative reals).
Definition 1. Let A be a nonempty set, (X, d) be a metric space, be nonempty, 𝒯 be an operator mapping 𝒞 into , and ℱ1, ℱ2 be operators mapping a nonempty set 𝒟 ⊂ XA into . We say that the operator equation
(As usual, CD denotes the family of all functions mapping a set D ≠ ∅ into a set C ≠ ∅.) Roughly speaking, (ℰ, 𝒯)-stability of (1) means that every approximate (in the sense of (2)) solution of (1) is always close (in the sense of (3)) to an exact solution of (1).
The next theorem has been considered to be one of the most classical results on Ulam’s type stability.
Theorem 2. Let E1 and E2 be normed spaces, E2 complete, and c ≥ 0 and p ≠ 1 fixed real numbers. If f : E1 → E2 is a mapping satisfying
This theorem is composed of the outcomes from [1, 12–14] and it is known (see [13]; cf. also [15, 16]) that for p = 1 an analogous result is not valid. Moreover, it has been shown in [17] that estimation (5) is optimal for p ≥ 0 in the general case.
Theorem 2 has a very nice simple form, but it has been improved in [18], where it has been shown that, in the case p < 0, each f : E1 → E2 satisfying (4) must actually be additive (and the completeness of E2 is not necessary in such a situation). Namely, we have the following result (ℕ stands for the set of all positive integers).
Theorem 3. Let E1 and E2 be normed spaces, X ⊂ E1∖{0} nonempty, c ≥ 0, and p < 0. Assume also that
Clearly, since (5) gives the best possible estimation for p ≥ 0 in the general case, a result analogous to Theorem 3 is not true for p ≥ 0.
On account of Theorem 3, we can reformulate Theorem 2 as follows.
Theorem 4. Let E1 and E2 be normed spaces and let c ≥ 0 and p ≠ 1 be fixed real numbers. Assume also that f : E1 → E2 is a mapping satisfying (4). If p ≥ 0 and E2 is complete, then there exists a unique additive function T : E1 → E2 such that (5) holds. If p < 0, then f is additive.
Following the terminology introduced in [19] and next used in, for example, [20] (see also [3, pages 27–29]), we can describe the second statement of Theorem 4, for p < 0, as the φ-hyperstability of the additive Cauchy equation for φ(x, y) ≡ c(∥x∥p + ∥y∥p).
It is interesting that the hyperstability result, described in Theorem 3, does not remain valid without condition (6), which is shown in the following remark (ℝ denotes the set of all reals).
Remark 5. Let p < 0, a ≥ 0, I = (a, ∞), and f, T : I → ℝ be given by T(x) = 0 and f(x) = xp for x ∈ I. Then clearly
However, with a somewhat different (though still natural) form of the function φ, φ-hyperstability still holds even without (6). Namely, in [21, Theorem 1.3] the subsequent result has been proved.
Theorem 6. Let E1 and E2 be normed spaces, X ⊂ E1∖{0} nonempty, c ≥ 0, and p, q real numbers with p + q < 0. Assume also that there is an m0 ∈ ℕ such that
We refer the reader to, for example, [22, Theorem 1.1, Chapter XVIII], [23, Chapter 4], [24, pages 143-144], and [25, Proposition 3.8] for some information on the following natural issue: when for an operator T0 : E1 → E2 that is additive on X ⊂ E1, there is an additive T : E1 → E2 with T(x) = T0(x) for x ∈ X.
2. Hyperstability Results for the Cauchy Equation
Formally, we can introduce the following definition.
Definition 7. Let A be a nonempty set, (X, d) a metric space, , and ℱ1, ℱ2 operators mapping a nonempty set 𝒟 ⊂ XA into . We say that operator equation (1) is ɛ-hyperstable provided every φ0 ∈ 𝒟 satisfying inequality (2) fulfils (1).
Theorem 6 yields also the following two simple corollaries (see [21]), which correspond to some results from [26–33] on inhomogeneous Cauchy equation (18) and cocycle equation (19).
Corollary 8. Let E1 and E2 be normed spaces, X ⊂ E1∖{0} nonempty, G : X2 → E2, and G(x0, y0) ≠ 0 for some x0, y0 ∈ X with x0 + y0 ∈ X. Assume also that (14) holds with an m0 ∈ ℕ and there are p, q ∈ ℝ and c > 0 such that p + q < 0 and
Corollary 9. Let E1 and E2 be normed spaces, X ⊂ E1∖{0} nonempty, satisfy the cocycle functional equation
The hyperstability results that we have presented so far have been obtained through the fixed point theorem from [34] (see also [35, 36]; cf. [4] for a survey on similar methods using the fixed point results). Now, we provide some further φ-hyperstability results (with functions φ of some other natural forms) for the Cauchy additive equation, proved in [25] by some other methods.
Theorem 10. Let (X, 〈·∣·〉) be a real inner product space with dim X > 1, Y a normed space, and g : X → Y. If there are positive real numbers p ≠ 1 and L such that
If p = 1, then g does not need to be additive (see [25]).
Theorem 11. Let X and Y be normed spaces, dim X > 2, and g : X → Y. Suppose also that there are positive real numbers p and L0 with
If X is a real inner product space and p = 1, then g does not need to be additive (see [25]).
Now, we are in a position to present another result from [25].
Theorem 12. Let X and Y be normed spaces and ∅ ≠ U ⊂ X. Assume that C, D : X → X are additive,
- (a)
E is injective, U ⊂ E(U) and
() - (b)
U ⊂ D(U), D is injective and
()
Remark 13. Observe that condition (25) holds when D = Cn with a nonnegative integer n or D(x) = γx for x ∈ X with a rational number γ (because C is assumed to be additive).
Remark 14. For instance, the inequality in (a) holds for p > 1, U = X, and
For similar hyperstability results in some situations where neither condition (a) nor (b) is fulfilled we refer the reader to [25, Corollaries 3.5 and 3.6].
We end this part of the paper with one more hyperstability result (on a restricted domain) from [25]. To do this, let us recall some notions.
Given nonempty sets X, Y, ℐ ⊂ 2X and f, g : X → Y, we say that f = g ℐ-almost everywhere (abbreviated to ℐ-a.e.) in X if there is a set T ∈ ℐ such that f(x) = g(x) for every x ∈ X∖T. If, moreover, X is a normed space, then we also write αT : = {αx : x ∈ T} for T ⊂ X and α ∈ ℝ.
Now we are in a position to present [25, Theorem 4.1] (which actually is a consequence of some previous results).
Theorem 15. Let X and Y be normed spaces, g : X → Y, and ℐ ⊂ 2X a σ-ideal such that
- (i)
there exist T ∈ ℐ, c, d ∈ ℝ, cd(c + d) ≠ 0, L > 0 and p > 1 such that
() - (ii)
there exist T ∈ ℐ, C : X → X with C(2x) = 2C(x) for x ∈ X and positive reals L and p ≠ 1 such that
()
A hyperstability result for the multi-Cauchy equation (which actually is a system of Cauchy equations) can be found in [37, Corollary 4].
Finally, we would like to call the reader’s attention to a general theorem in [38] which yields numerous other hyperstability results for the Cauchy additive equation.
3. Hyperstability of the Linear Functional Equation
The subsequent theorem has been proved in [40].
Theorem 16. Let X be a normed space over 𝔽 ∈ {ℝ, ℂ}, Y be a Banach space over 𝕂 ∈ {ℝ, ℂ}, A, B ∈ 𝔽∖{0}, a, b ∈ 𝕂, c ≤ 0, p < 0, and f : X → Y satisfy
Similar results, for Jensen equation (37), but on a restricted domain, have been obtained in [41]. Namely, we have the following three theorems.
Theorem 17. Let X be a normed space, U be a nonempty subset of X∖{0} such that there exists a positive integer n0 with
Theorem 18. Let X be a normed space, U a nonempty subset of X∖{0} such that there exists a positive integer n0 with
Theorem 19. Let X be a normed space, U a nonempty subset of X∖{0} such that there exists a positive integer n0 with
We finish this section of the paper by proving one more very simple hyperstability result for (35).
Theorem 20. Let X be a normed space over a field 𝔽 ∈ {ℝ, ℂ}, Y a normed space over a field 𝕂 ∈ {ℝ, ℂ}, a, b ∈ 𝕂, z0 ∈ Y, A, B ∈ 𝔽, L, p, q ∈ ℝ+, p + q > 0, and let one of the following two conditions be valid:
- (i)
q ≠ 0 and |A|p+q ≠ |a|;
- (ii)
p ≠ 0 and |B|p+q ≠ |b|.
Proof. First, observe that in the case when a + b = 1, inequality (46) with x = y = 0 implies z0 = 0.
Put
We consider only case (i) (case (ii) is analogous). First, assume that |a | <|A|p+q. Then (49) with y = 0 gives
We show by induction that, for each n ∈ ℕ0 : = ℕ ∪ {0},
Letting n → ∞ in (51) we see that
If |a | >|A|p+q, then a ≠ 0 and from (49) with y = 0 we obtain
Remark 21. Let g0(x) = x for x ∈ X = Y, 𝔽 = 𝕂, a ≠ A and b = B. Then
4. Hyperstability of Some Other Equations
In this part of the paper we present the hyperstability results for some other equations. The first two theorems have been proved in [19].
Theorem 23. Let M : (0,1] → ℝ be a solution of the functional equation
Theorem 24. Let (S, ·) be a semigroup and φ1, …, φn : S → S pairwise distinct automorphisms of S such that the set {φ1, …, φn} is a group with the operation of composition of mappings. Let, moreover, ɛ : S × S → ℝ+ be a function for which there exists a sequence (uk) k∈ℕ of elements of S satisfying one of the following two conditions:
The following result, concerning the parametric fundamental equation of information, has been obtained in [20].
Theorem 25. Let α < 0 and f : (0,1) → ℝ be a function such that
The next two theorems have been proved in [42, 43] and concern hyperstability of the polynomial and monomial equations (for details concerning those equations we refer the reader to [22]).
Theorem 26. Let X and Y be real normed spaces. If a function f : X → Y satisfies the inequality
Theorem 27. Let X and Y be real normed spaces and n a positive integer. If a function f : X → Y satisfies the inequality
The next theorem from [44] contains a hyperstability result for the Drygas equation.
Theorem 28. Assume that D is a nonempty subset of a normed space X such that 0 ∉ D and there exists an n0 ∈ ℕ with
Theorem 28 yields at once the following characterization of the inner product spaces.
Corollary 29. Let X be a normed space and
Proof. Write f(x) = ∥x∥2 for x ∈ X. Then from Theorem 28 we easily derive that
The next hyperstability result has been proved in [45, Corollary 2.9] and is actually a particular consequence of two more general theorems proved there.
Theorem 30. Let X be a normed space, Y be a Banach space, p, q, λ ∈ ℝ+ and 0 < p + q ≠ 4. Assume also that a mapping f : X → Y satisfies the inequality
A result on hyperstability of the equation of p-Wright affine functions has been obtained in [46] and it reads as follows.
Theorem 31. Let X be a normed space over a field 𝔽 ∈ {ℝ, ℂ}, Y a Banach space, p ∈ 𝔽, A, k > 0, |p|2k + |1−p|2k < 1 and g : X → Y satisfy
The next result has been proved in [47] and concerns the homogeneity equation.
Theorem 32. Let X and Y be normed spaces over 𝕂 ∈ {ℝ, ℂ}, p, q ∈ ℝ, ɛ ∈ ℝ+, and g : X → Y satisfy
- (a)
p < 1 and q ≥ 0;
- (b)
p > 0 and q < 0,
Some further hyperstability (but also superstability) results for the homogeneity equation can be found in [48, 49]. Unfortunately, they are too involved to be presented here. Therefore, we only give below the following simple corollary (see [48, Corollary 3]).
Theorem 33. Let X be a real linear space, Y a Banach space, and g : X → Y satisfy
Theorem 34. Let X be a normed space, Y a Banach space, p < 0 ≤ ɛ, and a function f : X × X → Y satisfy the inequality
Theorem 35. Let X be a normed space, Y a Banach space, p < 0 ≤ ɛ, and a function f : X × X → Y satisfy the inequality
- (i)
[51, Theorem 8.3] (for a generalization of the quadratic equation);
- (ii)
[52] (for the equations of homomorphism and derivation in proper JCQ*-triples);
- (iii)
[53, Theorem 21.3] (for the equations of homomorphism for square symmetric groupoids, considered in a class of set-valued mappings);
- (iv)
[54, Theorem 1] (for a functional equation in one variable in a class of set-valued mappings);
- (v)
[55] (for functional equations of trigonometric forms in hypergroups).
5. Superstability
In this part of the paper we present several recent results on superstability of some functional equations. For numerous earlier results as well as the historical background of the subject we refer the reader to [6, 7, 9, 10].
The following definition explains how the notion of superstability for functional equations (in n variables) is understood nowadays.
Definition 36. Let A be a nonempty set, (X, d) a metric space, and ℱ1, ℱ2 operators mapping a nonempty set 𝒟 ⊂ XA into . We say that operator equation (1) is superstable if every φ ∈ 𝒟 that is unbounded (i.e., sup x,y∈Ad(φ(x), φ(y)) = ∞) and satisfies the inequality
Let us start with the results that Moszner has proved in [56] (modificating the proofs from [57, 58]), and which concern the sine, homomorphism, Lobachevski and cosine equations.
Theorem 37. Let G be a uniquely 2-divisible commutative group and A a finite-dimensional commutative normed algebra without the zero divisors. Then every unbounded function f : G → A such that
Theorem 38. Let (G, ·) be a commutative semigroup and (A, ·) a groupoid equipped with
- (i)
an operation ℝ+ × A∋(λ, a) ↦ λa ∈ A such that
() - (ii)
an element 0 ∈ A such that λ0 = 0 for λ ∈ ℝ+ and a2 ≠ 0 for a ∈ A∖{0};
- (iii)
a metric ρ satisfying the condition
()
Theorem 39. Let G be a uniquely 2-divisible commutative monoid and A a finite-dimensional commutative normed algebra without the zero divisors. Then every unbounded function f : G → A such that
Theorem 40. Let G be a commutative group and A a finite-dimensional unital normed algebra without the zero divisors. Then every unbounded function f : G → A such that
The next theorem, proved by Moszner in [56], generalizes Batko’s result from [59].
Theorem 41. Let G be a groupoid and A a finite-dimensional normed algebra without the zero divisors. Then every unbounded function f : G → A such that
Theorem 42. Let G be a group and A a finite-dimensional normed algebra without the zero divisors. Then every unbounded function f : G → A such that
The above theorem generalizes (to some extent) the following result, which has been obtained in [60], by another method of proof and under stronger assumptions.
Theorem 43. Let ɛ ≥ 0 and G be a commutative group. If a function f : G → ℂ satisfies
Theorem 44. Let X be a linear space over 𝕂 ∈ {ℝ, ℂ} and f : X → 𝕂, φ : X × X → ℝ+ hemicontinuous (see [61] for the definition) at the origin functions such that
The following result comes from [63].
Theorem 45. Assume that ɛ > 0 and a ≥ 1. If a function f : ℝ → ℝ fulfills the inequality
With this notations, we have the following theorem (proved in [64]) on the superstability of a functional equation connected with the d’Alembert and Stetkær equations.
Theorem 46. Assume that ɛ > 0. If a function f : H → ℂ fulfills the inequality
The next result has been proved in [65].
Theorem 47. Assume that X is a normed space over 𝔽 ∈ {ℝ, ℂ} and Y is a Banach algebra over 𝔽 in which the norm is multiplicative, that is,
Theorem 48. Let ɛ ≥ 0 and G be a uniquely 2-divisible commutative semigroup. If nonzero and nonconstant functions f, g, h : G → ℝ satisfy the inequality
An immediate consequence of Theorem 48 is the following corollary.
Corollary 49. Let ɛ ≥ 0 and G be a uniquely 2-divisible commutative semigroup. If nonzero and nonconstant functions f, g : G → ℝ satisfy the inequality
Theorem 50. Let V be a linear space and let functions f, g : V → ℂ be such that
- (i)
if f(x) ≡ 0, then g is arbitrary;
- (ii)
if f is nonzero and bounded or f(0) ≠ 0, then g is also bounded;
- (iii)
if f is unbounded, then f(0) = 0, g is unbounded, and (127) holds for all x, y ∈ V.
Theorem 51. Let V be a linear space. If functions f, g : V → ℂ are such that
- (i)
if f(x) ≡ 0, then g is arbitrary;
- (ii)
if f is nonzero and bounded or f(1) ≠ 0, then g is also bounded;
- (iii)
if f is unbounded, then f(1) = 0, g is unbounded, and (128) holds for all x, y ∈ V.
The next two theorems have been obtained in [68]. It is assumed in them that X is a commutative group, Λ is a finite subgroup of the group of automorphisms of X (the action of λ ∈ Λ on x ∈ X is denoted by λx), and N is the cardinality of Λ.
Theorem 52. Let 𝕂 ∈ {ℝ, ℂ}. If f, g, h : X → 𝕂, the function
Theorem 53. Let 𝕂 ∈ {ℝ, ℂ}. If f, g, h : X → 𝕂, the function
The next three theorems do not actually provide superstability results in the sense of Definition 36. However, we present them here, because they seem to be of some interest and are attempts to extend the notion of superstability analogously to the notion of φ-hyperstability.
The subsequent theorem, proved in [69], gives a partial affirmative answer to a problem posed by Th. M. Rassias during the 31st ISFE (ℜz and ℑz denote the real and imaginary parts of a complex number z, resp.).
Theorem 54. Let (S, ·) be a commutative semigroup, φ : S2 → ℝ+, ψ : S → ℝ+, and f : S → {z ∈ ℂ : −π < ℑz ≤ π} functions such that
The next result has been proved in [70].
Theorem 55. Let G be a commutative group and φ : G → ℝ+. If f : G → ℂ is an unbounded function such that
The last presented theorem is the main result of [71] and includes a few outcomes from [72–74].
Theorem 56. Assume that G is a commutative group and φ : G → ℝ+. If nonzero functions f, g, h, k : G → ℂ fulfill