Hostname: page-component-89b8bd64d-ktprf Total loading time: 0 Render date: 2026-05-09T05:11:38.217Z Has data issue: false hasContentIssue false

SELF-DIVISIBLE ULTRAFILTERS AND CONGRUENCES IN $\beta {\mathbb {Z}}$

Published online by Cambridge University Press:  17 July 2023

MAURO DI NASSO
Affiliation:
DIPARTIMENTO DI MATEMATICA UNIVERSITÀ DI PISA LARGO BRUNO PONTECORVO 5, 56127PISA, ITALYE-mail:mauro.di.nasso@unipi.itE-mail: morenopierobon95@gmail.comE-mail: mariaclara.ragosta@phd.unipi.it
LORENZO LUPERI BAGLINI
Affiliation:
DIPARTIMENTO DI MATEMATICA UNIVERSITÀ DI MILANO VIA SALDINI 50, 20133MILANO, ITALYE-mail:lorenzo.luperi@unimi.it
ROSARIO MENNUNI*
Affiliation:
DIPARTIMENTO DI MATEMATICA UNIVERSITÀ DI PISA LARGO BRUNO PONTECORVO 5, 56127PISA, ITALYE-mail:mauro.di.nasso@unipi.itE-mail: morenopierobon95@gmail.comE-mail: mariaclara.ragosta@phd.unipi.it
MORENO PIEROBON
Affiliation:
DIPARTIMENTO DI MATEMATICA UNIVERSITÀ DI PISA LARGO BRUNO PONTECORVO 5, 56127PISA, ITALYE-mail:mauro.di.nasso@unipi.itE-mail: morenopierobon95@gmail.comE-mail: mariaclara.ragosta@phd.unipi.it
MARIACLARA RAGOSTA
Affiliation:
DIPARTIMENTO DI MATEMATICA UNIVERSITÀ DI PISA LARGO BRUNO PONTECORVO 5, 56127PISA, ITALYE-mail:mauro.di.nasso@unipi.itE-mail: morenopierobon95@gmail.comE-mail: mariaclara.ragosta@phd.unipi.it
Rights & Permissions [Opens in a new window]

Abstract

We introduce self-divisible ultrafilters, which we prove to be precisely those $w$ such that the weak congruence relation $\equiv _w$ introduced by Šobot is an equivalence relation on $\beta {\mathbb Z}$. We provide several examples and additional characterisations; notably we show that $w$ is self-divisible if and only if $\equiv _w$ coincides with the strong congruence relation $\mathrel {\equiv ^{\mathrm {s}}_{w}}$, if and only if the quotient $(\beta {\mathbb Z},\oplus )/\mathord {\mathrel {\equiv ^{\mathrm {s}}_{w}}}$ is a profinite group. We also construct an ultrafilter $w$ such that $\equiv _w$ fails to be symmetric, and describe the interaction between the aforementioned quotient and the profinite completion $\hat {{\mathbb Z}}$ of the integers.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
Figure 0

Figure 1 Diagram from Remark 7.1.