Zolotarev's lemma

Zolotarev's lemma

In mathematics, Zolotarev's lemma in number theory states that the Legendre symbol

:left(frac{a}{p} ight)

for an integer "a" "modulo" a prime number "p", can be computed as

:ε(π"a")

where ε denotes the signature of a permutation and π"a" the permutation of the residue classes mod "p" induced by modular multiplication by "a", provided "p" does not divide "a".

Proof

In general, for any finite group "G" of order "n", it is easy to determine the signature of the permutation π"g" made by left-multiplication by the element "g" of "G". The permutation π"g" will be even, unless there are an odd number of orbits of even size. Assuming "n" even, therefore, the condition for π"g" to be an odd permutation, when "g" has order "k", is that "n"/"k" should be odd, or that the subgroup <"g"> generated by "g" should have odd index.

On the other hand, the condition to be an quadratic non-residue is to be an odd power of a primitive root modulo p. The "j"th power of a primitive root, because the multiplicative group modulo "p" is a cyclic group, will by index calculus have index the hcf

:"i" = ("j", "p" − 1).

The lemma therefore comes down to saying that "i" is odd when "j" is odd, which is true "a fortiori", and "j" is odd when "i" is odd, which is true because "p" − 1 is even (unless "p" = 2 which is a trivial case).

Another proof

Zolotarev's lemma can be deduced easily from Gauss's lemma and "vice versa". The example:left(frac{3}{11} ight),i.e. the Legendre symbol ("a/p") with "a"=3 and "p"=11, will illustrate how the proof goes. Start with the set {1,2,...,"p"-1} arranged as a matrix of two rows such that the sum of the two elements in any column is zero mod "p", say:Finally, apply a permutation W which gets back the original matrix:We have "W -1=VU". Zolotarev's lemma says ("a/p")=1 iff the permutation "U" is even. Gauss's lemma says ("a/p")=1 iff "V" is even. But "W" is even, so the two lemmas are equivalent for the given (but arbitrary) "a" and "p".

History

This lemma was introduced by Yegor Ivanovich Zolotarev in an 1872 proof of quadratic reciprocity.

See also: Gauss's lemma.

References

*E. Zolotarev, "Nouvelle démonstration de la loi de réciprocité de Legendre", Nouv. Ann. Math (2), 11 (1872), 354-362

External links

* [http://planetmath.org/?op=getobj&from=objects&id=4043 PlanetMath article] on Zolotarev's lemma; includes his proof of quadratic reciprocity


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Yegor Ivanovich Zolotarev — Yegor (Egor) Ivanovich Zolotarev ( ru. Егор Иванович Золотарёв) (March 31, 1847 – July 19, 1878) was a Russian mathematician. Yegor was born as a son of Agafya IzotovnaZolotareva and the merchant Ivan Vasilevich Zolotarev in Saint Petersburg,… …   Wikipedia

  • Lemme de Zolotarev — En mathématiques, le lemme de Zolotarev est un résultat d arithmétique modulaire équivalent au lemme de Gauss et introduit par Yegor Ivanovich Zolotarev (en) en 1872 pour redémontrer la loi de réciprocité quadratique. Il énonce que pour tout …   Wikipédia en Français

  • Gauss's lemma (number theory) — This article is about Gauss s lemma in number theory. Gauss s lemma (polynomial) concerns factoring polynomials. Gauss s lemma in number theory gives a condition for an integer to be a quadratic residue. Although it is not useful computationally …   Wikipedia

  • List of lemmas — This following is a list of lemmas (or, lemmata , i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list of axioms, list of theorems and list of conjectures. 0 to 9 *0/1 Sorting Lemma ( comparison… …   Wikipedia

  • List of mathematics articles (Z) — NOTOC Z Z channel (information theory) Z factor Z function Z group Z matrix (mathematics) Z notation Z order (curve) Z test Z transform Z* theorem Zadoff–Chu sequence Zahorski theorem Zakai equation Zakharov–Schulman system Zakharov system ZAMM… …   Wikipedia

  • Proofs of quadratic reciprocity — In the mathematical field of number theory, the law of quadratic reciprocity, like the Pythagorean theorem, has lent itself to an unusual number of proofs. Several hundred proofs of the law of quadratic reciprocity have been found.Proofs that are …   Wikipedia

  • Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

  • Even and odd permutations — In mathematics, the permutations of a finite set (i.e. the bijective mappings from the set to itself) fall into two classes of equal size: the even permutations and the odd permutations. The parity (oddness or evenness) of a permutation sigma of… …   Wikipedia

  • Parity of a permutation — Permutations of 4 elements Odd permutations have a green or orange background. The numbers in the right column are the inversion numbers (sequence …   Wikipedia

  • Liste de lemmes (mathématiques) — Liste de lemmes mathématiques par ordre alphabétique. En mathématiques, un lemme est un énoncé prouvé, mais jugé moins important que ce qu on appelle un théorème, qu il sert généralement à établir au cours d une démonstration. Néanmoins cette… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”