Quartic Reciprocity

Quartic or biquadratic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence ''x''⁴ ≡ ''p'' (mod ''q'') is solvable; the word "reciprocity" comes from the form of some of these theorems, in that they relate the solvability of the congruence ''x''⁴ ≡ ''p'' (mod ''q'') to that of ''x''⁴ ≡ ''q'' (mod ''p'').

History

Euler made the first conjectures about biquadratic reciprocity. Gauss published two monographs on biquadratic reciprocity. In the first one (1828) he proved Euler's conjecture about the biquadratic character of 2. In the second one (1832) he stated the biquadratic reciprocity law for the Gaussian integers and proved the supplementary formulas. He saidGauss, BQ, § 67 that a third monograph would be forthcoming with the proof of the general theorem, but it never appeared. Jacobi presented proofs in his Königsberg lectures of 1836–37. The first published proofs were by Eisenstein.

Since then a number of other proofs of the classical (Gaussian) version have been found, as well as alternate statements. Lemmermeyer states that there has been an explosion of interest in the rational reciprocity laws since the 1970s.Lemmermeyer, p. 172

Integers

A quartic or biquadratic residue (mod ''p'') is any number congruent to the fourth power of an integer (mod ''p''). If ''x''⁴ ≡ ''a'' (mod ''p'') does not have an integer solution, ''a'' is a quartic or biquadratic nonresidue (mod ''p'').Gauss, BQ § 2

As is often the case in number theory, it is easiest to work modulo prime numbers, so in this section all moduli ''p'', ''q'', etc., are assumed to positive, odd primes.

Gauss

The first thing to notice when working within the ring Z of integers is that if the prime number ''q'' is ≡ 3 (mod 4) then a residue ''r'' is a quadratic residue (mod ''q'') if and only if it is a biquadratic residue (mod ''q''). Indeed, the first supplement of quadratic reciprocity states that −1 is a quadratic nonresidue (mod ''q''), so that for any integer ''x'', one of ''x'' and −''x'' is a quadratic residue and the other one is a nonresidue. Thus, if ''r'' ≡ ''a''² (mod ''q'') is a quadratic residue, then if ''a'' ≡ ''b''² is a residue, ''r'' ≡ ''a''² ≡ ''b''⁴ (mod ''q'') is a biquadratic residue, and if ''a'' is a nonresidue, −''a'' is a residue, −''a'' ≡ ''b''², and again, ''r'' ≡ (−''a'')² ≡ ''b''⁴ (mod ''q'') is a biquadratic residue.

Therefore, the only interesting case is when the modulus ''p'' ≡ 1 (mod 4).

Gauss proved that if ''p'' ≡ 1 (mod 4) then the nonzero residue classes (mod ''p'') can be divided into four sets, each containing (''p''−1)/4 numbers. Let ''e'' be a quadratic nonresidue. The first set is the quartic residues; the second one is ''e'' times the numbers in the first set, the third is ''e''² times the numbers in the first set, and the fourth one is ''e''³ times the numbers in the first set. Another way to describe this division is to let ''g'' be a primitive root (mod ''p''); then the first set is all the numbers whose indices with respect to this root are ≡ 0 (mod 4), the second set is all those whose indices are ≡ 1 (mod 4), etc. In the vocabulary of group theory, the first set is a subgroup of index 4 (of the multiplicative group Z/pZ^×), and the other three are its cosets.

The first set is the biquadratic residues, the third set is the quadratic residues that are not quartic residues, and the second and fourth sets are the quadratic nonresidues. Gauss proved that −1 is a biquadratic residue if ''p'' ≡ 1 (mod 8) and a quadratic, but not biquadratic, residue, when ''p'' ≡ 5 (mod 8).Gauss, BQ § 10

2 is a quadratic residue mod ''p'' if and only if ''p'' ≡ ±1 (mod 8). Since ''p'' is also ≡ 1 (mod 4), this means ''p'' ≡ 1 (mod 8). Every such prime is the sum of a square and twice a square.

Gauss proved

Let ''q'' = ''a''² + 2''b''² ≡ 1 (mod 8) be a prime number. Then

:2 is a biquadratic residue (mod ''q'') if and only if ''a'' ≡ ±1 (mod 8), and
:2 is a quadratic, but not a biquadratic, residue (mod ''q'') if and only if ''a'' ≡ ±3 (mod 8).

Every prime ''p'' ≡ 1 (mod 4) is the sum of two squares. If ''p'' = ''a''² + ''b''² where ''a'' is odd and ''b'' is even, Gauss proved that

2 belongs to the first (respectively second, third, or fourth) class defined above if and only if ''b'' ≡ 0 (resp. 2, 4, or 6) (mod 8). The first case of this is one of Euler's conjectures:

:2 is a biquadratic residue of a prime ''p'' ≡ 1 (mod 4) if and only if ''p'' = ''a''² + 64''b''².

Dirichlet

For an odd prime number ''p'' and a quadratic residue ''a'' (mod ''p''), Euler's criterion states that $a^ \equiv 1 \pmod,$ so if ''p'' ≡ 1 (mod 4), $a^\equiv\pm 1 \pmod.$

Define the rational quartic residue symbol for prime ''p'' ≡ 1 (mod 4) and quadratic residue ''a'' (mod ''p'') as $\Bigg(\frac\Bigg)_4= \pm 1 \equiv a^ \pmod.$ It is easy to prove that ''a'' is a biquadratic residue (mod ''p'') if and only if $\Bigg(\frac\Bigg)_4= 1.$

Dirichlet simplified Gauss's proof of the biquadratic character of 2 (his proof only requires quadratic reciprocity for the integers) and put the result in the following form:

Let ''p'' = ''a''² + ''b''² ≡ 1 (mod 4) be prime, and let ''i'' ≡ ''b''/''a'' (mod ''p''). Then
:$\Bigg(\frac\Bigg)_4 \equiv i^\frac\pmod.$     (Note that ''i''² ≡ −1 (mod ''p'').)

In fact, let ''p'' = ''a''² + ''b''² = ''c''² + 2''d''² = ''e''² − 2''f''² ≡ 1 (mod 8) be prime, and assume ''a'' is odd. Then
:$\Bigg(\frac\Bigg)_4 =\left(-1\right)^\frac =\Bigg(\frac\Bigg) =\left(-1\right)^ =\Bigg(\frac\Bigg),$   where $(\tfrac)$ is the ordinary Legendre symbol.

Going beyond the character of 2, let the prime ''p'' = ''a''² + ''b''² where ''b'' is even, and let ''q'' be a prime such that $(\tfrac)=1.$ Quadratic reciprocity says that $(\tfrac)=1,$ where $q^*=(-1)^\fracq.$ Let σ² ≡ ''p'' (mod ''q''). Then
:$\Bigg(\frac\Bigg)_4= \Bigg(\frac\Bigg).$ This implies that

:$\Bigg(\frac\Bigg)_4= 1 \mbox \begin b\equiv 0 \pmod; & \mbox \\ a\equiv 0 \pmod \mbox \left(\frac\right)=1; & \mbox \\ a \equiv \mu b,\;\; \mu^2+1 \equiv \lambda^2 \pmod\mbox\left(\frac\right)=1. \end$

The first few examples are:
:$\begin \left(\frac\right)_4= 1 &\mbox &b&\equiv 0 \pmod\\ \left(\frac\right)_4= 1 &\mbox &b&\equiv 0 \pmod\\ \left(\frac\right)_4= 1 &\mbox &ab&\equiv 0 \pmod\\ \left(\frac\right)_4= 1 & \mbox& b(b^2-3a^2)&\equiv 0 \pmod\\ \left(\frac\right)_4= 1 &\mbox &b(b^2-3a^2)&\equiv 0\pmod\\ \left(\frac\right)_4= 1 &\mbox\;\;\;\;& ab(b^2-a^2)&\equiv 0\pmod.\\ \end$

Euler had conjectured the rules for 2, −3 and 5, but did not prove any of them.

Dirichlet also proved that if ''p'' ≡ 1 (mod 4) is prime and $(\tfrac)=1$ then
:$\Bigg(\frac\Bigg)_4\Bigg(\frac\Bigg)_4= \begin +1 \mbox\;\;p=x^2+17y^2 \\ -1 \mbox2p=x^2+17y^2 \end$

This has been extended from 17 to 17, 73, 97, and 193 by Brown and Lehmer.

Burde

There are a number of equivalent ways of stating Burde's rational biquadratic reciprocity law.

They all assume that ''p'' = ''a''² + ''b''² and ''q'' = ''c''² + ''d''² are primes where ''b'' and ''d'' are even, and that $(\tfrac)=1.$

Gosset's version is
:$\Bigg(\frac\Bigg)_4 \equiv\Bigg(\frac\Bigg)^\frac\pmod.$

Letting ''i''² ≡ −1 (mod ''p'') and ''j''² ≡ −1 (mod ''q''), Frölich's law is
:$\Bigg(\frac\Bigg)_4 \Bigg(\frac\Bigg)_4 =\Bigg(\frac\Bigg)=\Bigg(\frac\Bigg).$

Burde stated his in the form:
:$\Bigg(\frac\Bigg)_4 \Bigg(\frac\Bigg)_4 =\Bigg(\frac\Bigg).$

Note that
:$\Bigg(\frac\Bigg)=\Bigg(\frac\Bigg)\Bigg(\frac\Bigg).$

Miscellany

Let ''p'' ≡ ''q'' ≡ 1 (mod 4) be primes and assume $(\tfrac)=1$. Then ''e''² = ''p f''² + ''q g''² has non-trivial integer solutions, and
:$\Bigg(\frac\Bigg)_4 \Bigg(\frac\Bigg)_4 =\left(-1\right)^\frac\left(\frac\right).$

Let ''p'' ≡ ''q'' ≡ 1 (mod 4) be primes and assume ''p'' = ''r''² + ''q s''². Then
:$\Bigg(\frac\Bigg)_4 \Bigg(\frac\Bigg)_4 =\left(\frac\right)^s.$

Let ''p'' = 1 + 4''x''² be prime, let ''a'' be any odd number that divides ''x'', and let $a^*=\left(-1\right)^\fraca.$ Then ''a''^* is a biquadratic residue (mod ''p'').

Let ''p'' = ''a''² + 4''b''² = ''c''² + 2''d''² ≡ 1 (mod 8) be prime. Then all the divisors of ''c''⁴ − ''p a''² are biquadratic residues (mod ''p''). The same is true for all the divisors of ''d''⁴ − ''p b''².

Gaussian integers

Background

In his second monograph on biquadratic reciprocity Gauss displays some examples and makes conjectures that imply the theorems listed above for the biquadratic character of small primes. He makes some general remarks, and admits there is no obvious general rule at work. He goes on to say

The theorems on biquadratic residues gleam with the greatest simplicity and genuine beauty only when the field of arithmetic is extended to imaginary numbers, so that without restriction, the numbers of the form ''a'' + ''bi'' constitute the object of study ... we call such numbers integral complex numbers. old in the original/blockquote>

These numbers are now called the ring of Gaussian integers, denoted by Z 'i'' Note that ''i'' is a fourth root of 1.

In a footnote he adds

The theory of cubic residues must be based in a similar way on a consideration of numbers of the form ''a'' + ''bh'' where ''h'' is an imaginary root of the equation ''h''³ = 1 ... and similarly the theory of residues of higher powers leads to the introduction of other imaginary quantities.

The numbers built up from a cube root of unity are now called the ring of Eisenstein integers. The "other imaginary quantities" needed for the "theory of residues of higher powers" are the rings of integers of the cyclotomic number fields; the Gaussian and Eisenstein integers are the simplest examples of these.

Facts and terminology

Gauss develops the arithmetic theory of the "integral complex numbers" and shows that it is quite similar to the arithmetic of ordinary integers. This is where the terms unit, associate, norm, and primary were introduced into mathematics.

The units are the numbers that divide 1.Gauss, BQ, § 31 They are 1, ''i'', −1, and −''i''. They are similar to 1 and −1 in the ordinary integers, in that they divide every number. The units are the powers of ''i''.

Given a number λ = ''a'' + ''bi'', its conjugate is ''a'' − ''bi'' and its associates are the four numbers

:    λ = +''a'' + ''bi''
:   ''i''λ = −''b'' + ''ai''
:  −λ = −''a'' − ''bi''
: −''i''λ = +''b'' − ''ai''

If λ = ''a'' + ''bi'', the norm of λ, written Nλ, is the number ''a''² + ''b''². If λ and μ are two Gaussian integers, Nλμ = Nλ Nμ; in other words, the norm is multiplicative. The norm of zero is zero, the norm of any other number is a positive integer. ε is a unit if and only if Nε = 1. The square root of the norm of λ, a nonnegative real number which may not be a Gaussian integer, is the absolute value of lambda.

Gauss proves that Z 'i''is a unique factorization domain and shows that the primes fall into three classes:
* 2 is a special case: 2 = ''i''³ (1 + ''i'')². It is the only prime in Z divisible by the square of a prime in Z 'i'' In algebraic number theory, 2 is said to ramify in Z 'i''
* Positive primes in Z ≡ 3 (mod 4) are also primes in Z 'i'' In algebraic number theory, these primes are said to remain inert in Z 'i''
* Positive primes in Z ≡ 1 (mod 4) are the product of two conjugate primes in Z 'i'' In algebraic number theory, these primes are said to split in Z 'i''

Thus, inert primes are 3, 7, 11, 19, ... and a factorization of the split primes is
: 5 = (2 + ''i'') × (2 − ''i''),
:13 = (2 + 3''i'') × (2 − 3''i''),
:17 = (4 + ''i'') × (4 − ''i''),
:29 = (2 + 5''i'') × (2 − 5''i''), ...

The associates and conjugate of a prime are also primes.

Note that the norm of an inert prime ''q'' is N''q'' = ''q''² ≡ 1 (mod 4); thus the norm of all primes other than 1 + ''i'' and its associates is ≡ 1 (mod 4).

Gauss calls a number in Z 'i''odd if its norm is an odd integer. Thus all primes except 1 + ''i'' and its associates are odd. The product of two odd numbers is odd and the conjugate and associates of an odd number are odd.

In order to state the unique factorization theorem, it is necessary to have a way of distinguishing one of the associates of a number. Gauss defines an odd number to be primary if it is ≡ 1 (mod (1 + ''i'')³). It is straightforward to show that every odd number has exactly one primary associate. An odd number λ = ''a'' + ''bi'' is primary if ''a'' + ''b'' ≡ ''a'' − ''b'' ≡ 1 (mod 4); i.e., ''a'' ≡ 1 and ''b'' ≡ 0, or ''a'' ≡ 3 and ''b'' ≡ 2 (mod 4). The product of two primary numbers is primary and the conjugate of a primary number is also primary.

The unique factorization theorem for Z 'i''is: if λ ≠ 0, then
:$\lambda = i^\mu(1+i)^\nu\pi_1^\pi_2^\pi_3^ \dots$
where 0 ≤ μ ≤ 3, ν ≥ 0, the π_''i''s are primary primes and the α_''i''s ≥ 1, and this representation is unique, up to the order of the factors.

The notions of congruence and greatest common divisor are defined the same way in Z 'i''as they are for the ordinary integers Z. Because the units divide all numbers, a congruence (mod λ) is also true modulo any associate of λ, and any associate of a GCD is also a GCD.

Quartic residue character

Gauss proves the analogue of Fermat's theorem: if α is not divisible by an odd prime π, then
:$\alpha^ \equiv 1 \pmod$
Since Nπ ≡ 1 (mod 4), $\alpha^$ makes sense, and $\alpha^\equiv i^k \pmod$ for a unique unit ''i''^''k''.

This unit is called the quartic or biquadratic residue character of α (mod π) and is denoted by
:\left frac\right= i^k \equiv \alpha^ \pmod.

It has formal properties similar to those of the Legendre symbol.

:The congruence    $x^4 \equiv \alpha \pmod$    is solvable in Z 'i''if and only if   \left frac\right= 1.

:\Bigg frac\Bigg\Bigg frac\BiggBigg frac\Bigg/math>

:\overline=\Bigg frac\Bigg/math>     where the bar denotes complex conjugation.

:if π and θ are associates,   \Bigg frac\Bigg\Bigg frac\Bigg/math>

:if α ≡ β (mod π),   \Bigg frac\Bigg\Bigg frac\Bigg/math>

The biquadratic character can be extended to odd composite numbers in the "denominator" in the same way the Legendre symbol is generalized into the Jacobi symbol. As in that case, if the "denominator" is composite, the symbol can equal one without the congruence being solvable:
:\left frac\right= \left frac\right \left frac\right \dots   where   $\lambda = \pi_1^\pi_2^\pi_3^ \dots$

:If ''a'' and ''b'' are ordinary integers, ''a'' ≠ 0, , ''b'', > 1, gcd(''a'', ''b'') = 1, then    \left frac\right= 1.

Statements of the theorem

Gauss stated the law of biquadratic reciprocity in this form:

Let π and θ be distinct primary primes of Z 'i'' Then

:if either π or θ or both are ≡ 1 (mod 4), then \Bigg frac\Bigg=\left frac\right but

:if both π and θ are ≡ 3 + 2''i'' (mod 4), then \Bigg frac\Bigg=-\left frac\right

Just as the quadratic reciprocity law for the Legendre symbol is also true for the Jacobi symbol, the requirement that the numbers be prime is not needed; it suffices that they be odd relatively prime nonunits. Probably the most well-known statement is:

Let π and θ be primary relatively prime nonunits. Then

:\Bigg frac\Biggleft frac\right=
(-1)^.

There are supplementary theorems for the units and the half-even prime 1 + ''i''.

if π = ''a'' + ''bi'' is a primary prime, then
:\Bigg frac\Biggi^,\;\;\; \Bigg frac\Biggi^\frac,

and thus
:\Bigg frac\Bigg(-1)^,\;\;\; \Bigg frac\Biggi^.

Also, if π = ''a'' + ''bi'' is a primary prime, and ''b'' ≠ 0 then

:\Bigg frac\Bigg\Bigg frac\Bigg-1)^\frac   (if ''b'' = 0 the symbol is 0).

Jacobi defined π = ''a'' + ''bi'' to be primary if ''a'' ≡ 1 (mod 4). With this normalization, the law takes the form

Let α = ''a'' + ''bi'' and β = ''c'' + ''di'' where ''a'' ≡ ''c'' ≡ 1 (mod 4) and ''b'' and ''d'' are even be relatively prime nonunits. Then

:\left frac\rightleft frac\right=
(-1)^

The following version was found in Gauss's unpublished manuscripts.

Let α = ''a'' + 2''bi'' and β = ''c'' + 2''di'' where ''a'' and ''c'' are odd be relatively prime nonunits. Then

:\left frac\rightleft frac\right=
(-1)^,\;\;\;\;
\left frac\righti^

The law can be stated without using the concept of primary:

If λ is odd, let ε(λ) be the unique unit congruent to λ (mod (1 + ''i'')³); i.e., ε(λ) = ''i''^''k'' ≡ λ (mod 2 + 2''i''), where 0 ≤ ''k'' ≤ 3. Then for odd and relatively prime α and β, neither one a unit,

:\left frac\rightleft frac\right=
(-1)^\epsilon(\alpha)^\frac\epsilon(\beta)^\frac

For odd λ, let $\lambda^*=(-1)^\frac\lambda.$ Then if λ and μ are relatively prime nonunits, Eisenstein provedLemmermeyer, Ch. 8.4, Ex. 8.19

:\left frac\right\Bigg frac\Bigg

See also

* Quadratic reciprocity
* Cubic reciprocity
* Octic reciprocity
* Eisenstein reciprocity
* Artin reciprocity

Notes

* A.Here, "rational" means laws that are stated in terms of ordinary integers rather than in terms of the integers of some algebraic number field.

References

Literature

The references to the original papers of Euler, Dirichlet, and Eisenstein were copied from the bibliographies in Lemmermeyer and Cox, and were not used in the preparation of this article.

Euler

*

This was actually written 1748–1750, but was only published posthumously; It is in Vol V, pp. 182–283 of

*

Gauss

The two monographs Gauss published on biquadratic reciprocity have consecutively numbered sections: the first contains §§ 1–23 and the second §§ 24–76. Footnotes referencing these are of the form "Gauss, BQ, § ''n''". Footnotes referencing the ''Disquisitiones Arithmeticae'' are of the form "Gauss, DA, Art. ''n''".

*

*

These are in Gauss's ''Werke'', Vol II, pp. 65–92 and 93–148

German translations are in pp. 511–533 and 534–586 of the following, which also has the Disquisitiones Arithmeticae and Gauss's other papers on number theory.

*

Eisenstein

*

*

*

*

These papers are all in Vol I of his ''Werke''.

Dirichlet

*

*

both of these are in Vol I of his ''Werke''.

Modern authors

*

*

*

External links

* {{mathworld, urlname=BiquadraticReciprocityTheorem, title=Biquadratic Reciprocity Theorem

These two papers by Franz Lemmermeyer contain proofs of Burde's law and related results:
Rational Quartic ReciprocityRational Quartic Reciprocity II

Algebraic number theory
Modular arithmetic
Theorems in number theory