|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In [[number theory]], the law of [[quadratic reciprocity]], like the [[Pythagorean theorem]], has lent itself to an unusual number of [[mathematical proof|proofs]]. Several hundred '''proofs of the law of quadratic reciprocity''' have been found.
| | I would like to introduce myself to you, I am Andrew and my wife doesn't like it at all. Office supervising [http://www.article-galaxy.com/profile.php?a=143251 online psychics] is where her primary income comes from but she's currently utilized for another one. The preferred pastime for him and his children is to play lacross and he'll be starting something else alongside with it. North Carolina is exactly where we've been residing for many years and will never transfer.<br><br>Review my best psychic readings ([http://appin.co.kr/board_Zqtv22/688025 appin.co.kr]) weblog ... best psychics; [http://www.prograd.uff.br/novo/facts-about-growing-greater-organic-garden please click the up coming article], |
| | |
| ==Proofs that are accessible==
| |
| | |
| Of relatively elementary, combinatorial proofs, there are two which apply types of [[double counting (proof technique)|double counting]]. One by [[Gotthold Eisenstein]] counts [[lattice point]]s. Another applies [[Zolotarev's lemma]] to ''Z''/''pqZ'' expressed by the [[Chinese remainder theorem]] as ''Z''/''pZ''×''Z''/''qZ'', and calculates the [[signature of a permutation]].
| |
| | |
| == 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 distinct odd primes ''p'', ''q'',
| |
| : <math>\left(\frac qp\right) = (-1)^{\sum_u \left \lfloor qu/p \right \rfloor},</math>
| |
| where <math>\left \lfloor x \right \rfloor</math> 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,
| |
| : <math>\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.</math>
| |
| This result is very similar to [[Gauss's lemma (number theory)|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 <math>\Sigma_u \left \lfloor qu/p \right \rfloor</math> counts the number of lattice points with even ''x''-coordinate in the interior of the triangle ABC in the following diagram:
| |
| | |
| {|
| |
| | [[File:Eisenstein-quadratic-reciprocity-1.svg|300px|none|thumb|Lattice point diagram]]
| |
| || [[File:Eisenstein-quadratic-reciprocity-2.svg|300px|none|thumb|Example showing lattice points inside ABC with even ''x''-coordinates, for ''p'' = 11 and ''q'' = 7]]
| |
| |}
| |
| | |
| 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:
| |
| | |
| [[File:Eisenstein-quadratic-reciprocity-3.svg|300px|thumb|none|The number of points with even ''x''-coordinate inside BCYX (marked by O's) is equal modulo 2 to the number of such points in CZY (marked by X's)]]
| |
| | |
| 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:
| |
| | |
| [[File:Eisenstein-quadratic-reciprocity-4.svg|300px|thumb|none|The number of points with even ''x''-coordinate inside CZY is equal to the number of points with ''odd'' ''x''-coordinate inside AXY]]
| |
| | |
| The conclusion is that
| |
| : <math>\left(\frac qp\right) = (-1)^\mu,</math>
| |
| where μ is the ''total'' number of lattice points in the interior of AYX. Switching ''p'' and ''q'', the same argument shows that
| |
| : <math>\left(\frac pq\right) = (-1)^\nu,</math>
| |
| 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
| |
| : <math>\left(\frac{p-1}2\right) \left(\frac{q-1}2\right),</math>
| |
| we obtain finally
| |
| : <math>\left(\frac qp\right) \left(\frac pq\right) = (-1)^{\mu + \nu} = (-1)^{(p-1)(q-1)/4}.</math>
| |
| | |
| === 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 ''qu'' modulo ''p''. (For example, for ''p'' = 11, ''q'' = 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)<sup>''r''(''u'')</sup>''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)<sup>''r''(''u'')</sup>''r''(''u'') ≡ (−1)<sup>''r''(''t'')</sup>''r''(''t'') mod ''p'', then we may divide out by ''q'' 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 exactly (''p''−1)/2 of them and they are distinct, they must be simply a rearrangement of the even integers 2, 4, ..., ''p''−1. Multiplying them together, we obtain
| |
| : <math>(-1)^{r(2)}2q \cdot (-1)^{r(4)}4q \cdot \cdots \cdot (-1)^{r(p-1)}(p-1)q \equiv 2 \cdot 4 \cdot \cdots \cdot (p-1)\text{ (mod }p).</math>
| |
| 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
| |
| : <math>q^{(p-1)/2} \equiv (-1)^{r(2) + r(4) + \cdots + r(p-1)}\text{ (mod }p).</math>
| |
| On the other hand, by the definition of ''r''(''u'') and the floor function,
| |
| : <math>\frac{qu}p = \left \lfloor \frac{qu}p\right \rfloor + \frac{r(u)}p,</math>
| |
| and so since ''p'' is odd and ''u'' is even, we see that <math>\left \lfloor qu/p \right \rfloor</math> and ''r''(''u'') are congruent modulo 2. Finally this shows that
| |
| : <math>q^{(p-1)/2} \equiv (-1)^{\sum_u \left \lfloor qu/p \right \rfloor} \text{ (mod }p).</math>
| |
| We are finished because the left hand side is just an [[Euler's criterion|alternative expression for (''q''/''p'')]].
| |
| | |
| == 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]]
| |
| :<math>L = \mathbf Q(\zeta_p),</math>
| |
| where ζ<sub>p</sub> is a primitive ''p''<sup>th</sup> [[root of unity]]. The basic theory of cyclotomic fields informs us that there is a canonical isomorphism | |
| :<math>G = \operatorname{Gal}(L/\mathbf Q) \cong (\Z/p\Z)^\times,</math>
| |
| which sends the automorphism σ<sub>''a''</sub> satisfying
| |
| :<math>\sigma_a(\zeta_p) = \zeta_p^a</math>
| |
| to the element
| |
| :<math>a \in (\Z/p\Z)^\times.</math>
| |
| | |
| (This is because the morphism of reduction from ''Z'' to ''Z/qZ'' is injective on the set of p-th roots of unity)
| |
| | |
| Now consider the subgroup ''H'' of ''squares'' of elements of ''G''. Since ''G'' is cyclic, ''H'' has [[Index of a subgroup|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
| |
| :<math>\mathbf Q(\sqrt{p^*}),</math>
| |
| where
| |
| :<math>p^* = \begin{cases} p & \mbox{if } p = 1 \text{ (mod }4), \\ -p & \mbox{if } p = 3 \text{ (mod }4). \end{cases}</math>
| |
| | |
| At this point we start to see a hint of quadratic reciprocity emerging from our framework. On one hand, the image of ''H'' in
| |
| :<math>(\mathbf Z/p\mathbf Z)^\times</math>
| |
| consists precisely of the (nonzero) ''quadratic residues modulo p''. On the other hand, ''H'' is related to an attempt to take the ''square root of p'' (or possibly of −''p''). In other words, if now ''q'' is an odd prime (different from ''p''), we have so far shown that
| |
| :<math>\left(\frac qp\right) =1 \quad \iff \quad \sigma_q \in H \quad \iff \quad \sigma_q \mbox{ fixes } \mathbf Q(\sqrt{p^*}).</math>
| |
| | |
| === The Frobenius automorphism ===
| |
| | |
| Choose any prime ideal β of the ring of integers ''O''<sub>''L''</sub> lying over ''q'', which is unramified, and let
| |
| :<math>\phi \in \operatorname{Gal}(L/\mathbf Q)</math>
| |
| be the [[Frobenius automorphism]] associated to β; the characteristic property of <math>\phi</math> is that
| |
| :<math>\phi(x) \equiv x^q \text{ (mod }\beta) \,\!</math>
| |
| for any ''x'' in ''O''<sub>''L''</sub>. (The existence of such a Frobenius element depends on quite a bit of algebraic number theory machinery.) | |
| | |
| The key fact about <math>\phi</math> that we need is that for any subfield ''K'' of ''L'',
| |
| :<math>\phi \mbox{ fixes } K \quad \iff \quad q \mbox{ splits completely in } K.</math>
| |
| Indeed, let δ be any ideal of ''O''<sub>''K''</sub> below β (and hence above ''q''). Then, since
| |
| :<math>\phi(x) \equiv x^q \text{ (mod }\delta) \,\!</math>
| |
| for any ''x'' in ''O''<sub>''K''</sub>, we see that
| |
| :<math>\phi\vert_K \in \operatorname{Gal}(K/\mathbf Q)</math>
| |
| is a Frobenius for δ. A standard result concerning <math>\phi</math> is that its order is equal to the corresponding inertial degree; that is,
| |
| :<math>\operatorname{ord}(\phi\vert_K) = [O_K/\delta O_K : \mathbf Z/q\mathbf Z].</math>
| |
| The left hand side is equal to 1 if and only if φ fixes ''K'', and the right hand side is equal to one if and only ''q'' splits completely in ''K'', so we are done.
| |
| | |
| Now, since the ''p''<sup>th</sub> roots of unity are distinct modulo β (i.e. the polynomial ''X''<sup>p</sup> − 1 is separable in characteristic ''q''), we must have
| |
| :<math>\phi(\zeta_p) = \zeta_p^q;</math>
| |
| that is, <math>\phi</math> coincides with the automorphism σ<sub>''q''</sub> defined earlier. Taking ''K'' to be the quadratic field in which we are interested, we obtain the equivalence
| |
| :<math>\left(\frac qp\right) =1 \quad \iff \quad q \mbox{ splits completely in } \mathbf Q(\sqrt{p^*}).</math>
| |
| | |
| === Completing the proof ===
| |
| | |
| Finally we must show that
| |
| :<math>q \mbox{ splits completely in } \mathbf Q(\sqrt{p^*}) \quad \iff \quad \left(\frac{p^*}q\right) = 1.</math>
| |
| Once we have done this, the law of quadratic reciprocity falls out immediately since
| |
| :<math>\left(\frac{p^*}q\right) = \left(\frac pq\right)</math>
| |
| if ''p'' = 1 mod 4, and
| |
| :<math>\left(\frac{p^*}q\right) = \left(\frac{-p}q\right) = \left(\frac{-1}q\right)\left(\frac pq\right) = \begin{cases} +\left(\frac pq \right) & \mbox{if } q = 1 \text{ (mod }4), \\ -\left(\frac pq\right) & \mbox{if } q = 3 \text{ (mod }4)\end{cases}</math>
| |
| if ''p'' = 3 mod 4.
| |
| | |
| To show the last equivalence, suppose first that
| |
| :<math>\left(\frac{p^*}q\right) = 1.</math>
| |
| In this case, there is some integer ''x'' (not divisible by ''q'') such that
| |
| :<math> x^2 \equiv p^* \text{ (mod }q), \,\!</math>
| |
| say
| |
| :<math> x^2 - p^* = cq \,\!</math>
| |
| for some integer ''c''. Let
| |
| :<math>K = \mathbf Q(\sqrt{p^*}),</math>
| |
| and consider the ideal
| |
| :<math>(x-\sqrt{p^*},q)</math>
| |
| of ''K''. It certainly divides the principal ideal (''q''). It cannot be equal to (''q''), since
| |
| :<math>x-\sqrt{p^*}</math>
| |
| is not divisible by ''q''. It cannot be the unit ideal, because then
| |
| :<math>(x+\sqrt{p^*}) = (x+\sqrt{p^*})(x-\sqrt{p^*},q) = (cq, q(x+\sqrt{p^*}))</math>
| |
| is divisible by ''q'', which is again impossible. Therefore (''q'') must split in ''K''.
| |
| | |
| Conversely, suppose that (''q'') splits, and let β be a prime of ''K'' above ''q''. Then
| |
| :<math>(q) \subsetneq \beta,</math>
| |
| so we may choose some
| |
| :<math>a+b\sqrt{p^*} \in \beta\setminus(q),</math>
| |
| where ''a'' and ''b'' are in '''Q'''. Actually, since | |
| :<math>p^* = 1 \text{ (mod }4),</math>
| |
| elementary theory of quadratic fields implies that the ring of integers of ''K'' is precisely
| |
| :<math>\mathbf Z\left[\frac{1+\sqrt{p^*}}2\right],</math>
| |
| so the denominators of ''a'' and ''b'' are at worst equal to 2. Since ''q'' ≠ 2, we may safely multiply ''a'' and ''b'' by 2, and assume that
| |
| :<math>a+b\sqrt{p^*} \in \beta\setminus(q),</math>
| |
| where now ''a'' and ''b'' are in '''Z'''. In this case we have
| |
| :<math>(a+b\sqrt{p^*})(a-b\sqrt{p^*}) = a^2 - b^2p^* \in \beta \cap \mathbf Z = (q),</math>
| |
| so
| |
| :<math>q \mid a^2 - b^2p^*.\,\!</math>
| |
| However, ''q'' cannot divide ''b'', since then also ''q'' divides ''a'', which contradicts our choice of
| |
| :<math>a+b\sqrt{p^*}.</math>
| |
| Therefore, we may divide by ''b'' modulo ''q'', to obtain
| |
| :<math>p^* = (ab^{-1})^2 \text{ (mod }q)\,\!</math>
| |
| as desired.
| |
| | |
| == References ==
| |
| | |
| Every textbook on [[Number theory#Elementary number theory|elementary number theory]] (and quite a few on [[algebraic number theory]]) has a proof of quadratic reciprocity. Two are especially noteworthy:
| |
| | |
| Franz Lemmermeyer's ''Reciprocity Laws: From Euler to Eisenstein'' has many proofs (some in exercises) of both quadratic and higher-power reciprocity laws and a discussion of their history. Its immense bibliography includes literature citations for 196 different published proofs.
| |
| | |
| Kenneth Ireland and Michael Rosen's ''A Classical Introduction to Modern Number Theory'' also has many proofs of quadratic reciprocity (and many exercises), and covers the cubic and biquadratic cases as well. Exercise 13.26 (p 202) says it all
| |
| :<blockquote>'''Count the number of proofs to the law of quadratic reciprocity given thus far in this book and devise another one.'''</blockquote>
| |
| | |
| *{{citation
| |
| | last1 = Lemmermeyer | first1 = Franz
| |
| | title = Reciprocity Laws: from Euler to Eisenstein
| |
| | publisher = [[Springer Science+Business Media|Springer]]
| |
| | location = Berlin
| |
| | date = 2000
| |
| | isbn = 3-540-66957-4}}
| |
| | |
| *{{citation
| |
| | last1 = Ireland | first1 = Kenneth
| |
| | last2 = Rosen | first2 = Michael
| |
| | title = A Classical Introduction to Modern Number Theory (second edition)
| |
| | publisher = [[Springer Science+Business Media|Springer]]
| |
| | location = New York
| |
| | date = 1990
| |
| | isbn = 0-387-97329-X}}
| |
| | |
| * G. Rousseau. "On the Quadratic Reciprocity Law", ''J. Austral. Math. Soc. (Series A)'', v51, 1991, 423–425. ([http://anziamj.austms.org.au/JAMSA/V51/Part3/Rousseau.html online])
| |
| | |
| * L. Washington. ''Introduction to Cyclotomic Fields'', 2nd ed.
| |
| | |
| ==External links==
| |
| | |
| * [http://www.rzuser.uni-heidelberg.de/~hb3/fchrono.html Chronology of Proofs of the Quadratic Reciprocity Law] (233 proofs!)
| |
| | |
| {{DEFAULTSORT:Quadratic reciprocity, Proofs of}}
| |
| [[Category:Algebraic number theory]]
| |
| [[Category:Article proofs]]
| |