Some combinatorial principles for trees and applications to tree families in Banach spaces

From MaRDI portal
Publication:5404166

DOI10.1002/MALQ.201300029zbMATH Open1326.03054arXiv1305.4186OpenAlexW1873222905MaRDI QIDQ5404166FDOQ5404166

Costas Poulios, A. Tsarpalias

Publication date: 21 March 2014

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Abstract: Suppose that (xs)sinS is a normalized family in a Banach space indexed by the dyadic tree S. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely, assuming that for any infinite chain of S the sequence is weakly null, we prove that there exists a subtree T of S such that for any infinite chain of T the sequence is nearly (resp., convexly) unconditional. In the case where (fs)sinS is a family of continuous functions, under some additional assumptions, we prove the existence of a subtree T of S such that for any infinite chain of T, the sequence is unconditional. Finally, in the more general setting where for any chain , is a Schauder basic sequence, we obtain a dichotomy result concerning the semi-boundedly completeness of the sequences .


Full work available at URL: https://arxiv.org/abs/1305.4186




Recommendations



Cites Work


Cited In (3)





This page was built for publication: Some combinatorial principles for trees and applications to tree families in Banach spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404166)