Approximation and Computation in Science and Engineering 1st Edition Nicholas J. Daras (Editor) - The Full Ebook Version Is Just One Click Away
Approximation and Computation in Science and Engineering 1st Edition Nicholas J. Daras (Editor) - The Full Ebook Version Is Just One Click Away
com
https://ebookmeta.com/product/approximation-and-computation-
in-science-and-engineering-1st-edition-nicholas-j-daras-
editor/
OR CLICK HERE
DOWLOAD EBOOK
https://ebookmeta.com/product/computation-and-approximation-1st-
edition-vijay-gupta/
ebookmeta.com
https://ebookmeta.com/product/traffic-and-highway-engineering-5th-
edition-garber-nicholas-j/
ebookmeta.com
https://ebookmeta.com/product/wraith-king-3-1st-edition-jack-porter/
ebookmeta.com
The Sounds of Mandarin 1st Edition Janet Y. Chen
https://ebookmeta.com/product/the-sounds-of-mandarin-1st-edition-
janet-y-chen/
ebookmeta.com
https://ebookmeta.com/product/managing-institutions-the-survival-of-
minban-secondary-schools-in-mainland-china-1st-edition-ying-wang/
ebookmeta.com
https://ebookmeta.com/product/basic-statistics-in-business-and-
economics-ise-hed-irwin-statistics-10th-edition-douglas-a-lind/
ebookmeta.com
https://ebookmeta.com/product/information-and-communications-
technology-law-in-singapore-1st-edition-warren-b-chik/
ebookmeta.com
Springer Optimization and Its Applications 180
Nicholas J. Daras
Themistocles M. Rassias Editors
Approximation
and Computation
in Science and
Engineering
Springer Optimization and Its Applications
Volume 180
Series Editors
Panos M. Pardalos , University of Florida
My T. Thai , University of Florida
Honorary Editor
Ding-Zhu Du, University of Texas at Dallas
Advisory Editors
Roman V. Belavkin, Middlesex University
John R. Birge, University of Chicago
Sergiy Butenko, Texas A&M University
Vipin Kumar, University of Minnesota
Anna Nagurney, University of Massachusetts Amherst
Jun Pei, Hefei University of Technology
Oleg Prokopyev, University of Pittsburgh
Steffen Rebennack, Karlsruhe Institute of Technology
Mauricio Resende, Amazon
Tamás Terlaky, Lehigh University
Van Vu, Yale University
Michael N. Vrahatis, University of Patras
Guoliang Xue, Arizona State University
Yinyu Ye, Stanford University
Aims and Scope
Optimization has continued to expand in all directions at an astonishing rate. New
algorithmic and theoretical techniques are continually developing and the diffusion
into other disciplines is proceeding at a rapid pace, with a spot light on machine
learning, artificial intelligence, and quantum computing. Our knowledge of all
aspects of the field has grown even more profound. At the same time, one of the
most striking trends in optimization is the constantly increasing emphasis on the
interdisciplinary nature of the field. Optimization has been a basic tool in areas
not limited to applied mathematics, engineering, medicine, economics, computer
science, operations research, and other sciences.
Volumes from this series are indexed by Web of Science, zbMATH, Mathematical
Reviews, and SCOPUS.
Approximation and
Computation in Science
and Engineering
Editors
Nicholas J. Daras Themistocles M. Rassias
Department of Maths and Engineering Department of Mathematics, Zografou
Sciences Campus
Hellenic Military Academy National Technical University of Athens
Vari Attikis, Greece Athens, Greece
Mathematics Subject Classification: 11XX, 14XX, 34XX, 37XX, 47XX, 49XX, 60XX, 65XX, 68XX,
81XX, 90XX, 91XX, 94XX, 05XX
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
v
Contents
vii
viii Contents
Shoshana Abramovich
n
F (a2i−1 , a2i ) , (a) ∈ R2n
i=1
and of
n
F (ai , ai+1 ) , an+1 = a1 , (a) ∈ Rn
i=1
1 Introduction
We deal here with the minimum and the maximum of ni=1 F (a2i−1 , a2i ) , (a) ∈
R2n and ni=1 F (ai , ai+1 ) , where an+1 = a1 , (a) ∈ Rn when F (x, y), (x, y) ∈ R2
is L-superadditive function. These extrema are obtained by using rearrangement
techniques. The results are used in proving Jensen-type inequalities.
In [5], the authors prove the following theorem:
S. Abramovich ()
Department of Mathematics, University of Haifa, Haifa, Israel
∂
Corollary 1 ([7]) Let F have second partial derivatives. Then, ∂y F (x, y) is
∂2
increasing in x, which is equivalent to ∂x∂y F (x, y) ≥ 0, if and only if F is L-
superadditive function.
For clarity, R+ and R++ are [0, ∞) and (0, ∞), respectively.
In the sequel, we show that the following arrangements of a given set of real
numbers have a role in getting our extrema.
Definition 2 For any (x) = (x1 , . . . , xn ) ∈ Rn , let
x[1] ≥ . . . ≥ x[n]
x(1) ≤ . . . ≤ x(n)
x1 ≤ xn ≤ x2 ≤ . . . ≤ x[(n+2/2)] (1)
Rearrangements, L-Superadditivity and Jensen-Type Inequalities 3
or if
Definition 5 ([4, 6]) A set (x) is arranged in circular symmetrical order if one of
its circular rearrangements is symmetrically decreasing.
Definition 6 ([4]) An ordered set (x) = (x1 , . . . , xn ) of n real numbers is arranged
in an alternating order if
or if
n
n
F x(i) , x[i] = F x(i) , x(2n−i+1) (6)
i=1 i=1
n
≤ F (x2i−1 , x2i )
i=1
n
n
≤ F x(2i−1) , x(2i) = F x[2i−1] , x[2i]
i=1 i=1
hold when x↑ = x(1) , x(2) , . . . , x(2n−1) , x(2n) is
the increasing
rearrangement
of (x) =(x1 , x2 , . . . , x2n−1 , x2n ), and x↓ = x[1] . . . x[2n] is the decreasing
rearrangement of (x).
Proof We first prove that the minimum of ni=1 F (x2i−1 , x2i ) is obtained when
x2i−1 = x(i) , i = 1, . . . , n and x2i = x(2n−i+1) , i = 1, . . . , n.
We may assume that x1 = x(1) . If x2 = x(2n) , and x(2n) appears as x2j −1 or x2j ,
we may assume that x2j = x(2n) because of the symmetry of F (u, v). We now rear-
range (x) = (x1 , x2 , . . . , x2n−1 , x2n ) and get x = x1 , x2 , . . . , x2n−1 , x2n =
x(1) , x(2n) , . . . , x2j −1 , x2 , x2j +1 , x2j +2 , . . . , x2n . We exchange here only the loca-
tions of x2 with x2j = x(2n) and compute the difference
n
n
F (x2i−1 , x2i ) − F x2i−1 , x2i (7)
i=1 i=1
= F x(1) , x2 + F x2j −1 , x(2n) − F x(1) , x(2n) + F x2j −1 , x2
= F x2j −1 , x(2n) − F x2j −1 , x2 − F x(1) , x(2n) − F x(1) , x2 .
As x2j −1 ≥ x(1) and x(2n) ≥ x2 , we get by using the conditions of the theorem on
G (u, v, w) that
F x2j −1 , x(2n) − F x2j −1 , x2 ≥ F x(1) , x(2n) − F x(1) , x2 . (8)
n
n
F (x2i−1 , x2i ) ≥ F x2i−1 , x2i .
i=1 i=1
As a result, we get that the two terms x(1) and x(2n) appear as F x(1) , x(2n) in
n n
i=1 F x2i−1 , x2i without increasing the sum i=1 F (x2i−1 , x2i ). We continue
now with the other 2n − 2 terms in x and by the same procedure bring x(2) and
Rearrangements, L-Superadditivity and Jensen-Type Inequalities 5
x(2n−1) next to each other in F . After at most n steps, we get the left-hand side of
inequalities of (6).
To get the maximum of ni=1 F (x2i−1 , x2i ), we use the same procedure as in
the proof of its minimum.
Without loss of generality, we may assume that the minimal term in (x) is
x1 = x(1) . If x2 = x(2) , but x2j = x(2) , we create a new rearrangement x
= x1 , x2 , . . . , x2n−1 , x2n in which x2 = x(2) = x2j , and x2j = x2 , and all other
terms are as in (x).
We compute now the difference
n
n
F x2i−1 , x2i − F (x2i−1 , x2i ) (9)
i=1 i=1
= F x(1) , x(2) + F x2j −1 , x2 − F x(1) , x2 + F x2j −1 , x(2)
= F x2j −1 , x2 − F x2j −1 , x(2) − F x(1) , x2 − F x(1) , x(2) .
n
n
F x2i−1 , x2i − F (x2i−1 , x2i ) ≥ 0,
i=1 i=1
which means that the two smallest terms x(1) and x(2) appear as F x(1) , x(2) in
n n
i=1 F x2i−1 , x2i without decreasing i=1 F (x2i−1 , x2i ).
Repeating now the procedure by bringing the two minimal terms x(3) and x(4) of
the remaining 2n − 2 xi th to be in the same F . After at most n similar steps, we get
the right-hand side of inequalities of (6).
This completes the proof of the theorem.
It is easy to see that the following functions satisfy Theorem 1.
Example 1 Let F (u, v) = 1
uv+1 , then according to Theorem 1, we get by simple
computations that
n
1
n
1 n
1
≤ ≤
x(i) x(2n+1−i) + 1 x2i−1 x2i + 1 x(2i−1) x(2i) + 1
i=1 i=1 i=1
∂F (v, u) ∂F (v, w)
≤
∂v ∂v
for u ≤ min (w, v).
Then, for any set (x) = (x1 , x2 , . . . , xn ) , α ≤ xi ≤ β, i = 1, . . . , n, given except
its arrangements, the sum
n
F (xi , xi+1 ) , xn+1 = x1 ,
i=1
x+y x−y 2
Case (d) F (x, y) = f 2 +C× 2 , where the constant C satisfies
xm +xj
C ≤ ϕ 2 , with 0 ≤ xm ≤ xj ≤ xi , i = m, j, i = 1, . . . , n, and
f (x) = xϕ (x) , and ϕ is twice differentiable and convex function on 0 ≤ x ≤ b.
x−y 2
Case (e) F (x, y) = f x+y 2 + ϕ x+y 2 2 , where ϕ and ϕ are twice
differentiable and convex on R+ and f (x) = xϕ (x).
Also, it has been proved lately in [2] that F (x, y) = xϕ yx + yϕ xy when ϕ is
concave on R+ and lim xϕ (x) − ϕ (x) = 0 and in particular when F (x, y) =
x→0+
x s y t + x t y s , x, y, t, s ∈ R+ satisfy Theorem 2.
Theorem 2.7]) If ϕ is a concave differentiable function on R+ and
4 ([2, Theorem
lim xϕ (x) − ϕ (x) = 0. Then, the inequalities
x→0+
n
xi+1 xi
xi ϕ + xi+1 ϕ (11)
xi xi+1
i=1
n
xi+1 xi
≤ xi ϕ + xi+1 ϕ
xi xi+1
i=1
n
xi+1 xi
≤ xi ϕ + xi+1 ϕ
xi xi+1
i=1
n
t s
xi xi+1 + xi+1
t
xis (12)
i=1
n
s t
≤ xi xi+1 + xi+1
t
xis
i=1
n
t s
≤ xi xi+1 + xi+1
t
xis ,
i=1
(b) If s ≤ 0, t ≥ 0, the reverse of (12) holds for (x) ∈ Rn++ . In particular, the
reverse of (12) holds when t + s = 1, t ≥ 1.
Remark 2 It is easy to verify that in addition to Examples 1 and 2, the functions
F (x, y), which appear in Theorem 3 cases (a), (d) and (e), Theorem 4 and Corollary
2 F (x,y)
2, are twice differentiable L-superadditive functions satisfying ∂ ∂x∂y ≥ 0, and
therefore also Theorem 1 holds.
Using the results of Sect. 2, we get in this section Jensen-type inequalities. The
methods employed here can be obtained similarly to those derived in [4, Section 3]
and [2] using Theorem 3 [4, Theorem 2].
We demonstrate and prove two refinements of Jensen-type inequalities and quote
one from [4]. For more inequalities related to Theorem 2, see [4, Section 3] and [2,
Theorem 2.11].
We first refine the Jensen inequality for convex function f : I → R, I ⊂ R,
which reads
n
n
ai f (xi ) ≥ f ai xi
i=1 i=1
n
for all ai ≥ 0, xi ∈ I , i = 1, . . . , n, i=1 ai = 1. The refinement is obtained by
using Theorem 1 for the L-superadditive function F (x, y) = f (x + y) when f is
a convex function.
Theorem 5 Let f be a convex function on an interval, and let (x1 , . . . , x2n ) be a
given 2n real numbers. Then,
1
2n n
f (xi ) x(2i−1) + x(2i)
≥ f (13)
2n n 2
i=1 i=1
1 1
n n
x2i−1 + x2i x(i) + x(2n+1−i)
≥ f ≥ f
n 2 n 2
i=1 i=1
2n
i=1 xi
≥f .
2n
2n f (xi ) +f x
= n1 ni=1 ( (2i−1) )2 ( (2i) ) , as a result
f x
Proof From the identity i=1 2n
of Jensen inequality, we get the first inequality in (13), and because of the L-
superadditivity of F (x, y) = f (x + y), we get the second and third inequalities
Rearrangements, L-Superadditivity and Jensen-Type Inequalities 9
of Equation (13). The last inequality follows again from the Jensen inequality for
convex functions.
We quote now some definitions and lemmas that we need for the theorems
presented below.
The following is a definition of the Jensen-type inequality for strongly convex
functions with modulus C.
Definition 8 ([9]) Let n ∈ N. The function f : I → R, I ⊂ R, is called strongly
convex
n with modulus C if for all xi ∈ I , and all ai ≥ 0, i = 1, . . . , n, such that
i=1 ai = 1, the Jensen-type inequality
n
n
ai f (xi ) − f (x) ≥ C ai (xi − x)2 ,
i=1 i=1
n
where C ≥ 0 and x = i=1 ai xi , holds.
Definition 9 ([3]) A real-valued function ψ1 defined on an interval [a, b) with 0 ≤
a < b ≤ ∞ is called 1-quasiconvex if it can be represented as the product of a
convex function ϕ and the function p (x) = x.
Corollary 3 A 1-quasiconvex function ψ1 , as defined in Definition 9, satisfies the
inequalities
n
n
ai ψ1 (xi ) ≥ ψ1 (x) + ϕ (x) ai (xi − x)2 (14)
i=1 i=1
n
≥ ψ1 (x) + C ai (xi − x)2 ,
i=1
where C ≤ min ϕ (xi ), ai ≥ 0, i = 1, . . . , n, ni=1 ai = 1 and x = ni=1 ai xi .
If, in addition, ϕ is increasing, then ψ1 is also a strongly convex function.
Theorems 6, 7 and 8 show the use of rearrangements for refinements of Jensen-
type inequality for 1-quasiconvex functions by using Corollary 1 and Theorem 1 for
the function
2
x+y x+y x−y
F (x, y) = f +ϕ ,
2 2 2
when f (x) = xϕ (x) and where ϕ and ϕ are convex. In this case, F (x, y) is L-
superadditive and therefore satisfies Theorem 1 as well as Theorem 2.
Theorem 6 Let xi , i = 1, . . . , 2n, n ∈ N, be a sequence of real non-negative
numbers, and let ϕ and ϕ be convex on R+ and f (x) = xϕ (x), x ∈ R+ . Then,
10 S. Abramovich
2n
denoting x = 1
2n j =1 xj , it yields that
(15)
2n
2n
1
f (xi ) − (2n − 1) f (x) − (2n − 1) ϕ (x) (xi − x)2
2n
i=1 i=1
1
n
x(2i−1) + x(2i) x(2i−1) + x(2i) x(2i) − x(2i−1) 2
≥ f +ϕ
n 2 2 2
i=1
1
n
x2i−1 + x2i x2i−1 + x2i x2i − x2i−1 2
≥ f +ϕ
n 2 2 2
i=1
1
n
x(i) + x(2n+1−i) x(i) + x(2n+1−i) x(2n+1−i) − x(i) 2
≥ f +ϕ .
n 2 2 2
i=1
If also
(16)
1
n
x(2i−1) + x(2i) x(2i−1) + x(2i) x(2i) − x(2i−1) 2
f +ϕ
n 2 2 2
i=1
1 2n
≥ f (x) + ϕ (x) (xi − x)2 ,
2n
i=1
then
2n
2n
f (xi ) − 2nf (x) − ϕ (x) (xi − x)2 (17)
i=1 i=1
1
n
x(2i−1) + x(2i) x(2i−1) + x(2i) x(2i) − x(2i−1) 2
≥ f +ϕ
n 2 2 2
i=1
2n
1
−f (x) − ϕ (x) (xi − x)2 ≥ 0
2n
i=1
Proof
2n
2n
f (xi ) = f x(i) (18)
i=1 i=1
1 2n − 1
2n 2n
= f x(i) + f (xi )
2n 2n
i=1 i=1
1 f x(2i−1) + f x(2i) 2n − 1
n 2n
= + f (xi )
n 2 2n
i=1 i=1
n
1 x(2i−1) + x(2i) x(2i−1) + x(2i)
≥ f +ϕ
n 2 2
i=1
x(2i) − x(2i−1) 2
×
2
2n − 1
2n
+ f (xi )
2n
i=1
1
n
x2i−1 + x2i x2i−1 + x2i x2i − x2i−1 2
≥ f +ϕ
n 2 2 2
i=1
2n − 1
2n
+ f (xi )
2n
i=1
n
1 x(i) + x(2n+1−i) x(i) + x(2n+1−i)
≥ f +ϕ
n 2 2
i=1
x(2n+1−i) − x(i) 2
×
2
2n − 1
2n
+ f (xi ) .
2n
i=1
2n
f (xi )
i=1
1
n
x(2i−1) + x(2i) x(2i−1) + x(2i) x(2i) − x(2i−1) 2
≥ f +ϕ
n 2 2 2
i=1
2n − 1
2n
+ f (xi )
2n
i=1
1
n
x(2i−1) + x(2i) x(2i−1) + x(2i) x(2i) − x(2i−1) 2
≥ f +ϕ
n 2 2 2
i=1
2n
1
+ (2n − 1) f (x) + ϕ (x) (xi − x) 2
2n
i=1
1
n
x2i−1 + x2i x2i−1 + x2i x2i − x2i−1 2
≥ f +ϕ
n 2 2 2
i=1
2n
1
+ (2n − 1) f (x) + ϕ (x) (xi − x)2
2n
i=1
1
n
x(i) + x(2n+1−i) x(i) + x(2n+1−i) x(2n+1−i) − x(i) 2
≥ f +ϕ
n 2 2 2
i=1
2n
1
+ (2n − 1) f (x) + ϕ (x) (xi − x)2
2n
i=1
i = 1, 2, 3, 4,
1
2
x(2i−1) + x(2i) x(2i−1) + x(2i) x(2i) − x(2i−1) 2
f +ϕ
2 2 2 2
i=1
1 4
≥ f (x) + ϕ (x) (xi − x)2 ,
4
i=1
n
n
1
f (xi ) − (n − 1) f (x) − (n − 1) ϕ (x) (xi − x)2
n
i=1 i=1
2
1
n
xi + xi+1 xi + xi+1 xi − xi+1
≥ f +ϕ
n 2 2 2
i=1
2
1
n
xi + xi+1 xi + xi+1 xi − xi+1
≥ f +ϕ
n 2 2 2
i=1
2
1
n
xi + xi+1 xi + xi+1 xi − xi+1
≥ f +ϕ ,
n 2 2 2
i=1
1 n
≥ f (x) + ϕ (x) (xi − x)2 ,
n
i=1
14 S. Abramovich
then
n
n
f (xi ) − nf (x) − ϕ (x) (xi − x)2
i=1 i=1
1
n
xi + xi+1 xi + xi+1 xi − xi+1 2
≥ f +ϕ
n 2 2 2
i=1
n
1
−f (x) − ϕ (x) (xi − x)2 ≥ 0.
n
i=1
then
n n 2
n
j =1 xj
n
j =1 xj
f (xi ) − nf −C× xi −
n n
i=1 i=1
1
n
xi + xi+1 xi − xi+1 2
≥ f +C×
n 2 2
i=1
⎛ n 2 ⎞
n
=1 xj n
1 =1 xj
− ⎝f ⎠.
j j
+C xi −
n n n
i=1
References
n−1
f (x + bk y) = nf (x),
k=0
using a new version of Brzdȩk’s fixed point theorem. In addition, we prove some
hyperstability results for the considered equation and the general inhomogeneous
Jensen equation
n−1
f (x + bk y) = nf (x) + G(x, y).
k=0
In the middle of the 1960s, S. Gähler [10, 11] introduced the basic concepts of linear
2-normed spaces. In the following definitions and lemmas, we present some facts
concerning the linear 2-normed spaces.
x, y R2 = |x1 y2 − x2 y1 | .
lim xk − x, y = 0,
k→∞
lim xk − xl , y = 0,
k,l→∞
for all z ∈ X.
Approximate Generalized Jensen Mappings in 2-Banach Spaces 19
operator equation
lim Λδn = 0
n→∞
lim δn = 0.
n→∞
where Δ : Y X × Y X → RX
+ is a mapping which is defined by
Δ(ξ, μ)(x) := d ξ(x), μ(x) ξ, μ ∈ Y X , x ∈ X. (3)
and
ε∗ (x) := Λn ε (x) < ∞ (5)
n∈N0
for all x ∈ X.
In 2013, Brzdȩk [4] gave the fixed point result by applying Theorem 1 as follows:
Theorem 2 Let X be a nonempty set, (Y, d) a complete metric space, and
f1 , . . . , fs : X → X and L1 , . . . , Ls : X → R+ be given mappings. Let Λ : RX
+ →
RX
+ be a linear operator defined by
s
Λδ(x) := Li (x)δ(fi (x)), (9)
i=1
for δ ∈ RX
+ and x ∈ X. If T : Y → Y is an operator satisfying the inequality
X X
s
d Tξ(x), Tμ(x) ≤ Li (x)d ξ(fi (x)), μ(fi (x)) , ξ, μ ∈ Y X , x ∈ X,
i=1
Approximate Generalized Jensen Mappings in 2-Banach Spaces 21
∞
ε∗ (x) := Λk ε(x) < ∞, (x ∈ X),
k=0
r
Tξ(x) − Tμ(x), g(z) ≤
Li (x)ξ fi (x) − μ fi (x) , g(z) (10)
i=1
r
Λδ(x, z) := Li (x)δ fi (x), z , δ ∈ RX×X
+ , x, z ∈ X. (11)
i=1
and
∞
n
ε∗ (x, z) := Λ ε (x, z) < ∞ (13)
n=0
22 M. Almahalebi et al.
for all x, z ∈ X.
There are two other versions of Theorem 3 in 2-Banach space given in [1] and
[6]. In addition, Brzdȩk et al. [7] gave important related results in generalized metric
spaces. In this chapter, we discuss the generalized Hyers-Ulam-Rassias stability
problem for the following generalization of Jensen functional equation:
n−1
f (x + bk y) = nf (x), (17)
k=0
Theorem 3 as a basic tool. The general solution and stability of this equation and its
generalizations were studied by numerous researchers; see, for example, [3, 8, 9, 14]
and [17].
2 Main Results
Let X be a complex normed space. We will denote by Aut (X) the family of all
automorphisms of X. Moreover, for each u ∈ XX , we write ux := u(x) for x ∈ X,
and we define u by u x := x − ux for x ∈ X.
The following theorem is the main result concerning the stability of the functional
equation (17).
3
Theorem 4 Let X be a C-normed space, Y be a 2-Banach space, ε : X \ {0} →
R+ , and
l(X) := u ∈ Aut (X) : u , (u + bk u) ∈ Aut (X),
n−1
αu := nλ(u ) + λ(u + bk u) < 1 = ∅ (18)
k=1
Approximate Generalized Jensen Mappings in 2-Banach Spaces 23
where
λ(u) := inf t ∈ R+ : ε(ux, uy, z) ≤ tε(x, y, z), ∀x, y, z ∈ X \ {0}
u ◦ v = v ◦ u, ∀u, v ∈ U, (20)
where
ε(u x, ux, z)
ε̃(x, z) := inf :u∈U x, z ∈ X \ {0}.
1 − αu
Proof Write X0 := X \ {0}, and let us fix u ∈ U. Replacing x with u x and y with
ux in (19), we get
n−1
f (x) − nf (u x) + f (u + bk u)x , g(z) ≤ ε(u x, ux, z) := εu (x, z)
k=1
(22)
0 ×X0
for all x, z ∈ X0 . We define the operators Tu : Y X0 → Y X0 and Λu : RX
+ →
X0 ×X0
R+ by
n−1
Tu ξ(x) := nξ(u x) − ξ (u + bk u)x , (23)
k=1
n−1
Λu δ(x, z) := nδ u x, z + δ (u + bk u)x, z
k=1
24 M. Almahalebi et al.
0 ×X0
for all x, z ∈ X0 , ξ ∈ Y X0 and δ ∈ RX
+ . Then the inequality (22) becomes
f (x) − Tu f (x) , g(z) ≤ εu (x, z)
n−1
Tu ξ(x) − Tu μ(x) , g(z) = nξ(u x) − ξ (u + bk u)x − nμ(u x)
k=1
n−1
+ μ (u + bk u)x , g(z)
k=1
≤ nξ(u x) − μ(u x) , g(z)
n−1
+ ξ (u + bk u)x − μ (u + bk u)x , g(z)
k=1
n−1
αu = nλ(u ) + λ(u + bk u).
k=1
Hence,
∞
∞
ε(u x, ux, z)
ε∗ (x, z) := Λru εu (x, z) ≤ ε(u x, ux, z) αur = < ∞ (24)
1 − αu
r=0 r=0
Approximate Generalized Jensen Mappings in 2-Banach Spaces 25
n−1
Ju (x) = nJu (u x) − Ju (u + bk u)x (25)
k=1
n−1
r
T
u f (x + y) − nTu
r
f (x) + Tur f (x + bk y) , g(z) ≤ αur ε(x, y, z) (27)
k=1
n−1
r+1
Tu f (x + y) − nTur+1 f (x) + Tur+1 f (x + bk y) , g(z)
k=1
n−1
= nTu f u (x + y) + nTu f bk u(x + y) −
r r
Tur f (u + bk u)(x + y)
k=1
n−1
−n2 Tur f (u x) + n Tur f (u + bk u)x
k=1
n−1
n−1
+ nTru f u (x + bk y) − Tru f (u + bk u)(x + bk y) , g(z)
k=1 k=1
n−1
r
≤ n Tu f u (x + y) − nTu f (u x) +
r
Tu f u (x + bk y) , g(z)
r
k=1
26 M. Almahalebi et al.
n−1
r
− Tu f u + bk u)(x + y) − nTur f (u + bk u)x
k=1
n−1
+ Tur f (u + bk u)(x + bk y) , g(z)
k=1
n−1
≤ αur nε(u x, u y, z) + ε (u + bk u)x, (u + bk u)y, z
k=1
n−1
≤ αur nλ(u ) + λ(u + bk u) ε(x, y, z)
k=1
By induction, we have shown that (27) holds for all r ∈ N, all u ∈ U, and all
x, y, z ∈ X0 such that x + bk y = 0. Letting r → ∞ in (27), we get
n−1
Ju (x + bk y) = nJu (x)
k=0
with some L > 0 and v ∈ U is equal to Jw for each w ∈ U. So, fix v, w ∈ U, L > 0
and J : X → Y a solution of (17) satisfying (28). Note that, by (26) and (28), there
is L0 > 0 such that
for all x, z ∈ X0 . In other side, J and Jw are solutions of (25) because they satisfy
(17).
Approximate Generalized Jensen Mappings in 2-Banach Spaces 27
The case j = 0 is exactly (29). So fix γ ∈ N0 , and assume that (30) holds for
j = γ . Then, in view of definition of λ(u),
n−1
J (x) − Jw (x) , g(z) =
nJ (w x) − J (w + bk w)x
k=1
n−1
−nJw (w x) + Jw (w + bk w)x , g(z)
k=1
≤ nJ (w x) − Jw (w x) , g(z)
n−1
+ J (w + bk w)x − Jw (w + bk w)x , g(z)
k=1
∞
≤ n L0 ε(v w x, vw x, z) + ε(w w x, ww x, z) · r
αw
r=γ
n−1
+L0 ε v (w + bk w)x, v(w + bk w)x, z
k=1
∞
+ε w (w + bk w)x, w(w + bk w)x, z · r
αw
r=γ
n−1 ∞
≤ L0 ε(v x, vx, z) + ε(w x, wx, z) nλ(w ) + λ(w + bk w) · r
αw
k=1 r=γ
∞
= L0 ε(v x, vx, z) + ε(w x, wx, z) · r
αw .
r=γ +1
ε(u x, ux, z)
f (x) − Jw (x) , g(z) ≤ x, z ∈ X0 , u ∈ U.
1 − αu
n−1
f (x + bk y) = nf (x),
k=0
for all x, y ∈ X0 such that x + bk y = 0 for 0 < k < n − 1 which implies that f
satisfies the functional equation (17) on X0 .
3 Applications
In this section, we discuss some hyperstability results for Eq. (17) and the inhomo-
geneous functional equation
n−1
f (x + bk y) = nf (x) + G(x, y). (33)
k=0
Namely, from Theorems 4 and 5, we can obtain the following corollaries as natural
results.
Approximate Generalized Jensen Mappings in 2-Banach Spaces 29
where g : X → Y is a mapping such that the set g(X) ⊆ Y contains two linearly
independent vectors, G(x0 , y0 ) = 0 for some x0 , y0 ∈ X0 , and there exists a
nonempty U ⊂ l(X) such that (20) and (32) hold. Then the inhomogeneous equation
n−1
f (x + bk y) = nf (x) + G(x, y) (35)
k=0
for all x, y ∈ X0 such that x + bk y = 0 for 0 < k < n − 1 has no solutions in the
class of functions f : X → Y .
Proof Suppose that f : X → Y is a solution to (35). Then
n−1
f (x + bk y) − nf (x) , g(z) = nf (x) + G(x, y) − nf (x) , g(z)
k=0
= G(x, y) , g(z)
≤ ε(x, y, z),
n−1
G(x0 , y0 ) = f (x0 + bk y0 ) − nf (x0 ) = 0,
k=0
which is contradiction.
Corollary 2 Let X, Y , and ε be as in Theorem 4. Assume that G : X2 → Y and
f : X → Y satisfy the inequality
n−1
f (x + y) − nf (x) + f (x + bk y) − G(x, y) , g(z) ≤ ε(x, y, z) (36)
k=1
n−1
n−1
n−1
f (x + bk y) − nf (x) − G(x, y) = J (x + bk y) + f0 (x + bk y)
k=0 k=0 k=0
−nJ (x) − nf0 (x) − G(x, y)
= 0,
for all x, y ∈ X0 such that x + bk y = 0 for 0 < k < n − 1 which means that f is a
solution to (35).
Corollary 3 Let X and Y be a C-normed space and a 2-Banach space, respectively.
Assume that p, q ∈ R, p < 0, q < 0 and θ, r ≥ 0. If f : X → Y satisfies
n−1
f (x + bk y) − nf (x) , g(z) ≤ θ x p
+ y q
z r
(37)
k=0
ε(x, y, z) = θ x p
+ y q
z r, x, y, z ∈ X0 ,
with some real numbers θ, r ≥ 0, p < 0, and q < 0. For each m ∈ N, define
um : X0 → X0 by um x := −mx and um : X0 → X0 by um x := (1 + m)x. Then
=θ −mx p
+ −y q
z r
= θ mp x p
+ q y q
z r
≤ mp + q θ x p + y q
z r
= mp + q ε(x, y, z)
for all x, y, z ∈ X0 such that x +bk y = 0. Then (32) is valid with λ(um ) = mp +mq
for m ∈ N, and there exists n0 ∈ N such that m ≥ n0 and
n−1
n (1 + m)p + (1 + m)q + 1 + m + bk mp + 1 + m + bk mq < 1.
k=1
for all x, y, z ∈ X0 such that x + bk y = 0 for 0 < k < n − 1, then f satisfies the
functional equation (17) on X0 .
Proof It is easily seen that the function ε given by
ε(x, y, z) = θ x p
y q
z r
x, y, z ∈ X\{0}
ε(mx, y, z) = θ mx p
y q
z r
= θ mp q x p
y q
z r
= mp q ε(x, y, z)
ε(x, y, z) = θ x p
+ y q
+ x p
y q
z r
x, y, z ∈ X0 ,
Other documents randomly have
different content
a warehouse on land to facilitate the passage of the floating
warehouses of their vessels” according to a contemporary report.
We can visualize the busy river front at this point on the east bank,
with merchants plying back and forth in skiffs, and larger batteaux
bringing loads of the high quality English goods, including cloth,
cutlery, farming utensils—and slaves. New Orleans businessmen who
dared not indulge in this illicit trade protested to the Spanish
authorities who continued to wink at the British until the American
revolution made anti-British sympathies fashionable. Then Bernardo
Galvez, the Spanish governor, on April 17, 1777, seized the English
boats and warehouses, and the illegal trade stopped. But it is safe to
assume that the commercial identity of what became Lafayette’s
riverfront persisted, perhaps even its later competition with New
Orleans having begun in that early illicit trade.
The good business prospects in Lafayette caused men to say that the
city might possibly “capture” New Orleans some day. The Texas cattle
trails ended their long treks over the prairies at Gretna. Cattle boats
brought the Stock across the river to the slaughter houses with
special landings for the pounding, snorting beasts, skittering down
the gangplanks into the pens, as if entirely cognizant that the end of
the trail had come now for certain.
If one could stand the smell, it was a curious and exciting vista
watching the steamboats unload cattle at Lafayette. Satellite
industries lined the river front, the tallow renderers, the soap-boilers,
the hide merchants, the tanners, the disposers of unused parts, and
the bone grinders, whose odoriferous products made tasty 13
vegetables and sweet sugar cane grow, paradoxical as that
seemed.
At first, 80-foot sections of the river front had been set aside for the
flatboats, once delivered of their cargoes, to be broken up. But this
became a nuisance, and by 1845, it was forbidden along the entire
Lafayette river front.
There was always a ready market for the timbers from broken up
flatboats, or “gunwales”, as the long, heavy fore-and-aft planks were
called. Many of the early houses were built of these excellent,
weathered timbers from the virgin forests of the upper valley. Most of
the streets of Lafayette, until after the mid-nineteenth century, were
“paved” with them, as were the sidewalks, or “banquettes”. The long
boards would not disappear so quickly into the mud, as would rocks
and bricks. Numerous cottages remaining in various sections of New
Orleans near the river are built of these sturdy, enduring timbers.
Lafayette was the scene of a celebrated legal case involving large and
valuable sections of the city, second in local court annals only to the
Gaines litigation. The original name of the faubourg which later
became known as Lafayette was Faubourg Panis, after its owner, the
Widow Panis. She first had this property subdivided into lots and
streets. Her daughter Mme. Rousseau, a widow, inherited the
faubourg. In 1818 she sold the remaining property for $100,000 to
John Poultney, who died before he could pay for it. His creditors, who
had advanced him part of the money to make the purchase, paid the
notes and proceeded to sell lots in honest belief of clear title.
Poultney’s wife, on behalf of herself and her minor children, had
renounced their rights to the property. The name of the faubourg was
changed at that time to Lafayette, in honor of the French patriot who
had visited New Orleans.
Later the Poultney heirs claimed that their tender age and legal
incapacity prevented them from accepting the property at the time of
the succession. The suit was instigated in 1832 and rambled through
the courts until 1855 when the United States Supreme Court upheld
the Louisiana tribunal against the plaintiffs. Interestingly, one of the
disappointed claimants was the then Major G. T. Beauregard,
engineer in charge of construction of the New Orleans Customhouse.
Mrs. John Poultney had been Emilie Toutant-Beauregard.
The city was not without its theatrical attractions. The only actual
theater built for stage presentations was the Lafayette on Rousseau
between Philip and Soraparu Streets. It was in the center of the
block, on the lake side, directly across from Terpsichore Hall, the
favorite salle à danser. The theater opened in late December, 1848,
and according to the Statesman, “has already increased property
values near it.” It had 100 feet of depth, was 55 feet wide, 40 15
feet high, and its stage was 35 feet deep, said the newspaper
account. Sol Smith, one of the pioneer actors who penetrated the
“frontier” communities from the East, along with Noah Ludlow and
his troupe, played the Lafayette and left this comment, dated
February, 1849:
“I had a fellow feeling for this manager, and when he asked me to act
one night for him, assuring me that I could fill the house at double
prices, I could not refuse him, though I doubted very much whether
my acting would add anything to his receipts. Manager Oliver was
right, however, and I had the pleasure of playing the Mock Duke in
the Honey Moon to one of the most crowded audiences I have ever
acted to. Of course, under the circumstances, I would take no pay for
my night’s services, though the grateful manager offered me a clear
half of the receipts.
“The season failed totally, the manager left for parts unknown and
next season, after a vain attempt by one Hickey to resuscitate the
drama by presenting some horrible representations (or
misrepresentations rather) of Yankee character, the theater took fire
one day and was burned to the ground. Lafayette is too near New
Orleans to give an efficient support to the theater.”
“Such is the demand for lots,” continued McMillin, “in the back part of
the city that they are selling for nearly double the price of those three
or four squares from the river. Lots on or near the railroad (St.
Charles Avenue) sell for $1,800. Those on Jersey (Annunciation),
$800 or $900. Cheapest lots are on Jersey and Laurel Streets.
The appearance of the Greek Revival mansions now rising from the
vicinity of Nayades and in toward Magazine supported the claim that
at this time, New Orleans had more per capita wealth than New York.
It appears from the best sources that the first house of consequence
to be built in what is now the Garden District proper was that of
Thomas Toby in 1838. He came from Philadelphia, and his father’s
ships brought some of the materials for the house from his native
city. This house is still standing at Prytania and First Streets. Others
who built in the same general neighborhood in the following decade
were F. B., T. B., and Charles Conrad, P. N. Wood, Judge R. F. Ogden,
Captain Thomas Ivey, and Charles Briggs. The Fifties saw the
greatest activity of construction of the great houses of the Garden
District.
This section, peopled as it was chiefly by those who conducted their
businesses in New Orleans, but who enjoyed the shaded gardens for
their residences, rapidly developed a life apart from the teeming
waterfront of Lafayette City. Inevitably a rivalry began. The catalyst
was the constant annoyance of pounding hooves and the odors of
the slaughterhouses and tanneries. Eventually, the early residents of
the Garden District were instrumental in getting the Lafayette City
Council to pass restrictive measures which removed the cattle
landing. The important commerce of this trade moved upriver to the
neighboring town of Jefferson, which caused the fiery editor of the
Spectator, the outspoken champion of the city’s growth, to howl from
his columns that the city had lost a million and a half dollars in trade
a year by this act.
In the early days of Lafayette and the Garden District, “the war”
referred only to the very real and fresh memories of Jackson’s battle
with the British at Chalmette hardly twenty years previously. In the
Forties, it referred to the War with Mexico, in which many Lafayette
citizens took part. Troops were encamped and trained on some of the
vacant lots. The Rev. Jerome Twichell held Presbyterian services for
them, and a government warehouse near the river on Washington
dispensed supplies to troops coming down the Mississippi for Mexican
service.
After the war two other prominent figures in the Confederacy were
closely associated with the Garden District. Jefferson Davis often
visited his friend Judge Charles Fenner and died in the Fenner 18
house on the corner of First and Camp Streets. General John B.
Hood, “The Gallant Hood”, had his family home on the corner of Third
and Camp.
Bishop Leonidas Polk of Trinity Church became Confederate general.
19
House erected in 1860, said to have been built by James Robb for his
daughter, at corner Washington, Camp.
House as it appears today, with galleries, ironwork added in 1870’s.
“... when I rode through the Garden District—the new part of the
town—my lady friends pointed to the galleries and said: ‘You should
see them in the summer, before the people leave or after they come
back. The entire population is out-of-doors in the air, and the galleries
are loaded with women in soft colors, mainly white. They have white
dresses by the dozen. They go about without their hats, in carriages
and in street cars, visiting up and down the streets. In-doors, one
must spend one’s whole time and energy in vibrating a fan.’”
Writing of the Garden District, Mark Twain said: “All the dwellings are
of wood ... and all have a comfortable look. Those in the wealthy
quarter are spacious; painted snowy white, usually, and generally
have wide verandas, or double-verandas, supported by ornamental
columns. These mansions stand in the center of large grounds and
rise, garlanded with roses, out of the midst of swelling masses of
shining green foliage and many-colored blossoms. No houses could
well be in better harmony with their surroundings, or more pleasing
to the eye, or more home-like and comfortable-looking....”
“The galleries are loaded with women in soft colors, mainly white.”
George Washington Cable, who is credited with introducing the
French Quarter’s charms to the world, was born on Annunciation
Square, just below Lafayette City and later grew up and spent many
years in various homes in the Garden District. Cable was
internationally celebrated in his day for his Creole stories. His house
on Eighth Street, between Chestnut and Coliseum, still standing
today, was a mecca for visiting authors. Public education had its start
in Lafayette City shortly before it was started in New Orleans.
However, Cable gives a delightful glimpse of the wild carefree
youngsters of Lafayette in the 1830’s before the free 21
educational institutions were established:
Mark Twain and George W. Cable posed for this picture during a
lecture tour. Twain wrote of evening at Cable’s Eighth Street home.
“... The mass of educable youth—the children who played ‘oats, peas,
beans’ with French, German and Irish accents, about the countless
sidewalk doorsteps of a city of one and two-story cottages (it was
almost such); the girls who carried their little brothers and sisters on
one elbow and hip and stared in at weddings and funerals; the boys
whose kite-flying and games were full of terms and outcries in
mongrel French, and who abandoned everything at the wild clangor
of bells and ran to fires where volunteer firemen dropped the hose
and wounded and killed each other in pitched battles; the ill-kept lads
who risked their lives daily five months of the year swimming in the
yellow whirlpools of the Mississippi among the wharves and flat-
boats, who, naked and dripping, dodged the dignified police that
stalked them among the cotton bales, who robbed mocking-birds’
nests and orange and fig trees, and trapped nonpareils and cardinals,
orchard-orioles and indigo-birds in the gardens of Lafayette and the
suburban fields—these had not been reached and had not been
sought by the educator.”
Great sports figures knew the Garden District. The Southern Athletic
Club, at Washington Avenue and Prytania Street, now Behrman
Gymnasium, was a center of athletic endeavor for the elite of the
area, and its volunteer military units had headquarters there. Among
the sports luminaries who used its facilities was the great Jake Kilrain.
He trained there in 1889 for his bout with John L. Sullivan at
Richburg, Miss. In 1892 “Gentleman Jim” Corbett trained there for his
celebrated fight with Sullivan at the Olympic Club, and to the
Southern he returned triumphant for a victory celebration. The S.A.C.
had New Orleans’ first Turkish bath. In 1878, the Lawn Tennis Club
had the city’s first tennis court at Jackson Avenue and Prytania.
The most discussed showplace in an area of palatial homes was the
Renaissance-inspired house of James Robb on Washington Street,
now Avenue. His dream house deserved all the adjectives lavished
upon it. The one-story brick and plaster mansion was surrounded by
gardens rivalling those of Europe’s royal estates. He brought over a
German gardener to design and maintain them. Statuary by
European and American masters embellished the grounds.
24
High-resolution Map
A SKETCH OF THE PLAN OF THE
FAUBOURG LIVAUDAIS,
Drawn at the request of Messrs. L. PEIRCE, W.
H. CHASE, M. MORGAN and S. J. PETERS,
By B. BUISSON, Surveyor for the Parish of
Jefferson—March, 1832.
PRINTED BY BENJAMIN LEVY, CHARTRES-STREET.
27
LOUISE S. McGEHEE SCHOOL
2343 Prytania Street
A stroll around the grounds on the First Street side gives a good view
of the former servants’ wing, which extends to the rear, looking today
much as it did when the house was new. The beautiful grounds are
particularly lovely in the spring when myriads of azaleas are in bloom
as well as the large wisteria vine which drapes the arch of the front
gate. Aged and majestic are the many magnolia trees, the largest of
which some years ago was declared by E. H. Sargent, then curator of
the Arnold Arboretum, to be the most magnificent specimen of
magnolia grandiflora in the United States.