A Ramsey theorem with an application to sequences in Banach spaces (Q2888795)

The author proves a new dichotomy result: every basic sequence in a Banach space has a subsequence which is either unconditional or maximally conditional. A basic sequence \((x_n)_{n \geq 1}\) in a Banach space is said to be \textit{maximally conditional} if, given two infinite disjoint subsets \(E, F\) of the integers, there exists, for every positive number \(C\), a finitely supported sequence of scalars \((a_k)_{k \in E \cup F}\) such that \(\left\| \sum_{k \in E} a_k x_k \right\| > C \, \left\| \sum_{k \in E \cup F} a_k x_k \right\|\). To show that, the author proves the following combinatorial result, based on Galvin's theorem: Let \({\mathcal A}\) be a set of couples \((A, B)\), where \(A\) and \(B\) are disjoint finite subsets of the set \({\mathbb N}\) of the integers; then, for every infinite subset \(R \subseteq {\mathbb N}\), there exists an infinite subset \(S \subseteq R\) such that: either for no \((A, B) \in {\mathcal A}\) one has \(A \cup B \subseteq S\), or for any two infinite subsets \(E, F \subseteq S\), there exists \((A, B) \in {\mathcal A}\) such that \(A \subseteq E\) and \(B \subseteq F\).NEWLINENEWLINEThe author also provides a direct proof of his dichotomy result, but using the Galvin-Prikry theorem.