Phd records
https://feeds.library.caltech.edu/people/Pavelich-Janet-Mary/Phd.rss
A Caltech Library Repository Feedhttp://www.rssboard.org/rss-specificationpython-feedgenenWed, 31 Jan 2024 19:36:06 +0000Commuting Equivalence Relations and Scales on Differentiable Functions
https://resolver.caltech.edu/CaltechTHESIS:01262012-103823681
Authors: {'items': [{'id': 'Pavelich-Janet-Mary', 'name': {'family': 'Pavelich', 'given': 'Janet Mary'}, 'show_email': 'NO'}]}
Year: 2002
DOI: 10.7907/RHBN-ZN06
<p>This work consists of two independent chapters:</p>
<p>The first is a study of commuting countable Borel equivalence relations, where two equivalence relations R and 5 are said to commute if, as binary relations, they commute with respect to the composition operator , i.e., R ◦ S = S ◦ R. The primary problem considered is, to what extent does the complexity of E = R V S depend on the complexity of R and S , if R and S commute? This is considered both in the case where the underlying space supports no E-invariant probability measure, and the case where it supports at least one such measure. In the first case, the answer is 'not very much': any such aperiodic equivalence relation E can be written as R V S, where Rand 5 are smooth aperiodic. In the second case, we frame our study within the context of costs, a system of invariants for countable Borel equivalence relations with invariant probability measures, developed by G. Levitt [12] and D. Gaboriau [5]. One aspect of costs which is not well understood is the extent to which 'commutativity' within an equivalence relation (in a more general sense than the definition given above) trivializes its cost. We have shown that, under certain conditions, this is in fact the case. One of the consequences of these investigations is a new, elementary proof of the fact the group SL_2 (Z[^1_2]) is anti-treeable.</p>
<p>The second chapter is motivated by the well known theorem of descriptive set theory that every П^1_1 subset of a Polish (separable, completely metrizable) space admits a П^1_1 scale. We construct a П^1_1 scale on the set of differentiable functions with domain [0,1], which is a П^1_1 subset of the Polish space C([0,1]) . This construction is based on the П^1_1 rank of differentiable functions given by Kechris and Woodin in [4], and, like this rank, is meant to reflect the intrinsic nature of DIFF, and so give a 'natural ' criterion for determining whether the uniform limit of differentiable functions is itself differentiable. We then attempt to further analyze this 'scale criterion' for a sequence of differentiable functions (ƒ_n) by comparing it to the criterion that the sequence (ƒ'_n) converges.</p>
https://thesis.library.caltech.edu/id/eprint/6783