Chowla–Mordell theorem

From HandWiki
Short description: When a Gauss sum is the square root of a prime number, multiplied by a root of unity

In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic. It is a result in number theory determining cases where a Gauss sum is the square root of a prime number, multiplied by a root of unity. It was proved and published independently by Sarvadaman Chowla and Louis Mordell, around 1951.

Statement

If p is a prime number, χ a nontrivial Dirichlet character modulo p, and

G(χ)=∑χ(a)ζa

where ζ is a primitive p-th root of unity in the complex numbers, then

G(χ)|G(χ)|

is a root of unity if and only if χ is the quadratic residue symbol modulo p. The 'if' part was known to Gauss: the contribution of Chowla and Mordell was the 'only if' direction. The ratio in the theorem occurs in the functional equation of L-functions.[1][2][3]

See also

References

  1. ↑ Berndt, Bruce C.; Evans, Ronald J.; Williams, Kenneth S. (1998). Gauss and Jacobi Sums. Wiley-Interscience. p. 53. ISBN 9780471128076. 
  2. ↑ Funakura, Takeo (1992). "A Generalization of the Chowla-Mordell Theorem on Gaussian Sums". Bulletin of the London Mathematical Society 24 (5): 424–430. doi:10.1112/blms/24.5.424. 
  3. ↑ Chowla, S. (1962). "On Gaussian sums". Proceedings of the National Academy of Sciences 48 (7): 1127–1128. 


fi:Chowlan–Mordellin lause