Thue's lemma
# Thue's lemma

In modular arithmetic, Thue's lemma roughly states that every modular integer may be represented by a "modular fraction" such that the numerator and the denominator have absolute values not greater than the square root of the modulus.

More precisely, for every pair of integers (a, m) with m > 1, given two positive integers X and Y such that X ≤ m < XY, there are two integers x and y such that

    $ay\equiv x{\pmod {m}}$

and

    $|x|<X,\quad 0<y<Y.$

Usually, one takes X and Y equal to the smallest integer greater than the square root of m, but the general form is sometimes useful, and makes the uniqueness theorem (below) easier to state.

The first known proof is attributed to Axel Thue (1902) who used a pigeonhole argument. It can be used to prove Fermat's theorem on sums of two squares by taking m to be a prime p that is congruent to 1 modulo 4 and taking a to satisfy $a^2$ + 1 = 0 mod p. (Such an "a" is guaranteed for "p" by Wilson's theorem.)

## Uniqueness

In general, the solution whose existence is asserted by Thue's lemma is not unique. For example, when a = 1 there are usually several solutions (x, y) = (1, 1), (2, 2), (3, 3), ..., provided that X and Y are not too small. Therefore, one may only hope for uniqueness for the rational number x/y, to which a is congruent modulo m if y and m are coprime. Nevertheless, this rational number need not be unique; for example, if m = 5, a = 2 and X = Y = 3, one has the two solutions

    $2a+1\equiv -a+2\equiv 0{\pmod {5}}$.

However, for X and Y small enough, if a solution exists, it is unique. More precisely, with above notation, if

    $2XY<m,$

and

    $ay_{1}-x_{1}\equiv ay_{2}-x_{2}\equiv 0{\pmod {m}}$,

with

    $\left|x_{1}\right|<X,\quad \left|y_{1}\right|<Y,$

and

    $\left|x_{2}\right|<X,\quad \left|y_{2}\right|<Y,$

then

    ${\frac {x_{1}}{y_{1}}}={\frac {x_{2}}{y_{2}}}.$

This result is the basis for rational reconstruction, which allows using modular arithmetic for computing rational numbers for which one knows bounds for numerators and denominators.

The proof is rather easy: by multiplying each congruence by the other $y_i$ and subtracting, one gets

    $y_{2}x_{1}-y_{1}x_{2}\equiv 0{\pmod {m}}.$

The hypotheses imply that each term has an absolute value lower than XY < m/2, and thus that the absolute value of their difference is lower than m. This implies that $y_{2}x_{1}-y_{1}x_{2}=0$, hence the result.

## Computing solutions

The original proof of Thue's lemma is not efficient, in the sense that it does not provide any fast method for computing the solution.

The extended Euclidean algorithm, allows us to provide a proof that leads to an efficient algorithm that has the same computational complexity of the Euclidean algorithm.

More precisely, given the two integers m and a appearing in Thue's lemma, the extended Euclidean algorithm computes three sequences of integers $(t_i),$ $(x_i)$ and $(y_i)$ such that

    $t_{i}m+y_{i}a=x_{i}\quad {\text{for }}i=0,1,...,$

where the $x_i$ are non-negative and strictly decreasing. The desired solution is, up to the sign, the first pair $(x_i,$ $y_i)$ such that $x_i$ < X.

