Metraipolis › archive › dc_d8a88bafccec

Dense-set dependence in the Katětov order for uncountable coordinate ideals — arXiv:2608.02686

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.02686
License (as archived)
CC0-1.0
Archived
2026-10-31T12:56:18.549Z
SHA-256 of the archived text
256376df4240856fba8bb304ae0e8bdbbd8ee49174755d7f7de11e2beecce5d8
Stable URL of this page
https://metraipolis.com/documento/dc_d8a88bafccec

How to cite

Dense-set dependence in the Katětov order for uncountable coordinate ideals — arXiv:2608.02686 — arXiv (en), https://arxiv.org/abs/2608.02686 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d8a88bafccec (Metraipolis archive dc_d8a88bafccec, sha256 256376df4240856fba8bb304ae0e8bdbbd8ee49174755d7f7de11e2beecce5d8)
BibTeX
@misc{dcd8a88bafccec,
  title = {Dense-set dependence in the Katětov order for uncountable coordinate ideals — arXiv:2608.02686},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.02686},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d8a88bafccec; sha256 256376df4240856fba8bb304ae0e8bdbbd8ee49174755d7f7de11e2beecce5d8},
  year = {2026}
}

Archived text

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

For each countable ordinal $\alpha\geq 2$, Filipów, Kowalczuk and Kwela introduced an ideal $\mathsf{conv}_\alpha$ on the countable compact ordinal space $\omega^\alpha+1$. Kowalczuk later proved that, for each countable limit ordinal $\lambda$, the ideal $\mathsf{conv}_{<\lambda}$ is the greatest lower bound of $\{\mathsf{conv}_\beta:\beta<\lambda\}$ in the Katětov order. At the first uncountable level, let $A\subseteq[2,\omega_1)$ be uncountable and let $D$ be a countable dense subset of $X_A=\prod_{\alpha\in A}(\omega^\alpha+1)$. The coordinate ideal $\mathsf{Conv}(A,D)$ on $D$ consists of those $B\subseteq D$ with $\pi_\alpha[B]\in\mathsf{conv}_\alpha$ for every $\alpha\in A$. For a pair $D\subseteq E$ of countable dense sets, call $\alpha$ non-small if $\pi_\alpha[E\setminus D]\notin\mathsf{conv}_\alpha$. In ZFC, if at most countably many coordinates are non-small, then $\mathsf{Conv}(A,D)\equiv_K\mathsf{Conv}(A,E)$. Under CH this countability bound is sharp: for every $A\subseteq[3,\omega_1)$ with $|A|=\aleph_1$, there are countable dense sets $D\subseteq D^*\subseteq X_A$ such that $\mathsf{Conv}(A,D^*)\leq_K\mathsf{Conv}(A,D)$ but $\mathsf{Conv}(A,D)\not\leq_K\mathsf{Conv}(A,D^*)$, and in particular $\mathsf{Conv}(A,D)$ and $\mathsf{Conv}(A,D^*)$ are not Katětov equivalent. The non-reduction is obtained, under CH, by diagonalizing along $\omega_1$ coordinates against the elements of $\omega^\omega$ that code retractions $D^*\to D$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.LO).
Categorie arXiv: Logic (math.LO) ; General Topology (math.GN).
Pagina del lavoro: https://arxiv.org/abs/2608.02686 — 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-31T12:44:25.042Z dalla pagina https://arxiv.org/catchup/math.LO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).