arXiv:2610.15809v1
Abstract
Bugeaud, Haynes and Velani (2011) resolved a metric version of the -adic Littlewood conjecture. We establish a fully inhomogeneous generalisation of their result, as well as a partially inhomogeneous generalisation of a result of Harrap and Haynes (2013) in the more general mixed setting.
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
01Statements2 reported findingsNo statement issues found
The fully inhomogeneous fixed-prime theorem and the mixed-sequence extension follow from valid lower bounds for the totient-weighted divergence sums and the cited weak inhomogeneous Duffin–Schaeffer theorem. Two finite-domain conventions need local textual corrections, but neither changes a conclusion.
The shifted prime-adic factors supply the required logarithmic multiplicity
PDF pp. 2–4 · arXiv:2610.15809v1
For each vector of valuations with , the Chinese remainder parametrization leaves a fixed positive proportion of an interval of length . Lemma 2.1 gives the same-scale lower bound for the average of . Multiplication by the reciprocal prime-adic factors cancels the denominator product term by term; the valuation vectors then give the divergence criterion required by the cited theorem.
The mixed-sequence argument has the stated divergence strength
PDF pp. 5–6 · arXiv:2610.15809v1
On the layer and , supermultiplicativity of the totient and the AM–GM bound give . Summing through half the available divisibility chain yields . Since strict divisibility makes , the counting function satisfies , which justifies the condensed-series step even though its product with need not itself be monotone.
02Proofs4 reported findingsNo proof issues found
The totient averaging and dyadic summations are correct, and the external metric theorem has exactly the fixed-shift, unrestricted-numerator, finite-valued scope required. The proof has two harmless domain conventions and one displayed binding typo that should be corrected locally.
Positive shifts can make the displayed auxiliary function undefined at finitely many integers
PDF p. 3, opening of Section 2 · arXiv:2610.15809v1
The proof sets . If some is a positive integer and , one factor is zero, whereas Theorem 1.11 requires a finite-valued function. Define on the finite set and use the displayed formula elsewhere. Removing finitely many denominators affects neither divergence nor the infinitely-many-solutions conclusion.
A valuation-dependent product is printed outside its binding sum
PDF p. 4, final calculation · arXiv:2610.15809v1
The factor is printed before , although it depends on the bound variable , and the next line drops the sum. Keep that factor inside the -sum and apply Lemma 2.1 term by term. Each term is , and , producing exactly the printed final bound.
The pseudo-absolute value needs the usual initial divisor
PDF p. 5, Section 3.2 · arXiv:2610.15809v1
For the stated class of strictly increasing divisibility sequences, the set can be empty when . Prepend and take the minimum over , equivalently impose the standard convention that the chain begins with . This makes the definition total on and leaves every large-index layer and every estimate in Theorem 3.3 unchanged.
Both AM–GM estimates have uniform positive lower bounds
PDF pp. 3–6 · arXiv:2610.15809v1
In Lemma 2.1 the excluded residue primes form the fixed product , while for every other prime the normalized divisibility frequency is at most ; hence the logarithm of the geometric mean is bounded by . The mixed proof similarly has frequency at most , leading to . These bounds are uniform in the valuation vector or layer to which they are applied.
03Novelty0 reported findingsNo novelty concerns found
No non-novelty findings.