Blog Archive

Saturday, November 2, 2024

The Law of Quadratic Reciprocity

This blog is a polish of:

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

https://marco-yuze-zheng.blogspot.com/2024/03/legendre-symbol-exact-sequence-point-of.html

We know that from Cayley's theorem, we have a injective homomorphism i:GAutSet(G)​.

Lemma 1. Let n be an even number, then there is an unique surjetive group homomorphism f:Z/nZZ/2Z.

Proof. It follows from the ideal (2) is the only possible kernel.

Notice that FpZ/(p1)Z, we have following diagram commute.

image-20241102113927678

Thus we have (qp)=sgn(q)​.

The Law of Quadratic Reciprocity

Now consider τ:Z/pqZZ/pZ×Z/qZ and λ,α:Z/pZ×Z/qZZ/pZ×Z/qZ

(1)τ(x)=(x,x),λ(a,b)=(a,a+pb),α(a,b)=(qa+b,b)

Now define the permutation φ:Z/pqZZ/pqZ by φ(a+pb)=qa+b

The key point is

(2)𝜑=𝜏1𝛼𝜆1𝜏

Hence

(3)sgn(φ)=sgn(α)sgn(λ)

Also,

(4)sgn(α)=(qp),sgn(β)=(pq)

Since actually α is acting on Z/pZ, and equal to composition of fq:xqx and gb:xx+b.

But sgn(gb)=sgn(g1b)=sgn(g1)b. But g1=(0,1,2,3,...,p1) hence sgn(g1)=1.

Hence sgn(α)=sgn(fq)=(qp), similarly, sgn(β)=(pq).

Hence

(5)sgn(φ)=(qp)(pq)

Now let us compute sgn(φ), i.e. we need to count the number of the inversions.

(6)a1+pb1<a2+pb2qa2+b2<qa1+b1a1a2<p(b2b1)<pq(a1a2)

Hence a1a2>0,a1>a2, and this force that b2>b1 is the condition of inversions.

Hence the number of inversions are (p2)(q2)​, this shows that

(7)sgn(φ)=(1)(p2)(q2)=(1)p(p1)q(q1)4=(1)(p1)(q1)4=(qp)(pq)

 

 

 

No comments:

Post a Comment

Popular Posts