Complexity of weakly null sequences

Details Complexity of weakly null sequences Complexity of weakly null sequences

Publishing date

1992-02-28

URL

arxiv.org/abs/math/9202204v1

Science

Mathematics

Field

Functional Analysis

Type

Scientific paper

Abstract

We introduce an ordinal index which measures the complexity of a weakly null sequence, and show that a construction due to J. Schreier can be iterated to produce for each alpha < omega_1, a weakly null sequence (x^{alpha}_n)_n in C(omega^{omega^{alpha}})) with complexity alpha. As in the Schreier example each of these is a sequence of indicator functions which is a suppression-1 unconditional basic sequence. These sequences are used to construct Tsirelson-like spaces of large index. We also show that this new ordinal index is related to the Lavrentiev index of a Baire-1 function and use the index to sharpen some results of Alspach and Odell on averaging weakly null sequences.

Affiliated with

Also associated with

No associations

Rating

Complexity of weakly null sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of weakly null sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of weakly null sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446527