SearcharxivSearch

arXiv · 2512.24996

Manifold classification from the descriptive viewpoint

Abstract

We consider classification problems for manifolds and discrete subgroups of Lie groups from a descriptive set-theoretic point of view. This work is largely foundational in conception and character, recording both a framework for general study and Borel complexity computations for some of the most fundamental classes of manifolds. We show, for example, that for all $n\geq 0$, the homeomorphism problem for compact topological $n$-manifolds is Borel equivalent to the relation $=_{\mathbb{N}}$ of equality on the natural numbers, while the homeomorphism problem for noncompact topological $2$-manifolds is of maximal complexity among equivalence relations classifiable by countable structures. A nontrivial step in the latter consists of proving Borel measurable formulations of the Jordan--Schoenflies and surface triangulation theorems. Turning our attention to groups and geometric structures, we show, strengthening results of Stuck--Zimmer and Andretta--Camerlo--Hjorth, that the conjugacy relation on discrete subgroups of any noncompact semisimple Lie group is essentially countable universal. So too, as a corollary, is the isometry relation for complete hyperbolic $n$-manifolds for any $n\geq 2$, generalizing a result of Hjorth--Kechris. We then show that the isometry relation for complete hyperbolic $n$-manifolds with finitely generated fundamental group is, in contrast, Borel equivalent to the equality relation $=_{\mathbb{R}}$ on the real numbers when $n=2$, but that it is not concretely classifiable when $n=3$; thus there exists no Borel assignment of numerical complete invariants to finitely generated Kleinian groups up to conjugacy. We close with a survey of the most immediate open questions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey Bergfalk, Iian B. Smythe. 2025-12-31. Manifold classification from the descriptive viewpoint. https://arxiv.org/abs/2512.24996

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO