Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.18753

On separable pairs of fields and beautiful pairs of separably closed valued fields

Zhengqing He·Martin Hils
View original source ↗Read source document ↗Export metadata ↓

Abstract

We continue the study of beautiful pairs of henselian valued fields, initiated in joint work of the second author with Cubides Kovacsics and Ye. As our main result, we show that separably closed non-trivially valued fields of arbitrary imperfection degree admit beautiful pairs which are elementary pairs satisfying certain natural axioms. They satisfy beauty transfer, i.e., saturated models of their theory are again beautiful. The same holds for beautiful pairs associated to natural subclasses of all definable types, most notably for all definable types orthogonal to the value group and for all bounded definable types. This yields strict pro-definability of the space of the definable types from any of these classes, in the theory SCVF of separably closed non-trivially valued fields. We also show a separable analog of a classical result of Keisler's, namely that the first order theory of an infinite separable extension $L/K$ of fields - considered in the pairs language and where the large field $L$ is separably closed, is determined by the theory of the small field $K$ together with the imperfection degree of $L$ over $K$.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhengqing He, Martin Hils. 2026-10-13. On separable pairs of fields and beautiful pairs of separably closed valued fields. https://arxiv.org/abs/2610.18753

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

KEEP EXPLORING

Related papers

arXiv2026

Extension of Lipschitz maps definable in Hensel minimal structures

In this paper, we establish a theorem on extension of Lipschitz maps $f$ definable in Hensel minimal fields $K$. This may be regarded as a definable, non-Archimedean, non-locally compact version of Kirszbraun's extension theorem. We proceed with double induction with respect to the dimensions of the ambient space and of the domain of $f$. To this end, we introduce the concept of a definable open cell package with a skeleton which, along with the concept of a risometry, plays a key role in our induction procedure.

math.LO↗
arXiv2026

Convex Team Logics

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We introduce propositional/modal team logics which are expressively complete for the class of all convex propositional/modal team properties. We also answer an open question concerning the expressive power of classical propositional logic extended with the nonemptiness atom NE: we show that it is expressively complete for the class of all convex and union-closed properties. A modal analogue of this result additionally yields an expressive completeness theorem for Aloni's (2022) Bilateral State-Based Modal Logic. There is a specific sense in which one of the propositional convex logics we introduce extends propositional dependence logic; this sense corresponds to the existence of a compositional translation between the two logics. Another of the convex logics extends propositional inquisitive logic in the same manner. We generalize the notion of uniform definability, as considered in the team semantics literature, to formalize this notion of compositional extension.

math.LO↗
arXiv2026

A definable matching theorem and approximate Grothendieck semigroups

For an arbitrary first-order structure, we introduce the notion of an approximate Grothendieck semigroup, which satisfies a Banach-Schröder-Bernstein Theorem, as well as a weak Cancellation Law (wCL). At the heart of the proof of the wCL lies a definable matching theorem, which vastly generalizes a related result in Maříková \cite{mat}, and is of independent interest.

math.LO↗