SearcharxivSearch

arXiv · 2505.07518

On Lambda functions in henselian and separably tame valued fields

Abstract

Given a field extension $F/C$, the ``Lambda closure'' $\Lambda_{F}C$ of $C$ in $F$ is a subextension of $F/C$ that is minimal with respect to inclusion such that $F/\Lambda_{F}C$ is separable. The existence and uniqueness of $\Lambda_{F}C$ was proved by Deveney and Mordeson in 1977. We show that it admits a simple description in terms of given generators for $C$: we expand the language of rings by the parameterized Lambda functions, and then $\Lambda_{F}C$ is the subfield of $F$ generated over $C$ by additionally closing under these functions. We then show that, given particular generators of $C$, $\Lambda_{F}C$ is the subfield of $F$ generated iteratively by the images of the generators under Lambda functions taken with respect to $p$-independent tuples also drawn from those generators. We apply these results to given a ``local description'' of existentially definable sets in fields equipped with a henselian topology. Let $X(K)$ be an existentially definable set in the theory of a field $K$ equipped with a henselian topology $\tau$. We show that there is a definable injection into $X(K)$ from a Zariski-open subset $U_{1}^{\circ}$ of a set with nonempty $\tau$-interior, and that each element of $U_{1}^{\circ}$ is interalgebraic (over parameters) with its image in $X(K)$. This can be seen as a kind of {\em very weak local quantifier elimination}, and it shows that existentially definable sets are (at least generically and locally) definably pararameterized by ``big'' sets. In the final section we extend the theory of separably tame valued fields, developed by Kuhlmann and Pal, to include the case of infinite degree of imperfection, and to allow expansions of the residue field and value group structures. We prove an embedding theorem which allows us to deduce the usual kinds of resplendent Ax--Kochen/Ershov principles.

Explore related subjects

Keep this discovery

BibTeXRIS

Sylvy Anscombe. 2025-05-12. On Lambda functions in henselian and separably tame valued fields. https://arxiv.org/abs/2505.07518

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO