## Trees and Ordinal Indices in C(k) Spaces for K Countable Compact

Description:
In the dissertation we study the C(K) spaces focusing on the case when K is countable compact and more specifically, the structure of C() spaces for < Ï‰1 via special type of trees that they contain. The dissertation is composed of three major sections. In the first section we give a detailed proof of the theorem of Bessaga and Pelczynski on the isomorphic classification of C() spaces. In due time, we describe the standard bases for C(Ï‰) and prove that the bases are monotone. In the second section we consider the lattice-trees introduced by Bourgain, Rosenthal and Schechtman in C() spaces, and define rerooting and restriction of trees. The last section is devoted to the main results. We give some lower estimates of the ordinal-indices in C(Ï‰). We prove that if the tree in C(Ï‰) has large order with small constant then each function in the root must have infinitely many big coordinates. Along the way we deduce some upper estimates for c0 and C(Ï‰), and give a simple proof of Cambern's result that the Banach-Mazur distance between c0 and c = C(Ï‰) is equal to 3.

Date:
August 2015

Creator:
Dahal, Koshal Raj

Item Type:
Thesis or Dissertation