可计算地完全不连通的局部紧群
Computably totally disconnected locally compact groups
AI总结:
本文从算法角度研究完全不连通的局部紧群,探讨了可计算呈现的定义方法及其等价性,并展示了如何通过不同方法证明多个自然群具有可计算呈现,同时研究了相关构造的算法版本及可计算性问题。
摘要:
我们从算法角度研究完全不连通、局部紧(t.d.l.c.)群。我们给出了定义t.d.l.c.群可计算呈现的不同方法,并展示了它们的等价性。在此过程中,我们获得了t.d.l.c.群与由紧开余集给出的某些可数有序群oid之间的算法 Stone 型对偶性。我们利用这些不同方法的灵活性,证明了若干自然群,如Aut(T_d)和SL_n(Q_p),具有可计算呈现。我们展示了许多从t.d.l.c.群构造新t.d.l.c.群的构造具有算法版本,仍保留在可计算呈现的t.d.l.c.群类中。这导致了进一步的例子,如PGL_n(Q_p)。我们研究是否与可计算t.d.l.c.群相关的对象是可计算的:模函数、尺度函数以及在可计算生成情况下的Cayley-Abels图。我们给出了可计算呈现的t.d.l.c.群在可计算同构下唯一时的条件,并将其应用于Q_p作为加法群,以及半直积Z⋊Q_p。我们与Willis共同给出了一个具有非可计算尺度函数的可计算t.d.l.c.群的例子。
英文摘要:
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ groups, and show their equivalence. In the process, we obtain an algorithmic Stone-type duality between t.d.l.c.~groups and certain countable ordered groupoids given by the compact open cosets. We exploit the flexibility given by these different approaches to show that several natural groups, such as $\mathrm{Aut}(T_d)$ and $\mathrm{SL}_n(\mathbb Q_p)$, have computable presentations. We show that many construction leading from t.d.l.c.\ groups to new t.d.l.c.\ groups have algorithmic versions that stay within the class of computably presented t.d.l.c.\ groups. This leads to further examples, such as $\mathrm{PGL}_n(\mathbb Q_p)$. We study whether objects associated with computably t.d.l.c.\ groups are computable: the modular function, the scale function, and Cayley-Abels graphs in the compactly generated case. We give a criterion when computable presentations of t.d.l.c.~groups are unique up to computable isomorphism, and apply it to $\mathbb Q_p$ as an additive group, and the semidirect product $\mathbb Z\ltimes \mathbb Q_p$. We give (joint with Willis) an example of a computably t.d.l.c. group with noncomputable scale function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。