Metraipolis › archive › dc_c52ee8f09cdc
The complexity of tilting — arXiv:2610.41064
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41064
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T05:02:32.537Z
- SHA-256 of the archived text
b2821caaed432978631492586a02906a9ce882b08ef66a6d474cd196e571a758- Stable URL of this page
https://metraipolis.com/documento/dc_c52ee8f09cdc
How to cite
The complexity of tilting — arXiv:2610.41064 — arXiv (en), https://arxiv.org/abs/2610.41064 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c52ee8f09cdc (Metraipolis archive dc_c52ee8f09cdc, sha256 b2821caaed432978631492586a02906a9ce882b08ef66a6d474cd196e571a758)
BibTeX
@misc{dcc52ee8f09cdc,
title = {The complexity of tilting — arXiv:2610.41064},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41064},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c52ee8f09cdc; sha256 b2821caaed432978631492586a02906a9ce882b08ef66a6d474cd196e571a758},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41064. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Many explicit constructions in algebra are not first-order definable in classical finitary logic, but are, however, definable in infinitary logic. The aim of this paper is to show how infinitary logic can be used to lift model-theoretic results in arithmetic to a quantifier-sensitive form. We apply this idea to a deep result of Jahnke and Kartas on the model theory of perfectoid fields. Our main result is that a first-order sentence $\phi$ holds in the tilt $k^{\flat}$ of a perfectoid field $k$ if and only if a certain sentence $\phi^{\natural}$ holds in a non-principal ultrapower of $k$, where $\phi^{\natural}$ does not depend on $k$ and is only slightly more complicated than $\phi$ itself. In particular, tilting preserves the Lévy hierarchy in a precise sense. To this end, we prove that the Standard Decomposition of a valued field at a constant $t$ is infinitarily interpretable by formulas of rank at most 1.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic (math.LO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2610.41064 — 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-02T04:48:28.143Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).