What was already known
Undecidability over the integers does not automatically imply undecidability over the rationals. Enumerating rational solutions can confirm their existence but cannot generally confirm their absence.
What changed and why it matters
Resolves the rational version of a recognized undecidability problem, beyond the established integer case.
The AI contribution
OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.
Limitations
This is a rational-solvability decision problem with variable dimension. It does not rule out decision algorithms for particular restricted polynomial classes. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.
Accessible artifact / proof
The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.
Correction and publication history
Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.
Read this published revision