[Paper Review] A remark on Zoloterav's theorem

Hao Pan|ArXiv.org|Jan 2, 2006

Advanced Algebra and Geometry5 references3 citations

TL;DR

This paper establishes a refinement of Zolotarev’s theorem by determining the sign of a specific permutation γₐ,ₙ on the set {1, ..., (n−1)/2}, defined via modular multiplication and residue adjustment. It proves that the sign equals the Jacobi symbol (a/n) when n ≡ 1 (mod 4), and 1 when n ≡ 3 (mod 4), using properties of floor functions and fractional parts to compute the number of inversions modulo 2.

ABSTRACT

Let n>=3 be an odd integer. For any integer a prime to n, define the permutation gamma_{a,n} of {1,...,(n-1)/2} by gamma_{a,n}(x)=n-\dec{ax}_n if {ax}_n>=(n+1)/2, and {ax}_n if {ax}_n<=(n-1)/2, where {x}_n denotes the least nonnegative residue of x modulo n. In this note, we show that the sign of gamma_{a,n} coincides with the Jacobi symbol (a/n) if n=1 mod 4, and 1 if n=3 mod 4.

Motivation & Objective

• To determine the sign of a specific permutation γₐ,ₙ defined on the set {1, ..., (n−1)/2} via modular multiplication and residue adjustment.
• To refine Zolotarev’s theorem by characterizing the sign of γₐ,ₙ for odd integers n ≥ 3, depending on the value of n modulo 4.
• To establish a connection between the sign of γₐ,ₙ and the Jacobi symbol (a/n), extending Gauss’s lemma to composite moduli.
• To compute the number of inversions I(a,n) in γₐ,ₙ modulo 2 using floor and fractional part functions.
• To prove that the sign of γₐ,ₙ is a real even Dirichlet character modulo n, consistent with the Jacobi symbol when n ≡ 1 (mod 4).

Proposed method

• Define γₐ,ₙ as a permutation on {1, ..., (n−1)/2} that maps x to n − {ax}ₙ if {ax}ₙ ≥ (n+1)/2, and to {ax}ₙ otherwise.
• Express the number of inversions I(a,n) in γₐ,ₙ using floor functions and fractional parts: I(a,n) ≡ ∑ₖ₌₁^{(n−1)/2} ⌊ak/n⌋ + ⌊2ak/n⌋ − ⌊ak/n⌋ mod 2.
• Use the identity ⌊ak/n⌋ − ⌊al/n⌋ − ⌊a(k−l)/n⌋ = 1 if {ak}ₙ < {al}ₙ, and 0 otherwise, to analyze inversion structure.
• Apply the identity ⌊a(k+l)/n⌋ − ⌊ak/n⌋ − ⌊al/n⌋ = 1 if {ak}ₙ + {al}ₙ > n, and 0 otherwise, to decompose the inversion count.
• Reduce the inversion count modulo 2 using known identities involving ∑ ⌊2ak/n⌋ and ∑ ⌊ak/n⌋, and simplify using (n²−1)/8 mod 2.
• Leverage the fact that (−1)^{(n²−1)/8} = (2/n) to resolve the sign in the case n ≡ 3 (mod 4), leading to the result sign(γₐ,ₙ) = 1.

Experimental results

Research questions

• RQ1 What is the sign of the permutation γₐ,ₙ defined on {1, ..., (n−1)/2} via modular multiplication and residue adjustment?
• RQ2 How does the sign of γₐ,ₙ relate to the Jacobi symbol (a/n) when n ≡ 1 (mod 4)?
• RQ3 Why does the sign of γₐ,ₙ equal 1 when n ≡ 3 (mod 4), regardless of a?
• RQ4 Can the number of inversions in γₐ,ₙ be computed modulo 2 using floor and fractional part functions?
• RQ5 Does the sign of γₐ,ₙ form a real even Dirichlet character modulo n, and how does it relate to Zolotarev’s theorem?

Key findings

• The sign of the permutation γₐ,ₙ equals the Jacobi symbol (a/n) when n ≡ 1 (mod 4).
• When n ≡ 3 (mod 4), the sign of γₐ,ₙ is identically 1 for all a coprime to n.
• The number of inversions I(a,n) in γₐ,ₙ satisfies I(a,n) ≡ ∑ₖ₌₁^{(n−1)/2} ⌊ak/n⌋ + ⌊2ak/n⌋ + (a−1)(n²−1)/8 mod 2.
• The result is derived using identities involving floor functions of fractional parts of ak/n and 2ak/n.
• The proof relies on modular arithmetic identities and properties of the Jacobi symbol, particularly (2/n) = (−1)^{(n²−1)/8}.
• The sign of γₐ,ₙ is consistent with being a real even Dirichlet character modulo n, and aligns with Zolotarev’s theorem for composite n.