Metraipolis › archive › dc_f8a2ecf220e9

Explicit Witnesses at Every Gap of the Depth Filtration of $β\mathbb{N}$ — arXiv:2609.38696

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38696
License (as archived)
CC0-1.0
Archived
2026-10-07T14:19:16.246Z
SHA-256 of the archived text
318d1f162ff0388d157237f8cee366435474a1f2b12c3ac427c353981859b760
Stable URL of this page
https://metraipolis.com/documento/dc_f8a2ecf220e9

How to cite

Explicit Witnesses at Every Gap of the Depth Filtration of $β\mathbb{N}$ — arXiv:2609.38696 — arXiv (en), https://arxiv.org/abs/2609.38696 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f8a2ecf220e9 (Metraipolis archive dc_f8a2ecf220e9, sha256 318d1f162ff0388d157237f8cee366435474a1f2b12c3ac427c353981859b760)
BibTeX
@misc{dcf8a2ecf220e9,
  title = {Explicit Witnesses at Every Gap of the Depth Filtration of $βmathbbN$ — arXiv:2609.38696},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38696},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f8a2ecf220e9; sha256 318d1f162ff0388d157237f8cee366435474a1f2b12c3ac427c353981859b760},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38696. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $\Sigma_{1} = \mathbb{N}^*$ and $\Sigma_{k+1} = \overline{\mathbb{N}^* + \Sigma_{k}}$ be the cumulative depth filtration of $\beta\mathbb{N}$, the analogue for $(\mathbb{N},+)$ of a chain of closed ideals that Protasov and Protasova studied for discrete groups, where strict descent follows from a theorem of Lutsenko and Protasov. For every $k$ we give an explicit set whose closure meets $\Sigma_{k}$ but not $\Sigma_{k+1}$. Fix the doubly exponential sequence $e_{n} = 2^{2^{n}}$, partition it into $k$ subsequences $E_{0}, \dots, E_{k-1}$ by the residue of the index modulo $k$, and set $A_{k} = E_{0} + \cdots + E_{k-1}$. We prove that any sum $q_{0} + \cdots + q_{k-1}$ of free ultrafilters with $E_{t} \in q_{t}$ lies in $\Sigma_{k} \setminus \Sigma_{k+1}$. The engine is a master lemma, proved by induction on $j$: if a sum $F_{1} + \cdots + F_{j}$ of subsequences of $\{e_{n}\}$ with pairwise disjoint index sets belongs to a free ultrafilter $s$, then $s \notin \Sigma_{j+1}$. The proof rests on a single rigidity of the doubly exponential sequence: a fixed difference forces the largest index in any shift-intersection, once it is large, to cancel within its own subsequence, which makes every shift-intersection descend by at least one level. The same witnesses lie in the gaps of the pure filtration.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO).
Categorie arXiv: General Topology (math.GN) ; Combinatorics (math.CO); Group Theory (math.GR); Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.38696 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:05:16.449Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).