arXiv:1502.07648v3
Abstract
We prove an analogue of a theorem of A. Pollington and S. Velani ('05), furnishing an upper bound on the Hausdorff dimension of certain subsets of the set of very well intrinsically approximable points on a quadratic hypersurface. The proof incorporates the framework of intrinsic approximation on such hypersurfaces first developed in the authors' joint work with D. Kleinbock (preprint '14) with ideas from work of D. Kleinbock, E. Lindenstrauss, and B. Weiss ('04).
AI-generated audit
Audit summary
Not a correctness certificate. A green “no issues found” result may include yellow suspected typos or minor formal issues 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
01Statements1 reported findingNo statement issues found
The Hausdorff-dimension upper bound for very well intrinsically approximable points on quadratic hypersurfaces is correct. Several defects in the printed neighborhood estimates admit a complete verified repair without changing the theorem's hypotheses or conclusion.
The intrinsic Pollington–Velani bound holds
Pages 2 and 4–9 · Theorem 1.2 and Section 3 · arXiv:1502.07648v3
Let . After the repaired quadratic-neighborhood lemma, every ambient hyperplane section satisfies . The intrinsic simplex lemma places rational points of denominator at most in one affine hyperplane on each ball of radius . For an approximant with exponent , minimality of gives , hence for large . A maximal -separated cover then has -cost bounded by which converges whenever . Letting proves the displayed bound .
Exact arXiv version 3 ↗02Proofs6 reported findingsSuspected incomplete or incorrect proofs
The final Hausdorff–Cantelli argument is sound once its inputs are repaired, but the printed proofs of Lemmas 3.4 and 3.5 contain false inclusions and omit necessary covering cases. The repairs below are complete and preserve all stated constants up to the paper's coarse multiplicative notation.
The tangent-plane estimate is applied to points outside the graph domain
Page 5 · proof of equation (3.1) in Lemma 3.4 · arXiv:1502.07648v3
The maximal separated set is chosen in the ambient set , but the proof then treats as points of the graph domain , writes and , and invokes a path in joining them. Moreover, need not lie in , so the absolute-decay estimate for is not available. Finally, the assertion that all of lies near the tangent plane at one local center is false; only the corresponding local piece can do so. For a verified repair, put and take maximal -separated, where . For each and each measured point , choose graph points within of . Their domain coordinates are apart. The -quasiconvex path from to and the bound put the local graph piece within of the tangent hyperplane at ; adding the two endpoint errors has the same order. Absolute -decay at the support center , bounded overlap, and the printed iteration then give (3.1) and (3.2), with only the implicit constant changed.
Signed permutations of one dominant-coordinate patch do not cover a general diagonal quadric
Page 6 · paragraph defining in the proof of Lemma 3.5 · arXiv:1502.07648v3
After diagonalizing , the proof claims for the signed permutation group . This is false when the coefficients are unequal, because permuting coordinates need not preserve . Replace this assertion by the finite cover indexed by an orthant and a dominant coordinate : Every point belongs to such a patch by choosing maximizing . On each patch solve for the coordinate with its fixed sign. The derivative calculation printed for is unchanged after relabeling and gives and . There are only patches, so the uniform estimate survives the finite union.
The dyadic shells neither cover the far-from-axis part nor justify the displayed covering inequality
Page 7 · dyadic-shell argument in the proof of Lemma 3.5 · arXiv:1502.07648v3
The shells for omit points with . Also, a maximal separated set in need not cover the measured set , whose support points can lie outside . A complete repair is as follows. First handle the portion with as one bounded local rectangle around : there , so Lemma 3.4 directly gives . For shells satisfying , choose a maximal -separated set in . These centers are from the union of coordinate hyperplanes; Lemma 3.4, bounded overlap, and absolute decay therefore give The sum converges because . The remaining tail lies, after the outer neighborhood is added, in and has measure , hence . Coordinate-hyperplane points themselves are included in the same last estimate. This proves Lemma 3.5 with the stated uniformity.
The ball radius and neighborhood scale use different variable names
Page 8 · statement of Corollary 3.7 · arXiv:1502.07648v3
The ball is written but the neighborhood thickness is . Replace by in the ball, or replace by . The proof and the application on page 9 use one common radius, so the correction is uniquely determined and harmless.
The minimal-denominator index is reversed
Page 8 · final paragraph before the covering conclusion · arXiv:1502.07648v3
If is minimal with and , minimality gives not . The printed version is incompatible with the defining upper bound. The next displayed estimate is exactly the consequence of the corrected inequality, so the proof already proceeds with the intended index.
The Hausdorff–Cantelli cost calculation closes after the repaired neighborhood lemma
Pages 8–9 · proof of Theorem 1.2 · arXiv:1502.07648v3
Maximal separated sets cover the target limsup and have bounded multiplicity under the Ahlfors-regular measure. Corollary 3.8 supplies one affine hyperplane for the relevant rational points on each scale. Applying the repaired Corollary 3.7 with relative thickness yields the exponent , and its positivity is equivalent to . No endpoint or quantifier is lost when , and taking arbitrary gives the claimed limit. The exact arXiv version was subsequently published in Selecta Mathematica 24 (2018), 3875–3888, DOI 10.1007/s00029-018-0446-7.
Published article record ↗03Novelty0 reported findingsNo novelty concerns found
No non-novelty findings.