Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

Complexity of families of compact sets in ℝ<sup><i>n</i></sup>

Kovan-Bakan, Merve (2013) Complexity of families of compact sets in ℝ<sup><i>n</i></sup>. Doctoral Dissertation, University of Pittsburgh. (Unpublished)

This is the latest version of this item.

Primary Text

Download (2MB) | Preview


The space of all compact subsets of ℝ<sup><i>n</i></sup> with the Vietoris topology,
denoted <i><b>K</b></i>(ℝ<sup><i>n</i></sup>), is a Polish space, i.e. separable and completely metrizable.
It is naturally stratified by dimension. In this work, we study the zero and one dimensional compact subsets of
ℝ<sup><i>n</i></sup>, and two equivalence relations on <i><b>K</b></i>(ℝ<sup><i>n</i></sup>):
the homeomorphism relation and the embedding relation induced by the action of autohomeomorphisms of

Among the zero dimensional compact subsets, Cantor sets are generic and form a Polish subspace.
We study the topological properties of this space as well as the structure with respect to the embedding relation.
Moreover, we show that the classification of Cantor sets up to embedding relation is at least as complex as the
classification of countable structures.

Next, we look into one dimensional compact subsets, particularly those that are connected, i.e. curves.
The curves also form a Polish subspace. We introduce a new connectedness property, namely strong arcwise connectedness.
We study the complexity of curves with this property using descriptive set theory tools, and show that the space of all
curves which are strong arcwise connected, is not Borel, and is exactly at the second level of the projective hierarchy.
In addition, we examine the classification of curves up to either equivalence relation and show that the curves are not
classifiable by countable structures.


Social Networking:
Share |


Item Type: University of Pittsburgh ETD
Status: Unpublished
CreatorsEmailPitt UsernameORCID
Kovan-Bakan, Merve
ETD Committee:
TitleMemberEmail AddressPitt UsernameORCID
Committee ChairGartside, Paulgartside@math.pitt.eduPMG20
Committee MemberDarji,
Committee MemberEspinoza, Benjaminbee1@pitt.eduBEE1
Committee MemberHeath, Robertrwheath@pitt.eduRWHEATH
Committee MemberLennard, Christopherlennard@pitt.eduLENNARD
Date: 26 February 2013
Date Type: Publication
Defense Date: 2 August 2012
Approval Date: 26 February 2013
Submission Date: 30 July 2012
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Number of Pages: 79
Institution: University of Pittsburgh
Schools and Programs: Dietrich School of Arts and Sciences > Mathematics
Degree: PhD - Doctor of Philosophy
Thesis Type: Doctoral Dissertation
Refereed: Yes
Uncontrolled Keywords: Cantor sets, embeddings, classification, turbulence, curves, Borel hierarchy, difference hierarchy, Projective hierarchy, strong arcwise connectedness, dendrites, dendroids
Date Deposited: 26 Feb 2013 17:54
Last Modified: 15 Nov 2016 14:06

Available Versions of this Item

  • Complexity of families of compact sets in ℝ<sup><i>n</i></sup>. (deposited 26 Feb 2013 17:54) [Currently Displayed]


Monthly Views for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item