In number theory, the law of quadratic reciprocity, like the Pythagorean theorem, has lent itself to an unusually large number of proofs. Several hundred proofs of the law of quadratic reciprocity have been published.
Proof synopsis Of the elementary combinatorial proofs, there are two which apply types of double counting. One by Gotthold Eisenstein counts integer lattice points. Another applies Zolotarev's lemma to ( Z / p q Z ) × {\displaystyle (\mathbb {Z} /pq\mathbb {Z} )^{\times }} , expressed by the Chinese remainder theorem as ( Z / p Z ) × × ( Z / q Z ) × {\displaystyle (\mathbb {Z} /p\mathbb {Z} )^{\times }\times (\mathbb {Z} /q\mathbb {Z} )^{\times }} and calculates the signature of a permutation. The shortest known proof also uses a simplified version of double counting, namely double counting modulo a fixed prime.
Eisenstein's proof Eisenstein's proof of quadratic reciprocity is a simplification of Gauss's third proof. It is more geometrically intuitive and requires less technical manipulation. The point of departure is "Eisenstein's lemma", which states that for odd prime p and positive integer a not divisible by p,
( a p ) = ( − 1 ) ∑ u ⌊ a u / p ⌋ , {\displaystyle \left({\frac {a}{p}}\right)=(-1)^{\sum _{u}\left\lfloor au/p\right\rfloor },}
where ⌊ x ⌋ {\displaystyle \left\lfloor x\right\rfloor } denotes the floor function (the largest integer less than or equal to x), and where the sum is taken over the even integers u = 2, 4, 6, ..., p−1. For example,
( 7 11 ) = ( − 1 ) ⌊ 14 / 11 ⌋ + ⌊ 28 / 11 ⌋ + ⌊ 42 / 11 ⌋ + ⌊ 56 / 11 ⌋ + ⌊ 70 / 11 ⌋ = ( − 1 ) 1 + 2 + 3 + 5 + 6 = ( − 1 ) 17 = − 1. {\displaystyle \left({\frac {7}{11}}\right)=(-1)^{\left\lfloor 14/11\right\rfloor +\left\lfloor 28/11\right\rfloor +\left\lfloor 42/11\right\rfloor +\left\lfloor 56/11\right\rfloor +\left\lfloor 70/11\right\rfloor }=(-1)^{1+2+3+5+6}=(-1)^{17}=-1.}
This result is very similar to Gauss's lemma, and can be proved in a similar fashion (proof given below). Using this representation of (q/p), the main argument is quite elegant. The sum ∑ u ⌊ q u / p ⌋ {\textstyle \sum _{u}\left\lfloor qu/p\right\rfloor } counts the number of lattice points with even x-coordinate in the interior of the triangle ABC in the following diagram:
Because each column has an even number of points (namely q−1 points), the number of such lattice points in the region BCYX is the same modulo 2 as the number of such points in the region CZY:
Then by flipping the diagram in both axes, we see that the number of points with even x-coordinate inside CZY is the same as the number of points inside AXY having odd x-coordinates. This can be justified mathematically by noting that q − 1 − ⌊ 2 k q p ⌋ = ⌊ ( p − 2 k ) q p ⌋ {\displaystyle \textstyle q-1-\left\lfloor {\frac {2kq}{p}}\right\rfloor =\left\lfloor {\frac {(p-2k)q}{p}}\right\rfloor } .
The conclusion is that
( q p ) = ( − 1 ) μ , {\displaystyle \left({\frac {q}{p}}\right)=(-1)^{\mu },}
where μ is the total number of lattice points in the interior of AXY. Switching p and q, the same argument shows that
( p q ) = ( − 1 ) ν , {\displaystyle \left({\frac {p}{q}}\right)=(-1)^{\nu },}
where ν is the number of lattice points in the interior of WYA. Since there are no lattice points on the line AY itself (because p and q are relatively prime), and since the total number of points in the rectangle WYXA is
( p − 1 2 ) ( q − 1 2 ) , {\displaystyle \left({\frac {p-1}{2}}\right)\left({\frac {q-1}{2}}\right),}
we obtain
( q p ) ( p q ) = ( − 1 ) μ + ν = ( − 1 ) ( p − 1 ) ( q − 1 ) / 4 . {\displaystyle \left({\frac {q}{p}}\right)\left({\frac {p}{q}}\right)=(-1)^{\mu +\nu }=(-1)^{(p-1)(q-1)/4}.}
Proof of Eisenstein's lemma For an even integer u in the range 1 ≤ u ≤ p−1, denote by r(u) the least positive residue of au modulo p. (For example, for p = 11, a = 7, we allow u = 2, 4, 6, 8, 10, and the corresponding values of r(u) are 3, 6, 9, 1, 4.) The numbers (−1)r(u)r(u), again treated as least positive residues modulo p, are all even (in our running example, they are 8, 6, 2, 10, 4.) Furthermore, they are all distinct, because if (−1)r(u)r(u) ≡ (−1)r(t)r(t) (mod p), then we may divide out by a to obtain u ≡ ±t (mod p). This forces u ≡ t (mod p), because both u and t are even, whereas p is odd. Since there are exactly (p−1)/2 of them and they are distinct, they must be simply a rearrangement of the even integers 2, 4, ..., p−1 (compare with a similar proof of Fermat's little theorem). Multiplying them together, we obtain
( − 1 ) r ( 2 ) r ( 2 ) ⋅ ( − 1 ) r ( 4 ) r ( 4 ) ⋯ ( − 1 ) r ( p − 1 ) r ( p − 1 ) ≡ 2 ⋅ 4 ⋯ ( p − 1 ) ( mod p ) . {\displaystyle (-1)^{r(2)}r(2)\cdot (-1)^{r(4)}r(4)\dotsm (-1)^{r(p-1)}r(p-1)\equiv 2\cdot 4\dotsm (p-1){\pmod {p}}.}
Dividing out successively by 2, 4, ..., p−1 on both sides (which is permissible since none of them are divisible by p) and rearranging, we have
a ( p − 1 ) / 2 ≡ ( − 1 ) r ( 2 ) + r ( 4 ) + ⋯ + r ( p − 1 ) ( mod p ) . {\displaystyle a^{(p-1)/2}\equiv (-1)^{r(2)+r(4)+\cdots +r(p-1)}{\pmod {p}}.}
On the other hand, by the definition of r(u) and the floor function,
a u = p ⌊ a u p ⌋ + r ( u ) {\displaystyle au=p\left\lfloor {\frac {au}{p}}\right\rfloor +r(u)}
and, since p is odd and u is even, this implies that ⌊ a u / p ⌋ {\displaystyle \left\lfloor au/p\right\rfloor } and r(u) are congruent modulo 2, which shows that
a ( p − 1 ) / 2 ≡ ( − 1 ) ∑ u ⌊ a u / p ⌋ ( mod p ) . {\displaystyle a^{(p-1)/2}\equiv (-1)^{\sum _{u}\left\lfloor au/p\right\rfloor }{\pmod {p}}.}
We are finished because the left hand side is just an alternative expression for (a/p), per Euler's criterion.
Addendum to the lemma This lemma essentially states that the number of least residues after doubling that are odd gives the value of (q/p). This follows easily from Gauss' lemma. Also, q u = p ⌊ q u p ⌋ + r ( u ) {\displaystyle qu=p\left\lfloor {\frac {qu}{p}}\right\rfloor +r(u)} implies that ⌊ q u / p ⌋ {\displaystyle \left\lfloor qu/p\right\rfloor } and r(u) are either congruent modulo 2, or incongruent, depending solely on the parity of u. This means that the residues 1 , 2 , … , p − 1 2 {\displaystyle 1,2,\dots ,{\frac {p-1}{2}}} are (in)congruent to ⌊ q u / p ⌋ {\displaystyle \left\lfloor qu/p\right\rfloor } , and so
( − 1 ) p − 1 2 ≡ ( − 1 ) ∑ u ⌊ q u / p ⌋ ≡ ( − 1 ) ∑ u r ( u ) + u {\displaystyle (-1)^{\frac {p-1}{2}}\equiv (-1)^{\sum _{u}\left\lfloor qu/p\right\rfloor }\equiv (-1)^{\sum _{u}r(u)+u}}
where 1 ≤ u ≤ p − 1 2 {\displaystyle \textstyle 1\leq u\leq {\frac {p-1}{2}}} . For example, using the previous example of p = 7 , q = 11 {\displaystyle p=7,q=11} , the residues are 7 , 3 , 10 , 6 , 2 {\displaystyle 7,3,10,6,2} and the floor function gives 0 , 1 , 1 , 2 , 3 {\displaystyle 0,1,1,2,3} . The pattern of congruence is 1 , 0 , 1 , 0 , 1 {\displaystyle 1,0,1,0,1} .
Proof using quadratic Gauss sums The proof of Quadratic Reciprocity using Gauss sums is one of the more common and classic proofs. These proofs work by comparing computations of single values in two different ways, one using Euler's Criterion and the other using the Binomial theorem. As an example of how Euler's criterion is used, we can use it to give a quick proof of the first supplemental case of determining ( − 1 p ) {\textstyle \left({\frac {-1}{p}}\right)} for an odd prime p: By Euler's criterion ( − 1 p ) ≡ ( − 1 ) p − 1 2 ( mod p ) {\textstyle \left({\frac {-1}{p}}\right)\equiv (-1)^{\frac {p-1}{2}}{\pmod {p}}} , but since both sides of the equivalence are ±1 and p is odd, we can deduce that ( − 1 p ) = ( − 1 ) p − 1 2 {\textstyle \left({\frac {-1}{p}}\right)=(-1)^{\frac {p-1}{2}}} .
The second supplemental case Let ζ 8 = e 2 π i / 8 {\textstyle \zeta _{8}=e^{2\pi i/8}} , a primitive 8th root of unity and set τ = ζ 8 + ζ 8 − 1 {\textstyle \tau =\zeta _{8}+\zeta _{8}^{-1}} . Since ζ 8 2 = i {\textstyle \zeta _{8}^{2}=i} and ζ 8 − 2 = − i {\textstyle \zeta _{8}^{-2}=-i} we see that τ 2 = 2 {\textstyle \tau ^{2}=2} . Because τ {\displaystyle \tau } is an algebraic integer, if p is an odd prime it makes sense to talk about it modulo p. (Formally we are considering the commutative ring formed by factoring the algebraic integers A {\displaystyle \mathbf {A} } with the ideal generated by p. Because p − 1 {\displaystyle p^{-1}} is not an algebraic integer, 1, 2, ..., p are distinct elements of A / p A {\displaystyle {\mathbf {A} }/p{\mathbf {A} }} .) Using Euler's criterion, it follows that τ p − 1 = ( τ 2 ) p − 1 2 = 2 p − 1 2 ≡ ( 2 p ) ( mod p ) {\displaystyle \tau ^{p-1}=(\tau ^{2})^{\frac {p-1}{2}}=2^{\frac {p-1}{2}}\equiv \left({\frac {2}{p}}\right){\pmod {p}}} We can then say that τ p ≡ ( 2 p ) τ ( mod p ) {\displaystyle \tau ^{p}\equiv \left({\frac {2}{p}}\right)\tau {\pmod {p}}} But we can also compute τ p ( mod p ) {\textstyle \tau ^{p}{\pmod {p}}} using the binomial theorem. Because the cross terms in the binomial expansion all contain factors of p, we find that τ p ≡ ζ 8 p + ζ 8 − p ( mod p ) {\textstyle \tau ^{p}\equiv \zeta _{8}^{p}+\zeta _{8}^{-p}{\pmod {p}}} . We can evaluate this more exactly by breaking this up into two cases
p ≡ ± 1 ( mod 8 ) ⇒ ζ 8 p + ζ 8 − p = ζ 8 + ζ 8 − 1 {\textstyle p\equiv \pm 1{\pmod {8}}\Rightarrow \zeta _{8}^{p}+\zeta _{8}^{-p}=\zeta _{8}+\zeta _{8}^{-1}} .
p ≡ ± 3 ( mod 8 ) ⇒ ζ 8 p + ζ 8 − p = − ζ 8 − ζ 8 − 1 {\textstyle p\equiv \pm 3{\pmod {8}}\Rightarrow \zeta _{8}^{p}+\zeta _{8}^{-p}=-\zeta _{8}-\zeta _{8}^{-1}} . These are the only options for a prime modulo 8 and both of these cases can be computed using the exponential form ζ 8 = e 2 π i 8 {\textstyle \zeta _{8}=e^{\frac {2\pi i}{8}}} . We can write this succinctly for all odd primes p as τ p ≡ ( − 1 ) p 2 − 1 8 τ ( mod p ) {\displaystyle \tau ^{p}\equiv (-1)^{\frac {p^{2}-1}{8}}\tau {\pmod {p}}} Combining these two expressions for τ p ( mod p ) {\textstyle \tau ^{p}{\pmod {p}}} and multiplying through by τ {\displaystyle \tau } we find that 2 ⋅ ( 2 p ) ≡ 2 ⋅ ( − 1 ) p 2 − 1 8 ( mod p ) {\textstyle 2\cdot \left({\frac {2}{p}}\right)\equiv 2\cdot (-1)^{\frac {p^{2}-1}{8}}{\pmod {p}}} . Since both ( 2 p ) {\textstyle \left({\frac {2}{p}}\right)} and ( − 1 ) p 2 − 1 8 {\displaystyle (-1)^{\frac {p^{2}-1}{8}}} are ±1 and 2 is invertible modulo p, we can conclude that ( 2 p ) = ( − 1 ) p 2 − 1 8 {\displaystyle \left({\frac {2}{p}}\right)=(-1)^{\frac {p^{2}-1}{8}}}
The general case The idea for the general proof follows the above supplemental case: Find an algebraic integer that somehow encodes the Legendre symbols for p, then find a relationship between Legendre symbols by computing the qth power of this algebraic integer modulo q in two different ways, one using Euler's criterion the other using the binomial theorem. Let g p = ∑ k = 1 p − 1 ( k p ) ζ p k {\displaystyle g_{p}=\sum _{k=1}^{p-1}\left({\frac {k}{p}}\right)\zeta _{p}^{k}} where ζ p = e 2 π i / p {\displaystyle \zeta _{p}=e^{2\pi i/p}} is a primitive pth root of unity. This is a quadratic Gauss sum. A fundamental property of these Gauss sums is that g p 2 = p ∗ {\displaystyle g_{p}^{2}=p^{*}} where p ∗ = ( − 1 p ) p {\textstyle p^{*}=\left({\frac {-1}{p}}\right)p} . To put this in context of the next proof, the individual elements of the Gauss sum are in the cyclotomic field L = Q ( ζ p ) {\displaystyle L=\mathbb {Q} (\zeta _{p})} but the above formula shows that the sum itself is a generator of the unique quadratic field contained in L. Again, since the quadratic Gauss sum is an algebraic integer, we can use modular arithmetic with it. Using this fundamental formula and Euler's criterion we find that g p q − 1 = ( g p 2 ) q − 1 2 = ( p ∗ ) q − 1 2 ≡ ( p ∗ q ) ( mod q ) {\displaystyle g_{p}^{q-1}=(g_{p}^{2})^{\frac {q-1}{2}}=(p^{*})^{\frac {q-1}{2}}\equiv \left({\frac {p^{*}}{q}}\right){\pmod {q}}} Therefore g p q ≡ ( p ∗ q ) g p ( mod q ) {\displaystyle g_{p}^{q}\equiv \left({\frac {p^{*}}{q}}\right)g_{p}{\pmod {q}}} Using the binomial theorem, we also find that g p q ≡ ∑ k = 1 p − 1 ( k p ) ζ p q k ( mod q ) {\textstyle g_{p}^{q}\equiv \sum _{k=1}^{p-1}\left({\frac {k}{p}}\right)\zeta _{p}^{qk}{\pmod {q}}} , If we let a be a multiplicative inverse of q ( mod p ) {\displaystyle q{\pmod {p}}} , then we can rewrite this sum as ( a p ) ∑ t = 1 p − 1 ( t p ) ζ p t {\textstyle \left({\frac {a}{p}}\right)\sum _{t=1}^{p-1}\left({\frac {t}{p}}\right)\zeta _{p}^{t}} using the substitution t = q k {\displaystyle t=qk} , which doesn't affect the range of the sum. Since ( a p ) = ( q p ) {\textstyle \left({\frac {a}{p}}\right)=\left({\frac {q}{p}}\right)} , we can then write g p q ≡ ( q p ) g p ( mod q ) {\displaystyle g_{p}^{q}\equiv \left({\frac {q}{p}}\right)g_{p}{\pmod {q}}} Using these two expressions for g p q ( mod q ) {\textstyle g_{p}^{q}{\pmod {q}}} , and multiplying through by g p {\displaystyle g_{p}} gives ( q p ) p ∗ ≡ ( p ∗ q ) p ∗ ( mod q ) {\displaystyle \left({\frac {q}{p}}\right)p^{*}\equiv \left({\frac {p^{*}}{q}}\right)p^{*}{\pmod {q}}} Since p ∗ {\displaystyle p^{*}} is invertible modulo q, and the Legendre symbols are either ±1, we can then conclude that ( q p ) = ( p ∗ q ) {\displaystyle \left({\frac {q}{p}}\right)=\left({\frac {p^{*}}{q}}\right)}
Proof using algebraic number theory The proof presented here is by no means the simplest known; however, it is quite a deep one, in the sense that it motivates some of the ideas of Artin reciprocity.
Cyclotomic field setup Suppose that p is an odd prime. The action takes place inside the cyclotomic field
L = Q ( ζ p ) , {\displaystyle L=\mathbb {Q} (\zeta _{p}),}
where ζp is a primitive pth root of unity. The basic theory of cyclotomic fields informs us that there is a canonical isomorphism
G = Gal ( L / Q ) ≅ ( Z / p Z ) × {\displaystyle G=\operatorname {Gal} (L/\mathbb {Q} )\cong (\mathbb {Z} /p\mathbb {Z} )^{\times }}
which sends the automorphism σa satisfying σ a ( ζ p ) = ζ p a {\displaystyle \sigma _{a}(\zeta _{p})=\zeta _{p}^{a}} to the element a ∈ ( Z / p Z ) × . {\displaystyle a\in (\mathbb {Z} /p\mathbb {Z} )^{\times }.} In particular, this isomorphism is injective because the multiplicative group of a finite field is a cyclic group: F × ≅ C p − 1 {\displaystyle F^{\times }\cong C_{p-1}} . Now consider the subgroup H of squares of elements of G. Since G is cyclic, H has index 2 in G, so the subfield corresponding to H under the Galois correspondence must be a quadratic extension of Q. (In fact it is the unique quadratic extension of Q contained in L.) The Gaussian period theory determines which one; it turns out to be Q ( p ∗ ) {\displaystyle \mathbb {Q} ({\sqrt {p^{*}}})} , where
p ∗ = { p if p ≡ 1 ( mod 4 ) , − p if p ≡ 3