Back to search

University of North Texas

The Relative Complexity of Various Classification Problems among Compact Metric Spaces

Abstract

dc:description

In this thesis, we discuss three main projects which are related to Polish groups and their actions on standard Borel spaces. In the first part, we show that the complexity of the classification problem of continua is Borel bireducible to a universal orbit equivalence relation induce by a Polish group on a standard Borel space. In the second part, we compare the relative complexity of various types of classification problems concerning subspaces of [0,1]^n for all natural number n. In the last chapter, we give a topological characterization theorem for the class of locally compact two-sided invariant non-Archimedean Polish groups. Using this theorem, we show the non-existence of a universal group and the existence of a surjectively universal group in the class.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chang, Cheng
Contributors dc:contributor
  • Gao, Su, 1968-
  • Jackson, Steve, 1957-
  • Conley, Charles H., 1964-

Subjects

dc:subject × 8

Rights

dc:rights
Statement dc:rights
  • Public
  • Chang, Cheng
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights Reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
local-cont-no: submission_198
https://digital.library.unt.edu/ark:/67531/metadc849626/
ark: ark:/67531/metadc849626

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chang, Cheng. The Relative Complexity of Various Classification Problems among Compact Metric Spaces. University of North Texas, 2016. https://doi.org/10.12794/metadc849626