Self-divisible ultrafilters and congruences in $\beta\mathbb{Z}$
Logic
2025-10-30 v2
Abstract
We introduce self-divisible ultrafilters, which we prove to be precisely those such that the weak congruence relation introduced by \v{S}obot is an equivalence relation on . We provide several examples and additional characterisations; notably we show that is self-divisible if and only if coincides with the strong congruence relation , if and only if the quotient is a profinite group. We also construct an ultrafilter such that fails to be symmetric, and describe the interaction between the aforementioned quotient and the profinite completion of the integers.
Cite
@article{arxiv.2302.09983,
title = {Self-divisible ultrafilters and congruences in $\beta\mathbb{Z}$},
author = {Mauro Di Nasso and Lorenzo Luperi Baglini and Rosario Mennuni and Moreno Pierobon and Mariaclara Ragosta},
journal= {arXiv preprint arXiv:2302.09983},
year = {2025}
}
Comments
17 pages, 1 figure