Convex unconditionality and summability of weakly null sequences
Abstract
It is proved that every normalized weakly null \ has a sub\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null s.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.