Generalized Descriptive Set Theory And Classification Theory

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper the authors study the generalization where countable is replaced by uncountable. They explore properties of generalized Baire and Cantor spaces equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical countable case. They also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. The authors' results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations.

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper the authors study the generalization where countable is replaced by uncountable. They explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. They also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. The authors' results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations.

View the abstract.

In this paper the author establishes the endoscopic classification of tempered representations of quasi-split unitary groups over local fields, and the endoscopic classification of the discrete automorphic spectrum of quasi-split unitary groups over global number fields. The method is analogous to the work of Arthur on orthogonal and symplectic groups, based on the theory of endoscopy and the comparison of trace formulas on unitary groups and general linear groups.

This book is an essay on the epistemology of classifications. Its main purpose is not to provide an exposition of an actual mathematical theory of classifications, that is, a general theory which would be available to any kind of them: hierarchical or non-hierarchical, ordinary or fuzzy, overlapping or non-overlapping, finite or infinite, and so on, establishing a basis for all possible divisions of the real world. For the moment, such a theory remains nothing but a dream. Instead, the authors essentially put forward a number of key questions. Their aim is rather to reveal the “state of art” of this dynamic field and the philosophy one may eventually adopt to go further. To this end they present some advances made in the course of the last century, discuss a few tricky problems that remain to be solved, and show the avenues open to those who no longer wish to stay on the wrong track. Researchers and professionals interested in the epistemology and philosophy of science, library science, logic and set theory, order theory or cluster analysis will find this book a comprehensive, original and progressive introduction to the main questions in this field.

Descriptive Set Theory is the study of sets in separable, complete metric spaces that can be defined (or constructed), and so can be expected to have special properties not enjoyed by arbitrary pointsets. This subject was started by the French analysts at the turn of the 20th century, most prominently Lebesgue, and, initially, was concerned primarily with establishing regularity properties of Borel and Lebesgue measurable functions, and analytic, coanalytic, and projective sets. Its rapid development came to a halt in the late 1930s, primarily because it bumped against problems which were independent of classical axiomatic set theory. The field became very active again in the 1960s, with the introduction of strong set-theoretic hypotheses and methods from logic (especially recursion theory), which revolutionized it. This monograph develops Descriptive Set Theory systematically, from its classical roots to the modern ``effective'' theory and the consequences of strong (especially determinacy) hypotheses. The book emphasizes the foundations of the subject, and it sets the stage for the dramatic results (established since the 1980s) relating large cardinals and determinacy or allowing applications of Descriptive Set Theory to classical mathematics. The book includes all the necessary background from (advanced) set theory, logic and recursion theory.

The author studies a family of renormalization transformations of generalized diamond hierarchical Potts models through complex dynamical systems. He proves that the Julia set (unstable set) of a renormalization transformation, when it is treated as a complex dynamical system, is the set of complex singularities of the free energy in statistical mechanics. He gives a sufficient and necessary condition for the Julia sets to be disconnected. Furthermore, he proves that all Fatou components (components of the stable sets) of this family of renormalization transformations are Jordan domains with at most one exception which is completely invariant. In view of the problem in physics about the distribution of these complex singularities, the author proves here a new type of distribution: the set of these complex singularities in the real temperature domain could contain an interval. Finally, the author studies the boundary behavior of the first derivative and second derivative of the free energy on the Fatou component containing the infinity. He also gives an explicit value of the second order critical exponent of the free energy for almost every boundary point.

The authors develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: `space barriers' from convex geometry, and `divisibility barriers' from arithmetic lattice-based constructions. To formulate precise results, they introduce the setting of simplicial complexes with minimum degree sequences, which is a generalisation of the usual minimum degree condition. They determine the essentially best possible minimum degree sequence for finding an almost perfect matching. Furthermore, their main result establishes the stability property: under the same degree assumption, if there is no perfect matching then there must be a space or divisibility barrier. This allows the use of the stability method in proving exact results. Besides recovering previous results, the authors apply our theory to the solution of two open problems on hypergraph packings: the minimum degree threshold for packing tetrahedra in -graphs, and Fischer's conjecture on a multipartite form of the Hajnal-Szemerédi Theorem. Here they prove the exact result for tetrahedra and the asymptotic result for Fischer's conjecture; since the exact result for the latter is technical they defer it to a subsequent paper.