Brought to you by:
Paper

Spin chains and Arnold's problem on the Gauss-Kuz'min statistics for quadratic irrationals

© 2013 RAS(DoM) and LMS
, , Citation A. V. Ustinov 2013 Sb. Math. 204 762 DOI 10.1070/SM2013v204n05ABEH004319

1064-5616/204/5/762

Abstract

New results related to number theoretic model of spin chains are proved. We solve Arnold's problem on the Gauss-Kuz'min statistics for quadratic irrationals.

Bibliography: 24 titles.

Export citation and abstract BibTeX RIS

§1. Introduction

In [1], a number-theoretic model for spin chains was presented; this model uses Farey series (for the subsequent results, see [2]–[4]). In this model, to a finite chain of spins each of which can be directed upwards ($\uparrow$) or downwards ($\downarrow$), a product of the matrices

is assigned, according to the rule $\uparrow {}=A$ and $\downarrow {}=B$. For example,

By the energy of a given configuration we mean the quantity

Let $G$ be the free multiplicative monoid generated by the matrices $A$ and $B$. From a physical viewpoint, the asymptotic behaviour of the number of configurations with a given energy,

and the number of configurations in which the energy does not exceed a given quantity,

are of interest. The conjecture that

Equation (1.1)

was presented in [1] and, at the same time, the asymptotic formula

Equation (1.2)

was proved in [3].

The conjecture (1.1) was disproved in [4]. It turns out that the arithmetic function $\Phi (N)(N \log N)^{-1}$ has a smooth limit distribution. In [5], the two-term asymptotic formula

Equation (1.3)

was obtained for the quantity $\Psi (N)$, where

Problems concerning the asymptotic behaviour of $\Phi (N)$ and $\Psi (N)$ are closely related to the distribution of quadratic irrationals and the closed geodesics corresponding to these irrationals on the modular surface (see [6] and [5]). For a reduced quadratic irrational $\omega$ (which has a purely periodic representation in the form of a continued fraction) we let $\rho (\omega )$ denote the length which is defined as the length of the corresponding closed geodesic. As was proved in [6],

Equation (1.4)

The relationship between reduced quadratic irrationals and finite products of the matrices $A$ and $B$ (see [3]) was used in [5] to obtain an asymptotic formula with an explicit estimate for the remainder term,

Equation (1.5)

In this paper, we prove the asymptotic formula

Equation (1.6)

which refines equation (1.3), and a formula refining (1.5), namely,

Equation (1.6) is a special case of a more general result concerning the Gauss-Kuz'min statistics for spin chains (see Theorems 1 and 2). Another consequence of this result gives a solution to Arnold's problem (see [7], Problem 1993–11) on the statistical properties of the partial quotients of quadratic irrationals. Let $x,y\in [0,1]$ be real numbers and

Here ${\mathscr R}$ is the set of reduced quadratic irrationals, $\varepsilon _0(\omega )$ is the fundamental solution of Pell's equation

$\Delta =B^2-4AC$, where $AX^2+BX+C$ is the minimal polynomial of $\omega$, and $\omega ^{*}$ stands for the number conjugate to $\omega$; moreover, $[A]$ stands for $1$ if the statement $A$ is true and for $0$ otherwise. Then (see Theorem 3)

that is, Gauss-Kuz'min statistics for the quadratic irrationals are described by the same distribution function $\log _2(1+xy)$ and the same corresponding density

as occur in the Gauss-Kuz'min statistics for the rationals and for almost all reals.

The proofs of the theorems use the approach suggested in [5].

The author thanks the referee for pointing out the inaccuracies in the original version of the paper.

§2. Application of bounds for the Kloosterman sums

The main tool for solving problems which can be reduced to the distribution of solutions of the congruence $xy\equiv \pm 1 \pmod {q}$ is the following lemma.

Lemma 1. Let $q$ be a positive integer and $0\leqslant P_1, P_2\leqslant q$. Then

Equation (2.1)

where $\psi _1(q)=\sigma _0(q)\log ^2(q+1)q^{1/2}$.

For a proof see, for example, [8].

In the next lemma, an asymptotic formula for the number of solutions of the congruence $xy\equiv \pm 1 \pmod {q}$ under the graph of the simplest linear function can be proved in a similar way.

Lemma 2. Let $q$ be a positive integer, let $0\leqslant P_1, P_2\leqslant q$, let $a$ be an integer, and let $f(x)=a\pm x$ be a linear function for which $0\leqslant f(P_1),f(P_2)\leqslant q$. Then the sum

admits the following asymptotic formula (for any choice of sign in the symbol $\pm$):

where $\psi _2(q)=\sigma _0(q)\log (q+1)(\sigma _0(q)+\log (q+1))q^{1/2}$.

Proof. Assume that $f(x)=a+x$. The case of $f(x)=a-x$ can be proved similarly. Expand the function

in a finite Fourier series,

with the Fourier coefficients

Then the given sum can be represented in the form

where

are Kloosterman sums. Distinguishing the term with $m=n=0$, we obtain the equation

Equation (2.2)

where

Here and below, a dash ${}^{\prime }$ on the summation sign means that the term for which all variables of summation vanish is omitted.

Using the bound

for the Kloosterman sums (see [9]), we obtain the following inequalities for the remainder $R$:

Equation (2.3)

where

We will estimate the Fourier coefficients of the function $F$. If $n=0$, then

If $n\ne 0$, then

Equation (2.4)

Therefore, for $m=0$ we have

and the remainder $R_2$ can be estimated in just the same way as the remainder $R_1$,

If $m+n=0$ and $m\ne 0$, then, by (2.4),

Hence, the same bound is obtained for the remainder $R_3$,

In the remaining cases ($m\ne 0$, $n\ne 0$, $m+n\ne 0,q$), by (2.4) we have

In particular, if $m$ and $n$ have different signs, then

and, if the signs are the same, then

Therefore, $R_4\ll R_{4,1}+R_{4,2}$, where

Introducing the variables $d=(m,n,q)$, $m_1=md^{-1}$, and $n_1=nd^{-1}$, we obtain the following bound for the first sum:

The second sum can be estimated similarly to the first,

Thus, $R_4\ll \log ^2(q+1)$.

Substituting the above bounds for the remainders $R_1$, $R_2$, $R_3$, and $R_4$ into (2.3), we arrive at the relation

and, taking account of equation (2.2), this leads to the statement of the lemma.

§3. Spin chains and continued fractions

We let ${\mathscr M}$ denote the set of all integer matrices

with determinant $\pm 1$ for which

This set is partitioned into two disjoint sets ${\mathscr M}_{+}$ and ${\mathscr M}_{-}$, which consist of matrices with determinants $+1$ and $-1$, respectively. The elements of the set ${\mathscr M}$ form a multiplicative semigroup and are in a one-to-one correspondence with the (non-empty) families of positive integers constructed using the rule (see [10])

The inverse map is constructed using the equations

As in [5] and [3], to evaluate the function $\Psi (N)$, we consider the products of the matrices $A=\bigl ({{\begin{array}{*{10}c}1 & 0\\ 1 & 1\end{array}}}\bigr )$ and $B=\bigl ({{\begin{array}{*{10}c}1 & 1\\ 0 & 1\end{array}}}\bigr )$ of even and odd length separately. To be definite, we assume that the products begin with the matrix $B$. Following the notation in [5], we introduce the sets $W_{\mathrm{ev}}$ and $W_{\mathrm{odd}}$ as follows:

We set the family of positive integers $(a_1,\dots ,a_n)$ in correspondence with the continued fraction $[0;a_1,\dots ,a_n]$ and the sequence of approximants $p_k/q_k=[0;a_1,\dots ,a_k]$, $0\leqslant k\leqslant n$. The properties of the continued fractions imply that

where $J=\bigl ({{\begin{array}{*{10}c}0 & 1\\ 1 & 0\end{array}}}\bigr )$. Therefore, the quantities

can also be defined by the equalities

By hypothesis all the products under consideration begin with the matrix $B$, and so

To describe the behaviour of the partial quotients in the continued fractions for real numbers, it is convenient to use the measure (see [11])

Let a real number $\alpha \in [0,1]$ be given by an infinite continued fraction $\alpha =[0;a_1,a_2,\dots, a_n , \dots]$ and let $p_n(\alpha )/q_n(\alpha )=[0;a_1,\dots ,a_n]$ and $r_n(\alpha )=[0;a_{n+1},a_{n+2},\dots ]$. Then $\alpha =[0;a_1,\dots ,a_n+r_n(\alpha )]$, $q_{n-1}(\alpha )/q_{n}(\alpha )=[0;a_n,\dots ,a_1]$, and the behaviour of the elements of the continued fraction near the index $n$ is described in the mean by the function (the Gauss-Kuz'min statistics treated in a generalized sense)

Here

In particular, for $y=1$ we deal with the Gauss measure

and the corresponding distribution function $\log _2(1+x)$.

The spin chains model under consideration is closely connected with continued fractions. Therefore, to describe the properties of generic configurations, it is natural to introduce characteristics similar to the Gauss-Kuz'min statistics. The object we introduce characterizes local properties of spin configurations.

For real $x,y\in [0,1]$ we write

In particular, $\Psi _{\mathrm{ev}}(1,1;N)=\Psi _{\mathrm{ev}}(N)$ and $\Psi _{\mathrm{odd}}(1,1;N)=\Psi _{\mathrm{odd}}(N)$.

Arnold conjectured (see [7], Problem 1993–11) that the partial quotients of rationals and quadratic irrationals behave in the mean in just the same way as those for almost all reals. This statement was proved by Lochs (see [12]) for the rationals, in the simplest case when the averaging is carried out over the fractions $a/b$, $1\leqslant a\leqslant b\leqslant R\,(R\rightarrow \infty )$. For the case when the averaging is carried out over the points in a sector $1\leqslant a\leqslant b$, $a^2+b^2\leqslant R^2\, (R\rightarrow \infty )$, as was suggested in the original setting of the problem, the conjecture was proved by Avdeeva and Bykovskii (see [13] and [14], and also [15] and [8]). The known Gauss-Kuz'min statistics for finite continued fractions enabled us to solve the Sinaǐ problem on the statistical properties of trajectories of particles in two-dimensional crystal lattices (see [16]), to obtain new results on the behaviour in the mean of various versions of the Euclidean algorithm (see [17], [18]), and to find the distribution density of the normalized Frobenius numbers with three arguments (see [19]).

It turns out that the quantities $\Psi _{\mathrm{ev}}(x,y;N)$ an $\Psi _{\mathrm{odd}}(x,y;N)$, viewed as functions of $x$ and $y$, exhibit fundamentally different behaviour. The even chains satisfy the Gauss-Kuz'min law (as do the rational numbers in the Arnold problem), whereas the odd ones do not.

The relationship between the behaviour of the function $\Psi _{\mathrm{ev}}(N)$ and the distribution of quadratic irrationals, which was noted in [5] and [3], helps to prove Arnold's conjecture for the quadratic irrationals and to refine the asymptotic formula (1.5).

§4. Spin chains and the Gauss-Kuz'min statistics

Theorem 1. Let $0\leqslant x,y\leqslant 1$ and $N\geqslant 2$. Then the following asymptotic formula holds:

Equation (4.1)

with an absolute constant in the remainder term.

Proof. We transform the given quantity,

Equation (4.2)

There is at most one value of the variable $t$ lying in the interval $yu<t\leqslant yu+1/q$. Therefore,

for $t_y(u)=\lceil yu \rceil$. Thus,

Equation (4.3)

It follows from the equation

that the quantity $\Psi _{\mathrm{ev}}(x,y;N)$ admits the bound

Since $\Psi _{\mathrm{ev}}(x,y;N)$ is symmetric with respect to $x$ and $y$, the bound

also holds. Therefore,

for $\min \lbrace x,y\rbrace \leqslant N^{-1/2}$, and formula (4.1) holds. Thus, it is sufficient to prove that (4.1) holds under the assumption that $x\geqslant N^{-1/2}$. In formula (4.3), Lemmas 1 and 2 can be applied to the inner double sum. Taking the formula (see [20], Ch. II, Problem 19)

into account (here and below, an asterisk $^\ast$ means that the variable of summation ranges over the reduced system of residues), we obtain the equation

It follows from the standard bounds

that

Applying the identity ($u=\delta u_1$)

Equation (4.4)

and introducing the variables $\alpha =t/u=t/(\delta u_1)$ and $\beta =q/u=q/(\delta u_1)$, we arrive at the asymptotic formula

Equation (4.5)

where

We represent the sum $S(N)$ in the form

where

After evaluating the integrals

we arrive at the asymptotic formulae

By assumption, $x\geqslant N^{-1/2}$. Hence, $Nx^{-1}\ll N^{3/2}$. Therefore, substituting the asymptotic formula for the sum $S(N)$ into (4.5), we obtain the desired equation for $\Psi _{\mathrm{ev}}(x,y;N)$.

Theorem 2. Let $0\leqslant x,y\leqslant 1$ and $N\geqslant 2$. Then

Proof. Repeating the arguments in the proof of Theorem 1, we arrive at the equations

The boundary of the domain in which $u$ and $v$ vary intersects at most $O(N/t)$ squares of the form $[at,(a+1)t]\times [bt,(b+1)t]$. Therefore, applying Lemmas 1 and 2, we obtain the equations

Using (4.4) again and changing to the variables $\alpha =u/t=u/(\delta t_1)$ and $\beta =v/t=v/(\delta t_1)$, we see that

Equation (4.6)

where

Substituting the asymptotic formula for $T(N)$ into (4.6) and applying the formula

we obtain the statement of the theorem.

Corollary 1. For $N\geqslant 2$

Remark. Comparing the results of Theorems 1 and 2, we can conclude that the even and odd spin chains have a fundamentally different structure in the mean. It seems that these cases should be separated and studied independently. In contrast to the leading term in Theorem 1, the leading term in Theorem 2 does not depend on $x$ and $y$, because it is obtained by summing matrices of the form $\bigl ({{\begin{array}{*{10}c}t & u\\ v & q\end{array}}}\bigr )$ in which $v={o}(q)$ and $u={o}(q)$.

§5. Gauss-Kuz'min statistics for quadratic irrationals

Let $AX^2+BX+C\in \mathbb {Z}[X]$ $(A>0,\ (A,B,C)=1)$ be the minimal polynomial of a quadratic irrational $\omega$ and let ${\it \Delta}=B^2-4AC$. We denote the number conjugate to $\omega$ by $\omega ^{*}$. In the field $\mathbb {Q}(\sqrt{\Delta })$, the number $\omega$ has trace $\operatorname{tr}(\omega )=\omega +\omega ^{*}=-B/A$ and norm ${\mathscr N}(\omega )=\omega \omega ^{*}=C/A$. A quadratic irrational $\omega$ is said to be reduced if it can be decomposed into a purely periodic continued fraction,

Equation (5.1)

of period $n=\operatorname{per}(\omega )$. Here, by the Galois theorem (see [21]),

We denote the set of all reduced quadratic irrationals by ${\mathscr R}$. The length of a number $\omega \in {\mathscr R}$ is the quantity $\rho (\omega )=2\log \varepsilon _0$, where $\varepsilon _0=\frac{1}{2}(x_0+\sqrt{\Delta }y_0)$ is the fundamental solution of Pell's equation

The term 'length' is used because, on the modular surface $\mathbb {H}/\operatorname{PSL}_2(\mathbb {Z})$, where $\mathbb {H}=\lbrace (x,y):y>0\rbrace$ stands for the upper half-plane, there is a closed geodesic corresponding to a pair of quadratic irrationals $\omega$ and $\omega ^{*}$ (the projection of the geodesic joining $\omega$ and $\omega ^{*}$) whose length in the classical metric $ds^2=(dx^2+dy^2)y^{-2}$ is precisely equal to $\rho (\omega )$ (see [6] and [22]).

For a reduced quadratic irrational $\omega =[0;\overline{a_1,\dots ,a_n}]$ we write

In this case, the fundamental unit can be found using Smith's formula (see [23] and [24], § 2.4),

where $T(\alpha )$ stands for the Gauss map $T(\alpha )=\lbrace 1/\alpha \rbrace$.

For the manipulations below, we need the following properties of the reduced quadratic irrationals and their corresponding fundamental units (see [3], Propositions 2.1 and 4.1).

$1^{\circ }.$ For every positive integer $k$

$2^{\circ }.$ If $\omega =[0;\overline{a_1,\dots ,a_{2m}}]$, $l=\operatorname{per}_e(\omega )$, $2m=kl$, then

Let

where $\pi _0(x)$ stands for the number of reduced quadratic irrationals whose length does not exceed $x$. The next statement can be extracted from the proofs of Propositions 4.3 and 4.5 in [3] (see also [5]).

Lemma 3. For every integer $N\geqslant 2$

Proof. We first assume that $N\geqslant 2$ is a real number. By property $2^{\circ }$, the map

which assigns the quadratic irrational $\omega =[0;\overline{a_1,\dots ,a_{n}}]$ and the number $k=2m/\operatorname{per}_e(\omega )$ to a family of positive integers $(a_1,\dots ,a_{2m})$, is a bijection between the set $W_{\mathrm{ev}}(N)$ and the set of pairs $(k,\omega )$, where $k\in \mathbb {N}$, $\omega \in {\mathscr R}$ and $\operatorname{tr}(\varepsilon _0^k(\omega ))\leqslant N$. Hence,

Equation (5.2)

where

We can impose the condition $k\leqslant 2\log N$ because the inequality

holds for every $\omega \in {\mathscr R}$.

It follows from (5.2) that $\widetilde{r}_1(N)\leqslant \Psi _{\mathrm{ev}}(N)\ll N^2$. By property $1^{\circ }$,

Equation (5.3)

Therefore, $r(N)\ll N^2$, $\widetilde{r}_k(N)\ll N^{{2}/{k}}$, and

Equation (5.4)

It follows from (5.3) that

Thus,

However, the equation $\Psi _{\mathrm{ev}}(N+{1}/{2})=\Psi _{\mathrm{ev}}(N)$ holds for integer $N$, and therefore the statement of the lemma follows from the estimates for $r(N)$ obtained above.

Corollary 2. For $N\geqslant 2$

Corollary 3. Let $x\geqslant 1$. Then

To evaluate the Gauss-Kuz'min statistics for the reduced quadratic irrationals, we introduce the quantity $r(x,y;N)$ for the reals $x,y\in [0,1]$ and for $N\geqslant 2$ (we assume that the sequence of partial quotients is extended to the negative indices by periodicity) as follows:

where $\omega _j=T^{j}(\omega )=[0;a_{j+1},a_{j+2},\dots ]$. In particular, $r(1,1;N)=r(N)$. For all equivalent numbers $\omega _j=T^j(\omega )$ we count the Gauss-Kuz'min statistics only once, and the sum $r(x,y;N)$ can also be represented in the form

that is, the sum $r(x,y;N)$ describes the behaviour in the mean of the closed geodesics on the modular surface.

Theorem 3. Let $0\leqslant x,y\leqslant 1$ and $N\geqslant 2$. Then

Proof. Consider the sums

By definition, $\widetilde{r}_k(x,y;N)\leqslant \widetilde{r}_k(N)$. Thus, it follows from (5.4) that

where

By property $2^{\circ }$ the sum which has arisen can be represented in the form

A pair of positive integers $(q,q^{\prime })\ (q\leqslant q^{\prime })$ can be completed to a matrix $\bigl ({{\begin{array}{*{10}c}p & p^{\prime }\\ q & q^{\prime }\end{array}}}\bigr )\in {\mathscr M}$ in two ways at most. Therefore, the number of matrices

for which $q^{\prime }\leqslant \sqrt{N}$ can be estimated by $O(N)$. For the families $(a_1,\dots ,a_{2m})$ to which a matrix with $q^{\prime }>\sqrt{N}$ corresponds we have

Hence, on the one hand,

Equation (5.5)

On the other hand,

that is,

Equation (5.6)

If $\min \lbrace x,y\rbrace \leqslant N^{-1/2}$, then Theorem 3 follows from Theorem 1 and from the bound (5.5). If $\min \lbrace x,y\rbrace > N^{-1/2}$, then, by Theorem 1,

Equation (5.7)

Combining the above relations (5.6) and (5.7), we obtain the asymptotic formula $ \sigma (x,y;N)=\Psi _{\mathrm{ev}}(x,y;N)+O(N^{3/2}\log ^4N)$. Thus, by Theorem 1,

To complete the proof of the theorem, it remains to note that, by property $1^{\circ }$, the desired function $r(x,y;N)$ is connected with $\widetilde{r}(x,y;N)$ by the inequalities

Please wait… references are loading.
10.1070/SM2013v204n05ABEH004319