*In which we prove the law of quadratic reciprocity and generalise the Legendre symbol.*

- Theorem 25 (Law of quadratic reciprocity):
*Let and be odd primes. Then . That is, if then , and if not then .*We proved this using Gauss‘s lemma (which we saw in Lecture 7), interpreting the quantities that arise in that lemma as counting lattice points in certain regions of the plane. - Exercise:
*Let and be odd primes, and let be an integer. Show that if there is an integer such that or , then .* - Definition:
*Jacobi symbol*for an integer and an odd natural number . We noted the important point that does not mean that is a quadratic residue modulo . (Find your own examples to be clear about this.) - Lemma 26:
*The Jacobi symbol is totally multiplicative: for any integers , and any odd natural number , we have . We also have for any integer and odd natural numbers and .*The former follows from the definition of the Jacobi symbol and the multiplicative property of the Legendre symbol (which we saw in Lecture 6), and the latter from the definition of the Jacobi symbol. - Lemma 27:
*Let be an odd natural number. Then and .*These are the direct analogues of Corollary 22 and Corollary 24, and follow from them. - Theorem 28 (Quadratic reciprocity for the Jacobi symbol):
*Let and be odd natural numbers. Then .*Note that by stating it in this way we have a result that is true even if and are not coprime. If you prefer to state it another way, then you may need to be more careful. Please try to prove this for yourself before next time; I’ll start the next lecture with a proof.

These results make it relatively straightforward to compute Legendre symbols and Jacobi symbols; try some examples for yourself to get a feel for the types of calculation involved.

#### Further reading

The exercise above is to deduce a result from the law of quadratic reciprocity. I encourage you to try to prove the result directly from Gauss’s lemma, and then to deduce the law of quadratic reciprocity from the result. This is the approach that Davenport (*The Higher Arithmetic*) describes, and that Gareth Taylor has summarised in these online notes. Baker (*A concise introduction to the theory of numbers*) and Jones and Jones (*Elementary Number Theory*) both give the lattice-point proof of quadratic reciprocity that we saw in lectures.

I see that there is also a CATAM project that invites you to explore some of the computational questions arising from the study of quadratic (and other polynomial) congruences — that would be a particularly interesting thing to investigate now that you’ve seen some of the theory.

#### Preparation for Lecture 9

Next time, once we’ve proved quadratic reciprocity for the Jacobi symbol, we’ll move on to something slightly different: binary quadratic forms. These are objects of the form , where the coefficients , and are integers (and we think of and as integer variables). We are going to be interested in questions to do with which numbers can be represented by such forms (that is, as and range over the integers, which values do we get from ?). Here are some questions that you could usefully try yourself before the lecture.

- Which numbers are represented by the form ?
- Which numbers are represented by the form ? (That is, which numbers can be written as a sum of two squares?)
- What about other forms? Try your own example(s).
- When do two forms represent the same set of numbers? For example, can you find any forms that give the same set of numbers as the form , or the same set of the numbers as the form ?
- What is the link between binary quadratic forms and integer matrices with determinant 1 (that is, elements of )?

## Leave a Reply