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
Publication date: 21 March 2014
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Abstract: Suppose that is a normalized family in a Banach space indexed by the dyadic tree . 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 the sequence is weakly null, we prove that there exists a subtree of such that for any infinite chain of the sequence is nearly (resp., convexly) unconditional. In the case where is a family of continuous functions, under some additional assumptions, we prove the existence of a subtree of such that for any infinite chain of , 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
Other combinatorial set theory (03E05) Descriptive set theory (03E15) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)
Cites Work
- Title not available (Why is that?)
- A Characterization of Banach Spaces Containing l 1
- The Unconditional Basic Sequence Problem
- Convex unconditionality and summability of weakly null sequences
- Normalized weakly null sequence with no unconditional subsequence
- A Ramsey theorem for trees, with an application to Banach spaces
- Weakly null sequences with an unconditional subsequence
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)