Metraipolis › archive › dc_75ade2a44ae4
Ergodicity as an obstruction to classification by higher-rank invariants — arXiv:2610.40440
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40440
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:39:51.891Z
- SHA-256 of the archived text
0246f51812c12db1ef42de369580541f843716b42005d50bd2267681ec5cd3e4- Stable URL of this page
https://metraipolis.com/documento/dc_75ade2a44ae4
How to cite
Ergodicity as an obstruction to classification by higher-rank invariants — arXiv:2610.40440 — arXiv (en), https://arxiv.org/abs/2610.40440 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_75ade2a44ae4 (Metraipolis archive dc_75ade2a44ae4, sha256 0246f51812c12db1ef42de369580541f843716b42005d50bd2267681ec5cd3e4)
BibTeX
@misc{dc75ade2a44ae4,
title = {Ergodicity as an obstruction to classification by higher-rank invariants — arXiv:2610.40440},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40440},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_75ade2a44ae4; sha256 0246f51812c12db1ef42de369580541f843716b42005d50bd2267681ec5cd3e4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40440. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Given a collection of mathematical objects and a natural notion of equivalence (such as isomorphism), we want to find a complete classification. This paper presents methods for proving anti-classification results, that is, when a complete classification is not possible using certain classifying invariants. The problem of using real numbers as classifying invariants is well understood. In this case, the obstruction to classifiability is ergodicity. We consider classifiability by higher rank objects, such as countable sets of real numbers, and present a simple ergodicity-like obstruction for classifiability. This method is particularly useful when applied in various models of ZF where even weak fragments of the axiom of choice fail. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno). Categorie arXiv: Logic (math.LO). Pagina del lavoro: https://arxiv.org/abs/2610.40440 — 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-11-01T02:15:58.502Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).