arXiv:1808.07070v1
Abstract
We give elementary proof of stronger versions of several recent results on intrinsic Diophantine approximation on rational quadric hypersurfaces . The main tool is a refinement of the simplex lemma, which essentially says that rational points on which are sufficiently close to each other must lie on a totally isotropic rational subspace of .
AI-generated audit
Audit summary
Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.
Current report
Detailed mathematical audit
01Statements2 reported findingsCorrect
The quadric simplex lemma and the resulting extremality, Hausdorff-dimension, and winning theorems are correct. Two symbols in the simplex calculation have unique typographical repairs.
Low-height rational points lie in one totally isotropic rational subspace
Pages 6--7 · simplex lemma for quadric hypersurfaces · arXiv:1808.07070v1
The Dani estimate sends every rational point of height at most in a -ball to an integer isotropic vector of uniformly small norm. For two such vectors, integrality and the quadratic bound give , hence both values vanish. Pairwise vanishing of the associated bilinear form makes their rational span totally isotropic.
The three metric consequences have the stated exponents
Pages 8--12 · applications to intrinsic approximation · arXiv:1808.07070v1
Isotropic absolute decay and the simplex lemma give a summable cover of points with exponent above one. Hausdorff--Cantelli applied with the regularity and decay exponents yields the displayed dimension upper bound. In the isotropic-subspace game, deleting the subspace supplied by the simplex lemma prevents every dangerous rational approximation at the relevant scale, proving the winning result and its thickness consequence.
02Proofs3 reported findingsCorrect
The dynamical estimate, integrality argument, covering sums, and winning strategy are correct. The simplex proof contains a missing absolute-value pair and one coordinate-name typo, both mechanically repairable.
Absolute values are missing from the quadratic-form estimate
Page 7 · final display in the proof of the simplex lemma · arXiv:1808.07070v1
The preceding sentence says it is enough to prove , and the chosen constant satisfies . The next display drops the absolute-value bars around both occurrences of . Restoring them is uniquely determined, and then the displayed bound proves the required integrality conclusion.
The terminal coordinate is named inconsistently
Page 6 · Dani-correspondence estimate · arXiv:1808.07070v1
The decomposition uses coordinates and derives a bound for from , but the following line prints . Replacing by is forced by the decomposition and gives the third term in the asserted maximum.
The metric applications use the simplex scale in the correct direction
Pages 8--12 · proofs of the application theorems · arXiv:1808.07070v1
For a height block , balls have radius , small enough for the simplex bound and large enough to contain every approximation ball. Decay contributes the summable factor . The dimension and game arguments use the same scale with the correct rank bound on isotropic subspaces.
03Novelty0 reported findingsNo non-novelty findings
No non-novelty findings.