ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Question 5 (Pheidas). An additive polynomial in Fp[Z] is a polynomial of the form

F (Z) = α0Z + α1Zp + α2Zp2

  • · · · + αnZpn

(αi ∈ Fp)

These are the polynomials that satisfy f (A + B) = f (A) + f (B) for all A, B ∈ Fp[Z]. Can we Diophantinely define the additive polynomials? (Demeyer) The following suggestion by Pheidas does not work:

(∃A, B, C, L, M, N ∈ Fp[Z])( ∃α, β, γ, λ, μ, ν ∈ Fp)

F = ( Ap − A) + αZ

∧ F 2 = ( Bp − B) + βZ + ( Cp − C)Z + γZ 2

∧ F 3 = ( Lp − L) + λZ + ( M p − M )Z + μZ 2 + ( N p − N )Z2 + νZ 3...Continue this up to some power F n. All additive polynomials satisfy this predicate, but also the following non-additive polynomial satisfies, no matter how many equations you add:

p−1

∑

i=0

(Z2p − Zp+1 )pi

Fact 6 (Cornelissen). Here is an example of a non-commutative undecidable theory. Let

L be any field of characteristic p > 0. Let AL denote the ring of additive polynomials with coefficients from L (a ring for addition and composition). Then f ◦ Zp = Zp ◦ f is a Diophantine definition of AFp

∼= Fp[Z] in AL.The same works in the quotient skew field QL of AL. Hence the Diophantine theory of

AL and QL in a ring language augmented by a symbol for Z is undecidable (since the theories of Fq[Z] and Fq(Z) are by Denef and Pheidas). If one can therefore give a Diophantine definition of AL or QL in L[Z] or L(Z), the theory of the latter would be undecidable.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.