arXiv:2610.26152v1
Abstract
A sequence of distinct positive integers is called an -Khinchin sequence, where , if a.e. for every . When , we characterize the -Khinchin sequences by a weak maximal inequality for the associated averaging operators. We also establish a transference principle reducing the weak maximal inequality to weak maximal inequalities for three model systems: translation along a lattice path in the infinite direct sum of the semigroup , translation along a lattice path in the infinite direct sum of the group and translation on the circle . As consequences, we prove that , the Fibonacci sequence, sequences of distinct primes and their partial products are \emph{not} -Khinchin for any . We study the special class of multiplicative sequences generated by infinite words and we show that balanced infinite words generate -Khinchin sequences, while typical random multiplicative sequences over at least two coprime integers are almost surely not -Khinchin for any . We also obtain a {Conze-type principle} for countably generated semigroup actions on a probability space.
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 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 and the uniformity of the maximal constants are preserved throughout. No mathematical statement requiring correction was 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 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.
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 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 estimate; taking countably many integer values then covers every real 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.
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.
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 uses the nesting of the spaces on a probability space.
03Novelty0 reported findingsNo novelty concerns found
No non-novelty findings.