Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.08530

Residually Dominated Groups in Henselian Valued Fields of Equicharacteristic Zero

Dicle Mutlu·Paul Z. Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce \emph{residually dominated groups} in pure henselian valued fields of equicharacteristic zero, as an analogue of stably dominated groups introduced by Hrushovski and Rideau-Kikuchi. We show that when $G$ is a residually dominated group, there is a finite-to-one group homomorphism from its connected component into a connected stably dominated group, and we study the functoriality and universality properties of this map. Moreover, we prove that residual domination is witnessed by a group homomorphism into a definable group in the residue field. In our proofs, we use the results of Montenegro, Onshuus, and Simon on groups definable in $\mathrm{NTP}_2$-theories that extend the theory of fields. Along the way, we also provide an algebraic characterization of residually dominated types, generalizing the work by Ealy, Haskell and Simon for stably dominated types in algebraically closed valued fields, and we study their properties.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dicle Mutlu, Paul Z. Wang. 2025-12-26. Residually Dominated Groups in Henselian Valued Fields of Equicharacteristic Zero. https://arxiv.org/abs/2502.08530

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

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗