Science Fair Project Encyclopedia
Gauss-Kuzmin-Wirsing operator
In mathematics, the Gauss-Kuzmin-Wirsing operator occurs in the study of continued fractions; it is also related to the Riemann zeta function. It is the transfer operator of the Gauss map
This operator acts on functions as
 = \sum_{n=1}^\infty \frac {1}{(x+n)^2} f \left(\frac {1}{x+n}\right)](a/../upload/math/50e3c08aed4d3c907b569c9551367ce9.png)
The zeroth eigenfunction of this operator is
which corresponds to an eigenvalue of 1. This eigenfunction gives the probability of the occurrence of a given integer in a continued fraction expansion, and is known as the Gauss-Kuzmin distribution . This follows in part because the Gauss map acts as a truncating shift operator for the continued fractions: if x = [0;a1,a2,a3,...] is the continued fraction representation of a number 0 < x < 1, then h(x) = [0;a2,a3,...].
Additional eigenvalues can be computed numerically; the next eigenvalue is λ1 = 0.3036630029... and is known as the Gauss-Kuzmin-Wirsing constant. Analytic forms for additional eigenfunctions are not known. It is not known if the eigenvalues are irrational.
| Contents |
Relationship to the Riemann zeta
The GKW operator is related to the Riemann zeta function. Note that the zeta can be written as
which implies that
![\zeta(s)=\frac{s}{s-1}-s\int_0^1 dx\; x \left[Gx^{s-1} \right]](a/../upload/math/20fc4a2b408bcde3ff00648e8a7902fd.png)
by change-of-variable.
Matrix elements
Consider the Taylor series expansions at x=1 for a function f(x) and g(x) = [Gf](x). That is, let
and write likewise for g(x). The expansion is made about x=1 because the GKW operator is poorly-behaved at x=0. The expansion is made about 1-x so that we can keep x a positive number, 0 ≤ x ≤ 1. Then the GKW operator acts on the Taylor coefficients as
where the matrix elements of the GKW operator are given by
This operator is extremely well-formed, and thus very numerically tractable. The Gauss-Kuzmin constant is easily computed to high precision by numerically diagonalizing the upper-left n by n portion. There is no known closed-form expression that diagonalizes this operator; that is, there are no closed-form expressions known for the eigenvalues or eigenvectors.
Riemann zeta
The Riemann zeta can be written as
where the tn are given by the matrix elements above:
Performing the summations, one gets:
![t_n=1-\gamma + \sum_{k=1}^n (-1)^n {n \choose k} \left[ \frac{1}{k} + \frac {\zeta(k+1)} {k+1} \right]](a/../upload/math/34d7f70088ede89aca2b30982fe25322.png)
where γ is the Euler-Mascheroni constant. These tn play the analog of the Stieltjes constants, but for the falling factorial expansion. By writing
one gets: a0= -0.0772156... and a1=-0.00474863... and so on. The values get small quickly but are oscillatory. Some explicit sums on these values can be performed. They can be explicitly related to the Stieltjes constants by re-expressing the falling factorial as a polynomial with Stirling number coefficients, and then solving. More generally, the Riemann zeta can be re-expressed as an expansion in terms of Sheffer sequences of polynomials.
References
- A. Ya. Khinchin, Continued Fractions, 1935, English translation University of Chicago Press, 1961 ISBN 0-486-69630-8 (See section 15).
- Linas Vepstas The Bernoulli Operator, the Gauss-Kuzmin-Wirsing Operator, and the Riemann Zeta (2004) (PDF)
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details