skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • NSF Public Access
  • Search Results
  • Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
Title: Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space of coarse similarity classes under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics.  more » « less
Award ID(s):
1854279
PAR ID:
10552419
Author(s) / Creator(s):
; ;
Publisher / Repository:
World Scientific
Date Published:
Journal Name:
Journal of Mathematical Logic
Volume:
24
Issue:
02
ISSN:
0219-0613
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, International Journal of Mathematics)
    Starting with a vertex-weighted pointed graph [Formula: see text], we form the free loop algebra [Formula: see text] defined in Hartglass–Penneys’ article on canonical [Formula: see text]-algebras associated to a planar algebra. Under mild conditions, [Formula: see text] is a non-nuclear simple [Formula: see text]-algebra with unique tracial state. There is a canonical polynomial subalgebra [Formula: see text] together with a Dirac number operator [Formula: see text] such that [Formula: see text] is a spectral triple. We prove the Haagerup-type bound of Ozawa–Rieffel to verify [Formula: see text] yields a compact quantum metric space in the sense of Rieffel. We give a weighted analog of Benjamini–Schramm convergence for vertex-weighted pointed graphs. As our [Formula: see text]-algebras are non-nuclear, we adjust the Lip-norm coming from [Formula: see text] to utilize the finite dimensional filtration of [Formula: see text]. We then prove that convergence of vertex-weighted pointed graphs leads to quantum Gromov–Hausdorff convergence of the associated adjusted compact quantum metric spaces. As an application, we apply our construction to the Guionnet–Jones–Shyakhtenko (GJS) [Formula: see text]-algebra associated to a planar algebra. We conclude that the compact quantum metric spaces coming from the GJS [Formula: see text]-algebras of many infinite families of planar algebras converge in quantum Gromov–Hausdorff distance. 
    more » « less
  2. ; ; (, Journal of Mathematical Logic)
    Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between [Formula: see text] principles over [Formula: see text]-models of [Formula: see text]. They also introduced a version of this game that similarly captures provability over [Formula: see text]. We generalize and extend this game-theoretic framework to other formal systems, and establish a certain compactness result that shows that if an implication [Formula: see text] between two principles holds, then there exists a winning strategy that achieves victory in a number of moves bounded by a number independent of the specific run of the game. This compactness result generalizes an old proof-theoretic fact noted by H. Wang (1981), and has applications to the reverse mathematics of combinatorial principles. We also demonstrate how this framework leads to a new kind of analysis of the logical strength of mathematical problems that refines both that of reverse mathematics and that of computability-theoretic notions such as Weihrauch reducibility, allowing for a kind of fine-structural comparison between [Formula: see text] principles that has both computability-theoretic and proof-theoretic aspects, and can help us distinguish between these, for example by showing that a certain use of a principle in a proof is “purely proof-theoretic”, as opposed to relying on its computability-theoretic strength. We give examples of this analysis to a number of principles at the level of [Formula: see text], uncovering new differences between their logical strengths. 
    more » « less
  3. ; ; ; (, International Journal of Computational Geometry & Applications)
    We consider the topological and geometric reconstruction of a geodesic subspace of [Formula: see text] both from the Čech and Vietoris-Rips filtrations on a finite, Hausdorff-close, Euclidean sample. Our reconstruction technique leverages the intrinsic length metric induced by the geodesics on the subspace. We consider the distortion and convexity radius as our sampling parameters for the reconstruction problem. For a geodesic subspace with finite distortion and positive convexity radius, we guarantee a correct computation of its homotopy and homology groups from the sample. This technique provides alternative sampling conditions to the existing and commonly used conditions based on weak feature size and [Formula: see text]–reach, and performs better under certain types of perturbations of the geodesic subspace. For geodesic subspaces of [Formula: see text], we also devise an algorithm to output a homotopy equivalent geometric complex that has a very small Hausdorff distance to the unknown underlying space. 
    more » « less
  4. ; ; ; (, Israel journal of mathematics)
    The continuous degrees measure the computability-theoretic content of elements of computable metric spaces. They properly extend the Turing degrees and naturally embed into the enumeration degrees. Although nontotal (i.e., non-Turing) continuous degrees exist, they are all very close to total: joining a continuous degree with a total degree that is not below it always results in a total degree. We call this property almost totality. We prove that the almost total degrees coincide with the continuous degrees. Since the total degrees are definable in the partial order of enumeration degrees, we see that the continuous degrees are also definable. Applying earlier work on the continuous degrees, this shows that the relation “PA above” on the total degrees is definable in the enumeration degrees. In order to prove that every almost total degree is continuous, we pass through another characterization of the continuous degrees that slightly simplifies one of Kihara and Pauly. We prove that the enumeration degree of A is continuous if and only if A is codable, meaning that A is enumeration above the complement of an infinite tree, every path of which enumerates A. 
    more » « less
  5. ; ; (, International Journal of Modern Physics A)
    A homology class [Formula: see text] of a complex flag variety [Formula: see text] is called a line degree if the moduli space [Formula: see text] of 0-pointed stable maps to X of degree d is also a flag variety [Formula: see text]. We prove a quantum equals classical formula stating that any n-pointed (equivariant, [Formula: see text]-theoretic, genus zero) Gromov–Witten invariant of line degree on X is equal to a classical intersection number computed on the flag variety [Formula: see text]. We also prove an n-pointed analogue of the Peterson comparison formula stating that these invariants coincide with Gromov–Witten invariants of the variety of complete flags [Formula: see text]. Our formulas make it straightforward to compute the big quantum [Formula: see text]-theory ring [Formula: see text] modulo the ideal [Formula: see text] generated by degrees d larger than line degrees. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email