اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSmoothness of bounded invariant equivalence relations
154
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We generalise the main theorems from the paper The Borel cardinality of Lascar strong types by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between fundamental properties of bounded invariant equivalence relations (such as smoothness or type-definability) which also requires finding a series of counterexamples. Finally, we apply the generalisation mentioned above to prove a conjecture from a paper by the first author and J. Gismatullin, showing that the key technical assumption of the main theorem (concerning connected components in definable group extensions) from that paper is not only sufficient but also necessary to get the conclusion.
قيم البحث
اقرأ أيضاً
We study strong types and Galois groups in model theory from a topological and descriptive-set-theoretical point of view, leaning heavily on topological dynamical tools. More precisely, we give an abstract (not model theoretic) treatment of problems
related to cardinality and Borel cardinality of strong types, quotients of definable groups and related objecets, generalising (and often improving) essentially all hitherto known results in this area. In particular, we show that under reasonable assumptions, strong type spaces are locally quotients of compact Polish groups. It follows that they are smooth if and only if they are type-definable, and that a quotient of a type-definable group by an analytic subgroup is either finite or of cardinality at least continuum.
We extend some recent results about bounded invariant equivalence relations and invariant subgroups of definable groups: we show that type-definability and smoothness are equivalent conditions in a wider class of relations than heretofore considered,
which includes all the cases for which the equivalence was proved before. As a by-product, we show some analogous results in purely topological context (without direct use of model theory).
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to elementary embedd
ability on graphs. As a consequence we obtain that elementary bi-embeddability on graphs is a analytic complete equivalence relation. We then investigate the algorithmic properties of this reduction to show that every bi-embeddability spectrum of a graph is the jump spectrum of an elementary bi-embeddability spectrum of a graph.
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibil
ity. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility spectrum of computably enumerable equivalence relations with no countable basis and a reducibility spectrum of computably enumerable equivalence relations which is downward dense, thus has no basis.
We prove that the theory of the $p$-adics ${mathbb Q}_p$ admits elimination of imaginaries provided we add a sort for ${rm GL}_n({mathbb Q}_p)/{rm GL}_n({mathbb Z}_p)$ for each $n$. We also prove that the elimination of imaginaries is uniform in $p$.
Using $p$-adic and motivic integration, we deduce the uniform rationality of certain formal zeta functions arising from definable equivalence relations. This also yields analogous results for definable equivalence relations over local fields of positive characteristic. The appendix contains an alternative proof, using cell decomposition, of the rationality (for fixed $p$) of these formal zeta functions that extends to the subanalytic context. As an application, we prove rationality and uniformity results for zeta functions obtained by counting twist isomorphism classes of irreducible representations of finitely generated nilpotent groups; these are analogous to similar results of Grunewald, Segal and Smith and of du Sautoy and Grunewald for subgroup zeta functions of finitely generated nilpotent groups.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
