Published October 6, 2026 | Version v1

Rational-point undecidability for smooth projective varieties over the rational numbers

Authors/Creators

Description

Combining OpenAI's negative solution of rational Hilbert's tenth problem, with two explicit proof corrections documented in the verification package, and Poonen's established effective transfer, this note proves undecidability of rational-point existence for arbitrary smooth projective geometrically integral varieties over Q. It specifies homogeneous-equation presentations and valid-input oracle use, and rules out a computable uniform bound on the height of one point in terms of presentation size. Dimension and all size parameters may vary. The arithmetic breakthrough is attributed to OpenAI and the geometric reduction to Poonen; no independent solution of rational Hilbert's tenth problem, new geometric reduction, fixed-dimensional theorem, many-one hardness or first-priority claim is made. AI tools were used extensively in research, drafting and adversarial verification. The preprint has not undergone conventional human peer review or refereeing at publication; no complete formal verification is claimed. The standalone height supplement explicitly states its retained geometric inputs.

Files

height-repair.pdf

Files (388.1 kB)

Name Size
md5:aab7cf1207a732a1e9a355199366d844
99.8 kB Preview Download
md5:e1b04410f3db134422a7fd32fedb4a74
77.5 kB Preview Download
md5:374273984e824d01ba14f03daa967bc6
24.6 kB Preview Download
md5:bb8035930ba3e5f825896cb6b37cc37c
186.2 kB Preview Download

Additional details