|
|
| Line 1: |
Line 1: |
| In [[number theory]], '''quadratic Gauss sums''' are certain finite sums of roots of unity. A quadratic Gauss sum can be interpreted as a linear combination of the values of the complex [[exponential function]] with coefficients given by a quadratic character; for a general character, one obtains a more general [[Gauss sum]]. These objects are named after [[Carl Friedrich Gauss]], who studied them extensively and applied them to [[quadratic reciprocity|quadratic]], [[cubic reciprocity|cubic]], and [[biquadratic reciprocity|biquadratic]] reciprocity laws.
| | Hi there, I am Andrew Berryhill. Kentucky is exactly where I've usually been residing. To play lacross is some thing I truly appreciate doing. Invoicing is what I do.<br><br>My web-site - [http://www.xn--pappasker-57a.se/erx87 love psychic] |
| | |
| == Definition ==
| |
| | |
| Let ''p'' be an odd [[prime number]] and ''a'' an integer. Then the '''Gauss sum''' mod ''p'', ''g''(''a'';''p''), is the following sum of the ''p''th [[root of unity|roots of unity]]:
| |
| | |
| : <math> g(a;p) =\sum_{n=0}^{p-1}e^{2{\pi}ian^2/p}=\sum_{n=0}^{p-1}\zeta_p^{an^2},
| |
| \quad \zeta_p=e^{2{\pi}i/p}. </math>
| |
| | |
| If ''a'' is not divisible by ''p'', an alternative expression for the Gauss sum (with the same value) is
| |
| | |
| : <math>G(a,\chi)=\sum_{n=1}^{p-1}\left(\frac{n}{p}\right)e^{2{\pi}ian/p}. </math>
| |
| | |
| Here <math>\chi(n)=\left(\frac{n}{p}\right)</math> is the [[Legendre symbol]], which is a quadratic character mod ''p''. An analogous formula with a general character ''χ'' in place of the Legendre symbol defines the [[Gauss sum]] ''G''(''χ'').
| |
| | |
| === Properties ===
| |
| | |
| * The value of the Gauss sum is an [[algebraic integer]] in the ''p''th [[cyclotomic field]] '''Q'''(''ζ''<sub>''p''</sub>).
| |
| | |
| * The evaluation of the Gauss sum can be reduced to the case ''a'' = 1:
| |
| | |
| : <math> g(a;p)=\left(\frac{a}{p}\right)g(1;p). </math>
| |
| | |
| * The exact value of the Gauss sum, computed by Gauss, is given by the formula
| |
| | |
| :: <math> g(1;p) =\sum_{n=0}^{p-1}e^{2{\pi}in^2/p}=
| |
| \begin{cases}
| |
| \sqrt{p} & p\equiv 1\mod 4 \\ i\sqrt{p} & p\equiv 3\mod 4
| |
| \end{cases}.</math>
| |
| : The fact that <math>g(a;p)^2=\left(\frac{-1}{p}\right)p</math> was easy to prove and led to one of Gauss's [[proofs of quadratic reciprocity]]. However, the determination of the ''sign'' of the Gauss sum turned out to be considerably more difficult: Gauss could only establish it after several years' work. Later, [[Peter Gustav Lejeune Dirichlet]], [[Leopold Kronecker]], [[Issai Schur]] and other mathematicians found different proofs.
| |
| | |
| == Generalized quadratic Gauss sums ==
| |
| | |
| Let ''a'',''b'',''c'' be [[natural numbers]]. The '''generalized Gauss sum''' ''G''(''a'',''b'',''c'') is defined by
| |
| | |
| :<math>G(a,b,c)=\sum_{n=0}^{c-1} e\left(\frac{a n^2+bn}{c}\right),</math>
| |
| | |
| where ''e''(''x'') is the exponential function exp(2πi''x''). The classical Gauss sum is the sum <math>G(a,c)=G(a,0,c)</math>. | |
| | |
| === Properties ===
| |
| | |
| *The Gauss sum ''G''(''a'',''b'',''c'') depends only on the [[residue class]] of ''a'',''b'' modulo ''c''.
| |
| | |
| *Gauss sums are [[multiplicative function|multiplicative]], i.e. given natural numbers ''a'', ''b'', ''c'' and ''d'' with [[greatest common divisor|gcd]](''c'',''d'') =1 one has
| |
| | |
| :''G''(''a'',''b'',''cd'')=''G''(''ac'',''b'',''d'')''G''(''ad'',''b'',''c'').
| |
| | |
| This is a direct consequence of the [[Chinese remainder theorem]].
| |
| | |
| *One has ''G''(''a'',''b'',''c'')=''0'' if gcd(''a'',''c'')>1 except if gcd(''a'',''c'') divides ''b'' in which case one has
| |
| :<math>
| |
| G(a,b,c)= \gcd(a,c) \cdot G\left(\frac{a}{\gcd(a,c)},\frac{b}{\gcd(a,c)},\frac{c}{\gcd(a,c)}\right)
| |
| </math> | |
| | |
| Thus in the evaluation of quadratic Gauss sums one may always assume gcd(''a'',''c'')=''1''.
| |
| | |
| *Let ''a'',''b'' and ''c'' be integers with <math>ac\neq 0</math> and ''ac+b'' even. One has the following analogue of the [[quadratic reciprocity]] law for (even more general) Gauss sums
| |
| :<math>
| |
| \sum_{n=0}^{|c|-1} e^{\pi i (a n^2+bn)/c} = |c/a|^{1/2} e^{\pi i (|ac|-b^2)/(4ac)} \sum_{n=0}^{|a|-1} e^{-\pi i (c n^2+b n)/a}.
| |
| </math>
| |
| | |
| *Define <math> \varepsilon_m = \begin{cases} 1 & m\equiv 1\mod 4 \\ i & m\equiv 3\mod 4 \end{cases}</math> for every odd integer ''m''.
| |
| | |
| The values of Gauss sums with ''b=0'' and gcd(''a'',''c'')=''1'' are explicitly given by
| |
| | |
| :<math>
| |
| G(a,c) = G(a,0,c) = \begin{cases} 0 & c\equiv 2\mod 4 \\ \varepsilon_c \sqrt{c} \left(\frac{a}{c}\right) & c\ \text{odd} \\
| |
| (1+i) \varepsilon_a^{-1} \sqrt{c} \left(\frac{c}{a}\right) & a\ \text{odd}, 4\mid c.\end{cases}
| |
| </math>
| |
| | |
| Here <math> \left(\frac{a}{c}\right)</math> is the [[Jacobi symbol]]. This is the famous formula of [[Carl Friedrich Gauß]].
| |
| | |
| * For ''b''>''0'' the Gauss sums can easily be computed by [[completing the square]] in most cases. This fails however in some cases (for example ''c'' even and ''b'' odd) which can be computed relatively easy by other means. For example if ''c'' is odd and gcd(''a'',''c'')=''1'' one has
| |
| | |
| :<math> | |
| G(a,b,c) = \varepsilon_c \sqrt{c} \cdot \left(\frac{a}{c}\right) e^{-2\pi i \psi(a) b^2/c}
| |
| </math>
| |
| | |
| where <math>\psi(a) </math> is some number with <math>4\psi(a)a \equiv 1\ \text{mod}\ c </math>. As another example, if ''4'' divides ''c'' and ''b'' is odd and as always gcd(''a'',''c'')=''1'' then ''G''(''a'',''b'',''c'')=''0''. This can, for example, be proven as follows: Because of the multiplicative property of Gauss sums we only have to show that <math> G(a,b,2^n)=0 </math> if ''n''>''1'' and ''a,b'' are odd with gcd(''a'',''c'')=1. If ''b'' is odd then <math> a n^2+bn</math> is even for all <math> 0\leq n < c-1 </math>. By [[Hensel's lemma]], for every ''q'', the equation <math> an^2+bn+q=0 </math> has at most two solutions in <math> \mathbb{Z}/2^n \mathbb{Z} </math>. Because of a counting argument <math> an^2+bn</math> runs through all even residue classes modulo ''c'' exactly two times. The [[geometric sum]] formula then shows that <math> G(a,b,2^n)=0 </math>.
| |
| | |
| *If ''c'' is odd and [[Square-free integer|squarefree]] and gcd(''a'',''c'')=''1'' then
| |
| | |
| :<math>
| |
| G(a,0,c) = \sum_{n=0}^{c-1} \left(\frac{n}{c}\right) e^{2\pi i a n/c}.
| |
| </math>
| |
| | |
| If ''c'' is not squarefree then the right side vanishes while the left side does not. Often the right sum is also called a quadratic Gauss sum.
| |
| | |
| *Another useful formula is
| |
| | |
| :''G''(''n'',''p<sup>k</sup>'')=''pG''(''n'',''p''<sup>''k''-2</sup>)
| |
| | |
| if ''k''≥2 and ''p'' is an odd prime number or if ''k''≥4 and ''p''=2.
| |
| | |
| ==See also==
| |
| | |
| *[[Gaussian period]]
| |
| *[[Kummer sum]]
| |
| *[[Landsberg-Schaar relation]]
| |
| | |
| ==References==
| |
| | |
| *{{cite book | author = Ireland and Rosen | title = A Classical Introduction to Modern Number Theory | publisher = Springer-Verlag | year = 1990 | isbn=0-387-97329-X }}
| |
| *{{cite book | author = Bruce C. Berndt, Ronald J. Evans and Kenneth S. Williams | title = Gauss and Jacobi Sums | publisher = Wiley and Sons, Inc. | year = 1998 | isbn=0-471-12807-4 }}
| |
| | |
| *{{cite book | author = Henryk Iwaniec, Emmanuel Kowalski | title = Analytic number theory | publisher = American Mathematical Society | year = 2004 | isbn=0-8218-3633-1}}
| |
| | |
| [[Category:Cyclotomic fields]]
| |
Hi there, I am Andrew Berryhill. Kentucky is exactly where I've usually been residing. To play lacross is some thing I truly appreciate doing. Invoicing is what I do.
My web-site - love psychic