Cubic reciprocity

History

Sometime before 1748 Euler made the first conjectures about the cubic residuacity of small integers, but they were not published until 1849, after his death.

Gauss's published works mention cubic residues and reciprocity three times: there is one result pertaining to cubic residues in the Disquisitiones Arithmeticae (1801). In the introduction to the fifth and sixth proofs of quadratic reciprocity (1818) he said that he was publishing these proofs because their techniques (Gauss's lemma and Gaussian sums, respectively) can be applied to cubic and biquadratic reciprocity. Finally, a footnote in the second (of two) monographs on biquadratic reciprocity (1832) states that cubic reciprocity is most easily described in the ring of Eisenstein integers.

From his diary and other unpublished sources, it appears that Gauss knew the rules for the cubic and quartic residuacity of integers by 1805, and discovered the full-blown theorems and proofs of cubic and biquadratic reciprocity around 1814. Proofs of these were found in his posthumous papers, but it is not clear if they are his or Eisenstein's.

Jacobi published several theorems about cubic residuacity in 1827, but no proofs. In his Königsberg lectures of 1836–37 Jacobi presented proofs. The first published proofs were by Eisenstein (1844).

Integers

A cubic residue (mod p) is any number congruent to the third power of an integer (mod p). If x³ ≡ a (mod p) does not have an integer solution, a is a cubic nonresidue (mod p).

As is often the case in number theory, it is easiest to work modulo prime numbers, so in this section all moduli p, q, etc., are assumed to be positive, odd primes.

We first note that if q ≡ 2 (mod 3) is a prime then every number is a cubic residue modulo q. Let q = 3n + 2; since 0 = 0³ is obviously a cubic residue, assume x is not divisible by q. Then by Fermat's little theorem,

x q ≡ x mod q , x q − 1 ≡ 1 mod q

Multiplying the two congruences we have

x 2 q − 1 ≡ x mod q

Now substituting 3n + 2 for q we have:

x 2 q − 1 = x 6 n + 3 = ( x 2 n + 1 ) 3 .

Therefore, the only interesting case is when the modulus p ≡ 1 (mod 3). In this case the non-zero residue classes (mod p) can be divided into three sets, each containing (p−1)/3 numbers. Let e be a cubic non-residue. The first set is the cubic residues; the second one is e times the numbers in the first set, and the third is e² times the numbers in the first set. Another way to describe this division is to let e be a primitive root (mod p); then the first (resp. second, third) set is the numbers whose indices with respect to this root are congruent to 0 (resp. 1, 2) (mod 3). In the vocabulary of group theory, the first set is a subgroup of index 3 of the multiplicative group ( Z / p Z ) × and the other two are its cosets.

Primes ≡ 1 (mod 3)

A theorem of Fermat states that every prime p ≡ 1 (mod 3) can be written as p = a² + 3b² and (except for the signs of a and b) this representation is unique.

Letting m = a + b and n = a − b, we see that this is equivalent to p = m² − mn + n² (which equals (n − m)² − (n − m)n + n² = m² + m(n − m) + (n − m)², so m and n are not determined uniquely). Thus,

4 p = ( 2 m − n ) 2 + 3 n 2 = ( 2 n − m ) 2 + 3 m 2 = ( m + n ) 2 + 3 ( m − n ) 2

and it is a straightforward exercise to show that exactly one of m, n, or m − n is a multiple of 3, so

p = 1 4 ( L 2 + 27 M 2 ) ,

and this representation is unique up to the signs of L and M.

For relatively prime integers m and n define the rational cubic residue symbol as

[ m n ] 3 = { 1 m  is a cubic residue  mod n − 1 m  is a cubic non-residue  mod n

It is important to note that this symbol does not have the multiplicative properties of the Legendre symbol; for this, we need the true cubic character defined below.

Euler's Conjectures. Let p = a² + 3b² be a prime. Then the following hold: [ 2 p ] 3 = 1 ⟺ 3 | b [ 3 p ] 3 = 1 ⟺ 9 | b  or  9 | ( a ± b ) [ 5 p ] 3 = 1 ⟺ 15 | b  or  3 | b  and  5 | a  or  15 | ( a ± b )  or  15 | ( 2 a ± b ) [ 6 p ] 3 = 1 ⟺ 9 | b  or  9 | ( a ± 2 b ) [ 7 p ] 3 = 1 ⟹ ( 3 | b  and  7 | a )  or  21 | ( b ± a )  or  7 | ( 4 b ± a )  or  21 | b  or  7 | ( b ± 2 a )

The first two can be restated as follows. Let p be a prime that is congruent to 1 modulo 3. Then:

2 is a cubic residue of p if and only if p = a² + 27b².

3 is a cubic residue of p if and only if 4p = a² + 243b².

Gauss's Theorem. Let p be a positive prime such that p = 3 n + 1 = 1 4 ( L 2 + 27 M 2 ) . Then L ( n ! ) 3 ≡ 1 mod p .

One can easily see that Gauss's Theorem implies:

[ L p ] 3 = [ M p ] 3 = 1. Jacobi's Theorem (Stated without Proof). Let q ≡ p ≡ 1 (mod 6) be positive primes. Obviously both p and q are also congruent to 1 modulo 3, therefore assume: p = 1 4 ( L 2 + 27 M 2 ) , q = 1 4 ( L ′ 2 + 27 M ′ 2 ) . Let x be a solution of x² ≡ −3 (mod q). Then x ≡ ± L ′ 3 M ′ mod q , and we have: Lehmer's Theorem. Let q and p be primes, with p = 1 4 ( L 2 + 27 M 2 ) . Then: [ q p ] 3 = 1 ⇔ q | L M  or  L ≡ ± 9 r 2 u + 1 M mod q , where

Note that the first condition implies: that any number that divides L or M is a cubic residue (mod p).

The first few examples of this are equivalent to Euler's conjectures:

[ 2 p ] 3 = 1 ⇔ L ≡ M ≡ 0 mod 2 [ 3 p ] 3 = 1 ⇔ M ≡ 0 mod 3 [ 5 p ] 3 = 1 ⇔ L M ≡ 0 mod 5 [ 7 p ] 3 = 1 ⇔ L M ≡ 0 mod 7

Since obviously L ≡ M (mod 2), the criterion for q = 2 can be simplified as:

[ 2 p ] 3 = 1 ⇔ M ≡ 0 mod 2 . Martinet's Theorem. Let p ≡ q ≡ 1 (mod 3) be primes, p q = 1 4 ( L 2 + 27 M 2 ) . Then [ L p ] 3 [ L q ] 3 = 1 ⇔ [ q p ] 3 [ p q ] 3 = 1. Sharifi's Theorem. Let p = 1 + 3x + 9x² be a prime. Then any divisor of x is a cubic residue (mod p).

Background

In his second monograph on biquadratic reciprocity, Gauss says:

The theorems on biquadratic residues gleam with the greatest simplicity and genuine beauty only when the field of arithmetic is extended to imaginary numbers, so that without restriction, the numbers of the form a + bi constitute the object of study ... we call such numbers integral complex numbers. [bold in the original]

These numbers are now called the ring of Gaussian integers, denoted by Z[i]. Note that i is a fourth root of 1.

In a footnote he adds

The theory of cubic residues must be based in a similar way on a consideration of numbers of the form a + bh where h is an imaginary root of the equation h³ = 1 ... and similarly the theory of residues of higher powers leads to the introduction of other imaginary quantities.

In his first monograph on cubic reciprocity Eisenstein developed the theory of the numbers built up from a cube root of unity; they are now called the ring of Eisenstein integers. Eisenstein said (paraphrasing) "to investigate the properties of this ring one need only consult Gauss's work on Z[i] and modify the proofs". This is not surprising since both rings are unique factorization domains.

The "other imaginary quantities" needed for the "theory of residues of higher powers" are the rings of integers of the cyclotomic number fields; the Gaussian and Eisenstein integers are the simplest examples of these.

Facts and terminology

Let

ω = − 1 + i 3 2 = e 2 π i 3 , ω 3 = 1.

And consider the ring of Eisenstein integers:

Z [ ω ] = { a + b ω   :   a , b ∈ Z } .

This is a Euclidean domain with the norm function given by:

N ( a + b ω ) = a 2 − a b + b 2 .

Note that the norm is always congruent to 0 or 1 (mod 3).

The group of units in Z [ ω ] (the elements with a multiplicative inverse or equivalently those with unit norm) is a cyclic group of the sixth roots of unity,

{ ± 1 , ± ω , ± ω 2 } .

Z [ ω ] is a unique factorization domain. The primes fall into three classes:

3 is a special case:

It is the only prime in Z divisible by the square of a prime in Z [ ω ] . The prime 3 is said to ramify in Z [ ω ] .

Positive primes in Z congruent to 2 (mod 3) are also primes in Z [ ω ] . These primes are said to remain inert in Z [ ω ] . Note that if q is any inert prime then:

Positive primes in Z congruent to 1 (mod 3) are the product of two conjugate primes in Z [ ω ] . These primes are said to split in Z [ ω ] . Their factorization is given by:

for example

A number is primary if it is coprime to 3 and congruent to an ordinary integer modulo ( 1 − ω ) 2 , which is the same as saying it is congruent to ± 2 modulo 3. If gcd ( N ( λ ) , 3 ) = 1 one of λ , ω λ , or ω 2 λ is primary. Moreover the product of two primary numbers is primary and the conjugate of a primary number is also primary.

The unique factorization theorem for Z [ ω ] is: if λ ≠ 0 , then

λ = ± ω μ ( 1 − ω ) ν π 1 α 1 π 2 α 2 π 3 α 3 ⋯ , μ ∈ { 0 , 1 , 2 } , ν , α 1 , α 2 , ⋯ ⩾ 0

where each π i is a primary (under Eisenstein's definition) prime. And this representation is unique, up to the order of the factors.

The notions of congruence and greatest common divisor are defined the same way in Z [ ω ] as they are for the ordinary integers Z . Because the units divide all numbers, a congruence modulo λ is also true modulo any associate of λ , and any associate of a GCD is also a GCD.

Definition

An analogue of Fermat's little theorem is true in Z [ ω ] : if α is not divisible by a prime π ,

α N ( π ) − 1 ≡ 1 mod π .

Now assume that N ( π ) ≠ 3 so that N ( π ) ≡ 1 mod 3 . Or put differently 3 | N ( π ) − 1. Then we can write:

α N ( π ) − 1 3 ≡ ω k mod π ,

for a unique unit ω k . This unit is called the cubic residue character of α modulo π and is denoted by

( α π ) 3 = ω k ≡ α N ( π ) − 1 3 mod π .

Properties

The cubic residue character has formal properties similar to those of the Legendre symbol:

If α ≡ β mod π then ( α π ) 3 = ( β π ) 3 .

( α β π ) 3 = ( α π ) 3 ( β π ) 3 .

( α π ) 3 ¯ = ( α ¯ π ¯ ) 3 , where the bar denotes complex conjugation.

If π and θ are associates then ( α π ) 3 = ( α θ ) 3

The congruence x 3 ≡ α mod π has a solution in Z [ ω ] if and only if ( α π ) 3 = 1.

If a , b ∈ Z are such that gcd ( a , b ) = gcd ( b , 3 ) = 1 , then ( a b ) 3 = 1.

The cubic character can be extended multiplicatively to composite numbers (coprime to 3) in the "denominator" in the same way the Legendre symbol is generalized into the Jacobi symbol. Like the Jacobi symbol, if the "denominator" of the cubic character is composite, then if the "numerator" is a cubic residue mod the "denominator" the symbol will equal 1, if the symbol does not equal 1 then the "numerator" is a cubic non-residue, but the symbol can equal 1 when the "numerator" is a non-residue:

where

Statement of the theorem

Let α and β be primary. Then

( α β ) 3 = ( β α ) 3 .

There are supplementary theorems for the units and the prime 1 − ω:

Let α = a + bω be primary, a = 3m + 1 and b = 3n. (If a ≡ 2 (mod 3) replace α with its associate −α; this will not change the value of the cubic characters.) Then

( ω α ) 3 = ω 1 − a − b 3 = ω − m − n , ( 1 − ω α ) 3 = ω a − 1 3 = ω m , ( 3 α ) 3 = ω b 3 = ω n .