WorksMathematics
Khinchin's constant along deterministic subsequences
Abstract
Khinchin's theorem says that, for Lebesgue almost every real number, the geometric mean of the partial quotients in its continued fraction expansion converges to a universal constant . We show that the same constant is obtained when the partial quotients are sampled along any fixed strictly increasing deterministic sequence of indices. Thus arithmetic progressions, polynomial sequences, prime indices, and lacunary sequences all give the usual Khinchin constant. We also look at a different selection rule: instead of restricting the indices, we restrict the values of the partial quotients. In this case the answer changes. The geometric mean of the prime-valued partial quotients converges almost surely to a new constant .
Introduction
Let be the continued fraction expansion of an irrational number . For a fixed irrational , the partial quotients may behave very irregularly. Nevertheless, Khinchin’s theorem [10] gives the following universal law: for Lebesgue almost every ,
where
The usual proof applies Birkhoff’s ergodic theorem to the Gauss map
and to the integrable function . Indeed,
and preserves the Gauss measure
which is equivalent to Lebesgue measure.
The purpose of this note is to distinguish between two natural ways of selecting partial quotients. The first is to select their positions. Fix a strictly increasing sequence of positive integers
and consider
Our first theorem says that, for each fixed choice of , the limiting constant is still . In other words, deterministic sampling of the indices does not create a new Khinchin constant.
This question is partly motivated by recent work on arithmetic progressions in the Gauss system. Products such as
appear naturally in connection with exceptional sets for the convergence criterion of multiple ergodic averages of Bourgain (1988) and Host–Kra (2005). For the Gauss dynamical system, failure of these convergence criteria can be expressed through unusually large products of partial quotients along arithmetic progressions; see for instance [1, 2, 3, 4]. The result below shows that, as long as the indexing sequence is fixed in advance, the ordinary metric constant survives: arithmetic progressions, polynomial sequences, prime indices, and lacunary sequences all lead back to Khinchin’s constant. Here “arithmetic progression” means a fixed subsequence such as . The triangular arrays , in which the sampled indices themselves depend on the row parameter, are not covered directly by the theorem; see Remark 3.2.
Questions concerning ergodic averages along deterministic subsequences in the Gauss dynamical system have a long history. For instance, early contributions of Nair [7, 8] studied continued fractions together with ergodic averages along polynomial and other deterministic subsequences, establishing refinements of Birkhoff’s ergodic theorem for deterministic sampling problems. Although these works do not consider Khinchin’s constant itself, they provide part of the historical motivation for studying deterministic sampling of partial quotients.
The second selection rule is different. Instead of selecting positions, we select digit values. Let be the set of prime numbers. We keep only those partial quotients for which . Prime digits in typical continued fraction expansions have recently been studied in detail by Schindler and Zweimüller [9]. The prime-valued geometric mean considered here is a natural conditional ergodic statistic, included to contrast value selection with index selection. The geometric mean over these digits no longer converges to ; it converges to the conditional constant obtained from the Gauss digit distribution after conditioning on the event that the digit is prime. More precisely, if
then, for almost every , the following expression is defined for all sufficiently large , and
Thus prime indices and prime-valued partial quotients should not be confused: prime indices give the classical constant , while prime-valued digits give a genuinely different constant .
The key technical ingredient in the proof of Theorem 1.1 is a strong law for sampled digit functions (Lemma 2.2 below). This lemma, which may be of independent interest, shows that any sequence of digits sampled along a fixed increasing sequence of indices obeys the usual law of large numbers, provided the function has finite fourth moment and the digit process is exponentially mixing.
We now formally state the results.
Theorem 1.1. Let be a fixed strictly increasing sequence of positive integers. Then, for Lebesgue almost every ,
where is Khinchin’s constant defined in (1). Equivalently,
Example 1.2. Theorem 1.1 applies to every fixed strictly increasing deterministic sequence of indices. In particular, for Lebesgue almost every :
(i) if with and , then
(ii) if is eventually positive and strictly increasing, then, after discarding finitely many initial terms if necessary,
(iii) if denotes the -th prime number, then
(iv) if with , then the same conclusion holds after deleting the finitely many possible repetitions at the beginning. More generally, any fixed strictly increasing lacunary sequence gives
Theorem 1.3. Let be the set of prime numbers and define
Then, for Lebesgue almost every , and
where
Corollary 1.4. Let be a fixed strictly increasing sequence of positive integers and put
Then for Lebesgue almost every , and
Remark 1.5. The sequence is fixed before is chosen. The exceptional null set in Theorem 1.1 may depend on ; the theorem is not a simultaneous assertion over all strictly increasing sequences.
Gauss measure and a strong law for sampled digits
The Gauss measure is invariant and ergodic for , and it is equivalent to Lebesgue measure. Therefore it is enough to prove all almost-everywhere statements with respect to .
For , the one-cylinder is the interval . Hence
Consequently,
The integral is finite, since the summand is comparable to .
Similarly,
and
Both series converge because
For integers , let
with the evident interpretation when . Under the Gauss measure, the digit process is strictly stationary and exponentially -mixing: there are constants and such that, for every , every , and every ,
This is classical; see, for example, [5 Section 2.3.4], [6 Lemma 2.2], or [9 Section 4]. By stationarity, the same estimate holds for two arbitrary digit blocks separated by at least positions. Throughout this section, denotes expectation with respect to .
We shall repeatedly use the following consequence of (7). If and are integrable random variables measurable with respect to two digit blocks separated by at least positions, then
Indeed, for non-negative simple functions this follows by expanding them as finite linear combinations of indicator functions and applying (2.4) term by term. Monotone convergence gives the estimate for non-negative integrable functions, and decomposing into positive and negative parts gives the general case.
Lemma 2.1. Let satisfy
Put
Then there is a constant , independent of the sequence , such that for every strictly increasing sequence of positive integers and every ,
Proof. Define the centered stationary process
and put . Set . Expanding the fourth power and then taking absolute values gives
After ordering the four indices, each non-decreasing quadruple
occurs at most times. Write
and, when the maximum is attained more than once, choose its leftmost occurrence. Fix an integer .
If , then, for each , there are choices for the remaining indices. Hence there are such quadruples, and Hölder’s inequality gives
Their total contribution is therefore .
Suppose now that . If the chosen largest gap is , then and are measurable with respect to digit blocks separated by at least
Since , (8) and Hölder’s inequality yield
The case in which the chosen largest gap is is identical.
If the chosen largest gap is , put
Then (8) gives
where we used .
For any fixed , and for each of the three possible positions of the chosen largest gap, the number of non-decreasing quadruples is : one chooses the location of the gap and the two remaining gaps, each of which is at most . Consequently, all the exponentially decaying terms above contribute at most
It remains to sum the product term in (10). Dropping the ordering and largest-gap restrictions only enlarges the sum, so
For , the variables are centered and their digit positions are separated by at least . Hence (8) gives
while . It follows that
Thus the product terms contribute . Combining the preceding estimates proves (9). □
Lemma 2.2. Let satisfy
Then, for every fixed strictly increasing sequence of positive integers,
for -almost every .
Proof. Let
By Lemma 2.1,
Therefore, for every , Markov’s inequality gives
The right-hand side is summable in . The Borel–Cantelli lemma implies that, for -almost every ,
only for finitely many . Taking over a countable sequence tending to zero proves (11). □
Proof of Theorem 1.1
Proof. Apply Lemma 2.2 with . This choice is admissible because
as . Hence, for -almost every ,
By (4), we have
Therefore
for -almost every . Since and Lebesgue measure are equivalent, the same assertion holds for Lebesgue almost every . Exponentiating gives
Remark 3.1. The expectation of each sampled logarithmic digit is always the same:
The only real point is to show that the fluctuations average out along the chosen deterministic sequence. Exponential mixing gives exactly this. The fact that is increasing only helps, because the sampled digits are at least as far apart as ordinary consecutive digits in the sampled order.
Remark 3.2. Theorem 1.1 treats fixed subsequence averages, for instance . The row-dependent averages
which arise when studying products such as , are triangular rather than fixed-subsequence averages. They are not covered directly by Theorem 1.1. However, the same fourth-moment method is well suited to them, since within the -th row the gaps between the indices are at least , so the variables in one row become increasingly decorrelated. The theorem above isolates the simpler fixed-subsequence phenomenon: once the indices are fixed in advance and strictly increasing, the limiting constant is the usual Khinchin constant.
Prime-valued partial quotients
We now prove the result for prime-valued digits. The asymptotic frequency of prime digits is already recorded in [9 Proposition 2.1]; the argument below additionally identifies the conditional geometric mean and extends it to every fixed deterministic subsequence. Define
Both functions have finite fourth moment with respect to . This is clear for , and for it follows from
Proof of Theorem 1.3. Apply Lemma 2.2 to the full sequence and to . We get
for -almost every . By (5), this limit is positive. Hence and, in particular, the denominator in (2) is eventually nonzero for almost every .
Next apply Lemma 2.2 with . This gives
Using (5) and (6), the limit is
Exponentiating proves (2) with as in (3). Finally, since is equivalent to Lebesgue measure, the same conclusion holds for Lebesgue almost every . □
Remark 4.1. The constant in Theorem 1.3 can also be written as
Thus is simply the geometric mean of the Gauss digit distribution conditioned on the digit being prime. This explains why it differs from : the classical Khinchin constant averages over all possible digits, while averages only over prime digits.
Proof of Corollary 1.4. Apply Lemma 2.2 twice along the given sequence : first with , and then with . This gives, for -almost every ,
and
Taking the ratio gives the same conditional mean as in the proof of Theorem 1.3, and exponentiating gives . The equivalence of and Lebesgue measure then gives the stated Lebesgue almost-everywhere conclusion. □
Acknowledgements. The author thanks Radhakrishnan (Kit) Nair, Gerardo González Robert, Bixuan Li, and Nikita Shulga for useful discussions and comments on an earlier draft.
AI Declaration: The principal mathematical ideas, results, arguments, and proofs presented in this paper originate with the author while working on [3, 4] and have been discussed with various colleagues longtime ago. ChatGPT5.6 Sol have been used to improve language and assisting the author in checking arguments that he has developed and written himself. In any case, the author take full responsibility for its correctness.
References
References
- [1]J. Bourgain. Pointwise ergodic theorems for arithmetic sets. Inst. Hautes Études Sci. Publ. Math., 69:5–45, 1989.DOI
- [2]B. Host and B. Kra. Nonconventional ergodic averages and nilmanifolds. Ann. of Math. (2), 161(1):397–488, 2005.DOI
- [3]M. Hussain, B. Li, and N. Shulga. Averages of Gauss map iterations in arithmetic progressions. Acta Math. Hungar., 178(2):392–424, 2026.DOI
- [4]M. Hussain and N. Shulga. Metrical properties of finite product of partial quotients in arithmetic progressions. Ann. Sc. Norm. Super. Pisa Cl. Sci. (5), 27(1):337–376, 2026.
- [5]M. Iosifescu and C. Kraaikamp. Metrical Theory of Continued Fractions. Kluwer Academic Publishers, Dordrecht, 2002.DOI
- [6]M. Kesseböhmer and T. I. Schindler. Limit theorems for counting large continued fraction digits. Lithuanian Math. J., 60(2):189–207, 2020.
- [7]R. Nair. On polynomials in primes and J. Bourgain’s circle method approach to ergodic theorems. Ergodic Theory Dynam. Systems, no. 3, 485–499, 1991.DOI
- [8]R. Nair. On the metrical theory of continued fractions. Proc. Amer. Math. Soc., 120(4), 1041-1046, 1994.DOI
- [9]T. I. Schindler and R. Zweimüller. Prime numbers in typical continued fraction expansions. Boll. Unione Mat. Ital., 16(2):259–274, 2023.DOI
- [10]A. Ya. Khinchin. Continued Fractions. Dover Publications, Mineola, NY, 1997.