Search arXivSearch

arXiv · 2212.05366

Specialization of Difference Equations and High Frobenius Powers

Abstract

We study valued fields equipped with an automorphism $σ$ which is locally infinitely contracting in the sense that $α\llσα$ for all $0<α\inΓ$. We show that various notions of valuation theory, such as Henselian and strictly Henselian hulls, admit meaningful transformal analogues. We prove canonical amalgamation results, and exhibit the way that transformal wild ramification is controlled by torsors over generalized vector groups. Model theoretically, we determine the model companion: it is decidable, admits a simple axiomatization, and enjoys elimination of quantifiers up to algebraically bounded quantifiers. The model companion is shown to agree with the limit theory of the Frobenius action on an algebraically closed and nontrivially valued field. This opens the way to a motivic intersection theory for difference varieties that was previously available only in characteristic zero. As a first consequence, the class of algebraically closed valued fields equipped with a distinguished Frobenius $x\mapsto x^{q}$ is decidable, uniformly in $q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuval Dor, Ehud Hrushovski. 2025-06-08. Specialization of Difference Equations and High Frobenius Powers. https://arxiv.org/abs/2212.05366

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

KEEP EXPLORING

Related papers

On Banach and Kuratowski Theorem and generalized strong sequences

In 1929, Banach and Kuratowski proved under CH a combinatorial theorem, which implies that there is not a non-vanishing $σ$-additive finite measure on $\mathbb{R}$ which is defined for every set of reals. In 2003 Bartoszyński and Halbeisen proved that Banach and Kuratowski theorem is equivalent to the existence of a K-Lusin set of the cardinality continuum an the existence of such sets is independent of $ZFC + \neg CH$. On the other hand in 1965 Efimov introduced the strong sequences method which used to prove some well-known theorems in dyadic spaces. The aim of this paper is to show that all this notions can be generalized, i.e. considered in the generalized Baire space and to show some equivalences among them. Moreover, some applications in the direction of calibres, boundedness and partitions relations are also shown.

math.LO

Diamonds in mice

Let $M$ be a $(0,ω_1+1)$-iterable mouse with no largest cardinal. Let $γ\leqκ$ be uncountable cardinals of $M$, with $κ$ regular in $M$. Then $M$ satisfies $\diamondsuit_{κγ}^+$, and if $κ$ is non-ineffable in $M$ then $M$ satisfies $\diamondsuit_{κκ}^+$. Suppose that either $ω_1^M=ω_1$ or $M$ satisfies "I am $(0,ω_1+1)$-iterable". Let $κ\geqω_1^M$ be a cardinal of $M$. Then $M$ satisfies $\diamondsuit^*_{κω_1^M}$.

math.LO

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO