Skip to main content

Daneš theorem in complete random normed modules

Abstract

Based on the recent work of random metric theory, namely the Ekeland variationalprinciple on a complete random metric space, this paper studies the Daneštheorem in a complete random normed module. In this paper, we first present thenotion of finer ordering on a random normed module. Then we establish the Daneštheorem in a complete random normed module under the locally L 0 -convex topology. When the base space of the randomnormed module is trivial, our result automatically degenerates to the classicalcase.

MSC: 58E30, 47H10, 46H25, 46A20.

1 Introduction

In 1972, Daneš [1] presented the Daneš theorem. With the classical Ekeland variationalprinciple, Brøndsted [2] gave it a new proof in 1974.

Recently, Prof. Guo Tiexin and I [3] established the Ekeland variational principle for an L ¯ 0 -valued function on a complete random metric space, where L ¯ 0 is the set of equivalence classes of extended real-valuedrandom variables on a probability space (Ω,F,P). Based on this result, this paper establishes theDaneš theorem in a complete random normed module under the locally L 0 -convex topology.

A random normed module is a random generalization of an ordinary normed space. Differentfrom ordinary normed spaces, random normed modules possess the rich stratificationstructure, which is introduced in this paper. It is this kind of rich stratificationstructure that makes the theory of random normed modules deeply developed and alsorenders it the most useful part of random metric theory [414]. When the probability (Ω,F,P) is trivial, namely F={,Ω}, our result reduces to the classical Daneš theorem.So our result is a nontrivial random extension.

The remainder of this article is organized as follows: in Section 2 we give somenecessary definitions and in Section 3 we give the main results and proofs.

2 Preliminary

Throughout this paper, (Ω,F,P) denotes a probability space, K the real numberfield R or the complex number field C, N the set of positiveintegers, L ¯ 0 (F) the set of equivalence classes of extended real-valuedrandom variables on Ω and L 0 (F,K) the algebra of equivalence classes of K-valued-measurable random variables on Ω under the ordinary scalar multiplication,addition and multiplication operations on equivalence classes, denoted by L 0 (F) when K=R.

Specially, L + 0 (F)={ξ L 0 (F)ξ0}, L + + 0 (F)={ξ L 0 (F)ξ>0 on Ω}.

As usual, ξ>η means ξη and ξη, whereas ξ>η on A means ξ 0 (ω)> η 0 (ω) a.s. on A for any AF and ξ and η in L ¯ 0 (F), where ξ 0 and η 0 are arbitrarily chosen representatives of ξand η, respectively.

For any AF, A c denotes the complement of A, A ˜ ={BFP(AΔB)=0} denotes the equivalence class of A, where Δis the symmetric difference operation, I A the characteristic function of A, and I ˜ A is used to denote the equivalence class of I A ; given two ξ and η in L ¯ 0 (F), and A={ωΩ: ξ 0 η 0 }, where ξ 0 and η 0 are arbitrarily chosen representatives of ξand η, respectively, then we always write [ξη] for the equivalence class of A and I [ ξ η ] for I ˜ A , one can also understand the implication of such notationsas I [ ξ η ] , I [ ξ < η ] , and I [ ξ = η ] .

For an arbitrary chosen representative ξ 0 of ξ L 0 (F,K), define the two -measurable random variables ( ξ 0 ) 1 and | ξ 0 | by ( ξ 0 ) 1 (ω)= 1 ξ 0 ( ω ) if ξ 0 (ω)0, and ( ξ 0 ) 1 (ω)=0 otherwise, and by | ξ 0 |(ω)=| ξ 0 (ω)|, ωΩ. Then the equivalence class ξ 1 of ( ξ 0 ) 1 is called the generalized inverse of ξ andthe equivalence class |ξ| of | ξ 0 | is called the absolute value of ξ. It isclear that ξ ξ 1 = I [ ξ 0 ] .

Definition 2.1 ([15])

An ordered pair (E,) is called a random normed space (briefly, an RNspace) over K with base (Ω,F,P) if E is a linear space and is a mapping from E to L + 0 (F) such that the following three axioms are satisfied:

  1. (1)

    x=0 if and only if x=θ (the null vector of E);

  2. (2)

    αx=|α|x, αK and xE;

  3. (3)

    x+yx+y, x,yE,

where the mapping is called the random norm on E andx is called the random norm of a vectorxE.

In addition, if E is left module over the algebra L 0 (F,K) such that the following is also satisfied:

  1. (4)

    ξx=|ξ|x, ξ L 0 (F,K) and xE,

then such an RN space is called an RN module over K withbase (Ω,F,P) and such a random norm is called an L 0 -norm on E.

Definition 2.2 ([16])

Let (E,) be an RN module over K with base(Ω,F,P). For any ε L + + 0 , let B(ε)={xExε} and U θ ={B(ε)ε L + + 0 }. A set GE is called T c -open if for every xG there exists some B(ε) U θ such that x+B(ε)G. Let T c be the family of T c -open subsets, then T c is a Hausdorff topology on E, called the locally L 0 -convex topology, denoted by T c .

Let (E,) be an RN module over K with base(Ω,F,P), p A = I ˜ A p is called the A-stratification of p foreach given AF and p in E. The so-called stratificationstructure of E means that E includes every stratification of anelement in E. Clearly, p A =θ when P(A)=0 and p A =p when P(ΩA)=0, which are both called trivial stratifications ofp. Further, when (Ω,F,P) is a trivial probability space every element in Ehas merely the two trivial stratifications since F={Ω,}; when (Ω,F,P) is arbitrary, every element in E can possessarbitrarily many nontrivial intermediate stratifications. It is this kind of richstratification structure of RN modules that makes the theory of RNmodules deeply developed and also renders it the most useful part of random metrictheory.

To introduce the main results of this paper, let us first recall the following.

Definition 2.3 ([3])

Let X be a Hausdorff space and f:X L ¯ 0 (F), then:

  1. (1)

    dom(f):={xXf(x)<+ on Ω} is called the effective domain of f.

  2. (2)

    f is proper if f(x)> on Ω for every xX and dom(f).

  3. (3)

    f is bounded from below (resp., bounded from above) if there exists ξ L 0 (F) such that f(x)ξ (accordingly, f(x)ξ) for any xX.

In all the vector-valued extensions of the Ekeland variational principle, it is of keyimportance to properly define the lower semicontinuity for a vector-valued function [1719]. Recently, we have found that a kind of lower semicontinuity for L ¯ 0 -valued functions is very suitable for the study ofconditional risk measures.

Definition 2.4 ([16])

Let (E,) be an RN module over R with base(Ω,F,P). A function f:E L ¯ 0 (F) is called T c -lower semicontinuous if epi(f) is closed in (E, T c )×( L 0 (F), T c ).

There is a kind of countable concatenation property, which is concerned with the L 0 -module E itself and is very important for thetheory of RN module. Let us recall it.

Definition 2.5 ([10])

Let E be a left module over the algebra L 0 (F,K). A formal sum n N I ˜ A n x n is called a countable concatenation of a sequence{ x n nN} in E with respect to a countable partition{ A n nN} of Ω to . Moreover, a countable concatenation n N I ˜ A n x n is well defined or n N I ˜ A n x n E if there is xE such that I ˜ A n x= I ˜ A n x n , nN. A subset G of E is said to have thecountable concatenation property if every countable concatenation n N I ˜ A n x n with x n G for each nN still belongs to G, namely n N I ˜ A n x n is well defined and there exists xG such that x= n N I ˜ A n x n .

Definition 2.6 ([16])

Let E be a left module over the algebra L 0 (F) and f a function from E to L ¯ 0 (F), then:

  1. (1)

    f is L 0 (F)-convex if f(ξx+(1ξ)y)ξf(x)+(1ξ)f(y) for all x and y in E and ξ L + 0 (F) such that 0ξ1 (here we make the convention that 0(±)=0 and =!).

  2. (2)

    f is said to have the local property if I ˜ A f(x)= I ˜ A f( I ˜ A x) for all xE and AF.

It is well known from [16] that f:E L ¯ 0 (F) is L 0 (F)-convex iff f has the local property andepi(f) is L 0 (F)-convex.

3 Main results and proofs

Definition 3.1 Let (E,) be an RN module over R with base(Ω,F,P), zE and r L + + 0 (F). Denote the T c -closed ball by

B z (r):= { x E : x z r } .

Definition 3.2 ([14])

Let (E,) be an RN module over R with base(Ω,F,P), B z (r) a T c -closed ball in E, yE B z (r). Define the L 0 (F)-convex hull of {y} B z (r) by

D(z,r,y):= { t b + ( 1 t ) y : b B z ( r ) , t L + 0 ( F )  and  0 t 1 } .

Definition 3.3 Let (E,) be an RN module over R with base(Ω,F,P), ≤1 and ≤2 be bothorderings on E. Then ≤2 is finer than ≤1, if

x 2 yx 1 y.

In [3], we established the precise form of the Ekeland variational principle on a T c -complete RN-module. Here we only need its generalform as follows.

Lemma 3.4 ([3])

Let(F,)be a T c -complete RN moduleover R with base(Ω,F,P)such that F has the countableconcatenation property, φ:F L ¯ 0 (F)have the local property.IfGFis a T c -closed subset with the countable concatenationproperty andφ | G is proper, T c -lower semicontinuous, and bounded from belowon G, then for each point x 0 dom(φ | G ), there existszGsuch that the following are satisfied:

  1. (1)

    φ(z)φ( x 0 )z x 0 ;

  2. (2)

    for eachxGsuch thatxz, φ(x)φ(z)xz, which means that z is a maximal element in(G, φ ).

Remark 3.5 ([3])

The ordering φ on F is defined as follows:x φ y if and only if either x=y, or x and ydom(φ) are such that xyφ(x)φ(y).

Theorem 3.6 Let(X,)be a T c -complete RN moduleover R with base(Ω,F,P)such that X has the countableconcatenation property, FXa T c -closed subset with the countable concatenationproperty, andzXF. Letr,R,ρ L + + 0 (F)with0<r<R<ρon Ω, then thereexists x 0 c (F)such that

x 0 zρ

and

D(z,r, x 0 )F={ x 0 },

whereR:={za:aF}, and c (F)denotes the T c -boundary of F.

Proof We can, without loss of generality, suppose z=0.

Let E:=F B 0 (ρ).

Define an ordering ˜ on E as follows: x 1 ˜ x 2 if and only if x 2 D(0,r, x 1 ). It is easy to check that ˜ is a partial ordering.

Define a function φ:E L + 0 (F) by φ(x)=(ρ+r) ( R r ) 1 x, xE.

Since F and B 0 (ρ) are T c -closed and have the countable concatenation property, itfollows that E is T c -closed and has the countable concatenation property.

For each AF, one can have

I ˜ A φ(x)= I ˜ A (ρ+r) ( R r ) 1 x= I ˜ A (ρ+r) ( R r ) 1 I ˜ A x= I ˜ A φ( I ˜ A x),xE,

which implies that φ has the local property.

Since φ is T c -continuous, it is easy to see that φ is T c -lower semicontinuous.

Then from Lemma 3.4, there exists a maximal element x 0 in (E, φ ).

We now prove that ˜ is finer than the ordering φ .

Let x 1 , x 2 be points in E such that x 1 ˜ x 2 . Then one can have x 2 D(0,r, x 1 ); thus we can suppose

x 2 =(1t) x 1 +tv,
(1)

where t L + 0 (F), 0t1, and v B 0 (r).

From (1), it follows that x 2 (1t) x 1 +tv, which implies

t ( x 1 v ) x 1 x 2 .

From Rr x 1 v, one can have

t ( x 1 x 2 ) ( R r ) 1 .
(2)

Thus by (2) we have

x 1 x 2 = t v x 1 t ( v + x 1 ) t ( r + ρ ) ( r + ρ ) ( R r ) 1 ( x 1 x 2 ) ,

which implies x 1 φ x 2 , and hence ˜ is finer than the ordering φ .

Since x 0 is a maximal element in (E, φ ) and ˜ is finer than φ , it is easy to check that x 0 is a maximal element in (E, ˜ ). Thus we have x 0 ρ and { x 0 }=D(0,r, x 0 )E, which implies D(0,r, x 0 )F={ x 0 }.

For each xD(0,r, x 0 ), we can suppose x=t x 0 +(1t)v, where v B 0 (r). Thus we have

x= t x 0 + ( 1 t ) v t x 0 +(1t)vtρ+(1t)r<ρ

on Ω.

It is easy to see that for any yFE, yρ does not hold. Hence we have x 0 c (F). □

Remark 3.7 When the base space (Ω,F,P) of the RN module is trivial, namelyF={,Ω}, our result automatically degenerates to the classicalDaneš theorem. So our result is a nontrivial random extension.

References

  1. Daneš J: A geometric theorem useful in nonlinear functional analysis. Boll. Unione Mat. Ital. 1972, 6: 369–375.

    MathSciNet  MATH  Google Scholar 

  2. Brøndsted A: On a lemma of Bishop and Phelps. Pac. J. Math. 1974, 55: 335–341. 10.2140/pjm.1974.55.335

    Article  MathSciNet  MATH  Google Scholar 

  3. Guo TX, Yang YJ:Ekeland’s variational principle for an L ¯ 0 -valued function on a complete random metricspace. J. Math. Anal. Appl. 2012, 389: 1–14. 10.1016/j.jmaa.2011.11.025

    Article  MathSciNet  MATH  Google Scholar 

  4. Guo TX, Xiao HX, Chen XX: A basic strict separation theorem in random locally convex modules. Nonlinear Anal. 2009, 71: 3794–3804. 10.1016/j.na.2009.02.038

    Article  MathSciNet  MATH  Google Scholar 

  5. Guo TX, Li SB: The James theorem in complete random normed modules. J. Math. Anal. Appl. 2005, 308: 257–265. 10.1016/j.jmaa.2005.01.024

    Article  MathSciNet  MATH  Google Scholar 

  6. Guo TX, Shi G:The algebraic structure of finitely generated L 0 (F,K)-modules and the Helly theorem in random normedmodules. J. Math. Anal. Appl. 2011, 381: 833–842. 10.1016/j.jmaa.2011.03.069

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhao SN, Guo TX: The random reflexivities of complete random normed modules. Int. J. Math. 2011. 10.1142/S0129167X12500474

    Google Scholar 

  8. Tang YH: A new version of the Gleason-Kahane-Zklazko theorem in complete random normedalgebras. J. Inequal. Appl. 2012. 10.1186/1029-242X-2012-85

    Google Scholar 

  9. Guo TX: Recent progress in random metric theory and its applications to conditional riskmeasures. Sci. China Ser. A 2011, 54: 633–660. 10.1007/s11425-011-4189-6

    Article  MATH  Google Scholar 

  10. Guo TX: Relations between some basic results derived from two kinds of topologies for arandom locally convex module. J. Funct. Anal. 2010, 258: 3024–3047. 10.1016/j.jfa.2010.02.002

    Article  MathSciNet  MATH  Google Scholar 

  11. Tang YH: The Wintner theorem in unital complete random normed algebras. Bull. Korean Math. Soc. 2013,50(6):1973–1979. 10.4134/BKMS.2013.50.6.1973

    Article  MathSciNet  MATH  Google Scholar 

  12. Tang YH: Random spectral theorems of self-adjoint random linear operators on completecomplex random inner product modules. Linear Multilinear Algebra 2013,61(3):409–416. 10.1080/03081087.2012.689981

    Article  MathSciNet  MATH  Google Scholar 

  13. Tang YH, Guo TX: Complete random normed algebras. Southeast Asian Bull. Math. 2013, 37: 931–940.

    MathSciNet  MATH  Google Scholar 

  14. Yang YJ: Drop theorem and petal theorem in complete random normed modules. Acta Anal. Funct. Appl. 2012,14(4):411–418.

    MathSciNet  MATH  Google Scholar 

  15. Guo TX: Some basic theories of random normed linear spaces and random inner productspaces. Acta Anal. Funct. Appl. 1999,1(2):160–184.

    MathSciNet  MATH  Google Scholar 

  16. Filipović D, Kupper M, Vogelpoth N:Separation and duality in locally L 0 -convex modules. J. Funct. Anal. 2009, 256: 3996–4029. 10.1016/j.jfa.2008.11.015

    Article  MathSciNet  MATH  Google Scholar 

  17. Göpfert A, Tammer C, Zălinescu C: On the vectorial Ekeland’s variational principle and minimal points inproduct spaces. Nonlinear Anal. 2000, 39: 909–922. 10.1016/S0362-546X(98)00255-7

    Article  MathSciNet  MATH  Google Scholar 

  18. Finet C, Quarta L, Troestler C: Vector-valued variational principles. Nonlinear Anal. 2003, 52: 197–218. 10.1016/S0362-546X(02)00103-7

    Article  MathSciNet  MATH  Google Scholar 

  19. Araya Y: Ekeland’s variational principle and its equivalent theorems in vectoroptimization. J. Math. Anal. Appl. 2008, 346: 9–16. 10.1016/j.jmaa.2008.04.055

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the ‘New Start’ Academic Research Projects ofBeijing Union University (No. Zk10201304).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yujie Yang.

Additional information

Competing interests

The author declares to have no competing interests.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, Y. Daneš theorem in complete random normed modules. J Inequal Appl 2014, 317 (2014). https://doi.org/10.1186/1029-242X-2014-317

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2014-317

Keywords