quadratic reciprocity law
Generated by GPT-5-miniExpansion Funnel Raw 43 → Dedup 9 → NER 4 → Enqueued 4
| quadratic reciprocity law | |
|---|---|
| Name | Quadratic reciprocity law |
| Field | Number theory |
| Discovered | 18th century |
| Discoverer | Carl Friedrich Gauss (credited) |
| Notable contributors | Leonhard Euler, Adrien-Marie Legendre, Peter Gustav Lejeune Dirichlet, Ernst Kummer, Richard Dedekind, Helmut Hasse |
| Related concepts | Legendre symbol, Hilbert symbol, Gauss sum, Dirichlet character, class field theory |
quadratic reciprocity law
The quadratic reciprocity law is a central theorem in number theory that gives a criterion to determine whether an integer is a quadratic residue modulo an odd prime. It links residue properties between pairs of distinct odd primes and underlies deep connections among congruences, cyclotomy, and algebraic number fields. The law influenced the development of algebraic number theory and inspired work by major figures including Pierre de Fermat, Leonhard Euler, and Carl Friedrich Gauss.
Statement
Let p and q be distinct odd primes. Using the Legendre symbol (a multiplicative character modulo p or q), the quadratic reciprocity law asserts a reciprocity relation between (p/q) and (q/p). In its classical form, for p ≠ q odd primes, - if p ≡ 1 (mod 4) or q ≡ 1 (mod 4), the relation is symmetric, and - if p ≡ q ≡ 3 (mod 4), the relation acquires a sign change. More precisely, the law states (p/q)(q/p) = (−1)^{((p−1)/2)((q−1)/2)}. This statement connects to other classical results such as the Supplement to the Law of Quadratic Reciprocity which describe values for (−1/p) and (2/p) in terms of congruence classes modulo small integers, often attributed to Euler and Gauss.
Historical development
Work on reciprocity traces to questions raised by Pierre de Fermat and systematic investigations by Leonhard Euler in the 18th century. Adrien-Marie Legendre formulated an early precise version and attempted a proof, while Carl Friedrich Gauss provided the first rigorous proof and later multiple proofs across editions of his Disquisitiones Arithmeticae. Gauss’s contributions were recognized by contemporaries such as Joseph-Louis Lagrange and later scholars including Peter Gustav Lejeune Dirichlet and Richard Dedekind. Subsequent 19th-century advances by Ernst Kummer and Leopold Kronecker expanded reciprocity concepts, culminating in general reciprocity frameworks in the work of Helmut Hasse and the formulation of class field theory by Emil Artin and John Tate.
Proofs and methods
Gauss famously produced several distinct proofs; types of proofs include elementary manipulations of congruences, combinatorial arguments, and analytic or algebraic approaches. Elementary proofs often use properties of the Legendre symbol, quadratic Gauss sums, and counting lattice points in rectangles. Algebraic proofs employ results from cyclotomic fields and the arithmetic of Gaussian integers; these relate the law to factorization in extensions such as Q(√−1) and Q(√p). Analytic and character-theoretic proofs use Dirichlet characters and properties of L-series studied by Peter Gustav Lejeune Dirichlet and Bernhard Riemann. Later viewpoints recast reciprocity in terms of the Hilbert symbol and local-global principles developed by Helmut Hasse.
Generalizations and extensions
Quadratic reciprocity admits broad generalizations. Higher-power reciprocity laws extend the criterion to k-th power residues, developed by Leopold Kronecker, Ernst Kummer, and formalized by Richard Dedekind and Emil Artin as the Artin reciprocity law in class field theory. The Hilbert reciprocity law unifies local reciprocity statements across completions like Q_p and R, culminating in the global product formula for the Hilbert symbol. Other extensions include cubic and biquadratic reciprocity, reciprocity in function fields over finite fields studied by André Weil, and explicit reciprocity laws in the setting of Galois cohomology formulated by John Tate and Jean-Pierre Serre.
Applications and examples
Quadratic reciprocity provides practical tests for solvability of quadratic congruences and underpins classical results about primes representable by binary quadratic forms, connecting to Fermat's theorem on sums of two squares and the theory of binary quadratic forms developed by Gauss. It is used in explicit determination of splitting behavior of primes in quadratic extensions such as Q(√d), giving criteria for decomposition, ramification, and inertia. Examples include determining whether an integer is a square modulo primes like 7 or 11, and characterizing primes p for which −1 or 2 is a quadratic residue, using congruence classes modulo 4 or 8 respectively, classical observations by Euler and Legendre.
Computational aspects and algorithms
Effective computation of Legendre and Jacobi symbols leverages quadratic reciprocity to evaluate residue status efficiently, forming the basis of fast algorithms in computational number theory and cryptography. The repeated use of reciprocity combined with modular arithmetic yields logarithmic-time algorithms for symbol evaluation, implemented in libraries used in primality testing algorithms like those by Gary Miller and Carl Pomerance, and in protocols relying on quadratic residue properties such as variants of the Quadratic Residuosity Problem studied by Oded Goldreich. Algorithms also exploit reciprocity for factorization heuristics and for computing square roots modulo primes, integrating with arithmetic in finite fields and algorithms attributed to Shanks and Tonelli.