Decidability of the theory of addition and the Frobenius map in rings of rational functions
Abstract
We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let p be a prime number, Fp the prime field with p elements, F a field algebraic over Fp and z a variable. We show that the structures of rings R, which are generated over F[z] by adjoining a finite set of inverses of irreducible polynomials of F[z] (e.g., R=Fp[z, 1z]), with addition, the Frobenius map x xp and the predicate '∈ F' - together with function symbols and constants that allow building all elements of Fp[z] - are model complete, i.e., each formula is equivalent to an existential formula. Further, we show that in these structures all questions, i.e., first order sentences, about the rings R may be, constructively, translated into questions about F.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.