Nonstandard polynomials: algebraic properties and elementary equivalence

Abstract

We solve the first-order classification problem for rings R of polynomials F[x1, …,xn] and Laurent polynomials F[x1,x1-1, …,xn,xn-1] with coefficients in an infinite field F or the ring of integers Z, that is, we describe the algebraic structure of all rings S that are first-order equivalent to R. Our approach is based on a new and very powerful method of regular bi-interpretations, or more precisely, regular invertible interpretations. Namely, we prove that F[x1, …,xn] and F[x1,x1-1, …,xn,xn-1] are regularly bi-interpretable with the list superstructure S(F, N) of F, which is equivalent to regular bi-interpretation with the superstructure HF(F) of hereditary finite sets over F. The expressive power of S(F, N) is the same as that of the weak second-order logic over F. Hence, the first-order logic in R = F[x1, …,xn] or R = F[x1,x1-1, …,xn,xn-1] is equivalent to the weak second-order logic in F (following the terminology of Kharlampovich, Myasnikov, and Sohrabi [16], such structures are necessarily rich), which allows one to describe the algebraic structure of all rings S with S R. In fact, these rings S are precisely the ``non-standard'' models of R, like in non-standard arithmetic or non-standard analysis. This is particularly straightforward when F is regularly bi-interpretable with N, in this case the ring R is also bi-interpretable with N. Using our approach, we describe various, sometimes rather surprising, algebraic and model-theoretic properties of the non-standard models of R.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…