Chebyshev polynomials and a refinement of the local residue/non-residue structure at a prime
Abstract
The basic power function tn(x)=xn is in some sense a classical limit for large x, of the monictised Chebyshev polynomial of the first kind Tn(x)/2n-1. A theorem of Ritt says they are the only two families of polynomials pn(x) over C which satisfies the commutativity relation pn(pm(x))=pm(pn(x)). The commutativity tn(tm(x))=tm(tn(x)) is the reason why the RSA scheme allow also digital signature but the Diffie-Hellman key exchange protocol depends only on the commutativity. The DH scheme and many results in elementary local (at a fixed prime) multiplicative number theory is about properties of the power function tn(x) and they have natural analogue extension to Tn(x). Recently we discovered a Chebyshev version of Euler's primality criterion , which however depends on two quadratic characters εp(a)= ( a2-1p ) and δp(a)=( 2(a+1)p ). This gives rise to a local partition of (Z/pZ) \ 1 \ into 4 disjoint sets Aε δ. This can be thought of as a real refinement of the residue/non-residue as it arise from viewing Tn(x) is the "real" part of the nth power of the unit ωx=x+x2-1, namely ωxn=Tn(x)+Un-1(x)x2-1. There are obvious analogue of Chebyshev version of pseudoprimes, Wieferich primes, Lucas-Lehmer, AKS, Diffie-Hellman, cyclotomic expansions and probably others.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.