ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Question 7 (Davis). Let H be the quaternions over Q, and

O = Z + iZ + jZ + kZ

(1) Is there an algorithm to decide whether a noncommutative polynomial equation f (x1,..., x n) = 0 with coefficients in Q has a solution in H?

(2) Is there an algorithm to decide whether a noncommutative polynomial equation f (x1,..., x n) = 0 with coefficients in Q has a solution in O?PROBLEMS RELATED TO "EXTENSIONS OF HILBERT'S TENTH PROBLEM" 3

(3) Is there an algorithm to decide whether a noncommutative polynomial equation f (x1,..., x n) = 0 with coefficients in H has a solution in H?

(4) Is there an algorithm to decide whether a noncommutative polynomial equation f (x1,..., x n) = 0 with coefficients in H has a solution in O?Is Z existentially definable in O? This probably works:

x ∈ Z ⇐⇒ (∃I, J, K )( I2 = −1 ∧ J2 = −1 ∧ IJ = −JI ∧ xI = Ix ∧ xJ = Jx )

Very likely done by D. Tunc. This solves the problems 2 and 4. In an analogous way, Q should be Diophantine in H. So, 1 and 3 are equivalent with Hilbert's Tenth Problem over Q.Same questions for the matrix rings Mn(Z) and Mn(Q).

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.