# Bézout's identity

In elementary number theory, Bézout's identity (also called Bézout's lemma) is the following theorem:

Bézout's identity — Let a and b be integers with greatest common divisor d. Then, there exist integers x and y such that ax + by = d. More generally, the integers of the form ax + by are exactly the multiples of d.

The integers x and y are called Bézout coefficients for (a, b); they are not unique. A pair of Bézout coefficients can be computed by the extended Euclidean algorithm. If both a and b are nonzero, the extended Euclidean algorithm produces one of the two pairs such that $|x|\leq \left|{\frac {b}{d}}\right|$ and $|y|\leq \left|{\frac {a}{d}}\right|$ (equality may occur only if one of a and b is a multiple of the other).

Many other theorems in elementary number theory, such as Euclid's lemma or Chinese remainder theorem, result from Bézout's identity.

A Bézout domain is an integral domain in which Bézout's identity holds. In particular, Bézout's identity holds in principal ideal domains. Every theorem that results from Bézout's identity is thus true in all these domains.

## Structure of solutions

When one pair of Bézout coefficients (x, y) has been computed (e.g., using extended Euclidean algorithm), all pairs can be represented in the form

$\left(x+k{\frac {b}{\gcd(a,b)}},\ y-k{\frac {a}{\gcd(a,b)}}\right),$

where k is an arbitrary integer and the fractions simplify to integers.

Among these pairs of Bézout coefficients, exactly two of them satisfy

$|x|\leq \left|{\frac {b}{\gcd(a,b)}}\right|\quad {\text{and}}\quad |y|\leq \left|{\frac {a}{\gcd(a,b)}}\right|,$

and equality may occur only if one of a and b divides the other.

This relies on a property of Euclidean division: given two integers c and d, if d does not divide c, there is exactly one pair (q,r) such that c = dq + r and 0 < r < |d|, and another one such that c = dq + r and -|d| < r < 0.

The two pairs of small Bézout's coefficients are obtained from the given one (x, y) by choosing for k in the above formula either of the two integers next to ${\frac {-x}{b/\gcd(a,b)}}$ .

The Extended Euclidean algorithm always produces one of these two minimal pairs.

### Example

Let a = 12 and b = 42, gcd (12, 42) = 6. Then we have the following Bézout's identities, with the Bézout coefficients written in red for the minimal pairs and in blue for the other ones.

{\begin{aligned}\vdots \\12&\times ({\color {blue}{-10}})&+\;\;42&\times \color {blue}{3}&=6\\12&\times ({\color {red}{-3}})&+\;\;42&\times \color {red}{1}&=6\\12&\times \color {red}{4}&+\;\;42&\times ({\color {red}{-1}})&=6\\12&\times \color {blue}{11}&+\;\;42&\times ({\color {blue}{-3}})&=6\\12&\times \color {blue}{18}&+\;\;42&\times ({\color {blue}{-5}})&=6\\\vdots \end{aligned}}

If (x, y) = (18, -5) is the original pair of Bézout coefficients, then ${\frac {-18}{42/6}}\in [-3,-2]$  yields the minimal pairs via k = -3 resp. k = -2: (18-3⋅7, -5+3⋅2) = (-3, 1) and (18-2⋅7, -5+2⋅2) = (4, -1).

## Proof

Given any nonzero integers a and b, let $S=\{ax+by\mid x,y\in \mathbb {Z} {\text{ and }}ax+by>0\}.$  The set S is nonempty since it contains either a or a (with x = ±1 and y = 0). Since S is a nonempty set of positive integers, it has a minimum element $d=as+bt$ , by the Well-ordering principle. To prove that d is the greatest common divisor of a and b, we must prove that d is a common divisor of a and b, and that for any other common divisor c, one has c < d.

The Euclidean division of a by d may be written

$a=dq+r\quad {\text{with}}\quad 0\leq r

The remainder r is in $S\cup \{0\}$ , because

{\begin{aligned}r&=a-qd\\&=a-q(as+bt)\\&=a(1-qs)-bqt.\end{aligned}}

As d is the smallest positive integer in S, the remainder r is necessarily 0, as, being a remainder, it has to be less than d. This implies that d is a divisor of a. Similarly d is also a divisor of b, and d is a common divisor of a and b.

Now, let c be any common divisor of a and b; that is there exist u and v such that a = cu and b = cv. One has thus

{\begin{aligned}d&=as+bt\\&=cus+cvt\\&=c(us+vt).\end{aligned}}

That is c is a divisor of d, and, therefore cd

## Generalizations

### For three or more integers

Bézout's identity can be extended to more than two integers: if

$\gcd(a_{1},a_{2},\ldots ,a_{n})=d$

then there are integers $x_{1},x_{2},\ldots ,x_{n}$  such that

$d=a_{1}x_{1}+a_{2}x_{2}+\cdots +a_{n}x_{n}$

has the following properties:

• d is the smallest positive integer of this form
• every number of this form is a multiple of d

### For polynomials

Bézout's identity works for univariate polynomials over a field exactly in the same ways as for integers. In particular the Bézout's coefficients and the greatest common divisor may be computed with the extended Euclidean algorithm.

As the common roots of two polynomials are the roots of their greatest common divisor, Bézout's identity and fundamental theorem of algebra imply the following result:

For univariate polynomials f and g with coefficients in a field, there exist polynomials a and b such that af + bg = 1 if and only if f and g have no common root in any algebraically closed field (commonly the field of complex numbers).

The generalization of this result to any number of polynomials and indeterminates is Hilbert's Nullstellensatz.

### For principal ideal domains

As noted in the introduction, Bézout's identity works not only in the ring of integers, but also in any other principal ideal domain (PID). That is, if R is a PID, and a and b are elements of R, and d is a greatest common divisor of a and b, then there are elements x and y in R such that ax + by = d. The reason is that the ideal Ra+Rb is principal and equal to Rd.

An integral domain in which Bézout's identity holds is called a Bézout domain.

## History

French mathematician Étienne Bézout (1730–1783) proved this identity for polynomials. However, this statement for integers can be found already in the work of another French mathematician, Claude Gaspard Bachet de Méziriac (1581–1638).