# Generalized Hyers-Ulam-Rassias Theorem in Menger Probabilistic Normed Spaces

Authors: M. Eshaghi Gordji; M. B. Ghaemi; H. Majani
Journal: Discrete Dynamics in Nature and Society
 (2010)

---

## Abstract

We introduce two reasonable versions of approximately additive
functions in a Šerstnev probabilistic normed space endowed
withΠM triangle function. More precisely, we show under
some suitable conditions that an approximately additive function
can be approximated by an additive mapping in above mentioned
spaces.


---

## Body

## 1. Introduction and Preliminaries

Menger proposed transferring the probabilistic notions of quantum mechanic from physics to the underlying geometry. The theory of probabilistic normed spaces (briefly, PN spaces) is important as a generalization of deterministic result of linear normed spaces and also in the study of random operator equations. The theory of probabilistic metric spaces introduced in 1942 by Menger [1], as well as by the authors in [2, 3]. The notion of a probabilistic normed space was introduced by Šerstnev [4]. Alsina, Schweizer and Skalar gave a general definition of probabilistic normed space based on the definition of Menger for probabilistic metric spaces in [5, 6].It can be defined, in some way, the class of approximate solutions of the given functional equation one can ask whether each mapping from this class can be somehow approximated by an exact solution of the considered equation. Such a problem was formulated by Ulam in1940 (cf., [7]) and solved the next year for the Cauchy functional equation by Hyers [8]. In 1950, Aoki [9] and in 1978, Rassias [10] proved a generalization of Hyers' theorem for additive and linear mappings, respectively.Theorem 1.1.
Letf be an approximately additive mapping from a normed vector space E into a Banach space F, that is, f satisfies the inequality
(1.1)∥f(x+y)-f(x)-f(y)∥≤ɛ(∥x∥p+∥y∥p)
for all x,y∈E, where ɛ and p are constants with ɛ>0 and 0≤p<1. Then the mapping L:E→F defined by L(x)=limn→∞2-nf(2nx) is the unique additive mapping which satisfies
(1.2)∥f(x)-L(x)∥≤2ɛ2-2p∥x∥p
for all x∈E.The result of Rassias has influenced the development of what is now called the Hyers-Ulam-Rassias stability theory for functional equations. In1994, a generalization of Rassias' theorem was obtained by Găvruţa [11] by replacing the bound ε(∥x∥p+∥y∥p) by a general control function φ(x,y). Several stability results have been recently obtained for various equations, also for mapping with more general domains and ranges (see [12–18]).PN spaces were first defined by Šerstnev  in1962 (see [4]). Their definition was generalized in [5]. We recall and apply the definition of probabilistic space briefly as given in [2], together with the notation that will be needed (see [2]). A distance distribution function (briefly, a d.d.f.) is a nondecreasing function F from ℝ̅+ into [0,1] that satisfies F(0)=0 and F(+∞)=1, and is left-continuous on (0,+∞); here as usual, ℝ̅+:=[0,+∞]. The space of d.d.f.'s will be denoted by Δ+; and the set of all F in Δ+ for which limt→+∞-F(t)=1 by D+. The space Δ+ is partially ordered by the usual pointwise ordering of functions, that is, F≤G if and only if F(x)≤G(x) for all x in ℝ̅+. For any a≥0, εa+ is the d.d.f. given by(1.3)εa+(t)={0,ift≤a,1,ift>a.
The space Δ+ can be metrized in several ways [2], but we will here adopt the Sibley metric dS. If F,G are  d.f.'s and h is in ]0,1[, let (F,G;h) denote the condition:(1.4)G(x)≤F(x+h)+h∀x∈]0,1h[.
Then the Sibley metric dS is defined by(1.5)dS(F,G):=inf{h∈]0,1[:both(F,G;h)and(G,F;h)hold}.
In particular, under the usual pointwise ordering of functions, ε0 is the maximal element of Δ+. A triangle function is a binary operation on Δ+, namely a function τ:Δ+×Δ+→Δ+ that is associative, commutative, nondecreasing in each place and has ε0 as identity, that is, for all F,G and H in Δ+:(TF1)
τ(τ(F,G),H)=τ(F,τ(G,H)),(TF2)
τ(F,G)=τ(G,F),(TF3)
F≤G⇒τ(F,H)≤τ(G,H),(TF4)
τ(F,ε0)=τ(ε0,F)=F.Moreover, a triangle function iscontinuous if it is continuous in the metric space (Δ+,dS).Typical continuous triangle functions areΠT(F,G)(x)=sups+t=xT(F(s),G(t)), and ΠT*(F,G)=infs+t=xT*(F(s),G(t)). Here T is a continuous t-norm, that is, a continuous binary operation on [0,1] that is commutative, associative, nondecreasing in each variable and has 1 as identity; T* is a continuous t-conorm, namely a continuous binary operation on [0,1] which is related to the continuous t-norm T through T*(x,y)=1-T(1-x,1-y). For example T(x,y)=min(x,y)=M(x,y) and T*(x,y)=max(x,y) or T(x,y)=π(x,y)=xy and T*(x,y)=π*(x,y)=x+y-xy.Definition 1.2.
AProbabilistic Normed space (briefly, PN space) is a quadruple (X,ν,τ,τ*), where X is a real vector space, τ and τ* are continuous triangle functions with τ≤τ* and ν is a mapping (the probabilistic norm) from V into Δ+, such that for every choice of p and q in V the following hold:(N1)
νp=ε0 if and only if p=θ  (θ is the null vector in X);(N2)
ν-p=νp;(N3)
νp+q≥τ(νp,νq);(N4)
νp≤τ*(νλp,ν(1-λ)p) for every λ∈[0,1].A PN space is called a Šerstnev space if it satisfies (N1), (N3) and the following condition:(1.6)ναp(x)=νp(x|α|),
holds for every α≠0∈ℝ and x>0. When here is a continuous t-norm T such that τ=ΠT and τ*=ΠT*, the PN space (X,ν,τ,τ*) is called Menger PN space (briefly, MPN space), and is denoted by (X,ν,τ).Let(X,ν,τ) be an MPN space let {xn} be a sequence in X. Then {xn} is said to be convergent if there exists x∈X such that(1.7)limn→∞ν(xn-x)(t)=1
for all t>0. In this case x is called the limit of {xn}.The sequencexn in MPN space (X,ν,τ) is called Cauchy if for each ɛ>0 and δ>0, there exists some n0 such that ν(xn-xm)(δ)>1-ɛ for all m,n≥n0.Clearly, every convergent sequence in a MPN space is Cauchy. If each Cauchy sequence is convergent in a MPN space(X,ν,τ), then (X,ν,τ) is called Menger probabilistic Banach space (briefly, MPB space).Recently, the stability of functional equations on PN spaces and MPN spaces have been investigated by some authors; see [19–23] and references therein. In this paper, we investigate the stability of additive functional equations on Šerstnev probabilistic normed space endowed with ΠM triangle function.


## 2. Main Results

We begin our work withuniform version of the Hyers-Ulam-Rassias stability in a Šerstnev PN space in which we uniformly approximate a uniform approximate additive mapping.Theorem 2.1.
LetX be a linear space and (Y,ν,ΠM) be a Šerstnev PB space. Let φ:X×X→[0,∞) be a control function such that
(2.1)φ̃n(x,y)={2-n-1φ(2nx,2ny)}(x,y∈X)
converges to zero. Let f:X→Y be a uniformly approximately additive function with respect to φ in the sense that
(2.2)limt→∞ν(f(x+y)-f(x)-f(y))(tφ(x,y))=1
uniformly on X×X. Then T(x):=limn→∞2-nf(2nx) for any x∈X exists and defines an additive mapping T:X→Y such that if for some δ>0,α>0(2.3)ν(f(x+y)-f(x)-f(y))(δφ(x,y))>α(x,y∈X)
then
(2.4)ν(T(x)-f(x))(δφ̃n(x,x))>α(x∈X).Proof.
Givenε>0, by (2.2), we can choose some t0 such that
(2.5)ν(f(x+y)-f(x)-f(y))(tφ(x,y))≥1-ε
for all x,y∈X and all t≥t0. Putting y=x in (2.5) we get
(2.6)ν(f(2x)-2f(x))(tφ(x,x))≥1-ε
and by replacing x by 2nx, we obtain
(2.7)ν(2-n-1f(2n+1x)-2-nf(2nx))(t2-n-1φ(2nx,2nx))≥1-ε.
By passing to a nonincreasing subsequence, if necessary, we may assume that {2-n-1φ(2nx,2ny)} is nonincreasing.
Thus for eachn>m we have
(2.8)ν(2-mf(2mx)-2-nf(2nx))(t2-m-1φ(2mx,2mx))=ν(∑k=mn-1(2-kf(2kx)-2-k-1f(2k+1x)))(t2-m-1φ(2mx,2mx))≥ΠM{ν(2-mf(2mx)(∑k=m+1n-1(2-kf(2kx)-2-k-1f(2k+1x)))-2-m-1f(2m+1x)),ν(∑k=m+1n-1(2-kf(2kx)-2-k-1f(2k+1x)))}(t2-m-1φ(2mx,2mx))≥ΠM{1-ɛ,ΠM{ν(2-m-1f(2m+1x)(∑k=m+2n-1(2-kf(2kx)-2-k-1f(2k+1x)))-2-m-2f(2m+2x)),ν(∑k=m+2n-1(2-kf(2kx)-2-k-1f(2k+1x)))}(t2-m-2φ(2m+1x,2m+1x))}≥1-ε.
The convergence of (2.1) implies that for given δ>0 there is n0∈ℕ such that
(2.9)t02-n-1φ(2nx,2nx)<δ∀n≥n0.
Thus by (2.8) we deduce that
(2.10)ν(2-mf(2mx)-2-nf(2nx))(δ)≥ν(2-mf(2mx)-2-nf(2nx))(t02-m-1φ(2mx,2mx))≥1-ɛ
for each n≥n0. Hence 2-nf(2nx) is a Cauchy sequence in Y. Since (Y,ν,ΠM) is complete, this sequence converges to some T(x)∈Y. Therefore, we can define a mapping T:X→Y by T(x):=limn→∞2-nf(2nx), namely, for each t>0, and x∈X,
(2.11)ν(T(x)-2-nf(2nx))(t)=1.
Next, let x,y∈X. Temporarily fix t>0 and 0<ɛ<1. Since 2-n-1φ(2nx,2ny) converges to zero, there is some n1>n0 such that t0φ(2nx,2ny)<t2n+1 for all n≥n1. Hence for each n≥n1, we have
(2.12)ν(T(x+y)-T(x)-T(y))(t)≥ΠM{ΠM{ν(T(x+y)-2-n-1f(2n+1(x+y)))(t),ν(T(x)-2-n-1f(2n+1x))(t)},ΠM{ν(T(y)-2-n-1f(2n+1y))(t),ν(f(2n+1(x+y))-f(2n+1x)-f(2n+1y))(2n+1t)}}
but we have
(2.13)limn→∞ν(T(x+y)-2-n-1f(2n+1))(t)=1,limn→∞ν(T(x)-2-n-1f(2n+1x))(t)=1,limn→∞ν(T(y)-2-n-1f(2n+1y))(t)=1,
and by (2.5) and for large enough n, we have
(2.14)ν(f(2n+1(x+y))-f(2n+1x)-f(2n+1y))(2n+1t)≥ν(f(2n+1(x+y))-f(2n+1x)-f(2n+1y))(t0φ(2nx,2ny))≥1-ε.
Thus
(2.15)ν(T(x+y)-T(x)-T(y))(t)≥1-ε∀t>0,0<ε<1.
It follows that ν(T(x+y)-T(x)-T(y))(t)=1 for all t>0 and by (N1), we have T(x+y)=T(x)+T(y).
To end the proof, let, for some positiveδ and α, (2.3) hold. Let x∈X. Putting m=0 and α=1-ɛ in (2.10), we get
(2.16)ν(f(2nx)-2nf(x))(δ)≥α
for all positive integers n≥n0. Thus for large enough n, we have
(2.17)ν(f(x)-T(x))(δ2-n-1φ(2nx,2nx))≥ΠM{ν(f(x)-2-nf(2nx)),ν(2-nf(2nx)-T(x))}(δ2-n-1φ(2nx,2nx))≥α
therefore
(2.18)ν(T(x)-f(x))(δφ̃n(x,x))>α.Corollary 2.2.
LetX be a linear space and (Y,ν,ΠM) be a Šerstnev PB space. Let φ:X×X→[0,∞) be a control function satisfying (2.2). Let f:X→Y be a uniformly approximately additive function with respect to φ. Then there is a unique additive mapping T:X→Y such that
(2.19)limn→∞ν(f(x)-T(x))(tφ̃n(x,x))=1
uniformly on X.Proof.
The existence of uniform limit (2.19) immediately follows from Theorem 2.1. It remains to prove the uniqueness assertion.
LetS be another additive mapping satisfying (2.19). Fix c>0. Given ɛ>0, by (2.19) for T and S, we can find some t0>0 such that
(2.20)ν(f(x)-T(x))(tφ̃n(x,x))≥1-ε,ν(f(x)-S(x))(tφ̃n(x,x))≥1-ε
for all x∈X and t≥t0. Fix some x∈X and find some integer n0 such that
(2.21)t02-nφ(2n+1x,2n+1)<c∀n≥n0.
Then we have
(2.22)ν(S(x)-T(x))(c)≥ΠM{ν(2-nf(2nx)-T(x)),ν(S(x)-2-nf(2nx))}(c)=ΠM{ν(f(2nx)-T(2nx)),ν(S(2nx)-f(2nx))}(2nc)≥ΠM{ν(f(2nx)-T(2nx)),ν(S(2nx)-f(2nx))}(t0φ(2n+1x,2n+1x))≥1-ε.
It follows that ν(S(x)-T(x))(c)=1 for all c>0. Thus T(x)=S(x) for all x∈X.Considering the control functionφ(x,y)=θ(∥x∥q+∥y∥q) for some θ>0, we obtain the following.Corollary 2.3.
LetX be a normed linear space. Let (Y,ν,ΠM) be a Šerstnev PB space. Let θ≥0 and 0≤q<1. Suppose that f:X→Y is a function such that
(2.23)limt→∞ν(f(x+y)-f(x)-f(y))(tθ(∥x∥q+∥y∥q))=1
uniformly on X×X. Then there is a unique additive mapping T:X→Y such that
(2.24)limt→∞ν(T(x)-f(x))(t2n(q-1)θ∥x∥q)=1
uniformly on X.We are ready to give ournonuniform version of the Hyers-Ulam-Rassias theorem in Šerstnev PN spaces.Theorem 2.4.
LetX be a linear space. Let (Z,ω,ΠM) be a Šerstnev MPN space. Let ψ:X×X→Z be a function such that for some 0<α<2,
(2.25)ω(ψ(2x,2y))(t)≥ω(αψ(x,y))(t)
for all x,y∈X and t>0. Let (Y,ν,ΠM) be a Šerstnev PB space and let f:X→Y be a ψ-approximately additive mapping in the sense that
(2.26)ν(f(x+y)-f(x)-f(y))(t)≥ω(ψ(x,y))(t)
for each t>0 and x,y∈X. Then there exists unique additive mapping T:X→Y such that
(2.27)ν(f(x)-T(x))(t)≥ω(12ψ(x,x)(t))
where x∈X and t>0.Proof.
Puty=x in (2.26) to obtain
(2.28)ν(f(2x)-2f(x))(t)≥ω(ψ(x,x))(t)(x∈X,t>0).
Using (2.25) and induction on n, one can verify that
(2.29)ω(ψ(2nx,2n)x)(t)≥ω(αnψ(x,x))(t)
for all x∈X and t>0. Replacing x by 2n-1x in (2.28) and using (2.29) we get
(2.30)ν(f(2nx)-2f(2n-1x))(t)≥ω(αn-1ψ(x,x))(t)
for all x∈X and t>0. It follows from (2.30) that
(2.31)ν(2-nf(2nx)-2-n+1f(2n-1x))(2-nt)≥ω((1α)ψ(x,x))(α-nt)
whence
(2.32)ν(2-nf(2nx)-2-n+1f(2n-1x))((αn2n)t)≥ω((1α)ψ(x,x))(t)
for all n>m≥0, x∈X and t>0. So
(2.33)ν(2-nf(2nx)-2-mf(2mx))((αm+12m+1)t)=ν(∑k=m+1n2-kf(2kx)-2-k+1f(2k-1x))((αm+12m+1)t)≥ω((1α)ψ(x,x))(t)
whence
(2.34)ν(2-nf(2nx)-2-mf(2mx))(t)≥ω(1αψ(x,x))((αm+12m+1)t)
for all n>m≥0, x∈X and t>0. Fix x∈X. By
(2.35)lims→∞ω(1αψ(x,x))(s)=1
we deduce that {2-nf(2nx)} is a Cauchy sequence in (Y,ν,ΠM). Since (Y,ν,ΠM) is complete, this sequence converges to some point T(x)∈Y. It follows from (2.26) that
(2.36)ν(f(2n(x+y))-f(2nx)-f(2ny))(t)≥ω(ψ(2nx,2ny))(t)≥ω(αnψ(x,y))(t)≥ω(ψ(x,y))(α-nt)
whence
(2.37)ν(2-nf(2n(x+y))-2-nf(2nx)-2-nf(2ny))(t)≥ω(ψ(x,y))((2α)nt).
We have
(2.38)ν(T(x+y)-T(x)-T(y))(t)≥ΠM{ΠM{ν(T(x+y)-2-nf(2n(x+y))),ν(T(x)-2-nf(2nx))}(t),ΠM{ν(T(y)-2-nf(2ny)),ν(2-nf(2n(x+y))-2-nf(2nx)-2-nf(2ny))}(t)}.
By (2.37) and the fact that
(2.39)limn→∞ν(T(z)-2-nf(2nz))=1
for all z∈X and r>0, each term on the right-hand side tends to 1 as n→∞. Hence
(2.40)ν(T(x+y)-T(x)-T(y))(t)=1.
By (N1), it means that
(2.41)T(x+y)=T(x)+T(y).
Furthermore, let x∈X and t>0. Using (2.34) with m=0 we obtain
(2.42)ν(T(x)-f(x))(t)≥ΠM{ν(T(x)-2-nf(2nx)),ν(2-nf(2nx)-f(x))}(t)≥ΠM{ν(T(x)-2-nf(2nx)),ω((12)ψ(x,x))}(t).
Hence
(2.43)ν(T(x)-f(x))(t)≥ΠM{limn→∞ν(T(x)-2-nf(2nx)),ω((12)ψ(x,x))}(t)=ω((12)ψ(x,x))(t).
The  uniqueness of T can be proved in a similar fashion as in the proof of Corollary 2.2.



---

*Source: 162371-2010-02-18.xml*