• Tidak ada hasil yang ditemukan

Directory UMM :Journals:Journal_of_mathematics:GMJ:

N/A
N/A
Protected

Academic year: 2017

Membagikan "Directory UMM :Journals:Journal_of_mathematics:GMJ:"

Copied!
8
0
0

Teks penuh

(1)

Volume 10 (2003), Number 1, 193–200

ON SOME CONVEXITY PROPERTIES OF GENERALIZED CES ´ARO SEQUENCE SPACES

SUTHEP SUANTAI

Abstract. We define a generalized Ces´aro sequence space and consider it equipped with the Luxemburg norm under which it is a Banach space, and we show that it is locally uniformly rotund.

2000 Mathematics Subject Classification: 46E30, 46E40, 46B20.

Key words and phrases: Generalized Ces´aro sequence spaces, Luxemburg norm, extreme point, locally uniformly rotund point, property (H), convex modular.

1. Preliminaries

For a Banach space X, we denote by S(X) and B(X) the unit sphere and unit ball of X, respectively. A point x0 ∈S(X) is called

a) an extreme point if for everyx, y ∈S(X) the equality 2x0 =x+y implies

x=y;

b) a locally uniformly rotund point(LUR-point for short) if for any sequence (xn) in B(X) such that kxn+xk →2 as n → ∞ there holds kxn−xk → 0 as n→ ∞;

c) an H-point if for any sequence (xn) in X such that kxnk → 1 as n → ∞, the weak convergence of (xn) to x0 (write xn

w

→x0) implies that kxn−xk →0 as n→ ∞.

A Banach space X is said to be rotund (R) if every point of S(X) is an extreme point.

If every x ∈ S(X) is a LUR-point, then X is said to be locally uniformly rotund (LUR).

X is said to possess property (H) provided every point ofS(X) is anH-point. For these geometric notions and their role in Mathematics we refer to the monographs [1], [6], [12] and [13]. Some of them were studied for Orlicz spaces in [1], [7], [8], [12] and [14].

LetX be a real vector space. A functional̺:X →[0,∞] is called amodular if it satisfies the conditions

(i) ̺(x) = 0 if and only if x= 0;

(ii) ̺(αx) =̺(x) for all scalar α with |α|= 1;

(iii) ̺(αx+βy)≤̺(x)+̺(y) for allx, y ∈Xand allα,β ≥0 withα+β= 1. The modular̺ is called convex if

(iv) ̺(αx+βy) ≤ α̺(x) +β̺(y) for all x, y ∈ X and all α, β ≥ 0 with α+β= 1.

(2)

If̺ is a modular in X, we define X̺=

©

x∈X : lim λ→0+

̺(λx) = 0ª ,

and X∗

̺ = ©

x∈X :̺(λx)<∞ for some λ >0ª .

It is clear that X̺⊆X̺∗. If ̺ is a convex modular, for x∈X̺ we define

kxk= infnλ >0 : ̺³x λ

´

≤1o. (1.1)

Orlicz [13] proved that if ̺is a convex modular in X, then X̺=X∗

̺ and k.|| is a norm on X̺ for which it is a Banach space. The norm k.kdefined as in (1.1) is called the Luxemburg norm.

A modular ̺ onX is called

(a) right-continuousif limλ→1+̺(λx) = ̺(x) for all x∈X̺;

(b) left-continuous if limλ→1−̺(λx) =̺(x) for all x∈X̺;

(c) continuous if it is both left-continuous and right-continuous.

The following known results gave some relationships between the modular ̺ and the Luxemburg norm k.k onX̺.

Theorem 1.1. Let ̺ be a convex modular on X and let x∈ X̺ and (xn) a sequence in X̺. Then kxn−xk →0 as n → ∞ if and only if ̺(λ(xn−x))→0 as n → ∞ for every λ >0.

Proof. See [11, Theorem 1.3]. ¤ Theorem 1.2. Let ̺ be a convex modular on X and x∈X̺.

(i) If ̺ is right-continuous, then kxk<1 if and only if ̺(x)<1. (ii) If ̺ is left-continuous, then kxk ≤1 if and only if ̺(x)≤1. (iii) If ̺ is continuous, then kxk= 1 if and only if ̺(x) = 1.

Proof. See [11, Theorem 1.4]. ¤ Let us denote by l0

the space of all real sequences. For 1 ≤ p < ∞, the Ces´aro sequence space (cesp, for short) is defined by

cesp = ½

x∈l0 :

X

n=1

³1 n

n X

i=1

|x(i)|´p <∞

¾

equipped with the norm

kxk= µ ∞

X

n=1

³1 n

n X

i=1

|x(i)|´p

¶1p .

(3)

Now let p = (pk) be a sequence of positive real numbers with pk ≥ 1 for all k ∈N.The Nakano sequence space l(p) is defined by

l(p) =© x∈l0

:σ(λx)<∞ for some λ >0ª ,

whereσ(x) =P∞

i=1|x(i)|

pi.We consider the space l(p) equipped with the norm kxk= infnλ >0 :σ³x

λ ´

≤1o

under which it is a Banach space. If p= (pk) is bounded, we have

l(p) = nx∈l0

:

X

i=1

|x(i)|pi <o.

Several geometric properties of l(p) were studied in [1] and [4]. The generalized Ces´aro sequence space ces(p) is defined by

ces(p) =©

x∈l0 :̺(λx)<∞ for some λ >0ª ,

where̺(x) = P∞

n=1( 1

n Pn

i=1|x(i)|)

pn.We consider this space equipped with the

so-called Luxemburg norm

kxk= infnλ >0 :̺³x λ

´

≤1o

under which it is a Banach space. If p= (pk) is bounded, we have

ces(p) = ½

x=x(i) :

X

n=1

³1 n

n X

i=1

|x(i)|´pn <∞

¾ .

W. Sanhan [15] proved that ces(p) is nonsquare when pk > 1 for all k ∈ N. In this paper, we show that the Ces´aro sequence space ces(p) equipped with the Luxemburg norm isLU R and has property (H) whenp= (pk) is bounded with pk>1 for all k ∈N.

Throughout this paper we assume that p= (pk) is bounded with pk >1 for allk ∈N, and M = supkpk.

2. Main Results

We begin by giving some basic properties of the modular ̺ on the space ces(p). By the convexity of the functiont→ |t|pk, for everykN we have that

̺ is a convex modular. So we have the following proposition.

Proposition 2.1. The functional ̺ on the Ces´aro sequence space ces(p) is a convex modular.

Proposition 2.2. For x ∈ ces(p), the modular ̺ on ces(p) satisfies the following properties:

(i) if 0< a < 1, then aM̺³x a

´

≤̺(x) and ̺(ax)≤a̺(x),

(ii) if a≥1, then ̺(x)≤aM̺³x a

(4)

Proof. All assertions are clearly obtained by the definition of ̺. ¤ Proposition 2.3. The modular ̺ on ces(p) is continuous.

Proof. Forλ >1, by Proposition 2.2 (ii) and (iii), we have

̺(x)≤λ̺(x)≤̺(λx)≤λM̺(x). (2.1) By taking λ → 1+

in (2.1), we have limλ→1+̺(λx) = ̺(x). Thus ̺ is

right-continuous. If 0< λ <1, by Proposition 2.2 (i), we have

λM̺(x)≤̺(λx)≤λ̺(x) (2.2) By taking λ → 1−

in (2.2), we have that limλ→1−̺(λx) = ̺(x), hence ̺ is

left-continuous. Thus ̺ is continuous. ¤

Next, we give some relationships between the modular ̺and the Luxemburg norm on ces(p).

Proposition 2.4. For any x∈ ces(p), we have (i) if kxk<1, then ̺(x)≤ kxk,

(ii) if kxk>1, then ̺(x)≥ kxk, (iii) kxk= 1 if and only if ̺(x) = 1, (iv) kxk<1 if and only if ̺(x)<1, (v) kxk>1 if and only if ̺(x)>1,

(vi) if 0< a < 1 and kx||> a, then ̺(x)> aM, and (vii) if a≥1 and kxk< a, then ̺(x)< aM.

Proof. If kxk ≤ 1 , it follows by the convexity and continuity of̺ that ̺(x) = ̺³kxk x

kxk

´

≤ kxk̺³ x

kxk

´

≤ kxk. So (i) is obtained. If kxk > 1, then there is ε0 > 0 such that kxk −ε > 1 for all ε ∈ (0, ε0). Consequently, ̺(x) =

̺³(kxk −ε) x

kxk −ε ´

≥ (kxk −ε)̺³ x

kxk −ε ´

>kxk −ε, so (ii) is satisfied. It is clear that (iii), (iv) and (v) follow by Theorem 1.2, and properties (vi) and

(vii) follow by Proposition 2.2. ¤

Proposition 2.5. Let (xn) be a sequence in ces(p). (i) If kxnk →1 as n→ ∞, then ̺(xn)→1 as n → ∞. (ii) kxnk →0 as n → ∞ if and only if ̺(xn)→0 as n→ ∞.

Proof. (i) Suppose kxnk → 1 as n → ∞. Let ǫ ∈ (0,1). Then there exists N ∈N such that 1ǫ < kxnk <1 +ǫ for all n ≥N. By Proposition 2.4 (vi) and (vii), we have (1−ǫ)M < ̺(xn) < (1 +ǫ)M for all n N, which implies that ̺(xn)→1 as n → ∞.

(ii) It follows from Theorem 1.1 that if kxnk →0 asn → ∞, then̺(xn)→0 as n → ∞. Conversely, suppose kxnk 6→ 0 as n → ∞. Then there is ǫ ∈ (0,1) and a subsequence (xnk) of (xn) such that kxnkk > ǫ for all k ∈ N. By

Proprosition 2.4 (vi), we have̺(xnk)> ǫ

M for allkN.This implies̺(xn)6→0

(5)

Proposition 2.6. Let (xn) ⊆ B(l(p)) and (yn) ⊆ B(l(p)). If σ³xn+yn 2

´

→ 1, then xn(i)−yn(i)→0 as n→ ∞ for all i∈N.

Proof. We first note that if x ∈ B(ℓ(p), then σ(x) ≤ 1. Supose that xn(i)−

y(i)6→0 as n → ∞for some i∈N. Without loss of generality we may assume thati= 1, and then assume without loss of generality (passing to a subsequence if necessary) that, for someǫ >0,

¯

¯xn(1)−yn(1)¯¯ p1

≥ǫ ∀n∈N.

Thus

2p1(|xn(1)|p1 +|yn(1)|p1)ǫ n N. (2.3)

Since the function t→ |t|p1 is uniformly convex, there existsδ >0 such that

¯ ¯ ¯

xn(1) +yn(1) 2

¯ ¯ ¯ p1

≤(1−δ)³|xn(1)|

p1 +|yn(1)|p1

2

´

∀n∈N. (2.4)

It follows from (2.3) and (2.4) that for each n∈N,

σ³xn+yn 2

´ =

X

i=1

¯ ¯ ¯

xn(i) +yn(i) 2

¯ ¯ ¯ pi

=¯¯ ¯

xn(1) +yn(1) 2

¯ ¯ ¯ p1

+

X

i=2

¯ ¯ ¯

xn(i) +yn(i) 2

¯ ¯ ¯ pi

≤(1−δ)³|xn(1)|

p1 +|yn(1)|p1

2

´ + 1

2

X

i=2

|xn(i)|pi+ 1

2

X

i=2

|yn(i)|pi

= 1

2σ(xn) + 1

2σ(yn)−δ

³|xn(1)|p1 +|yn(1)|p1

2

´

≤ 1

2+ 1 2−δ

ǫ

2p1+1 = 1−δ

ǫ 2p1+1.

This implies that σ³xn+yn 2

´

6→ 1 as n → ∞, a contradiction, which finishes

the proof. ¤

Proposition 2.7. Let(xn)⊆B(ces(p))andx∈S(ces(p)).If̺³xn+x 2

´

→1 as n → ∞, then xn(i)→x(i) as n→ ∞ for all i∈N.

Proof. For each n∈N and iN, let

sn(i) = (

(6)

Hence we have

1←̺³xn+x 2

´ =

X

k=1

³1 k

k X

i=1

¯ ¯ ¯

xn(i) +x(i) 2

¯ ¯ ¯

´pk

=

X

k=1

³1 k

k X

i=1

sn(i)xn(i)

2 +

1 k

k X

i=1

sn(i)x(i) 2

´pk

. (2.5)

Let an(k) = 1

k Pk

i=1sn(i)xn(i) and bn(k) = 1

k Pk

i=1sn(i)x(i) for all n, k ∈ N.

Then (an)∈l(p) and (bn)∈l(p), and from (2.5) we have

σ³an+bn 2

´

→1 as n→ ∞. Form Proposition 2.6 we have

an(i)−bn(i)→0 as n → ∞ (2.6)

for all i ∈ N. Now we shall show that xn(k) x(k) as n → ∞ for all k N. From (2.6) we have

sn(1)xn(1)−sn(1)x(1) →0 as n → ∞.

This implies xn(1)→x(1) as n→ ∞. Assume that xn(i)→x(i) as n→ ∞ for alli≤k−1.Then we have

sn(i)(xn(i)−x(i))→0 as n→ ∞ (2.7) for alli≤k−1.Sincesn(k)(xn(k)−x(k)) =k(an(k)−bn(k))−Pk−1

i=1 sn(i)(xn(i)−

x(i)), it follows from (2.6) and (2.7) that sn(k)(xn(k)−x(k))→ 0 as n → ∞. This implies xn(k) → x(k) as n → ∞. So we have by induction that xn(k) →

x(k) as n→ ∞ for all k ∈N. ¤

Theorem 2.8. The space ces(p) is LU R.

Proof. Let (xn) ⊆ B(ces(p)) and x ∈ S(ces(p)) be such that kxn+xk → 2 as n → ∞. Then °°

°

xn+x 2

° °

° → 1 as n → ∞. By Proposition 2.5 (i) we have ̺³xn+x

2 ´

→1 asn→ ∞.By Proposition 2.7 we havexn(i)→x(i) asn → ∞

for all i∈N.

Now let ǫ >0 be given. Then there existk0 ∈Nand n0 ∈N such that

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk < ǫ 3

1

2M+1, (2.8)

k0

X

k=1

³1 k

k X

i=1

|xn(i)−x(i)|´pk < ǫ

3 for all n≥n0, (2.9) k0

X

k=1

³1 k

k X

i=1

|xn(i)|´pk > k0

X

k=1

³1 k

k X

i=1

|x(i)|´pk − ǫ

3 1

(7)

By Proposition 2.4 (i) and (iii) we have ̺(xn)≤1 for all n∈N and ̺(x) = 1. From these together with (2.8), (2.9), (2.10) and the fact that (a +b)pk ≤

2pk(apk +bpk) fora, b≥0 we have that for all nn 0,

̺(xn−x) =

∞ X k=1 ³1 k k X i=1

|xn(i)−x(i)|´pk

= k0 X k=1 ³1 k k X i=1

|xn(i)−x(i)|´pk +

X

k=k0+1

³1 k

k X

i=1

|xn(i)−x(i)|´pk

< ǫ 3 + 2

M µ ∞

X

k=k0+1

³1 k

k X

i=1

|xn(i)|´pk+

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk

= ǫ 3 + 2

M µ

̺(xn)−

k0 X k=1 ³1 k k X i=1

|xn(i)|´pk+

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk

≤ ǫ

3+ 2 M µ 1− k0 X k=1 ³1 k k X i=1

|xn(i)|´pk+

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk

< ǫ 3 + 2

M µ 1− k0 X k=1 ³1 k k X i=1

|x(i)|´pk + ǫ 3

1 2M +

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk

¶ = ǫ 3+2 M µ ̺(x)− k0 X k=1 ³1 k k X i=1

|x(i)|´pk+ǫ 3

1 2M+

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk

= ǫ 3 + 2

M µ ∞

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk + ǫ 3

1 2M +

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk

= ǫ 3 + 2

M µ

2

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk + ǫ 3

1 2M

= ǫ 3 + 2

M+1

X

k=k0+1

³1 k

k X

i=1

|x(i)|´pk + ǫ 3 < ǫ 3 + ǫ 3 + ǫ 3 =ǫ.

This shows that ̺(xn−x) → 0 as n → ∞. By Proposition 2.5(ii) we have

kxn−xk →0 as n → ∞.This completes the proof of the theorem. ¤ It is known in general that a locally uniformly rotund space has property (H). So we have the following result.

Corollary 2.9. The space ces(p) possesses property (H).

Acknowledgements

(8)

References

1. S. T. Chen, Geometry of Orlicz spaces. With a preface by Julian Musielak.Dissertationes Math.(Rozprawy Mat.)356(1996), 1–204.

2. Y. A. Cuiand H. Hudzik, On the Banach-Saks and weak Banach-Saks properties of some Banach sequence spaces.Acta Sci. Math. (Szeged)65(1999), No. 1-2, 179–187. 3. Y. A. Cui, H. HudzikandC. Meng, On some lacal geometry of Orlicz sequence spaces

equipped the Luxemburg norms.Acta Math. Hungar.80(1998), No. 1-2, 143–154. 4. Y. A. Cui, H. Hudzik and R. Pliciennik, Banach-Saks property in some Banach

sequence spaces.Ann. Polon. Math. 65(1997), No. 2, 193–202.

5. Y. A. Cui and C. Meng, Banach-Sak property and property (β) in Ces´aro sequence spaces.Southeast Asian Bull. Math.24(2000), No. 2, 201–210.

6. J. Diestel, Geometry of Banach Spaces – Selected Topics.Lecture Notes in Mathematics,

485.Springer-Verlag, Berlin–New York,1975.

7. H. Hudzik, Orlicz spaces without strongly extreme points and withoutH-points.Canad. Math. Bull.36(1993), No. 2, 173–177.

8. H. HudzikandD. Pallaschke, On some convexity properties of Orlicz sequence spaces.

Math. Nachr.186(1997), 167–185.

9. P. Y. Lee, Ces´aro sequence spaces.Math. Chronicle13(1984), 29–45.

10. Y. Q. Liu, B. E. Wu,andY. P. Lee, Method of sequence spaces. (Chinese)Guangdong of Science and Technology Press, 1996.

11. L. Maligranda, Orlicz spaces and interpolation.Semin´arios de Matem´atica.5, 1–206.

Campinas, SP: Univ. Estadual de Campinas, Dep. de Matem´atica,1989.

12. J. Musielak, Orlicz spaces and modular spaces.Lecture Notes in Math.1034, Springer-Verlag, Berlin, 1983.

13. W. Orlicz, A note on modular spaces I. Bull. Acad. Polon. Sci. S´er. Sci. Math. As-tronom. Phys.9(1961), 157–162.

14. R. Pluciennik, T.F Wangand Y. L. Zhang,H-points and Denting Points in Orlicz Spaces.Comment. Math. Prace Mat.33(1993), 135–151.

15. W. Sanhan, On geometric properties of some Banach sequence spaces.Thesis for the degree of Master of Science in Mathematics, Chiang Mai University, 2000.

16. J.-S. Shiue,On the Ces´aro sequence spaces.Tamkang J. Math.1(1970), 19–25.

(Received 20.11.2001; revised 27.05.2002)

Author’s address:

Department of Mathematics Faculty of Science

Chiang Mai University, Chiang Mai, 50200 Thailand

Referensi

Dokumen terkait

If the processing stage has limited capacity then locating the decoupling point between processing and packaging is possible, setting aside potentially restricting characteristics

We consider an inventory subject to a probabilistic non-unit sized demand pattern, and we propose an exact and an approximate reorder point calculation method for the (R, Q)

To model failures of such systems under failure-based maintenance, a class of point process models is proposed in which the failure intensity is a function only of equipment age and

De &#34; ning the control variables as parameters of a modi &#34; ed hedging point policy, which are also machine age dependent, their best values are given by minimiz- ing