# On Approximatelyp-Wright Affine Functions in Ultrametric Spaces

Authors: Anna Bahyrycz; Janusz Brzdęk; Magdalena Piszczek
Journal: Journal of Function Spaces and Applications
 (2013)

---

## Abstract

We prove some results for mappings taking values in ultrametric spaces and satisfying approximately a generalization of the equation ofp-Wright affine functions. They are motivated by the notion of stability for functional equations.


---

## Body

## 1. Introduction and Preliminaries

LetX1 and X2 be linear spaces over fields 𝔽1 and 𝔽2, respectively, and let p,p^∈𝔽1 be fixed. The functional equation
(1)f(px+p^y)+f(p^x+py)=f(x)+f(y),
for function f:X1→X2, generalizes the equation
(2)f(px+(1-p)y)+f((1-p)x+py)=f(x)+f(y).For𝔽1=ℝ and p∈(0,1), solutions of (2) are called the p-Wright affine functions, which are both p-Wright convex and concave (see [1]). For information on the p-Wright convexity and the p-Wright concavity we refer, for example, to [1, 2].Note also that forp=1/2 (2) becomes the well-known Jensen’s functional equation
(3)f(x+y2)=f(x)+f(y)2.
For p=1/3 (2) takes the form f(2x+y)+f(x+2y)=f(3x)+f(3y), which has been studied in [3] (see also [4]) in connection with some investigations of the generalized (σ,τ)-Jordan derivations on Banach algebras. The cases of more arbitrary p have been studied in [1, 5] (cf. [2]).In this paper we consider (1) in a bit generalized form, with p and p^ being some group endomorphisms. Motivated by the notion of the Hyers-Ulam stability (see, e.g., [6–9] for further details), we prove some results concerning the mappings that take values in the ultrametric spaces and satisfy (1) approximately, that is, fulfil inequality (8) (with suitable assumptions on θ). Our outcomes correspond to those in [10], where some issues (analogous as in Theorems 2 and 6) have been considered for functions mapping a classical normed space (real or complex) into a classical Banach space, with p being a scalar (real or complex, resp.) and for θ of the following two forms:
(4)θ(x,y)=A(∥x∥k+∥y∥k),θ(x,y)=A∥x∥k∥y∥k,
with some real A>0 and k>0 (see also [4] for similar outcomes but only for p=1/3). The main tool in our investigations is a fixed point theorem from [11] (for information on related results see [12–15]).Recall that an ultrametric space is a metric space(Y,d) with the metric d satisfying the condition d(x,z)≤max{d(x,y),d(y,z)} for every x,y,z∈Y; such a metric d is called an ultrametric. One of important examples of the ultrametric spaces is a non-Archimedean normed space.Let us remind yet that a linear spaceX over a field 𝕂, with a function ∥·∥:X→[0,∞), is said to be a non-Archimedean normed space provided ∥x∥=0 if and only if x=0 and ∥rx∥=|r|∥x∥ and ∥x+y∥≤max{∥x∥,∥y∥} for all x,y∈X, r∈𝕂, where |·| denotes a non-Archimedean valuation in 𝕂, that is a function |·|:𝕂→[0,∞) such that |r|=0 if and only if r=0 and |rs|=|r||s| and |r+s|≤max{|r|,|s|} for r,s∈𝕂.Clearly, ifX is a non-Archimedean normed space, then the formula d(x,y):=∥x-y∥ defines an ultrametric d in X, that is invariant (i.e., d(x+z,y+z)=d(x,y) for every x,y,z∈X).Any field endowed with a non-Archimedean valuation is said to be a non-Archimedean field. If the valuation is nontrivial (i.e., there is anr0∈𝕂 such that 0≠|r0|≠1), then we have |1|=|-1|=1 and |n×1|≤1 for all n∈ℕ (positive integers), where 1 is the neutral element of the semigroup (𝕂,·), 1×1=1 and (n+1)×1=(n×1)+1 for n∈ℕ.The first example of a non-Archimedean field was provided by Hensel in [16], where he gave a description of the p-adic numbers (for each fixed prime number p and any non-zero rational number x, there exists a unique integer nx such that x=(a/b)pnx, where a and b are integers not divisible by p; then |x|p:=p-nx defines a non-Archimedean valuation in ℚ and therefore also a non-Archimedean norm in ℚ).Letℚp denote the completion of ℚ, with respect to the metric d(x,y)=|x-y|p. Then ℚp (called the p-adic number field) can be identified with the set of all formal series x=∑k≥nx∞‍akpk, where |ak|≤p-1 are integers. The operation of addition and multiplication between any two elements of ℚp is defined naturally. The non-Archimedean norm ∥·∥p in ℚp is defined by ∥∑k≥nx∞‍akpk∥p=p-nx; ℚp endowed with it turns out to be a locally compact filed (see [17]). Let us mention yet that the p-adic numbers have gained the interest of physicists because of their connections with some issues in quantum physics, p-adic strings and superstrings (see [18]).The problem of stability of functional equations was motivated by a question of S.M. Ulam asked in 1940 and an answer to it published by Hyers [19]. Since then numerous papers on this subject have been published, and we refer to [6–9, 13, 15, 20, 21] for more details, some discussions, and further references.Let us mention yet that the issue of stability of functional equations is related to the notions of shadowing (see [22, 23]), the theory of perturbation (see [24]), and optimization.Moslehian and Rassias [25] (see [26, 27] for some related outcomes) have proved the first stability results for the Cauchy and quadratic functional equations in non-Archimedean normed spaces. Afterwards several stability results for other equations in such spaces have been published, for example, in [28–30] (for further references see [13, 15]).


## 2. Auxiliary Result

In this sectionX denotes a nonempty set and (Y,d) stands for a complete ultrametric space. The main tool in the proofs of the main theorems of this paper is a fixed point result that can be derived from [11, Theorem 2]. To present it we need to introduce some notions.For anyδ1,δ2∈ℝ+X (AB denotes the family of all functions mapping a set B≠∅ into a set A≠∅) we write δ1≤δ2 provided δ1(x)≤δ2(x) for x∈X, and we say that an operator Λ:ℝ+X→ℝ+X is nondecreasing if it satisfies the condition Λδ1≤Λδ2 for all δ1,δ2∈ℝ+X with δ1≤δ2. Moreover, given a sequence (gn)n∈ℕ in ℝ+X, we write limn→∞gn=0 provided limn→∞gn(x)=0 for x∈X.We use the following hypothesis concerning operatorsΛ:ℝ+X→ℝ+X: (𝒞)  limn→∞Λδn=0 for every sequence (δn)n∈ℕ in ℝ+X satisfying the condition limn→∞δn=0.Moreover, to simplify some notations, we defineΔ:(YX)2→ℝ+X by
(5)Δ(ξ,μ)(x):=d(ξ(x),μ(x)),ξ,μ∈YX,x∈X.Now we are in a position to present the mentioned fixed point result.Theorem 1.
LetΛ:ℝ+X→ℝ+X be a nondecreasing operator satisfying hypothesis (𝒞). If 𝒯:YX→YX, ɛ:X→ℝ+, and φ:X→Y satisfy
(6)d((𝒯ξ)(x),(𝒯μ)(x))≤Λ(Δ(ξ,μ))(x),ξ,μ∈YX,x∈X,d((𝒯φ)(x),φ(x))≤ɛ(x),x∈X,limn→∞Λnɛ=0,
then the limit limn→∞(𝒯nφ)(x)=:ψ(x) exists for every x∈X and the function ψ∈YX, defined in this way, is a fixed point of 𝒯 with
(7)d(φ(x),ψ(x))≤supn∈ℕ0(Λnɛ)(x),x∈X.


## 3. The Main Results

We say that(Y,+,d) is an ultrametric group if (Y,+) is a group and d is ultrametric in Y such that the group operation + is continuous with respect to d. In what follows (X,+) is a group (though we use the additive notation for the group operation in X, it does not mean that the group must be commutative), (Y,+,d) is an ultrametric commutative group, and the ultrametric d is complete and invariant, unless explicitly stated otherwise. Given a mapping r:X→X, for simplicity of notation, we write rx:=r(x) for each x∈X.The following two theorems concern stability of functional equation (1).Theorem 2.
Letp and p^ be endomorphisms of X with p∘p^=p^∘p, B∈(0,1), and g:X→Y and θ:X2→[0,∞) satisfy the inequalities
(8)d(g(px+p^y)+g(p^x+py),g(x)+g(y))≤θ(x,y),x,y∈X,(9)max{θ(px,py),θ(p^x,p^y)}≤Bθ(x,y),x,y∈X.
Then there exists a unique function G:X→Y such that
(10)G(px+p^y)+G(p^x+py)=G(x)+G(y),x,y∈X,(11)d(g(x),G(x))≤min{θ(x,0),θ(0,x)},x∈X.
Moreover, G is the unique solution of (10) for which there exists a constant M∈(0,∞) with
(12)d(g(x),G(x))≤Mmin{θ(x,0),θ(0,x)},x∈X.Proof.
Taking in (8) first y=0 and next x=0 we obtain
(13)d(g(px)+g(p^x),g(x)+g(0))≤θ(x,0),x∈X,d(g(p^x)+g(px),g(x)+g(0))≤θ(0,x),x∈X.
Write g0(x):=g(x)-g(0) and 𝒯ξ(x):=ξ(px)+ξ(p^x) for x∈X, ξ∈YX. Then (13) implies the inequality
(14)d(𝒯g0(x),g0(x))≤ɛ(x),x∈X,
where ɛ(x):=min{θ(x,0),θ(0,x)}. Define an operator Λ:ℝ+X→ℝ+X by
(15)Λη(x):=max{η(px),η(p^x)},η∈ℝ+X,x∈X.
Then Λ is non-decreasing, satisfies hypothesis (𝒞) and
(16)d(𝒯ξ(x),𝒯μ(x))=d(ξ(px)+ξ(p^x),μ(px)+μ(p^x))≤max{d(ξ(px),μ(px)),d(ξ(p^x),μ(p^x))}=max{Δ(ξ,μ)(px),Δ(ξ,μ)(p^x)}=ΛΔ(ξ,μ)(x),ξ,μ∈YX,x∈X.
Note that by (9)
(17)ɛ(px)=min{θ(px,0),θ(0,px)}≤min{Bθ(x,0),Bθ(0,x)}=Bmin{θ(x,0),θ(0,x)}=Bɛ(x),x∈X,
and analogously ɛ(p^x)≤Bɛ(x) for x∈X. Consequently
(18)max{ɛ(px),ɛ(p^x)}≤Bɛ(x),x∈X.
Further, it is easy to show by induction that
(19)Λnɛ(x)≤Bnɛ(x),x∈X,n∈ℕ.
Since 0<B<1, this means that limn→∞(Λnɛ)(x)=0 for x∈X. Moreover, in view of (18) we see that Λn+1ɛ(x)≤Λnɛ(x) for n∈ℕ0 and x∈X, whence
(20)supn∈ℕ0(Λnɛ)(x)=(Λ0ɛ)(x)=ɛ(x),supn∈ℕ0(Λn+1ɛ)(x)=Λɛ(x).
Consequently, by Theorem 1, there is a solution G0:X→Y of the equation
(21)G0(x)=G0(px)+G0(p^x)
such that d(g0(x),G0(x))≤ɛ(x) for x∈X. Moreover,
(22)G0(x):=limn→∞(𝒯ng0)(x),x∈X.
Now, we show that, for everyn∈ℕ0,
(23)d(𝒯ng0(px+p^y)+𝒯ng0(p^x+py),𝒯ng0(x)+𝒯ng0(y))≤Bnθ(x,y),x,y∈X.
Clearly, for n=0, (23) reduces to (8). Next, fix m∈ℕ0 and assume that (23) holds for n=m. Then, by (9),
(24)d(𝒯m+1g0(px+p^y)+𝒯m+1g0(p^x+py),𝒯m+1g0(x)+𝒯m+1g0(y))=d(𝒯mg0(p(px+p^y))+𝒯mg0(p^(px+p^y))+𝒯mg0(p(p^x+py))+𝒯mg0(p^(p^x+py)),𝒯mg0(px)+𝒯mg0(p^x)+𝒯mg0(py)+𝒯mg0(p^y))≤max{d(𝒯mg0(ppx+p^py)+𝒯mg0(p^px+ppy),𝒯mg0(px)+𝒯mg0(py)),d(𝒯mg0(pp^x+p^p^y)+𝒯mg0(p^p^x+pp^y),𝒯mg0(p^x)+𝒯mg0(p^y))}≤max{Bmθ(px,py),Bmθ(p^x,p^y)}≤Bm+1θ(x,y),x,y∈X.
Thus we obtain (23) for n=m+1, which completes the induction. Letting n→∞ in (23), we obtain that
(25)G0(px+p^y)+G0(p^x+py)=G0(x)+G0(y),x,y∈X.
WriteG(x):=G0(x)+g(0) for x∈X. Then (11) holds and
(26)G(px+p^y)+G(p^x+py)=G(x)+G(y),x,y∈X.
It remains to prove the uniqueness ofG. So, let M∈(0,∞) and G1:X→Y a solution to (10) with d(g(x),G1(x))≤Mɛ(x) for x∈X. Then
(27)G1(px)+G1(p^x)=G1(x)+G1(0),x∈X,G(px)+G(p^x)=G(x)+G(0),x∈X,
and, by (11),
(28)d(G(x),G1(x))≤max{1,M}ɛ(x),x∈X.
Further, by (9), θ(0,0)=0, whence ɛ(0)=0. This and (28) yield
(29)G(0)=G1(0).
We show that, for eachn∈ℕ0,
(30)d(G(x),G1(x))≤max{1,M}ɛ(x)supj≥n{Bj},x∈X.
The case n=0 is just (28). So fix m∈ℕ0 and assume that (30) holds for n=m. Then, from (27), (29), and (18) we obtain
(31)d(G(x),G1(x))=d(G(px)+G(p^x),G1(px)+G1(p^x))≤max{d(G(px),G1(px)),d(G(p^x),G1(p^x))}≤max{max{1,M}ɛ(px)supj≥m{Bj},max{1,M}ɛ(p^x)supj≥m{Bj}}=max{1,M}supj≥m{Bj}max{ɛ(px),ɛ(p^x)}≤max{1,M}Bɛ(x)supj≥m{Bj}=max{1,M}ɛ(x)supj≥m+1{Bj},x∈X.
Thus we have shown (30). Now, letting n→∞ in (30) we get G1=G.Remark 3.
LetX be a normed space (either classical or non-Archimedean) over a field 𝔽. Clearly, if X is classical, then we assume that 𝔽∈{ℝ,ℂ}; if X is non-Archimedean, then 𝔽 is a nontrivial non-Archimedean field. Given r:X→X, write ∥r∥:=inf{ξ∈(0,∞):∥rx-ry∥≤ξ∥x-y∥ for x,y∈X}. It is easy to see that if ∥p∥<1, ∥p^∥<1, and θ has one of the following forms (i)
θ(x,y)=A(∥x∥k+∥y∥l)m,(ii)
θ(x,y)=A(max{∥x∥k,∥y∥l})m,(iii)
θ(x,y)=A∥x∥k∥y∥l,
with someA∈(0,∞) and k,l,m∈ℕ, then the assumptions of the above theorem are fulfilled. Multiplying and/or adding those functions we can obtain numerous further examples.
Note that in the situation whenθ is of form (iii), θ(x,0)=θ(0,x)=0 for x∈X, whence g=G in the statement of Theorem 2. This means that (under the assumptions of Theorem 2) with θ given by (iii), every g:X→Y satisfying (8) must be actually a solution to (1).
In particular, from Theorem2, we get immediately the following result on stability of (1).Corollary 4.
LetX be a normed space over a field 𝔽∈{ℝ,ℂ}, p∈𝔽,
(32)max{|p|,|1-p|}<1,
and, θ:X2→[0,∞) be of one let the forms (i)–(iii). Assume that g:X→Y satisfies the inequality
(33)d(g(px+(1-p)y)+g((1-p)x+py),g(x)+g(y))≤θ(x,y),x,y∈X.
Then the following two statements are valid. (α)
If (i) or  (ii) holds, there exists a unique solutionG:X→Y of (1) such that d(g(x),G(x))≤A(min{∥x∥k,∥x∥l})m for x∈X.(β)
If (iii) holds, theng is a solution to (1).Remark 5.
LetX be a non-archimedean normed space over a field 𝔽 that is non-Archimedean and p∈𝔽. Then results analogous to Corollary 4 cannot be derived from Theorem 2, because we have 1=|p+1-p|≤max{|p|,|1-p|}, which means that, with |p|<1, we get 1≤|1-p|≤max{|p|,1}=1.
However, if|p|>1, then 1<|p|=|1-p-1|≤max{1,|1-p|}, which means that |1-p|>1. Consequently, we obtain results analogous to Corollary 4 for |p|>1 and the function θ is one of the following forms (a)
θ(x,y)=A(∥x∥k+∥y∥l)m for all (x,y)∈X2∖{(0,0)} and θ(0,0)=0,(b)
θ(x,y)=A(max{∥x∥k,∥y∥l})m for all (x,y)∈X2∖{(0,0)} and θ(0,0)=0,(c)
θ(x,y)=A(∥x∥k∥y∥l)m for all x,y∈X∖{0} and θ(x,0)=θ(0,x)=0 for all x∈X,
with someA,k,l∈(0,∞) and m∈(-∞,0). Unfortunately, we must define θ at the point (0,0) in a bit artificial way in (a) and (b), similar (but even bigger) problem we have in (c). The subsequent modified version of Theorem 2 amends this situation to some extent for (a) and (b).Theorem 6.
Letp,p^:X→X be monomorphisms with p∘p^=p^∘p, B∈(0,1), and g:X→Y, θ:X2∖{(0,0)}→[0,∞) satisfy
(34)d(g(px+p^y)+g(p^x+py),g(x)+g(y))≤θ(x,y),max{θ(px,py),θ(p^x,p^y)}≤Bθ(x,y)
for (x,y)∈X2∖{(0,0)}. Then there is a solution G:X→Y of (10) with
(35)d(g(x),G(x))≤min{θ(x,0),θ(0,x)},x∈X∖{0}.Proof.
Arguing in the same way as in the proof of Theorem2, with X being replaced by X0:=X∖{0}, from Theorem 1, we deduce that there is a solution G1:X0→Y of the equation
(36)G1(x)=G1(px)+G1(p^x)
such that d(g0(x),G1(x))≤min{θ(x,0),θ(0,x)} for x∈X0. Moreover, G1(x):=limn→∞(𝒯ng0)(x) for x∈X0. Define G0:X→Y by G0(x)=G1(x) for x∈X0 and G0(0)=0.
In the same way as in the proof of Theorem2, we obtain that
(37)d(𝒯ng0(px+p^y)+𝒯ng0(p^x+py),𝒯ng0(x)+𝒯ng0(y))≤Bnθ(x,y),x,y∈X0,px+p^y,p^x+py∈X0
for all n∈ℕ0. We need yet to prove that, for every n∈ℕ0,
(38)d(𝒯ng0(p^x+py),𝒯ng0(x)+𝒯ng0(y))≤Bnθ(x,y),x,y∈X0,px+p^y=0,p^x+py≠0,(39)d(𝒯ng0(px+p^y),𝒯ng0(x)+𝒯ng0(y))≤Bnθ(x,y),x,y∈X0,px+p^y≠0,p^x+py=0,(40)d(0,𝒯ng0(x)+𝒯ng0(y))≤Bnθ(x,y),x,y∈X0,px+p^y=p^x+py=0.
We show only (38); the proofs for (39) and (40) are analogous.
Clearly, forn=0, (38) follows from (34). Next, if (37) holds for a fixed n∈ℕ, then, for every x,y∈X0 with px+p^y=0 and p^x+py≠0,
(41)d(𝒯m+1g0(p^x+py),𝒯m+1g0(x)+𝒯m+1g0(y))=d(𝒯mg0(p(p^x+py))+𝒯mg0(p^(p^x+py)),𝒯mg0(px)+𝒯mg0(p^x)+𝒯mg0(py)+𝒯mg0(p^y))≤max{d(𝒯mg0(p^px+ppy),𝒯mg0(px)+𝒯mg0(py)),d(𝒯mg0(p^p^x+pp^y),𝒯mg0(p^x)+𝒯mg0(p^y))}≤max{Bmθ(px,py),Bmθ(p^x,p^y)}≤Bm+1θ(x,y).
This completes the induction.
Lettingn→∞ in (37)–(40), we obtain that
(42)G0(px+p^y)+G0(p^x+py)=G0(x)+G0(y),x,y∈X.
Writing G(x):=G0(x)+g(0) for x∈X we obtain that (35) holds and G is a solution to (10).Below we present a theorem that is somewhat complementary to Theorem2.Theorem 7.
Letp and p^ be endomorphisms of X with p∘p^=p^∘p, and p be bijective, B∈(0,1), and g:X→Y and θ:X2→[0,∞) satisfy the inequalities
(43)max{θ(x,y),θ(p^x,p^y)}≤Bθ(px,py),x,y∈X.
Assume that g:X→Y satisfies (8). Then there exists a unique solution G:X→Y of (10) such that
(44)d(g(x),G(x))≤min{θ(p-1x,0),θ(0,p-1x)},x∈X.
Moreover, G is the unique solution of (10) for which there exists a constant M∈(0,∞) with
(45)d(g(x),G(x))≤Mmin{θ(p-1x,0),θ(0,p-1x)},x∈X.Proof.
The proof is very similar to that of Theorem2, but for the convenience of readers we present it here.
Taking in (8) first y=0 and next x=0 we obtain
(46)d(g(px)+g(p^x),g(x)+g(0))≤min{θ(x,0),θ(0,x)},x∈X,
whence replacing x by p-1x we derive the following inequality:
(47)d(g(x)+g(p^p-1x),g(p-1x)+g(0))≤min{θ(p-1x,0),θ(0,p-1x)},x∈X.
Since d is invariant, this yields
(48)d(g(x)-g(0),g(qx)-g(p^qx))≤ɛ(x),x∈X,
with q:=p-1 and ɛ(x):=min{θ(qx,0),θ(0,qx)}. Writing g0(x):=g(x)-g(0) and 𝒯ξ(x):=ξ(qx)-ξ(p^qx) for x∈X, ξ∈YX, we finally get
(49)d(g0(x),𝒯g0(x))≤ɛ(x),x∈X.
Define an operatorΛ:ℝ+X→ℝ+X by Λη(x):=max{η(qx),η(p^qx)} for η∈ℝ+X, x∈X. Clearly, Λ is non-decreasing and satisfies hypothesis (𝒞), and, according to (43),
(50)d(𝒯ξ(x),𝒯μ(x))=d(ξ(qx)-ξ(p^qx),μ(qx)-μ(p^qx))≤max{d(ξ(qx),μ(qx)),d(ξ(p^qx),μ(p^qx))}=max{Δ(ξ,μ)(qx),Δ(ξ,μ)(p^qx)}=ΛΔ(ξ,μ)(x),ξ,μ∈YX,x∈X.
Note that(51)ɛ(qx)=min{θ(qqx,0),θ(0,qqx)}≤min{Bθ(qx,0),Bθ(0,qx)}=Bmin{θ(qx,0),θ(0,qx)}=Bɛ(x),x∈X,
and analogously ɛ(p^qx)≤Bɛ(x) for x∈X. Consequently
(52)max{ɛ(qx),ɛ(p^qx)}≤Bɛ(x),x∈X.
It is easy to show by induction thatΛnɛ(x)≤Bnɛ(x) for x∈X, n∈ℕ. Since 0<B<1, this means that limn→∞(Λnɛ)(x)=0 for x∈X. Further, by (52), for every n∈ℕ0 and x∈X we have Λn+1ɛ(x)≤Λnɛ(x), whence
(53)supn∈ℕ0(Λnɛ)(x)=(Λ0ɛ)(x)=ɛ(x),supn∈ℕ0(Λn+1ɛ)(x)=Λɛ(x).
Consequently, by Theorem 1, there is a function G0:X→Y such that d(g0(x), G0(x))≤ɛ(x), G0(x)=G0(qx)-G0(p^qx), and G0(x)=limn→∞(𝒯ng0)(x) for x∈X. It is easily seen that
(54)G0(x)=G0(px)+G0(p^x),x∈X.
Now, we show that, for everyn∈ℕ0,
(55)d(𝒯ng0(px+p^y)+𝒯ng0(p^x+py),𝒯ng0(x)+𝒯ng0(y))≤Bnθ(x,y),x,y∈X.
Clearly, for n=0, (55) reduces to (8). Next, fix m∈ℕ0 and assume that (55) holds for every x,y∈X with n=m. Then, by (43),
(56)d(𝒯m+1g0(px+p^y)+𝒯m+1g0(p^x+py),𝒯m+1g0(x)+𝒯m+1g0(y))=d(𝒯mg0(q(px+p^y))-𝒯mg0(p^q(px+p^y))+𝒯mg0(q(p^x+py))-𝒯mg0(p^q(p^x+py)),𝒯mg0(qx)-𝒯mg0(p^qx)+𝒯mg0(qy)-𝒯mg0(p^qy))≤max{d(𝒯mg0(pqx+p^qy)+𝒯mg0(p^qx+pqy),𝒯mg0(qx)+𝒯mg0(qy)),d(𝒯mg0(pp^qx+p^p^qy)+𝒯mg0(p^p^qx+pp^qy),𝒯mg0(p^qx)+𝒯mg0(p^qy))}≤max{Bmθ(qx,qy),Bmθ(p^qx,p^qy)}≤Bm+1θ(x,y),x,y∈X.
Thus we obtain (55) for n=m+1, which completes the induction. Letting n→∞ in (55), we get G0(px+p^y)+G0(p^x+py)=G0(x)+G0(y) for x,y∈X. Next, writing G(x):=G0(x)+g(0) for x∈X, we obtain that G is a solution to (1).
To complete the proof let us yet mention that we show the uniqueness ofG in the same way as in the proof of Theorem 2.Now, it is easily seen that Theorem7 yields the subsequent corollary, which is an analogue of Corollary 4.Corollary 8.
LetX be a normed space over a field 𝔽∈{ℝ,ℂ}, p∈𝔽,
(57)max{1,|1-p|}<|p|,
and let θ:X2→[0,∞) be one of the forms (i)–(iii). If g:X→Y satisfies inequality (33), then the following two statements are valid. (α)
If (i) or (ii) holds, there exists a unique solutionG:X→Y of (1) such that d(g(x),G(x))≤A(min{∥p-1x∥k,∥p-1x∥l})m for x∈X.(β)
If (iii) holds, theng is a solution to (1).



---

*Source: 723545-2013-10-28.xml*