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

Audited against arXiv v3

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

Generated September 26, 2026
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.

Theorem 1.2No issue found

The intrinsic Pollington–Velani bound holds

Pages 2 and 4–9 · Theorem 1.2 and Section 3 · arXiv:1502.07648v3

Let β<α\beta<\alpha. After the repaired quadratic-neighborhood lemma, every ambient hyperplane section satisfies ν(B∩N(L∩Z,ερ))≪εβν(B)\nu(B\cap\mathcal N(\mathcal L\cap Z,\varepsilon\rho))\ll\varepsilon^\beta\nu(B). The intrinsic simplex lemma places rational points of denominator at most κ/ρn\kappa/\rho_n in one affine hyperplane on each ball of radius ρn\rho_n. For an approximant with exponent c′>cc'>c, minimality of nn gives q>(κ/2)ρn−1q>(\kappa/2)\rho_n^{-1}, hence q−c′≪ρnc′≤ρncq^{-c'}\ll\rho_n^{c'}\leq\rho_n^c for large nn. A maximal ρnc\rho_n^c-separated cover then has ss-cost bounded by ∑nρnc(s−δ)+β(c−1),\sum_n \rho_n^{c(s-\delta)+\beta(c-1)}, which converges whenever s>δ−β(1−1/c)s>\delta-\beta(1-1/c). Letting β↑α\beta\uparrow\alpha proves the displayed bound δ−α(1−1/c)\delta-\alpha(1-1/c).

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.

Lemma 3.4Suspected incorrect as written · an apparently sound repair

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 AA is chosen in the ambient set N(B∩Γ,ερ)\mathcal N(B\cap\Gamma,\varepsilon\rho), but the proof then treats y,z∈Rky,z\in\mathbb R^k as points of the graph domain S⊆Rk−1S\subseteq\mathbb R^{k-1}, writes f(y)f(y) and f(z)f(z), and invokes a path in SS joining them. Moreover, yy need not lie in Supp⁡(μ)\operatorname{Supp}(\mu), so the absolute-decay estimate for B(y,ρ~)B(y,\widetilde\rho) is not available. Finally, the assertion that all of B∩ΓB\cap\Gamma lies near the tangent plane at one local center is false; only the corresponding local piece can do so. For a verified repair, put E=N(B∩Γ,ερ)∩Supp⁡(μ)E=\mathcal N(B\cap\Gamma,\varepsilon\rho)\cap\operatorname{Supp}(\mu) and take A⊆EA\subseteq E maximal ρ~\widetilde\rho-separated, where ρ~=ερ/2\widetilde\rho=\sqrt\varepsilon\rho/2. For each y∈Ay\in A and each measured point w∈B(y,ρ~)∩Ew\in B(y,\widetilde\rho)\cap E, choose graph points (u,f(u)),(v,f(v))∈B∩Γ(u,f(u)),(v,f(v))\in B\cap\Gamma within ερ\varepsilon\rho of y,wy,w. Their domain coordinates are O(ρ~)O(\widetilde\rho) apart. The K1K_1-quasiconvex path from uu to vv and the bound ∥f′′∥≤K2/ρ\|f''\|\leq K_2/\rho put the local graph piece within O(ε ρ~)O(\sqrt\varepsilon\,\widetilde\rho) of the tangent hyperplane at (u,f(u))(u,f(u)); adding the two endpoint errors has the same order. Absolute α\alpha-decay at the support center yy, bounded overlap, and the printed iteration then give (3.1) and (3.2), with only the implicit constant changed.

Lemma 3.5Suspected incorrect as written · an apparently sound repair

Signed permutations of one dominant-coordinate patch do not cover a general diagonal quadric

Page 6 · paragraph defining Z~\widetilde Z in the proof of Lemma 3.5 · arXiv:1502.07648v3

After diagonalizing P(x)=∑icixi2−bP(x)=\sum_i c_i x_i^2-b, the proof claims Z=G(Z~)Z=G(\widetilde Z) for the signed permutation group GG. This is false when the coefficients cic_i are unequal, because permuting coordinates need not preserve ZZ. Replace this assertion by the finite cover indexed by an orthant and a dominant coordinate jj: Zσ,j={x∈Z:sgn⁡(x)=σ, ∣cixi∣≤∣cjxj∣ for all i}.Z_{\sigma,j}=\{x\in Z:\operatorname{sgn}(x)=\sigma,\ |c_i x_i|\leq|c_jx_j|\text{ for all }i\}. Every point belongs to such a patch by choosing jj maximizing ∣cjxj∣|c_jx_j|. On each patch solve for the coordinate xjx_j with its fixed sign. The derivative calculation printed for j=kj=k is unchanged after relabeling and gives ∣fi′∣≤1|f_i'|\leq1 and ∣fiℓ′′∣≪1/min⁡m∣xm∣|f_{i\ell}''|\ll1/\min_m|x_m|. There are only 2kk2^k k patches, so the uniform estimate survives the finite union.

Lemma 3.5Suspected incomplete as written · an apparently sound repair

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 Rn={ρn+1≤min⁡ixi≤ρn}R_n=\{\rho_{n+1}\leq\min_i x_i\leq\rho_n\} for n≥0n\geq0 omit points with min⁡ixi>ρ\min_i x_i>\rho. Also, a maximal separated set in B∩Rn∩Supp⁡(μ)B\cap R_n\cap\operatorname{Supp}(\mu) need not cover the measured set B∩N(Γ(Sn,f),ερ)B\cap\mathcal N(\Gamma(S_n,f),\varepsilon\rho), whose support points can lie outside RnR_n. A complete repair is as follows. First handle the portion with min⁡ixi>ρ\min_i x_i>\rho as one bounded local rectangle around BB: there ∥f′′∥≪1/ρ\|f''\|\ll1/\rho, so Lemma 3.4 directly gives O(εβμ(B))O(\varepsilon^\beta\mu(B)). For shells satisfying ρn≥ερ\rho_n\geq\varepsilon\rho, choose a maximal ρn\rho_n-separated set in B∩N(Γ(Sn,f),ερ)∩Supp⁡(μ)B\cap\mathcal N(\Gamma(S_n,f),\varepsilon\rho)\cap\operatorname{Supp}(\mu). These centers are O(ρn)O(\rho_n) from the union VV of coordinate hyperplanes; Lemma 3.4, bounded overlap, and absolute decay therefore give μ(En)≪(ερ/ρn)β(ρn/ρ)αμ(B)=εβ2−n(α−β)μ(B).\mu(E_n)\ll(\varepsilon\rho/\rho_n)^\beta(\rho_n/\rho)^\alpha\mu(B)=\varepsilon^\beta2^{-n(\alpha-\beta)}\mu(B). The sum converges because β<α\beta<\alpha. The remaining tail ρn<ερ\rho_n<\varepsilon\rho lies, after the outer neighborhood is added, in N(V,O(ερ))\mathcal N(V,O(\varepsilon\rho)) and has measure O(εαμ(B))O(\varepsilon^\alpha\mu(B)), hence O(εβμ(B))O(\varepsilon^\beta\mu(B)). Coordinate-hyperplane points themselves are included in the same last estimate. This proves Lemma 3.5 with the stated uniformity.

Corollary 3.7Suspected typo

The ball radius and neighborhood scale use different variable names

Page 8 · statement of Corollary 3.7 · arXiv:1502.07648v3

The ball is written B=B(x,r)B=B(x,r) but the neighborhood thickness is ερ\varepsilon\rho. Replace rr by ρ\rho in the ball, or replace ερ\varepsilon\rho by εr\varepsilon r. The proof and the application on page 9 use one common radius, so the correction is uniquely determined and harmless.

Proof of Theorem 1.2Suspected typo

The minimal-denominator index is reversed

Page 8 · final paragraph before the covering conclusion · arXiv:1502.07648v3

If nn is minimal with q≤κρn−1q\leq\kappa\rho_n^{-1} and ρn=2−n\rho_n=2^{-n}, minimality gives q>κρn−1−1=κ2ρn−1,q>\kappa\rho_{n-1}^{-1}=\frac{\kappa}{2}\rho_n^{-1}, not q≥κρn+1−1q\geq\kappa\rho_{n+1}^{-1}. The printed version is incompatible with the defining upper bound. The next displayed estimate q−c′≤(2/κ)c′ρnc′q^{-c'}\leq(2/\kappa)^{c'}\rho_n^{c'} is exactly the consequence of the corrected n−1n-1 inequality, so the proof already proceeds with the intended index.

Section 3.4Correct and complete after the apparently sound repairs above

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 ρnc−1\rho_n^{c-1} yields the exponent c(s−δ)+β(c−1)c(s-\delta)+\beta(c-1), and its positivity is equivalent to s>δ−β(1−1/c)s>\delta-\beta(1-1/c). No endpoint or quantifier is lost when c=1c=1, and taking arbitrary β<α\beta<\alpha 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.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:1502.07648v3
Authors listed
Lior Fishman, Keith Merrill, David Simmons
Audit date
September 26, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.