| Version 2 |
Version 1 |
| %11A15 |
\newtheorem{theorem}{Theorem} |
|
\newenvironment{proof}[1][Proof]{\begin{trivlist} |
|
\item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}} |
| The quadratic reciprocity law is: |
The quadratic reciprocity law is: |
|
\textbf{Theorem:} (Gauss) Let $p$ and $q$ be distinct odd primes,
|
\begin{theorem} (Gauss) Let $p$ and $q$ be distinct odd primes,
|
| and write $p=2a+1$ and $q=2b+1$. Then |
and write $p=2a+1$ and $q=2b+1$. Then |
| $\left ( \frac{p}{q} \right ) \left ( \frac{q}{p} \right )=(-1)^{ab}$. |
$\left ( \frac{p}{q} \right ) \left ( \frac{q}{p} \right )=(-1)^{ab}$. |
|
\end{theorem} |
| ($\left ( \frac{v}{w} \right )$ is the Legendre symbol, q.v.) |
($\left ( \frac{v}{w} \right )$ is the Legendre symbol, q.v.) |
|
\textbf{Proof:} We will use Gauss's lemma, which appears separately at
|
\begin{proof}
|
| planetmath.org. |
We will use Gauss's lemma, which appears separately at planetmath.org.
|
| Let $R$ be the subset $[-a,a] \times [-b,b]$ |
Let $R$ be the subset $[-a,a] \times [-b,b]$ |
| of ${\mathbb Z} \times {\mathbb Z}$. Let $S$ |
of ${\mathbb Z} \times {\mathbb Z}$. Let $S$ |
| be the interval $$[-(pq-1)/2, (pq-1)/2]$$ of ${\mathbb Z}$. |
be the interval $$[-(pq-1)/2, (pq-1)/2]$$ of ${\mathbb Z}$. |
| By the Chinese remainder theorem, there exists a unique |
By the Chinese remainder theorem, there exists a unique |
| bijection $f: S\to R$ such that, for any $s\in S$, if we |
bijection $f: S\to R$ such that, for any $s\in S$, if we |
| write $f(s)=(x,y)$, then |
write $f(s)=(x,y)$, then |
| $ x\equiv s \pmod p $ and |
$ x\equiv s \pmod p $ and |
| $ y\equiv s \pmod q$. |
$ y\equiv s \pmod q$. |
| Let $P$ be the subset of $R$ consisting of the values of $f$ on |
Let $P$ be the subset of $R$ consisting of the values of $f$ on |
| $[1, (pq-1)/2 ]$. $P$ contains, say, $u$ elements of the form |
$[1, (pq-1)/2 ]$. $P$ contains, say, $u$ elements of the form |
| $(x,0)$ such that $x<0$, and $v$ elements of the form |
$(x,0)$ such that $x<0$, and $v$ elements of the form |
| $(0,y)$ with $y<0$. Intending to apply Gauss's lemma, |
$(0,y)$ with $y<0$. Intending to apply Gauss's lemma, |
| we seek some kind of comparison between $u$ and $v$. |
we seek some kind of comparison between $u$ and $v$. |
| We define three subsets of $P$ by |
We define three subsets of $P$ by |
| \begin{eqnarray*} |
\begin{eqnarray*} |
| R_{0} & = & \{(x,y) \in P | x > 0, y > 0 \} \\ |
R_{0} & = & \{(x,y) \in P | x > 0, y > 0 \} \\ |
| R_{1} & = & \{(x,y) \in P | x < 0, y \ge 0 \} \\ |
R_{1} & = & \{(x,y) \in P | x < 0, y \ge 0 \} \\ |
| R_{2} & = & \{(x,y) \in P | x \ge 0, y < 0 \} |
R_{2} & = & \{(x,y) \in P | x \ge 0, y < 0 \} |
| \end{eqnarray*} |
\end{eqnarray*} |
| and we let $N_{i}$ be the cardinal of $R_{i}$ for each $i$. |
and we let $N_{i}$ be the cardinal of $R_{i}$ for each $i$. |
| $P$ has $ab+a$ elements in the region $y>0$, namely $f(m)$ for all |
$P$ has $ab+a$ elements in the region $y>0$, namely $f(m)$ for all |
| $m$ of the form $k+lp$ with $1 \le k \le a$ and |
$m$ of the form $k+lp$ with $1 \le k \le a$ and |
| $0 \le l \le b$. Thus |
$0 \le l \le b$. Thus |
| \[ N_{0}+N_{1} = ab + b - (b-v) + u \] |
\[ N_{0}+N_{1} = ab + b - (b-v) + u \] |
| i.e. |
i.e. |
| \begin{eqnarray} |
\begin{eqnarray} |
| N_{0}+N_{1} & = & ab+u+v. |
N_{0}+N_{1} & = & ab+u+v. |
| \end{eqnarray} |
\end{eqnarray} |
| In the same way, |
In the same way, |
| \begin{eqnarray} |
\begin{eqnarray} |
| N_{0}+N_{2} & = & ab+u+v. |
N_{0}+N_{2} & = & ab+u+v. |
| \end{eqnarray} |
\end{eqnarray} |
| Furthermore, for any $s \in S$, if $f(s)=(x,y)$ then $f(-s)=(-x,-y)$. |
Furthermore, for any $s \in S$, if $f(s)=(x,y)$ then $f(-s)=(-x,-y)$. |
| It follows that for any $(x,y) \in R$ |
It follows that for any $(x,y) \in R$ |
| other than $(0,0)$, either $(x,y)$ or $(-x,-y)$ is |
other than $(0,0)$, either $(x,y)$ or $(-x,-y)$ is |
| in $P$, but not both. Therefore |
in $P$, but not both. Therefore |
| \begin{eqnarray} |
\begin{eqnarray} |
| N_{1}+N_{2} & = & ab+u+v. |
N_{1}+N_{2} & = & ab+u+v. |
| \end{eqnarray} |
\end{eqnarray} |
| Adding (1), (2), and (3) gives us |
Adding (1), (2), and (3) gives us |
| \[ 0 \equiv ab + u + v \pmod 2 \] |
\[ 0 \equiv ab + u + v \pmod 2 \] |
| \[ (-1)^{ab}=(-1)^{u}(-1)^{v} \] |
\[ (-1)^{ab}=(-1)^{u}(-1)^{v} \] |
| which, in view of Gauss's lemma, is the desired conclusion. |
which, in view of Gauss's lemma, is the desired conclusion. |
| For a bibliography of the more than 200 known proofs of |
\end{proof} |
| the QRL, see |
According to Franz Lemmermeyer's webliography |
| \textbf{www.rzuser.uni-heidelberg.de/\~{}hb3/fchrono.html} |
\noindent |
|
www.rzuser.uni-heidelberg.de/\~{}hb3/fchrono.html, |
|
\noindent |
|
the above is the world's 202nd proof of the quadratic |
|
reciprocity law. |
