用户名: 密码: 验证码:
On Valdivia strong version of Nikodym boundedness property
详细信息    查看全文
文摘
Following Schachermayer, a subset B of an algebra e8009b7a7" title="Click to view the MathML source">A of subsets of Ω is said to have the N-property   if a B-pointwise bounded subset M   of a14bb3380556" title="Click to view the MathML source">ba(A) is uniformly bounded on e8009b7a7" title="Click to view the MathML source">A, where a14bb3380556" title="Click to view the MathML source">ba(A) is the Banach space of the real (or complex) finitely additive measures of bounded variation defined on e8009b7a7" title="Click to view the MathML source">A. Moreover B is said to have the strong N-property   if for each increasing countable covering (Bm)m of B there exists Bn which has the N-property. The classical Nikodym–Grothendieck's theorem says that each σ  -algebra S of subsets of Ω has the N-property. The Valdivia's theorem stating that each σ  -algebra S has the strong N  -property motivated the main measure-theoretic result of this paper: We show that if 8bf8d9c6c8bad3f35" title="Click to view the MathML source">(Bm1)m1 is an increasing countable covering of a σ  -algebra S and if (Bm1,m2,…,mp,mp+1)mp+1 is an increasing countable covering of e83f96710334cc78ec" title="Click to view the MathML source">Bm1,m2,…,mp, for each a1a28d5d9aad112a2eec5eab4d" title="Click to view the MathML source">p,mi∈N, 8b29ac47d586e6444ea38e3ed" title="Click to view the MathML source">1⩽i⩽p, then there exists a sequence 8319f92bc33eb5fa3643d" title="Click to view the MathML source">(ni)i such that each 872b2d4e58acee67a0f" title="Click to view the MathML source">Bn1,n2,…,nr, r∈N, has the strong N  -property. In particular, for each increasing countable covering (Bm)m of a σ  -algebra S there exists Bn which has the strong N-property, improving mentioned Valdivia's theorem. Some applications to localization of bounded additive vector measures are provided.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700