Jump to content

User:Virginia-American/Sandbox/Eisenstein reciprocity

From Wikipedia, the free encyclopedia

Eisenstein's reciprocity law is a theorem in algebraic number theory first proven by Gotthold Eisenstein in 1850.[1]

Reciprocity laws are a collection of theorems in number theory. The name "reciprocity" (coined by Legendre) refers to the fact that they state conditions under whcich the congruence xnp (mod q) has a solution in terms of the solvability of xnq (mod p). Ireland and Rosen[2] say

The Eisenstein reciprocity law generalizes some of our previous work on quadratic and cubic reciprocity. It lies midway between these special cases and the more general reciprocity laws investigated by Kummer and Hilbert, proven first by Furtwängler and then in full generality by Artin and Hasse.

Lemmermeyer[3] begins the chapter on Eisenstein reciprocity

In order to prove higher reciprocity laws, the methods known to Gauss were soon found to be inadequate. The most obvious obstacle, namely the fact that the unique factorization theorem fails to hold for the rings was overcome by Kummer through the invention of his ideal numbers. The direct generalization of the proofs for cubic and quartic reciprocity, however, did not yield the general reciprocity theorem for -th powers; indeed, the most general reciprocity law that could be proved within the cyclotomic framework is Eisenstein's reciprocity law. ...

Although Eisenstein's reciprocity law is only a very special case of more general reciprocity laws, it turned out to be an indispensable step for proving these general laws until Furtwängler succeeded in finally giving a proof of the reciprocity law in without the help of Eisenstein's reciprocity law. It should be also noted that Eisenstein's reciprocity law holds for all primes , whereas Kummer had to assume that is regular, i.e. that does not divide the class number of

Background and notation[edit]

Let   be an integer, and let     be the ring of integers of the m-th cyclotomic field     where    is a primitive m-th root of unity.

Primary numbers[edit]

A number is called primary[4][5] if it is not a unit, is relatively prime to , and is congruent to a rational (i.e. in ) integer

m-th power residue symbol[edit]

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

It is the m-th power version of the classical (quadratic, m = 2) Jacobi symbol:

Statement of the theorem[edit]

Let     be an odd prime and     an integer relatively prime to     Then

First supplement[edit]

  [6]

Second supplement[edit]

  [7]

Eisenstein reciprocity[edit]

Let   be primary (and therefore relatively prime to   ), and assume that    is also relatively prime to    Then

  [8][9]

Proof[edit]

The theorem is a consequence of the Stickelberger relation.[10][11]

Generalization[edit]

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

Applications[edit]

First case of Fermat's last theorem[edit]

Eisenstein reciprocity is used in some proofs of Wieferich's, Mirimanoff's and Furtwängler's theorems.[13] These four exercises are from Lemmermeyer:


I.[14] (Furtwängler 1912) Let be an odd prime, and assume that for pairwise relatively prime integers with Use the unique factorization theorrem for prime ideals to deduce that for ideals . Show that is semi-primary. Now use Eisenstein's reciprocity law to deduce that for each prime and deduce that


II.[15] (Wieferich 1909) Suppose for some odd prime then (Hint: Use the preceding exercise)

Remark. Primes satisfying are called Wieferich primes. The only Wieferich primes below 4×1012 are 1093 and 3511.


III.[16] (Furtwängler 1912) Let be an odd prime, and assume that for pairwise relatively prime integers with Assume moreover that Then for every prime


IV.[17] (Mirimanoff 1911) Suppose is prime, and Then

Powers mod most primes[edit]

Eisenstein's law can be used to prove[18]

Theorem (Trost, Ankeny, Rogers). Suppose and that where is an odd prime. If is solvable for all but finitely many primes then

See also[edit]

Notes[edit]

  1. ^ Lemmermeyer, ch. 11, notes
  2. ^ Ireland and Rosen, ch.14, intro
  3. ^ Lemmermeyer, ch. 11, intro
  4. ^ Ireland & Rosen, ch. 14.2
  5. ^ Lemmermeyer uses the term semi-primary.
  6. ^ Lemmermeyer, thm. 11.9
  7. ^ Lemmermeyer, thm. 11.9
  8. ^ Ireland & Rosen, ch. 14 thm. 1
  9. ^ Lemmermeyer, thm. 11.9
  10. ^ Ireland & Rosen, ch. 14.5
  11. ^ Lemmermeyer, ch. 11.2
  12. ^ Lemmermeyer, ch. 11 notes
  13. ^ Ireland & Rosen, ch. 14.6
  14. ^ Lemmermeyer, ex. 11.32
  15. ^ Lemmermeyer, ex. 11.33
  16. ^ Lemmermeyer, ex. 11.36
  17. ^ Lemmermeyer, ex. 11.37
  18. ^ Ireland & Rosen, ch. 14.6, thm. 4


References[edit]

  • 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