Next Article in Journal
Observational Constraints and Cosmographic Analysis of f(T,TG) Gravity and Cosmology
Previous Article in Journal
LSTM Gate Disclosure as an Embedded AI Methodology for Wearable Fall-Detection Sensors
Previous Article in Special Issue
Fractional-Order Correlation between Special Functions Inspired by Bone Fractal Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Uniqueness Theorem for Stability Problems of Functional Equations

1
Nano Convergence Technology Research Institute, School of Semiconductor · Display Technology, Hallym University, Chuncheon 24252, Republic of Korea
2
Department of Mathematics Education, Gongju National University of Education, Gongju 32553, Republic of Korea
3
Ilsong Liberal Art Schools (Mathematics), Hallym University, Chuncheon 24252, Republic of Korea
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(10), 1298; https://doi.org/10.3390/sym16101298
Submission received: 16 July 2024 / Revised: 9 September 2024 / Accepted: 18 September 2024 / Published: 2 October 2024

Abstract

:
In this paper, we present a uniqueness theorem obtained by using direct calculation. This theorem is applicable to stability problems of functional equations whose solutions are monomial or generalized polynomial mappings of degree n. The advantage of this uniqueness theorem is that it simplifies the proof by eliminating the need to repeatedly and cumbersomely prove uniqueness in stability studies.

1. Introduction

By convention, let N and Q be the set of all positive integers and the set of all rational numbers, respectively. Assume that V and W are real vector spaces, and Y is a real normed space. A mapping A : V W is said to be additive if it satisfies A ( x + y ) = A ( x ) + A ( y ) for all x , y V . If A is an additive mapping, we can easily show that A ( r x ) = r A ( x ) for all x V and all r Q .
A mapping A n : V n W is called n-additive if it is additive in each of its variables. A mapping A n : V n W is said to be symmetric if A n ( x 1 , x 2 , , x n ) = A n ( y 1 , y 2 , , y n ) , whenever ( y 1 , y 2 , , y n ) is a permutation of ( x 1 , x 2 , , x n ) . For every n-additive symmetric mapping A n : V n W , we set A n ( x ) = A n ( x , x , , x ) for all x V . Then, we obtain A n ( r x ) = r n A n ( x ) whenever x V and r Q . Such a mapping A n ( x ) where A n 0 is called a monomial mapping of degree n, or an n-monomial mapping. Any mapping p : V W is said to be a generalized polynomial mapping of degree n, provided that there are a constant mapping A 0 ( x ) = A 0 W and i-monomial mappings A i : V i W , i { 1 , 2 , , n } , such that p ( x ) = i = 0 n A i ( x ) for all x V , where A n 0 . For details on the terminologies and definitions used above, one may refer to [1].
The purpose of this paper is to prove a theorem that solves the uniqueness problem that arises when studying the (generalized) stability of some functional equations, whose solutions are monomial mappings or generalized polynomial mappings of degree n.
The concept of stability of a functional equation occurs when we replace a functional equation with an inequality that acts as a perturbation of the equation. In 1940 (refer to [2]), the stability problem of the functional equation was raised by Ulam. This problem has attracted the attention of many researchers. In 1941 (refer to [3]), the affirmative answer to this question was given by Hyers. In 1950 (refer to [4]), Aoki generalized Hyers’ theorem for additive mappings. Also, in [5], Hyers’ result was generalized by Th. M. Rassias for linear mappings by an unbounded Cauchy difference. Moreover, in 1994, a further generalization of Th. M. Rassias’ theorem was obtained by Gǎvruţa (see [6]). After then, the stability problem of various functional equations has been extensively investigated by many mathematicians. For works of the stability problem of a functional equation whose solution is a monomial mapping, one can refer to [7,8,9,10,11,12]. For recent works of the stability problem of functional equations whose solutions are generalized polynomial mappings of degree 4 or 5 or 6 or 7 or 8 or 9 or 10, one can refer to [13,14,15,16,17,18,19,20,21,22,23].
Our results in this paper can be applicable to generalized stability problems of functional equations whose solutions are monomial or generalized polynomial mappings of degree n. Our main theorem (Theorem 5 in Section 3) states the following:
For any fixed n N , let a, α 1 , α 2 , , α n be nonzero real constants such that a > 1 and α 1 < α 2 < < α n . For a given mapping f : V Y , if there exist mappings F 1 , F 2 , , F n : V Y and a function ϕ : V { 0 } [ 0 , ) that satisfy
f ( x ) k = 1 n F k ( x ) i = 0 1 a α 1 i ϕ a i x < o r f ( x ) k = 1 n F k ( x ) i = 0 1 a α + 1 i ϕ a i x + i = 0 a α i ϕ 1 a i x < o r f ( x ) k = 1 n F k ( x ) i = 0 a α n i ϕ 1 a i x <
for some integer 1 < n , where every F k has the property
F k ( a x ) = a α k F k ( x ) ( f o r a l l x V ) ,
then the mappings F 1 , F 2 , , F n are uniquely determined.
The above main theorem of this paper is considered to be a further extension and generalization of existing uniqueness theorems. For previous uniqueness theorems related to the stability of functional equations, one can refer to [24,25].

2. Preliminaries

Throughout the paper, unless otherwise stated, we assume that V is a real vector space, Y is a real Banach space, and f : V Y is a given arbitrary mapping.
In the following theorem, let Φ be a function that satisfies similar conditions with Gǎvruţa condition (refer to [6]). Then, we prove that, for any given mapping f, if there is a mapping F (close to f) with some additional properties, then the mapping F is uniquely determined.
Theorem 1.
For any fixed integer n > 0 , let a, α 1 , α 2 , , α n be nonzero real constants, such that a > 1 and α 1 < α 2 < < α n , and let Φ : V { 0 } [ 0 , ) be a function satisfying one of the following conditions:
lim i 1 a α 1 i Φ ( a i x ) = 0 ( f o r a l l x V { 0 } ) , lim i a α 1 i Φ 1 a i x = lim i 1 a α 2 i Φ ( a i x ) = 0 ( f o r a l l x V { 0 } ) , lim i a α n 1 i Φ 1 a i x = lim i 1 a α n i Φ ( a i x ) = 0 ( f o r a l l x V { 0 } ) , lim i a α n i Φ 1 a i x = 0 ( f o r a l l x V { 0 } ) .
For a given mapping f : V Y , if there exist mappings F 1 , F 2 , , F n : V Y such that
f ( x ) k = 1 n F k ( x ) Φ ( x )
for all x V { 0 } , where every F k satisfies
F k ( a x ) = a α k F k ( x ) ( f o r a l l x V ) ,
then the mappings F 1 , F 2 , , F n are uniquely determined.
Proof. 
We will prove this theorem by applying mathematical induction. First, we will prove our claim for n = 1 . In this case, only the first and last conditions of (1) are valid. Let Φ : V { 0 } [ 0 , ) be a function that satisfies one of the following conditions:
lim i 1 a α 1 i Φ a i x = 0 ( f o r a l l x V { 0 } ) , lim i a α 1 i Φ 1 a i x = 0 ( f o r a l l x V { 0 } ) ,
and let f : V Y be an arbitrarily given mapping. Assume that F 1 , F 1 are mappings such that f ( x ) F 1 ( x ) Φ ( x ) , f ( x ) F 1 ( x ) Φ ( x ) , F 1 ( a x ) = a α 1 F 1 ( x ) , and F 1 ( a x ) = a α 1 F 1 ( x ) for all x V .
If Φ satisfies the first condition in (4), then we have
F 1 ( x ) F 1 ( x ) = lim i 1 a α 1 i F 1 a i x 1 a α 1 i F 1 a i x lim i 1 a α 1 i F 1 a i x 1 a α 1 i f a i x + lim i 1 a α 1 i f a i x 1 a α 1 i F 1 a i x 2 lim i 1 a α 1 i Φ a i x = 0
for all x V { 0 } .
We now assume that Φ satisfies the second condition in (4). Then, we obtain
F 1 ( x ) F 1 ( x ) = lim i a α 1 i F 1 1 a i x a α 1 i F 1 1 a i x lim i a α 1 i F 1 1 a i x a α 1 i f 1 a i x + lim i a α 1 i f 1 a i x a α 1 i F 1 1 a i x 2 lim i a α 1 i Φ 1 a i x = 0
for all x V { 0 } . Since F 1 ( 0 ) = F 1 ( 0 ) = 0 , it holds that F 1 ( x ) = F 1 ( x ) for all x V (for both cases).
Assume that our assertion holds for n = m 1 , where m > 1 is some integer. Let Φ : V { 0 } [ 0 , ) be a function satisfying one of conditions in (1) for n = m , and let f : V Y be an arbitrary mapping. Assume that f , F 1 , F 2 , , F m : V Y are mappings satisfying (2) and (3) for n = m .
Let g , G 1 , G 2 , , G m : V Y be the mappings defined by g ( x ) : = a α m f ( x ) f ( a x ) , G 1 ( x ) : = ( a α m a α 1 ) F 1 ( x ) , , G m 1 ( x ) : = ( a α m a α m 1 ) F m 1 ( x ) , and let Ψ : V { 0 } [ 0 , ) be the function defined by Ψ ( x ) : = a α m Φ ( x ) + Φ ( a x ) . Then, Ψ satisfies one of the conditions in (1) for n = m . It is easy to show that G 1 , G 2 , , G m 1 satisfy
G k ( a x ) = a α k G k ( x )
for all x V and k { 1 , 2 , , m 1 } , and
g ( x ) k = 1 m 1 G k ( x ) =   a α m f ( x ) f ( a x ) a α m k = 1 m 1 F k ( x ) k = 1 m 1 F k ( a x ) =   a α m f ( x ) k = 1 m F k ( x ) f ( a x ) k = 1 m F k ( a x ) a α m f ( x ) k = 1 m F k ( x ) + f ( a x ) k = 1 m F k ( a x ) a α m Φ ( x ) + Φ ( a x ) = Ψ ( x )
for all x V { 0 } .
Since Ψ satisfies one of conditions in (1) for n = m and g, G 1 , , G m 1 , Ψ satisfy (2) and (3) for n = m 1 ; by the induction assumption, G 1 , , G m 1 are uniquely determined. This implies that if Φ satisfies one of conditions in (1) for n = m and f, and F 1 , F 2 , , F m , Φ satisfy (2) and (3) for n = m , then F 1 , F 2 , , F m 1 are uniquely determined, because F k ( x ) = 1 a α m a α k G k ( x ) for each k { 1 , 2 , , m 1 } . In other words, if Φ satisfies one of conditions in (1) for n = m and f, F 1 , F 2 , , F m , Φ satisfies (2) and (3) for n = m and simultaneously, if f, F 1 , F 2 , , F k , Φ satisfy (2) and (3) for n = m , then F k = F k for every k { 1 , 2 , , m 1 } . Moreover, we have
F m ( x ) F m ( x ) = f ( x ) k = 1 m F k ( x ) f ( x ) k = 1 m F k ( x ) 2 Φ ( x )
for all x V { 0 } .
Now, we use (3) and (5) to prove that F m = F m . If Φ : V { 0 } [ 0 , ) satisfies one of the conditions other than the last one in (1) for n = m , namely the jth condition, then
F m ( x ) F m ( x ) = lim i 1 a α m i F m a i x F m a i x 2 lim i 1 a α m i Φ a i x 2 lim i 1 a α j i Φ a i x = 0
for all x V { 0 } and for some j { 1 , 2 , , m } , since 1 a α m i 1 a α j i .
We now assume that Φ satisfies the last condition in (1) for n = m . It then follows from (5) that
F m ( x ) F m ( x ) = lim i a α m i F m 1 a i x F m 1 a i x 2 lim i a α m i Φ 1 a i x = 0
for all x V { 0 } .
Finally, since F m ( 0 ) = F m ( 0 ) = 0 , it holds that F m ( x ) = F m ( x ) for all x V . With the inductive conclusion, we complete the proof of our assertion. □
In the following two corollaries, we assume that V is a real vector space and Y is a real normed space.
Corollary 1.
Let a, α 1 , α 2 , , α n be nonzero real constants, such that a > 1 and α 1 < α 2 < < α n , and let Φ : V { 0 } [ 0 , ) be a function that satisfies one of the conditions in ( 1 ) . For a given mapping f : V Y , if there are mappings F , F 1 , F 2 , , F n : V Y such that
f ( x ) F ( x ) Φ ( x ) ( f o r a l l x V { 0 } ) ,
where F ( x ) = k = 1 n F k ( x ) and F k ( a x ) = a α k F k ( x ) for all x V , then the mappings F, F 1 , F 2 , , F n are uniquely determined.
Corollary 2.
Let a, p, α 1 , α 2 , , α n , and p be nonzero real constants, such that a > 1 , p { α 1 , α 2 , , α n } and α 1 < α 2 < < α n . For a given mapping f : V Y , if there are mappings F , F 1 , F 2 , , F n : V Y and a constant K > 0 such that
f ( x ) F ( x ) K x p ( f o r a l l x V { 0 } ) ,
where F ( x ) = k = 1 n F k ( x ) and F k ( a x ) = a α k F k ( x ) for all x V , then the mappings F, F 1 , F 2 , , F n are uniquely determined.
Proof. 
If we put Φ ( x ) : = K x p for all x V { 0 } , then Φ satisfies one of the conditions of (1) and f, F 1 , F 2 , , F n satisfy conditions (2) and (3), given in Theorem 1. Therefore, F 1 , F 2 , , F n are the unique mappings that satisfy conditions ( 3 ) and ( 7 ) . □

3. Main Theorem

In this section, we assume that V is a real vector space and Y is a real normed space.
In the following three lemmas, we will introduce special conditions that satisfy the conditions of (1).
Lemma 1.
Let a and α be nonzero real constants with a > 1 . If a function ϕ : V { 0 } [ 0 , ) satisfies the condition
Φ ( x ) : = i = 0 1 a α i ϕ a i x <
for all x V { 0 } , then the function Φ : V { 0 } [ 0 , ) satisfies
lim m 1 a α m Φ ( a m x ) = 0
for all x V { 0 } .
Proof. 
If ϕ satisfies Φ ( x ) = i = 0 1 a α i ϕ ( a i x ) < for all x V { 0 } , then we have
lim m 1 a α m Φ ( a m x ) = lim m i = 0 1 a α ( m + i ) ϕ a m + i x = lim m i = m 1 a α i ϕ a i x = 0
for all x V { 0 } . □
In the following lemma, we introduce some special conditions that satisfy one of the second to nth conditions of (1).
Lemma 2.
For any fixed integer n > 0 , let ℓ be an integer with 1 < n . Assume that a, α , and α + 1 are nonzero real constants, such that a > 1 and α < α + 1 . If a function ϕ : V { 0 } [ 0 , ) satisfies the following conditions
Φ ( x ) : = i = 0 1 a α + 1 i ϕ a i x < a n d Φ ( x ) : = i = 0 a α i ϕ 1 a i x <
for all x V { 0 } , then the functions Φ , Φ : V { 0 } [ 0 , ) have the following properties:
lim m 1 a α + 1 m Φ ( a m x ) = lim m a α m Φ 1 a m x = 0
and
lim m 1 a α + 1 m Φ ( a m x ) = lim m a α m Φ 1 a m x = 0
for all x V { 0 } .
Proof. 
If ϕ satisfies Φ ( x ) = i = 0 1 a α + 1 i ϕ ( a i x ) < and Φ ( x ) = i = 0 a α i ϕ ( 1 a i x ) < for all x V { 0 } , then we have
lim m 1 a 2 α + 1 m Φ a 2 m x = lim m 1 a 2 α + 1 m 2 α m i = 2 m a α i ϕ 1 a i x = lim m 1 a 2 ( α + 1 α ) m i = 1 2 m 1 a α i ϕ a i x + lim m 1 a 2 ( α + 1 α ) m i = 0 a α i ϕ 1 a i x = lim m 1 a 2 ( α + 1 α ) m i = 1 2 m 1 a α i ϕ a i x + lim m 1 a 2 ( α + 1 α ) m Φ ( x ) = lim m 1 a ( α + 1 α ) m i = 1 m 1 1 a α i + ( α + 1 α ) m ϕ a i x + lim m i = m 2 m 1 a 2 α + 1 m α ( 2 m i ) ϕ a i x = lim m 1 a ( α + 1 α ) m i = 1 m 1 1 a α + 1 i + ( α + 1 α ) ( m i ) ϕ a i x + lim m i = m 2 m 1 a α + 1 i + ( α + 1 α ) ( 2 m i ) ϕ a i x lim m 1 a ( α + 1 α ) m i = 0 m 1 a α + 1 i ϕ a i x + lim m i = m 2 m 1 a α + 1 i ϕ a i x = 0
and
lim m a α m Φ 1 a m x = lim m i = 0 a α ( i + m ) ϕ 1 a i + m x = lim m i = m a α i ϕ 1 a i x = 0 .
Moreover, we also obtain
lim m 1 a α + 1 m Φ ( a m x ) = lim m i = 0 1 a α + 1 ( m + i ) ϕ a m + i x = lim m i = m 1 a α + 1 i ϕ a i x = 0
and
lim m a 2 α m Φ 1 a 2 m x = lim m 1 a 2 α + 1 m 2 α m i = 2 m 1 1 a α + 1 i ϕ a i x + lim m 1 a 2 α + 1 m 2 α m i = 0 1 a α + 1 i ϕ a i x = lim m 1 a 2 α + 1 m 2 α m i = 1 2 m a α + 1 i ϕ 1 a i x + lim m 1 a 2 α + 1 m 2 α m Φ ( x ) = lim m 1 a α + 1 m α m i = 1 m 1 a ( α + 1 α ) i a ( α + 1 α ) m a α i ϕ 1 a i x + lim m i = m 2 m a ( α + 1 α ) i a 2 ( α + 1 α ) m a α i ϕ 1 a i x lim m 1 a α + 1 m α m i = 1 a α i ϕ 1 a i x + lim m i = m 2 m a α i ϕ 1 a i x = 0
for all x V { 0 } .
Since lim m 1 a 2 α + 1 m Φ ( a 2 m x ) = 0 and lim m a 2 α m Φ ( 1 a 2 m x ) = 0 for all x V { 0 } , we have
lim m 1 a α + 1 ( 2 m + 1 ) Φ a 2 m + 1 x = 1 a α + 1 lim m 1 a 2 α + 1 m Φ a 2 m a x = 0
and
lim m a α ( 2 m + 1 ) Φ 1 a 2 m + 1 x = a α lim m a 2 α m Φ 1 a 2 m 1 a x = 0
for all x V { 0 } . From the above two equalities, we conclude that
lim m 1 a α + 1 m Φ ( a m x ) = 0 a n d lim m a α m Φ 1 a m x = 0
for all x V { 0 } . □
In the following lemma, we will introduce a special condition that satisfies the last condition of (1).
Lemma 3.
Let a and α be nonzero real constants with a > 1 . If a function ϕ : V { 0 } [ 0 , ) satisfies the following condition
Φ ( x ) : = i = 0 a α i ϕ 1 a i x <
for all x V { 0 } , then the function Φ : V { 0 } [ 0 , ) satisfies
lim m a α m Φ 1 a m x = 0
for all x V { 0 } .
Proof. 
If ϕ satisfies Φ ( x ) = i = 0 a α i ϕ ( 1 a i x ) < for all x V { 0 } , then we have
lim m a α m Φ 1 a m x = lim m i = 0 a α m + α i ϕ 1 a m + i x = lim m i = m a α i ϕ 1 a i x = 0
for all x V { 0 } . □
In the following theorem, we present practical ways to use Theorem 1 together with the three lemmas mentioned above. First, we combine Theorem 1 and Lemma 1 to prove the following theorem.
Theorem 2.
Assume that V is a real vector space and Y is a real normed space. For every fixed n N , let a, α 1 , α 2 , , α n be nonzero real constants, such that a > 1 and α 1 < α 2 < < α n . Assume that a function ϕ : V { 0 } [ 0 , ) satisfies the following condition
Φ ( x ) : = i = 0 1 a α 1 i ϕ a i x <
for all x V { 0 } . For any given mapping f : V Y , if there exist mappings F 1 , F 2 , , F n : V Y satisfying the inequality
f ( x ) k = 1 n F k ( x ) Φ ( x )
for all x V { 0 } , where each F i satisfies ( 3 ) for all x V , then the mappings F 1 , F 2 , , F n are uniquely determined.
Proof. 
Since ϕ satisfies Φ ( x ) = i = 0 1 a α 1 i ϕ ( a i x ) < for all x V { 0 } , it follows from Lemma 1 that
lim m 1 a α 1 m Φ ( a m x ) = 0
for all x V { 0 } . In view of Theorem 1 with the first condition of (1), we conclude that F 1 , F 2 , , F n are the unique mappings satisfying (3) and (8). □
Corollary 3.
Let V, Y, n, a, α 1 , α 2 , , α n , f, ϕ, and Φ be given under the same conditions as in Theorem 2. Assume that a mapping F : V Y satisfies the following inequality
f ( x ) F ( x ) Φ ( x )
for all x V { 0 } . If F : V Y can be expressed as F ( x ) = k = 1 n F k ( x ) and every F k has the property ( 3 ) , then F is the unique mapping that satisfies ( 9 ) .
Assume that V is a real vector space and Y is a real normed space. Now, we combine Theorem 1 and Lemma 2 to prove the following theorem.
Theorem 3.
For every fixed integer n > 0 , let ℓ be an integer with 1 < n . Assume that a, α 1 , α 2 , , α n are nonzero real constants such that a > 1 and α 1 < α 2 < < α n , and also suppose f : V Y is an arbitrary mapping. Assume moreover that a function ϕ : V { 0 } [ 0 , ) satisfies the conditions
Φ ( x ) : = i = 0 1 a α + 1 i ϕ a i x < a n d Φ ( x ) : = i = 0 a α i ϕ 1 a i x <
for all x V { 0 } . If mappings F 1 , F 2 , , F n : V Y satisfy the inequality
f ( x ) k = 1 n F k ( x ) Φ ( x ) + Φ ( x )
for all x V { 0 } , where each F k satisfies ( 3 ) for all x V , then the mappings F 1 , F 2 , , F n are uniquely determined.
Proof. 
If ϕ satisfies the conditions
Φ ( x ) = i = 0 1 a α + 1 i ϕ a i x < a n d Φ ( x ) = i = 0 a α i ϕ 1 a i x <
for all x V { 0 } , it then follows from Lemma 2 that
lim m 1 a α + 1 m Φ ( a m x ) = lim m a α m Φ 1 a m x = 0 , lim m 1 a α + 1 m Φ ( a m x ) = lim m a α m Φ 1 a m x = 0
for all x V { 0 } . Now, we apply Theorem 1 with Φ ( x ) + Φ ( x ) in place of Φ ( x ) to conclude that F 1 , F 2 , , F n are the unique mappings which satisfy both (3) and (10). □
Corollary 4.
Let V, Y, n, a, α 1 , α 2 , , α n , f, ϕ, Φ, and Φ be given under the same conditions as in Theorem 3. If there is a mapping F : V Y that satisfies the following inequality
f ( x ) F ( x ) Φ ( x ) + Φ ( x ) ( f o r a l l x V { 0 } ) ,
where F ( x ) = k = 1 n F k ( x ) and every F k has the property ( 3 ) , then the mappings F , F 1 , F 2 , , F n are uniquely determined.
As we often did before, we set V to be a real vector space and Y to be a real normed space. Finally, we combine Theorem 1 and Lemma 3 to prove the following theorem.
Theorem 4.
For any fixed n N , let a, α 1 , α 2 , , α n be nonzero real constants such that a > 1 and α 1 < α 2 < < α n . Assume that a function ϕ : V { 0 } [ 0 , ) satisfies the following condition
Φ ( x ) : = i = 0 a α n i ϕ 1 a i x <
for all x V { 0 } . For a given mapping f : V Y , if mappings F 1 , F 2 , , F n : V Y satisfy the inequality
f ( x ) k = 1 n F k ( x ) Φ ( x ) ( f o r a l l x V { 0 } ) ,
where every F k satisfies ( 3 ) for all x V , then the mappings F 1 , F 2 , , F n are uniquely determined.
Proof. 
If ϕ satisfies the condition, Φ ( x ) = i = 0 a α n i ϕ ( 1 a i x ) < , then we may use Lemma 3 to show that
lim m a α n m Φ 1 a m x = 0
for all x V { 0 } . Finally, we use Theorem 1 with the last condition of (1) to conclude that F 1 , F 2 , , F n are the unique mappings satisfying (3) and (12). □
Corollary 5.
Let V, Y, n, a, α 1 , α 2 , , α n , f, ϕ, and Φ be given under the same conditions as in Theorem 4. If there exists a mapping F : V Y that satisfies the inequality
f ( x ) F ( x ) Φ ( x ) ( f o r a l l x V { 0 } ) ,
where F ( x ) = k = 1 n F k ( x ) and every F k has property ( 3 ) , then the mapping F is uniquely determined.
The following main theorem results from Theorems 2–4.
Theorem 5
(Main Theorem). Assume that V is a real vector space and Y is a real normed space. For any fixed n N , let a, α 1 , α 2 , , α n be nonzero real constants, such that a > 1 and α 1 < α 2 < < α n . For a given mapping f : V Y , if there exist mappings F 1 , F 2 , , F n : V Y and a function ϕ : V { 0 } [ 0 , ) that satisfy
f ( x ) k = 1 n F k ( x ) i = 0 1 a α 1 i ϕ a i x < o r
f ( x ) k = 1 n F k ( x ) i = 0 1 a α + 1 i ϕ a i x + i = 0 a α i ϕ 1 a i x < o r
f ( x ) k = 1 n F k ( x ) i = 0 a α n i ϕ 1 a i x <
for all x V { 0 } and for some { 1 , 2 , , n 1 } , where every F k has property ( 3 ) , then the mappings F 1 , F 2 , , F n are uniquely determined.
Now, we introduce a corollary that further improves the applicability of the above main theorem.
Corollary 6.
Assume that V is a real vector space and Y is a real normed space. For any fixed n N , let a, α 1 , α 2 , , α n be nonzero real constants, such that a > 1 and α 1 < α 2 < < α n . For a given mapping f : V Y , if there exist a mapping F : V Y and a function ϕ : V { 0 } [ 0 , ) that satisfy
f ( x ) F ( x ) i = 0 1 a α 1 i ϕ a i x < o r
f ( x ) F ( x ) i = 0 1 a α + 1 i ϕ a i x + i = 0 a α i ϕ 1 a i x < o r
f ( x ) F ( x ) i = 0 a α n i ϕ 1 a i x <
for all x V { 0 } and for some { 1 , 2 , , n 1 } , where F ( x ) = k = 1 n F k ( x ) and every F k has the property ( 3 ) , then the mapping F is uniquely determined.

4. Examples

Assume that V is a real vector space and Y is a real normed space.
Example 1.
Let f : V Y be an arbitrary mapping and F : V Y an additive-quadratic-cubic-quartic (AQCQ′) mapping. If there exists a function ϕ : V { 0 } [ 0 , ) that satisfies
f ( x ) F ( x ) i = 0 1 2 i ϕ 2 i x < o r
f ( x ) F ( x ) i = 0 1 2 2 i ϕ 2 i x + i = 0 2 i ϕ 1 2 i x < o r
f ( x ) F ( x ) i = 0 1 2 3 i ϕ 2 i x + i = 0 2 2 i ϕ 1 2 i x < o r
f ( x ) F ( x ) i = 0 1 2 4 i ϕ 2 i x + i = 0 2 3 i ϕ 1 2 i x < o r
f ( x ) F ( x ) i = 0 2 4 i ϕ 1 2 i x <
for all x V { 0 } , then the mapping F is uniquely determined.
Proof. 
If we set a = 2 , α 1 = 1 , α 2 = 2 , α 3 = 3 , α 4 = 4 , F 1 an additive mapping, F 2 a quadratic mapping, F 3 a cubic mapping, and F 4 a quartic mapping, then F = F 1 + F 2 + F 3 + F 4 with F 1 ( 2 x ) = 2 F 1 ( x ) , F 2 ( 2 x ) = 2 2 F 2 ( x ) , F 3 ( 2 x ) = 2 3 F 3 ( x ) , and F 4 ( 2 x ) = 2 4 F 4 ( x ) . It then follows from Corollary 6 that F is the only additive-quadratic-cubic-quartic mapping that satisfies either (20), (21), (22), (23), or (24). □
For a given mapping f : V Y , we use the abbreviations D 1 f , D 2 f , D 3 f : V 2 Y defined by
D 1 f ( x , y ) : = f ( x + 2 y ) + f ( x 2 y ) 4 f ( x + y ) + f ( x y ) f ( 4 y ) + 4 f ( 3 y ) 6 f ( 2 y ) + 4 f ( y ) + 6 f ( x ) , D 2 f ( x , y ) : = f ( x + 2 y ) 4 f ( x + y ) + 6 f ( x ) 4 f ( x y ) + f ( x 2 y ) f ( 2 y ) f ( 2 y ) + 4 f ( y ) + 4 f ( y ) , D 3 f ( x , y ) : = f ( x + a y ) + f ( x a y ) a 2 f ( x + y ) a 2 f ( x y ) + 2 ( a 2 1 ) f ( x ) a 4 a 2 12 [ f ( 2 y ) + f ( 2 y ) 4 f ( y ) 4 f ( y ) ] , D 4 f ( x , y ) : = f ( x + 5 y ) 5 f ( x + 4 y ) 10 f ( x + 3 y ) + 10 f ( x + 2 y ) + 5 f ( x + y ) f ( x )
for all x , y V , where a { 1 , 0 , 1 } is a fixed integer. In [26], M. E. Gordji et al. showed that if f satisfies the functional equation D 1 f = 0 , then f is an AQCQ′ mapping. And in [27], J. R. Lee et al. showed that if f satisfies the functional equation D 2 f = 0 , then f is an AQCQ′ mapping, while in [28], K. Ravi et al. showed that if f satisfies D 3 f = 0 , then f is an AQCQ′ mapping. Also, in [29], D. Z. Djoković et al. showed that if f satisfies D 4 f = 0 , then f is a generalized polynomial mapping of degree 4 (Theorem 3 in [29]). Moreover, in [20], Y. H. Lee et al. obtained stability results of D 4 f = 0 .
Using Example 1, we can improve the stability results obtained separately by Gordji et al., Lee et al., Ravi, and Y. H. Lee et al. all at once, as shown in the following example.
Example 2.
For each { 0 , 1 , 2 , 3 , 4 } and any given function φ : V 2 [ 0 , ) , we define the conditions φ by
i = 0 1 2 i φ ( 2 i x , 2 i y ) < ( f o r = 0 ) , i = 0 1 4 i φ ( 2 i x , 2 i y ) + 2 i φ 1 2 i x , 1 2 i x < ( f o r = 1 ) , i = 0 1 8 i φ ( 2 i x , 2 i y ) + 4 i φ 1 2 i x , 1 2 i x < ( f o r = 2 ) , i = 0 1 16 i φ ( 2 i x , 2 i y ) + 8 i φ 1 2 i x , 1 2 i x < ( f o r = 3 ) , i = 0 16 i φ 1 2 i x , 1 2 i x < ( f o r = 4 )
for all x , y V . For a fixed { 0 , 1 , 2 , 3 , 4 } and m { 1 , 2 , 3 , 4 } , if a function φ : V 2 [ 0 , ) satisfies the conditions of (φ) and a mapping f : V Y satisfies f ( 0 ) = 0 and the following inequality
D m f ( x , y ) φ ( x , y )
for all x , y V , then there exists a unique mapping F : V Y such that D m F ( x , y ) = 0 for all x , y V and
f ( x ) F ( x ) 1 6 i = 0 1 2 i + 1 ρ ( 2 i x ) + 1 12 i = 0 1 4 i + 1 ψ ( 2 i x ) ( f o r = 0 ) , f ( x ) F ( x ) 1 6 i = 0 2 i ρ 1 2 i + 1 x + 1 6 i = 0 1 8 i + 1 ρ ( 2 i x ) + 1 12 i = 0 1 4 i + 1 ψ ( 2 i x ) ( f o r = 1 ) , f ( x ) F ( x ) 1 6 i = 0 2 i ρ 1 2 i + 1 x + 1 12 i = 0 4 i ψ 1 2 i + 1 x + 1 6 i = 0 1 8 i + 1 ρ ( 2 i x ) + 1 12 i = 0 1 16 i + 1 ψ ( 2 i x ) ( f o r = 2 ) , f ( x ) F ( x ) 1 6 i = 1 8 i ρ 1 2 i + 1 x + 1 12 i = 0 4 i ψ 1 2 i + 1 x + 1 12 i = 0 1 16 i + 1 ψ ( 2 i x ) ( f o r = 3 ) , f ( x ) F ( x ) 1 6 i = 1 8 i ρ 1 2 i + 1 x + 1 12 i = 1 16 i ψ 1 2 i + 1 x ( f o r = 4 )
for all x V , where
ρ ( x ) = 5 φ e ( 0 , x ) + 4 φ e ( x , x ) , ψ ( x ) = 5 φ e ( 0 , x ) + 4 φ e ( x , x ) + 46 φ e ( 0 , 0 ) ( f o r m = 1 ) , ρ ( x ) = φ e ( 2 x , x ) + 4 φ e ( x , x ) , ψ ( x ) = φ e ( 2 x , x ) + 4 φ e ( x , x ) + 5 2 φ e ( 0 , 0 ) ( f o r m = 2 ) , ρ ( x ) = 1 a 4 a 2 ( 2 φ e ( ( 1 a ) x , x ) + 2 φ e ( ( 1 + a ) x , x ) + φ e ( ( 1 + 2 a ) x , x ) + φ e ( ( 1 2 a ) x , x ) + φ e ( x , 3 x ) + 2 a 2 φ e ( 2 x , x ) + ( 4 a 2 3 ) φ e ( x , x ) + a 2 φ e ( 2 x , 2 x ) + 2 a 2 φ e ( x , 2 x ) ) , ψ ( x ) = 6 a 4 a 2 ( 2 φ e ( a x , x ) + 2 a 2 φ e ( x , x ) + 2 ( a 2 1 ) φ e ( 0 , x ) + φ e ( 0 , 2 x ) + 12 φ e ( 0 , 0 ) ) ( f o r m = 3 ) , ρ ( x ) = φ e ( x , x ) + 5 φ e ( 2 x , x ) , ψ ( x ) = φ e ( x , x ) + 5 φ e ( 2 x , x ) ( f o r m = 4 )
for all x V .
Using Example 2, we have Hyers–Ulam–Rassias stability of the functional equations D m f = 0 .
Example 3.
Let θ 0 and let p be a positive real number with p { 1 , 2 , 3 , 4 } . Let f : X Y be a mapping satisfying f ( 0 ) = 0 and
D m f ( x , y ) θ x p + y p
for all x , y . Then, there exists a unique mapping F : X Y such that D m F ( x , y ) = 0 for all x , y and
f ( x ) F ( x ) α m 6 ( 2 2 p ) + β m 12 ( 4 2 p ) θ x p ( f o r 0 < p < 1 ) , f ( x ) F ( x ) α m 6 ( 2 p 2 ) + β m 12 ( 4 2 p ) + α m 6 ( 8 2 p ) θ x p ( f o r 1 < p < 2 ) , f ( x ) F ( x ) α m 6 ( 2 p 2 ) + β m 12 ( 2 p 4 ) + α m 6 ( 8 2 p ) + β m 12 ( 16 2 p ) θ x p ( f o r 2 < p < 3 ) , f ( x ) F ( x ) β m 12 ( 2 p 4 ) + 4 α m 3 · 2 p ( 2 p 8 ) + β m 12 ( 16 2 p ) θ x p ( f o r 3 < p < 4 ) , f ( x ) F ( x ) 4 α m 3 · 2 p ( 2 p 8 ) + 4 β m 3 · 2 p ( 2 p 16 ) θ x p ( f o r p > 4 )
for all x X , where
α 1 = 13 , β 1 = 13 , α 2 = 9 + 2 p , β 2 = 9 + 2 p , α 3 = 1 a 4 a 2 2 | a 1 | p + 2 | a + 1 | p + | 2 a 1 | p + | 2 a + 1 | p + 3 p + 6 a 2 2 p + 12 a 2 + 1 , β 3 = 6 a 4 a 2 2 a p + 6 a 2 + 2 p , α 4 = 7 + 5 · 2 p , β 4 = 7 + 5 · 2 p .
Example 4.
Let f : V Y be an arbitrary mapping, r a fixed positive rational number with r 1 , and F : V Y a generalized polynomial mapping of degree n with f ( 0 ) = F ( 0 ) . If there exists a function ϕ : V { 0 } [ 0 , ) that satisfies
f ( x ) F ( x ) i = 0 1 r i ϕ r i x < o r
f ( x ) F ( x ) i = 0 1 r ( + 1 ) i ϕ r i x + i = 0 r i ϕ 1 r i x < o r
f ( x ) F ( x ) i = 0 r n i ϕ 1 r i x <
for all x V { 0 } and for some { 1 , 2 , , n 1 } , then F is a uniquely determined generalized polynomial mapping of degree n.
Proof. 
Let f ˜ , F : V Y be the mappings defined by f ˜ ( x ) = f ( x ) f ( 0 ) and F ( x ) = F ( x ) F ( 0 ) . Then, f ( x ) F ( x ) = f ˜ ( x ) F ( x ) and we can apply Corollary 6 to f ˜ and F . So, we can obtain unique F that satisfies either (17), (18), or (19). It means that we can have unique F that satisfies either (25), (26), or (27). □

5. Conclusions

Considering Hyers–Ulam stability of functional equations, it is generally difficult to prove the uniqueness of the stability function with conditions similar to Gǎvruţa condition. The uniqueness theorems of this paper obtained through direct calculation can be applied to various functional equations. As an application of Theorem 5 and Corollary 6, we considered Examples 2 and 3 to obtain generalized stability of the functional equation D m f = 0 , and here, we have the uniqueness of the stability mapping F.
For future research, we can apply Theorem 5 and Corollary 6 to the functional equations in [13,14,15,16,17,19,20,21,22,23] obtained Hyers–Ulam–Rassias stability and we can obtain the uniqueness of the stability mapping F with conditions similar to Gǎvruţa condition.

Author Contributions

Conceptualization, Y.-H.L.; methodology, S.-M.J., Y.-H.L. and J.R.; validation, S.-M.J., Y.-H.L. and J.R.; formal analysis, S.-M.J., Y.-H.L. and J.R.; writing—original draft preparation, S.-M.J., Y.-H.L. and J.R.; writing—review and editing, S.-M.J., Y.-H.L. and J.R.; supervision, J.R.; funding acquisition, J.R. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2021R1A2C109489611).

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Baker, J. A general functional equation and its stability. Proc. Am. Math. Soc. 2005, 133, 1657–1664. [Google Scholar] [CrossRef]
  2. Ulam, S.M. Problems in Modern Mathematics (Science Edition); John Wiley and Sons, Inc.: New York, NY, USA, 1964. [Google Scholar]
  3. Hyers, D.H. On the stability of the linear functional equation. Proc. Natl. Acad. Sci. USA 1941, 27, 222–224. [Google Scholar] [CrossRef] [PubMed]
  4. Aoki, T. On the stability of the linear transformation in Banach spaces. J. Math. Soc. Jpn. 1950, 2, 64–66. [Google Scholar] [CrossRef]
  5. Rassias, T.M. On the stability of the linear mappings in Banach Spaces. Proc. Am. Math. Soc. 1978, 72, 297–300. [Google Scholar] [CrossRef]
  6. Gǎvruţa, P. A generalization of the Hyers-Ulam-Rassias stability of approximately additive mappings. J. Math. Anal. Appl. 1994, 184, 431–436. [Google Scholar] [CrossRef]
  7. Cădariu, L.; Radu, V. The fixed points method for the stability of some functional equations. Carpathian J. Math. 2007, 23, 63–72. [Google Scholar]
  8. Gilányi, A. On Hyers-Ulam stability of monomial functional equations. In Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg; Springer: Berlin/Heidelberg, Germany, 1998; Volume 68, pp. 321–328. [Google Scholar]
  9. Gilányi, A. Hyers-Ulam stability of monomial functional equations on a general domain. Proc. Natl. Acad. Sci. USA 1999, 96, 10588–10590. [Google Scholar] [CrossRef]
  10. Hyers, D.H. Transformations with bounded m-th differences. Pac. J. Math. 1961, 11, 591–602. [Google Scholar] [CrossRef]
  11. Lee, Y.-H. On the stability of the monomial functional equation. Bull. Korean Math. Soc. 2008, 45, 397–403. [Google Scholar] [CrossRef]
  12. Lee, Y.-H. Stability of a monomial functional equation on a restricted domain. Mathematics 2017, 5, 53. [Google Scholar] [CrossRef]
  13. Chang, I.-S.; Lee, Y.-H.; Roh, J. Nearly general septic functional equation. J. Funct. Spaces 2021, 5643145. [Google Scholar] [CrossRef]
  14. Chang, I.-S.; Lee, Y.-H.; Roh, J. On the stability of the general sextic functional equation. J. Chungcheong Math. Soc. 2021, 34, 295–306. [Google Scholar]
  15. Chang, I.-S.; Lee, Y.-H.; Roh, J. Representation and stability of general nonic functional equation. Mathematics 2023, 11, 3173. [Google Scholar] [CrossRef]
  16. Jin, S.S.; Lee, Y.-H. Stability of the general quintic functional equation. Int. J. Math. Anal. 2021, 15, 271–282. [Google Scholar] [CrossRef]
  17. Jin, S.S.; Lee, Y.-H. Hyers-Ulam-Rassias stability of a general septic functional equation. J. Adv. Math. Comput. Sci. 2022, 37, 12–28. [Google Scholar] [CrossRef]
  18. Jin, S.S.; Lee, Y.-H. Hyperstability of a general quintic functional equation and a general septic functional equation. J. Chungcheong Math. Soc. 2023, 36, 107–123. [Google Scholar]
  19. Jin, S.S.; Lee, Y.-H. Hyers-Ulam-Rassias stability of a general decic functional equation. Honam Math. J. 2024, 46, 146–167. [Google Scholar]
  20. Lee, Y.-H.; Jung, S.-M. A fixed point approach to the stability of a general quartic functional equation. J. Math. Comput. Sci. 2020, 20, 207–215. [Google Scholar] [CrossRef]
  21. Lee, Y.-H.; Jung, S.-M. A fixed point approach to the stability of a general quintic functional equation. Nonlinear Funct. Anal. Appl. 2023, 28, 671–684. [Google Scholar] [CrossRef]
  22. Lee, Y.-H.; Roh, J. Some remarks concerning the general octic functional equation. J. Math. 2023, 2930056. [Google Scholar] [CrossRef]
  23. Roh, J.; Lee, Y.-H.; Jung, S.-M. The stability of a general sextic functional equation by fixed point theory. J. Funct. Spaces 2020, 2020, 6497408. [Google Scholar] [CrossRef]
  24. Lee, Y.-H.; Jung, S.-M. A general uniqueness theorem concerning the stability of AQCQ type functional equations. Kyungpook Math. J. 2018, 58, 291–305. [Google Scholar]
  25. Lee, Y.-H.; Jung, S.-M.; Rassias, M.T. Uniqueness theorems on functional inequalities concerning cubic-quadratic-additive equation. J. Math. Inequalities 2018, 12, 43–61. [Google Scholar] [CrossRef]
  26. Eshaghi-Gordji, M.; Kaboli-Gharetapeh, S.; Moslehian, M.S.; Zolfaghari, S. Stability of a mixed type additive, quadratic, cubic and quartic functional equation. In Nonlinear Analysis and Variational Problems: In Honor of George Isac; Springer: New York, NY, USA, 2009; pp. 65–80. [Google Scholar]
  27. Lee, J.R.; Kim, J.H.; Park, C. A fixed point approach to the stability of an additive-quadratic-cubic-quartic functional equation. Fixed Point Theory Appl. 2010, 2010, 185780. [Google Scholar] [CrossRef]
  28. Ravi, K.; Rassias, J.M.; Arunkumar, M.; Kodandan, R. Stability of a generalized mixed type additive, quadratic, cubic and quartic functional equation. J. Inequalities Pure Appl. Math. 2009, 10, 1–29. [Google Scholar]
  29. Djoković, D.Z. A representation theorem for (X1 − 1)(X2 − 1)⋯(Xn − 1) and its applications. Ann. Pol. Math. 1969, 22, 189–198. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Jung, S.-M.; Lee, Y.-H.; Roh, J. A Uniqueness Theorem for Stability Problems of Functional Equations. Symmetry 2024, 16, 1298. https://doi.org/10.3390/sym16101298

AMA Style

Jung S-M, Lee Y-H, Roh J. A Uniqueness Theorem for Stability Problems of Functional Equations. Symmetry. 2024; 16(10):1298. https://doi.org/10.3390/sym16101298

Chicago/Turabian Style

Jung, Soon-Mo, Yang-Hi Lee, and Jaiok Roh. 2024. "A Uniqueness Theorem for Stability Problems of Functional Equations" Symmetry 16, no. 10: 1298. https://doi.org/10.3390/sym16101298

APA Style

Jung, S. -M., Lee, Y. -H., & Roh, J. (2024). A Uniqueness Theorem for Stability Problems of Functional Equations. Symmetry, 16(10), 1298. https://doi.org/10.3390/sym16101298

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop