Eisenstein reciprocity

From The Right Wiki
Jump to navigationJump to search

In algebraic number theory Eisenstein's reciprocity law is a reciprocity law that extends the law of quadratic reciprocity and the cubic reciprocity law to residues of higher powers. It is one of the earliest and simplest of the higher reciprocity laws, and is a consequence of several later and stronger reciprocity laws such as the Artin reciprocity law. It was introduced by Eisenstein (1850), though Jacobi had previously announced (without proof) a similar result for the special cases of 5th, 8th and 12th powers in 1839.[1]

Background and notation

Let  m>1 be an integer, and let   𝒪m  be the ring of integers of the m-th cyclotomic field   (ζm),  where  ζm=e2πi1m  is a primitive m-th root of unity. The numbers ζm,ζm2,ζmm=1 are units in 𝒪m. (There are other units as well.)

Primary numbers

A number α𝒪m is called primary[2][3] if it is not a unit, is relatively prime to m, and is congruent to a rational (i.e. in ) integer (mod(1ζm)2). The following lemma[4][5] shows that primary numbers in 𝒪m are analogous to positive integers in . Suppose that α,β𝒪m and that both α and β are relatively prime to m. Then

  • There is an integer c making ζmcα primary. This integer is unique (modm).
  • if α and β are primary then α±β is primary, provided that α±β is coprime with m.
  • if α and β are primary then αβ is primary.
  • αm is primary.

The significance of   1ζm  which appears in the definition is most easily seen when   m=l   is a prime.  In that case   l=(1ζl)(1ζl2)(1ζll1).   Furthermore, the prime ideal   (l)   of     is totally ramified in  (ζl)

(l)=(1ζl)l1,

  and the ideal   (1ζl)   is prime of degree 1.[6][7]

m-th power residue symbol

For α,β𝒪m, the m-th power residue symbol for 𝒪m is either zero or an m-th root of unity:

(αβ)m={ζ where ζm=1 if α and β are relatively prime0 otherwise.

It is the m-th power version of the classical (quadratic, m = 2) Jacobi symbol (assuming α and β are relatively prime):

  • If η𝒪m and αηm(modβ) then (αβ)m=1.
  • If (αβ)m1 then α is not an m-th power (modβ).
  • If (αβ)m=1 then α may or may not be an m-th power (modβ).

Statement of the theorem

Let   m   be an odd prime and   a   an integer relatively prime to  m.   Then

First supplement

(ζma)m=ζmam11m.  [8]

Second supplement

(1ζma)m=(ζma)mm+12.  [8]

Eisenstein reciprocity

Let  α𝒪m be primary (and therefore relatively prime to   m), and assume that  α  is also relatively prime to  a. Then[8][9]

(αa)m=(aα)m.

Proof

The theorem is a consequence of the Stickelberger relation.[10][11] Weil (1975) gives a historical discussion of some early reciprocity laws, including a proof of Eisenstein's law using Gauss and Jacobi sums that is based on Eisenstein's original proof.

Generalization

In 1922 Takagi proved that if K(ζl)  is an arbitrary algebraic number field containing the l-th roots of unity for a prime l, then Eisenstein's law for l-th powers holds in K.[12]

Applications

First case of Fermat's Last Theorem

Assume that p is an odd prime, that xp+yp+zp=0   for pairwise relatively prime integers (i.e. in )   x,y,z and that pxyz. This is the first case of Fermat's Last Theorem. (The second case is when pxyz.)   Eisenstein reciprocity can be used to prove the following theorems (Wieferich 1909)[13][14] Under the above assumptions,   2p11(modp2).

The only primes below 6.7×1015 that satisfy this are 1093 and 3511. See Wieferich primes for details and current records.

(Mirimanoff 1911)[15] Under the above assumptions   3p11(modp2).

Analogous results are true for all primes ≤ 113, but the proof does not use Eisenstein's law. See Wieferich prime#Connection with Fermat's Last Theorem.

(Furtwängler 1912)[16][17] Under the above assumptions, for every prime   rx,rp11(modp2). (Furtwängler 1912)[18] Under the above assumptions, for every prime   r(xy),rp11(modp2). (Vandiver)[19] Under the above assumptions, if in addition   p>3,   then   xpx,ypy   and   zpz(modp3).

Powers mod most primes

Eisenstein's law can be used to prove the following theorem (Trost, Ankeny, Rogers).[20]   Suppose   a   and that   la   where   l   is an odd prime. If   xla(modp)   is solvable for all but finitely many primes   p   then   a=bl.

See also

Notes

  1. Lemmermeyer, p. 392.
  2. Ireland & Rosen, ch. 14.2
  3. Lemmermeyer, ch. 11.2, uses the term semi-primary.
  4. Ireland & Rosen, lemma in ch. 14.2 (first assertion only)
  5. Lemmereyer, lemma 11.6
  6. Ireland & Rosen, prop 13.2.7
  7. Lemmermeyer, prop. 3.1
  8. 8.0 8.1 8.2 Lemmermeyer, thm. 11.9
  9. Ireland & Rosen, ch. 14 thm. 1
  10. Ireland & Rosen, ch. 14.5
  11. Lemmermeyer, ch. 11.2
  12. Lemmermeyer, ch. 11 notes
  13. Lemmermeyer, ex. 11.33
  14. Ireland & Rosen, th. 14.5
  15. Lemmermeyer, ex. 11.37
  16. Lemmermeyer, ex. 11.32
  17. Ireland & Rosen, th. 14.6
  18. Lemmermeyer, ex. 11.36
  19. Ireland & Rosen, notes to ch. 14
  20. Ireland & Rosen, ch. 14.6, thm. 4. This is part of a more general theorem: Assume xna(modp) for all but finitely many primes p. Then i) if 8n then a=bn but ii) if 8|n then a=bn or a=2n2bn.

References

  • Eisenstein, Gotthold (1850), "Beweis der allgemeinsten Reciprocitätsgesetze zwischen reellen und komplexen Zahlen", Verhandlungen der Königlich Preußische Akademie der Wissenschaften zu Berlin (in German): 189–198, Reprinted in Mathematische Werke, volume 2, pages 712–721{{citation}}: CS1 maint: unrecognized language (link)
  • Ireland, Kenneth; Rosen, Michael (1990), A Classical Introduction to Modern Number Theory (Second edition), New York: Springer Science+Business Media, ISBN 0-387-97329-X
  • Lemmermeyer, Franz (2000), Reciprocity Laws: from Euler to Eisenstein, Berlin: Springer Science+Business Media, ISBN 3-540-66957-4
  • Weil, André (1975), "La cyclotomie jadis et naguère", Séminaire Bourbaki, Vol. 1973/1974, 26ème année, Exp. No. 452, Lecture Notes in Math, vol. 431, Berlin, New York: Springer-Verlag, pp. 318–338, MR 0432517