Abstract

A sequence (λn)n≥1(λ_n)_{n\ge1} of distinct positive integers is called an LpL^p-Khinchin sequence, where 1≤p≤∞1\le p\le\infty, if n−1∑k=1nf(λkx)⟶∫Tf dm n^{-1}\sum_{k=1}^n f(λ_k x) \longrightarrow \int_{\mathbb T}f\,d\mathfrak m a.e. x∈Tx\in\mathbb T for every f∈Lp(T)f\in L^p(\mathbb T). When 1≤p<∞1\le p<\infty, we characterize the LpL^p-Khinchin sequences by a weak (p,p)(p,p) maximal inequality for the associated averaging operators. We also establish a transference principle reducing the weak (p,p)(p,p) maximal inequality to weak (p,p)(p,p) maximal inequalities for three model systems: translation along a lattice path in the infinite direct sum of the semigroup N0\mathbb{N}_0, translation along a lattice path in the infinite direct sum of the group Z\mathbb{Z} and translation on the circle T\mathbb{T}. As consequences, we prove that (2n+1)n≥1(2^n+1)_{n\ge1}, the Fibonacci sequence, sequences of distinct primes and their partial products are \emph{not} LpL^p-Khinchin for any 1≤p<∞1\le p<\infty. We study the special class of multiplicative sequences generated by infinite words and we show that balanced infinite words generate L1L^1-Khinchin sequences, while typical random multiplicative sequences over at least two coprime integers are almost surely not LpL^p-Khinchin for any 1≤p<∞1\le p<\infty. We also obtain a {Conze-type principle} for countably generated semigroup actions on a probability space.

AI-generated audit

Audit summary

Audited against arXiv v1

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 October 23, 2026
01Statements2 reported findingsNo statement issues found

The discrete and circle transference criteria, the finitely generated semigroup criterion, the Tempelman sufficient condition, and the deterministic and random examples of Khinchin and non-Khinchin sequences are correctly stated. The range 1≤p<∞1\leq p<\infty and the uniformity of the maximal constants are preserved throughout. No mathematical statement requiring correction was found.

Theorems 1.1–1.3No issue found

The transference criteria have matching weak-type constants

PDF pages 4–6 and 10–19 · Theorems 1.1–1.3 and 3.3 · arXiv:2610.26152v1

Finite-coordinate reduction places every truncated multiplicative average in a free N0d\mathbb N_0^d action. Calderón transference gives the forward implication, the finite tower property gives the reverse implication, and translating finite supports identifies the semigroup and group lattice models without changing the constant. The circle criterion follows by applying the same result to the homomorphism-induced action; injectivity is used exactly where freeness is needed for the converse.

Theorems 1.4–1.6No issue found

The positive and negative examples follow from the discrete criterion

PDF pages 6 and 19–24 · Sections 5–6 · arXiv:2610.26152v1

The Tempelman bound supplies a weak (1,1)(1,1) covering estimate. Balanced words give only uniformly many displacement vectors of each length, and the increasing semigroup enumeration has difference sets of the same lattice-point order as its initial segments. For Bernoulli words, projection to a centered one-dimensional random walk and the cited sweeping-out theorem contradict any weak (p,p)(p,p) estimate; taking countably many integer pp values then covers every real pp in the stated range.

02Proofs2 reported findingsNo proof issues found

The maximal-inequality characterization, finite-tower transference, homomorphism obstruction, covering argument, projection lemma, and random-walk contradiction were checked as one dependency chain. Support finiteness, limiting truncations, freeness, and the direction of the inclusions are handled correctly. No incorrect or materially incomplete proof was found.

Theorem 3.3No issue found in the reviewed proof

The semigroup transference proof closes in both directions

PDF pages 10–13 · Theorem 3.3 · arXiv:2610.26152v1

For the forward direction, orbit samples on a growing cube reproduce the discrete averages and boundary loss tends to zero. For the reverse direction, the finite tower embeds the finite exceptional set and all required translates into disjoint equal-mass levels, so the dynamical weak bound returns the exact discrete bound. Monotone convergence then passes from finite weight families to the maximal operator.

Theorem 1.6No issue found in the reviewed proof

The almost-sure non-Khinchin conclusion uses the correct quantifiers

PDF pages 22–24 · Lemma 6.2 and proof of Theorem 1.6 · arXiv:2610.26152v1

The projection lemma lifts a finitely supported function through a split lattice extension and removes the Følner-box boundary in the kernel. On any positive-probability family of paths with the Khinchin property, an almost-sure sweeping-out path can be chosen; its individual weak-type constant is then contradicted by a set of arbitrarily small measure. The final passage from integer to real pp uses the nesting of the LpL^p spaces on a probability space.

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:2610.26152v1
Authors listed
Aihua Fan, Shilei Fan, Tongjin Li
Audit date
October 23, 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.