arXiv:0909.4251v4

Schmidt's game, fractals, and numbers normal to no base

Ryan Broderick, Yann Bugeaud, Lior Fishman, Dmitry Kleinbock, Barak Weiss

math.DSmath.NT37E1011K60

Abstract

Given b>1b > 1 and yR/Zy \in \mathbb{R}/\mathbb{Z}, we consider the set of xRx\in \mathbb{R} such that yy is not a limit point of the sequence {bnxmod1:nN}\{b^n x \bmod 1: n\in\mathbb{N}\}. Such sets are known to have full Hausdorff dimension, and in many cases have been shown to have a stronger property of being winning in the sense of Schmidt. In this paper, by utilizing Schmidt games, we prove that these sets and their bi-Lipschitz images must intersect with `sufficiently regular' fractals KRK\subset \mathbb{R} (that is, supporting measures μμ satisfying certain decay conditions). Furthermore, the intersection has full dimension in KK if μμ satisfies a power law (this holds for example if KK is the middle third Cantor set). Thus it follows that the set of numbers in the middle third Cantor set which are normal to no base has dimension log2/log3\log2/\log3.

AI-generated audit

Audit summary

Audited against arXiv v4

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 19, 2026
01Statements2 reported findingsCorrect

The winning theorem for lacunary affine images on supports of absolutely decaying measures, its countable-intersection consequences, and the normal-to-no-base corollary are correct.

Theorem 1.1Correct

Lacunary orbit-avoidance sets are winning on the fractal support

Page 3 and Section 4 (pages 9--12) · main theorem and proof · arXiv:0909.4251v4

Lacunarity bounds the number of scales at which tnt_n lies in any fixed multiplicative window. Absolute decay lets Alice choose a subball avoiding a fixed positive proportion of the finitely many forbidden preimages at that scale. Iterating this choice keeps the limiting point a uniform distance from every prescribed target yny_n after applying tnt_n, and the bi-Lipschitz distortion is absorbed in the fixed winning parameter.

Corollary 1.2 and Section 5Correct

Countable intersections and digit conclusions have the stated dimension

Page 4 and Section 5 (pages 13--15) · dimension and normality consequences · arXiv:0909.4251v4

Winning sets on the same support are stable under countable intersections. The power-law assumption identifies the support dimension with the decay exponent, so winning intersections have full relative Hausdorff dimension. For each integer base, avoiding a neighborhood of a periodic target bounds runs of a chosen digit; intersecting over bases and with badly approximable numbers gives the claimed normal-to-no-base set.

02Proofs2 reported findingsCorrect

The escaping lemma, scale scheduling, absolute-decay estimate, and Schmidt-game dimension argument are correct and complete.

Section 3Correct and complete

Absolute decay supplies a legal escaping move

Pages 7--9 · finite-point escaping lemma · arXiv:0909.4251v4

The decay inequality bounds the measure occupied by each forbidden relative ball. The numerical choice of the game parameter makes the union of the relevant forbidden balls occupy less than the available parent ball, leaving a legal child ball centered on the support. The argument is uniform in the locations of the forbidden points.

Section 4Correct and complete

Lacunarity schedules all constraints without collision

Pages 9--12 · proof of Theorem 1.1 and uniformly discrete extension · arXiv:0909.4251v4

At a given game scale only a bounded number of indices can have inverse-image spacing comparable with the current radius. The escaping lemma handles that entire finite collection before the radius enters the next scale. Earlier avoidances persist under nesting, and every index is eventually processed, yielding one positive avoidance constant for the limiting point.

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:0909.4251v4
Authors listed
Ryan Broderick, Yann Bugeaud, Lior Fishman, Dmitry Kleinbock, Barak Weiss
Audit date
August 19, 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.