Next Article in Journal
Enhanced Remora Optimization Algorithm for Solving Constrained Engineering Optimization Problems
Previous Article in Journal
Optimum Post-Warranty Maintenance Policies for Products with Random Working Cycles
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Banach Limit and Ulam Stability of Nonhomogeneous Cauchy Equation

by
El-sayed El-hady
1,2,* and
Janusz Brzdęk
3
1
Mathematics Department, College of Science, Jouf University, Sakaka P.O. Box 2014, Saudi Arabia
2
Basic Science Department, Faculty of Computers and Informatics, Suez Canal University, Ismailia 41522, Egypt
3
Faculty of Applied Mathematics, AGH University of Science and Technology, Mickiewicza 30, 30-059 Kraków, Poland
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(10), 1695; https://doi.org/10.3390/math10101695
Submission received: 20 April 2022 / Revised: 10 May 2022 / Accepted: 11 May 2022 / Published: 15 May 2022

Abstract

:
We prove new results on Ulam stability of the nonhomogeneous Cauchy functional equation f ( x + y ) = f ( x ) + f ( y ) + d ( x , y ) in the class of mappings f from a square symmetric groupoid ( H , + ) into the set of reals R . The mapping d : H 2 R is assumed to be given and satisfy some weak natural assumption. The equation arises naturally, e.g., in the theory of information in a description of generating functions of branching measures of information. Moreover, we provide a suitable example of application of our results in this area at the very end of this paper. The main tool used in the proofs is the Banach limit.

1. Introduction

The problem of Ulam stability for equations (also known as Hyers–Ulam or Ulam–Hyers stability) can be roughly expressed as follows: how much a mapping satisfying an equation approximately (in a given sense) differs from a solution to the equation. This issue has become a very popular subject of research, and we refer to [1,2,3,4,5] for information on the historical background and the methods applied. The next theorem includes one of the most classical results concerning the Ulam stability of the additive Cauchy functional equation
ϕ ( s + t ) = ϕ ( s ) + ϕ ( t ) , s , t E , s + t E .
Theorem 1.
Let X 1 and X 2 be real normed spaces, X 0 : = X 1 \ { 0 } , c 0 , p R , p 1 , and h : X 1 X 2 be such that
h ( s + t ) h ( s ) h ( t ) c ( s p + t p ) , s , t X 0 .
Then the following two statements are valid.
(i)
If X 2 is complete, then there is a unique mapping g : X 1 X 2 such that
g ( s + t ) = g ( s ) + g ( t ) , s , t X 1 ,
and
h ( s ) g ( s ) c | 1 2 p 1 | s p , s X 0 .
(ii)
If p < 0 , then h is additive, i.e., it is a solution to Equation (78).
This result for p = 0 was first proved by D.H. Hyers [6] as an answer to a question asked by S.M. Ulam in 1940. Next, an extension of it, for p [ 0 , 1 ) , was obtained by T. Aoki [7]. A somewhat similar result (as that of Aoki), but for linear mappings was obtained (independently) nearly thirty years later by Th.M. Rassias [8], who also noticed that a similar reasoning works for p < 0 . Z. Gajda [9] proved an analogous result for p > 1 and provided an example that for p = 1 a similar outcome is not possible. The statement (ii) has been proved first in [10] and next on restricted domain in [11].
In 1994, P. Găvruta [12] replaced (1) by a more general inequality
h ( s + t ) h ( s ) h ( t ) ψ ( s , t ) , s , t X 1 ,
and obtained the following theorem.
Theorem 2.
Assume that ( X 1 , + ) is an abelian group, X 2 is a Banach space and ψ : X 1 2 [ 0 , ) fulfills
ψ ˜ ( s , t ) : = 1 2 n = 0 2 n ψ ( 2 n s , 2 n t ) < , s , t X 1 .
If h : X 1 X 2 satisfies (4), then there is a unique additive g : X 1 X 2 with h ( s ) g ( s ) ψ ˜ ( s , s ) for every s X 1 .
In ([13], Theorem 1.2) it has been proved that the above mentioned results can also be extended to the Cauchy nonhomogeneous functional equation.
g ( s + t ) = g ( s ) + g ( t ) + d ( s , t ) , s , t X 1 ,
with a given function d : X 1 2 X 2 . Namely, we have for instance the following generalization of Theorem 1.
Theorem 3.
Let X 1 and X 2 be real normed spaces, X 0 : = X 1 \ { 0 } , d : X 1 2 X 2 be such that Equation (5) has at least one solution g : X 1 X 2 , c 0 , p R , p 1 , and h : X 1 X 2 be a mapping with
h ( s + t ) h ( s ) h ( t ) d ( x , y ) c ( s p + t p ) , s , t X 0 .
Then the following two statements are valid.
(i)
If X 2 is complete, then there is a unique solution g : X 1 X 2 of (5) such that
g ( s ) h ( s ) c | 1 2 p 1 | s p , s X 0 .
(ii)
If p < 0 , then h is a solution to Equation (5).
For p = 1 an analogous result is not possible (in the sense depicted in ([13], Theorem 1.2 (c))). Moreover, estimation (7) is optimum when X 2 = R (see ([13], Theorem 1.2 (b))).
Let us mention here that Equation (5) has also been called the Cauchy inhomogeneous functional equation in [13,14]. It is connected with the notion of cocycles (see, e.g., [15,16]) and arises in a natural way, e.g., in the theory of information (see [17]). For further information on its solutions we refer to [18,19,20,21].
In [22] (Theorem 8 and Remark 7) it has been proved that in the case X 2 = R , the following finer results are possible for Equation (78).
Theorem 4.
Let E 1 be a normed space, E 0 : = E 1 \ { 0 } , χ , ρ , p R , p 1 , χ ρ and h : E 1 R be a mapping with
χ ( x p + y p ) h ( x + y ) h ( x ) h ( y ) ρ ( x p + y p ) , x , y E 0 .
Then the following two statements are valid.
(i)
If p 0 , then there is a unique additive mapping T : E 1 R such that, in the case p < 1 ,
χ 1 2 p 1 x p T ( x ) h ( x ) ρ 1 2 p 1 x p , x E 0 ,
and, in the case p > 1 ,
χ 2 p 1 1 x p h ( x ) T ( x ) ρ 2 p 1 1 x p , x E 0 .
(ii)
If p < 0 , then h is additive (in view of (8) it is possible only when χ 0 ρ ).
In this paper we show that an analog of Theorem 4 is also possible for Equation (5). First, we prove extensions (to Equation (5)) of two general results from ([22], Theorems 6 and 7), somewhat corresponding to Theorem 2.
For the convenience of readers, we recall below ([22], Theorem 6) (([22], Theorem 7) is analogous and complementary to it). To this end we need to remind the notion of a square symmetric groupoid.
So, let X be a nonempty set and : X 2 X be a binary operation. We say that the operation is square symmetric if
s 2 t 2 = ( s t ) 2 , s , t X ,
where s 2 : = s s . If ⋆ is square symmetric, then we say that the groupoid ( X , ) is square symmetric.
In what follows, for the simplicity of notation, it is convenient to denote a square symmetric operation in a groupoid by the symbol + (without assuming its commutativity) and then (11) can be written as
2 s + 2 t = 2 ( s + t ) , s , t X ,
where 2 s : = s + s . Next, we write 2 0 s : = s and 2 n + 1 s : = 2 ( 2 n s + 2 n s ) for s X and n N ( N stands for the set of positive integers). Further information on square symmetric operations is given in the next section.
Let us mention that the notion of Banach limit LIM (used in the next theorem) is defined in Section 3. Now, we are in a position to present in ([22], Theorem 6).
Theorem 5.
Let ( H , + ) be a square symmetric groupoid, E H be nonempty, 2 E : = { 2 s : s E } E , Γ , Δ : E 2 R be such that
lim inf n Δ ( 2 n s , 2 n t ) 2 n = 0 , lim sup n Γ ( 2 n s , 2 n t ) 2 n = 0 , s , t E ,
and the sequences ( Γ n ( s ) ) n N and ( Δ n ( s ) ) n N be bounded for every s E , where
Γ n ( s ) = j = 0 n 1 Γ ( 2 j s , 2 j s ) 2 j + 1 , Δ n ( s ) = j = 0 n 1 Δ ( 2 j s , 2 j s ) 2 j + 1 , n N , s E .
Let ψ : E R satisfy
Δ ( s , t ) ψ ( s + t ) ψ ( s ) ψ ( t ) Γ ( s , t ) , s , t E , s + t E ,
and
a n ( s ) : = ψ ( 2 n s ) 2 n , n N , s E .
Then the sequence a n ( s ) n N is bounded for every s E and the function Ψ : E R , given by
Ψ ( s ) : = LIM a n ( s ) n N , s E ,
is a solution of the conditional Cauchy functional equation
Ψ ( s + t ) = Ψ ( s ) + Ψ ( t ) , s , t E , s + t E ,
and
β ( s ) : = lim inf k Δ k ( s ) Ψ ( s ) ψ ( s ) lim sup k Γ k ( s ) = : α ( s ) , s E .
Moreover, if
inf n N α ( 2 n s ) β ( 2 n s ) 2 n = 0 , s E ,
then Ψ : E R is the unique solution to (18) that satisfies (19).
Finally, let us add that a result, more general than Theorem 2, was obtained much earlier in [23]. Various further related outcomes can be found in [2,4,5,24,25,26]. For some useful information on solutions to functional equations we refer to monographs [27,28].

2. Square Symmetric Operations

Let ( X , ) be a square symmetric groupoid. By induction it is very easy to show that
2 n s + 2 n t = 2 n ( s + t ) , s , t X , n N 0 : = N { 0 } .
Remark 1.
Obviously, every commutative semigroup is a square symmetric groupoid. Next, let W be a linear space over a field K and fix c , d K , e W . Write x y = c x + d y + e for x , y W . Then it is easy to verify that ( W , ) is a simple example of square symmetric groupoid, which in general (depending on c and d) is neither commutative nor associative.
Finally, let us mention that a groupoid ( G , + ) is uniquely divisible by 2 if for each y G there is a unique x G such that x + x = y ; we denote such x by 2 1 y and recurrently we define 2 n 1 y : = 2 1 ( 2 n y ) for every n N . Clearly, the square symmetric groupoid depicted in Remark 1 is uniquely divisible by 2 if and only if c + d 0 .
If a square symmetric groupoid ( X , + ) is uniquely divisible by 2, then it is easy to show by induction that
2 n s + 2 n t = 2 n ( s + t ) , s , t X , n N .
For some further information on square symmetric operations we refer to [29].

3. Banach Limit

The Banach limit is a very important tool in the proofs of our main results. This notion was motivated by the efforts of mathematicians to extend the notion of the limit to a family larger than that of convergent sequences. Early information on it can be found in [30] (p. 103) with the proof published in Banach’s monograph [31]. For more recent results concerning it we refer to [32,33] (see also [34,35,36]).
So, let denote the space of all bounded real sequences (with the supremum norm) and c mean the space of all convergent real sequences. There exists a real linear functional on , called the Banach limit and usually denoted by LIM , which satisfies the following conditions:
inf { b n : n N } LIM ( b n ) n N sup { b n : n N }
LIM ( b n + k ) n N = LIM ( b n ) n N ,
for all ( b n ) n N and k N . Clearly, from (23) and (24) we get
lim inf n b n LIM ( b n ) n N lim sup n b n , ( b n ) n N ,
whence
LIM ( ( b n ) n N ) = lim n b n , ( b n ) n N c .
This functional is not unique (because in the proof of its existence the Hahn–Banach theorem is applied), which means that the Banach limit of a sequence is not defined unequivocally for all bounded real sequences; however, (26) holds and there exist other (non-convergent) sequences for which the Banach limit is uniquely determined. Such sequences are called almost convergent and an example is b n = ( 1 ) n for n N .

4. Auxiliary Results

In this section X stands for a nonempty set. Next, given f : X X , by f n (for n N 0 ) we denote the nth iterate of f, i.e., f 0 = i d (the identity mapping) and f n + 1 = f f n (mapping composition).
The following result from ([22], Theorem 3) will be very useful in the sequel.
Theorem 6.
Let τ : X X , β , χ , κ , μ : X R be such that β ( X ) ( 0 , ) and the sequences κ ^ n ( s ) n N and μ ^ n ( s ) n N are bounded for every s X , where
κ ^ n ( s ) : = j = 0 n 1 κ ( τ j ( s ) ) i = 0 j β ( τ i ( s ) ) , μ ^ n ( s ) : = j = 0 n 1 μ ( τ j ( s ) ) i = 0 j β ( τ i ( s ) ) , s X , n N .
Assume that ϕ : X R satisfies the inequalities
κ ( s ) ϕ ( τ ( s ) ) β ( s ) ϕ ( s ) χ ( s ) μ ( s ) , s X ,
and
b n ( s ) = ϕ ( τ n ( s ) ) i = 0 n 1 β ( τ i ( s ) ) k = 0 n 1 χ ( τ k ( s ) ) j = 0 k β ( τ j ( s ) ) , s X , n N .
Then the sequence ( b n ( s ) ) n N is bounded for each s X , the mapping Φ : X R , given by the formula
Φ ( s ) = LIM b n n N , s X ,
satisfies the equation
Φ ( τ ( s ) ) = β ( s ) Φ ( s ) + χ ( s ) , s X ,
and
κ ^ ( s ) : = lim inf k κ ^ k ( s ) Φ ( s ) ϕ ( s ) lim sup k μ ^ k ( s ) = : μ ^ ( s ) , s X .
Further, if
inf n N μ ^ ( τ n ( s ) ) κ ^ ( τ n ( s ) ) i = 0 n 1 β ( τ i ( s ) ) = 0 , s X ,
then such mapping Φ is unique.
For information on various similar results on Ulam stability of related functional equations in single variable we refer to [26,37,38,39].

5. The Main Results

In this section ( H , + ) denotes a square symmetric groupoid. Moreover, we always assume that d : H 2 R is a solution of the functional equation:
d ( s + t , s + t ) d ( s , s ) d ( t , t ) = d ( 2 s , 2 t ) 2 d ( s , t ) , s , t H .
The beginning of the next remark shows that this is not a very demanding assumption on d.
Remark 2.
It seems that it only makes sense to study Ulam stability of equations that have solutions. So, assume that the equation
ρ ( s + t ) = ρ ( s ) + ρ ( t ) + d ( s , t ) , s , t H ,
has at least one solution ρ : H R . Then
d ( s , t ) = ρ ( s + t ) ρ ( s ) ρ ( t ) , s , t H .
Next, it is easy to verify that every mapping d : H 2 R that has form (35), with some ρ : H R , is a solution to Equation (33).
In particular, note that if d is symmetric and biadditive (i.e., d ( s , t ) = d ( t , s ) and d ( s , t + u ) = d ( s , t ) + d ( s , u ) for s , t , u H ), then (35) holds with ρ ( s ) = 1 2 d ( s , s ) for s H , which means that (33) is fulfilled for every symmetric and biadditive mapping d : H 2 R .
There also exist other solutions of (35). For, if g 1 , g 2 : H R are additive, then it is easy to check that the function d : H 2 R , given by
d ( s , t ) = g 1 ( s ) + g 2 ( t ) , s , t H ,
satisfies (33). We show that if g 1 ( s ) 0 or g 2 ( s ) 0 for some s H , then the function d given by (36) is not the of form (35).
So, suppose that (35) and (36) hold with some ρ : H Y and some additive g 1 , g 2 : H R . Then
ρ ( s + t ) ρ ( s ) ρ ( t ) = g 1 ( s ) + g 2 ( t ) , s , t H ,
and consequently (with s = 0 ) we obtain ρ ( 0 ) = g 2 ( t ) for every t H and (with t = 0 ) ρ ( 0 ) = g 1 ( s ) for every s H . As ρ ( 0 ) = g 1 ( 2 s ) = 2 g 1 ( s ) = 2 ρ ( 0 ) for every s H , we have ρ ( 0 ) = 0 and consequently g 1 ( s ) = g 2 ( s ) = 0 for every s H (which means that d ( s , t ) = 0 for every s , t H ).
At the end of this paper (Corollary 1) we also show that in the case where d is not of form (35) we can obtain some interesting results on the existence of approximate solutions to Equation (5).
The next theorem shows that Theorem 5 (i.e., ([22], Theorem 6)) can be extended to the case of Equation (5).
Theorem 7.
Let E H be nonempty, 2 E : = { 2 s : s E } E , Γ , Δ : E 2 R be such that
lim inf n Δ ( 2 n s , 2 n t ) 2 n = 0 , lim sup n Γ ( 2 n s , 2 n t ) 2 n = 0 , s , t E ,
and the sequences ( Γ n ( s ) ) n N and ( Δ n ( s ) ) n N be bounded for every s E , where
Γ n ( s ) = j = 0 n 1 Γ ( 2 j s , 2 j s ) 2 j + 1 , Δ n ( s ) = j = 0 n 1 Δ ( 2 j s , 2 j s ) 2 j + 1 , n N , s E .
Let ϕ : E R satisfy
Δ ( s , t ) ϕ ( s + t ) ϕ ( s ) ϕ ( t ) d ( s , t ) Γ ( s , t ) , s , t E , s + t E ,
and
b n ( s ) : = ϕ ( 2 n s ) 2 n k = 0 n 1 d ( 2 k s , 2 k s ) 2 k + 1 , n N , s E .
Then the sequence b n ( s ) n N is bounded for every s E , the mapping Φ : E R , given by
Φ ( s ) : = LIM b n ( s ) n N , s E ,
is a solution of the conditional nonhomogeneous Cauchy functional equation
Φ ( s + t ) = Φ ( s ) + Φ ( t ) + d ( s , t ) , s , t E , s + t E ,
and
δ ( s ) : = lim inf k Δ k ( s ) Φ ( s ) ϕ ( s ) lim sup k Γ k ( s ) = : γ ( s ) , s E .
Moreover, if
inf n N γ ( 2 n s ) δ ( 2 n s ) 2 n = 0 , s E ,
then Φ : E R is the unique solution to (42) such that (43) is valid.
Proof. 
From (33) we obtain
d ( s + t , s + t ) d ( s , s ) d ( t , t ) 2 = 1 2 d ( 2 s , 2 t ) d ( s , t ) , s , t H ,
whence replacing s and t by 2 k s and 2 k t (with k N ), by (21) we obtain
d ( 2 k ( s + t ) , 2 k ( s + t ) ) d ( 2 k s , 2 k s ) d ( 2 k t , 2 k t ) 2 k + 1 = 1 2 k + 1 d ( 2 k + 1 s , 2 k + 1 t ) 1 2 k d ( 2 k s , 2 k t ) , s , t H , k N 0 .
Consequently
k = 0 n 1 d ( 2 k ( s + t ) , 2 k ( s + t ) ) d ( 2 k s , 2 k s ) d ( 2 k t , 2 k t ) 2 k + 1 = k = 0 n 1 1 2 k + 1 d ( 2 k + 1 s , 2 k + 1 t ) 1 2 k d ( 2 k s , 2 k t ) = 1 2 n d ( 2 n s , 2 n t ) d ( s , t ) , s , t H , n N .
Next, replacing in (39) s and t by 2 k s and 2 k t (with k N ) we obtain the inequality
Δ ( 2 k s , 2 k t ) 2 k ϕ ( 2 k ( s + t ) ) 2 k ϕ ( 2 k s ) + ϕ ( 2 k t ) 2 k d ( 2 k s , 2 k t ) 2 k Γ ( 2 k s , 2 k t ) 2 k , s , t E , s + t E , k N 0 ,
which can be rewritten as
Δ ( 2 k s , 2 k t ) 2 k a k ( s + t ) a k ( s ) a k ( t ) d ( 2 k s , 2 k t ) 2 k Γ ( 2 k s , 2 k t ) 2 k , s , t E , s + t E , k N 0 ,
where a k is defined by
a k ( s ) : = ϕ ( 2 k s ) 2 k , k N 0 , s E .
Note that (39) (with s = t ) yields
Δ ( s , s ) ϕ ( 2 s ) 2 ϕ ( s ) d ( s , s ) Γ ( s , s ) , s E .
So, from Theorem 6 with X = E , κ ( s ) = Δ ( s , s ) , μ ( s ) = Γ ( s , s ) , τ ( s ) 2 s , β ( s ) 2 and χ ( s ) d ( s , s ) , we obtain that the sequence b n ( s ) n N defined by (40) is bounded for every s E and the mapping Φ : E R , given by (41), fulfills inequalities (43).
Further, for every s , t E with s + t E ,
Φ ( s + t ) Φ ( t ) Φ ( s ) d ( s , t ) = LIM b n ( s + t ) b n ( t ) b n ( s ) n N d ( s , t ) = LIM b n ( s + t ) b n ( t ) b n ( s ) d ( s , t ) n N
and according to (21), (40) and (47) we have
b n ( s + t ) b n ( t ) b n ( s ) d ( s , t ) = ϕ ( 2 n ( s + t ) ) 2 n ϕ ( 2 n t ) 2 n ϕ ( 2 n s ) 2 n d ( s , t ) k = 0 n 1 d ( 2 k ( s + t ) , 2 k ( s + t ) ) d ( 2 k s , 2 k s ) d ( 2 k t , 2 k t ) 2 k + 1 = a n ( s + t ) a n ( s ) a n ( t ) d ( 2 n s , 2 n t ) 2 n , n N ,
whence, by (49),
Δ ( 2 n s , 2 n t ) 2 n b n ( s + t ) b n ( t ) b n ( s ) d ( s , t ) Γ ( 2 n s , 2 n t ) 2 n , n N .
So, in view of (25),
lim inf n Δ ( 2 n s , 2 n t ) 2 n Φ ( s + t ) Φ ( t ) Φ ( s ) d ( s , t ) lim sup n Γ ( 2 n s , 2 n t ) 2 n , s , t E , s + t E ,
and consequently from (37) we derive that
Φ ( s + t ) Φ ( t ) Φ ( s ) d ( s , t ) = 0 , s , t E , s + t E .
Finally we show the uniqueness of Φ . So, suppose that Φ 1 , Φ 2 : E R are such that
Φ i ( s + t ) = Φ i ( s ) + Φ i ( t ) d ( s , t ) , s , t E , s + t E , i = 1 , 2 ,
and
δ ( s ) Φ i ( s ) ϕ ( s ) γ ( s ) , s E , i = 1 , 2 .
Clearly
δ ( s ) γ ( s ) Φ 1 ( s ) Φ 2 ( s ) γ ( s ) δ ( s ) , s E ,
whence
| Φ 1 ( s ) Φ 2 ( s ) | γ ( s ) δ ( s ) , s E .
Further, (57) yields
Φ 1 ( 2 n s ) Φ 2 ( 2 n s ) = 2 n ( Φ 1 ( s ) Φ 2 ( s ) ) , s E , n N .
Hence, replacing s by 2 n s in (60), we obtain
| Φ 1 ( s ) Φ 2 ( s ) | γ ( 2 n s ) δ ( 2 n s ) 2 n , s E , n N ,
which (on account of (44)) implies that Φ 1 = Φ 2 . This ends the proof. □
Arguing analogously as above we obtain the following complementary version of Theorem 7, i.e., an extension of ([22], Theorem 7) to the case of Equation (5).
Theorem 8.
Let ( H , + ) be uniquely divisible by 2, E H be nonempty, 2 1 E : = { 2 1 s : s E } E , Γ , Δ : E 2 R be such that
lim inf n 2 n Δ ( 2 n s , 2 n t ) = 0 , lim sup n 2 n Γ ( 2 n s , 2 n t ) = 0 , s , t E ,
and the sequences ( Γ n ( s ) ) n N and ( Δ n ( s ) ) n N be bounded for every s E , where
Γ n ( s ) = j = 0 n 1 2 j Γ ( 2 j 1 s , 2 j 1 s ) , Δ n ( s ) = j = 0 n 1 2 j Δ ( 2 j 1 s , 2 j 1 s ) , n N , s E .
Let ϕ : E R satisfy (39) and
b n ( s ) : = 2 n ϕ ( 2 n s ) + k = 0 n 1 2 k d ( 2 k 1 s , 2 k 1 s ) , n N , s E .
Then the sequence b n ( s ) n N is bounded for every s E and the function Φ : E R , given by (41), is a solution of Equation (42) and satisfies the inequalities
δ ( s ) : = lim inf k Δ k ( s ) ϕ ( s ) Φ ( s ) lim sup k Γ k ( s ) = : γ ( s ) , s E .
Moreover, if (44) holds or
inf n N 2 n γ ( 2 n s ) δ ( 2 n s ) = 0 , s E ,
then Φ : E R is the unique solution to (42) such that (66) is valid.
Proof. 
The reasoning is analogous as in the proof of Theorem 7, but for the convenience of readers we provide it.
Replacing s and t by 2 k 1 s and 2 k 1 t (with k N 0 ) in (33), on account of (22) we easily obtain
2 k ( d ( 2 k 1 ( s + t ) , 2 k 1 ( s + t ) ) d ( 2 k 1 s , 2 k 1 s ) d ( 2 k 1 t , 2 k 1 t ) ) = 2 k d ( 2 k s , 2 k t ) 2 k + 1 d ( 2 k 1 s , 2 k 1 t ) , s , t H , s + t H , k N 0 ,
whence
k = 0 n 1 2 k d ( 2 k 1 ( s + t ) , 2 k 1 ( s + t ) ) d ( 2 k 1 s , 2 k 1 s ) d ( 2 k 1 t , 2 k 1 t ) = k = 0 n 1 2 k d ( 2 k s , 2 k t ) 2 k + 1 d ( 2 k 1 s , 2 k 1 t ) = d ( s , t ) 2 n d ( 2 n s , 2 n t ) ) , s , t H , s + t H , n N 0 .
Next, replacing in (39) s and t by 2 k s and 2 k t (with k N ) we obtain the inequality
2 k Δ ( 2 k s , 2 k t ) 2 k ϕ ( 2 k ( s + t ) ) 2 k ϕ ( 2 k s ) 2 k ϕ ( 2 k t ) 2 k d ( 2 k s , 2 k t ) 2 k Γ ( 2 k s , 2 k t ) , s , t E , s + t E , k N 0 ,
which can be rewritten as
2 k Δ ( 2 k s , 2 k t ) a k ( s + t ) a k ( s ) a k ( t ) 2 k d ( 2 k s , 2 k t ) 2 k Γ ( 2 k s , 2 k t ) , s , t E , s + t E , k N 0 ,
where a k is defined by
a k ( s ) : = 2 k ϕ ( 2 k s ) , k N 0 , s E .
Note yet that from (39), with s and t replaced by 2 1 s , for every s E we obtain
2 1 Δ 2 1 s , 2 1 s 2 1 ϕ ( s ) ϕ 2 1 s 2 1 d ( 2 1 s , 2 1 s ) 2 1 Γ 2 1 s , 2 1 s ,
which can be rewritten as
2 1 Γ 2 1 s , 2 1 s ϕ 2 1 s 2 1 ϕ ( s ) + 2 1 d ( 2 1 s , 2 1 s ) 2 1 Δ 2 1 s , 2 1 s .
Hence, according to Theorem 6 with X = E ,
κ ( s ) = 1 2 Γ ( 2 1 s , 2 1 s ) , μ ( s ) = 1 2 Δ ( 2 1 s , 2 1 s ) , s E ,
τ ( s ) = 2 1 s , β ( s ) 2 1 and χ ( s ) 2 1 d ( 2 1 s , 2 1 s ) , the sequence b n ( s ) n N defined by (65) is bounded for every s D and the function Φ : D R , given by (41), fulfills the inequalities
lim inf k ( Γ k ( s ) ) Φ ( s ) ϕ ( s ) lim sup k ( Δ k ( s ) ) , s E ,
which implies (66). Moreover, for every s , t E with s + t E ,
Φ ( s + t ) Φ ( t ) Φ ( s ) d ( s , t ) = LIM b n ( s + t ) b n ( t ) b n ( s ) d ( s , t ) n N .
Next, according to (65), for every n N and s , t E with s + t E
b n ( s + t ) b n ( s ) b n ( t ) d ( s , t ) = 2 n ϕ ( 2 n ( s + t ) ) 2 n ϕ ( 2 n s ) 2 n ϕ ( 2 n t ) d ( s , t ) + k = 0 n 1 2 k ( d ( 2 k 1 ( s + t ) , 2 k 1 ( s + t ) ) d ( 2 k 1 s , 2 k 1 s ) d ( 2 k 1 t , 2 k 1 t ) ) = a n ( s + t ) a n ( s ) a n ( t ) 2 n d ( 2 n s , 2 n t )
whence and by (70)
2 n Δ ( 2 n s , 2 n t ) b n ( s + t ) b n ( t ) b n ( s ) d ( s , t ) 2 n Γ ( 2 n s , 2 n t ) .
Hence, according to (25) and (73), we have
lim inf n 2 n Δ ( 2 n s , 2 n t ) Φ ( s + t ) Φ ( t ) Φ ( s ) lim sup n 2 n Γ ( 2 n s , 2 n t ) , s , t D , s + t D ,
and (63) now shows that (42) is valid.
We need yet to prove the uniqueness of Φ . So, suppose that Φ 1 , Φ 2 : D R satisfy
Φ i ( s + t ) = Φ i ( s ) + Φ i ( t ) d ( s , t ) , s , t E , s + t E , i = 1 , 2 ,
and
δ ( s ) ϕ ( s ) Φ i ( s ) γ ( s ) , s E , i = 1 , 2 .
Then (59) holds, whence we have
| Φ 1 ( s ) Φ 2 ( s ) | γ ( s ) δ ( s ) , s E .
Note also that (74) yields
Φ 1 ( s + t ) Φ 2 ( s + t ) = Φ 1 ( s ) Φ 2 ( s ) + Φ 1 ( t ) Φ 2 ( t ) , s E ,
which implies
Φ 1 ( 2 n s ) Φ 2 ( 2 n s ) = 2 n ( Φ 1 ( s ) Φ 2 ( s ) ) , s E , n N ,
Φ 1 ( 2 n s ) Φ 2 ( 2 n s ) = 2 n ( Φ 1 ( s ) Φ 2 ( s ) ) , s E , n N .
Hence, replacing s by 2 n s and next by 2 n s in (75), we obtain
| Φ 1 ( s ) Φ 2 ( s ) | γ ( 2 n s ) δ ( 2 n s ) 2 n , s E , n N ,
and
| Φ 1 ( s ) Φ 2 ( s ) | 2 n γ ( 2 n s ) δ ( 2 n s ) , s E , n N .
Consequently, it is easily seen that, if (44) or (67) is valid, we must have Φ 1 = Φ 2 .
This ends the proof. □
Theorems 7 and 8 yield the following generalization of Theorem 1.
Theorem 9.
Let E 1 be a real normed space, E E 1 \ { 0 } be nonempty, E = 2 E , χ , ν , p R , p 1 , χ ν and ϕ : E R be a mapping with
χ ( s p + t p ) ϕ ( s + t ) ϕ ( s ) ϕ ( t ) d ( s , t ) ν ( s p + t p ) , s , t E , s + t E .
Then there is a unique solution Φ : E R of Equation (42) such that, in the case p < 1 ,
χ 1 2 p 1 s p Φ ( s ) ϕ ( s ) ν 1 2 p 1 s p , s E ,
and, in the case p > 1 ,
χ 2 p 1 1 s p ϕ ( s ) Φ ( s ) ν 2 p 1 1 s p , s E .
Proof. 
If p < 1 , then by Theorem 7 (with H = E 1 , Δ ( s , t ) = χ ( s p + t p ) and Γ ( s , t ) = ν ( s p + t p ) for s , t E 0 ), there exists a unique solution Ψ : E R of Equation (42) satisfying inequalities (43). It is very easy to check that in this case (43) is exactly (77).
If p > 1 , then we use Theorem 8 in a similar way. □
Remark 3.
Let E 1 be a real normed space, E E 1 \ { 0 } be nonempty, χ , ν , p R , p 1 , χ ν , and d : E 2 R be such that d ( s , t ) [ ν ( s p + t p ) , χ ( s p + t p ) ] for s , t E . Let ϕ : E R be such that
ϕ ( s + t ) = ϕ ( s ) + ϕ ( t ) , s , t E , s + t E .
Then
χ ( s p + t p ) ϕ ( s + t ) ϕ ( t ) ϕ ( s ) d ( s + t ) = d ( s + t ) ν ( s p + t p ) , s , t D , s + t E .
This example shows that the families of mappings ϕ considered in Theorems 7–9 are very large.
Corollary 1.
Let E 1 be a real normed space, E E 1 \ { 0 } and E = 2 E . Assume that there exist s 0 , t 0 , u 0 E such that s 0 + t 0 , t 0 + u 0 , s 0 + t 0 + u 0 E and
d ( s 0 + t 0 , u 0 ) + d ( s 0 , t 0 ) d ( s 0 , t 0 + u 0 ) + d ( t 0 , u 0 ) .
Then for every χ , ν , p R , p 1 , there does not exist any mapping ϕ : E R with
χ ( s p + t p ) ϕ ( s + t ) ϕ ( s ) ϕ ( t ) d ( s , t ) ν ( s p + t p ) , s , t E , s + t E .
Proof. 
For the proof by contradiction suppose that there is ϕ : E 1 R such that (80) holds. Then by Theorem 9 there exists a solution Φ : E R of Equation (42), which means that
d ( s , t ) = Φ ( s + t ) Φ ( s ) Φ ( t ) , s , t E , s + t E ,
and consequently
d ( s 0 + t 0 , u 0 )   +   d ( s 0 , t 0 ) = Φ ( s 0 + t 0 + u 0 ) Φ ( s 0 + t 0 ) Φ ( u 0 ) + Φ ( s 0 + t 0 ) Φ ( s 0 ) Φ ( t 0 ) = Φ ( s 0 + t 0 + u 0 ) Φ ( s 0 ) Φ ( t 0 + u 0 ) + Φ ( t 0 + u 0 ) Φ ( t 0 ) Φ ( u 0 ) = d ( s 0 , t 0 + u 0 ) + d ( t 0 , u 0 ) .
Thus we obtain a contradiction to the assumption that (85) holds. □
Remark 4.
Equation (42) arises naturally in ([17], Theorem 2.2.4) in a description of generating functions of information measures (having certain branching property).
Namely, let k N and
I = ( 0 , 1 ) k : = { ( t 1 , , t k ) R k : 0 < t i < 1 f o r   i = 1 , , k } .
According to ([17], Lemma 2.2.1 and Remark 2.2.3), every such generating function G : I 2 R is symmetric (i.e., G ( s , t ) = G ( t , s ) for s , t I with s + t I ) and satisfies the cocycle equation
G ( s + t , u ) + G ( s , t ) = G ( s , t + u ) + G ( t , u ) , s , t , u E , s + t + u E ,
whence (see ([17], Theorem 2.2.4)) has the form
G ( s , t ) = g ( s + t ) g ( s ) g ( t ) , s , t I , s + t I ,
with some function g : I R . Clearly, this function g : I R is a solution of Equation (42) (with d = G and E = I ), i.e.,
g ( s + t ) = g ( s ) + g ( t ) + G ( s , t ) , s , t E , s + t E .
The next corollary shows that if two generating functions G 1 , G 2 : I 2 R are ‘close’, then they can be represented in the form
G i ( s , t ) = g i ( s + t ) g i ( s ) g i ( t ) , s , t I , s + t I , i = 1 , 2 ,
with functions g 1 , g 2 : I R that are ‘close’.
Corollary 2.
Let I be as in Remark 4 and G 1 , G 2 : I 2 R be such that
G i ( s + t , u ) + G i ( s , t ) = G i ( s , t + u ) + G i ( t , u ) , s , t , u E , s + t + u E , i = 1 , 2 ,
and
G i ( s , t ) = G i ( t , s ) , s , t I , s + t I , i = 1 , 2 .
Assume that g 1 : I R fulfills the condition
G 1 ( s , t ) = g 1 ( s + t ) g 1 ( s ) g 1 ( t ) , s , t I , s + t I ,
and there are χ , ν , p R , χ ν , p > 1 , with
χ ( s p + t p ) G 1 ( s , t ) G 2 ( s , t ) ν ( s p + t p ) , s , t I , s + t I .
Then there exists a unique g 2 : I R such that
G 2 ( s , t ) = g 2 ( s + t ) g 2 ( s ) g 2 ( t ) , s , t I , s + t I ,
χ 2 p 1 1 s p g 1 ( s ) g 2 ( s ) ν 2 p 1 1 s p , s I .
Proof. 
Note that, in view of (87), inequality (88) can be written as
χ ( s p + t p ) g 1 ( s + t ) g 1 ( s ) g 1 ( t ) G 2 ( s , t ) ν ( s p + t p ) , s , t I , s + t I .
Hence, (arguing analogously as in the proof of Theorem 9) from Theorem 8 with E = I , we obtain that there exists a unique g 2 : I R such that (89) and (90) are valid. □
The result contained in Corollary 3 also can be expressed in the following somewhat different way.
Corollary 3.
Let I be as in Remark 4 and G 1 , G 2 : I 2 R be such that (85) and (86) are valid. Assume that g 1 , g 2 : I R fulfill (84) and there are χ , ν , p R , χ ν , p > 1 , such that (88) holds.
Then there exists α : I R such that
α ( s + t ) = α ( s ) + α ( t ) , s , t I , s + t I ,
χ 2 p 1 1 s p g 1 ( s ) g 2 ( s ) α ( s ) ν 2 p 1 1 s p , s I .
Proof. 
As in the previous proof, in view of (87), inequality (88) implies (91). Hence, by Theorem 8 with E = I , (analogously as in the proof of Theorem 9) we obtain that there exists a unique g 0 : I R such that
G 2 ( s , t ) = g 0 ( s + t ) g 0 ( s ) g 0 ( t ) , s , t I , s + t I ,
χ 2 p 1 1 s p g 1 ( s ) g 0 ( s ) ν 2 p 1 1 s p , s I .
Note that (84) and (94) imply that the function α = g 0 g 2 satisfies (92). Now, it is enough to notice that (95) yields (93). □

6. Conclusions

We presented new Ulam stability results for the nonhomogeneous Cauchy functional equation f ( x + y ) = f ( x ) + f ( y ) + d ( x , y ) in the class of mappings f from a subset of a square symmetric groupoid ( H , + ) into the set of reals R . We employed the Banach limit as the main tool in our analysis. Moreover, we provided some interesting applications of our results. Potential future work could be to obtain analogous results for some other functional equations.

Author Contributions

Conceptualization, J.B. and E.-s.E.-h.; methodology, J.B. and E.-s.E.-h.; software, J.B. and E.-s.E.-h.; validation, J.B. and E.-s.E.-h.; formal analysis, J.B.; investigation, J.B.; data curation, J.B. and E.-s.E.-h.; writing—original draft preparation, J.B.; writing—review and editing, J.B. and E.-s.E.-h.; visualization, J.B.; supervision, J.B.; project administration, J.B. and E.-s.E.-h.; funding acquisition, E.-s.E.-h. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ulam, S.M. A Collection of Mathematical Problems; Interscience: New York, NY, USA, 1960. [Google Scholar]
  2. Hyers, D.H.; Isac, G.; Rassias, T.M. Stability of Functional Equations in Several Variables; Birkhäuser: Boston, MA, USA, 1998. [Google Scholar]
  3. Forti, G.L. Hyers-Ulam stability of functional equations in several variables. Aequationes Math. 1995, 50, 143–190. [Google Scholar] [CrossRef]
  4. Jung, S.-M. Hyers-Ulam-Rassias Stability of Functional Equations in Nonlinear Analysis; Springer: New York, NY, USA, 2011. [Google Scholar]
  5. Brzdęk, J.; Popa, D.; Raşa, I.; Xu, B. Ulam Stability of Operators; Academic Press: London, UK, 2018. [Google Scholar]
  6. Hyers, D.H. On the stability of the linear functional equation. Proc. Natl. Acad. Sci. USA 1941, 27, 222–224. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  7. Aoki, T. On the stability of the linear transformation in Banach spaces. J. Math. Soc. Japan 1950, 2, 64–66. [Google Scholar] [CrossRef]
  8. Rassias, T.M. On the stability of the linear mapping in Banach spaces. Proc. Am. Math. Soc. 1978, 72, 297–300. [Google Scholar] [CrossRef]
  9. Gajda, Z. On stability of additive mappings. Int. J. Math. Math. Sci. 1991, 14, 431–434. [Google Scholar] [CrossRef]
  10. Lee, Y.-H. On the stability of the monomial functional equation. Bull. Korean Math. Soc. 2008, 45, 397–403. [Google Scholar] [CrossRef] [Green Version]
  11. Brzdęk, J. Hyperstability of the Cauchy equation on restricted domains. Acta Math. Hung. 2013, 141, 58–67. [Google Scholar] [CrossRef]
  12. Găvruta, P. A generalization of the Hyers-Ulam-Rassias stability of approximately additive mappings. J. Math. Anal. Appl. 1994, 184, 431–436. [Google Scholar] [CrossRef] [Green Version]
  13. Brzdęk, J. Remarks on stability of some inhomogeneous functional equations. Aequationes Math. 2015, 89, 83–96. [Google Scholar] [CrossRef] [Green Version]
  14. Fenyö, I.; Forti, G.-L. On the inhomogeneous Cauchy functional equation. Stochastica 1981, 5, 71–77. [Google Scholar]
  15. Jessen, B.; Karpf, J.; Thorup, A. Some functional equations in groups and rings. Math. Scand. 1968, 22, 257–265. [Google Scholar] [CrossRef] [Green Version]
  16. Davison, T.M.K.; Ebanks, B. Cocycles on cancellative semigroups. Publ. Math. Debrecen 1995, 46, 137–147. [Google Scholar]
  17. Ebanks, B.; Sahoo, P.; Sander, W. Characterizations of Information Measures; World Scientific: Singapore; Hackensack, NJ, USA; London, UK; Hong Kong, 1998. [Google Scholar]
  18. Erdös, J. A remark on the paper “On some functional equations” by S. Kurepa. Glasnik Mat. Fiz. Astronom. 1959, 2, 3–5. [Google Scholar]
  19. Ebanks, B. Generalized Cauchy difference functional equations. Aequ. Math. 2005, 70, 154–176. [Google Scholar] [CrossRef]
  20. Ebanks, B. Generalized Cauchy difference equations. II. Proc. Amer. Math. Soc. 2008, 136, 3911–3919. [Google Scholar] [CrossRef] [Green Version]
  21. Ebanks, B.; Kannappan, P.; Sahoo, P.K. Cauchy differences that depend on the product of arguments. Glasnik Mat. 1992, 27, 251–261. [Google Scholar]
  22. Badora, R.; Brzdęk, J.; Ciepliński, K. Applications of Banach limit in Ulam stability. Symmetry 2021, 13, 841. [Google Scholar] [CrossRef]
  23. Forti, G.L. An existence and stability theorem for a class of functional equations. Stochastica 1980, 4, 23–30. [Google Scholar]
  24. Brzdęk, J.; Fechner, W.; Moslehian, M.S.; Sikorska, J. Recent developments of the conditional stability of the homomorphism equation. Banach J. Math. Anal. 2015, 9, 278–326. [Google Scholar] [CrossRef]
  25. Brzdęk, J.; Fosněr, A. Remarks on the stability of Lie homomorphisms. J. Math. Anal. Appl. 2013, 400, 585–596. [Google Scholar] [CrossRef]
  26. Xu, B.; Brzdęk, J.; Zhang, W. Fixed point results and the Hyers-Ulam stability of linear equations of higher orders. Pacific J. Math. 2015, 273, 483–498. [Google Scholar] [CrossRef]
  27. Aczél, J.; Dhombres, J. Functional Equations in Several Variables; Cambridge University Press: Cambridge, UK, 1989. [Google Scholar]
  28. Kuczma, M. An Introduction to the Theory of Functional Equations and Inequalities. In Cauchy’s Equation and Jensen’s Inequality, 2nd ed.; Birkhäuser: Basel, Switzerland, 2009. [Google Scholar]
  29. Forti, G.L. Continuous increasing weakly bisymmetric groupoids and quasi-groups in ℝ. Math. Pannon. 1997, 8, 49–71. [Google Scholar]
  30. Mazur, S. O metodach sumowalności. Księga Pamiątkowa Pierwszego Polskiego Zjazdu Matematycznego. In Proceedings of the First Congress of Polish Mathematicians, Lwów, Poland, 7–10 September 1927; Uniwersytet Jagielloński: Kraków, Poland, 1929; pp. 102–107. (In Polish). [Google Scholar]
  31. Banach, S. Théorie des Opérations Linéaires; The European Digital Mathematics Library: Warszawa, Poland, 1932. (In French) [Google Scholar]
  32. Lorentz, G.G. A contribution to the theory of divergent sequences. Acta Math. 1948, 80, 167–190. [Google Scholar] [CrossRef]
  33. Sucheston, L. Banach limits. Amer. Math. Mon. 1967, 74, 308–311. [Google Scholar] [CrossRef]
  34. Guichardet, A. La trace de Dixmier et autres traces. Enseign. Math. 2015, 61, 461–481. [Google Scholar] [CrossRef]
  35. Sofi, M.A. Banach limits: Some new thoughts and perspectives. J. Anal. 2019. [Google Scholar] [CrossRef] [Green Version]
  36. Semenov, E.M.; Sukochev, F.A.; Usachev, A.S. Geometry of Banach limits and their applications. Russ. Math. Surv. 2020, 75, 153–194. [Google Scholar] [CrossRef]
  37. Agarwal, R.P.; Xu, B.; Zhang, W. Stability of functional equations in single variable. J. Math. Anal. Appl. 2003, 288, 852–869. [Google Scholar] [CrossRef] [Green Version]
  38. Brzdęk, J.; Ciepliński, K.; Leśniak, Z. On Ulam’s type stability of the linear equation and related issues. Discrete Dyn. Nat. Soc. 2014, 2014, 536791. [Google Scholar] [CrossRef]
  39. Brzdęk, J.; Popa, D.; Xu, B. On approximate solutions of the linear functional equation of higher order. J. Math. Anal. Appl. 2011, 373, 680–689. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

El-hady, E.-s.; Brzdęk, J. Banach Limit and Ulam Stability of Nonhomogeneous Cauchy Equation. Mathematics 2022, 10, 1695. https://doi.org/10.3390/math10101695

AMA Style

El-hady E-s, Brzdęk J. Banach Limit and Ulam Stability of Nonhomogeneous Cauchy Equation. Mathematics. 2022; 10(10):1695. https://doi.org/10.3390/math10101695

Chicago/Turabian Style

El-hady, El-sayed, and Janusz Brzdęk. 2022. "Banach Limit and Ulam Stability of Nonhomogeneous Cauchy Equation" Mathematics 10, no. 10: 1695. https://doi.org/10.3390/math10101695

APA Style

El-hady, E.-s., & Brzdęk, J. (2022). Banach Limit and Ulam Stability of Nonhomogeneous Cauchy Equation. Mathematics, 10(10), 1695. https://doi.org/10.3390/math10101695

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