Abstract

We establish that the set of pairs (α,β)(α, β) of real numbers such that lim infq+q(logq)2qαqβ>0, \liminf_{q \to + \infty} q \cdot (\log q)^2 \cdot \Vert q α\Vert \cdot \Vert q β\Vert > 0, where \Vert \cdot \Vert denotes the distance to the nearest integer, has full Hausdorff dimension in R2\R^2. Our proof rests on a method introduced by Peres and Schlag, that we further apply to various Littlewood-type problems

AI-generated audit

Audit summary

Audited against arXiv v1

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

Generated August 20, 2026
01Statements4 reported findingsCorrect

The full-dimension results for multiplicatively badly approximable pairs, their logarithmically refined and mixed pp-adic forms, and the dual two-variable form are correct. Theorem 4 needs only the displayed boundary correction x,y1x,y\geq1: allowing a zero coordinate would trivially force its infimum to vanish. Its two-dimensional Peres–Schlag proof also needs a local geometric repair, supplied below, which preserves the theorem. No substantive counterexample to a central result was found.

Theorems 1 and 2Correct

Multiplicatively badly approximable pairs have full dimension

Pages 2 and 7–10 · Theorems 1–2 and proof of Theorem 1 · arXiv:0905.0830v1

For each fixed αBad\alpha\in\operatorname{Bad}, the dangerous intervals around y/xy/x have radii proportional to (αxx2(logx)2)1(\lVert\alpha x\rVert x^2(\log x)^2)^{-1}. Lemma 2 makes their total loss uniformly small on every cubic block. The nested dyadic construction therefore retains a Cantor set, and its branching/separation ratio tends to one, giving full dimension in the β\beta fiber. Since the set of admissible α\alpha also has dimension one, the cited slicing principle gives dimension two for the set of pairs.

Theorem 3Correct

The logarithmically refined fiber theorem

Page 3 and pages 6 and 10 · Theorem 3, Lemma 3, and proof reduction · arXiv:0905.0830v1

Bounded continued-fraction quotients for αBad\alpha\in\operatorname{Bad} give uniform distribution on each denominator block and x=qq31αxx(log(1/αx))a(logq)2a.\sum_{x=q}^{q^3}\frac{1}{\lVert\alpha x\rVert x(\log(1/\lVert\alpha x\rVert))^a}\ll(\log q)^{2-a}. This is exactly the loss estimate needed after replacing (logx)2(\log x)^2 by (logx)2a(log(1/αx))a(\log x)^{2-a}(\log(1/\lVert\alpha x\rVert))^a. The original branching argument is unchanged, so the full-dimension conclusion follows.

Theorem 5 and Corollary 1Correct

The mixed pp-adic full-dimension result

Pages 4 and 7 and 10 · Theorem 5, Lemma 4, and proof reduction · arXiv:0905.0830v1

Splitting integers by vp(x)=jv_p(x)=j yields x=qq31xxp(log(2/xp))a(logq)2a.\sum_{x=q}^{q^3}\frac{1}{x|x|_p(\log(2/|x|_p))^a}\ll(\log q)^{2-a}. Thus the dangerous intervals with the mixed pp-adic weight satisfy the same block-loss bound as in Theorem 1. The Cantor construction gives full Hausdorff dimension, and setting a=0a=0 gives Corollary 1.

Theorem 4Minor formal correction

The dual two-variable theorem needs a boundary correction

Page 4 and pages 10–11 · Theorem 4 and proof outline · arXiv:0905.0830v1

The displayed infimum must range over positive integers x,y1x,y\geq1, or equivalently over integer pairs with xy0xy\neq0. With the printed x,y0x,y\geq0, setting x=0x=0 and taking denominators of β\beta forces 2yβ(log2)22\lVert y\beta\rVert(\log2)^2 to have infimum zero. Every subsequent estimate groups pairs by qxyq3q\leq|xy|\leq q^3 and therefore already uses xy0xy\neq0. Changing the boundary in the one displayed statement repairs the issue without altering any related claim.

02Proofs4 reported findingsContains incorrect or incomplete proofs

The one-dimensional Cantor construction and the logarithmic and pp-adic adaptations are correct. The proof outline for Theorem 4 incorrectly says that a fixed pair (x,y)(x,y) determines a unique integer level in the unit square and omits the resulting local strip-count calculation. Accounting for all relevant levels supplies a verified repair with the same summability bound.

Proof of Theorem 1Correct

The dyadic survival and mass-distribution estimates close

Pages 7–10 · equations (4.1)–(4.10) and conclusion · arXiv:0905.0830v1

Bad approximability supplies both qαδ/q\lVert q\alpha\rVert\geq\delta/q and the uniform block sum in Lemma 2. Each retained dyadic interval loses at most a fixed small fraction to the next cubic block of dangerous sets. The construction keeps at least mk=2Lk+1Lk5m_k=2^{L_{k+1}-L_k-5} mutually separated children. Since 2Lkqk2(logqk)22^{L_k}\gg q_k^2(\log q_k)^2 and qk=q03kq_k=q_0^{3^k}, the mass-distribution quotient tends to one. Hence the resulting set is nonempty and has Hausdorff dimension one.

Lemmas 2–4Correct

All three block-sum estimates have the required uniform scale

Pages 5–7 · Lemmas 2–4 · arXiv:0905.0830v1

Lemma 2 follows by dividing the classical partial sum xm(αxx)1(logm)2\sum_{x\leq m}(\lVert\alpha x\rVert x)^{-1}\ll(\log m)^2 by the minimum (logx)2(\log x)^2 on [q,q3][q,q^3]. Lemma 3 decomposes into convergent-denominator blocks; bounded partial quotients make their number O(logq)O(\log q) and each weighted block O((logq)1a)O((\log q)^{1-a}). Lemma 4 decomposes by the exact pp-adic valuation and sums O(logq/(j+1)a)O(\log q/(j+1)^a) over j=O(logq)j=O(\log q). These are precisely the uniform bounds used later.

Proof outline for Theorem 4Incorrect as written · verified repair

A fixed normal vector has many integer levels, not one

Pages 10–11 · proof of Theorem 4 · arXiv:0905.0830v1

For fixed positive integers (x,y)(x,y), the unit square meets generally x+y+O(1)x+y+O(1) lines xX+yY+z=0xX+yY+z=0, not a unique line as stated. Each corresponding dangerous strip has width O(εx,y/x2+y2)O(\varepsilon_{x,y}/\sqrt{x^2+y^2}) and intersection length at most 2\sqrt2. Since (x+y)/x2+y2=O(1)(x+y)/\sqrt{x^2+y^2}=O(1), the total area over all relevant zz is still O(εx,y)O(\varepsilon_{x,y}). The same estimate holds locally in every retained dyadic square, with only a boundary constant. Therefore qxyq3O(εx,y)εlogq,\sum_{q\leq xy\leq q^3}O(\varepsilon_{x,y})\ll\frac{\varepsilon}{\log q}, and the two-dimensional Cantor/mass-distribution construction proceeds exactly as in Theorem 1. This supplies the missing multiplicity calculation and verifies the theorem.

Proof of Theorem 3Typo

The convergent-index order is reversed in one sentence

Page 6 · proof of Lemma 3 · arXiv:0905.0830v1

If mm is the largest index with qmqq_m\leq q and nn the smallest with qnq3q_n\geq q^3, then mnm\leq n and both are comparable to logq\log q. The printed chain logqnmlogq\log q\ll n\ll m\ll\log q reverses their order; it should state logqmnlogq\log q\ll m\leq n\ll\log q. The proof immediately sums from j=mj=m to nn and therefore uses the corrected order.

03Novelty0 reported findingsNo non-novelty findings

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:0905.0830v1
Authors listed
Yann Bugeaud, Nikolay Moshchevitin
Audit date
August 20, 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.