Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.30762

Analytification and tropicalization via hyperfields and definable types

Pablo Cubides Kovacsics·Mariana Vicaría·Jinhe Ye
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the analytification and tropicalization of algebraic varieties over valued fields via Jun's spaces of hyperfield points. Our main new objects are a family of power-tropical hyperfields $H_n$ and their inverse limit $H$, recording at each level the class of a leading term modulo $n$-th powers of the residue field. They yield an enhanced tropicalization of the associated space $X(H)$, strictly finer than the Berkovich one exactly when the multiplicative group of the residue field is non-divisible: it specialises to the Berkovich analytification when the residue field is algebraically closed, to the real analytification of Jell-Scheiderer-Yu when it is real closed, and to a new $p$-adic analytification when it is $p$-adically closed. Over henselian valued fields of equicharacteristic $0$ we then construct a model-theoretic avatar of $X(H)$: the space $\widehat{X}_T$ of definable types orthogonal to the value group, which sharpens the geometry in the spirit of Hrushovski and Loeser and recovers their space over algebraically closed valued fields. We show that $\widehat{X}_T$ is strictly pro-definable, satisfies a model-theoretic Payne theorem, and definable compactness in such spaces satisfies a Heine-Borel type characterization. As an application, we analytify $p$-adic semi-algebraic sets and prove a strong density theorem for their tropicalizations, the exact $p$-adic counterpart of the real one of Jell-Scheiderer-Yu.

Explore related subjects

math.LOmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pablo Cubides Kovacsics, Mariana Vicaría, Jinhe Ye. 2026-10-22. Analytification and tropicalization via hyperfields and definable types. https://arxiv.org/abs/2610.30762

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Star operation, microscopic sets and porous sets

This paper explores the interplay between star operations, microscopic sets, and porous sets. The study focuses on the Galvin-Mycielski-Solovay theorem, which characterizes strongly measure zero sets and their interactions with meager sets. Results include the investigation of the star operation $\mathcal{F}^*$ and its properties. The paper also examines the relationship between porous sets and microscopic sets. Additionally, the work presents constructions of families $\mathcal{F}$ in $\mathcal{P}(\mathbb{Z}), \mathcal{P}(\mathbb{Z}^ω),$ and $\mathcal{P}(2^ω)$ that satisfy $\mathcal{F} = \mathcal{F}^*$. Theorems and lemmas are provided to establish conditions under which $\mathcal{F}^{**} = \mathcal{F}$ and to analyze the implications of the Borel Conjecture and its dual. The paper concludes with a discussion of microscopic sets and their properties, including their interactions with porous sets and the non-equivalence of certain classes of sets.

math.LO↗
arXiv2026

The Cofinality of Generating Familes

The topology of a separable metrizable space $M$ is \emph{generated} by a family $\mathcal{C}$ of its subsets provided that a set $A\subseteq M$ is closed in $M$ if and only if $A\cap C$ is closed in $C$ for each $C\in \mathcal{C}$. The \emph{sequentiality number}, $\mathop{seq}(M)$, and \emph{$k$-ness number}, $\mathop{k}(M)$, of $M$, are the minimum size of a generating family of convergent sequences, respectively compact subsets. Let $\mathfrak{b}$ be the minimum size of an unbounded set in $ω^ω$ with the mod finite order. For a cardinal $κ$, the \emph{covering number}, $\mathop{cov}(κ)$, is the minimum size of a family of countable subsets of $κ$ so that every countable subset of $κ$ is contained in an element of the family. It is shown using the Tukey order on relations that (1) $\mathop{seq}(M)=\mathop{cov}(|M|)\cdot \mathfrak{b}$, unless $M$ is locally small (every point of $M$ has a neighborhood of size strictly less than $|M|$) in which case $\mathop{seq}(M)=\lim_{μ<|M|} \mathop{cov}(μ)\cdot \mathfrak{b}$ and (2) $k(M)$ is in the interval $[kc(M)\cdot\mathfrak{b},\mathop{cov}(kc(M))\cdot \mathfrak{b}]$, where $kc(M)$ is the minimum number of compact sets that cover $M$. Solutions to problems of van Douwen's on the $k$-ness number of analytic and of co-analytic spaces are deduced.

math.LO↗
arXiv2026

The Game-Theoretic Katětov Order and Idealised Effective Subtoposes

This paper addresses the longstanding problem of determining the structure of the $\leq_{\mathrm{LT}}$-order in the Effective Topos, known to effectively embed the Turing degrees. In a surprising discovery, we show that the $\leq_{\mathrm{LT}}$-order is in fact tightly controlled by the combinatorics of filters on $ω$, raising deep questions about how combinatorial and computable complexity interact, both within this order and beyond it. To make the connection precise, we introduce a game-theoretic (''gamified'') variant of the Katětov order on filters over $ω$, which turns out to exhibit a striking mix of coarseness and subtlety. For one, it is strictly coarser than the classical Rudin-Keisler order and, when viewed dually on ideals, collapses all MAD families to a single equivalence class. On the other hand, the order also supports a rich internal structure, including an infinite strictly ascending chain of ideal classes, which we identify by way of a new separation technique. From the computability-theoretic perspective, we show that a computable (and extended) variant of the gamified Katětov order is isomorphic to the original $\leq_{\mathrm{LT}}$-order. Moreover, our work brings into focus a new degree-spectrum invariant for filters $\mathcal{F}$, $$\mathcal{D}_{\mathrm{T}}(\mathcal{F}):=\{\,[f\colonω\toω] \mid f\leq_{\mathrm{LT}} \mathcal{F} \},$$ which is shown to always determine a proper initial segment of the Turing degrees. Extending this, given any non-principal $Δ^1_1$ filter $\mathcal{F}$, we show that $\mathcal{D}_{\mathrm{T}}(\mathcal{F})$ is precisely the class of hyperarithmetic degrees. This significantly generalises previous results obtained by van Oosten \cite{vO14} and Kihara \cite{Kih23}. The proofs draw on ideas from general topology, descriptive set theory, and computability theory.

math.LO↗