Quadratic reciprocity
|
|
In mathematics, in number theory, the law of quadratic reciprocity connects the solvability of two related quadratic equations in modular arithmetic. As a consequence, it allows us to determine the solvability of any quadratic equation in modular arithmetic.
It was conjectured by Euler and Legendre and first satisfactorily proved by Gauss.
Suppose p and q are two different odd primes, which means that p and q are congruent either to 1 or to 3 (mod 4). If at least one of them is congruent to 1 mod 4, then the congruence
- <math>x^2\equiv p\ ({\rm mod}\ q)<math>
has a solution x if and only if the congruence
- <math>y^2\equiv q\ ({\rm mod}\ p)<math>
has a solution y. (The two solutions will in general be different.) On the other hand, if both primes are congruent to 3 modulo 4, then the congruence
- <math>x^2\equiv p\ ({\rm mod}\ q)<math>
has a solution x if and only if the congruence
- <math>y^2\equiv q\ ({\rm mod}\ p)<math>
does not have a solution y.
Using the Legendre symbol
Using the Legendre symbol:
- <math>\left(\frac{p}{q}\right)=\left\{\begin{matrix}1 & \mathrm{if}\ p\ \mathrm{is\ a\ square\ modulo\ }q, \\
-1 & \mathrm{otherwise,}\end{matrix}\right.<math>
these statements may be summarized as
- <math> \left(\frac{p}{q}\right) \left(\frac{q}{p}\right) = (-1)^{(p-1)(q-1)/4}.<math>
Since <math>(p-1)(q-1)/4<math> is even if either p or q is congruent to 1 mod 4, and odd only if both p and q are odd, <math> \left(\frac{p}{q}\right) \left(\frac{q}{p}\right)<math> is equal to 1 if either p or q is congruent to 1 mod 4, and is equal to –1 if both p and q are congruent to 3 mod 4.
For example taking p to be 11 and q to be 19, we can relate <math>\left(\frac{11}{19}\right)<math> to <math>\left(\frac{19}{11}\right)<math>, which is <math>\left(\frac{8}{11}\right)<math> or <math>\left(\frac{-3}{11}\right)<math>. To proceed further we may need to know supplementary laws for computing <math>\left(\frac{2}{q}\right)<math> and <math>\left(\frac{-1}{q}\right)<math> explicitly. For example,
- <math>\left(\frac{-1}{q}\right) = (-1)^{(q-1)/2}.<math>
Using this we relate <math>\left(\frac{-3}{11}\right)<math> to <math>\left(\frac{3}{11}\right)<math> to <math>\left(\frac{11}{3}\right)<math> to <math>\left(\frac{2}{3}\right)<math> to <math>\left(\frac{-1}{3}\right)<math>, and can complete the initial calculation.
Franz Lemmermeyer's book Reciprocity Laws: From Euler to Eisenstein, published in 2000, collects literature citations for 196 different published proofs for the quadratic reciprocity law.
There are cubic, quartic (biquadratic) and other higher reciprocity laws; but since two of the cube roots of 1 (root of unity) are not real, cubic reciprocity is outside the arithmetic of the rational numbers (and the same applies to higher laws).
The Gauss lemma reasons about the properties of quadratic residues and is involved in two of Gauss's proofs of quadratic reciprocity.
External links
- Quadratic Reciprocity Theorem (http://mathworld.wolfram.com/QuadraticReciprocityTheorem.html) from MathWorld
- A play comparing two proofs of the quadratic reciprocity law (http://www.math.nmsu.edu/~history/schauspiel/schauspiel.html)
de:Quadratisches Reziprozitätsgesetz fr:Loi de réciprocité quadratique hu:Kvadratikus reciprocitás tétele it:Legge di reciprocità quadratica ja:平方剰余の相互法則 pl:Prawo wzajemności reszt kwadratowych ru:Квадратичный закон взаимности sv:Kvadratiska reciprocitetssatsen zh:二次互反律