The basis for the deterministic polynomial-time algorithm for primality of Agrawal, Kayal and Saxena is (the degree one version of) the following generalization of Fermat's theorem.

Theorem

Suppose that P is a polynomial with integer coefficients, and that p is a prime number. Then
$(P(X))^p\equiv P(X^p)\ (\mod p)$.

Surely this result was known previously, but I have not been able to find a reference in the literature on the AKS algorithm (which means that the authors also did not know of a reference). Does anyone here know of one?

Furthermore, there is a converse to the lemma in the AKS paper:

Lemma

If n is a composite number, then $(X+a)^n\not \equiv X^n+a\ (\mod n)$ whenever a is coprime to n.

Again, it is easy to generalize this statement. For example, if P is a polynomial which has at least two nonzero coefficients and such that all nonzero coefficients are coprime to n, then $P(X)^n\not\equiv P(X^n)\ (\mod n)$ for composite n.

On the other hand, clearly some conditions are necessary; for example $(3X+4)^6\equiv 3X^6+4\ (\mod 6)$.

"I have not been able to find a reference in the literature on the AKS algorithm (which means that the authors also did not know of a reference)": that is a fallacious argument. There is a certain minimum background assumed in writing mathematical articles. If a result is standard, e.g. if it can be found in most textbooks, it may not be necessary to reference it. If you needed to use the fact that the ring of polynomials has no zero divisors, would you give a reference? If you didn't, would that imply that you didn't know of one?
–
Victor ProtsakAug 20 '10 at 17:03

A good point. Indeed, with a fact considered to be classical, one would not necessarily give a reference, and if a proof is given, I would usually preface it with a comment that it is well-known. And indeed, in Agrawal and Biswas's paper, they state "This identity is, in fact, a well known property of finite fields that is used in many places". I am not sure how I missed that. I clearly should have looked more carefully before asking the questions. Many thanks for the comments.
–
Lasse Rempe-GillenAug 21 '10 at 15:36

2 Answers
2

Your first theorem occurs as an easily proved statement on p. 287 of Schönemann's article Grundzüge einer allgemeinen Theorie der höhern Congruenzen, deren Modul eine reelle Primzahl ist, J. Reine Angew. Math. 31 (1846), 269--325. Schönemann was one of the first mathematicians (not counting Gauss, who eliminated the corresponding Section 8 from his Disquisitiones at the last minute; see G. Frei's article "The Unpublished Section Eight: On the Way to Function Fields over a Finite Field" in The shaping of arithmetic after C.F. Gauss's Disquisitiones Arithmeticae) who studied the arithmetic of polynomials modulo primes. It might very well occur somewhere in Galois's papers, but it surely was considered to be essentially trivial by all of them.

This lemma also has a habit of showing up in various proofs of the irreducibility of the cyclotomic equation.

Thanks - yes, I know how to prove it. Thank you for the reference to the Frobenius endomorphism, which is a term I wasn't familiar with and which should make a literature search easier. Do you know when this was first observed, either in general for commutative rings of characteristic p or for polynomial rings?
–
Lasse Rempe-GillenJul 28 '10 at 22:20

I don't have any precise historical data on this but since one of the proofs of Fermat's theorem (for integers) is based on that observation, one that Fermat himself could have made, I suspect it's very old indeed. The term "Frobenius endomorphism" is too recent to reflect this (but the term is used in more advanced contexts).
–
lhfJul 28 '10 at 22:35

Yes, that's what I suspected as well - the result looks so classical that one would think it should have been noted somewhere for polynomials before even the terminology existed to state it for rings. Do you know where and why the term "Frobenius endomorphism" was first used?
–
Lasse Rempe-GillenJul 29 '10 at 9:27